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.

Test-field formula and L1 lower semicontinuity of spatial TV

Statement

For every open Ω⊆Rn and real-valued u∈BV(Ω), TV(u;Ω)=sup⁡{∫Ωu div⁡φ dx:φ∈Cc∞(Ω;Rn), ∣φ(x)∣≤1}. If uk,u∈BV(Ω) are real-valued and uk→u in L1(Ω), then TV(u;Ω)≤lim inf⁡kTV(uk;Ω). In addition, assuming Countable Choice, for any real-valued u∈L1(Ω) the displayed supremum is finite if and only if u∈BV(Ω), with equality to TV(u;Ω); under the same assumption, an L1 limit of real-valued BV functions with bounded liminf total variation belongs to BV(Ω) and satisfies the same lower-semicontinuity inequality.

Facts & Assumptions

Given: An open set Ω⊆Rn, a real-valued u∈BV(Ω), and, for the lower-semicontinuity clause, real-valued uk∈BV(Ω) with uk→u in L1(Ω).

[A1]

Countable Choice is assumed only for the finite-test-supremum characterization of arbitrary L1 functions. (The Axiom of Countable Choice (ACω))

[F1]

The distributional derivative acts on a compactly supported smooth test function by the negative-transpose formula. (Spatial BV and distributional total variation)

[F2]

The partition variation of a finite vector of signed Radon measures is a finite positive Radon measure and equals the supremum over compactly supported continuous vector fields of norm at most one. (Variation of a finite vector Radon measure is Radon)

[F3]

C0(Ω) is the space of continuous functions vanishing at infinity; compactly supported smooth functions are dense in it in the uniform norm. (Compact support, Cc(X), and C0(X), Smooth compactly supported functions are dense in C0 on an open Euclidean set)

[F4]

Under Countable Choice, every bounded real linear functional on C0(Ω;R) is integration against a unique finite signed Radon measure. This specialized Euclidean construction uses explicit cutoffs and no Dependent Choice. (Euclidean real Radon representation under Countable Choice)

Proof

Given: The hypotheses listed above.

1.1F1F2F3givenchoose

Suppose u∈BV(Ω) and write μ=Du. The distributional derivative identity gives ∫Ωu div⁡φ dx=−∫Ωφ⋅dμ. The continuous-field dual formula [F2] bounds the supremum over smooth fields by ∣μ∣(Ω). Conversely, for any f∈Cc(Ω;Rn) with ∣f∣≤1, for every ε>0, density [F3] gives one smooth compactly supported g with ∥g−f∥∞<ε; replacing g by g/max⁡(1,∥g∥∞) keeps the unit bound and changes this error by at most another ε. Finiteness of the coordinate measures bounds the integral error by a fixed constant times ε. Letting ε↓0 (without selecting a sequence of approximants) shows that the smooth supremum is at least the continuous-field supremum ∣μ∣(Ω). Thus V(u)=TV(u;Ω).

1.2A1F2F3F4givenconstruct

Assume [A1], let real-valued u∈L1(Ω), and suppose M:=V(u)<∞. For each coordinate i, define Li(ψ):=−∫Ωu ∂iψ dx on real Cc∞(Ω). Taking the test vector with only its ith component equal to ψ and also its negative shows ∣Li(ψ)∣≤M∥ψ∥∞. By density [F3], Li extends uniquely to a bounded real linear functional on real C0(Ω). Apply [F4] directly to this real functional to obtain a finite signed Radon measure μi representing Diu. Applying [F2] to μ=(μ1,…,μn) and using [F3] to pass between continuous and smooth unit fields gives ∣μ∣(Ω)=M. Hence u∈BV(Ω) and TV(u;Ω)=M.

2.1givenstep 1.1

If the L1 limit u is already in BV(Ω), boundedness of div⁡φ gives ∫u div⁡φ=lim⁡k∫uk div⁡φ for each admissible φ. Each approximating integral is at most TV(uk;Ω) by step 1.1, so taking the supremum gives TV(u;Ω)≤lim inf⁡kTV(uk;Ω); this branch uses no choice axiom.

3.1A1givenstep 1.2choose∎

If only L:=lim inf⁡kTV(uk;Ω)<∞ is known, choose a subsequence whose variations converge to L. The same test-integral limit gives V(u)≤L. Under [A1], step 1.2 implies u∈BV(Ω) and TV(u;Ω)=V(u)≤L. If L=+∞, the extended inequality is automatic.

Depends on

Used by

Dependency tree · two levels

26 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