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.
Schwartz space is dense in L2
Statement
Assume countable choice and let . Every Schwartz function belongs to complex , and the classes represented by are dense there.
Facts & Assumptions
Given: The Axiom of Countable Choice () and the seminorm definition Schwartz space and its seminorms.
The complex smooth-density interface gives approximation in finite-exponent Euclidean spaces (Complex completeness, density, and inner product: the consumer interface). Its real supplier is is dense in for .
Every Schwartz function is integrable, and the zeroth Schwartz seminorm bounds it pointwise (Schwartz derivatives are integrable).
Proof
For , every derivative vanishes off its compact support: outside the support, is zero on a neighbourhood. Thus is continuous with compact support, hence bounded, for all . The empty-support case is the zero function. Therefore .
If , then [F2] gives , while by the defining seminorm. Hence Thus every Schwartz function determines an class.
Given and , apply [F1] with to obtain with . Step 1.1 puts this same in Schwartz space, and step 1.2 confirms that its class belongs to . Every norm ball about therefore meets the Schwartz classes, proving density with precisely the countable-choice assumption of the smooth-density supplier.
Depends on
Used by
Dependency tree · two levels
25 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
- Gerald Teschl, Topics in Real and Functional Analysis (2017) (standard reference, not scraped)