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.
Sequential convergence in test function space
Statement
For tests , in the LF topology if and only if the supports of eventually lie in one compact and uniformly on for every multi-index . Equivalently one compact contains all their supports and that of the limit, and convergence holds in its fixed-support topology. This is a sequence criterion, in ZF.
Facts & Assumptions
The LF topology induces exactly the derivative-seminorm topology on each fixed-support space, and its inclusion is continuous (Test function lf topology universal property).
A convergent sequence with its limit is bounded; a bounded set of tests has common compact support (Bounded test function sets have common compact support).
Proof
Given: a sequence of tests and a test .
If in the LF topology, F2 places the sequence and limit in one . Convergence in the subspace topology follows directly: any subspace neighborhood of is the intersection with an ambient neighborhood, which eventually contains the sequence. By F1, for every . Since derivatives vanish off , this gives uniform convergence of every derivative on .
Conversely suppose eventual common support and the stated uniform convergence. For , the eventual values are zero, so ; since is closed, its support is contained in . The finite union of and the finitely many initial test supports is compactly inside and contains every support. For each , uniform convergence of the finitely many derivatives through order gives . F1 first yields convergence in , then LF convergence by the continuous inclusion.
These arguments also prove the stated equivalent all-support formulation. Empty and eventually zero sequences satisfy the same reasoning; no compactness extraction or chosen subsequence is used. The finite initial union is essential to passing from eventual to all-support language.
Depends on
Used by
Dependency tree · two levels
4 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
- Semyon Dyatlov, Lecture notes for 18.155 (2022) (standard reference, not scraped)