Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 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.

Conductivity L2 recovery from fixed-parameter Beltrami solution stability

Statement

Assume Countable Choice. Let 0≤κ<1, 2<r≤pκ, q=2r/(r−2), 0<θ≤1, and A,U,V>0. For j=1,2, let μj∈L∞(C;R) be supported in D1, with ∥μj∥∞≤κ and ωq(μj,t)≤Atθ(0<t≤1/2). Let fj∈W1,r(D3;C) satisfy ∂ˉfj=μj∂fj‾ and ∥fj∥W1,r(D3)≤U. Suppose, for some σ>0, ∫D1∣∂f2∣−σ dA≤Vσ. Then there is C=C(κ,r,θ,A,U,V,σ) such that, if ε=∥f1−f2∥L∞(D2)≤1, ∥μ1−μ2∥L2(D1)≤Cεη,η=θσ(1+θ)(2+σ)>0. The same estimate holds for γj=(1−μj)/(1+μj) after increasing C. In particular, a logarithmic bound ε≤C0[log⁡(1/δ)]−b with b>0 gives an L2 conductivity bound with exponent bη, and ε=0 gives equality of the conductivities.

Facts & Assumptions

Given: Countable Choice and the coefficients and solutions in the statement.

[F1]

For Fj=ϕfj with a real smooth cutoff ϕ∈Cc∞(D2), the tail of ∂ˉFj^ above frequency T≥6 is at most CU[ωq(μj,3/T)+T−1]. (Beltrami Caccioppoli translation and Fourier-tail estimates)

[F2]

Plancherel and the modulus-one Beurling multiplier give ∥∂F∥2=∥∂ˉF∥2 for compactly supported F∈H1. Integral Hölder holds for arbitrary conjugate exponents at least one. (Planar Cauchy and Beurling transforms and near-two Beltrami inversion, Plancherel theorem, Holder's inequality for integrals, including the endpoint cases)

[F3]

There is a real ϕ∈Cc∞(D2) equal to 1 on a neighborhood of D‾1. (A smooth bump between concentric Euclidean balls)

[A1]

Countable Choice is inherited from [F1]–[F3]. (The Axiom of Countable Choice (ACω))

Proof

Given: The data in the statement.

1.1A1F1F2F3givenalgebra

Fix ϕ from [F3], put F=ϕ(f1−f2) and G=∂ˉF. At frequencies ∣ξ∣<T, the Wirtinger multiplier has magnitude ∣ξ∣/2, so ∥1{∣ξ∣<T}G^∥2≤(T/2)∥F∥2≤CTε. At higher frequencies, apply [F1] to each fj and use θ≤1 to get ∥1{∣ξ∣≥T}G^∥2≤CU(A+1)T−θ for T≥6. Therefore ∥G∥2≤C[Tε+T−θ]. For 0<ε≤1, choose T=max⁡{6,ε−1/(1+θ)} to obtain ∥G∥2≤Cεθ/(1+θ); the range where T=6 is absorbed into C. For ε=0, let T→∞ to obtain G=0. Since ϕ=1 on D1, [F2] implies ∥∂(f1−f2)∥L2(D1)+∥∂ˉ(f1−f2)∥L2(D1)≤2∥G∥2.

2.1F2step 1.1algebra

The negative-power hypothesis makes ∂f2≠0 almost everywhere. Subtract the two Beltrami equations in the form ∂ˉ(f1−f2)=μ1∂(f1−f2)‾+(μ1−μ2)∂f2‾. Thus ∣μ1−μ2∣≤(∣∂ˉ(f1−f2)∣+κ∣∂(f1−f2)∣)∣∂f2∣−1 almost everywhere. Put s=2σ/(2+σ), so 0<s<2 and 1/s=1/2+1/σ. Apply Hölder to the s-th powers with conjugate exponents 2/s and σ/s, both greater than one. This gives (∫D1∣μ1−μ2∣s)1/s≤CV∥G∥2, without needing a triangle inequality when s<1. Step 1.1 consequently bounds this quantity by Cεθ/(1+θ), including ε=0.

3.1step 2.1algebra∎

If κ=0, both coefficients are zero and the conclusion is immediate. Otherwise ∣μ1−μ2∣≤2κ, and hence ∫∣μ1−μ2∣2≤(2κ)2−s∫∣μ1−μ2∣s. Step 2.1 and the square root yield ∥μ1−μ2∥2≤Cεθs/(2+2θ)=Cεη. The scalar map x↦(1−x)/(1+x) has derivative bounded by 2/(1−κ)2 on [−κ,κ]. The mean value theorem therefore gives the same estimate for the two conductivities. Substitution of the stated logarithmic bound for ε gives exponent bη for sufficiently small data, and ε=0 gives equality by step 2.1.

Depends on

Used by

Dependency tree · two levels

41 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