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 (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 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).
is the set of infinite subsets of ; means that is finite; a pseudointersection of a family is an with for every ; a tower is a family , indexed by an ordinal, of infinite sets with for and with no pseudointersection. (Almost inclusion, pseudointersections and towers)
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)
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)
Under AC, as cardinals, and whenever . (The continuum is equinumerous with the power set of the naturals, Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations)
Recursion on the natural numbers produces the unique function with a prescribed value at and prescribed successor step, and every nonempty subset of has a least element. (The recursion theorem, The natural numbers (von Neumann))
Proof
By [F2], is well-orderable. Let be its initial cardinal and choose a bijection from onto . This induces a particular well-order of the latter set, so "least" below refers to this enumeration. Since , [F4] gives . An arbitrary well-order of could have order type larger than and would not justify this bound.
For let be the increasing enumeration of , which exists by [F5] applied to the well-ordered set ; put and . Then and are infinite, disjoint, , and , . Consequently for every at least one of , holds: if both and were finite, then would be finite, contradicting .
Define, by transfinite recursion on ([F3]), values for , using the sentinel value for . Say that is free when for every . For a free let for every . If , set and ; if we set and at every later , so that the recursion is total on . If , let be the well-order-least member of and split it as in step 1.2, setting if , and otherwise; by step 1.2 one of the two cases applies, so is a well-defined infinite subset of with .
Let be the least such that either , or and . Such a exists because is an ordinal and the second alternative is decided for each ; and , since and hence by step 2.1 and the definition of .
For every the stage was free and , so , , , and for every ; hence for every , and the family is decreasing in the sense of [F1]. Moreover for every , and the family is a set, being the image of the ordinal under a definable function.
If , then , which by step 2.1 and the minimality of happened because : no satisfies for all . By step 4.1 the family is a decreasing family of infinite sets with no pseudointersection, that is a tower, of length .
If and some were a pseudointersection of , then for some by step 1.1, so ; but step 4.1 gives , a contradiction. Hence is a tower of length , again by step 4.1.
In the case step 5.1 exhibits a tower of length , and in the case step 5.2 exhibits a tower of length ; in both cases the length is at most . This is the statement. ∎
Depends on
- Almost inclusion, pseudointersections and towers
- Transfinite recursion
- The Axiom of Choice
- The well-ordering theorem
- The continuum is equinumerous with the power set of the naturals
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- The recursion theorem
- The natural numbers $\mathbb{N}$ (von Neumann)
- Finite, countably infinite, countable, uncountable
Used by
- The pseudointersection and tower numbers Definition
- Basic bounds for p and t Lemma
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
- J. D. Monk, Continuum cardinals, tower discussion immediately before Proposition 34, printed p.14 (standard reference, not scraped)