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, every source-algebra set is measurable for the induced outer measure
Statement
Assume the Axiom of Countable Choice. Every member of the source algebra is Carathéodory measurable for the induced outer measure.
Facts & Assumptions
Given: Countable choice, a premeasure on an algebra , its induced outer set function , a set , and a test set .
A premeasure on an algebra vanishes at the empty set and is countably additive whenever a disjoint sequence in has its union in . (Premeasures on algebras of sets)
The set function induced by assigns the infimum of over all countable algebra covers . (The outer set function induced by a premeasure)
For every outer measure and all , . (In the Carathéodory identity, the subadditive inequality is automatic)
Assuming countable choice, the outer set function induced by a premeasure is an outer measure. (Assuming countable choice, the outer set function induced by a premeasure is an outer measure)
Proof
If , the reverse Carathéodory inequality is automatic. If , then for any choose an algebra cover of with ; since , the two sequences and lie in the algebra, cover and , and [F1] gives .
By the defining infima, step 1.1 gives ; since this holds for every positive , the left side is at most . Countable choice makes an outer measure by [L2], so [L1] applies to it and gives the reverse inequality. Thus the Carathéodory identity holds for every .