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.
Weak and strong topologies on distributions
Definition
On the distribution space of Distribution, the weak distribution topology is generated by the seminorms for individual . It is also called the weak-star topology relative to the test space: .
The strong distribution topology, denoted , is generated by for bounded subsets of the LF test space. The supremum of the empty set is zero. This is finite: continuity of gives a zero-neighborhood with on , and boundedness gives for some finite , so . Equivalently the bounded sets are exactly the common-compact-support, derivative-bounded sets characterized in Bounded test function sets have common compact support. Homogeneity and the triangle inequality for each follow by taking suprema of the corresponding inequalities for evaluations.
For a net and a distribution , weak convergence means for every test; strong convergence means for every bounded . These are precisely the convergence conditions in the generated topologies, since neighborhoods impose finitely many seminorm bounds and directedness gives a common eventual index. The same definitions apply to sequences, without identifying arbitrary net behavior with sequence behavior. Both topologies are Hausdorff: distinct functionals differ on some test, and singleton tests are bounded by the cited characterization. The empty domain gives the zero dual. No choice axiom is used.
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)