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.

BV translation modulus for the extended conductivity

Statement

Assume Countable Choice and let d=2 with the conductivity class X2(R) of the Calderón admissible class. For γ∈X2(R) let γ−1~ be the zero extension of γ−1 from Ω to R2 and set γe:=1+γ−1~. Define B:=max⁡{1,M,m−1}. There is a constant C1 depending only on Ω,m,M,R such that ∥γe(⋅+h)−γe∥L1(R2)≤C1∣h∣(h∈R2). For every finite p>2B there is Cp<∞, depending only on Ω,m,M,R,p, such that sup⁡γ∈X2(R) sup⁡∣h∣≤t∥γe(⋅+h)−γe∥Lp(R2)≤Cpt1/p(t≥0). The outer supremum is taken in [0,∞], with sup⁡∅=0. The extension is an almost-everywhere measurable class; no pointwise continuity is asserted.

Facts & Assumptions

Given: Countable Choice; γ∈X2(R); h∈R2; and p>2B.

[F1]

m≤γ≤M almost everywhere, γ=1 almost everywhere on Ω∖Ω′, and TV(γ;Ω)≤R. (Calderón admissible conductivity classes, Spatial BV and distributional total variation)

[F2]

If u∈BV(Ω) on a bounded Lipschitz domain, then its zero extension lies in BV(R2) with ∥u~∥1+TV(u~;R2)≤CΩ(∥u∥1+TV(u;Ω)), and ∥v(⋅+h)−v∥1≤∣h∣TV(v;R2) for v∈BV(R2). (BV extension and translation bounds)

[F3]

Translation is defined pointwise by τhv(x)=v(x−h). Translates of Lebesgue measurable sets are measurable and have the same measure; in particular a translate of a null set is null. (Translation of a function on Rn, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation)

[A1]

Countable Choice is assumed for the BV extension and translation supplier. (The Axiom of Countable Choice (ACω))

Proof

Given: Countable Choice and γ∈X2(R).

1.1F1F2givenalgebra

Set u:=γ−1 on Ω. Since constants have zero distributional derivative, [F1] gives u∈BV(Ω), TV(u;Ω)=TV(γ;Ω)≤R, and ∥u∥L1(Ω)≤∣Ω∣(M+1). The smooth bounded domain Ω is Lipschitz, so [F2] applies.

2.1A1F2F3step 1.1algebra

By the zero-extension part of [F2], u~∈BV(R2) and TV(u~;R2)≤CΩ(∣Ω∣(M+1)+R)=:V0. If two representatives differ only on a null set N, their values at x+h differ only on N−h, which is null by [F3]. Translated classes are therefore well-defined. Choosing γe=1+u~ pointwise, constants cancel in the difference; the resulting class identity holds for every choice of representatives. Thus ∥γe(⋅+h)−γe∥1=∥u~(⋅+h)−u~∥1≤V0∣h∣. Thus the first inequality holds with C1=V0.

3.1F1F3step 2.1algebra∎

The bound m≤γ≤M inside Ω and the background value 1 outside show ∣γe∣≤B almost everywhere; hence ∣γe(⋅+h)−γe∣≤2B almost everywhere. Applying [F3] and step 2.1 yields ∥γe(⋅+h)−γe∥pp≤(2B)p−1V0∣h∣. Taking p-th roots and then the supremum over ∣h∣≤t gives the second inequality with Cp=((2B)p−1V0)1/p. The bound is uniform in γ, so taking the outer supremum proves the claim when X2(R) is nonempty; when it is empty, the stated convention gives zero. At t=0 both sides vanish.

Depends on

Used by

Dependency tree · two levels

32 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