Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Noise-robust existence of generalized FNO approximants for EIT

Statement

Assume the Axiom of Choice and Countable Choice. Let d≥2, let Ω⊂(0,1)d be nonempty, bounded, connected and C∞, let Ω′⋐Ω, and fix the ellipticity, collar and regularity parameters defining Xd(R). Let M=∂Ω, let K⊂L2(M×M;C) be compact, and for δ≥0 put Kδ={η∈K:∥η∥L2(M×M;C)≤δ}. Let κγ be the zero-mean-in-each-variable kernel of the dimension-dependently smoothed mean-zero NtD observation for γ∈Xd(R). Regard L2(M×M;C) as a real Hilbert space and let Rf=(Re⁡f,Im⁡f) be its isometric realification into L2(M×M;R2). Let Ψ~⋆:L2(M×M;C)→L2(Ω;R) extend the exact-data inverse map and satisfy ∥Ψ~⋆(f)−Ψ~⋆(g)∥L2(Ω;R)≤C⋆ω⋆(∥f−g∥L2(M×M;C)), where ω⋆ is continuous, nondecreasing and concave with ω⋆(0)=0. Then for every ε>0 there exists a generalized Fourier neural operator Φ:L2(M×M;R2)→L2(Ω;R) with two real input channels such that, on complex inputs, Ψ(f):=Φ(Rf) satisfies sup⁡γ∈Xd(R), η∈Kδ∥γ−Ψ(κγ+η)∥L2(Ω;R)≤ε+C⋆ω⋆(δ). This is an existence statement for continuum NtD kernels and compact noise sets; it makes no training, finite-sample, network-size, finite-element, electrode-matrix or calibration guarantee.

Facts & Assumptions

Given: the EIT domain and class, compact complex-valued perturbation set K, noise threshold δ, kernel map and Hilbert extension in the Statement.

[F1]

The exact kernel image KX={κγ:γ∈Xd(R)} is compact in L2(M×M). (EIT forward continuity and compactness of conductivity classes)

[F2]

The extension agrees with the exact-data inverse, Ψ~⋆(κγ)=γ, and satisfies the displayed C⋆ω⋆ bound. (Stable extension of the EIT inverse map, Hilbert-valued extension with a concave modulus)

[F3]

Kδ is a closed subset of compact K, and addition is continuous on the complex L2 space viewed as a real Hilbert space.

[F4]

A continuous map from L2(M×M;R2) to L2(Ω;R) can be uniformly approximated on every compact input set by a generalized FNO of the stated multichannel architecture. (Generalized FNO approximation on compact sets)

[A1]

The Axiom of Choice and Countable Choice are used at the conductivity, boundary spectral, and Hilbert extension interfaces. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

Given: the data in the Statement.

1.1A1F1F3givenconstruct

If Kδ=∅ or Xd(R)=∅, choose the zero generalized FNO; the uniform assertion is then vacuous. Otherwise, [A1] applies at the upstream conductivity, spectral and extension interfaces. [F1] and compactness of Kδ make Zδ:=KX+Kδ={κ+η:κ∈KX, η∈Kδ} compact in complex L2, since it is the continuous image of KX×Kδ under addition. The isometric realification R(Zδ) is therefore compact in L2(M×M;R2).

2.1F4step 1.1choose

Apply [F4] to the continuous real-valued map Ψ~⋆∘R−1 on the compact set R(Zδ) with tolerance ε. There is a two-input-channel generalized FNO Φ with sup⁡z∈Zδ∥Ψ~⋆(z)−Φ(Rz)∥L2(Ω;R)<ε.

3.1F2step 2.1givenalgebra∎

For γ∈Xd(R) and η∈Kδ, use [F2], the triangle inequality and monotonicity of ω⋆ to obtain ∥γ−Φ(R(κγ+η))∥2≤∥Ψ~⋆(κγ)−Ψ~⋆(κγ+η)∥2+∥Ψ~⋆(κγ+η)−Φ(R(κγ+η))∥2≤C⋆ω⋆(∥η∥2)+ε≤C⋆ω⋆(δ)+ε. Here Ψ~⋆(κγ)=γ because the extension agrees on the exact real kernel image, and the complex L2 norm is preserved by R. Taking the supremum gives the claim.

Depends on

Used by

Dependency tree · two levels

37 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