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.
Assuming countable choice, a premeasure-induced outer measure is regular with generated measurable hulls
Statement
Assume the Axiom of Countable Choice. An outer measure induced by a premeasure is regular, and every set has a measurable hull in .
Facts & Assumptions
Given: Countable choice, a premeasure on , its induced outer measure , and a subset .
A measurable hull of is a Carathéodory measurable set with ; the outer measure is regular when every subset has a measurable hull. (Measurable hulls and regular outer measures)
The set function induced by assigns the infimum of over all countable algebra covers . (The outer set function induced by a premeasure)
Assuming countable choice, the induced outer measure restricts to a complete measure on its Carathéodory sigma-algebra and to a measure on extending . (Assuming countable choice, a premeasure extends through its induced outer measure)
Proof
If , put . Otherwise, for each , countable choice and [F2] give an algebra cover of with cost below ; put and .
In the finite case each and their intersection lie in ; in the infinite case lies there. Thus [L1] makes Carathéodory measurable in either case.
One has . In the finite case, monotonicity and each covering bound give for every , hence ; in the infinite case both values are . Therefore [F1] makes a generated measurable hull, and is regular.
Depends on
Used by
Dependency tree · two levels
20 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
- G. Folland, Real Analysis, 2nd ed., Exercises 18(a) and 20(b) in Section 1.4 (standard reference, not scraped)