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.

Rough conductivity Alessandrini identity and constant-quotient norm

Statement

Assume the Axiom of Choice and Countable Choice. Let Ω⊂(0,1)d, d≥2, be a nonempty bounded connected smooth domain, and let γ1,γ2 be real measurable conductivities with 0<m≤γj≤M<∞ almost everywhere. Put D=H1(Ω;C)/H01(Ω;C) and E=D/C1, both with their quotient norms. For fj∈D, let uj be the weak γj-conductivity solution with trace class fj. Then ((Λγ1−Λγ2)f1)(f2)=∫Ω(γ1−γ2)∇u1⋅∇u2‾ dx. The exact norm equality ∥Λγ1−Λγ2∥L(D,D∗)=∥Λ˙γ1−Λ˙γ2∥L(E,E∗)=:δ holds, and consequently the integral above has absolute value at most δ∥[f1]∥E∥[f2]∥E, and at most δ∥u1∥H1(Ω)∥u2∥H1(Ω). Here [fj] denotes the coset modulo constants; the stars denote continuous conjugate-linear duals.

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice, the domain and conductivities in the statement, and trace classes f1,f2∈D.

[F1]

The energy form is aj(v,w)=∫Ωγj∇v⋅∇w‾ dx, and (Λγjf)(g)=aj(uj,f,Vg) for every representative Vg of g. The quotient norm of [f]∈E is inf⁡c∈C∥f+c1∥D. (Weak Dirichlet-to-Neumann map for bounded conductivities)

[F2]

Each trace class has a unique weak conductivity solution, aj(uj,f,z)=0 for every z∈H01, and the bounded DN map kills constants and annihilates constant test classes. (Well-posedness of the weak conductivity Dirichlet-to-Neumann map)

[A1]

The Axiom of Choice and Countable Choice are assumed at [F1]–[F2]. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

Given: The data in the statement.

1.1A1F1F2givenalgebra

Let v be the weak γ2 solution with trace class f1, available by [F2]. The difference u1−v belongs to H01. The real-valuedness of γ2 makes a2 Hermitian, so a2(u1−v,u2)=a2(u2,u1−v)‾=0. By the representative independence in [F1], ((Λγ1−Λγ2)f1)(f2)=a1(u1,u2)−a2(v,u2)=a1(u1,u2)−a2(u1,u2). Subtraction of these two integrals is precisely the asserted conductivity identity. All integrals are absolutely convergent since the coefficients are bounded and the solution gradients are square integrable.

1.2F1F2algebra

Set T=Λγ1−Λγ2 and b(f,g)=(Tf)(g). By [F2], b(f+c1,g+c′1)=b(f,g) for all constants c,c′. If N=∥T∥L(D,D∗), then ∣b(f,g)∣≤N∥f+c1∥D∥g+c′1∥D. Taking the two infima independently gives ∣b(f,g)∣≤N∥[f]∥E∥[g]∥E, including zero quotient norms. Thus the descended form has norm at most N. Conversely, the quotient map has norm at most one, so a bound ∣b(f,g)∣≤N′∥[f]∥E∥[g]∥E implies ∣b(f,g)∣≤N′∥f∥D∥g∥D. Taking suprema over the two unit balls gives N≤N′. The operator norm into a conjugate-linear dual is exactly this supremum of absolute form values by the definition of the dual norm. Hence the two operator norms are equal.

2.1F1step 1.1step 1.2algebra∎

The descended form in step 1.2 is exactly the difference of the two induced DN maps, so its norm is the stated δ. Applying its form bound to step 1.1 proves the first integral bound. Since uj represents fj, the two successive quotient infima give ∥[fj]∥E≤∥fj∥D≤∥uj∥H1. Multiplying these inequalities proves the second bound, with no coefficient-dependent norm conversion factor.

Depends on

Used by

Dependency tree · two levels

14 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