Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Intersections of fewer than the cofinality many clubs

Statement

In ZFC, let cf(θ)>ω and let (Ci)i<μ be clubs of θ, with μ<cf(θ). Then i<μCi is club, taking the empty intersection to be θ. In particular fewer than κ clubs intersect to a club on regular uncountable κ.

Facts & Assumptions

[F1]

Closure points form a club: Nondecreasing maps on an ordinal of uncountable cofinality have club many closure points.

[F3]

Closed unbounded subsets of ordinals: A club contains all its nonzero limit points below the ambient ordinal.

Proof

Given: The objects and hypotheses in the statement.

1.1

For μ=0, the intersection is θ, which is closed and unbounded in itself. For μ>0, let fi(β)=min(Ci(β+1)) and g(β)=supi<μfi(β). The supremum is below θ, and g is nondecreasing and strictly above its argument.

F2F3
2.1

The nonzero closure points δ of g are unbounded by the closure lemma. For every i and β<δ, β<fi(β)g(β)<δ. Thus Ciδ is unbounded in δ; δ is a nonzero limit and belongs to each Ci. This proves unboundedness of the intersection.

F1F3step 1.1
3.1

If δ is a nonzero limit point of the intersection, it is a limit point of each Ci, hence lies in each. This proves closure; the case μ=1 is included. Specializing θ=κ gives the last assertion.

F3step 2.1

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