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.
A one-neuron kernel has convergent uniform quadratures and divergent C1 quadratures
Statement refuted
Let and be bounded domains. Let and be real Banach function spaces on and that embed continuously into and , respectively. Let be continuous, and let be any -layer neural operator in the function-space class defined by the neural-operator construction. Then compatible finite-dimensional Riemann-sum realizations of , using the same parameters at each refinement, converge to uniformly on every compact input set in the output-space norm .
This is the exact originally authored stronger theorem statement, retained verbatim. Assume Countable Choice for the counterexample below. The assertion fails for input space , output space , and the singleton compact input set consisting of the constant function , with a one-neuron final kernel in the specified integral subclass.
Statement references
Facts & Assumptions
Given: Countable Choice, , with the supremum norm, and with norm .
Smooth plateau cutoffs exist with prescribed nested compact supports by Explicit compactly supported smooth cutoffs. In particular fix a smooth , supported in , with .
A general integral-kernel neural operator and its volume-weighted tagged quadratures are defined in Neural operator between function spaces and Riemann-sum realization of a neural operator.
Under Countable Choice, an activation in that is not polynomial almost everywhere gives single-hidden-layer compact-uniform density (Single-hidden-layer universal approximation). The class requires measurability, pointwise local boundedness and a null closure of the discontinuity set (Locally essentially bounded activations with null discontinuity closure). The classes and require fixed-depth uniform density and, for the latter, Borel measurability and at most linear growth (Activation classes for neural-operator universality); the choice principle is The Axiom of Countable Choice ().
Counterexample
For integers put , , and . Their supports are disjoint subintervals of : successive centers differ by , which exceeds , and each radius is smaller than its center. Define for , and for . On each compact subinterval of only finitely many summands are nonzero. Moreover , so . Define for and for . The tail mass bound proves continuity at zero and uniform convergence of the primitives ; thus is continuous on , bounded by , and smooth on . It is a legitimate continuous activation. It is bounded and nonconstant, hence is not polynomial even almost everywhere: continuity would make an almost-everywhere polynomial identity hold everywhere, and a bounded polynomial is constant. Both and ReLU are continuous, hence Borel measurable with empty discontinuity set, and pointwise bounded on every compact interval (globally for , and by the interval radius for ReLU). They therefore belong to in [F3]. ReLU is not polynomial almost everywhere: continuity would give a polynomial identity everywhere, while vanishing on the negative half-line forces that polynomial to be zero, contradicting its positive values. Applying [F3] in each input dimension now places in every class and ReLU in every class; ReLU is Borel and obeys .
Set and . The kernel is exactly a one-hidden-unit network on with weights , activation , output weight , and zero biases. The other activations can be the identity. Each is , with derivative , and both its function norm and derivative norm are at most . Consequently both the function series and derivative series converge uniformly. To verify differentiation without an interchange assumption, the finite partial sums satisfy ; uniform convergence permits passage to the limit in this equality, and the fundamental theorem of calculus gives a continuous derivative. Hence is bounded linear, with . Both and embed continuously into . To instantiate the source integral subclass as well, take and to have constant kernel and zero bias, and use as the final kernel, choosing ReLU for the input and intermediate kernel networks and activations. No intermediate activation occurs at depth . This yields , a bounded map . For , both preceding integral layers and their quadratures are exactly the constant , so its final continuum and quadrature outputs are precisely those analyzed below. Constant kernels are exact networks through their affine output biases.
At refinement partition into dyadic cells of length . Choose the first tag to be and choose the midpoint of every other cell. Let . These are compatible tagged Riemann sums, with mesh diameter tending to zero and the same continuum parameters at every refinement. Since every tag is positive, each summand is smooth in a neighborhood of , so . For , all derivative summands are nonnegative and . On the other hand, substitution in the continuum integral gives and . Thus .
The set is compact. The continuous integrand on is uniformly continuous: otherwise pairs at distances tending to zero with a fixed positive function gap have convergent subsequences in the compact square and contradict continuity. Writing its modulus of continuity as , the cellwise estimate gives . Thus the genuine supremum-norm conclusion coexists with divergence in the admissible output norm, refuting the asserted inference.
Remark
The defect occurs in Appendix E's opening reduction from continuous embeddings to equality with . Such an embedding bounds the supremum norm by the Banach norm; it supplies no reverse inequality. This counterexample also uses a network kernel, rather than only an arbitrary continuous kernel. It refutes the specified volume-weighted tagged quadratures in the asserted norm; it does not assert that no other finite-dimensional approximation to this bounded integral operator can exist.
Depends on
- Locally essentially bounded activations with null discontinuity closure
- Activation classes for neural-operator universality
- Neural operator between function spaces
- Riemann-sum realization of a neural operator
- Explicit compactly supported smooth cutoffs
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Single-hidden-layer universal approximation
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
50 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, Theorem 8 and Appendix E (standard reference, not scraped)