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.
Exact equiconsistency of universal measurability and an inaccessible
Statement
ZFC plus an inaccessible cardinal and ZF+DC plus every set of reals Lebesgue measurable are equiconsistent. The same lower bound already follows from universal boldface measurability under Countable Choice.
Facts & Assumptions
Given: Fixed arithmetizations of the two theories and their finite fragments.
Solovay-model regularity is consistent relative to an inaccessible cardinal: by the externally indexed finite-fragment transfer for the Lévy-collapse construction, No uniform arithmetic proof-code transformer is used in that theorem.
All-real-set measurability yields an inaccessible inner model: from ZF+DC plus universal measurability, the constructible universe satisfies ZFC and contains an inaccessible cardinal. Relativization to that definable inner model is an interpretation, so it sends every actual finite target refutation to a source refutation (Interpretation transports derivations and inconsistency).
Under ZF+Countable Choice plus universal boldface measurability, the ambient is inaccessible in (Sigma-one-three measurability makes omega-one inaccessible in L, The Axiom of Countable Choice (), Boldface Sigma-one-three measurability), and satisfies ZFC (Semantic and formal inner-model theorem for L). Relativization to therefore gives the same refutation translation as in [F2] (Interpretation transports derivations and inconsistency).
Proof
Upper bound: assume . The exact external finite-fragment consistency implication in [F1] yields .
Lower bound: assume . If ZFC plus an inaccessible had an actual refutation, [F2] would translate it to a refutation of the assumed source theory. Hence follows.
The refinement: if ZF+Countable Choice plus boldface measurability is consistent, an actual refutation of ZFC plus an inaccessible would translate by [F3] to a refutation of that source theory. Thus its consistency already implies the consistency of ZFC plus an inaccessible cardinal. This is the stronger form of the lower bound stated.
The inaccessible hypothesis is needed only on the Solovay branch: steps 1.1 uses it, and steps 1.2 and 1.3 use none; the separation of the two branches is the point of this pair.
Steps 1.1 through 1.3 give the two consistency implications in both directions, and step 1.4 records the exact role of the inaccessible; this is the Statement.
Depends on
- All-real-set measurability yields an inaccessible inner model
- Solovay-model regularity is consistent relative to an inaccessible cardinal
- Sigma-one-three measurability makes omega-one inaccessible in L
- Semantic and formal inner-model theorem for L
- Interpretation transports derivations and inconsistency
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Boldface Sigma-one-three measurability
Used by
- False: the all-Baire-property model needs an inaccessible False statement
Dependency tree · two levels
44 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
- Hiromi Ishii, Regularity Properties and Inaccessible Cardinals (standard reference, not scraped)
- Robert M. Solovay, A Model of Set-Theory in Which Every Set of Reals Is Lebesgue Measurable (standard reference, not scraped)