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.
An inaccessible rank segment models ZFC
Statement
In ZFC, if kappa is inaccessible, satisfies every ZFC axiom. For each cardinal , inaccessibility of alpha is absolute between and V. No converse from to inaccessibility of kappa is asserted.
Facts & Assumptions
Given: ZFC. Verified every axiom directly by rank bounds and relativized formulas; AC gives the choice graph and image-size comparison. All functions and full small power sets witnessing inaccessibility tests lie in V_kappa, giving both absoluteness directions.
Size and rank bounds below an inaccessible: Every element of V_kappa has size below kappa and every small subset of V_kappa lies in it; kappa is an uncountable limit cardinal.
Transitivity and growth of hierarchy stages: Hierarchy stages are transitive with the stated ordinal content.
Relativization agrees with induced set satisfaction: For fixed formulas, satisfaction is evaluation with all quantifiers restricted to the set carrier.
The Axiom of Choice: Ambient AC supplies a choice function on a set family.
Proof
Transitivity transfers Extensionality and Foundation: every actual member of a set in V_kappa lies there, including an ambient Foundation witness. Empty and omega belong to V_kappa, since kappa is uncountable. Pairs, unions and full power sets of sets of rank below kappa again have rank below kappa: each requires only finitely many ordinal successor steps, and kappa is a limit ordinal. These actual operations verify Empty Set, Pairing, Union, Power Set and Infinity internally.
For Separation, ambient Separation using the fixed V_kappa-relativized formula gives a subset of a, hence an element of its full power set in V_kappa. For Replacement, ambient Replacement with that fixed relativized functional formula gives an image Y of . It is a subset of V_kappa of size at most |a| (AC well-orders a and assigns each image its least preimage). F1 gives |a|<kappa and then Y in V_kappa. F3 identifies these with every internal schema instance.
For a family a of nonempty sets in V_kappa, ambient AC gives a choice function g on a. Each ordered pair in its graph uses only sets in a and their members, so its rank is bounded by rank(a) plus a fixed finite ordinal; this remains below kappa. Thus g belongs to V_kappa and is also an internal choice function. Together with steps 1.1 and 2.1 this proves all ZFC axioms.
Fix alpha<kappa. All subsets of any ordinal below alpha, all functions between such ordinals (including functions into alpha), and all bijections between their power sets and ordinals below alpha have rank below kappa, by the finite-rank bounds of step 1.1. Thus V_kappa has exactly the witnesses testing cardinalhood and cofinality below alpha, and exactly the full power sets and cardinal comparisons testing for cardinals mu<alpha. Uncountability is the comparison with the same actual omega. Each of these tests agrees in both directions, so alpha is inaccessible internally iff it is inaccessible externally.
Depends on
Used by
- Large-cardinal implication and consistency ledger Corollary
- ZFC proves there is an inaccessible cardinal False statement
Dependency tree · two levels
11 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
- Marks Theorem 18.16 p.79; local explicit Choice and inaccessibility-absoluteness clauses (standard reference, not scraped)