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.

One-sided BV traces and Green identity on a Lipschitz graph

Statement

Assume Countable Choice. In a Lipschitz graph chart let G be the side z>h(y), and let u∈BV(G) locally, with finite L1 norm and variation on each smaller bounded graph collar under consideration. On every smaller base box B there is a unique local L1(B) trace τu such that u(y,h(y)+t)⟶τu(y)in L1(B) as t↓0 through almost every t. The trace is linear and satisfies a bound ∥τu∥L1(B)≤C(a−1∥u∥L1(C2a)+∣Du∣(C2a)), where C2a is a fixed larger graph collar with positive margins at the chart sides and a>0 is sufficiently small. For every smooth vector field ϕ compactly supported away from those sides, ∫Gudiv⁡ϕ=−∫Gϕ⋅dDu+∫τu(y)ϕ(y,h(y))⋅(Dh(y),−1) dy. The corresponding assertions hold for the subgraph with the normal reversed. For an interval endpoint in dimension one, the same assertions mean the one-sided scalar limit, the usual endpoint sign, and counting measure on the boundary.

Facts & Assumptions

Given: Countable Choice and a smaller graph collar with closure, except its graph face, contained in the larger chart. Write Cb={(y,z):y∈B′, 0<z−h(y)<b} for a larger base box B′⊃B‾ and sufficiently small b.

[F2]

Completed Euclidean Fubini and Tonelli hold under Countable Choice. Vertical translation in each fixed base slice therefore preserves volume for (y,t)↦(y,h(y)+t). (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures)

[F3]

A Lipschitz function is differentiable almost everywhere, its ordinary and weak derivatives agree, and graph area and normal have the formulas in the preceding lemma. (Lipschitz graph area and calculus under Countable Choice)

[F4]

Finite signed Radon measures are determined by compactly supported smooth tests, and smooth cutoffs exist on nested balls. (Uniqueness of a Radon measure representing a distribution, A smooth bump between concentric Euclidean balls)

Proof

Given: The chart and u in the Statement.

1.1F1F2givenconstruct

Fix a>0 with C2a inside the larger chart. On every compact subset of G, mollify u using a nonnegative unit-mass bump, writing uϵ=u∗ρϵ where the convolution ball stays in G. The distributional derivative identity and [F2] give ∂zuϵ=(Dzu)∗ρϵ there. For 0<s<t<a, ordinary line integration gives ∫B∣uϵ(y,h(y)+t)−uϵ(y,h(y)+s)∣ dy≤∫{y∈B, s<z−h(y)<t}∣∂zuϵ∣ dx. For sufficiently small ϵ, the ϵ-neighborhood of this last strip lies in C2a: its lower height is positive since s>0, its upper height is below 2a, and its lateral projection lies in B′. The convolution bound and [F2] make the right side at most ∣Dzu∣(C2a), since each kernel integrates to at most one.

2.1F1F2step 1.1construct

On each compact-height collar y∈B, 1/j<z−h(y)<a−1/j, [F1] gives L1 convergence of uϵ to u. Choose a sequence ϵℓ↓0 whose L1 errors on the first ℓ such collars are below 2−ℓ, always using the least sufficiently large dyadic exponent. By [F2], for a full-measure set of heights the slice functions converge in L1(B). Applying step 1.1 at two such heights proves ∥ut−us∥L1(B)≤∣Dzu∣(C2a),ut(y)=u(y,h(y)+t),0<s,t<a. Repeat this construction for a countable sequence of smaller a tending to zero and intersect the full-measure height sets. The collars C2a decrease to the empty set inside G, so finiteness of ∣Dzu∣ implies their measures tend to zero. Thus ut is Cauchy in L1(B) as t↓0 outside one null set.

3.1F2step 2.1chooseconstructalgebra

Choose one height from each interval (2−j−1a,2−ja) outside that null set by Countable Choice. The corresponding Cauchy sequence has an L1 limit: choose measurable representatives, then a subsequence whose successive L1 differences are below 2−j; [F2] makes the sum of the absolute differences integrable and gives its almost-everywhere and L1 limit. The Cauchy estimate in step 2.1 makes this limit independent of heights and gives the asserted convergence along all good heights. This also proves uniqueness and linearity. Averaging the bound ∥τu∥1≤∥ut∥1+∣Dzu∣(C2a) over 0<t<a using [F2] gives ∥τu∥1≤a−1∥u∥L1(Ca)+∣Dzu∣(C2a). Since ∣Dzu∣≤∣Du∣, this is the stated bound. Traces obtained on nested base boxes coincide by the same slice convergence.

4.1F1F2F3step 3.1constructalgebra

The distributional identity extends from smooth to compactly supported Lipschitz vector fields ψ inside G. Indeed mollification converges uniformly to ψ, while its derivatives are uniformly bounded and converge almost everywhere to the weak derivatives, by [F3] and Lebesgue differentiation: if g is a bounded weak derivative at a strong Lebesgue point x, then ∣g∗ρϵ(x)−g(x)∣≤Cϵ−n∫B(x,ϵ)∣g(y)−g(x)∣ dy→0. Consequently ∫ψϵ⋅dDu→∫ψ⋅dDu by uniform convergence and finiteness, and ∫udiv⁡ψϵ→∫udiv⁡ψ by dominated convergence. Set r=z−h(y) and let θ be the continuous function zero on (−∞,0], linear from zero to one on [0,1], and one on [1,∞). For fixed ϵ>0 use ψ=ϕθ((r−ϵ)/ϵ), whose support is a compact subset of G. Its almost-everywhere gradient uses the ordinary chain rule from [F3], and its transition term is ϵ−1∫ϵ2ϵ∫ut(y)ϕ(y,h(y)+t)⋅(−Dh(y),1) dy dt. By step 3.1, the uniform bound on Dh, and uniform continuity of ϕ, this converges to ∫τu ϕ(y,h(y))⋅(−Dh,1) dy. The other terms converge to ∫Gudiv⁡ϕ and −∫Gϕ⋅dDu, since the cutoff tends pointwise to one in G. Rearrangement proves the Green formula.

5.1F3F4step 3.1step 4.1algebra∎

These formulas also show independence of the direction of a valid graph chart. On an overlap, [F3] applied to u=1 first identifies the outward vector surface measures by [F4]. Their variations are their scalar graph measures: for a unit measurable density n against a finite positive measure μ, variation is at most μ by the triangle inequality, and is at least (1−η)μ by partitioning the unit sphere into finitely many Borel sets of diameter below η and projecting each vector integral onto a representative direction. Let η↓0. Thus the outward normals agree almost everywhere. Subtract the two Green formulas for general u; [F4] makes (τ1u−τ2u)nμ zero, and the same variation argument gives τ1u=τ2u almost everywhere. Reflection gives the subgraph formulas. In dimension one, omit the base integral: the convolution and line estimate in steps 1.1–2.1 make u(t) Cauchy through almost every t approaching an endpoint, and step 4.1 gives the endpoint boundary term. All arguments and bounds remain valid, with scalar absolute value and counting measure.

Depends on

Used by

Dependency tree · two levels

76 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