✳flâneur — a map of the web's best reading

Kolmogorov–Arnold representation theorem - Wikipedia

en.wikipedia.org · 4,606 words · saved by 2 readers

In real analysis and approximation theory, the Kolmogorov–Arnold representation theorem (or superposition theorem) states that every multivariate continuous function 𝑓 : [ 0 , 1 ] 𝑛 → 𝑅 can be represented as a superposition of continuous single-variable functions. The works of Vladimir Arnold and Andrey Kolmogorov established that if f is a multivariate continuous function, then f can be written as a finite composition of continuous functions of a single variable and the binary operation of addition.[1] More specifically, where 𝜙 𝑞 , 𝑝 : [ 0 , 1 ] → 𝑅 and Φ 𝑞 : 𝑅 → 𝑅 . There are proofs with specific constructions.[2] It solved a more constrained form of Hilbert's thirteenth problem, so the original Hilbert's thirteenth problem is a corollary.[3][4][5] In a sense, they showed that the only true continuous multivariate function is the sum, since every other continuous function can be written using univariate continuous functions and summing.[6]: 180 The Kolmogorov–Arnold r

Kolmogorov–Arnold representation theorem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Multivariate functions can be written using univariate functions and summing In real analysis and approximation theory , the Kolmogorov–Arnold representation theorem (or superposition theorem ) states that every multivariate continuous function f : [ 0 , 1 ] n → R {\displaystyle f\colon [0,1]^{n}\to \mathbb {R} } can be represented as a superposition of continuous single-variable functions. The works of Vladimir Arnold and Andrey Kolmogorov established that if f is a multiva

Explore this link on the map →

saved by

related reading