Alphabeta Math
Pipeline-generated
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, Stationary Sets, and Pressing Down: Examples and Counterexamples

1 · Prerequisites

2 · Summary

Tails and diagonal intersections distinguish different notions of largeness. Cofinality strata supply stationary costationary sets and a direct trace computation; successor ordinals show why an unbounded domain is insufficient for pressing down. The subway argument and normal-function iteration give applications, while the countable-intersection counterexample checks the strict cofinality bound.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Tails, limits, and diagonal intersection

Example

Let κ be regular uncountable. Each strict tail Cξ={α<κ:ξ<α} and the set of nonzero limit ordinals are club. Nevertheless ξ<κCξ=, while ξ<κCξ=κ. A superset of a club need not be closed.

Facts & Assumptions

[F1]

Closed unbounded subsets of ordinals: Closed means containing every nonzero limit point below the ambient ordinal.

[F2]

The diagonal intersection of clubs is club: Diagonal membership at alpha tests exactly the indices below alpha.

Verification

Given: The objects and hypotheses in the statement.

1.1

Tails are unbounded; a nonzero limit point of a tail lies above its cutoff and hence in the tail. Nonzero limits are unbounded since β+ω<κ for β<κ; a nonzero limit point of limit ordinals is itself a limit.

F1
1.2

No alpha lies in Cα, so the full intersection is empty. But for every ξ<α we have αCξ, including the vacuous test at zero. Thus the diagonal intersection is all of kappa, consistently with its club theorem.

F2
2.1

The set [ω+1,κ){1,2,3,} contains a club tail, but omits its nonzero limit point omega, and is therefore not closed.

F1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Cofinality strata and stationary costationary sets

Example

In ZFC, Eωω1 is club, whereas Eωω2 and Eω1ω2 are disjoint stationary sets, neither containing a club.

Facts & Assumptions

[F3]

Countable unions of at most countable sets, assuming ACω: Countable choice makes every countable union of at most countable sets at most countable.

[F2]

Hessenberg: κκ=κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ×κ: In ZF every infinite well-ordered cardinal satisfies κκ=κ for cardinal multiplication.

[F1]

Regular cofinality strata are stationary: Eλθ is stationary when lambda is infinite regular and λ<cf(θ).

Verification

Given: The objects and hypotheses in the statement.

1.1

In ZFC omega-one and omega-two are regular: a cofinal family of at most omega ordinals below omega-one has countable union; a cofinal family of at most omega-one ordinals below omega-two has union of size at most 11=1. Both would contradict the cardinality of the ambient ordinal. For the second union, AC chooses injections of its at most aleph-one members into omega-one, so the union injects into the product of the index set with omega-one. These estimates use countable choice and infinite well-ordered cardinal multiplication.

F2F3
2.1

Every nonzero countable limit has cofinality omega: enumerate it and take successive finite maxima to obtain a cofinal sequence; a finite subset cannot be cofinal in a limit. Thus Eωω1 is exactly the nonzero limits, a closed unbounded set.

step 1.1
3.1

Apply the stratum theorem at omega-two with lambda equal to omega and omega-one. The resulting stationary sets are disjoint since an ordinal has only one cofinality. A club contained in either would miss the other, contradicting stationarity.

F1step 1.1
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

An unbounded regressive domain without a stationary fibre

Statement refuted

The assertion that every regressive map on an unbounded subset of a regular uncountable κ has a stationary constant fibre is false. Let S={α+1:α<κ} and f(α+1)=α.

Facts & Assumptions

[F1]

Regressive functions on ordinals: Regressive means f(ξ)<ξ at every nonzero domain point.

Counterexample

Given: The objects and hypotheses in the statement.

1.1

S consists of successors, is unbounded in kappa, and omits zero. The uniquely defined predecessor map satisfies f(α+1)=α<α+1, so it is regressive.

F1
2.1

Each fibre is a singleton, hence misses a club tail and is nonstationary. Also S itself misses the club of nonzero limits: these are unbounded because β+ω<κ, and closed because limits of limit ordinals are limits. Thus stationarity, the missing hypothesis of pressing down, cannot be replaced by unboundedness.

step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-07Open item page →

The transfinite subway argument

Example

In ZFC a train stops at every α<ω1. At most countably many passengers board at each stop; a passenger boards once and stays until disembarking. At every stop with a nonempty arrival, at least one passenger disembarks before boarding occurs. Then the empty-arrival stops contain a club, and no passenger remains aboard through all stops after boarding below ω1.

Facts & Assumptions

[F1]

Fodor’s pressing-down lemma: A regressive map on a stationary domain has a stationary constant fibre.

[F2]

Basic stationary-set calculus: Stationary sets on a regular uncountable cardinal are unbounded and have full cardinality.

Verification

Given: The objects and hypotheses in the statement.

1.1

Let S be the nonempty-arrival stops. Zero is not in S. If S were stationary, choose one departing passenger at each of its stops, and send that stop to the chosen passenger's boarding index. This is strictly below the arrival stop because departures precede new boarding. Pressing down gives a stationary set of such stops with one common boarding index beta.

F1
2.1

The selected passengers at distinct stops are distinct: each leaves only once and cannot reboard. The stationary fibre has cardinality aleph-one, although at most countably many passengers boarded at beta, a contradiction. Hence S is nonstationary, and its complement contains a club by definition of nonstationarity.

F2step 1.1
3.1

A passenger remaining after boarding at beta would make every arrival after beta nonempty. That would exclude empty arrivals on an entire tail, contradicting the unbounded club of empty arrivals.

step 2.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A trace computation for cofinality strata

Example

In ZFC, with trace restricted to ordinals of uncountable cofinality, Tr(Eωω2)=Eω1ω2,Tr(Eω1ω2)=. In particular the cofinality-omega stratum reflects at every ordinal below omega-two of cofinality omega-one, while the cofinality-omega-one stratum is nonreflecting.

Facts & Assumptions

[F1]

Cofinality strata, trace, and reflection: Trace is tested only at ordinals of uncountable cofinality.

[F2]

Regular cofinality strata are stationary: Eλθ is stationary if lambda is infinite regular and λ<cf(θ).

Verification

Given: The objects and hypotheses in the statement.

1.1

For alpha below omega-two, any uncountable cofinality must equal omega-one: cofinality is a cardinal at most the cardinality of alpha, and this is at most aleph-one. If alpha has this cofinality, the stratum theorem with theta equal to alpha and lambda equal to omega says Eωω2α is stationary. This proves the first equality.

F1F2
2.1

Fix such an alpha and an increasing cofinal sequence (aξ)ξ<ω1 in alpha. Recursively define a strictly increasing cofinal sequence c: take c0=a0+1, at successors take cξ+1=max(cξ,aξ+1)+1, and at nonzero limits take the supremum of prior values. Countable initial segments remain bounded since alpha has cofinality omega-one. The range is unbounded and closed: a limit point below alpha corresponds to a bounded limit set of indices, whose supremum is below omega-one, and continuity includes that value.

step 1.1
3.1

At zero and successor indices the c values are successors and have cofinality one. At nonzero limit indices below omega-one, continuity and strict increase give a countable cofinal sequence with no last point, so the value has cofinality omega. Thus this club avoids Eω1ω2α. No eligible alpha belongs to its trace, giving the second equality.

F1step 2.1
False statementConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Countable intersections of clubs are always club

Statement

False without a cofinality restriction: for every limit ordinal θ, a countable intersection of clubs in θ is club.

Facts & Assumptions

[F1]

Closed unbounded subsets of ordinals: Club means closed and unbounded in the ambient ordinal.

[F2]

Intersections of fewer than the cofinality many clubs: The intersection theorem requires the indexing size strictly below the ambient cofinality, with uncountable ambient cofinality.

Refutation

Given: The objects and hypotheses in the statement.

1.1

At theta equal to omega, each tail Cn={m<ω:nm} is unbounded and vacuously closed, because omega has no nonzero limit ordinal below it. Their intersection is empty and hence not club.

F1
2.1

Even at the uncountable singular ordinal θ=ω, the tails Dn=[n,ω) are club, but their intersection is empty since the alephs indexed by natural numbers are cofinal in theta. In both cases the countable index size equals, rather than lies strictly below, the ambient cofinality omega. Thus neither example meets the intersection theorem's hypotheses.

F1F2step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Normal functions and fixed points at omega-one

Example

The map f:ω1ω1, f(α)=ωα, is normal and its fixed points form a club. Iterating f from 1 gives 1,ω,ω2,, whose supremum ωω is a countable fixed point. The fixed-point club has a normal increasing enumeration.

Facts & Assumptions

[F6]

Countable unions of at most countable sets, assuming ACω: Assuming countable choice, a countable union of at most countable sets is at most countable.

[F1]

Ordinal multiplication αβ: Ordinal multiplication is defined by successor addition and continuity in the right argument.

[F2]

Ordinal exponentiation αβ, with the conventions α0=1 and 00=1: Powers are defined by right multiplication at successors and suprema at limits.

[F4]

Fixed points of a normal function form a club: A normal self-map on a regular uncountable cardinal has club many fixed points.

[F5]

Clubs are ranges of normal enumerations: A club in a regular uncountable cardinal has a normal increasing enumeration.

Verification

Given: The objects and hypotheses in the statement.

1.1

For countable alpha, omega times alpha is the order type of alpha many consecutive countable blocks, hence is countable in ZFC. Multiplication by omega on the left is strictly increasing: appending one nonempty omega block strictly increases the order type, and the recursive definition is monotone in the right argument. It is continuous at nonzero limits by the same definition. Thus f is a normal self-map of omega-one.

F1F6
2.1

Associativity and induction give f(ωn)=ωn+1 for each finite n, starting from ω1=ω. The countable supremum of these countable ordinals is ωω<ω1. Continuity gives f(ωω)=supnωn+1=ωω.

F1F2F3F6step 1.1
3.1

The normal fixed-point theorem makes the whole fixed-point set club (including zero, since f(0)=0). The normal-enumeration theorem applies to this club and provides its normal increasing enumeration.

F4F5step 1.1step 2.1

Sources