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.

Neural operator between function spaces

Definition

Let D⊂Rd and D′⊂Rd′ be bounded domains. Let A and U be real Banach spaces of scalar functions whose elements have continuous representatives on Dˉ and Dˉ′, respectively, and suppose the inclusions into C(Dˉ) and C(Dˉ′) are continuous when these continuous-function spaces carry the supremum norm. In the continuous-function setting, a neural operator is a composition of a pointwise lifting map, finitely many integral-kernel layers, and a pointwise projection map. A layer with channel dimensions qt,qt+1≥1 has the form vt+1(x)=σt ⁣(Wtvt(x)+∫Dκt(x,y)vt(y) dy+bt(x)),x∈Dˉ, where vt:Dˉ→Rqt is continuous, Wt∈Rqt+1×qt, κt:Dˉ×Dˉ→Rqt+1×qt and bt:Dˉ→Rqt+1 are continuous, and the scalar activation σt is applied coordinatewise. The lifting and projection maps are finite feedforward networks applied pointwise, with their input and output channel dimensions chosen to make the composition well-defined. All integrals are Lebesgue integrals, which exist because the integrands are continuous on a compact set. For distinct input and output domains the final integral layer has kernel on Dˉ′×Dˉ, integrates over D, and has zero local matrix term; subsequent projection acts on Dˉ′. For any stronger specified output space, the selected composition is required actually to map into that space.

The integral universality subclass is defined separately on L1(D;Rq0), including almost-everywhere equivalence classes. Fix continuous activations σ1,σ2,σ3 with σ1 of at most linear growth, N≥2, and channel dimensions q1,…,qN≥1. For 0≤t≤N−1 let St(v)(x)=∫Dκt(x,y)v(y) dy+bt(x),x∈Dˉ, where κt:Rd×Rd→Rqt+1×qt and bt:Rd→Rqt+1 are finite MLPs with hidden activation σ2 and affine output. Set v1=S0(a), v2=S1(v1), and vt+1=St(σ1(vt)) for 2≤t≤N−1. An element of NON is G(a)(x)=∫DκN(x,y)vN(y) dy,x∈Dˉ′, where κN:Rd′×Rd→Rqout×qN is a finite MLP with activation σ3 and affine output. There are exactly N−2 intermediate σ1 activations. Scalar input and output mean q0=qout=1. The final integral is over D, with output variable in D′. This class has identity lifting and projection and zero local matrix terms. It specializes the architectural scheme with its first layer extended to L1 classes; it does not require continuous input representatives.

The first integral is invariant under null changes and obeys ∥S0(a)∥∞≤∥κ0∥∞∥a∥1+∥b0∥∞. Uniform continuity of its kernel on the compact product implies continuity of its output by the same L1 estimate. All later fields are continuous and bounded, so their integrals and activations are defined; the output is continuous on Dˉ′. Viewing it in a stronger Banach space U requires the selected kernels actually to produce outputs in U. The universality theorem constructs such kernels; arbitrary continuous kernels alone do not guarantee this condition.

For equal input and output domains, the diagram records the composition order: a pointwise lift, integral-kernel layers on D, and a pointwise output projection. Each Kt box denotes the integral layer defined above; arrows denote function composition and do not assert a theorem.

a2APpointwiselift¾t;KtintegrallayersQpointwiseprojectionG(a)2U

This schematic is only a depiction of the composition defined above; it is not used in the discretization or universality proofs.

Depends on

Used by

Dependency tree · two levels

21 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