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.

Trace formula and bounded zero extension on Lipschitz domains

Statement

Assume Countable Choice. Here Hm on a boundary denotes normalized Hausdorff measure: the repository's unnormalised m-dimensional Hausdorff measure divided by cm=Hm((0,1]m) for m≥1, and counting measure for m=0. Let n≥2 and let Ω⊂Rn be a bounded Lipschitz domain, meaning a bounded open set whose boundary has a finite cover by coordinate neighborhoods in which it is the graph of a Lipschitz function and Ω lies on one side of the graph. There is a unique bounded linear trace operator T:BV(Ω)→L1(∂Ω,Hn−1) such that for every u∈BV(Ω) and ϕ∈Cc1(Rn;Rn), ∫Ωu div⁡ϕ dx=−∫Ωϕ⋅dDu+∫∂ΩTu ϕ⋅ν dHn−1, where ν is the outward unit normal defined almost everywhere on ∂Ω. The zero extension u~ belongs to BV(Rn) and satisfies TV(u~;Rn)=TV(u;Ω)+∥Tu∥L1(∂Ω)≤CΩ(∥u∥L1(Ω)+TV(u;Ω)) for a finite constant CΩ depending only on the domain. The same conclusions hold in dimension one for a bounded open set with a finite one-sided graph cover, with the two one-sided endpoint traces and counting measure on its finite boundary.

Facts & Assumptions

Given: Countable Choice, a bounded Lipschitz domain Ω⊂Rn, and u∈BV(Ω).

[F1]

Every smaller Lipschitz graph chart has a linear one-sided L1 trace, its local norm estimate, and the local BV Green formula. Traces agree on overlapping charts. The same result supplies the endpoint case in dimension one. (One-sided BV traces and Green identity on a Lipschitz graph)

[F2]

Normalized Hausdorff measure on a Lipschitz graph has density 1+∣Dh∣2, with its almost-everywhere unit outward normal. (Lipschitz graph area and calculus under Countable Choice)

[F3]

Compact sets admit finite smooth cutoff covers, and finite signed Radon measures are determined by smooth compactly supported tests. (A smooth bump between concentric Euclidean balls, Uniqueness of a Radon measure representing a distribution)

[F4]

A finite vector of signed Radon measures has finite Radon partition variation. (Variation of a finite vector Radon measure is Radon)

[F5]

Since Ω is bounded, Ω‾ and ∂Ω are closed bounded subsets of Rn, hence compact. A finite subcover by smaller graph charts still covers ∂Ω; the graph area formula in [F2] gives finite Radon surface measure there. In dimension one the finite chart cover makes the boundary finite. (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line)

[F6]

If μ is a finite positive Radon measure and f∈L1(μ;R), then the signed measure fμ is finite Radon. For ρ:=∣f∣μ, truncate f so the L1 tail is arbitrarily small. For the bounded truncation, compact inner approximation of open sets and open outer approximation of Borel sets for μ control the weighted errors by the uniform bound. Taking the tail and regularity errors to zero gives compact inner regularity on open sets and outer regularity on Borel sets for ρ. Finiteness upgrades compact approximation to all Borel sets: for Borel A, choose compact C⊂X with ρ(X∖C)<ϵ/2 and open G⊃X∖A with ρ(G∩A)<ϵ/2; then C∖G is compact in A and ρ(A∖(C∖G))<ϵ. Finally, the partition of A into A∩{f≥0} and A∩{f<0} gives ∣fμ∣=∣f∣μ=ρ, so the signed measure has regular total variation.

[F7]

A compactly supported C1 vector field can be approximated together with its first derivatives uniformly by smooth compactly supported mollifications. Normalize a nonnegative bump from [F3] to mass one; uniform continuity of the field and its derivatives gives uniform convergence, and differentiation of the convolution follows by integration by parts.

Proof

Given: Countable Choice and the bounded Lipschitz domain in the Statement.

1.1F1F2F5givenconstruct

If Ω=∅, its BV space and boundary L1 space are both the zero space, the zero trace is unique, and every formula and estimate holds with both sides zero. Assume henceforth Ω≠∅. By [F5], ∂Ω is compact; choose finitely many smaller graph charts with positive margins inside the original charts that still cover it. Each smaller graph base is bounded and its Lipschitz constant finite, so [F2] gives finite Radon surface measure on that patch and Hn−1(∂Ω)<∞. In each chart [F1] defines a local trace and bounds its surface L1 norm, using [F2], by a chart constant times ∥u∥1+∣Du∣(Ω). On overlaps these local traces agree by [F1]. Consequently they define one class Tu∈L1(∂Ω,Hn−1) with ∥Tu∥1≤C(∥u∥1+TV(u;Ω)). Linearity follows locally from [F1], hence globally.

2.1F1F2F3F5F7step 1.1constructalgebra

Construct a finite smooth partition equal to one on a neighborhood of Ω‾, subordinate to the boundary charts and the interior open set Ω: by [F5] this compact set is covered by finitely many balls with doubled closures in those open sets; take the bumps in [F3], and divide them by their positive sum near Ω‾. Multiply by one further smooth cutoff supported where the sum is positive and equal to one near Ω‾. First take ϕ∈Cc∞(Rn;Rn) and apply the local Green identity [F1] to each chart-supported field ηjϕ. For the interior-supported field the defining distributional identity applies. Sum the identities. Since ∑jηj=1 and ∑j∇ηj=0 near Ω‾, the interior and boundary sums are exactly ∫Ωudiv⁡ϕ=−∫Ωϕ⋅dDu+∫∂ΩTu ϕ⋅ν dHn−1. For an arbitrary ϕ∈Cc1, use [F7] to approximate ϕ and its first derivatives uniformly by compactly supported smooth fields; finite variation and Tu∈L1 pass every term to the limit.

3.1F2F4F6step 1.1step 2.1construct

Extend each coordinate of Du by zero from Ω to Rn. It is a finite signed Radon measure: compact inner approximation can be performed inside Ω, and outer approximation in the ambient space follows by applying that inner approximation to the complement and using finiteness. For each coordinate i, the boundary density fi:=Tu νi is integrable because Tu∈L1 and ∣νi∣≤1. By [F6], fiHn−1∣∂Ω is a finite signed Radon measure; this verifies the required weighted-measure regularity, not just its finiteness. Thus their difference μ=i#Du−Tu νHn−1∣∂Ω is a finite Radon vector measure by [F4]. The formula in step 2.1 says exactly that Du~=μ, so u~∈BV(Rn).

4.1F3step 1.1step 3.1algebra

The two summands defining μ in step 3.1 are supported on the disjoint Borel sets Ω and ∂Ω. The partition definition of variation therefore gives the sum of their variations. For a unit measurable vector density ν and scalar density Tu, the boundary variation is ∣Tu∣Hn−1: the triangle inequality gives the upper bound, and a finite partition of the unit sphere into pieces of diameter below ϵ, applied to the direction sgn⁡(Tu)ν, gives the lower bound (1−ϵ)∣Tu∣Hn−1 by projection; let ϵ↓0. Hence TV(u~)=TV(u;Ω)+∥Tu∥1. Step 1.1 gives the asserted bound. If another trace satisfied the Green identity, their difference times νHn−1 would integrate to zero on all smooth tests, hence be zero by [F3]; the same variation calculation gives equality of the trace classes.

5.1F1F3step 2.1step 3.1step 4.1construct∎

In dimension one, each smaller graph neighborhood contains one boundary point, so the finite graph cover makes the boundary finite. A bounded open set with finite boundary is a finite disjoint union of bounded intervals. Use the one-sided endpoint construction in [F1] on each of their finitely many endpoints. The partition argument of step 2.1 and the disjoint interior/boundary measure calculation in steps 3.1–4.1 apply verbatim with H0 counting measure and outward signs −1 at a left endpoint and +1 at a right endpoint. This proves the stated dimension-one companion.

Depends on

Used by

Dependency tree · two levels

68 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