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.
Zero-boundary Sobolev space as a norm closure
Definition
Assume Countable Choice. Let be open with , let , let , and let .
Every belongs to . Indeed is bounded with compact support, hence lies in for every exponent in range, and each of its classical partial derivatives is again smooth and compactly supported, hence lies in and is the corresponding weak derivative by Classical derivatives agree with weak derivatives.
Define the zero-boundary Sobolev space the closure taken in the normed space of Integer-order Sobolev spaces and their norms. The norm is a genuine norm on classes by The Sobolev norm descends to equivalence classes, so this is the usual metric closure of a subset of a normed space: if and only if for every there is with . Write when the scalar field is fixed by context.
Three warnings are part of the definition. First, this is a closure of almost-everywhere classes, and all its equalities are equalities of Sobolev classes. Second, no pointwise boundary values and no trace characterization are asserted: a description of by vanishing boundary data belongs to the later trace theory and is not used here. Third, the closure is defined for every , but for it is not claimed that every compactly supported function lies in ; the definition merely names the closure of the test functions.
Source notes
Kinnunen, Definition 1.23 and Remarks 1.24, printed pp. 21–22, defines as the closure of the test functions and warns that this is not yet a boundary-value statement. Laugesen, Definition 3.11, printed p. 59, uses the same closure convention for .
Depends on
Used by
Dependency tree · two levels
19 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
- Juha Kinnunen, Sobolev Spaces (2026), Definition 1.23 (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (2020), Definition 3.11 (standard reference, not scraped)