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.
Smooth functions are dense in finite-order Sobolev spaces on a reference simplex
Statement
Assume Countable Choice. Let , , , and let be the reference simplex. Then restrictions of functions smooth on a neighbourhood of are dense in in its Sobolev norm. No density assertion for is made.
Facts & Assumptions
Given: The affine reference simplex and Sobolev conventions of Matching affine simplicial meshes and shape regularity and Integer-order Sobolev spaces and their norms, with finite and Countable Choice.
For an invertible affine map , weak derivatives obey ; higher derivatives follow by iterating this constant-matrix rule, with the corresponding determinant norm factors. For a homothety with , this gives . (Affine pullback of weak derivatives and Sobolev seminorms)
For finite , is dense in ; in particular its order-zero case gives density in . (Compactly supported smooth functions are dense in W^{k,p}(R^n))
Smooth cutoffs equal to one near a compact subset of an open set exist; multiplication by a smooth function with bounded derivatives preserves ; and a compactly supported function on an open set extends by zero to . (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order)
Countable Choice is the explicit assumption in the cited Sobolev, weak-derivative and density interfaces. (The Axiom of Countable Choice ())
Proof
Let be the barycenter of and, for , set . The set is open and contains : each point of the closure is carried to a strict convex combination of that point and the interior point , which lies in the open simplex. Thus is defined on for , and [F1] gives .
For every , in as . To see this, extend by zero to and approximate that extension in by using [F2]. For , change of variables bounds the pullback error by ; for fixed , uniform continuity on the compact closure gives uniformly there. First choosing with arbitrarily small error and then taking proves the claim. Applying it to each of the finitely many and using [F1] shows in .
Fix . Since is compactly contained in , choose equal to one near that closure by [F3]. Then has compact support in , so its zero extension belongs to by [F3]. By [F2], choose converging to in that norm. Since on a neighbourhood of the closed simplex, the restrictions converge to in .
Given , choose close enough to one that by step 2.1, and then choose in step 2.2 with . The triangle inequality gives . The choices are finite for each ; Countable Choice is only the declared background of [F4], and no density is used.
Depends on
- Matching affine simplicial meshes and shape regularity
- Integer-order Sobolev spaces and their norms
- Affine pullback of weak derivatives and Sobolev seminorms
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- Test function cutoffs and euclidean localization
- Compactly supported Sobolev functions extend by zero in every integer order
- Weak Leibniz rule with a smooth factor
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Constructive varying-degree triangle interpolation in unweighted H1 Lemma
- Fractional face traces and cellwise Green identity on a simplex Lemma
- Fractional weak Green identity and interior flux cancellation Lemma
- Scaled fractional traces on shape-regular simplices Lemma
- Sobolev traces and Gauss–Green formula on physical simplices Lemma
- Poincare–Wirtinger inequality on a reference simplex Theorem
- Sobolev face traces and Gauss–Green on a reference simplex Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
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
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 12 (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 4 (standard reference, not scraped)