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.

The full collared EIT class satisfies the centered range and source interfaces

Statement

Assume the Axiom of Choice, Countable Choice and Dependent Choice. Let Ω=B1⊂R3, 0<ρ<1, 0<m<1<M, and 5/2<s1<7/2. Use the exact intrinsic Hs1(Ω) Hilbert norm from the collared source-functional lemma, and put V={a∈Hs1(Ω;R):a=0 a.e. on Ω∖Bρ},C={σ∈1+V:m≤σ≤M}. Let σ0,σ†∈C, and assume σ†∈B2,∞s2(Ω) for s1<s2<2s1−1. Set a†=σ†−σ0, and choose R>∥a†∥V. Write Y=ℓ2(L2(S2;C)) for the centered mean-zero Neumann voltage sequence space, regarded as a real Hilbert space, and give X=Z=V×Y the sum norm. Let X0=V×{0}, D=X, x0=(0,0) and P(a,z)=(0,z).

There is a globally Lipschitz, continuously Fréchet differentiable map Γ:V→Y with globally Lipschitz derivative, agreeing for σ0+a∈C with the centered physical observation ((Nσ0+a−N1)Yℓk)ℓ,k. Define T(a)=Γ(a)−Γ(0)−Γ′(0)a,r(a,z)=(a,z+T(a)),K(a,b)=Γ′(0)a+b,F(a,z)=Γ(a)+z. Then F(x)−F(x0)=Kr(x) on D, r and its inverse r−1(a,b)=(a,b−T(a)) are globally Lipschitz, and these facts hold on the admitted set U={(a,z):σ0+a∈C, ∥a∥V<R, ∥z∥Y<R}. The projected points (I−P)r−1(r^) belong to U∩X0 for r^∈r(U).

On the ambient linear space V define the proper convex regularizer Rˇ(a)=12∥σ0+a∥s1,Ω2+IC(σ0+a), where the indicator is zero on C and +∞ elsewhere. On every admitted physical coefficient this is exactly the original quadratic Sobolev penalty. The functional ξ†(v)=(σ†,v)s1,Ω is a subgradient at a†, and its Bregman distance on C−σ0 is exactly 12∥a−a†∥V2. On every fixed sublevel containing the truth, the VSC holds with b=3/4 and a continuous nondecreasing concave truncated logarithmic index ψ(u)=C[log⁡(1/u)]−ν(0<u≤u0),ψ(0)=0,ν=(s2−s1)(2s1−3)s2−1, continued constantly above a sufficiently small u0>0. Its subadditivity constant may be taken as Cψ=1.

Put LT=Lip⁡(T) and let L=Lip⁡(Γ′). For Q(r^,r^′)=∥r^−r^′∥Z, the projection-coupling constant may be taken as 1+LT, and ∥r(x1)−r(x2)−r′(x2)(x1−x2)∥Z≤LR∥r(x1)−r(x2)∥Z(x1,x2∈U). For the frozen method choose CP≥2∥K∥2Lip⁡(r)2, γ>1 and RP(z)=γψ(CP∥z∥Y2). Then the required compatibility bound holds with C~Q=max⁡{4(1+LT)2,2R2ψ(CPR2)}. In particular, the structural hypotheses of the joint and frozen one-step estimates hold with p=2, the displayed exact regularizer, RP=0 for the joint method, and the displayed RP for the frozen method. For frozen rates additionally require LR<ctcr<1/20, choose cβα≤min⁡{1/4,γ−1}/(4C~Q), and use the remaining parameter, tolerance and stopping conditions of the frozen rate theorem. This small-neighborhood hypothesis is local around the chosen initial conductivity; it restricts neither the stated Besov truth class nor its logarithmic exponent.

Facts & Assumptions

Given: The choice assumptions and full conductivity, Sobolev, Besov, collar and local-admission data in the Statement.

[F1]

The centered physical map on uniformly elliptic collared L∞ coefficients is globally Lipschitz on each fixed ellipticity class, is continuously Fréchet differentiable there, and has a uniform Lipschitz derivative. Centered Neumann voltage sequences on the three-dimensional ball

[F2]

Uniform collared Hs1 classes satisfy H1 stability with modulus O([log⁡(1/δ)]−(s1−3/2)) in their centered sequence distance. H1 logarithmic stability from centered three-dimensional NtD data

[F3]

For the exact intrinsic quadratic penalty, the H1 modulus and B2,∞s2 truth imply a VSC with coefficient 3/4 and logarithmic exponent ν in the Statement. The proof treats the exact domain inner product. Besov smoothness gives the exact collared Sobolev penalty a cutoff source bound

[F4]

Truncated logarithmic indices are concave when the truncation point is small enough, and their conjugates satisfy H(q)∼C(log⁡q)−ν. Logarithmic source indices and their admissible parameter scales

Proof

Domains for the generic estimates. The canonical maps iV:V→X0, iV(a)=(a,0), and iY:Y→P(X), iY(z)=(0,z), are linear isometries onto X0=V×{0} and P(X)={0}×Y. In the generic one-step estimates, transport the regularizer and subgradient by Rˇ0(iV(a)):=Rˇ(a),ξ0†(iV(v)):=ξ†(v), and the frozen penalty by RP,0(iY(z)):=γψ(CP∥z∥Y2). The map iV preserves the dual pairing, so the subgradient inequality verified in step 3.2 transports to ξ0†∈∂X0Rˇ0(iV(a†)). It also preserves the Bregman distance: DRˇ0ξ0†(iV(a),iV(a†))=DRˇξ†(a,a†). The penalty is a functional on P(X) under iY and has the required norm there. These are the domains used by the generic joint and frozen estimates.

1.1A1F3givenalgebra

The space V is closed in the intrinsic Sobolev Hilbert space, since convergence there implies L2 convergence and preserves vanishing on the collar. For its elements, zero extension is bounded into Hs1(R3) by [F3]. Fourier Cauchy–Schwarz gives ∥a∥∞≤C∥a∥V because s1>3/2. Thus V embeds continuously into the bounded collared coefficient space. The set C−σ0 is convex and closed in V: convexity preserves the pointwise bounds, and uniform convergence from this embedding preserves them under a norm limit.

2.1F1step 1.1choosealgebra

Choose a smooth scalar function ϑ with 0≤ϑ≤1, equal to one on [m,M] and zero outside (m/2,2M), and set g(t)=1+∫1tϑ(u)du. Then g(t)=t on [m,M], g(1)=1, and m/2≤g(t)≤2M globally. All its first and second derivatives are bounded. Put b(a):=g(σ0+a)−1. Since σ0+a=1 outside Bρ and g(1)=1, b(a)∈E for every a∈V. Moreover, a↦b(a) is globally Lipschitz from V into E and continuously Fréchet differentiable, with derivative b′(a)h=g′(σ0+a)h and globally Lipschitz derivative; its Taylor remainder is bounded by 12∥g′′∥∞∥h∥∞2. Use the centered map [F1] with fixed strict ellipticity bounds m∗:=m/4 and M∗:=4M, and denote it by Gm∗,M∗. Since m∗<m/2≤1+b(a)≤2M<M∗, every b(a) is admissible for that map. Define explicitly Γ(a):=Gm∗,M∗(b(a))=Gm∗,M∗(g(σ0+a)−1)(a∈V). The chain rule gives Γ′(a)h=Gm∗,M∗′(b(a))[g′(σ0+a)h]. The bounded and Lipschitz derivatives of b and the Lipschitz derivative of the centered supplier give all the asserted global bounds for Γ and Γ′. For σ0+a∈C, g(σ0+a)=σ0+a, so this formula agrees with the centered physical observation.

3.1step 2.1givenalgebra

The identities for K,r,F and the inverse follow by direct substitution. The map T is globally Lipschitz with LT≤Lip⁡(Γ)+∥Γ′(0)∥, so both r and r−1 have Lipschitz constant at most 1+LT in the sum norm. In particular ∥Pr−1(a,b)−Pr−1(a′,b′)∥≤(1+LT)∥(a,b)−(a′,b′)∥. The restriction of a bijection to U is a bijection onto r(U); its projected inverse point has the same coefficient and zero artificial voltage, hence remains in U∩X0. The extension to all of D=X supplies the global factorization domain required by the original generic hypotheses without changing the physical forward map on any admitted point.

3.2F2F3F4step 1.1step 2.1algebra

The indicator of the convex set in step 1.1 is convex, and adding the quadratic functional makes Rˇ proper and nonnegative. For any admitted a, expansion of its square gives Rˇ(a)−Rˇ(a†)−ξ†(a−a†)=12∥a−a†∥V2; outside the set the subgradient inequality is automatic because the left value is infinite. This proves the asserted subgradient and exact Bregman formula. On a fixed sublevel Rˇ(a)≤R0, the coefficients have bounded intrinsic Hs1 norm; subtracting the constant background and zero-extending gives a uniform whole-space bound by [F3]. Thus [F2] applies uniformly on that sublevel, including the truth. Applying [F3] yields the VSC source term C[log⁡(1/∥Γ(a)−Γ(a†)∥)]−ν for small data differences. Replacing the norm argument by its square changes only a fixed constant in the logarithm. Choose u0 small enough and then enlarge C to dominate the source inequality also at larger data differences; on the fixed sublevel the absolute linear pairing is uniformly bounded. The truncated logarithmic index in [F4] is then a valid concave VSC index on the entire sublevel.

4.1step 2.1step 3.1step 3.2algebra

Concavity and ψ(0)=0 imply subadditivity: for positive a+b, ψ(a)≥aψ(a+b)/(a+b) and ψ(b)≥bψ(a+b)/(a+b); summing gives ψ(a+b)≤ψ(a)+ψ(b). Hence Cψ=1. The derivative remainder of r has only the second component Γ(a1)−Γ(a2)−Γ′(a2)(a1−a2). Integrating the Lipschitz derivative along the segment gives norm at most L∥a1−a2∥V2/2. Since ∥ai∥<R and the first component of r(x1)−r(x2) is a1−a2, this is at most LR∥r(x1)−r(x2)∥Z. No differentiability of the boundary of C is needed, since the map was differentiated on the full ambient space.

5.1step 3.1step 3.2step 4.1givenalgebra

If r^=r(a,z)∈r(U), then ∥r^−r(a†,0)∥Z≤(1+LT)∥a−a†∥V+∥z∥Y. Squaring gives a bound by 4(1+LT)2DRˇξ†(a,a†)+2∥z∥Y2. Because ∥z∥<R, concavity gives ψ(CP∥z∥2)≥(∥z∥2/R2)ψ(CPR2). The displayed C~Q therefore proves the full frozen compatibility inequality for every admitted range variable. Its denominator is positive since the logarithmic index is positive away from zero. The stated RP has the required lower bound with equality and vanishes at zero.

6.1step 3.1step 3.2step 4.1step 5.1givenalgebra∎

All projected coefficients in U have ∥σ0+a∥s1,Ω≤∥σ0∥s1,Ω+R, so one fixed R0 covers their regularizer values and the truth. The preceding steps verify every structural range, domain, Lipschitz, projection, subgradient, VSC, compatibility and penalty hypothesis. With p=2 and Cψ=1, the frozen constants are t=1/4−2ctcr2, v=3ctcr2, λ=1/2 and C‾=4. The bound ctcr<1/20 makes t>0 and q=v/t<1. The displayed choice of cβα is exactly the required linked-parameter bound because 1−b=1/4 and γ−Cψ=γ−1. Thus the original generic estimates apply on the admitted set with their remaining stated algorithmic hypotheses. The ambient extension and indicator do not change any admitted objective value.

Depends on

Used by

Dependency tree · two levels

44 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