Alphabeta Math
LemmaStatement: 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.

Planar BV logarithmic Calderón stability

Statement

Assume the Axiom of Choice and Countable Choice. Let Ω⊂(0,1)2 be a nonempty bounded connected smooth domain, let Ω′⋐Ω, and fix m>0, M≥max⁡{1,m} and R>0. For every γ,γ0∈X2(R) there exist constants C>0, ρ>0 and t0∈(0,1), depending only on Ω,Ω′,m,M,R, such that ∥γ−γ0∥L2(Ω)≤C ω ⁣(∥Λ˙γ−Λ˙γ0∥L(D(Ω)/C1,(D(Ω)/C1)∗)), where D(Ω) is the trace quotient and Λ˙γ is the induced weak Dirichlet-to-Neumann map on the constant quotient, and ω(0):=0,ω(t):=[log⁡ ⁣(1min⁡{t,t0})]−ρ(t>0).

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice, the fixed domain, collar and class parameters in the statement, and γ1=γ, γ2=γ0∈X2(R).

[F1]

The background extensions of the BV class have uniform Lp translation difference bounds Cpt1/p for every sufficiently large finite p. (Calderón admissible conductivity classes, BV translation modulus for the extended conductivity)

[F2]

Enclosing the domain in the fixed disk B=(1/2,1/2)+D1, extending the coefficients by 1, and translating to D1 controls both the disk DN difference and the reciprocal-conductivity disk DN difference by a constant times the original constant-quotient DN norm. The supports of their Beltrami coefficients lie in a fixed Da, a<1. (Weak Dirichlet-to-Neumann map for bounded conductivities, Boundary trace quotient and chart norm equivalence, Well-posedness of the weak conductivity Dirichlet-to-Neumann map, Planar DN comparison under disk enclosure and conductivity reciprocation)

[F3]

Measurable Beltrami coefficients give normalized solutions fμ, principal quasiconformal phases, uniform local W1,r bounds and inverse-gradient Lr−2 bounds at ∣k∣=1. Under a uniform positive power translation modulus, their conductivity CGO combinations uγ=eδγ have continuous onto logarithmic phases and satisfy ∣δγ(z,k)−ikz∣≤C∣k∣1−b for ∣k∣≥1, uniformly in z, for some b>0. On fixed disks the uγ(⋅,1) have a uniform positive Hölder exponent. (Measurable-coefficient Beltrami CGO solutions and principal phases, Uniform power phase decay for Beltrami CGO solutions, Conductivity CGO solutions and continuous logarithmic phases)

[F4]

The scattering amplitudes obey ∣τμ∣≤1, ∂ˉkδγ=−iτμeδ‾γ−δγ, and uniform exponential bounds on their parameter derivatives and those of δγ(z,k) for bounded z. Their difference is at most CδeC(1+∣k∣) in terms of the disk DN difference. (Planar scattering dbar equation and uniform parameter bounds, Uniform DN-to-scattering stability for planar conductivities)

[F5]

If g(0)=0, g(k)=ℓk+O(∣k∣1−b), and ∂ˉg=σg+E with σ uniformly bounded, ∣E∣≤CεeC∣k∣ and ∣∇E∣≤CeC(1+∣k∣), then ∣ℓ∣≥D[log⁡(1/ε)]−b excludes every nonzero zero of g for sufficiently small ε>0. If E=0, every ℓ≠0 excludes them. (Logarithmic zero separation for perturbed scattering phase equations)

[F6]

Uniform power translation bounds for μj, fixed-parameter W1,r bounds for fj, and uniform negative-gradient integrability imply ∥γ1−γ2∥2≤C∥f1−f2∥L∞(D2)η for some η>0, including zero error. This is proved by Caccioppoli, frequency splitting and interpolation. (Conductivity L2 recovery from fixed-parameter Beltrami solution stability)

[A1]

The Axiom of Choice and Countable Choice are assumed in the quoted BV, weak-solution, quasiconformal and Fourier interfaces. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

Given: The data in the statement. Let ε denote the original constant-quotient DN difference appearing in its modulus.

1.1A1F1F2F3givenalgebra

Extend both coefficients by 1 and use the fixed translation in [F2]. Let K=max⁡{2,M,m−1}, κ=(K−1)/(K+1)∈(0,1), and μj=(1−γj)/(1+γj). Then ∣μj∣≤κ and their support lies in Da. The scalar function x↦(1−x)/(1+x) is Lipschitz on [min⁡{m,1},max⁡{M,1}], so [F1] gives ωp(μj,t)≤Cpt1/p for all sufficiently large finite p. Choose 2<r≤pκ sufficiently close to 2 that q=2r/(r−2) and p=2q=4r/(r−2) both lie in this range. These are fixed class-dependent exponents. The same bounds apply to −μj, which correspond to the reciprocal conductivities. Thus all hypotheses of [F3]–[F6] hold uniformly for both conductivity pairs, and [F2] bounds both corresponding disk measurement errors by Cε.

2.1F2F3F4F5step 1.1algebra

For either of these two pairs, write the conductivity phases as δj and amplitudes as τj. Fix z∈D2 and any w∈C, and put g(k)=δ1(z,k)−δ2(w,k). Then g(0)=0 and g(k)=i(z−w)k+O(∣k∣1−b) by [F3], with a constant independent of z,w. The phase equation in [F4] gives ∂ˉkg=σg+E, where, when g≠0, σ=−iτ2[eδ‾1−δ1−eδ‾2−δ2]/g, and set σ=0 where g=0; also E=−i(τ1−τ2)eδ‾1−δ1. Since these exponentials have modulus one and the exponential is Lipschitz on the imaginary axis, ∣σ∣≤2∣τ2∣≤2. By [F2]–[F4], ∣E∣≤CεeC∣k∣ after increasing C, and ∣∇kE∣≤CeC(1+∣k∣): differentiate the amplitude difference and the unit-modulus exponential, using only the parameter derivative bound for δ1(z,k) with z∈D2. This last estimate is independent of w. For w≠z, these are the hypotheses of [F5] with nonzero ℓ=i(z−w); its positive-error conclusion is available when the stated threshold for ∣z−w∣ holds. No application of [F5] is made when w=z. If necessary reduce b below 1; this only weakens the already proved phase bound.

3.1F3F4F5step 2.1algebra

At the fixed parameter k=1, surjectivity of δ2(⋅,1) in [F3] supplies a point w with δ2(w,1)=δ1(z,1). If w=z, the distance and solution-difference bounds below hold immediately. If w≠z, then g(1)=0, so for sufficiently small 0<ε<t0, step 2.1 and [F5] force ∣z−w∣<D[log⁡(1/ε)]−b: the opposite inequality would exclude this nonzero-parameter zero. Reduce t0 so this distance is below one; then w∈D3. The uniform Hölder continuity from [F3], with exponent θ0=1−2/r>0, gives ∣u1(z,1)−u2(z,1)∣=∣u2(w,1)−u2(z,1)∣≤C∣w−z∣θ0≤C[log⁡(1/ε)]−bθ0. The bound holds uniformly for z∈D2, and for both the original and reciprocal pairs. If ε=0, the amplitude differences in [F4] vanish, so E=0; if w≠z, the zero-error clause of [F5] contradicts g(1)=0. Hence w=z. In that case both conductivity CGO pairs agree exactly.

4.1F1F3step 1.1step 3.1algebra

By the definition of the two conductivity combinations, fμj(z,1)=Re⁡uγj(z,1)+iIm⁡uγj−1(z,1). Applying step 3.1 to the two pairs therefore gives ∥fμ1(⋅,1)−fμ2(⋅,1)∥L∞(D2)≤C[log⁡(1/ε)]−bθ0 for small positive ε, and zero difference when ε=0. At this fixed parameter, [F3] gives the uniform W1,r(D3) bound and the inverse-gradient integral with σ=r−2>0. The coefficient modulus needed in [F6] is ωq(μj,t)≤Cqt1/q from step 1.1. Reduce t0 so the displayed solution difference is at most one, as required by [F6].

5.1F1F6step 4.1algebra∎

Apply [F6] with its modulus exponent θ=1/q and inverse-gradient exponent σ=r−2. Its positive exponent is η=θσ/[(1+θ)(2+σ)]. Step 4.1 yields ∥γ1−γ2∥L2(D1)≤C[log⁡(1/ε)]−ρ, with ρ=bθ0η>0, for 0<ε<t0. The translated coefficient difference vanishes outside the original Ω, so this is exactly its L2(Ω) norm. If ε=0, step 4.1 and the zero-error clause of [F6] give equality of the coefficients and the required value ω(0)=0. Finally, for ε≥t0, use ∥γ1−γ2∥2≤2M∣Ω∣1/2 and enlarge C to at least 2M∣Ω∣1/2[log⁡(1/t0)]ρ. Taking t0<1 yields precisely the saturated modulus in the statement. All exponents and constants were fixed using only the listed class and geometry parameters.

Depends on

Used by

Dependency tree · two levels

63 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