Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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.

A tower of size at most the continuum exists

Statement

In ZFC there is a tower of infinite subsets of ω whose length is at most c=2ℵ0 (Almost inclusion, pseudointersections and towers for towers, almost inclusion ⊆∗ and pseudointersections).

The construction below enumerates [ω]ω, keeps a running pseudointersection of the part of the family built so far, and at stage α chooses one of the two infinite halves of that pseudointersection on which the α-th set fails to be almost contained. If the running pseudointersection ever disappears the family built so far is already a tower; otherwise every one of the at most c infinite sets is defeated by some member, and the whole family is a tower.

Facts & Assumptions

Given: the Axiom of Choice (The Axiom of Choice).

[F1]

[ω]ω is the set of infinite subsets of ω; A⊆∗B means that A∖B is finite; a pseudointersection of a family F⊆[ω]ω is an X∈[ω]ω with X⊆∗A for every A∈F; a tower is a family ⟨Aα:α<κ⟩, indexed by an ordinal, of infinite sets with Aβ⊇∗Aα for β<α and with no pseudointersection. (Almost inclusion, pseudointersections and towers)

[F2]

The Axiom of Choice: every family of nonempty sets has a choice function; equivalently, every set is well-orderable. (The Axiom of Choice, The well-ordering theorem)

[F3]

Transfinite recursion on a well-order produces the unique function satisfying a prescribed rule at each stage, the rule being a formula with set parameters. (Transfinite recursion)

[F5]

Recursion on the natural numbers produces the unique function with a prescribed value at 0 and prescribed successor step, and every nonempty subset of N has a least element. (The recursion theorem, The natural numbers N (von Neumann))

Proof

1.1

By [F2], [ω]ω is well-orderable. Let δ be its initial cardinal ∣[ω]ω∣ and choose a bijection α↦Xα from δ onto [ω]ω. This induces a particular well-order of the latter set, so "least" below refers to this enumeration. Since [ω]ω⊆P(ω), [F4] gives δ≤∣P(ω)∣=2ℵ0=c. An arbitrary well-order of [ω]ω could have order type larger than δ and would not justify this bound.

F2F4
1.2

For Y∈[ω]ω let y0<y1<y2<⋯ be the increasing enumeration of Y, which exists by [F5] applied to the well-ordered set Y; put E(Y)={y2n:n∈N} and O(Y)={y2n+1:n∈N}. Then E(Y) and O(Y) are infinite, disjoint, E(Y)∪O(Y)=Y, and E(Y)⊆Y, O(Y)⊆Y. Consequently for every X∈[ω]ω at least one of X̸⊆∗E(Y), X̸⊆∗O(Y) holds: if both X∖E(Y) and X∖O(Y) were finite, then X∖(E(Y)∩O(Y))=X∖∅=X would be finite, contradicting X∈[ω]ω.

F1F5
2.1

Define, by transfinite recursion on δ ([F3]), values Aα,Yα⊆ω for α<δ, using the sentinel value ∅ for Y. Say that α<δ is free when Yβ≠∅ for every β<α. For a free α let Pα={Y∈[ω]ω:Y⊆∗Aβ for every β<α}. If Pα=∅, set Aα=ω and Yα=∅; if Yα=∅ we set Aγ=ω and Yγ=∅ at every later γ, so that the recursion is total on δ. If Pα≠∅, let Yα be the well-order-least member of Pα and split it as in step 1.2, setting Aα=E(Yα) if Xα̸⊆∗E(Yα), and Aα=O(Yα) otherwise; by step 1.2 one of the two cases applies, so Aα is a well-defined infinite subset of Yα with Xα̸⊆∗Aα.

F1F2F3step 1.2
3.1

Let λ be the least α≤δ such that either α=δ, or α<δ and Yα=∅. Such a λ exists because δ is an ordinal and the second alternative is decided for each α<δ; and λ>0, since P0=[ω]ω≠∅ and hence Y0≠∅ by step 2.1 and the definition of P0.

F1F3step 2.1
4.1

For every α<λ the stage α was free and Pα≠∅, so Aα∈[ω]ω, Yα∈[ω]ω, Aα⊆Yα, and Yα⊆∗Aβ for every β<α; hence Aα⊆∗Aβ for every β<α, and the family ⟨Aβ:β<λ⟩ is decreasing in the sense of [F1]. Moreover Xα̸⊆∗Aα for every α<λ, and the family is a set, being the image of the ordinal λ under a definable function.

F1step 2.1step 3.1
5.1

If λ<δ, then Yλ=∅, which by step 2.1 and the minimality of λ happened because Pλ=∅: no Y∈[ω]ω satisfies Y⊆∗Aβ for all β<λ. By step 4.1 the family ⟨Aβ:β<λ⟩ is a decreasing family of infinite sets with no pseudointersection, that is a tower, of length λ<δ≤c.

F1step 3.1step 4.1
5.2

If λ=δ and some X∈[ω]ω were a pseudointersection of ⟨Aα:α<δ⟩, then X=Xα for some α<δ by step 1.1, so Xα⊆∗Aα; but step 4.1 gives Xα̸⊆∗Aα, a contradiction. Hence ⟨Aα:α<δ⟩ is a tower of length δ≤c, again by step 4.1.

F1step 1.1step 4.1
6.1

In the case λ<δ step 5.1 exhibits a tower of length λ<δ≤c, and in the case λ=δ step 5.2 exhibits a tower of length δ≤c; in both cases the length is at most c=2ℵ0. This is the statement. ∎

step 1.1step 5.1step 5.2

Depends on

Used by

Dependency tree · two levels

50 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