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.
Meyers–Serrin density on an arbitrary open set
Statement
Assume Countable Choice. Let be open with , let , and . Then the intersection is dense in : for every and every there is a function with and . No regularity of and no extension of beyond is assumed. The exponent is excluded, as the companion remark records.
Facts & Assumptions
Given: Countable Choice; an open set with ; ; ; ; a class ; and a tolerance .
Compact exhaustion. Every nonempty open admits compact sets with and ; the sets are closed and bounded, hence compact, and satisfy these inclusions (elementary closed-and-bounded compactness in ; the sets may be enlarged by finite unions, and for bounded the radius clause is inactive for large ; when , interpret the distance to the empty complement as ).
Smooth cutoffs: for compact with open there is with and on a neighbourhood of ; this uses no choice (Test function cutoffs and euclidean localization).
Local smooth approximation: for every open , in as , where is the interior mollification of ; in particular, for any there is with (Local smooth approximation in integer-order Sobolev spaces).
Smooth-factor Leibniz rule: for and one has with the Leibniz formula for , (Weak Leibniz rule with a smooth factor).
Classical smooth compactly supported functions have their classical derivatives as weak derivatives, hence lie in (Classical derivatives agree with weak derivatives).
Norm and linearity: the norm of Integer-order Sobolev spaces and their norms is well defined and definite on classes (The Sobolev norm descends to equivalence classes), weak differentiation is linear on classes (Linearity, locality, and commutation of weak derivatives), and for .
Fatou's lemma: for nonnegative measurable functions , (Fatou's lemma).
Mollification on a compactly supported piece stays compactly supported: if is supported in a compact set and , then the mollification (zero extension outside ) is supported in the closed -neighbourhood of , which is a compact subset of (Local smooth approximation in integer-order Sobolev spaces).
Choice use. Countable Choice selects the exhaustion cutoffs of [F2] and the dyadic mollification radii below; the published weak, and mollification interfaces of [F3]–[F6] also declare it. All selections are countable and can be made by a least-index rule.
Proof
Fix the compact exhaustion of [F1] and, using [F2] and Countable Choice, cutoffs with , on a neighbourhood of and ; set and , for . Then each is nonnegative with , satisfies and on a neighbourhood of , the supports are locally finite, and on ; hence as a locally finite sum of classes. The empty case is trivial because the only class is , so assume .
For each , [F4] gives , supported in the compact set ; using [F3] on the open set and [F8] to keep the support inside , choose so small that is a smooth function compactly supported in and For , also take ; then vanishes near , so the mollified pieces remain locally finite.
Define and . Since the have locally finite supports, is a locally finite sum of smooth compactly supported functions on , hence ; and as a locally finite sum, with each and by step 2.1.
For every one has as locally integrable classes: near any point of only finitely many , hence only finitely many , are nonzero, and on that neighbourhood the identity follows from the linearity and locality of weak differentiation applied to the finite sum; the identity therefore holds as an identity.
Let , so that pointwise for every by the local finiteness of step 4.1. Fatou's lemma applied to the nonnegative functions gives where the middle equality is the norm formula of [F6] and the last inequality is the triangle inequality for the norm together with .
By step 5.1, ; by step 3.1, ; and because and both are. Since and were arbitrary, is dense.
Depends on
- Local smooth approximation in integer-order Sobolev spaces
- Test function cutoffs and euclidean localization
- Weak Leibniz rule with a smooth factor
- The Sobolev norm descends to equivalence classes
- Integer-order Sobolev spaces and their norms
- Fatou's lemma
- Linearity, locality, and commutation of weak derivatives
- Classical derivatives agree with weak derivatives
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
37 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), Theorem 1.21 and Remark 1.22 (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (2020), Theorems 3.8–3.9 (standard reference, not scraped)