Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 n≥1 and let σ∈C∞(R) be globally Lipschitz and not a polynomial. For a compact set K⊂Rn, let Nσ,n(K) be the restrictions to K of functions x⟼c0+∑j=1Jcjσ(aj⋅x+bj), where J≥0, c0,cj,bj∈R and aj∈Rn. Then Nσ,n(K) is uniformly dense in C(K,R).

Facts & Assumptions

Given: n≥1, a compact K⊂Rn, and a globally Lipschitz, smooth nonpolynomial activation σ.

[L1]

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.

1.1givenchoosealgebra

Fix an integer m≥1 and a∈Rn. Since σ is not a polynomial, σ(m) is not identically zero; choose bm with σ(m)(bm)≠0. For h≠0 define Rm,h(x):=1σ(m)(bm)hm∑j=0m(−1)m−j(mj)σ(bm+jh(a⋅x)). This is a finite linear combination of permitted units. The repeated-integral formula for the mth forward difference gives Rm,h(x)=(a⋅x)mσ(m)(bm)∫[0,1]mσ(m)(bm+h(a⋅x)(t1+⋯+tm)) dt. Because a⋅x is bounded on compact K and σ(m) is uniformly continuous on a compact interval around bm, Rm,h→(a⋅x)m uniformly on K as h→0.

2.1step 1.1algebra

For m≥1 and arbitrary real x1,…,xm, the polarization identity x1⋯xm=12mm!∑ϵ∈{−1,1}m(∏j=1mϵj)(∑j=1mϵjxj)m expresses each monomial of total degree m in n 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 c0. Hence every real polynomial restricted to K belongs to that closure.

3.1L1step 2.1given∎

The restrictions of real polynomials to K 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 C(K,R). The network closure contains them by step 2.1 and is therefore all of C(K,R).

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