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.
Local energy and zero-boundary closure for the charged constraint problem
Statement
Assume the Axiom of Choice and Countable Choice. Let be a bounded smooth domain and choose with . Write for the closure of the compactly supported smooth functions. Then for every . A function represents an element of if and only if on .
Statement references
Facts & Assumptions
Given: The axioms, domain, bounding cube and real-valued functions in the Statement.
The Axiom of Choice and Countable Choice are retained for the measure and Sobolev interfaces. The Axiom of Choice The Axiom of Countable Choice ()
The norm is the sum in quadrature of the function and weak-gradient norms; is the closure of . Integer-order Sobolev spaces and their norms Zero-boundary Sobolev space as a norm closure
Cauchy--Schwarz bounds a one-dimensional integral by its interval length and the integral of its square; Tonelli permits integration in successive coordinates. Cauchy-Schwarz inequality for Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
A smooth boundary has local graph charts. Compact subsets of Euclidean open sets admit smooth cutoffs; finitely many such cutoffs, divided by their positive sum near a compact set, give a finite smooth partition there. Bounded C^k domains and boundary charts Test function cutoffs and euclidean localization
Proof
Extend by zero. For fixed , the fundamental theorem of calculus gives . Cauchy--Schwarz bounds its square by . Integrating over the cube gives . Pass to an -convergent compactly supported smooth approximation to obtain the same inequality on .
Suppose and on the boundary. Take a finite graph cover and a subordinate partition from [F3], with an additional interior term. In a boundary chart , is the inward graph coordinate; its Jacobian is one and its differential and inverse differential are bounded on the compact chart. Each localized pullback is , vanishes at , and is supported away from artificial chart edges. The identity gives . Choose a smooth equal to zero for , one for , with . The support of is a layer of volume ; both and are uniformly bounded there. Thus . Transport back and sum the finite partition. The resulting functions have compact support in , and ordinary mollification at a radius smaller than their distance to the boundary approximates each of them in by . Hence .
Conversely, let and choose converging in . In a fixed smaller graph chart, for a pullback and , the identity gives . Average over and integrate over a smaller fixed tangential base. Bounded chart Jacobians and differentials give . Apply this to the localized pullback of ; its boundary value is the localized boundary value of . The right side tends to zero, so that boundary value vanishes almost everywhere. Continuity makes it vanish everywhere: a nonzero value would persist on an open tangential disk of positive area. The finite cover proves .
Steps 1.2 and 2.1 identify zero classical boundary values with the zero-boundary Sobolev closure for the stated representatives. Together with step 1.1 they establish both claims; no unproved trace-to-classical regularity upgrade has been used.
Depends on
Zero-boundary Sobolev space as a norm closure
Integer-order Sobolev spaces and their norms
Bounded C^k domains and boundary charts
Cauchy-Schwarz inequality for
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Test function cutoffs and euclidean localization
The Axiom of Choice
The Axiom of Countable Choice ()