Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Activation classes for neural-operator universality

Definition

Fix an input dimension q≥1 and an integer m≥0. Let Am(q) be the class of continuous scalar activations σ:R→R for which there is one depth n∈N such that, for every compact K⊂Rq, the scalar-output depth-n multilayer perceptrons with activation σ are dense in Cm(K) in the Cm norm. For m=0, C0(K) has the supremum norm. For m>0, Cm(K) means jets of functions defined and Cm on an open neighborhood of K: identify two functions when all their derivatives of orders at most m agree on K, and use the norm max⁡∣β∣≤msup⁡x∈K∣Dβf(x)∣. Only networks that are Cm near K enter this density assertion. For vector outputs, stack scalar-output networks of that same depth. The source notation Am suppresses the input dimension fixed by the finite-dimensional network under consideration. Let AmL,(q) be the subclass whose members are Borel measurable and have at most linear growth, meaning sup⁡s∈R∣σ(s)∣1+∣s∣<∞. For an integer q≥1, define BAq to consist of those σ∈A0(q) for which, for every compact K⊂Rq, every ε>0, and every C≥diam⁡2(K), there is a finite multilayer perceptron f:Rq→Rq with ∣f(x)−x∣2≤ε(x∈K),∣f(x)∣2≤C(x∈Rq). Here diam⁡2(K)=sup⁡x,y∈K∣x−y∣2, with diameter and all displayed approximation seminorms equal to zero on the empty set. The diameter-based global bound is part of this definition and is retained verbatim; whether it has any members is checked separately.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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