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.
Club guessing at the double successor of an uncountable regular cardinal
Statement
Assume AC. Let be an uncountable regular cardinal and . There is a sequence such that every is a club of of order type , and for every club there is with . Here ; clubs contain their nonzero limit points below their ambient ordinal.
Facts & Assumptions
Given: AC and the cardinals in the statement. For a club write .
Fewer than clubs of an ordinal of uncountable cofinality intersect to a club, including the empty intersection (Intersections of fewer than the cofinality many clubs).
is stationary when is infinite regular and (Regular cofinality strata are stationary).
Cofinal subsets of a limit ordinal have cardinality at least its cofinality, and that cardinality is attained; a set of fewer than ordinals below is therefore bounded (; 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, (c)–(d)).
Under AC successor cardinals are regular ( is regular in ZF; assuming the Axiom of Choice every successor aleph is regular; , so is singular, and under choice it is the least singular infinite cardinal, (b)).
Specified rules recurse on a well-order (Transfinite recursion).
AC selects one member from each nonempty set of witnesses (The Axiom of Choice).
Proof
Put . Both and are regular by F4, and is stationary by F2 since . For each , F3 supplies a cofinal subset of size . Enumerate it by and build a continuous strictly increasing cofinal sequence in : at successors exceed the previous value and the next enumerated value, and at nonzero limits take the supremum. Each intermediate supremum is below by F3. F5 supplies this recursion, and its range is closed, cofinal and has order type . AC selects these witnesses simultaneously for the set .
For every club , is club and contained in . Indeed, above any take a strictly increasing countable sequence in by repeatedly taking the least larger point. Its supremum is below by F3 and lies in above . If nonzero limit is an accumulation point of , every has some above it and then a point of above . Thus , so . Closure of gives . For , both and are clubs of . Their intersection is club by F1, since . Its order type is at most as a subset of , and its cardinality is at least by F3; hence its order type is exactly .
Consider the assertion that some club has the following property: every club contains for some . If it failed, for each club the set of clubs satisfying for all would be nonempty. These witness sets are subsets of ; A1 fixes a choice on this set-indexed family. By F5 define , , and at nonzero limits, for . Each is club by step 2.1 and F1, since all intersection lengths are below . The sequence decreases by inclusion, and is also club because .
F2 gives . For every , let be the least stage with . There are at most such stages because . F3 and the regularity of from F4 give an at least all of them; if there are none, take . Then . But , so the choice of gives an outside . Since , that is outside , contradicting the equality. Consequently the assertion of step 3.1 holds.
Take a successful and set for , and for the remaining . Each is club of order type by steps 1.1–2.1. For any club , the success property supplies with . This is the required sequence on all of . QED.
Depends on
- Intersections of fewer than the cofinality many clubs
- Regular cofinality strata are stationary
- $\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
- $\aleph_0$ is regular in ZF; assuming the Axiom of Choice every successor aleph $\aleph_{\alpha+1}$ is regular; $\operatorname{cf}(\aleph_\omega) = \aleph_0$, so $\aleph_\omega$ is singular, and under choice it is the least singular infinite cardinal
- Transfinite recursion
- The Axiom of Choice
Used by
Dependency tree · two levels
37 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
- Abraham and Magidor, Cardinal Arithmetic, Theorem 2.17, uncountable case, pp. 20–21 (standard reference, not scraped)