How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite-dimensional universal approximation by smooth nonpolynomial activations
Statement
Let and let be globally Lipschitz and not a polynomial. For a compact set , let be the restrictions to of functions where , and . Then is uniformly dense in .
Statement references
Facts & Assumptions
Given: , a compact , and a globally Lipschitz, smooth nonpolynomial activation .
Every unital point-separating real function algebra on a compact Hausdorff space is uniformly dense in its continuous real-valued functions. (Real Stone–Weierstrass theorem for compact Hausdorff spaces)
Proof
Given: The data in the statement.
Fix an integer and . Since is not a polynomial, is not identically zero; choose with . For define . This is a finite linear combination of permitted units. The repeated-integral formula for the th forward difference gives . Because is bounded on compact and is uniformly continuous on a compact interval around , uniformly on as .
For and arbitrary real , the polarization identity expresses each monomial of total degree in variables as a finite linear combination of powers of linear forms. Step 1.1 places every such power in the uniform closure of the network family, and that closure is a vector space because finite network sums are represented by concatenating their hidden units. Constants are present through . Hence every real polynomial restricted to belongs to that closure.
The restrictions of real polynomials to form a unital real function algebra and separate distinct points, since a coordinate function distinguishes any two different points. Compact subsets of Euclidean space are compact Hausdorff, so [L1] makes these polynomial restrictions uniformly dense in . The network closure contains them by step 2.1 and is therefore all of .
Depends on
Used by
Dependency tree · two levels
3 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Leshno, Lin, Pinkus and Schocken, Multilayer Feedforward Networks With a Non-Polynomial Activation Function Can Approximate Any Function (standard reference, not scraped)
- M. Xu, Math 205B notes from a course by R. Mazzeo (standard reference, not scraped)
- E. Carlen, Notes on Topology and the Stone-Weierstrass Theorem (standard reference, not scraped)