Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 d≥1 and use the finite scalar single-hidden-layer family

Nσ(d)={x↦c+∑j=1majσ(wj⋅x+bj):m∈N0, c,aj,bj∈R, wj∈Rd}.

For every compact K⊆Rd, if σ∈Mpt is not equal almost everywhere to a polynomial, then Nσ(d) is uniformly dense in C(K,R). More generally, if σ∈M is not polynomial almost everywhere, this family is dense for the essential-supremum seminorm on each such K with respect to d-dimensional Lebesgue measure. If instead σ agrees almost everywhere with a polynomial of degree at most q for some q∈N0 (including the zero polynomial), the family is not uniformly dense on the segment {te1:0≤t≤1}, and is not dense in the Lebesgue essential-supremum seminorm on [0,1]d. Thus pointwise compact-uniform density for Mpt, and essential-supremum density for M, each hold on every compact set if and only if σ is not polynomial almost everywhere.

Let 1<p<∞, and let μ be a finite regular Borel measure concentrated on a compact K⊆Rd and absolutely continuous with respect to Lebesgue measure. Form the real Lp(μ) space using the Borel σ-algebra. For σ∈M, 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 K, and give a unique Lp(μ) class. This convention does not alter the actual pointwise network used in the uniform clause. For σ∈M and μ(Rd)>0, Nσ(d) is dense in Lp(μ;R) if and only if σ is not polynomial almost everywhere. If μ=0, then Lp(μ;R)={0} and the network family is dense for every σ∈M, 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 Rd.

Facts & Assumptions

Given: Countable Choice, d≥1, a compact set K, an activation σ, and—when the Lp clause is used—a finite regular Borel measure μ with μ≪λd, and 1<p<∞.

[F1]

M consists of measurable, locally essentially bounded activations whose discontinuity-set closure is null; Mpt additionally requires pointwise local boundedness (Locally essentially bounded activations with null discontinuity closure).

[F2]

The network family is the scalar finite sum of affine ridge units with an output bias (Single-hidden-layer network realization).

[F3]

Every nonpolynomial-almost-everywhere activation in Mpt gives pointwise compact-uniform density (Rough nonpolynomial activations are dense on compact sets).

[F4]

Real-valued continuous functions restricted from Cc(Rd,R) are dense in real Lp(μ) for finite regular compactly supported measures and 1≤p<∞ (Continuous functions are dense in Lp for compactly supported finite measures).

[F5]

Nonconstant affine pullbacks of one-dimensional null sets are d-dimensional Lebesgue null (Nonconstant affine ridge pullbacks preserve Lebesgue nullity).

[F6]

A nonzero real polynomial on Rd has a Lebesgue-null zero set (The zero set of a nonzero real polynomial is Lebesgue null).

[F7]

If σ is polynomial almost everywhere, single-hidden-layer networks fail uniform density on a compact segment (Polynomial activations have a bounded-degree obstruction).

[F8]

Lp(μ) identifies functions equal μ-almost everywhere, and μ≪λd means every Lebesgue-null set is μ-null (The function space Lp(μ) for 0<p<∞, The space Lp(μ) as the quotient by null functions, Absolute continuity of a signed or complex measure with respect to a positive measure).

[F10]

A measure is a nonnegative countably additive set function on a sigma-algebra; since μ is concentrated on K, countable additivity on K⊔(Rd∖K) gives μ(Rd)=μ(K) (Measures on sigma-algebras).

[F11]

For 1≤p≤∞, the quotient Lp(μ) has the norm induced by its integral or essential-supremum functional, and the norm satisfies the triangle inequality (The Lp norm descends to the quotient and makes Lp a normed space for 1≤p≤∞).

[F12]

On a finite measure space, every essentially bounded function belongs to Lp and ∥h∥p≤μ(X)1/p∥h∥∞ for 1≤p<∞; a pointwise bound ∣h∣≤M on the compact set carrying μ implies ∥h∥∞≤M (Finite-measure Lr includes into Lp for p<r, The essential supremum of a measurable function with respect to a measure).

[F13]

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).

[F14]

Every Cauchy sequence of real numbers converges (The reals are complete).

[F16]

Under Countable Choice, every Lebesgue measurable subset of R is an Fσ set together with an outer-null set (Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn).

[F17]

Under Countable Choice every Borel subset of Rd is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[F18]

Under Countable Choice, for every Lebesgue measurable set E of finite measure and ε>0 there is a compact F⊆E with λd(E∖F)<ε (Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets).

[A1]

Countable Choice means every sequence of nonempty sets has a function choosing one element from each (The Axiom of Countable Choice (ACω)).

Proof

1.1givenF3F7

If σ∈Mpt is nonpolynomial almost everywhere, [F3] proves pointwise uniform density on every compact K. If σ is polynomial almost everywhere, [F7] gives a specific compact segment on which density fails.

1.2givenF1F5F16F17A1algebra

Now let σ∈M and put C=Dσ‾, its closed null discontinuity set. Definition [F1] supplies the local essential bound and null-closure hypotheses. Define σ~=σ off C and σ~=0 on C. This is measurable and equals σ almost everywhere. For a compact interval J, choose a larger compact interval J′ containing J in its interior and an essential bound MJ′ for σ there. At any t∈J∖C, continuity of σ implies ∣σ(t)∣≤MJ′: a strict violation would, by continuity, give an interval of positive measure inside J′ on which ∣σ∣>MJ′. Thus σ~ is pointwise locally bounded; outside C it is continuous, so the closure of its discontinuities is contained in C. It belongs to Mpt; if σ is nonpolynomial almost everywhere, so is σ~. For any nonconstant affine form T(x)=w⋅x+b and any Lebesgue measurable A⊆R, [F16] writes A=H∪W with H an Fσ set and W outer null. Then T−1(H) is Borel, hence Lebesgue measurable by [F17], and T−1(W) is measurable and null by [F5]. Thus σ∘T 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.

1.3givenF2F5F8A1algebra

For the converse, suppose σ=p0 almost everywhere for a polynomial p0 of degree q. By [F5] and [F8], every nonconstant unit equals p0(wj⋅x+bj) for μ-almost every x; constant-input units can be absorbed into the output bias. Hence every network represents, in Lp(μ), a polynomial of total degree at most q.

2.1step 1.2F3F5F8A1algebra

For any finite σ~-network, a unit with wj≠0 differs from the corresponding σ-unit only on the null pullback {x:wj⋅x+bj∈C}, null by [F5]. Replace the output bias by c+∑wj=0aj(σ~(bj)−σ(bj)) to absorb the constant-input units. The resulting σ-network equals the σ~-network almost everywhere in Rd, and hence defines the same Borel Lp(μ) class under the representative convention when μ≪λd. For nonpolynomial-almost-everywhere σ, applying [F3] to σ~ and transferring these approximants proves essential-supremum density for M on every compact K.

2.2step 1.3F6F8F9F10F11F12F13F14A1algebra

Assume μ(K)>0 and let Pq be the vector space of real polynomials in d variables of total degree at most q. In a monomial basis its coefficient space is Rs for some finite s≥1, with its Euclidean norm. Every monomial is bounded on compact K, so for coefficient vectors a,b one has sup⁡K∣Pa−Pb∣≤∑∣α∣≤q∣aα−bα∣sup⁡K∣xα∣, which tends to zero as a−b→0. By [F12], ∥Pa−Pb∥Lp(μ)≤μ(K)1/psup⁡K∣Pa−Pb∣; the reverse triangle inequality from [F11] therefore makes P↦∥P∥Lp(μ) continuous in the coefficients. For a nonzero coefficient vector, P is a nonzero polynomial; by [F6] its zero set is Lebesgue null, hence μ-null by [F8]. If its Lp norm were zero, [F11] would make its class zero, so P=0 μ-almost everywhere. This would give μ(K∖{P=0})=0, whereas [F8] and [F10] give μ(K∖{P=0})=μ(K)>0, 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 a>0; homogeneity yields ∥P∥Lp(μ)≥a∣coeff⁡(P)∣. Any Lp-Cauchy sequence in Pq therefore has Cauchy coefficient vectors. By [F14], their finitely many coordinates converge to those of a polynomial P∈Pq; the coefficient estimate above and [F12] imply convergence to P in Lp. If a class lies in the closure of Pq, Countable Choice [A1] supplies a sequence from Pq converging to it; the preceding argument and uniqueness of norm limits [F11] put that class in Pq. Hence Pq is closed in Lp(μ).

3.1step 1.2step 1.3step 2.1F2F5F8algebra

To justify the Borel convention, C is closed, σ~=0 on C, and σ~ is continuous on the open complement of C, so σ~ is Borel measurable. For any raw σ-network N, replace only its nonconstant units by σ~-units and keep each constant-input value ajσ(bj) in the output bias. The resulting Borel function N∗ is bounded on K by pointwise local boundedness of σ~ and compactness of each affine image. It equals N outside the finite union of the closed Lebesgue-null sets {x:wj⋅x+bj∈C} with wj≠0, by [F5]. Hence N∗ lies in Lp(μ). Any two Borel representatives of N 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.

3.2step 1.3step 2.2F6F8A1algebra

The polynomial r(x)=x1q+1 is not in Pq modulo μ-almost-everywhere equality: for every P∈Pq, r−P is a nonzero polynomial, so [F6]–[F8] imply μ({x∈K:r(x)=P(x)})=0<μ(K). Thus the closed subspace Pq is proper and cannot be dense. Step 1.3 places the whole network family inside it, proving failure of Lp density for polynomial-almost-everywhere activations.

4.1step 2.1step 3.1F3F4F8F10F11F12A1choosealgebra

Suppose μ(K)>0. By [F10], μ is a measure, and the real Borel Lp convention is fixed in the Statement. To prove the positive Lp sufficiency, choose any real class [f]∈Lp(μ;R) and ε>0. By [F4], choose u∈Cc(Rd,R) with ∥f−u∥Lp(μ)<ε/2. Apply [F3] to σ~ on K to choose a network Nσ~ with sup⁡x∈K∣Nσ~(x)−u(x)∣<ε/(2μ(K)1/p). 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 ∥N−u∥Lp(μ)=∥Nσ~−u∥Lp(μ)≤μ(K)1/psup⁡K∣Nσ~−u∣. The triangle inequality [F11] yields ∥N−f∥Lp(μ)<ε.

5.1givenstep 4.1step 3.2F2F8F10A1algebra

If μ=0, every measurable real function represents the zero class in Lp(μ;R), 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 Lp equivalence and its zero-measure boundary.

6.1step 3.2F9F12F15F18∎

Let K=[0,1]d, which is compact by [F9], and define μ(A)=λd(A∩K) for Borel A. By [F15], μ(K)=1. This is a finite Borel measure concentrated on K and absolutely continuous with respect to λd. It is regular: inner regularity follows by applying [F18] to A∩K; for outer regularity, apply [F18] to K∖A to choose a compact F⊆K∖A with λd((K∖A)∖F)<ε, and use the open set Rd∖F⊇A, for which μ((Rd∖F)∖A)<ε. 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 μ(K)=1 would turn those approximations into Lp(μ) approximations, contradicting step 3.2 for f(x)=x1q+1. This proves the essential-supremum obstruction on the cube and completes both compact-set equivalences.

Remarks

The absolute-continuity hypothesis in the Lp equivalence is essential to this interface. Positivity of an arbitrary measure is insufficient: for μ=δ0, every Lp(μ) class is specified by one real value, and the output bias alone realizes every such value even with the polynomial activation σ=1.

The broad class M 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

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