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.
Compact support, , and
Definition
Let be locally compact Hausdorff and let be continuous, where is or . Its support is . Put . Also consists of those for which, for every , is compact. We write for the real space until the bounded complex theorem is invoked; later means the complex space when its scalar field matters.
Depends on
- Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space
- Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
Used by
- Positive linear functionals on C_c(X) Definition
- The compactly supported cutoff relation f≺ U Definition
- C_c(X) is dense in Lⁱnfinity(mu) for every Radon measure False statement
- A bounded real C₀(X) functional is a difference of positive functionals Lemma
- A finite compactly supported partition of unity near a compact set Lemma
- LCH Urysohn cutoff Lemma
- Positive C₀(X) functionals have finite regular representing measures Lemma
- C_c(X) is dense in Lᵖ(mu) for a Radon measure Theorem
- Sigma-compact open sets make locally finite Borel measures regular Theorem
Dependency tree · two levels
18 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
- Donald L. Cohn, Measure Theory, 2nd ed., §7.1 (standard reference, not scraped)