Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generated
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.

Neural operators approximate continuous maps uniformly on compacta

Statement

Assume Countable Choice. Let D⊂Rd and D′⊂Rd′ be bounded Lipschitz domains. Let A be Lp1(D), Wm1,p1(D), or C(Dˉ), with 1≤p1<∞ and m1≥1 where applicable. Let U be Lp2(D′), Wm2,p2(D′), or Cm2(Dˉ′), with 1≤p2<∞, with m2=0 in the Lebesgue case, m2≥1 in the Sobolev case, and m2≥0 in the continuous case. Let G†:A→U be continuous, K⊂A compact, and ε>0. Suppose σ1∈A0L, σ2∈A0, and σ3∈Am2 in every finite input dimension used below. Then some finite-layer neural operator G in the specified integral architecture satisfies sup⁡a∈K∥G†(a)−G(a)∥U<ε.

The printed additional source implication asserts that, if U is Hilbert, M>0, ∥G†(a)∥U≤M on all A, and σ1∈BA, then ∥G(a)∥U≤4M on all A. This exact implication is vacuous because its diameter-bounded class is empty. A useful corrected implication replaces only that additional activation premise by the following explicitly different property: for every compact S⊂Rq, every C≥sup⁡z∈S∣z∣2 with the convention that the radius of the empty set is zero, and every η>0, there is a σ1 MLP b:Rq→Rq with sup⁡S∣b(z)−z∣2<η and sup⁡Rq∣b(z)∣2≤C. Under this replacement the same global bound 4M holds. This replacement does not change the printed diameter-based definition.

Facts & Assumptions

Given: The spaces, compact set, target, activation hypotheses and error in the Statement.

[F1]

The activation hypotheses supply fixed-depth finite MLP density in the indicated finite-dimensional Cm norms; stacking scalar networks of a common depth gives vector outputs. Their affine output layers allow linear combinations and constant functions (Activation classes for neural-operator universality).

[F2]

The architecture uses affine integral maps on D, coordinatewise σ1 between its intermediate affine maps, and a final kernel on D′×D integrated over D (Neural operator between function spaces).

[F3]

Smooth restrictions are norm-dense in all listed output spaces, including Cm(Dˉ′), by the constructive smooth-range approximation in Inward mollification and smooth finite-rank approximation on Lipschitz domains. Thus the targets subsequently approximated using the Am premise can be chosen ambient smooth; no extension of an arbitrary Cm(Dˉ′) function is assumed.

[F4]

Under Countable Choice, if a,b∈Lloc1(D) are distinct modulo null functions then some real φ∈Cc∞(D) has ∫Dφ(a−b)≠0, by injectivity of regular distributions (Locally integrable functions embed in distributions, The Axiom of Countable Choice (ACω)).

[F6]

Under Countable Choice, the pointwise universal-approximation theorem applies to activations in Mpt that are not polynomial almost everywhere (Single-hidden-layer universal approximation, Locally essentially bounded activations with null discontinuity closure).

[F5]

The source's diameter-bounded class is empty (The printed diameter-bounded activation class is empty).

Proof

1.1givenF4choosealgebra

If K is empty choose the zero operator. Otherwise put T=G†∣K and choose 0<τ<ε/5. Every listed input space injects continuously into L1(D): for finite p, ∥a∥1≤∣D∣1−1/p∥a∥p≤∣D∣1−1/p∥a∥Wm,p when applicable, and for C(Dˉ) use ∥a∥1≤∣D∣∥a∥∞. Thus each smooth moment a↦∫Dφa is continuous on A and such moments separate distinct members of K, using [F4]; distinct continuous functions also differ on an interior set of positive measure.

1.2F1F6constructalgebra

ReLU is continuous and Borel, is pointwise bounded on every compact interval, and has empty discontinuity set, so it belongs to Mpt. It cannot agree almost everywhere with a polynomial: that polynomial would vanish on the negative half-line by continuity, hence identically, contradicting ReLU on the positive half-line. Thus [F6] applies. The corrected property has concrete instances. For ReLU and a compact S⊂Rq, suppose C≥sup⁡S∣z∣2. If S is empty choose zero. If C=0, then S⊂{0} and again choose zero. If C>0, the coordinate clamp cj(z)=−C+ReLU⁡(zj+C)−ReLU⁡(zj−C) is an exact ReLU network onto [−C,C]q and fixes S. The radial projection P onto the Euclidean ball of radius C is continuous and fixes S. By [F6] approximate P on the cube by a ReLU MLP p with Euclidean error <ξ, where 0<2ξ<η. Then b(z)=Cp(c(z))/(C+ξ) is a finite ReLU MLP, globally bounded by C, and for z∈S its error is less than ξ+ξC/(C+ξ)<2ξ<η. Composition of layered MLPs is a layered MLP because consecutive affine maps merge. ReLU also has linear growth and belongs to every relevant A0 by [F6]. Thus this corrected branch is nonvacuous.

2.1step 1.1constructchoose

The set Q={(a,b)∈K2:∥T(a)−T(b)∥U≥τ} is compact. For each pair in Q a separating moment from step 1.1 remains nonzero on a neighborhood of that pair. A finite subcover supplies moments φ1,…,φJ such that E(a)=(∫Dφja)j=1J has E(a)≠E(b) for all (a,b)∈Q. If Q is nonempty, the positive continuous function ∣E(a)−E(b)∣2 on Q has a positive minimum r; if Q is empty set J=1, φ1=0, and r=1. In both cases ∣E(a)−E(b)∣2<r implies ∥T(a)−T(b)∥U<τ. This is the complete finite-moment reduction and does not presume a dual representation theorem.

3.1step 2.1constructalgebra

Cover the compact E(K) by finitely many open balls of radius r/4 with centers zi=E(ai), ai∈K, 1≤i≤s. Put hi(z)=max⁡(0,r/2−∣z−zi∣2), h0(z)=dist⁡(z,E(K)), and wi(z)=hi(z)/(h0(z)+∑k=1shk(z)). The denominator is positive everywhere: off E(K) its first term is positive, and on E(K) some hi>r/4. Consequently w=(w1,…,ws) is continuous on all RJ, nonnegative, and ∑iwi≤1, with equality on E(K). For a∈K, wi(E(a))>0 implies ∣E(a)−E(ai)∣2<r/2 and hence ∥T(a)−T(ai)∥U<τ. The convex combination ∑iwi(E(a))T(ai) therefore differs from T(a) by less than τ.

4.1step 3.1F3chooseconstructalgebra

For every listed output space choose smooth neighborhood restrictions ϕi with ∥ϕi−T(ai)∥U<τ, using [F3]. Define Bv=∑iviϕi and L=max⁡(1,∥B∥ℓ1→U). Since the weights in step 3.1 sum to one on E(K), sup⁡K∥T(a)−Bw(E(a))∥U<2τ. This is the output finite-dimensional factorization.

5.1step 1.1step 4.1F1chooseconstructalgebra

Let Z={z:dist⁡(z,E(K))≤1}, a compact subset of RJ. Uniform continuity of w on Z gives 0<δ<1 such that z,z′∈Z and ∣z−z′∣2<δ imply ∣w(z)−w(z′)∣1<τ/L. Set R=max⁡(1,sup⁡a∈K∥a∥1). By the σ2 premise [F1] choose common-depth scalar networks pj with sup⁡Dˉ∣pj−φj∣<δ/(2RJ). Then E~(a)=(∫Dpj(y)a(y) dy)j satisfies sup⁡K∣E~−E∣2<δ/2, so E~(K)⊂Z and sup⁡K∥Bw(E(a))−Bw(E~(a))∥U<τ. The input layer kernel (x,y)↦(pj(y))j ignores x and has exactly constant spatial output. The estimate uses only L1 bounds and covers p1=1.

6.1step 5.1F1choosealgebra

Apply the σ1∈A0 premise to the continuous map w on compact E~(K), obtaining a finite MLP f:RJ→Rs such that sup⁡z∈E~(K)∣f(z)−w(z)∣1<τ/L. Then sup⁡K∥Bw(E~(a))−Bf(E~(a))∥U<τ. Only C0 approximation of this middle map is used; no differentiability of σ1 is needed.

7.1step 4.1step 6.1F1chooseconstructalgebra

Put V=max⁡(1,sup⁡a∈K∣f(E~(a))∣1), finite by continuity and compactness. Define cU=1 for U=Cm2(Dˉ′) with the maximum derivative norm, and cU=(Jm2∣D′∣)1/p2 for U=Wm2,p2(D′) with the usual sum-of-p2-powers norm, where Jm counts multi-indices of order at most m; this also treats Lp2 with J0=1. For Cm2 functions u, directly integrating each derivative gives ∥u∥U≤cU∥u∥Cm2. By σ3∈Am2 choose common-depth networks qi such that ∥qi−ϕi∥Cm2(Dˉ′)<τ/(cUV). These approximants are chosen from the Cm2 network subfamily supplied by that density premise, so their derivatives exist. With B~v=∑iviqi, the estimate ∥(B~−B)v∥U≤cU∣v∣1max⁡i∥qi−ϕi∥Cm2 yields sup⁡K∥B~f(E~(a))−Bf(E~(a))∥U<τ. Equivalent choices of standard Banach norms merely change cU.

8.1step 5.1step 6.1step 7.1F1F2constructalgebra

Write the middle MLP as f(z)=An+1σ1(Anσ1(⋯σ1(A1z+b1)⋯ )+bn)+bn+1 with n hidden layers. On a spatially constant field v(y)=z, the affine map z↦Az+b is represented exactly by the integral kernel A/∣D∣ and constant bias b. Such constants are exact σ2 networks through their output biases. Use these layers after the input layer of step 5.1, placing precisely the n coordinatewise σ1 activations of f between them. The final kernel κ(x,y)=∣D∣−1(q1(x),…,qs(x)) is a σ3 network ignoring y, so its integral over D sends a constant v to B~v. This proves that G(a)=B~f(E~(a)) belongs to NOn+2 under the indexing convention in [F2]. All intermediate fields are constant and the final output belongs to U for every a∈A.

9.1step 4.1step 5.1step 6.1step 7.1step 8.1algebra

Adding the four errors in steps 4.1–7.1 gives sup⁡K∥T(a)−G(a)∥U<5τ<ε. This proves the core theorem. The proof in fact only needs continuity of T on K and the continuous injective L1 realization of A; it retains all the listed source spaces.

10.1step 8.1step 9.1chooseconstructalgebra

For the corrected additional branch assume U Hilbert, M>0, and sup⁡A∥G†(a)∥U≤M. Apply the core construction with an error 0<γ<min⁡(M,ε/2), calling the resulting operator G0. It has the exact form G0(a)=∑ifi(E~(a))qi. Choose an orthonormal basis e1,…,et for the finite-dimensional span of the qi, discarding linear dependences, and express G0(a)=∑jgj(E~(a))ej. Each gj is a linear combination of the fi and hence the same-depth σ1 MLP; each ej is a linear combination of the qi and hence a same-depth σ3 network. If the span is zero the zero operator already suffices. Otherwise ∣g(E~(a))∣2=∥G0(a)∥U<M+γ<2M on K.

11.1step 10.1F2constructalgebra

The set S=g(E~(K)) is compact with radius at most 2M. Apply the explicitly corrected property in the Statement with C=2M and tolerance 0<η<ε−γ, obtaining b. Compose its σ1 MLP with g and use final kernel ∣D∣−1(ej(x))j. By step 8.1 this is an operator G1 of the required architecture. Orthonormality gives sup⁡K∥G1−G0∥U<η and ∥G1(a)∥U=∣b(g(E~(a)))∣2≤2M≤4M for every a∈A. Thus its approximation error is below γ+η<ε. The argument handles arbitrary positive M without the source's unjustified normalization M≥1.

12.1step 9.1step 11.1F5∎

For the exact printed additional implication the premise σ1∈BA is impossible by [F5], so that implication is true but has no instances. Steps 10.1–11.1 establish the explicitly different nonvacuous branch; neither step alters the diameter-based class. This completes all asserted implications.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

62 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