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.
Compactly supported H1 functions lie in H1_0
Statement
Assume Countable Choice. Let be open and let vanish almost everywhere outside a compact set . Then , where is the closure of .
Facts & Assumptions
Given: Countable Choice; open ; compact ; and with almost everywhere on .
The Axiom of Countable Choice () is used through the zero-extension, Meyers--Serrin density and Sobolev closure interfaces [F1], [F2], and [F4]; the cutoff existence [F3] itself is choice-free.
Compactly supported Sobolev functions extend by zero in every integer order: the zero extension belongs to and its Sobolev norm equals that of .
Meyers–Serrin density on an arbitrary open set: under Countable Choice, smooth functions in are dense in .
Test function cutoffs and euclidean localization: for compact there is equal to one on a neighborhood of .
Zero-boundary Sobolev space as a norm closure: is the closure of in the norm.
Proof
By [F1], and on , off . By [F2], choose with in . Choose from [F3].
Multiplication by is bounded on . Indeed, for a weak derivative and a test function , the weak identity gives so ; the boundedness of and its derivatives gives the norm bound. Since almost everywhere, in . Every is smooth and compactly supported in , so [F4] proves .
Depends on
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- Compactly supported Sobolev functions extend by zero in every integer order
- Meyers–Serrin density on an arbitrary open set
- Test function cutoffs and euclidean localization
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
27 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, Chapter 1 §1.3 and Chapter 2, complete lecture notes (standard reference, not scraped)
- John K. Hunter, Notes on Partial Differential Equations, §3.4 (standard reference, not scraped)
- Stefan Takacs, Numerical Analysis of Isogeometric Methods, complete JKU lecture notes, 2018/19 (standard reference, not scraped)