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.
Single-hidden-layer universal approximation
Statement
Assume Countable Choice. Fix and use the finite scalar single-hidden-layer family
For every compact , if is not equal almost everywhere to a polynomial, then is uniformly dense in . More generally, if is not polynomial almost everywhere, this family is dense for the essential-supremum seminorm on each such with respect to -dimensional Lebesgue measure. If instead agrees almost everywhere with a polynomial of degree at most for some (including the zero polynomial), the family is not uniformly dense on the segment , and is not dense in the Lebesgue essential-supremum seminorm on . Thus pointwise compact-uniform density for , and essential-supremum density for , each hold on every compact set if and only if is not polynomial almost everywhere.
Let , and let be a finite regular Borel measure concentrated on a compact and absolutely continuous with respect to Lebesgue measure. Form the real space using the Borel -algebra. For , a network is interpreted in this space through any Borel representative agreeing with it outside a Lebesgue-null set; these representatives exist, are integrable on , and give a unique class. This convention does not alter the actual pointwise network used in the uniform clause. For and , is dense in if and only if is not polynomial almost everywhere. If , then and the network family is dense for every , including polynomial activations.
These are existence statements without a quantitative width bound. They imply neither trainability nor statistical generalization, and compact-uniform approximation does not mean uniform approximation on all of .
Statement references
Facts & Assumptions
Given: Countable Choice, , a compact set , an activation , and—when the clause is used—a finite regular Borel measure with , and .
consists of measurable, locally essentially bounded activations whose discontinuity-set closure is null; additionally requires pointwise local boundedness (Locally essentially bounded activations with null discontinuity closure).
The network family is the scalar finite sum of affine ridge units with an output bias (Single-hidden-layer network realization).
Every nonpolynomial-almost-everywhere activation in gives pointwise compact-uniform density (Rough nonpolynomial activations are dense on compact sets).
Real-valued continuous functions restricted from are dense in real for finite regular compactly supported measures and (Continuous functions are dense in Lp for compactly supported finite measures).
Nonconstant affine pullbacks of one-dimensional null sets are -dimensional Lebesgue null (Nonconstant affine ridge pullbacks preserve Lebesgue nullity).
A nonzero real polynomial on has a Lebesgue-null zero set (The zero set of a nonzero real polynomial is Lebesgue null).
If is polynomial almost everywhere, single-hidden-layer networks fail uniform density on a compact segment (Polynomial activations have a bounded-degree obstruction).
identifies functions equal -almost everywhere, and means every Lebesgue-null set is -null (The function space for , The space as the quotient by null functions, Absolute continuity of a signed or complex measure with respect to a positive measure).
Closed bounded subsets of finite-dimensional Euclidean space are compact (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
A measure is a nonnegative countably additive set function on a sigma-algebra; since is concentrated on , countable additivity on gives (Measures on sigma-algebras).
For , the quotient has the norm induced by its integral or essential-supremum functional, and the norm satisfies the triangle inequality (The norm descends to the quotient and makes a normed space for ).
On a finite measure space, every essentially bounded function belongs to and for ; a pointwise bound on the compact set carrying implies (Finite-measure includes into for , The essential supremum of a measurable function with respect to a measure).
A continuous real-valued function on a nonempty compact metric space attains its minimum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Every Cauchy sequence of real numbers converges (The reals are complete).
Under Countable Choice, the Lebesgue measure of is (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included).
Under Countable Choice, every Lebesgue measurable subset of is an set together with an outer-null set (Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of ).
Under Countable Choice every Borel subset of is Lebesgue measurable (Assuming countable choice, every Borel subset of is Lebesgue measurable).
Under Countable Choice, for every Lebesgue measurable set of finite measure and there is a compact with (Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets).
Countable Choice means every sequence of nonempty sets has a function choosing one element from each (The Axiom of Countable Choice ()).
Proof
If is nonpolynomial almost everywhere, [F3] proves pointwise uniform density on every compact . If is polynomial almost everywhere, [F7] gives a specific compact segment on which density fails.
Now let and put , its closed null discontinuity set. Definition [F1] supplies the local essential bound and null-closure hypotheses. Define off and on . This is measurable and equals almost everywhere. For a compact interval , choose a larger compact interval containing in its interior and an essential bound for there. At any , continuity of implies : a strict violation would, by continuity, give an interval of positive measure inside on which . Thus is pointwise locally bounded; outside it is continuous, so the closure of its discontinuities is contained in . It belongs to ; if is nonpolynomial almost everywhere, so is . For any nonconstant affine form and any Lebesgue measurable , [F16] writes with an set and outer null. Then is Borel, hence Lebesgue measurable by [F17], and is measurable and null by [F5]. Thus is Lebesgue measurable, as is every finite network; constant affine forms give constant measurable units. This makes the essential-supremum seminorm in the Statement well-defined for raw networks.
For the converse, suppose almost everywhere for a polynomial of degree . By [F5] and [F8], every nonconstant unit equals for -almost every ; constant-input units can be absorbed into the output bias. Hence every network represents, in , a polynomial of total degree at most .
For any finite -network, a unit with differs from the corresponding -unit only on the null pullback , null by [F5]. Replace the output bias by to absorb the constant-input units. The resulting -network equals the -network almost everywhere in , and hence defines the same Borel class under the representative convention when . For nonpolynomial-almost-everywhere , applying [F3] to and transferring these approximants proves essential-supremum density for on every compact .
Assume and let be the vector space of real polynomials in variables of total degree at most . In a monomial basis its coefficient space is for some finite , with its Euclidean norm. Every monomial is bounded on compact , so for coefficient vectors one has , which tends to zero as . By [F12], ; the reverse triangle inequality from [F11] therefore makes continuous in the coefficients. For a nonzero coefficient vector, is a nonzero polynomial; by [F6] its zero set is Lebesgue null, hence -null by [F8]. If its norm were zero, [F11] would make its class zero, so -almost everywhere. This would give , whereas [F8] and [F10] give , a contradiction. Thus the norm is positive on the coefficient unit sphere. That sphere is nonempty and compact by [F9], and [F13] gives a minimum ; homogeneity yields . Any -Cauchy sequence in therefore has Cauchy coefficient vectors. By [F14], their finitely many coordinates converge to those of a polynomial ; the coefficient estimate above and [F12] imply convergence to in . If a class lies in the closure of , Countable Choice [A1] supplies a sequence from converging to it; the preceding argument and uniqueness of norm limits [F11] put that class in . Hence is closed in .
To justify the Borel convention, is closed, on , and is continuous on the open complement of , so is Borel measurable. For any raw -network , replace only its nonconstant units by -units and keep each constant-input value in the output bias. The resulting Borel function is bounded on by pointwise local boundedness of and compactness of each affine image. It equals outside the finite union of the closed Lebesgue-null sets with , by [F5]. Hence lies in . Any two Borel representatives of agreeing with it Lebesgue-almost everywhere differ on a Borel Lebesgue-null set, which is -null by [F8], so they define the same class. This also justifies the polynomial representatives in step 1.3 and the transfers in step 2.1 without assuming raw networks are Borel measurable.
The polynomial is not in modulo -almost-everywhere equality: for every , is a nonzero polynomial, so [F6]–[F8] imply . Thus the closed subspace is proper and cannot be dense. Step 1.3 places the whole network family inside it, proving failure of density for polynomial-almost-everywhere activations.
Suppose . By [F10], is a measure, and the real Borel convention is fixed in the Statement. To prove the positive sufficiency, choose any real class and . By [F4], choose with . Apply [F3] to on to choose a network with . By step 2.1 replace it by a -network equal -almost everywhere. Using the Borel representative supplied by steps 2.1 and 3.1, equality of classes and [F12] give . The triangle inequality [F11] yields .
If , every measurable real function represents the zero class in , and the network family contains zero by width zero and output bias zero. Thus it is dense regardless of . Together with steps 4.1 and 3.2, this proves the stated equivalence and its zero-measure boundary.
Let , which is compact by [F9], and define for Borel . By [F15], . This is a finite Borel measure concentrated on and absolutely continuous with respect to . It is regular: inner regularity follows by applying [F18] to ; for outer regularity, apply [F18] to to choose a compact with , and use the open set , for which . Thus this satisfies the theorem's measure hypotheses. If a polynomial-almost-everywhere activation gave essential-supremum approximation to every continuous target there, [F12] and would turn those approximations into approximations, contradicting step 3.2 for . This proves the essential-supremum obstruction on the cube and completes both compact-set equivalences.
Remarks
The absolute-continuity hypothesis in the equivalence is essential to this interface. Positivity of an arbitrary measure is insufficient: for , every class is specified by one real value, and the output bias alone realizes every such value even with the polynomial activation .
The broad class concerns actual representatives, including their values on the closed null discontinuity set. Its essential-supremum conclusion cannot be replaced by a pointwise supremum conclusion. On a Lebesgue-null compact set the essential-supremum seminorm is zero, so that clause makes no assertion about approximation at individual points there.
Depends on
- Absolute continuity of a signed or complex measure with respect to a positive measure
- Locally essentially bounded activations with null discontinuity closure
- The function space $\mathcal{L}^p(\mu)$ for $0 < p < \infty$
- The essential supremum of a measurable function with respect to a measure
- The space $L^\infty(\mu)$ of essentially bounded measurable functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The space $L^p(\mu)$ as the quotient by null functions
- Measures on sigma-algebras
- Single-hidden-layer network realization
- The $L^p$ norm descends to the quotient and makes $L^p$ a normed space for $1 \le p \le \infty$
- Finite-measure $L^r$ includes into $L^p$ for $p < r$
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- The reals are complete
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets
- Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of $\mathbb{R}^n$
- Assuming countable choice, every Borel subset of $\mathbb{R}^n$ is Lebesgue measurable
- Continuous functions are dense in Lp for compactly supported finite measures
- Nonconstant affine ridge pullbacks preserve Lebesgue nullity
- The zero set of a nonzero real polynomial is Lebesgue null
- Polynomial activations have a bounded-degree obstruction
- Rough nonpolynomial activations are dense on compact sets
Used by
Dependency tree · two levels
132 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, Definitions 3–5, Theorem 1, and complete proof in §6 (standard reference, not scraped)
- Kurt Hornik, Approximation Capabilities of Multilayer Feedforward Networks, Theorems 1–2 and complete proofs (standard reference, not scraped)
- Ian Goodfellow, Yoshua Bengio, and Aaron Courville, Deep Learning, §6.4.1 (standard reference, not scraped)