Alphabeta Math
Pipeline-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.

Noise-robust neural-operator approximation for EIT — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite samples outside a uniform BV bound

Example

Let Ω=B((1/2,1/2),1/4)⊂(0,1)2, let Ω′=B((1/2,1/2),1/8), and fix m=1/2, M=3/2, and contrast a=1/4. For every integer N≥1, put q=⌈N⌉, choose N distinct cell centers from the q×q grid in [7/16,9/16]2, set rN=1/(32q), and define γN=1+a1EN, where EN is the union of the radius-rN disks about those centers. Then every γN is a real, uniformly elliptic, individually finite-BV conductivity equal to 1 outside Ω′, but TV(γN;Ω)≥(πa/32)N. Hence the family has no common finite BV bound R and is not contained in any one class X2(R) as N varies. This is a non-applicability example for a fixed uniform BV theorem, not a counterexample to its conclusion for members of that class.

Facts & Assumptions

Given: the disk domain and parameters in the Example.

[F1]

A conductivity in X2(R) must be uniformly elliptic, equal to the fixed background outside Ω′, and satisfy the displayed BV norm bound. (Calderón admissible conductivity classes)

[F2]

For u∈BV(Ω), TV(u;Ω)=sup⁡{∫Ωu div⁡φ dx:φ∈Cc∞(Ω;R2), ∣φ(x)∣≤1}; symmetry under φ↦−φ makes this the supremum of absolute pairings. (Test-field formula and L1 lower semicontinuity of spatial TV)

[F3]

A function is in BV(Ω) when its distributional derivative is a finite vector Radon measure, and its total variation is the mass of that measure; the distributional derivative is linear and annihilates constants. (Spatial BV and distributional total variation)

Proof

Given: N≥1 and the grid in the Example.

1.1F1givenalgebra

The square [7/16,9/16]2 has side 1/8 and lies in Ω′ because its corner radius from (1/2,1/2) is 2/16<1/8. The grid spacing is sN=1/(8q) and rN=sN/4. Distinct cell centers are separated by at least sN>2rN, and each disk lies inside its cell; hence the disks are disjoint and contained in Ω′. Thus 1≤γN≤1+a=5/4<3/2 and γN=1 on Ω∖Ω′.

1.2F2F3givenalgebra

For a disk B(c,r) and a smooth compactly supported vector field φ, polar coordinates give ∫B(c,r)div⁡φ dx=r∫02πφ(c+r(cos⁡θ,sin⁡θ))⋅(cos⁡θ,sin⁡θ) dθ. Indeed, in polar variables div⁡φ=ρ−1∂ρ(ρφr)+ρ−1∂θφθ; integrating against ρ dρ dθ makes the angular derivative integrate to zero and the inner radial term vanish. The distributional definition therefore gives D1B(c,r)=−ν H1∣∂B(c,r), whose variation has mass 2πr. Summing these measures over the disjoint disks shows D1EN is finite with variation mass 2πrNN, so [F3] gives 1EN∈BV(Ω) and [F2] gives the stated upper bound.

2.1F2F3step 1.1step 1.2construct

The annuli of radii (rN/2,3rN/2) about the chosen centers are pairwise disjoint: their outer radii sum to 3rN=3sN/4<sN, while distinct centers are at least sN apart. They lie in Ω, since each center is within 2/16 of (1/2,1/2) and 2/16+3rN/2≤2/16+3/64<1/4. On each annulus choose a smooth radial cutoff equal to one at radius rN, vanishing outside the annulus and between zero and one. The sum of the corresponding radial unit-vector fields is smooth, compactly supported in Ω, has norm at most one, and equals the outward normal on every circle. Its flux is 2πrNN, so [F2] gives the matching lower bound. Since DγN=aD1EN by [F3] and a>0, step 1.2 gives TV(1EN;Ω)=2πrNN and TV(γN;Ω)=2πarNN=πaN/(16q).

3.1F1step 1.1step 2.1algebra∎

Since q=⌈N⌉≤2N, step 2.1 gives TV(γN;Ω)≥(πa/32)N. The value and collar bounds were checked in step 1.1, and every finite union of disks has the finite perimeter computed in step 2.1. Thus each conductivity is individually finite-BV while the total variations diverge, so no fixed R contains the whole family in X2(R).

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Continuum approximation theorem versus finite-element experiments

Example

Let H=L2(∂Ω×∂Ω) and Y=L2(Ω) for a bounded smooth EIT domain. Given any nonempty finite sample set S={x1,…,xN}⊂H, any x∗∈H∖S, and any y∗∈Y∖{0}, there are continuous maps F0,F1:H→Y that agree at every sample input and differ by y∗ at x∗. Therefore exact fit on finitely many inputs alone cannot identify an arbitrary continuous inverse map. A continuum FNO approximation theorem concerns the full L2 kernel input and L2 conductivity output on a compact set; a finite-element experiment reports a finite discretization and finite train/test sample. Neither finite-data fit nor a discretized operator matrix supplies the continuum theorem's uniform bound or a statistical generalization guarantee.

Facts & Assumptions

Given: a nonempty finite S⊂H, a point x∗∉S, and y∗≠0 in Y.

[F1]

The continuum theorem takes inputs in L2(∂Ω×∂Ω) and outputs in L2(Ω), and bounds the reconstruction error for every γ∈Xd(R) and η∈Kδ, where Kδ={η∈K:∥η∥2≤δ} for compact K. Step 1.1 of its proof shows that these inputs form the compact sum {κγ:γ∈Xd(R)}+Kδ. The theorem asserts no training or finite-sample risk guarantee. (Noise-robust existence of generalized FNO approximants for EIT)

Proof

Given: the finite sample set S, the unsampled point x∗ and y∗≠0.

1.1givenconstruct

The finite set S is closed in the Hilbert metric and d(x∗,S)>0. Define φ(x)=d(x,S)/d(x∗,S), F0(x)=0 and F1(x)=φ(x)y∗. Distance to a closed set is 1-Lipschitz, so both maps are continuous. For every xi∈S, φ(xi)=0, hence F0(xi)=F1(xi)=0; at x∗, F1(x∗)−F0(x∗)=y∗.

2.1F1step 1.1given∎

The construction shows that finite exact sample values do not determine an arbitrary continuous map on the ambient Hilbert input space. The distinction in the Example follows from the domains of the two claims: the continuum theorem quantifies over a compact subset of the full kernel L2 space, whereas a finite-element experiment only evaluates finitely many discretized inputs and outputs. The finite-map construction is not asserted to belong to the generalized-FNO class or to contradict the continuum theorem.

Sources