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 and be bounded Lipschitz domains. Let be , , or , with and where applicable. Let be , , or , with , with in the Lebesgue case, in the Sobolev case, and in the continuous case. Let be continuous, compact, and . Suppose , , and in every finite input dimension used below. Then some finite-layer neural operator in the specified integral architecture satisfies
The printed additional source implication asserts that, if is Hilbert, , on all , and , then on all . 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 , every with the convention that the radius of the empty set is zero, and every , there is a MLP with and . Under this replacement the same global bound holds. This replacement does not change the printed diameter-based definition.
Statement references
Facts & Assumptions
Given: The spaces, compact set, target, activation hypotheses and error in the Statement.
The activation hypotheses supply fixed-depth finite MLP density in the indicated finite-dimensional 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).
The architecture uses affine integral maps on , coordinatewise between its intermediate affine maps, and a final kernel on integrated over (Neural operator between function spaces).
Smooth restrictions are norm-dense in all listed output spaces, including , by the constructive smooth-range approximation in Inward mollification and smooth finite-rank approximation on Lipschitz domains. Thus the targets subsequently approximated using the premise can be chosen ambient smooth; no extension of an arbitrary function is assumed.
Under Countable Choice, if are distinct modulo null functions then some real has , by injectivity of regular distributions (Locally integrable functions embed in distributions, The Axiom of Countable Choice ()).
Under Countable Choice, the pointwise universal-approximation theorem applies to activations in that are not polynomial almost everywhere (Single-hidden-layer universal approximation, Locally essentially bounded activations with null discontinuity closure).
The source's diameter-bounded class is empty (The printed diameter-bounded activation class is empty).
Proof
If is empty choose the zero operator. Otherwise put and choose . Every listed input space injects continuously into : for finite , when applicable, and for use . Thus each smooth moment is continuous on and such moments separate distinct members of , using [F4]; distinct continuous functions also differ on an interior set of positive measure.
ReLU is continuous and Borel, is pointwise bounded on every compact interval, and has empty discontinuity set, so it belongs to . 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 , suppose . If is empty choose zero. If , then and again choose zero. If , the coordinate clamp is an exact ReLU network onto and fixes . The radial projection onto the Euclidean ball of radius is continuous and fixes . By [F6] approximate on the cube by a ReLU MLP with Euclidean error , where . Then is a finite ReLU MLP, globally bounded by , and for its error is less than . Composition of layered MLPs is a layered MLP because consecutive affine maps merge. ReLU also has linear growth and belongs to every relevant by [F6]. Thus this corrected branch is nonvacuous.
The set is compact. For each pair in a separating moment from step 1.1 remains nonzero on a neighborhood of that pair. A finite subcover supplies moments such that has for all . If is nonempty, the positive continuous function on has a positive minimum ; if is empty set , , and . In both cases implies . This is the complete finite-moment reduction and does not presume a dual representation theorem.
Cover the compact by finitely many open balls of radius with centers , , . Put , , and . The denominator is positive everywhere: off its first term is positive, and on some . Consequently is continuous on all , nonnegative, and , with equality on . For , implies and hence . The convex combination therefore differs from by less than .
For every listed output space choose smooth neighborhood restrictions with , using [F3]. Define and . Since the weights in step 3.1 sum to one on , . This is the output finite-dimensional factorization.
Let , a compact subset of . Uniform continuity of on gives such that and imply . Set . By the premise [F1] choose common-depth scalar networks with . Then satisfies , so and . The input layer kernel ignores and has exactly constant spatial output. The estimate uses only bounds and covers .
Apply the premise to the continuous map on compact , obtaining a finite MLP such that . Then . Only approximation of this middle map is used; no differentiability of is needed.
Put , finite by continuity and compactness. Define for with the maximum derivative norm, and for with the usual sum-of--powers norm, where counts multi-indices of order at most ; this also treats with . For functions , directly integrating each derivative gives . By choose common-depth networks such that . These approximants are chosen from the network subfamily supplied by that density premise, so their derivatives exist. With , the estimate yields . Equivalent choices of standard Banach norms merely change .
Write the middle MLP as with hidden layers. On a spatially constant field , the affine map is represented exactly by the integral kernel and constant bias . Such constants are exact networks through their output biases. Use these layers after the input layer of step 5.1, placing precisely the coordinatewise activations of between them. The final kernel is a network ignoring , so its integral over sends a constant to . This proves that belongs to under the indexing convention in [F2]. All intermediate fields are constant and the final output belongs to for every .
Adding the four errors in steps 4.1–7.1 gives . This proves the core theorem. The proof in fact only needs continuity of on and the continuous injective realization of ; it retains all the listed source spaces.
For the corrected additional branch assume Hilbert, , and . Apply the core construction with an error , calling the resulting operator . It has the exact form . Choose an orthonormal basis for the finite-dimensional span of the , discarding linear dependences, and express . Each is a linear combination of the and hence the same-depth MLP; each is a linear combination of the and hence a same-depth network. If the span is zero the zero operator already suffices. Otherwise on .
The set is compact with radius at most . Apply the explicitly corrected property in the Statement with and tolerance , obtaining . Compose its MLP with and use final kernel . By step 8.1 this is an operator of the required architecture. Orthonormality gives and for every . Thus its approximation error is below . The argument handles arbitrary positive without the source's unjustified normalization .
For the exact printed additional implication the premise 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
- Neural operator between function spaces
- Activation classes for neural-operator universality
- The printed diameter-bounded activation class is empty
- Locally integrable functions embed in distributions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Single-hidden-layer universal approximation
- Locally essentially bounded activations with null discontinuity closure
- Inward mollification and smooth finite-rank approximation on Lipschitz domains
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
- Kovachki et al., Neural Operator: Learning Maps Between Function Spaces With Applications to PDEs (standard reference, not scraped)