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.
Lebesgue--Stieltjes regularity agrees with the LCH Radon convention on R
Statement
Assume the Axiom of Countable Choice. Every Lebesgue--Stieltjes measure on is Radon in the LCH convention, and its interval convention remains for increasing right-continuous .
Facts & Assumptions
Given: The Axiom of Countable Choice, an increasing right-continuous , and its Lebesgue--Stieltjes measure .
Under the stated choice hypothesis, is a Borel measure finite on compact sets and regular on . (Assuming countable choice, a nondecreasing right-continuous function defines a Borel measure on , Lebesgue-Stieltjes measures on are outer regular and inner regular by compact sets)
Proof
By [L1], is finite on compact sets, outer regular on Borel sets, and inner regular by compact sets on Borel sets, hence in particular on open sets. These imply every clause of the LCH Radon definition.
No measure is replaced in this comparison, so the defining half-open interval formula and the Borel sigma-algebra from the construction remain unchanged.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Radon measure on an LCH space
- A Borel measure on $\mathbb{R}$ that is finite on compact sets
- Assuming countable choice, a nondecreasing right-continuous function defines a Borel measure on $\mathbb{R}$
- Lebesgue-Stieltjes measures on $\mathbb{R}$ are outer regular and inner regular by compact sets
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
- Donald L. Cohn, Measure Theory, 2nd ed., Chapter 7 (standard reference, not scraped)