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.
The Feferman–Levy omega one has countable cofinality
Statement
In the Feferman–Levy model ,
Facts & Assumptions
Given: The transitive model and its ordinal .
The new omega one is the old aleph omega identifies with .
; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained says in ZF that the cofinality of a limit ordinal is an infinite cardinal and is bounded by the size of every exhibited cofinal subset.
Hereditarily symmetric interpretations form a transitive ZF model gives for this symmetric construction.
Proof
The ground sequence is a set of and hence, by F3, a set of . Its range is cofinal in by the definition of the limit aleph. Using F1, is therefore cofinal in , so .
The ordinal is an infinite cardinal and therefore a limit ordinal. F2 makes its cofinality an infinite cardinal, hence at least . Combined with step 1.1, this gives . The witness is the one ground sequence ; no sequence of arbitrary choices is used.
Depends on
- The new omega one is the old aleph omega
- $\operatorname{cf}(\alpha) \le \alpha$; $\operatorname{cf}(0) = 0$ and $\operatorname{cf}(\alpha + 1) = 1$; for a limit ordinal $\lambda$ the value $\operatorname{cf}(\lambda)$ is an infinite cardinal with $\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda)$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\operatorname{cf}(\lambda)$, a value that is attained
- Hereditarily symmetric interpretations form a transitive ZF model
Used by
Dependency tree · two levels
29 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
- Thomas Jech, The Axiom of Choice, discussion after Theorem 10.6 and Problems 2–3, printed pp. 144, 148 (standard reference, not scraped)