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.
Failure of inaccessibility in L produces a real with correct omega-one
Statement
Work in ZF+Countable Choice. If the ambient is not an inaccessible cardinal of , then there is a real such that equals the ambient .
Facts & Assumptions
Given: Countable Choice and the hypothesis that the ambient is not inaccessible in .
The Axiom of Countable Choice () with Countable choice makes omega-one regular: Countable Choice makes the ambient regular, and every countable subset of is bounded.
The generalized continuum hypothesis holds in L: satisfies GCH, so inside the power-set operation is the cardinal successor and .
Absoluteness, idempotence and minimality of L: constructibility is absolute between the relevant transitive models with the same ordinals, and . No preservation of -cardinals in is asserted: in fact, every ordinal below the ambient is countable in .
Inaccessible and Mahlo cardinals: a cardinal is inaccessible when it is uncountable, regular and a strong limit.
Proof
The ambient is regular by Countable Choice, and it is a cardinal in : an -definable surjection from a smaller ordinal onto would still be a surjection in the universe. It is also regular in , since an -cofinal map from a smaller ordinal would remain cofinal in the universe.
Hence, if is not inaccessible in , it fails one of the three clauses of [F4] there. It is uncountable in (it is uncountable in the universe and has the same ordinals) and regular in by step 1.1, so it is not a strong limit cardinal of : there is a cardinal of with . By GCH in , , so the ordinal equals for some -cardinal . This is infinite, since the -successor of a finite cardinal is finite whereas the ambient is uncountable.
The ordinal is countable in the ambient universe because , so there exists a real coding a bijection . This is one existential choice from a nonempty set of codes and needs no family-choice principle.
Let . If , it is countable in trivially. If , then Choice in and the fact that is an infinite -cardinal imply that contains a surjection from onto ; this map also belongs to by [F3]. Composing it with the bijection coded by makes countable in . Thus every ordinal below the ambient is countable in , so . Conversely the ambient is uncountable in , since any bijection with in would contradict its ambient definition; hence . Therefore equality holds.
The steps above produce a real with from the failure of inaccessibility in ; only this existential real is claimed, not the statement for every real.
Depends on
Used by
Dependency tree · two levels
26 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)