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-set formula and local finiteness of the RMK measure
Statement
For every compact , In particular .
Facts & Assumptions
Given: The Borel measure constructed from .
LCH cutoffs exist between a compact set and an open neighbourhood. (LCH Urysohn cutoff)
Proof
Suppose . For , the open set contains . Every satisfies , so positivity gives . Outer regularity therefore yields , and then .
Conversely, for every open , choose an open with [L1, choose] and compact closure. [L1] applied to supplies with . Since off , , and hence . Thus . Taking first the infimum over , then over , gives the reverse inequality. For , gives both sides zero.
Choosing one relatively compact open neighbourhood of and the [step 1.1, step 1.2, L1] cutoff produced in step 1.2 gives .
Depends on
Used by
Dependency tree · two levels
12 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., Chapter 7 (standard reference, not scraped)