Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

A one-neuron kernel has convergent uniform quadratures and divergent C1 quadratures

Statement refuted

Let D⊂Rd and D′⊂Rd′ be bounded domains. Let A and U be real Banach function spaces on D and D′ that embed continuously into C(Dˉ) and C(Dˉ′), respectively. Let σ1,σ2,σ3:R→R be continuous, and let G:A→U be any N-layer neural operator in the function-space class defined by the neural-operator construction. Then compatible finite-dimensional Riemann-sum realizations of G, using the same parameters at each refinement, converge to G uniformly on every compact input set in the output-space norm U.

This is the exact originally authored stronger theorem statement, retained verbatim. Assume Countable Choice for the counterexample below. The assertion fails for input space C([0,1]), output space C1([0,1]), and the singleton compact input set consisting of the constant function 1, with a one-neuron final kernel in the specified integral subclass.

Facts & Assumptions

Given: Countable Choice, D=D′=(0,1), A=C([0,1]) with the supremum norm, and U=C1([0,1]) with norm ∥u∥U=∥u∥∞+∥u′∥∞.

[F1]

Smooth plateau cutoffs exist with prescribed nested compact supports by Explicit compactly supported smooth cutoffs. In particular fix a smooth β:R→[0,1], supported in (−1,1), with β(0)=1.

[F2]

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.

[F3]

Under Countable Choice, an activation in Mpt that is not polynomial almost everywhere gives single-hidden-layer compact-uniform density (Single-hidden-layer universal approximation). The class Mpt requires measurability, pointwise local boundedness and a null closure of the discontinuity set (Locally essentially bounded activations with null discontinuity closure). The classes A0(q) and A0L,(q) 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 (ACω).

Counterexample

1.1givenF1F3constructalgebra

For integers n≥2 put tn=3⋅2−n−2, wn=2−4n−4, Hn=22n and ρn(s)=Hnβ((s−tn)/wn). Their supports are disjoint subintervals of (0,1): successive centers differ by 3⋅2−n−3, which exceeds wn+wn+1, and each radius is smaller than its center. Define ρ(s)=∑n≥2ρn(s) for s>0, and ρ(s)=0 for s≤0. On each compact subinterval of (0,∞) only finitely many summands are nonzero. Moreover mn=∫ρn≤2Hnwn=2−2n−3, so B=∑n≥2mn<1. Define σ(s)=∫0sρ(t) dt for s≥0 and σ(s)=0 for s<0. The tail mass bound proves continuity at zero and uniform convergence of the primitives σn(s)=∫0sρn(t) dt; thus σ=∑σn is continuous on R, bounded by B, and smooth on (0,∞). 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 Mpt 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 A0 class and ReLU in every A0L class; ReLU is Borel and obeys ∣ReLU⁡(s)∣≤∣s∣.

2.1step 1.1F2constructalgebra

Set κ(x,y)=σ(x+y) and G(a)(x)=∫01σ(x+y)a(y) dy. The kernel is exactly a one-hidden-unit network on (x,y) with weights (1,1), activation σ, output weight 1, and zero biases. The other activations can be the identity. Each Gn∗(a)(x)=∫01σn(x+y)a(y) dy is C1, with derivative ∫01ρn(x+y)a(y) dy, and both its function norm and derivative norm are at most mn∥a∥∞. Consequently both the function series and derivative series converge uniformly. To verify differentiation without an interchange assumption, the finite partial sums satisfy SN(x)−SN(0)=∫0xSN′(t) dt; uniform convergence permits passage to the limit in this equality, and the fundamental theorem of calculus gives a continuous derivative. Hence G:A→U is bounded linear, with ∥G(a)∥U≤2B∥a∥∞. Both A and U embed continuously into C([0,1]). To instantiate the source integral subclass as well, take S0 and S1 to have constant kernel 1 and zero bias, and use κ(x,y)=σ(x+y) as the final kernel, choosing ReLU for the input and intermediate kernel networks and activations. No intermediate activation occurs at depth N=2. This yields G^(a)=(∫01a)G(1), a bounded map A→U. For a=1, both preceding integral layers and their quadratures are exactly the constant 1, so its final continuum and quadrature outputs are precisely those analyzed below. Constant kernels are exact networks through their affine output biases.

3.1step 1.1step 2.1F2constructalgebra

At refinement n partition (0,1) into 2n dyadic cells of length hn=2−n. Choose the first tag to be tn∈(0,hn) and choose the midpoint of every other cell. Let Qn(a)(x)=hn∑j=12nσ(x+ξn,j)a(ξn,j). 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 [0,1], so Qn(a)∈U. For a=1, all derivative summands are nonnegative and Qn(1)′(0)≥hnρ(tn)=hnHn=2n. On the other hand, substitution in the continuum integral gives G(1)(x)=∫xx+1σ(s) ds and G(1)′(0)=σ(1)−σ(0)=B. Thus ∥Qn(1)−G(1)∥U≥2n−B→∞.

4.1step 3.1step 1.1algebra∎

The set K={1}⊂A is compact. The continuous integrand (x,y)↦σ(x+y) on [0,1]2 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 ∥Qn(1)−G(1)∥∞≤ω(hn)→0. 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 C(Dˉ). 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

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