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 new omega one is the old aleph omega
Statement
In the Feferman–Levy model ,
Facts & Assumptions
Given: Put and regard all ground ordinals as the same ordinals in the transitive symmetric model.
Every finite ground aleph is countable in the Feferman–Levy model proves that every is countable in .
Hereditarily symmetric names have bounded layer support gives one supporting an HS name.
Fixed Boolean values come from initial collapse layers reduces every -fixed Boolean value to conditions restricted below layer .
Forcing theorem supplies the truth lemma relating the interpreted function to conditions in the generic filter.
Cofinality , and regular and singular cardinals fixes the ordinal and aleph conventions used for the limit and for the later cofinality consequence.
The Axiom of Choice is used only in the ground-model cardinal count of the set of finite initial-layer conditions.
Proof
If , then for some . For it is finite. Otherwise restrict the surjection from F1 by replacing values outside with ; this is a surjection in . Thus every ordinal below is countable in , and consequently .
Suppose for contradiction that some is a surjection . Choose an HS name and use F2 to fix such that fixes it. For and let . These Boolean values are fixed by , because and the check names are fixed.
Let . For each put . Distinct require incompatible witnesses, since a condition cannot force two different values of the function at . Choosing the least witness in a fixed ground well-order injects into . Ground AC and the finite-function calculation give , hence .
If , then , and F3 gives ; hence . Because the alleged is surjective, F4 supplies such a and for every . Thus , contradicting the strict bound in step 1.3. Therefore no such belongs to , so is uncountable in .
Since is the least uncountable ordinal of , step 2.1 gives , while step 1.1 gives the reverse inequality. Hence .
Depends on
Used by
Dependency tree · two levels
22 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, Chapter 10, Problem 3 and complete hint, printed p. 148 (standard reference, not scraped)