Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 (Cδ)δ∈Eκθ such that every Cδ is a club of δ of order type κ, and for every club D⊆θ there is δ∈Eκθ with Cδ⊆D. Here Eκθ={δ<θ:cf⁡(δ)=κ}; clubs contain their nonzero limit points below their ambient ordinal.

Facts & Assumptions

Given: AC and the cardinals in the statement. For a club E write E′={δ<θ:δ is a nonzero limit and sup⁡(E∩δ)=δ}.

[F1]

Fewer than cf⁡(ρ) clubs of an ordinal ρ of uncountable cofinality intersect to a club, including the empty intersection ρ (Intersections of fewer than the cofinality many clubs).

[F2]

Eκθ is stationary when κ is infinite regular and κ<cf⁡(θ) (Regular cofinality strata are stationary).

[F5]

Specified rules recurse on a well-order (Transfinite recursion).

[A1]

AC selects one member from each nonempty set of witnesses (The Axiom of Choice).

Proof

1.1F2F3F4F5A1

Put S=Eκθ. Both κ+ and θ are regular by F4, and S is stationary by F2 since κ<θ=cf⁡(θ). For each δ∈S, 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 Cδ0 is closed, cofinal and has order type κ. AC selects these witnesses simultaneously for the set S.

2.1step 1.1F1F3

For every club E⊆θ, E′ is club and contained in E. Indeed, above any γ<θ take a strictly increasing countable sequence in E by repeatedly taking the least larger point. Its supremum is below θ by F3 and lies in E′ above γ. If nonzero limit η<θ is an accumulation point of E′, every γ<η has some ζ∈E′∩η above it and then a point of E∩ζ above γ. Thus sup⁡(E∩η)=η, so η∈E′. Closure of E gives E′⊆E. For δ∈S∩E′, both Cδ0 and E∩δ are clubs of δ. Their intersection is club by F1, since 2<κ=cf⁡(δ). Its order type is at most κ as a subset of Cδ0, and its cardinality is at least κ by F3; hence its order type is exactly κ.

3.1step 1.1step 2.1F1F5A1

Consider the assertion that some club E⊆θ has the following property: every club D⊆θ contains Cδ0∩E for some δ∈S∩E′. If it failed, for each club E the set of clubs D satisfying Cδ0∩E⊈D for all δ∈S∩E′ would be nonempty. These witness sets are subsets of P(θ); A1 fixes a choice D(E) on this set-indexed family. By F5 define E0=θ, Eα+1=(Eα∩D(Eα))′, and Eγ=⋂α<γEα 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 E∗=⋂α<κ+Eα is also club because κ+<cf⁡(θ).

4.1step 1.1step 2.1step 3.1F2F3F4

F2 gives δ∈S∩E∗. For every x∈Cδ0∖E∗, let r(x)<κ+ be the least stage with x∉Er(x). There are at most κ such stages because ∣Cδ0∣=κ. F3 and the regularity of κ+ from F4 give an α<κ+ at least all of them; if there are none, take α=0. Then Cδ0∩Eα=Cδ0∩E∗=Cδ0∩Eα+1. But δ∈Eα+1⊆Eα′, so the choice of D(Eα) gives an x∈Cδ0∩Eα outside D(Eα). Since Eα+1⊆D(Eα), that x is outside Eα+1, contradicting the equality. Consequently the assertion of step 3.1 holds.

5.1step 1.1step 2.1step 3.1step 4.1

Take a successful E and set Cδ=Cδ0∩E for δ∈S∩E′, and Cδ=Cδ0 for the remaining δ∈S. Each is club of order type κ by steps 1.1–2.1. For any club D⊆θ, the success property supplies δ∈S∩E′ with Cδ=Cδ0∩E⊆D. This is the required sequence on all of S. QED.

Depends on

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