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.

✓ 30 results · all verified · 15 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 15 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Easton's Theorem and Cardinal Invariants of the Continuum

1 · Prerequisites

2 · Summary

Easton forcing realizes prescribed continuum values on infinite regular cardinals under the monotonicity and cofinality constraints. The set-sized product calculation is followed by the class-product argument over a countable transitive GBC plus Global Choice ground. The singular-cardinal caveat marks the boundary of the theorem.

The cardinal-invariant part defines the pseudointersection and tower numbers, the bounding and dominating numbers, splitting and reaping, and the null and meagre ideal invariants. Elementary comparisons precede the Borel-section coding and Tukey morphisms that give the null-to-meagre arrows. The remaining translation and bounding arguments assemble the ten-node Cichoń diagram.

Axiom of Choice is used where indexed antichains, cardinal witnesses, or cofinal families require it; individual item contracts identify those uses. The equality of the pseudointersection and tower numbers is deferred from this run and is not asserted here.

3 · Logical flowchart

4 · Definitions, theorems and proofs

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Necessary constraints on the regular-cardinal continuum function

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let κ and λ range over infinite regular cardinals (Cofinality cf⁡(α), and regular and singular cardinals). Then the continuum function κ↦2κ satisfies:

(a) κ<2κ;

(b) 2κ≤2λ whenever κ≤λ;

(c) cf⁡(2κ)>κ.

Clause (a) excludes values at most κ, clause (b) requires monotonicity, and clause (c) is König's stronger cofinality bound. Since cf⁡(μ)≤μ (cf⁡(α)≤α; cf⁡(0)=0 and cf⁡(α+1)=1; for a limit ordinal λ the value cf⁡(λ) is an infinite cardinal with cf⁡(cf⁡(λ))=cf⁡(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf⁡(λ), a value that is attained), clause (c) already implies clause (a); an Easton function is specified by monotonicity and this cofinality bound.

Facts & Assumptions

Given: The Axiom of Choice, so that every set has a cardinality, and infinite regular cardinals κ≤λ.

[F1]

Under the Axiom of Choice, 2κ=∣P(κ)∣ for every cardinal κ, and κ<2κ. (Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ)

[F3]

Cardinals compare by injections: κ≤λ if and only if there is an injection κ→λ, and if κ≤λ then κμ≤λμ. (Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ)

[F4]

The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)

Proof technique: direct.

Proof

1.1

Assume [F4]. Let κ be an infinite cardinal. By [F1], 2κ=∣P(κ)∣ is a cardinal and κ<2κ. Restricting to infinite regular κ gives clause (a).

F1F4given
1.2

Let κ≤λ be infinite regular cardinals. Every subset of κ is a subset of λ, so the inclusion P(κ)⊆P(λ) is an injection; by the injection criterion of [F3], ∣P(κ)∣≤∣P(λ)∣. Applying [F1] at κ and at λ turns this into 2κ≤2λ, which is clause (b).

F1F3
1.3

Clause (c) is [F2] at κ: cf⁡(2κ)>κ for every infinite cardinal κ, in particular for every infinite regular one.

F2
2.1

Clauses (a), (b) and (c) hold for all infinite regular cardinals, so in ZFC the continuum function on infinite regular cardinals satisfies exactly the displayed constraints. The Axiom of Choice enters only through [F1] and [F2] -- through the identification of 2κ with ∣P(κ)∣ and through König's theorem -- and no further selection is made in steps 1.2 and 1.3. ∎

F1F2step 1.1step 1.2step 1.3
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Easton functions on regular cardinals

Definition

An Easton function is a function F such that:

  • dom⁡(F) is a set, or a definable class, of infinite regular cardinals (Cofinality cf⁡(α), and regular and singular cardinals);
  • F(κ) is a cardinal for every κ∈dom⁡(F);
  • F is nondecreasing: F(κ)≤F(λ) whenever κ≤λ are in dom⁡(F);
  • cf⁡(F(κ))>κ for every κ∈dom⁡(F).

Because cf⁡(μ)≤μ for every ordinal μ (cf⁡(α)≤α; cf⁡(0)=0 and cf⁡(α+1)=1; for a limit ordinal λ the value cf⁡(λ) is an infinite cardinal with cf⁡(cf⁡(λ))=cf⁡(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf⁡(λ), a value that is attained), the last clause forces κ<cf⁡(F(κ))≤F(κ), so the values of an Easton function automatically satisfy the strictness F(κ)>κ; the two displayed inequalities together are the classical form (15.7)(i) and (iii) of Necessary constraints on the regular-cardinal continuum function. An Easton function with a set domain is a set-sized Easton function.

The class version is understood over a two-sorted class theory in which the set variables range over the sets of the ground model and F itself is one of the classes; there F is required to be definable from set parameters, its domain is the class of all infinite regular cardinals, and the four clauses above are read with set quantifiers and the class parameter F. A proper-class Easton function is not a set of ordered pairs. Its set-sized restrictions specify the cardinal index data for set-sized Easton products; forcing conditions are partial binary-valued functions on the associated triples. The class-theoretic ground assumptions are recorded separately on this page and are not part of the definition of F.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

The Easton-support product of higher Cohen forcings

Definition

Let F be an Easton function (Easton functions on regular cardinals). A condition in the Easton-support product P(F) is a function p with values in {0,1} whose domain is a set of triples (κ,α,β) with κ∈dom⁡(F), α<κ and β<F(κ), subject to the Easton support condition

∣{ (κ,α,β)∈dom⁡(p):κ≤γ }∣  <  γfor every infinite regular cardinal γ.

Each coordinate κ carries the Cohen order Add⁡(κ,F(κ))=Fn⁡(F(κ)×κ,2,<κ) (Cohen, collapse, and Lévy-collapse forcing orders), so the fibre pκ(α,β)=p(κ,α,β) is a partial function κ×F(κ)→2 of domain size <κ. A condition p is stronger than q, written p≤q, exactly when p⊇q: stronger conditions extend functions, and the empty function is the largest condition. When dom⁡(F) is a set, P(F) is a set; when dom⁡(F) is a proper class, P(F) is a proper class and its conditions are still sets. The support condition at γ=κ gives ∣dom⁡(pκ)∣<κ for every κ∈dom⁡(F).

For an infinite regular λ (Cofinality cf⁡(α), and regular and singular cardinals), the initial segment and the tail are the restrictions

p≤λ=p↾{(κ,α,β):κ≤λ},p>λ=p↾{(κ,α,β):κ>λ},

with P≤λ={p≤λ:p∈P(F)} and P>λ={p>λ:p∈P(F)}. Each condition splits uniquely into these two restrictions, and each restriction retains every support bound. Conversely, a head condition and a tail condition have disjoint domains, so their union is a function. For every infinite regular γ, its triples with κ≤γ form the union of two sets each of cardinality below γ, which again has cardinality below γ. Thus union is the inverse of the map p↦(p≤λ,p>λ), and both maps preserve extension. This proves the isomorphism P(F)≅P≤λ×P>λ of forcing orders. P≤λ is the Easton product of the fibres with κ≤λ, P>λ the Easton product of the fibres with κ>λ, and both split by first coordinate exactly as displayed.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Set-length Easton-support forcing iterations

Definition

A set-length Easton-support iteration of length δ follows the successor rule of an ordinary forcing iteration and replaces the finite support of Finite-support forcing iterations at limit stages by Easton support. Precisely, it is the transfinite recursion (Transfinite recursion) over an ordinal δ of set-indexed data ⟨Pα,Q˙α,1˙α:α<δ⟩. For each α, let Rα be the set-sized second-name carrier specified in Finite-support forcing iterations, and require a supplied 1˙α∈Rα with 1Pα⊩1˙α a largest condition of the nonempty preorder Q˙α. The recursion satisfies:

  • P0 is the trivial order, and Pα+1=Pα∗Q˙α is the two-step iteration of Finite-support forcing iterations, with the same carrier and the same coordinatewise order;
  • at a limit γ≤δ, a condition is a coherent function p on γ with p↾α∈Pα, p(α)∈Rα, and p↾α⊩p(α)∈Q˙α for every α<γ, whose non-top support {α<γ:p↾α⊮p(α)=1˙α} meets [0,γ′) in fewer than γ′ elements for every infinite regular γ′≤γ (Cofinality cf⁡(α), and regular and singular cardinals).

The order is coordinatewise in the forcing sense, as in the finite-support iteration. At γ=δ the resulting order has a largest condition, the all-top function supplied by the distinguished top names. Each initial segment Pα, including the final Pδ, is a set: at a limit it is a definable subset of the set of functions with values in the supplied carriers Rα. The top names are part of the data, so no uniform selection of names is inferred from mere existence of forced largest conditions.

This is a different presentation from the ground-model Easton product The Easton-support product of higher Cohen forcings: the iteration's Pγ-levels are built by recursion inside the ground model and need not be isomorphic to any P(F), and no such equivalence is asserted here. The product presentation carries the cardinal-preservation and continuum computations of this page; the iteration is recorded because the Easton support condition (15.9) of the source is stated for products of fibres and because a set-length iteration is the natural setting in which the same support bound is imposed at limit stages.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Easton head chain condition and tail closure

Statement

Work in ZFC and assume the Generalized Continuum Hypothesis, that is 2ℵα=ℵα+1 for every ordinal α (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1). Let F be an Easton function and let λ be an infinite regular cardinal. Write P(F), P≤λ and P>λ as in The Easton-support product of higher Cohen forcings. Then:

(a) 2<λ=λ;

(b) P≤λ has the λ+-chain condition, that is, every antichain of P≤λ has cardinality below λ+ (Closure, distributivity, and chain conditions for forcing orders);

(c) P>λ is λ+-closed: every descending sequence ⟨pξ:ξ<δ⟩ of conditions of P>λ with δ<λ+ has a common lower bound in P>λ; indeed every set of at most λ pairwise compatible conditions of P>λ has a common lower bound in P>λ;

(d) the factorization P(F)≅P≤λ×P>λ holds: for a set-sized F it is an isomorphism of the whole orders, and for a class Easton function it holds for every set-sized condition, with P≤λ a set.

Facts & Assumptions

Given: ZFC + GCH, an Easton function F, an infinite regular cardinal λ, and the Easton product P(F) with its head P≤λ and tail P>λ.

[F1]

Every θ-sized family of sets of cardinality below κ has a θ-sized delta subsystem, provided κ is infinite, θ>κ is regular and ∣α∣<κ<θ for every α<θ; in particular, for regular κ and ρ=2<κ, every family of ρ+ many below-κ subsets has a ρ+-sized delta subsystem. (Generalized delta systems for small supports)

[F2]

A delta system with root r is a family whose pairwise intersections are exactly r. (Delta systems and roots)

[F3]

P is κ-cc when every antichain of P has cardinality below κ, and κ-closed when every descending sequence of length below κ has a common lower bound, κ an infinite regular cardinal. (Closure, distributivity, and chain conditions for forcing orders)

[F4]

μ+ is the least cardinal above μ, and 2<λ is the supremum of the 2μ with μ<λ; each infinite cardinal is an ℵ. (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1)

[F6]

For cardinals ν≤μ with μ infinite, μ⊕ν=μ; also μ⊗ν=μ when ν≠0, whereas μ⊗0=0. (Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0)

[F7]

Cardinal exponentiation satisfies κμ⊕ν=κμ⊗κν and (κμ)ν=κμ⊗ν, and is monotone in the base, and in the exponent when the base is nonzero. (Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ)

[F8]

A condition of P(F) is a partial function on triples (κ,α,β) with κ∈dom⁡(F), α<κ, β<F(κ), values in {0,1}, with fewer than γ triples having first coordinate ≤γ for every infinite regular γ; stronger conditions extend functions, and p↦(p≤λ,p>λ) splits conditions by first coordinate. (The Easton-support product of higher Cohen forcings)

[F9]

The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)

Proof technique: direct.

Proof

1.1

Under GCH every infinite cardinal μ satisfies 2μ=μ+, by [F4]. If λ=ℵ0, then 2<λ=sup⁡n<ω2n=ℵ0=λ. If λ=ν+ for an infinite cardinal ν, then GCH gives 2ν=λ and monotonicity gives 2μ≤λ for every μ<λ, so again 2<λ=λ. If λ is a limit cardinal above ℵ0, the successor cardinals μ+ for infinite μ<λ are cofinal in λ, while each is at most λ; thus 2<λ=sup⁡μ<λμ+=λ. These cases prove clause (a) for every infinite regular λ.

F4F7given
1.2

Now let ⟨pξ:ξ<δ⟩ be a descending sequence in P>λ with δ<λ+, and put p=⋃ξ<δpξ. The conditions form a ⊆-chain of functions, so p is a function with values in {0,1}, and every triple in its domain has first coordinate >λ. Fix an infinite regular γ>λ and let Aξ={(κ,α,β)∈dom⁡(pξ):κ≤γ}. Each ∣Aξ∣<γ by [F8], and ∣δ∣≤λ<γ. Regularity of γ gives σ:=sup⁡ξ<δ∣Aξ∣<γ, so ∣⋃ξ<δAξ∣≤∣δ∣⋅σ<γ (with the finite or empty cases immediate). For γ≤λ the set in question is empty. Hence p∈P>λ and p extends every pξ, so P>λ is λ+-closed, clause (c), in the sense of [F3]; the same cardinal bound applies to a pairwise compatible family of at most λ conditions, whose union is a function because the members agree on overlaps.

F3F5F6F8
2.1

Consequently 2∣r∣≤2<λ=λ for every set r with ∣r∣<λ, and λ⊗λ=λ by [F6]; with Choice [F9], this bounds a union of λ many sets each of size at most λ by λ.

F6F9step 1.1
2.2

We prove clause (b) by contraposition. Suppose W⊆P≤λ is an antichain with ∣W∣=λ+. By the support condition of [F8] at the regular cardinal λ, every p∈W has ∣dom⁡(p)∣<λ. For any fixed domain there are at most 2<λ=λ bit assignments. Thus there are λ+ distinct domains, since otherwise Choice [F9] and λ⊗λ=λ would bound ∣W∣ by λ. Select one condition for each distinct domain. Now [F1] applies with κ=λ, ρ=2<λ=λ of step 1.1 and yields W′⊆W of size λ+ and a root r with dom⁡(p)∩dom⁡(q)=r for distinct p,q∈W′, in the sense of [F2].

F1F2F8F9step 1.1
3.1

The map p↦p↾r takes at most 2∣r∣≤λ values on W′ by step 2.1, and a union of λ many classes each of size at most λ has size at most λ; since ∣W′∣=λ+>λ, two distinct p,q∈W′ have p↾r=q↾r.

step 2.1step 2.2
4.1

For such p,q the union p∪q is a function, because the domains meet exactly in r and the two agree on r; all its triples still have first coordinate ≤λ. Let γ be an infinite regular cardinal with γ≤λ and let Ap={(κ,α,β)∈dom⁡(p):κ≤γ} and similarly Aq. By [F8] both have cardinality below γ, and ∣Ap∪Aq∣≤∣Ap∣⊕∣Aq∣<γ by [F6], the case of finite cardinalities being immediate since γ is infinite. Hence p∪q satisfies the support condition at every regular γ≤λ, and the bound at λ also implies the bound at every regular γ>λ. Thus it is a condition of P≤λ extending both p and q. This contradicts the antichain property of W, so no antichain of P≤λ has cardinality λ+: every antichain has cardinality below λ+, which is clause (b) by [F3].

F3F6F8step 2.1step 3.1
5.1

Every condition of P(F) splits uniquely as p=p≤λ∪p>λ with each restriction supported on its respective side of λ; since the support condition at a regular γ refers only to triples with κ≤γ, the two parts are conditions of P≤λ and P>λ respectively, every head-tail pair has disjoint domains and its union satisfies each support bound because the union of two sets of size below an infinite regular γ still has size below γ, and the extension order is preserved in both directions. Hence p↦(p≤λ,p>λ) is an isomorphism P(F)≅P≤λ×P>λ when dom⁡(F) is a set, and for a class Easton function the same computation applies to each set-sized condition; P≤λ is then a set, since its conditions are partial functions on the set of triples with κ≤λ of size below λ. This is clause (d) and completes the proof. [F8, given] ∎

step 1.1step 2.2step 4.1step 1.2
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

A closed Easton tail adds no short sequences across its chain-condition head

Statement

Work in ZFC. Let M be a transitive ground model of ZFC, let λ be an infinite cardinal of M, and let P,Q∈M be nonempty set-sized forcing preorders. Suppose, as computed in M, that P is λ+-closed and Q is λ+-cc: every descending P-sequence of length below λ+ has a common lower bound, and every pairwise-incompatible subset of Q has cardinality below λ+ (Closure, distributivity, and chain conditions for forcing orders, Forcing preorders, compatibility and filters).

For every M-generic filter G×H on P×Q and every f∈M[G×H] with f:λ→M, one has f∈M[H] (Valuation of names and M[G]). Thus the P factor adds no new λ-sequences of ground-model elements, subsets of λ, or cofinal maps from λ to ground-model ordinals over the head extension M[H]. The Q factor itself may add such objects.

This is Lemma 15.19 of the source in the library's strict closure convention: the source's "λ-closed" is λ+-closed here. In Easton's factorization, P is the closed tail and Q the cc head. The proof works below a condition that forces the chosen name to have ground-set values; it does not assume that every condition makes that name total.

Facts & Assumptions

Given: The ZFC ground M, the cardinal λ, the closed preorder P, the cc preorder Q, the product generic G×H, and f:λ→M in M[G×H].

[F1]

Closure and the chain condition have the strict conventions in the statement; for forcing preorders, compatible means having a common stronger condition, and an antichain means pairwise incompatible, not merely incomparable. (Closure, distributivity, and chain conditions for forcing orders, Forcing preorders, compatibility and filters)

[F2]

Generic filters meet ground-model dense sets; they are upward closed and downward directed. (Dense open sets and generic filters over a model, Forcing preorders, compatibility and filters)

[F3]

Forcing is monotone, its relation for any fixed formula is definable in M, and the truth lemma holds. The existential-name clause and the atomic membership clause for Aˇ give dense ground-value decisions below a condition forcing a coordinate to lie in a ground set A. (Monotonicity, density, and decision for forcing, Forcing theorem, Forcing relation for all formulas, Atomic forcing relation, Check names without a largest condition)

[F4]

A valuation has rank no greater than its name rank; a generic extension of a transitive ZFC model satisfies ZFC and contains its ground model and generic filter. (Transitivity and a valuation rank bound, Generic extensions satisfy ZF and preserve ground-model Choice)

[F5]

Transfinite recursion builds set-length sequences; Choice inside M well-orders the relevant ground sets and selects the witnesses used below. (Transfinite recursion, The Axiom of Choice)

Proof

1.1

Choose a P×Q-name f˙∈M with f=val⁡G×H(f˙), and put ρ=rk⁡P×Q(f˙). By [F4], rank⁡(f)≤ρ. Every value f(α) belongs to M and has rank below ρ+1; transitivity of M therefore puts it in the ground set A:=Vρ+1M. The product extension satisfies ZFC by [F4], so the truth lemma supplies r=(pr,qr)∈G×H forcing that f˙ is a function from λˇ into Aˇ. We will only use forcing below r.

F3F4given
1.2

Form the cones Pr={p∈P:p≤pr} and Qr={q∈Q:q≤qr} in M. They are nonempty. Every descending sequence in Pr of length below λ+ has a lower bound still in Pr (include pr when the sequence is empty); every pairwise-incompatible subset of Qr is one of Q, so Qr is λ+-cc. Here a maximal antichain of Qr means a pairwise-incompatible subset W such that every member of Qr is compatible with some member of W. This agrees with maximality by inclusion: a condition incompatible with all of W could be added, and conversely.

F1
2.1

For each α<λ let Dα⊆Pr be the set of p for which there are a maximal antichain W⊆Qr and a:W→A such that (p,q)⊩f˙(αˇ)=a(q)ˇ for every q∈W. The coordinate notation abbreviates the fixed first-order formula saying that f˙ has value a(q)ˇ at αˇ; no function-value term is added to the forcing language. This forcing relation is definable in M, and W and a range over ground sets, so Separation gives Dα∈M. Monotonicity makes Dα downward closed in Pr.

F3step 1.2
2.2

Fix p0∈Pr. Recursively, for γ<λ+, suppose ⟨(pξ,qξ,aξ):ξ<γ⟩ has been chosen with the pξ descending and the qξ pairwise incompatible. If Wγ={qξ:ξ<γ} is maximal in Qr, stop. Otherwise choose q′∈Qr incompatible with every member of Wγ. Closure gives pˉ∈Pr below p0 and every preceding pξ, since their number is below λ+. Because (pˉ,q′)≤r forces that the value of f˙ at αˇ lies in Aˇ, the existential-name clause first gives, densely below (pˉ,q′), a name σ forced to be that value and to belong to Aˇ. The atomic membership clause for Aˇ then gives a further pair (pγ,qγ)≤(pˉ,q′) and aγ∈A forcing σ=aγˇ, hence f˙(αˇ)=aγˇ. In particular qγ remains incompatible with all earlier qξ. The selected triples lie in the ground set Pr×Qr×A; Choice in M well-orders this set and makes the recursion deterministic. No choice from the proper class of all names is needed.

F1F3F5step 1.1step 1.2
3.1

The recursion stops at some β<λ+: otherwise the distinct qγ, γ<λ+, form a pairwise-incompatible subset of Qr of size λ+. At the stopping stage Wβ is maximal. Closure supplies p†∈Pr below p0 and every pξ for ξ<β. Monotonicity then gives (p†,qξ)⊩f˙(αˇ)=aξˇ for all ξ<β, so Wβ and a(qξ)=aξ witness p†∈Dα. Thus every Dα is dense open in Pr.

F1F3step 2.1step 2.2
4.1

The intersection D=⋂α<λDα belongs to M and is dense open in Pr. Indeed, starting below any p∈Pr, use [F5] to meet Dα successively for α<λ, taking lower bounds at limits and at the end. All these sequences have length at most λ<λ+; downward closure keeps the final condition in every Dα.

F1F5step 3.1
5.1

The projection G is M-generic for P: if E∈M is dense in P, then E×Q is dense in P×Q and the product generic meets it. To meet the cone-dense set D, use the global dense set ED=D∪{p∈P:p⊥pr}: if p is compatible with pr, first strengthen into Pr and then into D. Since pr∈G and a filter cannot contain incompatible conditions, G∩ED⊆D. Fix p∗∈G∩D. Choice in M selects, for all α<λ, witnesses (Wα,aα) to p∗∈Dα; their full sequence belongs to M.

F2F5step 2.1step 4.1
6.1

Similarly H is M-generic for Q. For each α, the downward closure of Wα is dense in Qr: compatibility with a member of the maximal antichain yields a common stronger condition. Lifting this cone-dense set to Q by adjoining conditions incompatible with qr shows that H meets it. Upward closure then gives some wα∈H∩Wα, and downward directedness makes wα unique because distinct members of Wα are incompatible.

F1F2step 1.2step 5.1
7.1

For each α<λ, (p∗,wα)∈G×H forces f˙(αˇ)=aα(wα)ˇ, so the truth lemma gives f(α)=aα(wα). The ground sequence ⟨(Wα,aα):α<λ⟩ and H belong to M[H], which satisfies ZFC by [F4]. Its Separation and Replacement therefore construct α↦aα(wα) there. This function is f, hence f∈M[H]. Characteristic functions and cofinal maps are special cases of such sequences, proving the stated relative conclusions. ∎

F3F4step 5.1step 6.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Set-sized Easton forcing preserves cardinals and cofinalities

Statement

Assume the Generalized Continuum Hypothesis, that is 2ℵα=ℵα+1 for every ordinal α (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1). Let F be a set-sized Easton function (Easton functions on regular cardinals), let M be a transitive ground model of ZFC, and let G be M-generic for the set-sized Easton product P(F) of The Easton-support product of higher Cohen forcings.

Then M and the generic extension M[G] have the same ordinals, the same cofinality function, and the same cardinals: for every ordinal δ∈M, cf⁡M[G](δ)=cf⁡M(δ) (Cofinality cf⁡(α), and regular and singular cardinals), and every M-cardinal remains a cardinal of M[G].

The proof is the source's cardinal-preservation argument after Lemma 15.19: if a regular ground cardinal became singular, a cofinal map of shorter length would already lie in the extension by the head of the product alone, and that head is chain-condition forcing on its regular cardinals.

Facts & Assumptions

Given: GCH, a set-sized Easton function F, a transitive ground model M of ZFC, and an M-generic filter G for P(F).

[F2]

For every infinite regular λ, the head P≤λ has the λ+-chain condition, the tail P>λ is λ+-closed, and P(F)≅P≤λ×P>λ. (Easton head chain condition and tail closure)

[F3]

For a transitive ZF model M containing a forcing order Q and its order, a filter K⊆Q is M-generic when K∩D≠∅ for every dense D⊆Q with D∈M, a set being dense when below every condition it contains a stronger one. (Dense open sets and generic filters over a model)

[F4]

If a set forcing P is λ+-closed and Q is λ+-cc, then every function f:λ→M in M[G×H] already lies in M[H]. (A closed Easton tail adds no short sequences across its chain-condition head)

[F5]

If θ is regular and P is θ-cc, then forcing with P preserves every ground-model cofinality at least θ and every ground-model cardinal at least θ. (Chain conditions preserve high cofinalities and ccc preserves cardinals)

[F7]

Forcing with a nonempty preorder preserves the ordinals, and over a transitive ZFC ground model the generic extension satisfies ZFC: ordinals, cofinalities and cardinal minima are computed in it by its own Replacement. (Forcing preserves ordinals, ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders)

[F8]

The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)

Proof

1.1

Fix the data of the statement, so that M⊆M[G] are transitive models with the same ordinals and M[G]⊨ZF, and let δ∈M be an ordinal.

F7given
1.2

For every infinite ground regular cardinal λ the factorization P(F)≅P≤λ×P>λ holds in M. The coordinate projections G>λ and G≤λ of G are M-generic: if D⊆P≤λ is dense and D∈M, then the set of conditions p∈P(F) with p≤λ∈D is dense in P(F) and lies in M, so G meets it and G≤λ meets D; the same computation with a dense D⊆P>λ handles the tail. Hence M[G]=M[G>λ][G≤λ].

F2F3
2.1

Every ground regular cardinal remains regular in M[G]. Suppose κ is infinite and regular in M but not in M[G], and let δ=cf⁡M[G](κ)<κ with a cofinal f:δ→κ in M[G]. Then δ is an infinite regular cardinal of M[G] and hence also of M: if cf⁡M(δ)<δ then M[G] would contain a cofinal map cf⁡M(δ)→δ by [F7], making δ singular in M[G]. So δ is an infinite regular cardinal of M with δ<κ, and by step 1.2 the lemma [F4] applies with the δ+-closed tail P>δ and the δ+-cc head P≤δ, giving f∈M[G≤δ]. Thus cf⁡M[G≤δ](κ)≤δ, while [F5] at θ=δ+≤κ gives cf⁡M[G≤δ](κ)=cf⁡M(κ)=κ>δ, a contradiction.

F1F6F7F8step 1.2
3.1

Every ground cardinal remains a cardinal of M[G]. Suppose not, and let κ be the least ground cardinal with ∣κ∣M[G]=μ<κ. By step 2.1, κ cannot be regular in M: an ordinal regular in the ZFC extension is a cardinal there. Thus κ is a singular ground cardinal, hence a limit cardinal, and the ground cardinals below it are cofinal in it. Choose a ground cardinal ν with μ<ν<κ. Minimality of κ makes ν a cardinal of M[G]. A bijection κ→μ in M[G] restricts to an injection ν→μ, since ν⊆κ and ν is an ordinal of M[G]; hence ∣ν∣M[G]≤μ<ν, a contradiction.

F1F7step 2.1
3.2

All ground cofinalities are preserved. Let κ=cf⁡M(δ) and fix a strictly increasing cofinal g:κ→δ in M, so that cf⁡M[G](δ)≤κ because g still has unbounded range in M[G]. If η=cf⁡M[G](δ)<κ, take a cofinal h:η→δ in M[G] and define h′:η→κ in M[G] by letting h′(ξ) be the least β<κ with h(ξ)≤g(β). Then h′ has cofinal range in κ: given β0<κ, cofinality of h gives ξ with h(ξ)≥g(β0), hence g(h′(ξ))≥h(ξ)≥g(β0) and h′(ξ)≥β0 by strict increase of g. So cf⁡M[G](κ)≤η<κ would hold, contradicting step 2.1 since κ is ground regular; therefore cf⁡M[G](δ)=κ=cf⁡M(δ).

F6F8step 2.1
4.1

Steps 3.2 and 3.1 show that M and M[G] have the same ordinals, the same cofinality function on the ordinals of M, and the same cardinals, which is the statement. ∎

step 3.23.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

GCH counts Easton head conditions and subset names

Statement

Work in ZFC and assume the Generalized Continuum Hypothesis (The Axiom of Choice, The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1); let F be an Easton function (Easton functions on regular cardinals) and let κ be an infinite regular cardinal of dom⁡(F) with cf⁡(F(κ))>κ. Write P≤κ for the head of the Easton product at κ (The Easton-support product of higher Cohen forcings).

Then ∣P≤κ∣=F(κ), and there are at most F(κ) nice P≤κ-names for subsets of κ (Nice names for subsets of a ground-model set). The count uses the κ+-chain condition of the head and only the GCH computation λμ=λ for cardinals 0<μ≤κ and λ≥κ with cf⁡(λ)>κ; the zero exponent has value λ0=1.

Facts & Assumptions

Given: ZFC + GCH, an Easton function F, an infinite regular cardinal κ∈dom⁡(F) with cf⁡(F(κ))>κ, and the head P≤κ of the Easton product.

[F2]

An Easton function F has cardinal values, is nondecreasing, and satisfies cf⁡(F(γ))>γ for every γ∈dom⁡(F); hence F(γ)>γ and F(γ)≤F(κ) for γ≤κ in dom⁡(F). (Easton functions on regular cardinals)

[F3]

A condition of P(F) is a partial function on triples (κ,α,β) with κ∈dom⁡(F), α<κ, β<F(κ) and values in {0,1}, with fewer than γ triples of first coordinate ≤γ for every infinite regular γ, and p↦(p≤κ,p>κ) splits conditions by first coordinate into the head and the tail. (The Easton-support product of higher Cohen forcings)

[F4]

Under GCH the head P≤κ has the κ+-chain condition, that is, every antichain of P≤κ has cardinality below κ+ (Closure, distributivity, and chain conditions for forcing orders); the head is the Easton product of the Cohen fibres with first coordinate ≤κ and is a set. (Easton head chain condition and tail closure)

[F5]

A nice P-name for a subset of a ground-model set A is a name {⟨aˇ,p⟩:a∈A, p∈Aa} with each Aa⊆P an antichain. (Nice names for subsets of a ground-model set)

[F6]

Cardinal exponentiation satisfies κμ⊕ν=κμ⊗κν and (κμ)ν=κμ⊗ν and is monotone in the base and in the exponent for nonzero base, and for cardinals with ν≤μ, μ infinite, μ⊕ν=μ and μ⊗ν=μ when ν≠0, while μ⊗0=0; cardinals compare by injections. (Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ, Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0)

[F8]

The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)

Proof

1.1

Preliminary computation: if λ>ℵ0 is a cardinal and 0<μ<cf⁡(λ) is a cardinal, then λμ=λ; consequently λ<ρ=λ whenever 1<ρ<cf⁡(λ). Fix a cofinal sequence ⟨λα:α<cf⁡(λ)⟩ of ordinals below λ. A function f:μ→λ has bounded range because μ<cf⁡(λ), so its range lies in some λα. Let ρα=∣λα∣ and τα=max⁡{ρα,μ,ℵ0}<λ. Under GCH, ραμ≤τατα=2τα=τα+≤λ. Thus λμ≤∑α<cf⁡(λ)ραμ≤λ by Choice and cardinal absorption; the reverse inequality follows from constant functions. The case μ=0 has value 1 and does not affect the displayed supremum, which includes μ=1.

F1F6F7F8
1.2

Write Bγ={(γ,α,β):α<γ, β<F(γ)} for each γ∈dom⁡(F) with γ≤κ; all block indices below are restricted to these γ. A condition p∈P≤κ is a partial bit function on ⋃γ≤κBγ satisfying the Easton support bounds. In particular, the graph of its γ-block is a subset of Bγ×2 of size below γ. There are at most κ indices γ, ∣Bγ×2∣=F(γ)≤F(κ), and by [F4] every antichain of the head has cardinality at most κ.

F2F3F4F6
1.3

∣P≤κ∣≥F(κ): for each β<F(κ) the singleton bit condition {(κ,0,β)↦1} satisfies every Easton support bound. These F(κ) conditions are distinct, giving the lower bound.

F3
2.1

∣P≤κ∣≤F(κ): by step 1.2 the graph of each γ-block has size below γ, so the number of possible blocks is at most ∑η<γ(2⋅F(γ))∣η∣≤γ⋅F(γ)=F(γ) by step 1.1 and absorption; the term for η=0 is 1. Here the cofinality of F(γ) exceeds γ. Coding a condition by its at most κ blocks therefore gives ∣P≤κ∣≤∏γ≤κF(γ)≤F(κ)κ=F(κ).

F2F6step 1.1step 1.2
3.1

Steps 2.1 and 1.3 give injections in both directions between P≤κ and F(κ), so ∣P≤κ∣=F(κ) by antisymmetry of cardinal comparison.

F6step 2.1step 1.3
4.1

There are at most F(κ) nice P≤κ-names for subsets of κ: by [F5] such a name is coded by the function κ→{A⊆P≤κ:A is an antichain} sending a↦Aa, and two such functions that differ at an a with Aa≠Aa′ give different names, since then either Aa∖Aa′ or Aa′∖Aa contains some p and ⟨aˇ,p⟩ lies in exactly one of the two names; by step 1.2 every antichain has cardinality at most κ, so there are at most ∣P≤κ∣κ=F(κ)κ=F(κ) antichains by steps 3.1 and 1.1, and at most F(κ)κ=F(κ) such coding functions by step 1.1. The exponent laws and products used are those of [F6], which hold under the Axiom of Choice [F8].

F5F6F8step 1.1step 1.2step 3.1
5.1

Steps 3.1 and 4.1 give ∣P≤κ∣=F(κ) and at most F(κ) nice P≤κ-names for subsets of κ, which is the statement. ∎

step 3.1step 4.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Set-sized Easton realization on regular cardinals

Statement

Assume the Generalized Continuum Hypothesis (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1), let M be a transitive ground model of ZFC, let F be a set-sized Easton function (Easton functions on regular cardinals) and let G be an M-generic filter for the set-sized Easton product P(F) (The Easton-support product of higher Cohen forcings).

Then:

(a) M and M[G] have the same ordinals, the same cofinality function and the same cardinals; and

(b) in M[G] the continuum function on dom⁡(F) is realized by F: for every κ∈dom⁡(F), (2κ)M[G]=F(κ), the ground-model cardinal F(κ) being still a cardinal of M[G].

The proof is the source's realization computation: the head alone carries every subset of κ in the extension and has at most F(κ) nice names for them, while the F(κ) many κ-columns of the generic are pairwise distinct by density.

Facts & Assumptions

Given: GCH, a transitive ground model M of ZFC, a set-sized Easton function F, and an M-generic filter G for P(F).

[F1]

M and M[G] have the same ordinals, the same cofinality function and the same cardinals, and every M-cardinal remains a cardinal of M[G]. (Set-sized Easton forcing preserves cardinals and cofinalities)

[F2]

An Easton function F has cardinal values, is nondecreasing, and satisfies cf⁡(F(κ))>κ for κ∈dom⁡(F), so F(κ)>κ and F(κ)≥κ+. (Easton functions on regular cardinals)

[F3]

For every infinite regular λ: P≤λ has the λ+-chain condition, P>λ is λ+-closed, and P(F)≅P≤λ×P>λ with head P≤λ and tail P>λ, both sets when F is set-sized. (Easton head chain condition and tail closure)

[F4]

A condition of P(F) is a partial function on the triples (κ,α,β), κ∈dom⁡(F), α<κ, β<F(κ), values in {0,1}, with fewer than γ triples of first coordinate ≤γ for every infinite regular γ, ordered by reverse inclusion; a condition of the head P≤κ therefore has fewer than κ triples, and the fibre at κ is Add⁡(κ,F(κ))=Fn⁡(F(κ)×κ,2,<κ). (The Easton-support product of higher Cohen forcings)

[F5]

A filter K⊆Q is M-generic when K∩D≠∅ for every dense D⊆Q with D∈M, a set being dense when below every condition it contains a stronger one. (Dense open sets and generic filters over a model)

[F6]

If a set-sized forcing P is λ+-closed and Q is λ+-cc, then for every M-generic G×H and every f:λ→M with f∈M[G×H] one has f∈M[H]; in particular the P-factor adds no new subsets of λ over the intermediate head extension M[H]. (A closed Easton tail adds no short sequences across its chain-condition head)

[F7]

Under GCH, for every κ∈dom⁡(F): ∣P≤κ∣=F(κ), and there are at most F(κ) nice P≤κ-names for subsets of κ. (GCH counts Easton head conditions and subset names)

[F8]

Every P-name forced to be a subset of a ground-model set A is forced equal to a nice name, that is, to a name {⟨aˇ,p⟩:a∈A, p∈Aa} with each Aa⊆P an antichain. (Nice-name reduction and the ccc counting bound, Nice names for subsets of a ground-model set)

[F9]

For each fixed formula the forcing relation is definable from P and the name parameters over M, p⊩φ(τ⃗) implies M[G]⊨φ(τ⃗G) for every M-generic G∋p, and every element of M[G] is the value of a name in M. (Forcing theorem, Forcing names and their rank, Check names without a largest condition)

[F10]

The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)

Proof

1.1

Fix κ∈dom⁡(F). Then κ is an infinite regular cardinal, F(κ) is a ground cardinal with F(κ)>κ and cf⁡(F(κ))>κ by [F2], and by [F1] the models M⊆M[G] have the same ordinals, cofinality function and cardinals, so κ keeps its cofinality and F(κ) is still a cardinal of M[G].

F1F2
1.2

The head and the tail are the factors of P(F) at κ: P(F)≅P≤κ×P>κ with P>κ κ+-closed, P≤κ κ+-cc and both set-sized [F3, F4]. The coordinate projections G>κ and G≤κ of G are M-generic: if D⊆P≤κ is dense and D∈M, then {p∈P(F):p≤κ∈D} is dense in P(F) and lies in M, so G meets it and G≤κ meets D, and symmetrically for the tail; hence M[G]=M[G>κ][G≤κ].

F3F4F5
2.1

(2κ)M[G]≤F(κ): let x∈M[G] with x⊆κ. Its characteristic function is a function κ→M in M[G], so x∈M[G≤κ] by [F6] applied to the pair P>κ, P≤κ of step 1.2. By [F9] there is a P≤κ-name σ∈M with σG≤κ=x. Form in M the usual name σ′ for σ∩κˇ; the top condition forces σ′⊆κˇ, and σG≤κ′=x. By [F8] there is a nice P≤κ-name τ∈M with τG≤κ=x. By [F7] the set of nice P≤κ-names for subsets of κ has at most F(κ) elements in M, and F(κ) is a cardinal of M[G] by step 1.1, so the assignment x↦ the ground well-order-least such τ, which is defined in M[G] using the well-order that [F10] gives in M, is an injection of the subsets of κ in M[G] into F(κ). Hence (2κ)M[G]≤F(κ).

F6F7F8F9F10step 1.1step 1.2
2.2

(2κ)M[G]≥F(κ): for each β<F(κ) form the P≤κ-name x˙β={⟨αˇ,p⟩:α<κ, p∈P≤κ, p(κ,α,β)=1}. Its value is a subset of κ. For each α<κ, the head conditions deciding the coordinate (κ,α,β) are dense, so α belongs to xβ:=val⁡G≤κ(x˙β) exactly when the generic column at (α,β) has bit 1. For distinct β,β′ and any head condition p∈P≤κ, choose α<κ not occurring in any triple of dom⁡(p), possible since ∣dom⁡(p)∣<κ. Then q=p∪{(κ,α,β)↦1,(κ,α,β′)↦0} is a head condition stronger than p with ∣dom⁡(q)∣<κ; adding these two coordinates also leaves the support bounds below κ intact. The condition q forces αˇ∈x˙β and αˇ∉x˙β′. Thus the head conditions forcing x˙β≠x˙β′ are dense. By [F9] the map β↦xβ is an injection of F(κ) into P(κ) in M[G], and (2κ)M[G]≥F(κ).

F4F5F9step 1.2
3.1

Steps 2.1 and 2.2 and the fact that F(κ) is a cardinal of M[G] give (2κ)M[G]=F(κ) for the fixed κ, and κ∈dom⁡(F) was arbitrary, so the continuum function on dom⁡(F) is realized; step 1.1 gives the preservation clause (a). This is the statement. ∎

step 1.1step 2.1step 2.2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Class-theoretic ground assumptions for Easton forcing

Definition

The class-forcing results on this page are stated over the following ground, which is the setting of the source's class-forcing section. A GBC + Global Choice + GCH ground is a pair (M,C) such that:

  • (sets) M is a countable transitive set with M⊨ZFC+GCH, that is, ZFC together with 2ℵα=ℵα+1 for every ordinal α (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1);
  • (classes) C⊆P(M) is a countable collection of subsets of M, the classes of the ground, containing all M-definable subsets with set parameters, every set of M (identified with its M-elements), and the set M itself; complements relative to M and finite intersections belong to C by comprehension below;
  • (comprehension) for every formula φ(v,u1,…,um,X1,…,Xn) of the two-sorted language whose bound variables range over sets only, and all parameters a1,…,am∈M and X1,…,Xn∈C, {a∈M:(M,C)⊨φ(a,a⃗,X⃗)} is a class in C; class quantifiers are thus never used in comprehension, and every class of C is a subset of M;
  • (class Replacement) if A∈C is a functional class and a∈M, then the image {y∈M:∃x∈a (x,y)∈A} is an element of M, so set-indexed class images are sets;
  • (Global Choice) there is a class W∈C that well-orders all of M as a class of ordered pairs; equivalently, over the other GBC axioms (Williams, Fact 1.18), there is a class function choosing an element of every nonempty set of M.

The set part M alone is a transitive model of ZFC (Ordinals and omega in transitive models); the class part is kept countable on purpose, so that below there are only countably many dense classes to meet and a generic filter exists externally.

A definable Easton class function over such a ground is a function F, arising as a class of C via a fixed definition with set parameters (Easton functions on regular cardinals), that is defined on every infinite regular cardinal of M, takes cardinal values, is nondecreasing, and satisfies cf⁡(F(κ))>κ for every infinite regular κ. The Easton class product P(F) is the class of conditions of The Easton-support product of higher Cohen forcings for this F; it is a class of C, and each of its conditions is a set of M, while P(F) itself is not a set of M.

Finally, an M-generic filter for the class product is a filter G⊆P(F) (nonempty, upward closed and directed under the order p≤q⇔p⊇q, a condition being stronger the larger its domain) such that G∩D≠∅ for every D∈C that is dense in P(F). It is part of this hypothesis that such a G is available externally: since M and C are countable, and the dense classes in question form a subcollection of the countable C, such filters exist and every condition extends into one.

Existence and reading. A ground of this kind is not a theorem of ZFC. It is available, for example, from any countable transitive set M⊨ZFC+V=L: take C=Def⁡(M), the subsets definable over M with set parameters. Substituting the finitely many definitions of class parameters proves elementary comprehension; for a definable functional class, Replacement in M gives its image on each set. The constructible well-order is definable in M, providing Global Choice. There are countably many formulas and finite tuples of parameters from M, so C is countable. GCH holds in M because V=L proves GCH (The generalized continuum hypothesis holds in L). All class items on this page are therefore conditional statements about such a ground: they assert nothing in ZFC alone, and this page never claims that a countable transitive model of ZFC + GCH, or a ground of this definition, exists in ZFC.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Set-stage names and the forcing truth lemma for the Easton class product

Statement

Let (M,C) be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), let F be a definable Easton class function, let P=P(F) be the Easton class product and let G be an M-generic filter on P. For an infinite regular λ write P≤λ for the head, G≤λ=G∩P≤λ and M[G≤λ] for the set-forcing extension (Valuation of names and M[G]).

Then:

(a) Stages. For every infinite regular λ the head P≤λ is a set of M, G≤λ is an M-generic filter on P≤λ, and M[G≤λ]⊆M[G≤μ] for λ≤μ.

(b) Names. Every condition of P lies in P≤λ for some infinite regular λ; call a set τ∈M a P-name if it is a P≤λ-name (Forcing names and their rank) for some infinite regular λ. Every individual P-name is a set of M, the predicate "x is a P-name" is definable in (M,C) from P, and the P-names are exactly the members of the class ⋃λMP≤λ; for each fixed λ, MP≤λ itself denotes an internally proper class of M, not an element of M containing all names.

(c) Valuation. For a P-name τ and any infinite regular λ with τ∈MP≤λ, set τG:=val⁡G≤λ(τ) (Valuation of names and M[G]). This value is independent of λ, and with M[G]:=⋃λM[G≤λ]={τG:τ a P-name} every element of M[G] is the value of a P-name and each M[G≤λ] is contained in M[G].

(d) Definable forcing and the truth lemma. For a fixed membership formula φ, define p⊩φ(τ⃗) for p∈P and P-names τ⃗ by the clauses of Atomic forcing relation and Forcing relation for all formulas, read with the class P in place of a set preorder and with "name" meaning "P-name" as in (b). Then the relation ⊩ is a class of C, definable in (M,C) from P and F by a single formula for each fixed φ, and it satisfies the truth lemma

M[G]⊨φ(τ⃗G)⟺∃p∈G (p⊩φ(τ⃗)).

This is the class-forcing interface of the source: set stages supply all names, the class relation is defined clause by clause without any class-sized join, and the truth lemma is proved by induction on the formula using that G meets every dense class of the ground.

Facts & Assumptions

Given: A GBC + Global Choice + GCH ground (M,C), a definable Easton class function F, its class product P, and a filter G meeting every dense class in C.

[F1]

Class comprehension with set quantifiers and class parameters, class Replacement, Global Choice, and set-level ZFC + GCH hold in (M,C); P is a class in C. (Class-theoretic ground assumptions for Easton forcing)

[F2]

Every p∈P is a set condition, P≤λ is a set, and the restrictions split P into the product of the head and tail. The same splitting holds between two set heads. (The Easton-support product of higher Cohen forcings, Easton head chain condition and tail closure)

[F3]

Set forcing names are sets formed by a rank recursion; the name predicate and rank are uniformly definable from the set forcing order, and namehood is absolute for transitive grounds containing that order. (Forcing names and their rank, Absoluteness of names and their ranks)

[F4]

Valuation is the recursion selecting subnames whose coefficient conditions belong to the generic filter; a set-forcing extension consists of the values of all its ground names. (Valuation of names and M[G])

[F5]

The atomic forcing clauses define a unique, uniformly definable rank recursion for a set forcing preorder. The formula clauses use conjunction, negation, and the dense-witness clause for an existential. (Atomic forcing relation, Atomic forcing is well-founded and definable, Forcing relation for all formulas)

[F6]

For a set forcing preorder in a transitive ground, the definable forcing relation satisfies the truth lemma for each fixed formula; in particular this holds for atomic formulas in every set head. (Forcing theorem)

[F7]

A generic filter is upward closed and directed. Forcing is monotone under strengthening, and the conditions deciding a fixed formula are dense for set forcing. (Dense open sets and generic filters over a model, Monotonicity, density, and decision for forcing)

Proof

1.1

Set stages. For every infinite regular λ, P≤λ∈M by [F2]. If D∈M is dense in that head, the class D∗={p∈P:p≤λ∈D} belongs to C by [F1] and is dense in P: below p, choose q≤p≤λ in D and take q∪p>λ. Thus G meets D∗. Because restriction of a member of G is weaker and hence also belongs to G, G≤λ=G∩P≤λ meets D. Restrictions of common extensions show that G≤λ is directed; it is upward closed in the head, so it is M-generic. For λ≤μ, P≤λ⊆P≤μ and G≤λ=G≤μ∩P≤λ.

F1F2F7
1.2

Names. Every p∈P has a set of first coordinates, bounded by some infinite regular λ, and therefore belongs to P≤λ. For a set τ∈M, the assertion that there is a regular λ for which τ is a P≤λ-name is a first-order assertion over M with parameter F: the order P≤λ is a set uniformly defined from F, and the set-name predicate is uniform by [F3]. Comprehension [F1] makes the P-names a class in C. Each such name is individually a set of M; for each fixed λ, the collection MP≤λ of all names is internally a proper class of M (it includes xˇ for every x∈M). No element of M containing all names is used.

F1F2F3
1.3

Atomic reduction to a set head. Suppose λ≤μ are infinite regular, σ,τ are P≤λ-names, and p∈P≤μ. In the factorization P≤μ≅P≤λ×P(λ,μ], the set-forcing atomic clauses give p⊩P≤μσRτ⟺p≤λ⊩P≤λσRτ for R∈{=,∈}. To verify this, induct simultaneously on the sorted pair of name ranks used in [F5]. Every coefficient of σ,τ lies in the smaller head. A condition below p projects to a condition below p≤λ, and every head condition below p≤λ lifts by union with p(λ,μ]. The same projection and lifting work below any head coefficient and for the stronger witnesses in the dense membership and subset clauses. The recursive equality calls involve strictly smaller name-rank pairs, so the induction hypothesis makes their truth invariant under the projection. This proves the equivalence for equality and membership, including both directions of every density clause.

F2F3F5
1.4

Meeting a dense class below a condition. If p∈G and D∈C is dense below p, then D∪{r∈P:r⊥p} is a dense class in C: a condition incompatible with p is already in it, while a compatible one has a common extension with p and then an extension in D. Genericity makes G meet this union. Directedness prevents any member of G from being incompatible with p, so G∩D≠∅. The cone {r:r≤p} itself is not claimed dense in all of P.

F1F7
2.1

Valuation. The name classes increase with the heads: a P≤λ-name remains a P≤μ-name when λ≤μ, by induction on name rank and inclusion of the orders. If τ is a name from the smaller head, every coefficient and subname of τ also comes from that head. The equality G≤λ=G≤μ∩P≤λ from step 1.1 and induction in the valuation recursion [F4] yield val⁡G≤λ(τ)=val⁡G≤μ(τ). Hence τG is independent of stage, the set extensions are nested, and M[G]=⋃λM[G≤λ] is precisely the class of values of P-names.

F3F4step 1.1
2.2

The same rank induction works with the full class product in place of P≤μ. For p∈P, choose a regular λ containing p,σ,τ; every class condition q≤p projects to q≤λ≤p≤λ, and every head condition below p≤λ lifts by union with p>λ. A witness below an arbitrary q lifts with q>λ. Thus the atomic clauses read with the class P define exactly p⊩PσRτ⟺p≤λ⊩P≤λσRτ. Step 1.3 makes the right side independent of the sufficiently large stage. Since the set-forcing atomic relation is uniformly definable by [F5], this is a first-order definition over M with class parameter F, so its extension belongs to C by [F1]. It uses a set-head recursion and no class-sized Boolean join or class-valued rank recursion. This is the atomic set-stage interface used by Jech on printed pp.235–236.

F1F2F5step 1.2step 1.3
3.1

Formula forcing. Starting from step 2.2, define the forcing predicate for each fixed formula by the clauses of [F5]. At a conjunction or negation substitute the already defined subformula predicates. At an existential, quantify over set conditions and over sets satisfying the P-name predicate of step 1.2. All these are set quantifiers with class parameter P, so finite induction on the fixed formula and comprehension [F1] give one defining class in C for that formula. The clauses also give monotonicity by induction: strengthening preserves atomic forcing by step 2.2 and [F7], preserves conjunction and negation immediately, and preserves the dense-witness existential clause because every condition below a stronger condition was already below the original.

F1F5F7step 1.2step 2.2
3.2

Atomic truth. Fix atomic φ(τ⃗) and a regular λ containing all its names. Their values in M[G] equal their values in M[G≤λ] by step 2.1. If φ is true there, the set-forcing truth lemma [F6] supplies q∈G≤λ forcing it in the head; step 2.2 makes q⊩Pφ. Conversely if p∈G forces the atom in P, enlarge λ to include p; then p≤λ∈G≤λ forces it in the set head by step 2.2, so [F6] gives its truth in the head and hence in M[G].

F6step 1.1step 2.1step 2.2
4.1

Connectives. Induct on a fixed formula, the atomic case being step 3.2. For conjunction, if both conjuncts are true, their induction witnesses p,q∈G have a common stronger member r∈G, which forces both by monotonicity from step 3.1. The converse follows from the two induction soundness directions. For negation, the class Dψ={p:p⊩ψ or p⊩¬ψ} is definable by step 3.1 and dense: below any condition either some extension forces ψ, or that condition itself forces ¬ψ by the negation clause. Therefore G meets Dψ. If ψ is false in M[G], the induction soundness direction excludes the positive side of this meeting, leaving some p∈G that forces ¬ψ. Conversely if p∈G forces ¬ψ but ψ were true, induction would give q∈G forcing ψ; a common extension of p,q in G would force ψ, contrary to the negation clause.

F1F5F7step 3.1step 3.2
4.2

Existential quantifier. If M[G]⊨∃x ψ(x,τ⃗G), choose a witness a=σG by step 2.1. Induction gives p∈G forcing ψ(σ,τ⃗); monotonicity makes the matrix hold below every q≤p, so the existential forcing clause gives p⊩∃x ψ(x,τ⃗). Conversely suppose p∈G forces the existential. The class D={r:∃P-name σ (r⊩ψ(σ,τ⃗))} belongs to C by step 3.1 and is dense below p by the existential clause. Step 1.4 gives r∈G∩D and a witnessing name σ; induction yields M[G]⊨ψ(σG,τ⃗G) and hence the existential.

F1F5step 2.1step 3.1step 1.4
5.1

Steps 1.1–2.1 prove stages, names and valuation. Steps 1.3–3.1 prove the class relation is well defined and definable for every fixed formula, and steps 3.2–4.2 prove its truth lemma by formula induction. All choices of head antichains or names in this proof occur inside a set-forcing truth lemma or as one existential witness; the class comprehension and class genericity uses are explicit in steps 1.1, 2.2–3.1 and 1.4–4.2. This proves (a)–(d). ∎

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Uniform head-antichain decisions below a class tail

Statement

Let (M,C) be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), F a definable Easton class function with class product P=P(F) and G an M-generic filter, and let λ be an infinite regular cardinal of M (Set-stage names and the forcing truth lemma for the Easton class product for the forcing relation and the truth lemma). Fix a membership formula φ, an ordinal μ≤λ of M and a ground sequence ⟨τ⃗α:α<μ⟩∈M of tuples of P≤λ-names.

A tail condition t∈P>λ decides φ on ⟨τ⃗α⟩ when for every α<μ there is a maximal antichain Wα⊆P≤λ such that for every q∈Wα the condition t∪q forces φ(τ⃗α) or forces its negation. If φ has the form ∃x ψ(x,τ⃗α), each positive cell also carries a ground set name σ with t∪q⊩ψ(σ,τ⃗α).

Then:

(a) The class D⊆P>λ of conditions that decide φ on ⟨τ⃗α⟩ is dense in P>λ, open, and a member of C; hence some t∈G>λ decides it.

(b) For such t, every decision is confirmed at the level of the head: for each α<μ the unique qα∈Wα∩G≤λ has t∪qα in the class filter, so the truth value of φ(τ⃗α,G) in M[G] is the value recorded at qα, and the set {α<μ:M[G]⊨φ(τ⃗α,G)}, together with the sets of head antichains and decisions, belongs to M[G≤λ].

(c) For an outer existential formula, the witness names attached to its positive decisions form a ground set S, and there is an infinite regular γ of M with S⊆MP≤γ; consequently {σG:σ∈S}∈M[G≤γ] is a set in the class extension containing every witness value that these decisions produce.

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground, a definable Easton class function F, the class product P=P(F), an M-generic filter G, an infinite regular λ, an ordinal μ≤λ, a formula φ and a ground sequence ⟨τ⃗α:α<μ⟩ of tuples of P≤λ-names.

[F1]

C is closed under comprehension with set quantifiers and class parameters, M⊨ZFC+GCH, class Replacement holds, G meets every class of C that is dense in P, and Global Choice supplies class choices. (Class-theoretic ground assumptions for Easton forcing)

[F2]

P≤λ is a set with the λ+-chain condition, P>λ is λ+-closed, and P≅P≤λ×P>λ with p↦(p≤λ,p>λ); each condition of the tail is a set of triples with first coordinates >λ, and a union of a descending sequence of tail conditions of length below λ+ is a tail condition. (The Easton-support product of higher Cohen forcings, Easton head chain condition and tail closure)

[F3]

The class forcing relation is defined over the class of P-names by the atomic and formula clauses, is a class of C definable from P and F, and satisfies the truth lemma M[G]⊨φ(τ⃗G)⇔∃p∈G (p⊩φ(τ⃗)). (Set-stage names and the forcing truth lemma for the Easton class product)

[F4]

The formula clauses are: p⊩¬ψ iff no q≤p forces ψ; p⊩∃x ψ(x,τ⃗) iff below every q≤p there are r≤q and a name σ with r⊩ψ(σ,τ⃗); p⊩ψ∧θ iff both. (Forcing relation for all formulas, Atomic forcing relation)

[F5]

Forcing is monotone and decidable: p⊩φ and q≤p imply q⊩φ, and every condition has a stronger one forcing φ or forcing ¬φ. (Monotonicity, density, and decision for forcing)

[F6]

A filter is directed and upward closed; density and genericity are as in the density convention; a set of pairwise incompatible conditions is an antichain, and an antichain is maximal when every condition is compatible with one of its members. (Dense open sets and generic filters over a model)

[F7]

Ground AC is assumed: every set-indexed family of nonempty sets has a choice function (The Axiom of Choice). Since M⊨ZFC and each head is a set forcing with an M-generic filter, every head extension satisfies ZFC, including AC, Separation and Replacement. (Generic extensions satisfy ZF and preserve ground-model Choice)

Proof

1.1

For each α<μ the class of conditions deciding φ(τ⃗α) is definable and dense by [F3] and [F5]. For a fixed α we build a good tail condition below any given t0∈P>λ: at successor stages choose a head condition incompatible with all previously chosen ones, strengthen the head and tail to decide φ(τ⃗α), and use the resulting stronger head condition as qξ. If φ is an outer existential formula and the decision is positive, strengthen head and tail once more and choose a ground witness name forcing its matrix by the existential density clause [F4]; the final head condition remains incompatible with earlier cells. Use the Global Choice least witness among those of least rank at each successor stage. At limit stages ξ<λ+ take the union of the earlier tails, which is a condition by [F2]; class Replacement collects each set-length initial segment. If the construction did not stop before λ+, class Replacement would collect a forbidden λ+-sized head antichain. Decisions and attached witnesses persist under stronger tails. By the λ+-chain condition of the head, this recursion must stop before λ+, when the head antichain is maximal. The resulting tail is good for α, so the class of tails good for one α is dense and open in P>λ and belongs to C by [F1]; the set-indexed choices and antichains are supplied by Global Choice and class Replacement in [F1] and ground Choice [F7].

F1F2F3F4F5F7
2.1

Iterating step 1.1 along the α<μ≤λ many indices: given t good for all β<α, apply step 1.1 to t and α to get t′≤t good for α, and the antichains and decisions already attached to the earlier indices persist because decisions are inherited by stronger conditions by [F5], using monotonicity and the fact that Wβ remains maximal. Choose at each stage the least-rank witness tuple and then its Global Choice least representative; class Replacement [F1] collects the μ-indexed antichains, decision maps and attached witness names into one ground set. Thus the class D of tail conditions deciding φ on ⟨τ⃗α⟩ is the intersection of the μ many open dense classes, it is open and in C, and it is dense in P>λ: given t0, build a descending sequence ⟨tα:α<μ⟩ with tα good for all β≤α by recursion of length μ≤λ, taking lower bounds at limits by λ+-closure, and a lower bound of the whole sequence is in D by openness.

F1F2F5F7step 1.1
3.1

The class D∗={p∈P:p>λ∈D} is dense in P and lies in C, because below any p the class D supplies a tail condition t≤p>λ and then p≤λ∪t≤p has its tail in D; so by the genericity of G there is t=p>λ∈G>λ with t∈D, and by [F6] G>λ is a directed filter in the tail.

F1F2F6step 2.1
4.1

Confirmation and definability in the head stage. Fix t∈G>λ∩D from step 3.1 and α<μ. The antichain Wα and the decisions are ground sets, hence lie in M[G≤λ]; since G≤λ is an M-generic filter on P≤λ [F6] and Wα is a maximal antichain of P≤λ, there is exactly one qα∈Wα∩G≤λ, and uniqueness uses directedness of the filter and pairwise incompatibility inside the antichain. The condition t∪qα is extended by an element of G: any common extension of t and qα in G is below it, so by [F3] and [F5] the truth value of φ(τ⃗α,G) in M[G] is exactly the value recorded at qα, and the recorded value is a formula of M[G≤λ] with the ground parameters Wα and the decision function; consequently the set {α<μ:M[G]⊨φ(τ⃗α,G)} is defined in M[G≤λ] by Separation in that ZFC set extension [F7] applied to μ. For an outer existential formula, its positive cells carry the witness names selected in step 1.1.

F1F3F5F6F7step 1.1step 3.1
5.1

The witness names. The witnesses attached in step 4.1 are names of M and they are indexed by the set μ×⋃α<μWα, which is a set of M because each Wα is a set of cardinality at most λ by [F2] and μ≤λ; by Replacement in M [F1] the class function sending each such name to the least infinite regular cardinal of its stage is bounded on this set, so there is an infinite regular γ with S⊆MP≤γ; then {σG:σ∈S}={σG≤γ:σ∈S}∈M[G≤γ] by the stage valuation of [F3] and Replacement in the set extension [F7], which is the last clause.

F1F2F3F7step 4.1
6.1

Steps 2.1, 3.1, 4.1 and 5.1 establish (a), (b) and (c): a class-generic extension contains one tail condition and ground head antichains deciding the formula on every tuple, the truth values are computed in the head stage, and the witness names lie in one ground stage; this is the statement. ∎

step 2.1step 3.1step 4.1step 5.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Separation and Power Set in the Easton class extension

Statement

Let (M,C) be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), F a definable Easton class function with class product P=P(F) and G an M-generic filter (Set-stage names and the forcing truth lemma for the Easton class product).

Then M[G] satisfies the Separation scheme, formula by formula with set parameters, and for every a∈M[G] there is an infinite regular λ of M with a∈M[G≤λ] such that every subset of a in M[G] lies in M[G≤λ] and the power set P(a)M[G]=P(a)M[G≤λ] is an element of M[G≤λ]. In particular every subset of an ordinal λ of M that belongs to M[G] already belongs to a single set stage, and Power Set holds in M[G].

This supplies the Separation step that the source leaves to the reader, and it shows that no proper-class power set is needed: the head stage already carries the full power set of a ground-stage set.

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground, a definable Easton class function F, the class product P=P(F), an M-generic filter G, and a set a∈M[G].

[F1]

Stages, names, valuation and truth lemma: every element of M[G] is τG for a P≤λ-name τ∈M, stages are nested set-forcing extensions, and M[G]⊨φ(τ⃗G)⇔∃p∈G (p⊩φ(τ⃗)) with a definable class relation. (Set-stage names and the forcing truth lemma for the Easton class product)

[F2]

Uniform decisions: for a fixed formula, an ordinal μ≤λ and μ many ground tuples of head names, there is a tail condition t∈G>λ together with maximal antichains Wα⊆P≤λ and recorded decisions such that the truth value of each instance in M[G] is the value recorded at the unique qα∈Wα∩G≤λ; the decision data lies in M[G≤λ], and the attached witness names lie in one stage MP≤γ. (Uniform head-antichain decisions below a class tail)

[F3]

If a set-sized factor is λ+-closed and the other factor is λ+-cc, then every λ-sequence of ground-model elements in the product extension already lies in the extension by the cc factor. (A closed Easton tail adds no short sequences across its chain-condition head)

[F4]

The head P≤λ has the λ+-chain condition and the tail P>λ is λ+-closed; the middle factor P(λ,γ] of the factorization P≤γ≅P≤λ×P(λ,γ] is λ+-closed by the same union computation: for each regular support bound ρ>λ, a union of δ≤λ<ρ compatible supports of size below ρ has size at most δ⋅sup⁡ξ<δ∣Aξ∣<ρ. (Easton head chain condition and tail closure, The Easton-support product of higher Cohen forcings)

[F5]

For stages λ≤γ, P≤γ≅P≤λ×P(λ,γ] splits conditions by first coordinate into two set-sized factors, and M[G≤γ] is a transitive model of ZFC with the same ordinals as M and satisfies Choice. (The Easton-support product of higher Cohen forcings, ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders)

[F6]

The Axiom of Choice, hence every ground set is well-orderable and can be enumerated. (The Axiom of Choice)

Proof

1.1

Fix a=τG∈M[G] with τ∈MP≤λ0 for an infinite regular λ0 [F1]. Choose an infinite regular λ≥λ0 with μ:=∣dom⁡(τ)∣M<λ, possible because the ground has arbitrarily large regular cardinals, and enumerate dom⁡(τ)=⟨σα:α<μ⟩∈M using [F6]. Let I={α<μ:∃p∈G≤λ (⟨σα,p⟩∈τ)}. Since τ is a head name, the valuation clause of [F1] gives a={σα,G:α∈I}; the activity set I and a lie in M[G≤λ] by Separation and valuation there, and μ≤λ.

F1F5F6
2.1

Separation. Let ψ(x,ρ⃗) be a fixed formula with parameter names ρ⃗ naming elements of M[G]; enlarging λ if necessary, we may assume the parameters also lie in MP≤λ [F1]. Apply [F2] with the tuples (σα,ρ⃗), α<μ≤λ, to get t∈G>λ and maximal antichains Wα with decisions; the decision data lie in M[G≤λ]. For each α<μ let qα∈Wα∩G≤λ be the unique member met by the generic head, and let b={α∈I:the recorded decision at qα is positive}. The activity set I is in the head stage by step 1.1, and the decision data and the enumeration α↦σα,G are there too, so b⊆μ and {σα,G:α∈b} are sets of the ZFC head stage [F5]. By [F2] the recorded value is the truth value of ψ(σα,G,ρ⃗G) in M[G], and step 1.1 says the active α enumerate exactly a. Thus this set is {x∈a:M[G]⊨ψ(x,ρ⃗G)}, which proves Separation.

F1F2F5step 1.1
2.2

Power Set. Let b⊆a with b∈M[G]. Choose an infinite regular γ≥λ with b∈M[G≤γ] [F1] and define the membership code c(α)=1 if σα,G∈b and c(α)=0 otherwise, for α<μ; extend it to cˉ:λ→M by cˉ(α)=0 for μ≤α<λ and read cˉ as a function into {0,1}⊆M. Both c and cˉ lie in M[G≤γ] because b and the enumeration do. In the factorization P≤γ≅P≤λ×P(λ,γ] of [F5] the second factor is λ+-closed by [F4] and the first is λ+-cc by [F4], so [F3] gives cˉ∈M[G≤λ] and hence c∈M[G≤λ]. Therefore b={σα,G:c(α)=1} is a set of M[G≤λ] by Replacement there, again using [F5]. As b⊆a was arbitrary, every subset of a in M[G] lies in M[G≤λ]; since a∈M[G≤λ] by step 1.1 and M[G]⊇M[G≤λ], this says P(a)M[G]=P(a)M[G≤λ]∈M[G≤λ], which is Power Set for a.

F1F3F4F5step 1.1
3.1

Steps 2.1 and 2.2 prove Separation and the bounded power-set clause for the arbitrary a∈M[G]; applying the clause with a an ordinal of M gives the subset clause, and since every set has its M[G]-power set inside some stage, Power Set holds in M[G]. This is the statement. ∎

step 2.1step 2.2
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Replacement in the Easton class extension

Statement

Let (M,C) be a GBC + Global Choice + GCH ground, F a definable Easton class function with class product P=P(F) and G an M-generic filter (Class-theoretic ground assumptions for Easton forcing, Set-stage names and the forcing truth lemma for the Easton class product).

Then M[G] satisfies the Replacement scheme: for every fixed formula ψ(x,y,ρ⃗) and all set parameters ρ⃗G∈M[G], if M[G]⊨∀x∈a ∃!y ψ(x,y,ρ⃗G) for some a∈M[G], then the image {y:M[G]⊨∃x∈a ψ(x,y,ρ⃗G)} is a set of M[G]; indeed it is contained in the value of a ground set of witness names lying in one stage MP≤γ.

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground, a definable Easton class function F, the class product P=P(F), an M-generic filter G, a fixed formula ψ(x,y,ρ⃗), parameter names ρ⃗ and a set a=τG∈M[G].

[F1]

Stages, names, valuation, definable class forcing and truth lemma for M[G]=⋃λM[G≤λ]. (Set-stage names and the forcing truth lemma for the Easton class product)

[F2]

Uniform decisions with witnesses: applied to the formula ∃y ψ(x,y,ρ⃗) and the tuples (σα,ρ⃗) for a ground enumeration ⟨σα:α<μ⟩ of dom⁡(τ) with μ≤λ, there are t∈G>λ and maximal antichains Wα⊆P≤λ such that each cell carries a recorded truth value and, when positive, a ground set name ρα,q with t∪q⊩ψ(σα,ρα,q,ρ⃗); the truth values are computed in M[G≤λ] and all witness names lie in one stage MP≤γ. (Uniform head-antichain decisions below a class tail)

[F3]

Separation and the bounded power-set clause hold in M[G], and each M[G≤λ] is a transitive model of ZFC with the same ordinals as M containing the stages below it, satisfying Choice. (Separation and Power Set in the Easton class extension, ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders)

[F4]

The Axiom of Choice, so ground sets can be enumerated and images formed. (The Axiom of Choice)

Proof

1.1

Fix a=τG, choose an infinite regular λ above the stages of τ and ρ⃗ with μ:=∣dom⁡(τ)∣M<λ, and enumerate dom⁡(τ)=⟨σα:α<μ⟩∈M [F4]; then a⊆{σα,G:α<μ} and a,ρ⃗G∈M[G≤λ] by the valuation and stage clauses of [F1]. Assume M[G]⊨∀x∈a ∃!y ψ(x,y,ρ⃗G). This assertion concerns only the active values σα,G∈a; a name in dom⁡(τ) whose coefficient is not met by G may have a value outside a.

F1F4
1.2

Apply [F2] to the formula ∃y ψ(x,y,ρ⃗) and the tuples (σα,ρ⃗), obtaining t∈G>λ, maximal antichains Wα and, for every cell q∈Wα with a positive recorded value, a ground name ρα,q with t∪q⊩ψ(σα,ρα,q,ρ⃗). Put S={ρα,q:α<μ, q∈Wα, the value recorded at q is positive}, a ground set indexed by the set μ×⋃α<μWα [F3, F4]; by the last clause of [F2] there is an infinite regular γ with S⊆MP≤γ, and then {ρG:ρ∈S}={ρG≤γ:ρ∈S}∈M[G≤γ] by [F1].

F1F2F3F4
2.1

Every actual value lies in that image. Let x=σα,G∈a and let y be the unique element of M[G] with M[G]⊨ψ(x,y,ρ⃗G). The truth value of the existential instance was decided on the antichain Wα by the unique qα∈Wα∩G≤λ from [F2]. Its recorded value cannot be negative: then a condition of G extending t∪qα would force ¬∃y ψ(σα,y,ρ⃗), contradicting soundness in the actual extension and the existence of y. Hence the positive cell carries ρα,qα∈S and forces ψ(σα,ρα,qα,ρ⃗). Soundness gives M[G]⊨ψ(σα,G,ρα,qα,G,ρ⃗G), so uniqueness yields y=ρα,qα,G∈{ρG:ρ∈S}. Thus the image is a subset of this set and is itself a set of M[G] by Separation [F3].

F1F2F3step 1.2
3.1

Replacement follows since ψ, the parameters and a were arbitrary, and the proof shows in addition that the image is contained in the value of a ground set of witness names all of which lie in the single stage MP≤γ: this is the statement. ∎

step 1.2step 2.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

The Easton class-generic union satisfies ZFC

Statement

Let (M,C) be a GBC + Global Choice + GCH ground, F a definable Easton class function with class product P=P(F) and G an M-generic filter (Class-theoretic ground assumptions for Easton forcing, Set-stage names and the forcing truth lemma for the Easton class product).

Then M[G]=⋃λM[G≤λ] is a transitive model of ZFC containing M and having exactly the ordinals of M, the class forcing relation satisfies the truth lemma in it, and for every ordinal λ of M every subset of λ in M[G] belongs to a single set stage: there is an infinite regular γ with P(λ)M[G]=P(λ)M[G≤γ]∈M[G≤γ].

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground (M,C), a definable Easton class function F, the class product P=P(F) and an M-generic filter G.

[F1]

M[G]=⋃λM[G≤λ], the stages are nested, every element of M[G] is the value of a P-name, and the class forcing relation is definable and satisfies the truth lemma. (Set-stage names and the forcing truth lemma for the Easton class product)

[F2]

Separation, Power Set and the bounded power-set clause hold in M[G]. (Separation and Power Set in the Easton class extension)

[F3]

Replacement holds in M[G]. (Replacement in the Easton class extension)

[F4]

Each stage M[G≤λ] is, via the regular-open completion of the set forcing P≤λ, a transitive model of ZFC having exactly the ordinals of M and satisfying Choice, and G≤λ is its generic filter. (ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders, Forcing preserves ordinals)

[F5]

Every element of M is xˇG for its check name, and check names with the top condition of a head are head names. (Set-stage names and the forcing truth lemma for the Easton class product)

[F6]

The ground model satisfies the Axiom of Choice by hypothesis; each set-forcing stage satisfies Choice by [F4]. (The Axiom of Choice, ZFC and ordinal preservation for supplied transitive Boolean generic extensions)

Proof

1.1

Transitivity and ordinals. If u∈τG∈M[G], then u=σG for some pair ⟨σ,p⟩∈τ by the valuation clause of [F1], so u∈M[G] and M[G] is transitive; and every x∈M equals its check-name value in M[G] by [F5], so M⊆M[G]. Each stage has exactly the ordinals of M by [F4], and the stages are nested by [F1], so the ordinals of M[G] are exactly those of M.

F1F4F5
2.1

The easy axioms. Extensionality and Foundation are inherited from the ambient universe because M[G] is transitive and its membership relation is the true one; Infinity holds because ω∈M⊆M[G] by step 1.1. For Pairing and Union, given x1,…,xn∈M[G], choose by [F1] a single stage M[G≤λ] containing all of them, possible because the stages are nested and every element lies in some stage; then {x1,…,xn} and ⋃x1 are elements of that ZFC model by [F4] and hence of M[G]. Choice holds because each stage satisfies it by [F4] and [F6], so every element of M[G] carries a well-ordering in M[G], and the well-orderable sets of an extension form a model of Choice.

F1F4F6step 1.1
3.1

The hard axioms. Separation is [F2], Replacement is [F3], and Power Set with the bounded clause is [F2] as well; together with step 2.1 and step 1.1 this makes M[G] a transitive model of ZFC containing M with the same ordinals and the truth lemma of [F1]. Applying the bounded power-set clause of [F2] to the ordinal a=λ∈M⊆M[G] gives an infinite regular γ with P(λ)M[G]=P(λ)M[G≤γ]∈M[G≤γ], which is the last clause.

F1F2F3step 2.1
4.1

Steps 1.1, 2.1 and 3.1 establish every clause: M[G] is a transitive ZFC model containing M with the ordinals of M, carries the definable class forcing relation and its truth lemma, and has all subsets of any ground ordinal inside one set stage. This is the statement. ∎

step 1.1step 2.1step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Easton's theorem for regular cardinals

Statement

Let (M,C) be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), let F be a definable Easton class function defined on every infinite regular cardinal of M (Easton functions on regular cardinals), and let G be M-generic for the Easton class product P(F).

Then the generic union M[G] is a model of ZFC containing M, M[G] has the same ordinals, the same cardinals and the same cofinality function as M, and M[G]⊨2κ=F(κ) at every infinite regular cardinal κ of M. Consequently the three necessary conditions of Necessary constraints on the regular-cardinal continuum function, namely κ<2κ, monotonicity and cf⁡(2κ)>κ for infinite regular κ, are the only ZFC constraints on the values at regular cardinals in the corresponding relative-consistency construction: every Easton function on the regular cardinals of such a ground is realized by a class-generic extension.

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground (M,C), a definable Easton class function F defined on every infinite regular cardinal of M, the class product P=P(F) and an M-generic filter G.

[F1]

M[G]=⋃λM[G≤λ] is a transitive model of ZFC containing M with exactly the ordinals of M, the class forcing relation satisfies the truth lemma, and every element of M[G] is the value of a P≤λ-name for some infinite regular λ. (The Easton class-generic union satisfies ZFC, Set-stage names and the forcing truth lemma for the Easton class product)

[F2]

For every infinite regular λ, the head P≤λ is a set with the λ+-chain condition, the tail P>λ is λ+-closed, and P≤λ≅ the set-sized Easton product of the fibres with first coordinate ≤λ. (Easton head chain condition and tail closure)

[F3]

If a set-sized factor is λ+-closed and the other is λ+-cc, then every λ-sequence of ground-model elements in the product extension already lies in the extension by the cc factor. (A closed Easton tail adds no short sequences across its chain-condition head)

[F4]

If θ is a regular cardinal of M and a set forcing is θ-cc, then forcing with it preserves every ground-model cofinality ≥θ and every ground-model cardinal ≥θ. (Chain conditions preserve high cofinalities and ccc preserves cardinals)

[F5]

For a set-sized Easton function on a set of regular cardinals, forcing with its Easton product over a ZFC + GCH ground realizes 2κ=F(κ) at every regular κ of the domain and preserves cardinals and cofinalities. (Set-sized Easton realization on regular cardinals)

[F6]

In ZFC the continuum function at infinite regular cardinals satisfies κ<2κ, monotonicity and cf⁡(2κ)>κ. (Necessary constraints on the regular-cardinal continuum function)

[F7]

An Easton function has cardinal values, is nondecreasing, satisfies cf⁡(F(κ))>κ, and F(κ)>κ for every κ∈dom⁡(F), here the class of all infinite regular cardinals of M. (Easton functions on regular cardinals)

[F8]

GCH in the ground means 2ℵα=ℵα+1 for every ordinal α, and a countable transitive model of ZFC + V = L with its closure classes is an example of such a ground. (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1, Class-theoretic ground assumptions for Easton forcing)

Proof

1.1

By [F1] M[G]⊨ZFC and M⊆M[G] have the same ordinals; fix an infinite regular κ of M. The head P≤κ is a set-sized Easton product with the κ+-chain condition and the tail P>κ is κ+-closed [F2]. Any subset of κ in M[G] has a name in a set stage M[G≤γ] for some infinite regular γ≥κ [F1], and the factorization P≤γ≅P≤κ×P(κ,γ] has κ+-closed second factor and κ+-cc first factor, so [F3] puts the subset already in M[G≤κ]. The set-sized realization theorem gives 2κ=F(κ) in M[G≤κ] [F5]. Thus the full extension has the same set of subsets of κ as that head extension.

F1F2F3F5
1.2

Every ground regular cardinal remains regular in M[G]: suppose κ is infinite and regular in M but not in M[G], and let δ=cf⁡M[G](κ)<κ with a cofinal f:δ→κ in M[G]. Then δ is regular in M[G] and therefore in M, since otherwise a ground cofinal map of shorter length would persist into M[G]; so δ is an infinite regular cardinal of M with δ<κ. By [F1] the function f lies in some stage M[G≤γ] with γ≥δ, and the factorization P≤γ≅P≤δ×P(δ,γ] has δ+-closed second factor and δ+-cc first factor [F2], so [F3] gives f∈M[G≤δ] and hence cf⁡M[G≤δ](κ)≤δ; but [F4] at θ=δ+≤κ gives cf⁡M[G≤δ](κ)=cf⁡M(κ)=κ>δ, a contradiction.

F1F2F3F4F9
2.1

Every ground cardinal remains a cardinal of M[G]: suppose κ is the least ground cardinal with ∣κ∣M[G]=μ<κ. By step 1.2, κ cannot be regular in M, since an ordinal that remains regular in the ZFC extension is a cardinal there. Thus κ is a singular ground cardinal, hence a limit cardinal; the ground cardinals below κ are cofinal in κ. Choose a ground cardinal ν with μ<ν<κ. Minimality of κ makes ν a cardinal in M[G], whereas a bijection κ→μ in M[G] restricts to an injection ν→μ, a contradiction. Hence all ground cardinals remain cardinals.

F1F9step 1.2
2.2

All ground cofinalities are preserved. Let κ=cf⁡M(δ) for an ordinal δ of M and fix a strictly increasing cofinal g:κ→δ in M; then cf⁡M[G](δ)≤κ because g is still cofinal in M[G]. If η=cf⁡M[G](δ)<κ, take a cofinal h:η→δ in M[G] and define h′:η→κ in M[G] by letting h′(ξ) be the least β<κ with h(ξ)≤g(β); then h′ is cofinal in κ, because for any β0<κ cofinality of h gives ξ<η with h(ξ)≥g(β0), hence g(h′(ξ))≥h(ξ)≥g(β0) and h′(ξ)≥β0 by strict increase of g. So cf⁡M[G](κ)≤η<κ, contradicting step 1.2 because κ is regular in M; therefore cf⁡M[G](δ)=cf⁡M(δ).

F9step 1.2
3.1

By step 1.1 the full extension and the head extension have the same subsets of each regular κ, and by step 2.1 F(κ) remains a cardinal; hence (2κ)M[G]=F(κ). Steps 2.1 and 2.2 therefore give a ZFC model M[G]⊇M with the ordinals, cardinals and cofinalities of M and with 2κ=F(κ) at every infinite regular cardinal; for the final clause, if F satisfies the three necessary conditions of [F6] then F is an Easton function in the sense of [F7] and the construction above realizes it, while conversely those necessary conditions must hold of 2κ by [F6]; the relative-consistency reading is the one of [F8]: a constructible GCH ground with its closure classes supplies the ground, so no more than the necessary conditions is required. This is the statement. ∎

step 1.1step 2.1step 2.2
RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Easton's theorem does not prescribe singular-cardinal powers

Remark

Easton's realization theorem (Easton's theorem for regular cardinals) is a statement about the continuum function at regular cardinals: its conditions κ<2κ, monotonicity and cf⁡(2κ)>κ (Necessary constraints on the regular-cardinal continuum function) are exactly the constraints that the construction can meet there. It makes no assignment of 2κ for singular κ and gives no licence to read one off from a prescribed behaviour on regular cardinals.

At a singular cardinal κ the same general constraints remain in force for the value: monotonicity gives 2κ≥2μ for every μ<κ, Cantor's theorem gives κ<2κ, and König's theorem gives cf⁡(2κ)>κ (Necessary constraints on the regular-cardinal continuum function, Assuming the Axiom of Choice: κ<κcf⁡(κ) for every infinite cardinal κ, and cf⁡(2κ)>κ; in particular cf⁡(2ℵ0)>ℵ0). In the GCH case 2<κ=κ, so Cantor's strict inequality gives 2κ≥(2<κ)+. The values at singular cardinals are governed by further theorems not proved on this page, and the page states nothing about them: in particular it does not claim that an arbitrary prescription on regular cardinals extends to a singular cardinal, and it does not claim the Singular Cardinal Hypothesis or its failure.

The Easton function of Easton functions on regular cardinals is therefore used only on its class of infinite regular cardinals, and the class-generic construction of Easton's theorem for regular cardinals is only asserted to realize the prescription there.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Almost inclusion, pseudointersections and towers

Definition

The definitions in this item work in ZF. As usual N=ω is the set of von Neumann naturals (The natural numbers N (von Neumann)), a set A is finite when A≈n for some n∈N, and A is infinite when it is not finite (Finite, countably infinite, countable, uncountable, The cardinality ∣A∣ of a finite set). An infinite A⊆ω has ∣A∣=ℵ0, but nothing below uses that. Write

[ω]ω:={A⊆ω:A is infinite}

for the set of infinite subsets of ω; it is a set by Separation (The power set P(x)={ z:z⊆x }) and it is nonempty, for instance ω∈[ω]ω. No cardinal comparison is needed to define the notions below.

Almost inclusion. For A,B⊆ω write

A⊆∗B:⟺A∖B is finite,

and say that A is almost contained in B. Here A∖B is the set difference (The difference a∖b, the symmetric difference a△b, and the complement X∖a relative to a set X) and finiteness is the notion of Finite, countably infinite, countable, uncountable. Thus A⊆∗B holds exactly when A⊆B∪F for some finite F⊆ω. Two sets are almost equal, written A=∗B, when A⊆∗B and B⊆∗A; equivalently when the symmetric difference A△B is finite.

Pseudointersections. Let F⊆[ω]ω. A set X∈[ω]ω is a pseudointersection of F when X⊆∗A for every A∈F. The family F has the strong finite intersection property (SFIP) when A0∩A1∩⋯∩An−1 is infinite for every n∈N and all A0,…,An−1∈F. Every finite subfamily of an SFIP family has infinite intersection, and a finite family of infinite sets has the SFIP exactly when its total intersection is infinite.

Towers. A tower is a family ⟨Aα:α<κ⟩, indexed by an ordinal κ, of infinite subsets of ω such that

Aβ⊇∗Aαwhenever β<α<κ,

that is, the family is decreasing in the almost-inclusion order ⊇∗, and such that the family {Aα:α<κ} has no pseudointersection.

Removing repetitions. Call α<κ new when Aα≠∗Aβ for every β<α, let K⊆κ be the set of new indices, let θ be the order type of K and list K increasingly as ⟨αι:ι<θ⟩, and put Bι=Aαι. Then:

  • ⟨Bι:ι<θ⟩ is decreasing up to almost equality, and it is strictly decreasing: if ι<η<θ, then αι<αη and αη∈K, so Bη≠∗Bι;
  • every member of the original family is almost equal to some Bι: if γ<κ and α is the least β≤γ with Aβ=∗Aγ, then α∈K, since δ<α with Aδ=∗Aα would give Aδ=∗Aγ and contradict the minimality of α;
  • consequently a pseudointersection of the Bι is almost contained in every Aγ, hence is a pseudointersection of the original family, and therefore the Bι have none and ⟨Bι:ι<θ⟩ is itself a tower.

So every tower contains a strictly decreasing tower of order type θ≤κ. The map ι↦[Bι] injects θ into P(ω)/fin. For the following cardinal comparison assume AC (The Axiom of Choice): choose one representative from each almost-equality class to inject the quotient into P(ω), which has cardinality 2ℵ0 by The continuum is equinumerous with the power set of the naturals. Hence ∣θ∣≤∣P(ω)/fin∣≤2ℵ0. This does not assert θ≤2ℵ0 as ordinals: an ordinal may be longer than its initial cardinal.

There is a second normalization that preserves the lack of a pseudointersection. If C⊆κ is cofinal, meaning that for every β<κ some α∈C satisfies β≤α, restrict the tower to the indices in C in increasing order. An infinite set almost contained in every selected Aα would also be almost contained in every original Aβ: choose such an α≥β and use Aα⊆∗Aβ. Thus the restricted sequence is again a tower, with length the order type of C, which need not equal its cardinality. Removing repetitions also leaves unchanged the family of sets almost contained in every member.

The quotient P(ω)/fin and its forcing order. Almost equality is an equivalence relation on P(ω), and the quotient P(ω)/fin is the Boolean algebra of subsets of ω modulo finite symmetric difference; the class of an infinite set is called positive, and every positive class contains an infinite subset of ω, namely any of its members. The associated forcing order is the relation

p is stronger than q:⟺p⊆∗q(p,q∈[ω]ω),

which is reflexive and transitive on [ω]ω and is well defined on almost-equality classes: if p=∗p′ and q=∗q′ then p⊆∗q exactly when p′⊆∗q′. Thus smaller infinite sets are stronger conditions, and the relation displayed by some sources as the weaker-than order, p⊇∗q, is this same order read in the reverse direction; the order is a partial order on classes (Partial order and partially ordered set) and not a partial order on the sets themselves, where p⊆∗q⊆∗p holds for distinct but almost equal sets.

Conventions for this page. In the items below, when a family is written ⟨Aα:α<κ⟩ together with the assertion that it is decreasing, the assertion is always that Aβ⊇∗Aα for β<α, as above. An uncountable family is displayed by an ordinal enumeration; no well-order of a general family is presupposed unless the item says so.

Remarks

The negation of A⊆∗B says that A∖B is infinite, and for infinite A this is not the same as B⊆∗A: the disjoint sets A= the even numbers and B= the odd numbers satisfy A̸⊆∗B and B̸⊆∗A. The almost-inclusion order is therefore genuinely different from inclusion, and the distinction is exactly what the diagonal constructions below exploit.

Monk states the relation ⊆∗ and the pseudointersection property at the opening of his notes and introduces towers as decreasing families with no pseudointersection when he defines the tower number; Malliaris and Shelah present P(ω)/fin with the reverse (weaker-than) convention. A condition is a positive class; in the stronger-than convention fixed above, strengthening passes to an almost subset. Reversing the symbol used to display the order does not reverse which conditions are stronger. The conventions fixed above are the ones used on this page; no mathematical content depends on which of the two display conventions is chosen.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

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
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-sol)audited 2026-09-27Open item page →

The pseudointersection and tower numbers

Definition

In ZFC, with [ω]ω, the strong finite intersection property, ⊆∗ and towers as in Almost inclusion, pseudointersections and towers, define:

The pseudointersection number. p is the least cardinality ∣F∣ of a family F⊆[ω]ω that has the strong finite intersection property and has no pseudointersection. The collection of candidate cardinalities is nonempty: by A tower of size at most the continuum exists there is a tower, and a tower is a family with the strong finite intersection property, because a finite intersection Aβ0∩⋯∩Aβn with β0<⋯<βn contains Aβn minus the union of the finitely many finite sets Aβn∖Aβi, and Aβn is infinite. The collection is a set of ordinals bounded by the cardinality of [ω]ω, and each of its members is a cardinal (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used), so the Axiom of Choice, which well-orders every subset of [ω]ω (The Axiom of Choice, The well-ordering theorem) and makes cardinality available, gives p as the least element of that set; the minimum is attained, so there is an SFIP family of size p with no pseudointersection.

The tower number. t is the least ordinal λ for which there is a tower of length λ, that is, a tower ⟨Aα:α<λ⟩. By A tower of size at most the continuum exists there is such a tower of some length λ0≤c; take the least member of the set of qualifying ordinals λ≤λ0. Thus t exists, is attained and satisfies t≤c. No assertion that every possible tower length is at most c is needed.

A shortest tower has cardinal length. The empty sequence is not a tower: ω is its pseudointersection. Nor can a tower have successor length β+1, because its last member Aβ is almost contained in every earlier member and is itself an infinite pseudointersection. Hence t is a limit ordinal. Put ρ=cf⁡(t) (Cofinality cf⁡(α), and regular and singular cardinals). There is a strictly increasing cofinal map f:ρ→t (For every ordinal α there is a least ordinal β admitting a map β→α with cofinal range, and that map may always be taken strictly increasing). Restrict a tower of length t to the indices f[ρ]: by the cofinal-subsequence argument in Almost inclusion, pseudointersections and towers, this remains a tower and has length exactly ρ. Minimality gives t≤ρ, while ρ≤t by cf⁡(α)≤α; cf⁡(0)=0 and cf⁡(α+1)=1; for a limit ordinal λ the value cf⁡(λ) is an infinite cardinal with cf⁡(cf⁡(λ))=cf⁡(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf⁡(λ), a value that is attained, so t=cf⁡(t). Since the cofinality of a limit ordinal is an infinite cardinal by that theorem, t is in fact a regular infinite cardinal.

Normal form of a shortest tower. Removing repetitions as in Almost inclusion, pseudointersections and towers replaces a tower of length λ by a strictly decreasing tower of order type θ≤λ; only its cardinality is bounded by the number of almost-equality classes. Applied to λ=t, minimality gives θ=t, so:

  • there is a tower ⟨Aα:α<t⟩ that is strictly decreasing, that is, Aβ⊇∗Aα and Aα≠∗Aβ whenever β<α<t;
  • t≤2ℵ0=c, by the existence construction above;
  • t is a regular cardinal, by the cofinal-subsequence argument above.

Equivalently, t is the least number of distinct members in a tower. The strictly decreasing tower of length t has exactly t members. Conversely, if a tower has member set S, removal of repeats gives a tower of order type θ with ∣θ∣≤∣S∣. Minimality gives t≤θ as ordinals; because t is an initial cardinal, this implies t≤∣θ∣≤∣S∣ as cardinals. Thus no tower has fewer than t distinct members.

Convention. When using a shortest tower below, take the strictly decreasing normal form; its length and the size of its member set both equal t. Monk states the pseudointersection number as p=min⁡{∣F∣:F⊆[ω]ω has SFIP and no pseudo-intersection} and the tower number as the smallest ordinal that is the length of a tower; Malliaris and Shelah work with the forcing P(ω)/fin, where these same numbers are the standard cardinal characteristics of the almost-inclusion order.

Remarks

The two definitions are not symmetric in the choice they consume. The minimum defining p is a least cardinality of a set; AC makes cardinalities available for its candidate families. Once one tower has been constructed in ZFC, finding the least tower length among ordinals below that witness needs no additional choice. The cofinal-subsequence and repetition arguments establish that this least ordinal is the cardinal invariant used in the bounds below.

The inequality p≤t is immediate from the two definitions and is proved with the remaining bounds in Basic bounds for p and t: a tower is an SFIP family with no pseudointersection, so the least size of such a family is at most the length of any tower, in particular at most t.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Basic bounds for p and t

Statement

In ZFC, with p and t as in The pseudointersection and tower numbers,

ℵ1≤p≤t≤c=2ℵ0,

and moreover every countable family of infinite subsets of ω with the strong finite intersection property has a pseudointersection, and every countable descending family ⟨An:n∈ω⟩ of infinite subsets of ω has a pseudointersection (Almost inclusion, pseudointersections and towers for the notions).

The countable case is the diagonal construction: the running finite intersections are infinite, and choosing the least new element of each running intersection produces an infinite set meeting every member cofinitely. That gives p≥ℵ1 and t≥ℵ1; a tower is an SFIP family with no pseudointersection, which gives p≤t; and t≤c is the normal form of a shortest tower.

Facts & Assumptions

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

[F1]

A pseudointersection of F⊆[ω]ω is an X∈[ω]ω with X⊆∗A for all A∈F; F has SFIP when every finite intersection of members is infinite; a tower is a decreasing family ⟨Aα:α<κ⟩ of infinite sets with no pseudointersection. (Almost inclusion, pseudointersections and towers)

[F2]

p is the least cardinality of an SFIP family with no pseudointersection, and the minimum is attained; t is the least length of a tower, the minimum is attained by a strictly decreasing tower ⟨Aα:α<t⟩, and t is a cardinal with t≤2ℵ0=c. (The pseudointersection and tower numbers)

[F3]

Every nonempty subset of N has a least element, and recursion on N defines the unique sequence with prescribed value at 0 and prescribed successor step. (The well-ordering principle, The recursion theorem, The natural numbers N (von Neumann))

Proof

1.1

Let ⟨Cn:n∈N⟩ be a sequence of infinite subsets of ω all of whose finite intersections are infinite, and set Bn=C0∩⋯∩Cn; then each Bn is infinite, and B0⊇B1⊇⋯.

F3F1
1.2

p≤t: by [F2] there is a strictly decreasing tower ⟨Aα:α<t⟩; its member family F has cardinality t, since α↦Aα is injective. The family has SFIP: for β0<⋯<βn<t the intersection contains Aβn minus the finitely many finite sets Aβn∖Aβi. It has no pseudointersection, because it is a tower. Hence some SFIP family without pseudointersection has size t, and p≤t.

F1F2
2.1

Recursively choose xn to be the least element of Bn∖{x0,…,xn−1}; this is legitimate because Bn is infinite and only finitely many elements have been removed, so the set is nonempty, and it has a least element by [F3]. Then xn∈Bn and the xn are pairwise distinct, since xn∉{x0,…,xn−1}.

F1F3step 1.1
3.1

X={xn:n∈N} is infinite by step 2.1, and X⊆∗Ck for every k: indeed xn∈Bn⊆Ck whenever n≥k, so X∖Ck⊆{x0,…,xk−1} is finite. Hence X is a pseudointersection of {Cn:n∈N}.

F1step 2.1
4.1

Now let F⊆[ω]ω be countable and have the strong finite intersection property. If F=∅, then ω is a pseudointersection and the claim follows. Otherwise list F as a sequence ⟨An:n∈N⟩, repeating one member if F is finite; that is possible by [F3] and [F4], and the finite intersections of the An are still infinite. Put Bn=A0∩⋯∩An; each Bn is infinite by SFIP, and the sequence ⟨Bn⟩ has all finite intersections infinite, since B0∩⋯∩Bm=Bm. By steps 1.1, 2.1 and 3.1 applied to Cn:=Bn there is X∈[ω]ω with X⊆∗Bn for every n.

F1F3F4step 3.1
4.2

Every countable descending family ⟨An:n∈N⟩ of infinite sets has a pseudointersection: reaching An from earlier members removes only finitely many points, so Bn=A0∩⋯∩An satisfies An∖Bn⊆⋃i<n(An∖Ai), a finite set, and Bn is infinite because An is; the family {Bn:n∈N} therefore consists of infinite sets with all finite intersections infinite, and steps 1.1, 2.1 and 3.1 applied to it give X∈[ω]ω with X⊆∗Bn⊆An for every n.

F1step 3.1
5.1

For each n the pseudointersection X of step 4.1 is almost contained in Bn⊆An, hence F has a pseudointersection.

F1step 4.1
5.2

t≥ℵ1: a tower of length ℵ0 would be a countable descending family of infinite sets, so by step 4.2 it would have a pseudointersection, which a tower cannot have. Since t is a cardinal, t≠ℵ0 is excluded, so t≥ℵ1.

F1F2step 4.2
6.1

ℵ1≤p: if F has size below ℵ1, then F is finite or countably infinite and, when nonempty, can be listed as a sequence with repetitions if finite; if F has SFIP then step 5.1 supplies a pseudointersection. Hence no family of size below ℵ1 has SFIP and lacks a pseudointersection, and since p is a cardinal with an attained minimum, p≥ℵ1.

F2F4step 5.1
7.1

t≤c is clause [F2]. Combining steps 6.1, 1.2, 5.2 and 7.1 gives ℵ1≤p≤t≤c=2ℵ0, and steps 5.1 and 4.2 are the two countable pseudointersection assertions. This is the statement. ∎

F2step 5.1step 4.2step 6.1step 1.2step 5.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Eventual domination and the numbers b and d

Definition

Work in ZFC. Write ωω for the set of functions ω→ω (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations), ordered pointwise; a function is thus a sequence of natural numbers (The natural numbers N (von Neumann)). For f,g∈ωω put

f≤∗g:⟺f(n)≤g(n) for all but finitely many n∈ω,

and say that g eventually dominates f. The relation ≤∗ is reflexive and transitive. A family B⊆ωω is

  • ≤∗-unbounded when there is no single g∈ωω with f≤∗g for every f∈B;
  • ≤∗-dominating (equivalently ≤∗-cofinal) when for every f∈ωω there is g∈B with f≤∗g.

The bounding number. b is the least cardinality of a ≤∗-unbounded family B⊆ωω.

The dominating number. d is the least cardinality of a ≤∗-dominating family D⊆ωω.

Both minima exist and are cardinals. The collection of candidate cardinalities for b is the image under X↦∣X∣ of a subset of the power set of ωω, hence is a set of ordinals by Replacement, and it is nonempty because ωω itself is ≤∗-unbounded: given any g, the function n↦g(n)+1 lies in ωω and is not ≤∗-below g. The same argument shows the candidates for d form a nonempty set of ordinals, because ωω is ≤∗-dominating, each f being dominated by itself. A nonempty set of ordinals has a least element, and that element is a cardinal by A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used; the Axiom of Choice (The Axiom of Choice) is what makes the cardinalities ∣X∣ available. Thus

b=min⁡{∣B∣:B⊆ωω is ≤∗-unbounded},d=min⁡{∣D∣:D⊆ωω is ≤∗-dominating},

and the minima are attained, so there are an unbounded family of size b and a dominating family of size d.

Conventions. The order on ωω is the eventual one above; pointwise domination of a finite family is computed by pointwise maxima, which is the observation behind the elementary bounds proved in Basic bounding and dominating relations. Some sources write f<∗g for "eventually strictly below" and define b and d with ≤∗; the two readings give the same numbers, since replacing g by n↦g(n)+1 turns ≤∗-domination into <∗-domination. Monk and Bartoszyński use exactly the definitions above, with c=2ℵ0 as the largest candidate size.

Remarks

The set ωω has cardinality c under AC, and ≤∗ depends only on the eventual behaviour of a function; both facts are used in Basic bounding and dominating relations, where the chain ℵ1≤b=cf⁡(b)≤cf⁡(d)≤d≤c is proved. Nothing in the definition requires that a dominating or unbounded family be closed under finite modifications: both properties are preserved when the family is enlarged, and replacing each member f by its running maximum n↦max⁡m≤nf(m) preserves both properties, since f≤∗g implies f≤∗gmax⁡ and f≤fmax⁡ pointwise. A dominating or unbounded family may therefore be assumed to consist of nondecreasing functions.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Basic bounding and dominating relations

Statement

In ZFC, with b and d the bounding and dominating numbers (Eventual domination and the numbers b and d) and cf⁡ the cofinality function (Cofinality cf⁡(α), and regular and singular cardinals),

ℵ1≤b=cf⁡(b)≤cf⁡(d)≤d≤c=2ℵ0.

The right-hand bound is the observation that ωω is a dominating family and has size c; the left-hand bounds are the countable pointwise-maximum argument; b=cf⁡(b) is the standard singular-cardinal contradiction; and b≤cf⁡(d) partitions a dominating family of size d along a cofinal sequence of length cf⁡(d) and diagonalizes against the non-dominating pieces.

Facts & Assumptions

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

[F1]

f≤∗g means that f(n)≤g(n) for all but finitely many n; B is ≤∗-unbounded when no single g lies ≤∗-above every member, D is ≤∗-dominating when every f lies ≤∗-below some member, and b,d are the least cardinalities of such families, the minima being attained. (Eventual domination and the numbers b and d)

[F5]

≤ is a linear order on N, so every nonempty finite subset of N has a greatest element, and recursion on N defines sequences with prescribed initial value and successor step. (≤ is a linear order on N, Order on the natural numbers, The recursion theorem, The natural numbers N (von Neumann))

Proof

1.1

Every countable family is bounded: given ⟨fn:n∈N⟩ in ωω, define g(n) as the greatest element of the finite nonempty set {f0(n),…,fn(n)}, which exists by [F5]; then for each i and every n≥i one has fi(n)≤g(n), so fi≤∗g. Hence no family of size at most ℵ0 is ≤∗-unbounded, and since b is a cardinal that is the least size of an unbounded family, b>ℵ0, that is, ℵ1≤b.

F1F5
1.2

No countable family is dominating: the empty family is not dominating, and any nonempty finite or countably infinite family can be listed as D={hi:i∈ω}, repeating entries if necessary. Set q(n)=1+max⁡{hi(n):i≤n}, so for each i one has q(n)>hi(n) whenever n≥i. Thus d≥ℵ1. An infinite cardinal is a limit ordinal, and [F2] gives cf⁡(d)≤d.

F1F2F3F5
1.3

d≤c: the map f↦{(n,f(n)):n∈N} injects ωω into P(ω×ω), so by [F4] ∣ωω∣≤2∣ω×ω∣=2ℵ0⊗ℵ0=2ℵ0=c; and ωω is ≤∗-dominating, since f≤∗f for every f. Hence some dominating family has size at most c, and d≤c.

F1F4
1.4

b=cf⁡(b): by [F2] cf⁡(b)≤b, so suppose cf⁡(b)<b. By [F1] fix an unbounded family {fξ:ξ<b} of size b, and by [F2] fix a strictly increasing cofinal map α↦bα from λ:=cf⁡(b) into b. For each α<λ the subfamily Bα={fξ:ξ<bα} has cardinality at most bα<b, so by the minimality in [F1] it is bounded: choose gα with fξ≤∗gα for every ξ<bα (the choices are made by [F3]). The family {gα:α<λ} has size at most λ=cf⁡(b)<b, so it too is bounded; fix h with gα≤∗h for every α<λ. Every ξ<b satisfies ξ<bα for some α<λ, because the map is cofinal, so fξ≤∗gα≤∗h and h bounds the allegedly unbounded family, a contradiction. Hence cf⁡(b)=b and b is regular.

F1F2F3
1.5

b≤cf⁡(d): let D={hξ:ξ<d} be a dominating family of size d by [F1], put λ=cf⁡(d), and fix a strictly increasing cofinal map α↦dα from λ into d by [F2]. For α<λ put Dα={hξ:ξ<dα}; then ∣Dα∣≤dα<d, the sets Dα increase with α, and ⋃α<λDα=D. No Dα is dominating, since d is the least size of a dominating family, so by [F3] choose fα∈ωω not dominated by any member of Dα. The family {fα:α<λ} is unbounded: if some g satisfied fα≤∗g for every α, then by domination some h∈D satisfies g≤∗h, and h∈Dα for some α, so fα≤∗g≤∗h contradicts the choice of fα. Therefore b≤∣{fα:α<λ}∣≤λ=cf⁡(d).

F1F2F3
2.1

Steps 1.1, 1.2, 1.4 and 1.5 give ℵ1≤b=cf⁡(b)≤cf⁡(d)≤d, and step 1.3 adds d≤c=2ℵ0; together these are the displayed chain. This is the statement. ∎

step 1.1step 1.2step 1.3step 1.4step 1.5
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-sol)audited 2026-09-27Open item page →

The splitting and reaping numbers

Definition

In ZFC, with [ω]ω the infinite subsets of ω (Almost inclusion, pseudointersections and towers) and c=2ℵ0 (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations):

Splitting. For X,Y⊆ω, say that X splits Y when both Y∩X and Y∖X are infinite. A family S⊆[ω]ω is a splitting family when every Y∈[ω]ω is split by some member of S. The splitting number is

s:=min⁡{∣S∣:S⊆[ω]ω is a splitting family}.

Reaping. A family R⊆[ω]ω is unreaped when no single set X⊆ω splits every member of R; the negation, "R is reaped by X", thus means that X splits each Y∈R. The reaping number is

r:=min⁡{∣R∣:R⊆[ω]ω is unreaped}.

Both minima exist and are cardinals. Candidates for s are subsets of [ω]ω, and the minimum is attained: [ω]ω itself is a splitting family, since Y∈[ω]ω has an increasing enumeration y0<y1<⋯ and the even part {y2n:n∈N} is an infinite subset of Y whose complement in Y is the infinite set of odd-indexed elements. Candidates for r are again subsets of [ω]ω, and [ω]ω itself is unreaped: given X⊆ω, either ω∖X is infinite, in which case the member ω∖X of [ω]ω meets X in the empty set and so is not split by X, or ω∖X is finite, in which case the member X of [ω]ω satisfies X∖X=∅ and so is not split by X either. In both cases some member of [ω]ω is not split by X, so r≤∣[ω]ω∣≤c and s≤c; the cardinalities come from the Axiom of Choice (The Axiom of Choice, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used).

Conventions. Splitting is asymmetric: X splits Y is a statement about Y's two parts, and it implies Y is infinite but imposes no infinitude condition on X beyond Y∩X being infinite; splitting families are, however, customarily taken inside [ω]ω, as above. The comparison of s and r with b, d and c is Splitting and reaping comparisons with b and d; the elementary lower bounds ℵ1≤s and ℵ1≤b≤r are proved there, and the upper bounds are the ones just displayed.

Remarks

Monk attributes the splitting number and the diagonal lower bound ω<s to Blass, and the inequality b≤r is his Proposition 27; the reaping number is the least size of a family that no single set splits, which is the formulation used consistently below. The names come from the dual picture: R is unreaped by X when X fails to split some member, so in a reaping family every candidate splitter fails on at least one member.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Splitting and reaping comparisons with b and d

Statement

In ZFC, with s the splitting number, r the reaping number (The splitting and reaping numbers) and b,d the bounding and dominating numbers (Eventual domination and the numbers b and d),

ℵ1≤s≤d≤c,ℵ1≤b≤r≤c.

The proof carries the interval-partition machinery internally: an interval partition is a strictly increasing enumeration of the cuts of a partition of ω into finite intervals; a partition Q almost dominates a partition P when every sufficiently late block of Q contains a whole block of P; φ(P) is the union of the even blocks of P and ψ(X) is the partition whose blocks each meet X minimally. The two coding lemmas are that func⁡P≤∗g implies part⁡g almost dominates P and that P almost dominating part⁡g implies g≤∗func⁡P; the splitter lemma is that P almost dominating ψ(X) forces φ(P) to split X. The countable lower bound for s is the classical two-sided diagonalization against a countable family of candidate splitters, and b≤r applies the splitter lemma contrapositively to an unreaped family of size r.

Facts & Assumptions

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

[F1]

X splits Y when Y∩X and Y∖X are both infinite; a splitting family is a family in [ω]ω meeting every Y∈[ω]ω in some member that splits Y, and s is its least size; a family is unreaped when no single set splits all its members, and r is the least size of an unreaped family; both minima are attained and s,r≤c. (The splitting and reaping numbers)

[F2]

f≤∗g means f(n)≤g(n) eventually; b is the least size of a ≤∗-unbounded family and d the least size of a ≤∗-dominating family, both attained. (Eventual domination and the numbers b and d)

[F3]

ℵ1≤b≤d≤c; in particular every family of fewer than b functions is eventually dominated by a single function, and every ≤∗-dominating family has size at least d. (Basic bounding and dominating relations, Eventual domination and the numbers b and d)

[F5]

Every nonempty subset of N has a least element, ≤ is a linear order on N so every nonempty finite set of naturals has a greatest element, and recursion on N defines sequences with prescribed initial value and successor step. (The well-ordering principle, ≤ is a linear order on N, Order on the natural numbers, The recursion theorem, The natural numbers N (von Neumann))

Proof

1.1

Interval partitions. Call P=(inP)n∈N a partition when i0P=0 and inP<in+1P for all n; it is identified with the partition of ω into the finite intervals [inP,in+1P)={m:inP≤m<in+1P}. For partitions P,Q say that Q almost dominates P when

∃m ∀n≥m ∃k[ikP,ik+1P)⊆[inQ,in+1Q).

Every inP is a natural number and the intervals cover ω, so the notation is well founded. [F5]

1.2

The functions func⁡P and the partition part⁡g. For a partition P and x∈ω let func⁡P(x)=in+2P−1, where n is the unique index with x∈[inP,in+1P), so that func⁡P∈ωω. For g∈ωω define Q=part⁡g by i0Q=0 and, given ikQ, let ik+1Q be the least j>ikQ such that g(x)<j for every x≤ikQ; the finite set {g(0),…,g(ikQ)} has a greatest element m by [F5], and j=max⁡{ikQ,m}+1 qualifies. Then Q is a partition, and its defining property is

x≤ikQ ⟹ g(x)<ik+1Q.

[F5, step 1.1]

1.3

Countable lower bound for s. Let {Yi:i∈N}⊆[ω]ω be a countable family; we construct Z∈[ω]ω that no Yi splits. Write Yi0=Yi and Yi1=ω∖Yi. Recursively choose ε(i)∈{0,1} so that Ci:=⋂j≤iYjε(j) is infinite: at stage i=0, one of Y0 and its complement is infinite; at each later stage, the infinite set Ci−1 is the union (Ci−1∩Yi)∪(Ci−1∩Yi1), so at least one part is infinite. After choosing Ci, let mi be its least element outside the finite set {m0,…,mi−1}. Then the mi are pairwise distinct and Z={mi:i∈N}∈[ω]ω. For fixed i and every j≥i one has mj∈Cj⊆Yiε(i), so Z∖Yiε(i)⊆{m0,…,mi−1} is finite. If ε(i)=0, then Z∖Yi is finite; if ε(i)=1, then Z∩Yi is finite. In neither case are both Z∩Yi and Z∖Yi infinite, so Yi does not split Z. Thus no countable family is a splitting family, and since s is a cardinal, ℵ1≤s.

F1F4F5
2.1

The partition ψ(X) of a set. For X∈[ω]ω define Q=ψ(X) by i0Q=0 and, given inQ, let in+1Q be the least j>inQ with [inQ,j)∩X≠∅. Such a j exists because X is infinite, so there is x∈X with x≥inQ, and j=max⁡{inQ,x}+1 qualifies; the least one is determined by [F5]. Then Q is a partition and by construction [inQ,in+1Q)∩X≠∅ for every n.

F5step 1.1
2.2

The even-block set φ(P). For a partition P put φ(P)=⋃n∈N[i2nP,i2n+1P). Each interval [i2nP,i2n+1P) is nonempty because i2nP<i2n+1P, these intervals are pairwise disjoint, and they are infinitely many, so φ(P)∈[ω]ω.

F5step 1.1
2.3

First coding lemma. If P is a partition, g∈ωω and func⁡P≤∗g, then part⁡g almost dominates P. Let Q=part⁡g and choose p with func⁡P(n)≤g(n) for all n≥p. Given n≥p, choose k with inQ∈[ikP,ik+1P) and let x∈[ik+1P,ik+2P); then p≤n≤inQ<ik+1P≤x≤ik+2P−1=func⁡P(inQ)≤g(inQ)<in+1Q, using the defining property of part⁡g at x=inQ≤inQ. Hence [ik+1P,ik+2P)⊆[inQ,in+1Q), and n≥p was arbitrary, so Q almost dominates P.

F5step 1.2
2.4

Second coding lemma. If P is a partition, g∈ωω and P almost dominates part⁡g, then g≤∗func⁡P. Let Q=part⁡g and choose m so that for every n≥m there is k with [ikQ,ik+1Q)⊆[inP,in+1P). Let x≥imP and let n be the index with x∈[inP,in+1P), so n≥m and hence also n+1≥m. Choose k with [ikQ,ik+1Q)⊆[in+1P,in+2P); then x<in+1P≤ikQ, so g(x)<ik+1Q≤in+2P, that is g(x)≤in+2P−1=func⁡P(x). Hence g≤∗func⁡P.

F5step 1.2
3.1

Splitter lemma. If a partition P almost dominates ψ(X) for some X∈[ω]ω, then φ(P) splits X. Let Q=ψ(X) and choose m so that for all n≥m there is k with [ikQ,ik+1Q)⊆[inP,in+1P). Since every block of Q meets X by step 2.1, X∩[inP,in+1P)≠∅ for every n≥m. The intervals [inP,in+1P) are pairwise disjoint, so the sets X∩[i2nP,i2n+1P) for even 2n≥m are pairwise disjoint nonempty subsets of X∩φ(P), and the sets X∩[i2n+1P,i2n+2P) for odd 2n+1≥m are pairwise disjoint nonempty subsets of X∖φ(P). Both families are infinite, so X∩φ(P) and X∖φ(P) are infinite and φ(P)∈[ω]ω splits X by step 2.2.

F1step 2.1step 2.2
4.1

s≤d. Let D⊆ωω be a ≤∗-dominating family with ∣D∣=d, and fix X∈[ω]ω. The partition ψ(X) of step 2.1 is a partition, and func⁡ψ(X)∈ωω is dominated by some g∈D. By step 2.3 the partition part⁡g almost dominates ψ(X), so by step 3.1 the set φ(part⁡g) splits X. Hence {φ(part⁡g):g∈D} is a splitting family: it is contained in [ω]ω by step 2.2 and its size is at most ∣D∣=d. Therefore s≤d.

F1F2step 2.1step 2.2step 2.3step 3.1
4.2

b≤r. Let R={Xα:α<r} be an unreaped family of infinite sets, of size r. Consider the family Ψ={ψ(Xα):α<r} of partitions. No partition P almost dominates every member of Ψ: otherwise P almost dominates ψ(Xα) for every α<r, so by step 3.1 the set φ(P) splits every Xα, contradicting that R is unreaped. Consequently the family of functions {func⁡ψ(Xα):α<r} is ≤∗-unbounded: if some g dominated all of them, step 2.3 would make part⁡g a partition almost dominating every member of Ψ, contrary to what was just shown. An unbounded family has size at least b, and ∣{func⁡ψ(Xα):α<r}∣≤r, so b≤r.

F1F2F3step 2.3step 3.1
5.1

Steps 1.3, 4.1 and [F3] give ℵ1≤s≤d≤c, and steps 4.2 and [F1] with [F3] give ℵ1≤b≤r≤c. This is the statement. ∎

F1F3step 1.3step 4.1step 4.2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Add, cov, non and cof for null and meagre ideals

Definition

Work in ZFC. Let R carry its usual topology and its Lebesgue measure λ (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Lebesgue measurable sets, the family L(Rn), and the restricted set function λn), and let a subset of R be meagre when it is a union of a sequence of nowhere dense sets (Nowhere dense, meagre, residual, and comeagre subsets of a topological space; this is the same class as the one of Nowhere dense, meager (first category), residual, and second category subsets of R, which requires the displayed union to equal the set, because subsets of nowhere dense sets are nowhere dense). The two families of the title are

N:={E⊆R: E is Lebesgue measurable and λ(E)=0},M:={E⊆R: E is meagre},

the Lebesgue-null ideal and the meagre ideal on the real line (Measure-null sets and almost-everywhere statements relative to a measure). Since (R,L(R),λ) is complete (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume), a set belongs to N exactly when it is contained in a Lebesgue-null measurable set, so the measurability clause in the definition of N is not an extra restriction on the members.

The four invariants. Let X be a set and let I be a family of subsets of X (in the applications below I is N or M and X=R). Define

  • the additivity add⁡(I):=min⁡{∣A∣:A⊆I and ⋃A∉I};
  • the covering number cov⁡(I):=min⁡{∣A∣:A⊆I and ⋃A=X};
  • the non number non⁡(I):=min⁡{∣Y∣:Y⊆X and Y∉I};
  • the cofinality cof⁡(I):=min⁡{∣A∣:A⊆I and ∀B∈I ∃A∈A (B⊆A)}.

The family A in the last clause is an inclusion-cofinal subfamily of I; "I-cover" is the reading of the second clause when I is an ideal of subsets of X.

The four minima exist and are attained for each of N and M, with X=R. For the two "family" numbers one exhibits a single family: the family of singletons S:={{x}:x∈R}, indexed by R, is a subfamily both of N and of M. Each singleton is null, indeed has λ({x})=0 (Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0, where the Axiom of Countable Choice The Axiom of Countable Choice (ACω) supplies the measure theory), and each singleton is meagre: R∖{x} is open, because for y≠x the neighbourhood Nδ(y) with δ=∣y−x∣/2>0 contains no z with z=x, since z=x would give ∣z−y∣=∣x−y∣=2δ≮δ (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Ordered field); so {x} is closed, it has empty interior, since Nε(x)⊆{x} would put x+ε/2≠x into {x}, and therefore {x} is nowhere dense (Interior, closure, boundary and exterior of a subset of R), hence meagre, its union with the constant sequence of empty sets being {x} itself. Since ⋃S=R, the families of candidates for add⁡ and for cov⁡ are nonempty and contain the cardinality ∣S∣. For the remaining two numbers a single set suffices: R itself is neither null nor meagre, because λ(R)=+∞≠0 (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume) and no meagre subset of R exhausts R (Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets), so R witnesses Y⊆X, Y∉N and Y∉M; and I itself is an inclusion-cofinal subfamily of I, since B⊆B for B∈I.

Each of the four candidate collections is therefore a nonempty set of ordinals, so each has a least element: cardinalities are available, and are cardinals, because the Axiom of Choice well-orders every set (The Axiom of Choice, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used), and the candidate collection is the image under Z↦∣Z∣ of a subset of the power set of I or of X, hence a set by Replacement. The minimum is attained: there is a subfamily of I of size add⁡(I) whose union is not in I, a subfamily of I of size cov⁡(I) with union X, a set Y⊆X of size non⁡(I) with Y∉I, and an inclusion-cofinal subfamily of I of size cof⁡(I). All four numbers are cardinals (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used), and no further property is built into the definition: the elementary inequalities among the eight numbers, and their comparison with ℵ1 and c=2ℵ0, are proved in Elementary bounds on ideal cardinal invariants (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations).

Conventions. Bartoszyński's list of cardinal invariants of an ideal J of subsets of a set X is exactly the four displayed clauses: he writes add⁡(J)=min⁡{∣A∣:A⊆J and ⋃A∉J}, cov⁡(J)=min⁡{∣A∣:A⊆J and ⋃A=X}, non⁡(J)=min⁡{∣Y∣:Y⊆X and Y∉J} and cof⁡(J)=min⁡{∣A∣:A⊆J and ∀B∈J ∃A∈A (B⊆A)}. The eight numbers of this page are the values of the four functions at I=N and I=M, read as add⁡(N), cov⁡(N), non⁡(N), cof⁡(N), add⁡(M), cov⁡(M), non⁡(M) and cof⁡(M). It is part of the definition that these are evaluated on the real line, with Lebesgue measure and the usual topology; N and M are proper (that is, R∉I) and, under the Axiom of Countable Choice, σ-ideals, by Null sets are closed under countable unions and, in a complete space, under arbitrary subsets and The meagre subsets of a topological space form a sigma-ideal, but neither closure property is used in the definition.

Choice accounting. The minima use AC via A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, exactly as the sibling definitions of p, t, b, d, s and r do. The null side uses ACω through the cited suppliers (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0); the meagre side uses no choice principle to speak of meagreness or in the two facts needed above — the two elementary computations for {x} and the Baire fact for R (Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets).

Remarks

The four numbers were introduced by the descriptive-set-theory school in the context of an ideal of subsets of a Polish space, and Bartoszyński's chapter opens with precisely this list; the transfer of the definitions between the real line and Cantor space 2ω is developed below, together with the comparison of the eight values on the two spaces (Transfer of null and meagre invariants between Cantor space and the line), and the Cichoń diagram collecting the inequalities among them is The ZFC inequalities of Cichoń's diagram.

The names are mnemonics rather than descriptions of the definitions: the "additivity" is the least size of a subfamily whose union escapes the ideal, not the additivity of a measure-like functional; the "covering number" counts covers by ideal members rather than general covers; "non" counts the least size of a set not in the ideal; and the "cofinality" is computed in the inclusion order of the ideal, not in the order of the underlying set. The clause "⋃A∉I" in the definition of add⁡ excludes the empty family when ∅∈I. The equation ⋃A=X excludes the empty family when X≠∅; if X=∅, the empty family instead witnesses cov⁡(I)=0. Here X=R≠∅ and both ideals contain ∅, so the empty subfamily is never a candidate for either additivity or covering.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Elementary bounds on ideal cardinal invariants

Statement

In ZFC, for I=N the Lebesgue-null ideal and for I=M the meagre ideal of subsets of R (Add, cov, non and cof for null and meagre ideals),

ℵ1≤add⁡(I)≤min⁡(cov⁡(I),non⁡(I))≤max⁡(cov⁡(I),non⁡(I))≤cof⁡(I)≤c=2ℵ0.

The two middle terms are not an assertion that cov⁡ and non⁡ are comparable: min⁡ and max⁡ of the two cardinals are displayed, and min⁡≤max⁡ is immediate. The content is the four inequalities add⁡≤cov⁡, add⁡≤non⁡, cov⁡≤cof⁡, non⁡≤cof⁡, the lower bound ℵ1≤add⁡ coming from countable closure, and the upper bound cof⁡≤c coming from Borel hulls.

Facts & Assumptions

Given: ZFC, hence the Axiom of Choice and the Axiom of Countable Choice.

[F1]

For I=N or M the four numbers of Add, cov, non and cof for null and meagre ideals are cardinals, their defining minima are attained, every singleton is a member of both ideals, R∉I, a set is meagre exactly when it is contained in the union of a sequence of nowhere dense sets, and the two meagre conventions used in the library agree. (Add, cov, non and cof for null and meagre ideals, Nowhere dense, meagre, residual, and comeagre subsets of a topological space)

[F3]

The meagre subsets of a topological space contain ∅ and are closed under taking subsets, and under the Axiom of Countable Choice they are closed under countable unions. (The meagre subsets of a topological space form a sigma-ideal)

[F4]

Every E⊆R has a Gδ set G with E⊆G and λ∗(G)=λ∗(E); such a G is Borel. (Every subset of Rn has a Gδ measurable hull of the same outer measure)

Proof

technique · direct
1.1

Finite unions. If A0,…,Am∈I with I∈{N,M}, then ⋃i≤mAi∈I: extend the finite list to the sequence An:=∅ for n>m, the empty set being in both ideals, and apply the countable-union clause of [F2] respectively [F3].

F1F2F3
1.2

add⁡≤cov⁡. If A⊆I with ⋃A=R, then R∉I gives ⋃A∉I, so A is a candidate in the minimum defining the additivity and add⁡(I)≤∣A∣; minimizing over covers of R by members of I gives add⁡(I)≤cov⁡(I).

F1
1.3

add⁡≤non⁡. If Y⊆R with Y∉I, then Y=⋃y∈Y{y} is the union of the family {{y}:y∈Y} of members of I, of cardinality ∣Y∣; this family is a candidate in the minimum defining the additivity, so add⁡(I)≤∣Y∣, and minimizing over Y∉I gives add⁡(I)≤non⁡(I).

F1
1.4

cov⁡≤cof⁡. Let A⊆I be inclusion-cofinal in I with ∣A∣=cof⁡(I) (attained by [F1]). For each x∈R the singleton {x} is a member of I, so the set {A∈A:x∈A} is nonempty, and the Axiom of Choice selects a member Ax∈A containing x. Every real therefore lies in some member of A, that is, ⋃A=R, so A is a cover of R by members of I and cov⁡(I)≤∣A∣=cof⁡(I).

F1F6
1.5

non⁡≤cof⁡. Let A⊆I again be inclusion-cofinal with ∣A∣=cof⁡(I). Since R∉I, no member A∈A equals R, so each set R∖A is nonempty and the Axiom of Choice selects a point xA∈R∖A for every A∈A. Put Y:={xA:A∈A}; then Y⊆R and ∣Y∣≤∣A∣ because Y is the image of A under A↦xA. If Y were a member of I, cofinality would give A∗∈A with Y⊆A∗, and then xA∗∈Y⊆A∗ would contradict xA∗∈R∖A∗; hence Y∉I and non⁡(I)≤∣Y∣≤cof⁡(I).

F1F6
1.6

cof⁡(N)≤c. Let E∈N. By [F4] there is a Gδ set G with E⊆G and λ∗(G)=λ∗(E); here λ∗(E)=λ(E)=0 because E is measurable with λ(E)=0, so λ∗(G)=0, and G is a Borel set, hence a member of N, containing E. Therefore the family BN:={B∈B(R):B∈N} consists of members of N and is inclusion-cofinal in it, so cof⁡(N)≤∣BN∣≤∣B(R)∣=c by [F1] and [F5].

F1F2F4F5
1.7

cof⁡(M)≤c. Let E∈M and, by [F1], let (Nn)n∈N be a sequence of nowhere dense sets with E⊆⋃nNn. Put B:=⋃nNn‾. Each Nn‾ is closed by [F7], hence Nn‾=Nn‾‾ by [F7], so its interior int⁡(Nn‾‾)=int⁡(Nn‾)=∅ is empty, that is, Nn‾ is nowhere dense; thus B is the union of a sequence of nowhere dense sets and is meagre, and B is Fσ, hence Borel and a member of M, with E⊆B. Therefore BM:={B∈B(R):B∈M} is inclusion-cofinal in M, and cof⁡(M)≤∣BM∣≤∣B(R)∣=c.

F1F3F5F7
2.1

Countable families never witness. If A⊆I is at most countable, then ⋃A∈I: a finite family is handled by step 1.1, and a countably infinite family can be listed as a sequence and is handled by the countable-union clause of [F2] for N and of [F3] for M.

step 1.1F1F2F3
3.1

ℵ1≤add⁡(I). By [F1] the minimum defining the additivity is attained, so there is A⊆I with ∣A∣=add⁡(I) and ⋃A∉I. Step 2.1 shows that such an A is not at most countable, so add⁡(I)>ℵ0, and since add⁡(I) is a cardinal and ℵ1=ℵ0+ is the least cardinal strictly above ℵ0, it follows that ℵ1≤add⁡(I).

step 2.1F1F6
4.1

Combining step 3.1 with steps 1.2 and 1.3 gives ℵ1≤add⁡(I)≤min⁡(cov⁡(I),non⁡(I)); steps 1.4 and 1.5 give max⁡(cov⁡(I),non⁡(I))≤cof⁡(I); steps 1.6 and 1.7 give cof⁡(I)≤c for the two ideals; and min⁡≤max⁡ of two cardinals is immediate. This is the displayed chain. ∎

step 1.2step 1.3step 1.4step 1.5step 1.6step 1.7step 3.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

The fair-coin measure on Cantor space

Statement

In ZFC the Cantor space C=2N (Cantor sequence space, Cantor and Baire sequence spaces and coordinate codings) carries a probability measure μ on its Borel sigma-algebra B(C) (The Borel sigma-algebra of a topological space) such that

μ(Ns)=2−∣s∣for every finite binary word s,Ns:={x∈C:x↾∣s∣=s},

the construction using the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). The measure is the Carathéodory extension of the fair-coin content p0, which assigns to the cylinder prescribing the coordinates of a finite set F the value 2−∣F∣; it satisfies μ(C)=1, and it is multiplicative on cylinders with disjoint coordinate sets: if F,G⊆N are finite and disjoint, a∈2F and b∈2G, then μ([a]F∩[b]G)=2−∣F∣−∣G∣=μ([a]F)μ([b]G).

This is the fair-coin product measure on 2ω used by the master-code constructions below; the cylinders Ns are the basic clopen sets of the product topology of copies of the discrete two-point space (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), and the identification of 2N with 2ω is the usual one, N=ω.

Facts & Assumptions

Given: ZFC, hence the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

[F1]

C=2N is a compact metric space with no isolated points whose topology consists of unions of the cylinders {x:x(i)=a(i) for all i∈F} over finite F⊆N and a∈2F; these cylinders form a base of clopen sets, and the metric is d(x,y)=2−m−1 for the first coordinate m at which x and y differ. (Cantor sequence space, Cantor and Baire sequence spaces and coordinate codings)

[F3]

An algebra of subsets of a set is closed under complements and finite unions; the sigma-algebra generated by a family is the smallest sigma-algebra containing it; the Borel sigma-algebra of a topological space is generated by its open sets, and for a product of discrete two-point spaces it is generated by the cylinders; in a topological space finite unions and finite intersections of closed sets are closed, a set is closed exactly when its complement is open, and a union of open sets is open. (Algebras of subsets, The sigma-algebra generated by a family of sets, The Borel sigma-algebra of a topological space, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison)

[F4]

A premeasure on an algebra vanishes at ∅ and is countably additive on disjoint sequences whose union lies in the algebra; the outer set function induced by a premeasure is defined by covering costs; assuming the Axiom of Countable Choice the restriction of that outer set function to the generated sigma-algebra is a measure extending the premeasure. (Premeasures on algebras of sets, The outer set function induced by a premeasure, Assuming countable choice, a premeasure extends through its induced outer measure, Measures on sigma-algebras)

Proof

technique · direct
1.1

For finite F⊆N and a∈2F put [a]F:={x∈C:x(i)=a(i) for every i∈F}; each [a]F is open because the topology of C consists of unions of cylinders, and closed because C∖[a]F=⋃{[b]F:b∈2F, b≠a} is a finite union of cylinders and hence open; in particular [∅]∅=C. Consequently the family C0 of all finite unions of cylinders, the empty union included, contains ∅ and C and is closed under complements, and it is closed under finite intersections because [a]F∩[b]G=[a∪b]F∪G when a and b agree on F∩G and is ∅ otherwise; by de Morgan it is therefore an algebra of subsets of C.

F1F3
1.2

If F⊆G are finite and a∈2F, then the prescriptions b∈2G with b↾F=a are in bijection with the functions G∖F→2, so there are 2∣G∖F∣ of them, and [a]F is their pairwise disjoint union: a point of [a]F agrees with exactly one such b on G.

F1F2F3
2.1

The fair-coin content is well defined on C0. Let A∈C0 and let A=[a0]F0∪⋯∪[aℓ]Fℓ be a presentation; put G:=F0∪⋯∪Fℓ, a finite set. By step 1.2 each [ai]Fi is a disjoint union of cylinders [b]G, and these lie inside A; since the G-cylinders partition C, A is the disjoint union of the G-cylinders contained in it, and we let m(A,G) be their number and set p0(A):=m(A,G)⋅2−∣G∣. If G⊆H are finite, step 1.2 splits each G-cylinder into 2∣H∖G∣ many H-cylinders, so m(A,H)=m(A,G)⋅2∣H∖G∣ and m(A,H)2−∣H∣=m(A,G)2−∣G∣ because ∣H∣=∣G∣+∣H∖G∣ and 2−∣G∣−∣H∖G∣=2−∣G∣2−∣H∖G∣; two finite sets containing all Fi are compared through their union, which contains both, so the value does not depend on the presentation or on G.

step 1.2F2
3.1

From step 2.1, p0(∅)=0, p0(C)=1 and p0([a]F)=2−∣F∣; if A,B∈C0 are disjoint and G is finite and contains the supports of presentations of both, then the G-cylinders inside A∪B are exactly those inside A together with those inside B, because a G-cylinder meets the disjoint sets A and B in all of itself or in nothing, so m(A∪B,G)=m(A,G)+m(B,G) and p0(A∪B)=p0(A)+p0(B); hence p0 is monotone, and 0≤p0(A)≤1 for every A∈C0.

step 2.1F2
4.1

Let (Ak)k∈N be pairwise disjoint members of C0 whose union A lies in C0. For every m the set A0∪⋯∪Am is contained in A, so step 3.1 gives ∑k≤mp0(Ak)=p0(A0∪⋯∪Am)≤p0(A) and hence ∑k∈Np0(Ak)≤p0(A). Conversely A is a finite union of closed cylinders, hence closed by step 1.1 and [F3], so it is a compact subset of the compact space C; the Ak are open and cover A, so the finite-subcover property read in the ambient space through [F5] gives m with A⊆A0∪⋯∪Am, and then ∑k∈Np0(Ak)≥∑k≤mp0(Ak)=p0(A0∪⋯∪Am)≥p0(A) by step 3.1. Hence p0 is a premeasure on the algebra C0.

step 3.1step 1.1F1F3F4F5
5.1

Assume the Axiom of Countable Choice. By [F4] the outer set function μ∗ induced by the premeasure p0 has a restriction μ:=μ∗↾σ(C0) that is a measure on the sigma-algebra generated by the cylinders, and μ(A)=p0(A) for every A∈C0; in particular μ(C)=p0(C)=1, so μ is a probability measure.

step 4.1F4
6.1

The cylinders form a base of the topology of C and each is a union of open sets, so the sigma-algebra they generate is the Borel sigma-algebra: σ(C0)=B(C). Hence μ is a Borel probability measure and μ([a]F)=p0([a]F)=2−∣F∣ for every finite F and a∈2F; for a finite binary word s the cylinder Ns is [s]F with F={0,…,∣s∣−1}, so μ(Ns)=2−∣s∣.

step 5.1step 3.1F1F3
6.2

If F∩G=∅, a∈2F and b∈2G, then [a]F∩[b]G=[a∪b]F∪G by step 1.1, so μ([a]F∩[b]G)=2−∣F∪G∣=2−∣F∣−∣G∣=μ([a]F)μ([b]G), the middle equality using ∣F∪G∣=∣F∣+∣G∣ and the power laws.

step 5.1step 3.1F2
7.1

Steps 6.1 and 6.2 are the two claims: 2N carries the Borel probability measure μ with μ(Ns)=2−∣s∣, obtained as the Carathéodory extension of the fair-coin content, and μ is multiplicative on cylinders with disjoint coordinate sets. ∎

step 6.1step 6.2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Borel master codes for null and meagre sets

Definition

Work in ZFC in Cantor space C=2ω, the product of countably many copies of the discrete two-point space, with the product topology (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) and the fair-coin measure μ of The fair-coin measure on Cantor space, so that μ is a Borel probability measure with μ([s])=2−∣s∣ on the basic clopen cylinders [s]={x∈C:x↾∣s∣=s} (The Borel sigma-algebra of a topological space).

For this page define the Cantor-space null and meagre ideals by

NC:={A⊆C:∃B∈B(C) (A⊆B and μ(B)=0)},MC:={A⊆C:A is meagre in C}.

Thus null membership means being contained in a Borel fair-coin null set; it does not assign μ(A) to a possibly non-Borel set A. These are the completed null ideal and the meagre ideal on C. In ZFC, NC is closed under subsets and countable unions: choose a Borel null hull for each set in a countable family and take their Borel null union. The same closure holds for MC by flattening the countable nowhere-dense witnesses over N×N; subsets preserve meagreness by definition. The unqualified symbols N and M in Add, cov, non and cof for null and meagre ideals denote the corresponding ideals on R.

The fixed clopen basis. Fix once and for all a bijection N→2<N from the natural numbers onto the finite binary words, for definiteness the length-lexicographic one ∅,0,1,00,01,10,11,000,…, and write Uk:=[sk] for the k-th basic clopen set, so that (Uk)k∈N enumerates the basic clopen sets of C and μ(Uk)→0. Every open subset of C is a union of basic clopen sets, since the cylinders form a base of the topology.

Null master codes. A null master code is a function f:N→N. Fix a second enumeration (Ck)k∈N of all clopen subsets of C, including the empty set, by coding finite unions of basic cylinders in length-lexicographic order. The null-code condition is

μ(Cf(n))≤2−nfor every n∈N.

The null set coded by f is the limsup of the sequence of clopen sets that f selects,

Nf:=⋂m∈N⋃n≥mCf(n),

which is Borel, and null: μ(⋃n≥mCf(n))≤∑n≥m2−n=21−m by countable subadditivity and the geometric series, so continuity from above along the decreasing sequence of unions gives μ(Nf)=lim⁡mμ(⋃n≥mCf(n))=0. Thus every null master code names a member of NC, and the coded family is a family of null Borel sets.

Meagre master codes. A meagre master code is a function f:N→N, read through a fixed bijection N→N×N, such that for every n∈N the open set

Vn(f):=⋃m∈NUf(⟨n,m⟩)

is dense in C. The meagre set coded by f is the complement of the intersection of those dense open sets,

Mf:=C∖⋂n∈NVn(f)=⋃n∈N(C∖Vn(f)),

and it is meagre: each complement C∖Vn(f) is closed because Vn(f) is open, and has empty interior because Vn(f) is dense, so each complement is nowhere dense (Nowhere dense, meagre, residual, and comeagre subsets of a topological space) and Mf is a countable union of closed nowhere dense sets, hence Mf∈MC.

The slalom order. A slalom is a function S with domain N and finite values S(n)⊆N (The cardinality ∣A∣ of a finite set), subject to the summability condition ∑n∈N∣S(n)∣2−n<∞ (Series, partial sums, convergence and the sum, divergence, and the tail series). Slaloms are ordered by eventual inclusion,

S⊆∗T:⟺S(n)⊆T(n) for all but finitely many n∈N,

and the space of slaloms with this preorder is written (S,⊆∗) below; it is the slalom space of the master-code construction. The order is reflexive and transitive, and it is one-sided: S⊆∗T allows S(n)⊋T(n) for finitely many n.

Remarks

The two code families mirror each other. A null code fixes, at stage n, one finite union of cylinders of measure at most 2−n, and the coded set is the set of points falling into infinitely many stages; summability of the bounds is what makes the limsup null. A meagre code fixes, at stage n, a dense open set, and the coded set is the set of points falling outside at least one stage; density is what makes each of those complements nowhere dense. Nothing in the definitions requires the codes to be injective or the coded sets distinct: the master families {Nf} and {Mf} are used below for their cofinality in the respective ideals (Null and meagre master codes are cofinal), not for a bijective parametrisation of the ideals.

The name "master code" records that the coding is a presentation of the ideals just defined, not a parametrisation of their members. The symbols N and M in Add, cov, non and cof for null and meagre ideals refer to the real-line ideals; NC and MC here refer to Cantor space. The passage of the four cardinal invariants between these spaces is a separate matter needing separate measure and category maps (Transfer of null and meagre invariants between Cantor space and the line). Everything above is internal to C and consists of notation and elementary estimates; the constructions that give the master families their content — the uniform Borel section codes and the Tukey morphisms — are the lemmas that follow.

Both coding conditions are Borel conditions on the codes, in the sense needed for the parameterised arguments below. With the fixed enumerations of this definition each atomic condition, f(n)=k or Uj∩Uk≠∅, has a clopen truth set over the code space ωω, so the null-code condition and the density condition are countable Boolean combinations of clopen sets. Summability of ∑n∣S(n)∣2−n is Borel as well, being the union over L∈N of the conditions that every finite partial sum is at most L. No choice principle is used to code: the enumerations are fixed once and for all, and selecting a least witness index is a formula in the index.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Uniform open hulls for Borel sections of small measure

Statement

Assume the Axiom of Choice (The Axiom of Choice).

Let H⊆2ω×2ω be Borel, and let ϵ>0 be rational. There is a Borel map x↦c(x) into codes for open subsets Ox⊆2ω such that Hx⊆Ox and μ(Ox∖Hx)<ϵ for every x. Equivalently, the set {(x,y):y∈Ox} is Borel and its sections have the specified open codes. If every Hx is null, then μ(Ox)<ϵ for every x.

Facts & Assumptions

Given: A Borel H and positive rational ϵ; μ is the fair-coin Borel probability measure on Cantor space.

[F2]

μ is a finite Borel probability measure with the specified cylinder values; it is countably subadditive and continuous from above on decreasing sequences of measurable sets. (The fair-coin measure on Cantor space, Finite and countable subadditivity of measures, Continuity from above when one set has finite measure)

Proof

technique · section-measure monotone class followed by Borel-rank induction
1.1

For every Borel B⊆2ω×2ω, the function x↦μ(Bx) is Borel. Let D be the class of Borel sets with this property. It contains every cylinder rectangle, since its section measure is a constant times a cylinder indicator. It contains the whole product, is closed under complements by μ((Bc)x)=1−μ(Bx), and under countable disjoint unions by countable additivity and pointwise limits of partial sums. The cylinder rectangles form a π-system generating the product Borel algebra, so the elementary π-λ (monotone-class) argument gives every Borel B. Explicitly, for a fixed rectangle the class of sets whose intersections with it lie in D is a Dynkin class; applying the same closure twice extends the assertion from rectangles to their generated sigma algebra.

F1F2
1.2

Use the fixed length-lexicographic cylinder enumeration to code an open set by the set of cylinders listed in its union. Countable unions of open codes are Borel operations on codes: a cylinder belongs to the output list exactly when it appears in one of the input lists. Selecting one code from a countable list by a Borel integer-valued map is Borel as well.

F1
2.1

We prove the stronger hull assertion simultaneously at all countable Borel ranks. If H is open in the product, write it as the union of all basic product rectangles contained in it. This is a fixed countable enumeration; for each x, retain exactly the second-factor cylinders of rectangles whose first factor contains x. These are Borel coordinate tests and code the open section Hx itself, with zero excess.

F1step 1.2base
2.2

If H=⋃iHi and hull-code operators have been constructed for the Hi at smaller rank, apply them with errors ϵ2−i−2 and union their open sections. This union covers Hx; the points added outside Hx lie in the union of the individual excess sets, whose total measure is at most ∑iϵ2−i−2<ϵ. The output code depends Borelly on x.

F2step 1.2IH
2.3

It remains to handle the complement stage of the Borel hierarchy. In its standard additive/multiplicative normal form, write the set under consideration as A=⋂iAi where Ai decrease and belong to an additive class already handled at this stage of the Borel hierarchy. For Π10 these are decreasing open neighborhoods; at higher multiplicative ranks the usual normal form is a countable intersection of lower-rank additive sets. Finite intersections make the sequence decreasing. Use the induction hypothesis to obtain open Oi(x)⊇(Ai)x with μ(Oi(x)∖(Ai)x)<ϵ/2. Put Ki={x:μ(((Ai∖A)x))<ϵ/2}. Each Ki is Borel by step 1.1. Since (Ai)x decreases to Ax and μ is finite, continuity from above makes the Ki increasing with union all parameters. The least i=i(x) with x∈Ki is therefore a Borel integer-valued function. Set Ox=Oi(x)(x). Then μ(Ox∖Ax)≤μ(Oi(x)(x)∖(Ai(x))x)+μ(((Ai(x)∖A)x))<ϵ. The selected open code is Borel by step 1.2.

step 1.1step 1.2F2IH
3.1

Every Borel set has a well-founded countable construction code from open sets using complement and countable union. The two-part transfinite Borel-rank induction—additive classes first by countable unions of earlier multiplicative classes, then multiplicative classes by step 2.3—using steps 2.1, 2.2 and 2.3 gives the asserted code operator for the particular H; no pointwise arbitrary choice of hulls is made. If μ(Hx)=0, the disjoint decomposition Ox=Hx∪(Ox∖Hx) gives μ(Ox)<ϵ. ∎

step 2.1step 2.2step 2.3F2discharge-induction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Uniform closed nowhere-dense covers for Borel meagre sections

Statement

If H⊆2ω×2ω is Borel and every vertical section Hx is meagre, there are Borel maps x↦Fj(x) into codes for closed nowhere-dense subsets of 2ω such that Hx⊆⋃jFj(x) for every x.

Facts & Assumptions

Given: A Borel set H with meagre vertical sections.

[F2]

A meagre set lies in a countable union of closed nowhere-dense sets. (Nowhere dense, meagre, residual, and comeagre subsets of a topological space)

Proof

technique · uniform Baire-property induction on a Borel code
1.1

Code an open section by a subset of the fixed cylinder list. If its code is Borel in x, then the relation Us∩Ox≠∅ is Borel: it is the countable disjunction over listed cylinders Ut of the finite test Us∩Ut≠∅. Consequently the open set Ox′=2ω∖Ox‾=⋃{Us:Us∩Ox=∅} has a Borel open code in x. Its boundary error Dx=2ω∖(Ox∪Ox′)=Ox‾∖Ox has a Borel closed code, is closed, and is nowhere dense: every open set meeting Ox‾ meets Ox, hence no nonempty open set is contained in Dx.

F1
1.2

We construct for every Borel B⊆2ω×2ω a Borel open-section code Ox and Borel closed nowhere-dense-section codes Fj(x) satisfying Bx△Ox⊆⋃jFj(x). For an open product set, list all basic product rectangles contained in it; their second-factor cylinders with first factor containing x form the desired open section. Its error list is empty.

F1base
2.1

For B=⋃iBi, use the induction data (Oi,Fi,j) and put O=⋃iOi. If y∈Bx∖Ox, it lies in some (Bi)x∖(Oi)x. If y∈Ox∖Bx, it lies in some (Oi)x∖(Bi)x. Thus the symmetric difference is covered by the countable list (Fi,j(x))i,j. The union open code and paired error list are Borel in x.

step 1.2IH
2.2

For Bc, let O′ be the interior of the complement of O from step 1.1. Complementing both B and O preserves their symmetric difference, while (2ω∖Ox)∖Ox′=Dx. Hence (Bc)x△Ox′⊆Dx∪⋃jFj(x). Append the Borel closed nowhere-dense code Dx to the old error list.

step 1.1step 1.2IH
3.1

Every Borel set has a well-founded countable code built from open sets by complement and countable union. Recursion on that code using steps 1.2, 2.1, and 2.2 gives the asserted Borel data for H.

step 1.2step 2.1step 2.2
4.1

For a fixed x, both Hx and its error set are meagre, so the open set Ox is meagre. But no nonempty open subset of Cantor space is meagre. To see this directly, start with a cylinder inside such an open set and, against a given sequence of closed nowhere-dense sets, repeatedly choose the first strictly smaller subcylinder avoiding the next closed set. The nested finite words determine a point in the open set outside their union. Hence Ox is empty and Hx⊆⋃jFj(x). The recursion and least-cylinder fusion use fixed countable enumerations and no countable-choice selection of sectionwise covers. ∎

step 3.1F2discharge-induction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Null and meagre master codes are cofinal

Statement

The meagre master family {Mf} of Borel master codes for null and meagre sets is inclusion-cofinal in the meagre ideal on Cantor space. If H⊆2ω×2ω is Borel with all sections meagre, there is a Borel map from the first coordinate to valid meagre master codes whose coded sets contain the corresponding sections.

Assume the Axiom of Choice (The Axiom of Choice) for the corresponding null claims: the null master family {Nf} is inclusion-cofinal in the null ideal on Cantor space, and if H⊆2ω×2ω is Borel with all sections null, there is a Borel map from the first coordinate to valid null master codes whose coded sets contain the corresponding sections.

Facts & Assumptions

Given: The fixed cylinder and clopen enumerations and fair-coin measure of the master-code definition.

[F1]

Borel null sections admit Borel-selected open hulls with arbitrarily small measure. (Uniform open hulls for Borel sections of small measure)

[F2]

Borel meagre sections admit Borel-selected sequences of closed nowhere-dense covers. (Uniform closed nowhere-dense covers for Borel meagre sections)

[F3]

A valid null code is a sequence of finite clopen unions Cf(n) with μ(Cf(n))≤2−n; its Borel null coded set belongs to NC. A valid meagre code is a sequence of dense open sets Vn(f) assembled from the fixed cylinder basis; its coded set belongs to MC. (Borel master codes for null and meagre sets)

[F5]

A nowhere-dense set has closure with empty interior; that closure is closed nowhere dense. A meagre set is contained in the union of a sequence of nowhere-dense sets. (Nowhere dense, meagre, residual, and comeagre subsets of a topological space)

[F4]

The Axiom of Choice permits simultaneous selection of countably many uniform open-hull codes for the rational errors 2−j−2 when starting from a Borel null hull. (The Axiom of Choice)

Proof

technique · Borel regrouping of open hulls and direct dense-open coding
1.1

Suppose every Hx is null. By [F1] and the countable selection permitted by [F4], for each j obtain Borel open codes Oj(x)⊇Hx with μ(Oj(x))<2−j−2. For an open-coded set, its canonical prefix-free cylinders are exactly the basic cylinders contained in the open set whose immediate parent is not contained in it (with the root handled separately). The predicate [s]⊆Oj(x) is Borel in x: compactness of [s] turns inclusion in the enumerated open union into existence of a finite subcover, a countable disjunction of finite code tests. These prefix-free cylinders partition Oj(x) and their measures sum to μ(Oj(x)). Enumerate all pairs (j,s) in a fixed order, putting the corresponding cylinder at its slot when it is canonical and the empty set otherwise. Write this clopen sequence as (Dk(x))k. It depends Borelly on x and ∑kμ(Dk(x))≤∑j2−j−2<1.

F1F3F4
1.2

Suppose every Hx is meagre. By [F2] obtain Borel closed nowhere-dense codes Fj(x) covering it. Put Vn(x)=2ω∖⋃j≤nFj(x); this is dense open. List all basic cylinders Us contained in Vn(x), repeating a fixed cylinder if necessary to make an infinite sequence. Inclusion Us⊆Vn(x) is Borel in x: for each j≤n it requires Us⊆2ω∖Fj(x), equivalently a finite subcover of the compact cylinder Us by the cylinders in that coded open complement. This is a finite conjunction of countable disjunctions of finite code tests. The resulting Borel sequence of cylinder indices is a valid meagre code gx with Vn(gx)=Vn(x). As Hx lies in the union of the Fj(x), it lies in Mgx.

F2F3
2.1

Let Th(x)=∑k≥hμ(Dk(x)), a Borel pointwise limit of finite partial sums. Its value decreases to zero. Starting with h0=0, choose hn+1>hn as the least integer with Thn+1(x)≤2−(n+1). The threshold tests are Borel, so each hn(x) is Borel. Define En(x)=⋃hn(x)≤k<hn+1(x)Dk(x), a finite clopen union. Then μ(En(x))≤Thn(x)(x)≤2−n. Its index in the fixed clopen enumeration can be chosen canonically by least search, hence Borelly. This gives a valid null code fx. Every y∈Hx belongs to at least one canonical cylinder from each Oj(x); these have distinct pair-slots as j varies, so y belongs to infinitely many En(x). Thus Hx⊆Nfx.

step 1.1F3
3.1

Let A∈NC. By the definition [F3] choose a Borel null set B⊇A. Apply [F1] to the constant Borel family H=C×B and the fixed parameter x0=0ω, at errors 2−j−2, to obtain open sets Oj⊇B with μ(Oj)<2−j−2; [F4] permits choosing the sequence of hull codes. Their intersection G is a Borel null hull of A. The one-parameter versions of steps 1.1 and 2.1 applied to G produce a null master set containing G and hence A. For an arbitrary A∈MC, take its defining sequence (Aj) of nowhere-dense sets. Each Aj‾ is closed nowhere dense by [F5], so B=⋃jAj‾ is Borel and meagre and contains A. Apply step 1.2 to the constant Borel family C×B and evaluate at 0ω to obtain a meagre master set containing B, hence A. Taking the closures is canonical and uses no additional choice. This proves cofinality and the uniform Borel clauses. ∎

step 2.1step 1.2F1F3F4F5
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Transfer of null and meagre invariants between Cantor space and the line

Statement

In ZFC, let NC and MC be the Cantor-space ideals defined in Borel master codes for null and meagre sets, and put NR:=N and MR:=M for the real-line ideals of Add, cov, non and cof for null and meagre ideals. For each space X∈{C,R} and its corresponding ideal IX∈{NX,MX}, use the four cardinal definitions of Add, cov, non and cof for null and meagre ideals with X and IX. Then the four values for each Cantor-space ideal equal the corresponding values for its real-line ideal. Here C=2ω carries the fair-coin Borel probability measure and R carries Lebesgue measure.

Facts & Assumptions

Given: The two spaces and their indicated measures and ideals.

[F1]

Fair-coin measure gives each length-m binary cylinder mass 2−m; Lebesgue measure gives each half-open interval its length. (The fair-coin measure on Cantor space, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included)

[F2]

The four invariants are defined by the minima over ideal families, covers, nonideal sets, and inclusion-cofinal bases. Apply those general formulas to the two explicitly named space-ideal pairs in the statement; the real-line application is the one evaluated on the definition page. (Add, cov, non and cof for null and meagre ideals, Borel master codes for null and meagre sets)

[F3]

Countable sets belong to both corresponding ideals in either space. In C, a singleton is the intersection of its nested length-m cylinders, whose measures tend to zero; it is nowhere dense because Cantor space has no isolated points. A countable union of members of NC is contained in the union of selected Borel null hulls, which is Borel and null; MC is a sigma-ideal under Countable Choice, and both are closed under subsets. On R, countable null sets and the two sigma-ideal properties are supplied by the cited facts. (The fair-coin measure on Cantor space, Continuity from above when one set has finite measure, Cantor and Baire sequence spaces and coordinate codings, Borel master codes for null and meagre sets, The Axiom of Choice, Nowhere dense, meagre, residual, and comeagre subsets of a topological space, Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0, Null sets are closed under countable unions and, in a complete space, under arbitrary subsets, The meagre subsets of a topological space form a sigma-ideal)

[F4]

The Axiom of Choice makes arbitrary witness families well-orderable and lets their cardinalities be compared. The countable component and exceptional-set matchings below are explicit and choice-free. (The Axiom of Choice)

Proof

technique · a single global bijection preserving both ideals
1.1

Let E⊆2ω be the countable set of eventually constant binary sequences, and let D⊆R be the dyadic rationals. The binary-value map b:2ω∖E→(0,1)∖D is a bijection. It is a homeomorphism: a finite prefix fixes a dyadic interval; at a nondyadic point that interval can be made arbitrarily small, and every sufficiently small neighborhood avoiding adjacent dyadic endpoints fixes a finite prefix. The inverse binary digit map sends a length-m cylinder to the corresponding half-open dyadic interval of length 2−m after the countable dyadic exceptions are removed. Thus [F1] and the π-λ argument show that binary value pushes fair-coin measure to Lebesgue measure on (0,1); the discarded countable sets have measure zero. Therefore b and its inverse preserve null sets: arbitrary null subsets are contained in Borel null hulls; restricting to the two conull cores preserves the completed null ideals. A homeomorphism preserves meagreness on the cores.

F1F3
2.1

The complement R∖D splits into the disjoint relative clopen components Iz=(z,z+1)∖D for z∈Z. The Cantor core 2ω∖E splits into the disjoint relative clopen components Jk=[0k1]∖E for k∈ω. Choose a fixed bijection z↔k. On Iz first translate by −z, then apply b−1, then prefix the resulting binary sequence by 0k1. This gives a homeomorphism h between the two cores. On this component, prefixing scales fair-coin measure by the positive constant 2−(k+1): this holds first for cylinders by [F1], then for Borel sets by the π-λ argument and for arbitrary null subsets by Borel hulls. Translation preserves Lebesgue null sets. Thus h preserves null sets in both directions, as well as relative meagre sets on the two cores. Countable unions across the components preserve both ideal properties.

step 1.1F3F4
3.1

Both omitted sets D and E are countably infinite, so both cores are dense in their ambient spaces. For any dense subspace Y⊆X and A⊆Y, A is nowhere dense in Y exactly when it is nowhere dense in X: if A‾X contained a nonempty open U, then U∩Y would be a nonempty relative open subset of A‾Y; conversely, if A‾Y contained a nonempty relative open U∩Y, density of Y would force U⊆A‾X. Taking countable unions gives the same equivalence for meagreness. Extend h by a fixed bijection D→E to a bijection H:R→2ω. For any A⊆R, the difference between H[A] and h[A∖D] is a subset of E. Conversely, the difference between H−1[B] and h−1[B∖E] is a subset of D. By [F3], both null and meagre ideal membership are therefore preserved in both directions by H.

step 2.1F3F4
4.1

The bijection H preserves ideal membership, unions, and set containment. Since [F2] gives the real-line minima, H induces bijections between the candidate-witness collections in the four definitions and their Cantor-space counterparts, so the Cantor minima also exist and have the same values. Applying H−1 gives the reverse cardinal inequalities and hence equality for all eight invariants. AC is used to compare cardinalities of arbitrary witness families in [F2]; the component and exceptional-set matchings themselves are explicit. ∎

step 3.1F2F4
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Ideal Tukey morphisms control additivity and cofinality

Statement

Let X be a set and let I,J⊆P(X) be proper ideals: each contains ∅, is closed under taking subsets, and does not contain X. Let add⁡ and cof⁡ be defined for a family of subsets of X by the minimum clauses of Add, cov, non and cof for null and meagre ideals, add⁡(J)=min⁡{∣A∣:A⊆J, ⋃A∉J} and cof⁡(J)=min⁡{∣A∣:A⊆J, ∀B∈J ∃A∈A (B⊆A)}. Assume these minima exist for both I and J; equivalently for additivity, each family has a subfamily whose union lies outside it. Suppose u:I→J and v:J→I are functions satisfying

u(A)⊆B⟹A⊆v(B)for all A∈I, B∈J.

Then add⁡(J)≤add⁡(I) and cof⁡(I)≤cof⁡(J). The same two inequalities hold in the weaker form in which I0⊆I and J0⊆J are inclusion-cofinal∗ subfamilies (every member of I is contained in a member of I0, and similarly for J) and the morphism is given only between I0 and J0, with the Axiom of Choice available to extend it.

The relevant instances are I,J∈{N,M} on the real line and their coded cofinal subfamilies on Cantor space; the inequalities are used below in exactly the direction displayed, with no reversal.

Facts & Assumptions

Given: A set X, proper ideals I,J⊆P(X), functions u:I→J and v:J→I with the displayed property, and the attained add⁡ and cof⁡ minima for both families as assumed in the Statement.

[F1]

For a family K⊆P(X) of subsets of X, add⁡(K) is the least cardinality of a subfamily of K whose union is not in K, and cof⁡(K) is the least cardinality of an inclusion-cofinal subfamily of K; for K=N and K=M the two minima exist and are attained. (Add, cov, non and cof for null and meagre ideals)

[F2]

The Axiom of Choice supplies a choice function for every family of nonempty sets, and under it every set has a cardinality and cardinalities are cardinals. (The Axiom of Choice, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, Cardinal (initial ordinal) and cardinality)

Proof

technique · direct
1.1

If κ<add⁡(J) and (Bi)i<κ is a family of members of J, then ⋃i<κBi∈J: otherwise that subfamily would be a subfamily of J of cardinality at most κ whose union is not in J, and its cardinality would be a candidate in the minimum defining add⁡(J) strictly below that minimum.

givenF1
1.2

cof⁡(I)≤cof⁡(J): let B⊆J be inclusion-cofinal in J with ∣B∣=cof⁡(J). For every A∈I, cofinality of B gives some B∈B with u(A)⊆B, and the displayed morphism property gives A⊆v(B). Thus the image {v(B):B∈B}⊆I is inclusion-cofinal without simultaneously selecting a witness for each A, and cof⁡(I)≤∣{v(B):B∈B}∣≤∣B∣=cof⁡(J).

givenF1
2.1

add⁡(J)≤add⁡(I): let κ<add⁡(J) and let (Ai)i<κ be a family of members of I; by step 1.1 the set B:=⋃i<κu(Ai) is a member of J, and u(Ai)⊆B gives Ai⊆v(B) for every i by the displayed property, so ⋃i<κAi⊆v(B); since v(B)∈I and I is closed under subsets, ⋃i<κAi∈I. Hence no subfamily of I of size below add⁡(J) has its union outside I, and the minimum clause for add⁡(I) gives add⁡(I)≥add⁡(J).

step 1.1givenF1
3.1

The cofinal-subfamily form: assume I0⊆I and J0⊆J are inclusion-cofinal and that u:I0→J0, v:J0→I0 satisfy the displayed property there. By [F2] choose for every A∈I a member A+∈I0 with A⊆A+ and for every B∈J a member B+∈J0 with B⊆B+, and put uˉ(A):=u(A+) and vˉ(B):=v(B+); if uˉ(A)⊆B for A∈I, B∈J, then u(A+)⊆B+ with A+∈I0 and B+∈J0, so the cofinal-subfamily property gives A+⊆v(B+)=vˉ(B) and hence A⊆vˉ(B); thus uˉ:I→J and vˉ:J→I satisfy the hypotheses of steps 2.1 and 1.2, which give add⁡(J)≤add⁡(I) and cof⁡(I)≤cof⁡(J).

step 2.1step 1.2givenF2
4.1

Steps 2.1 and 1.2 prove the two inequalities for a morphism defined on the full ideals without a simultaneous witness selection, and step 3.1 transfers them to morphisms defined only on inclusion-cofinal subfamilies, with the Axiom of Choice used for the two selections in step 3.1; the cardinal minima themselves are interpreted in ZFC. This is the statement. ∎

step 2.1step 1.2step 3.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Null master codes and summable slaloms are Tukey equivalent

Statement

In ZFC, let N0={Nf:f is a valid null master code}, ordered by inclusion, and let (S,⊆∗) be the summable slalom order of Borel master codes for null and meagre sets. There are Borel morphisms in both directions:

  • N0⪯S: Borel maps u from null codes to slaloms and v from slaloms to null codes with u(f)⊆∗S⇒Nf⊆Nv(S);
  • S⪯N0: Borel maps u′ from slaloms to null codes and v′ from null codes to slaloms with Nu′(S)⊆Nf⇒S⊆∗v′(f).

These are morphisms of the coded cofinal family; no identification of a code with a unique ideal member is required.

Facts & Assumptions

Given: The fair-coin Cantor probability space, the clopen null codes, and finite-valued summable slaloms.

[F1]

Valid null codes select clopen Cf(n) of measure at most 2−n; their limsups are null. The slalom space is Borel in the standard product code of finite subsets because the finite partial sums of ∑n∣S(n)∣2−n are uniformly coded. (Borel master codes for null and meagre sets)

[F2]

Borel families with null sections have Borel-selected covering null master codes. (Null and meagre master codes are cofinal)

[F3]

Cantor space and Baire space have fixed Borel codes for the standard Borel parameter spaces used here. (Cantor and Baire sequence spaces and coordinate codings)

[F5]

AC gives the ordinary measure and cardinal framework; all maps below are defined by fixed enumerations, Borel tests, and least-index choices. (The Axiom of Choice)

Proof

technique · two explicit coded morphisms
1.1

Enumerate all clopen sets as (Ci)i, as in [F1], and put Cik=Ci when μ(Ci)≤2−k and Cik=∅ otherwise. For a null code f define u(f)(n)={f(2n),f(2n+1)}. This is a slalom, since ∑n∣u(f)(n)∣2−n≤∑n21−n<∞. For S∈S let HS=lim sup⁡n⋃i∈S(n)(Ci2n∪Ci2n+1). Its stage-n measure is at most ∣S(n)∣(2−2n+2−(2n+1)), and the sum of these bounds is finite by summability. The elementary tail-union estimate therefore gives μ(HS)=0. Membership in HS is Borel in (S,y), since each stage is a finite clopen union.

F1
1.2

For a null code f, define the closed sets Km′(f)=⋂n≥m(2ω∖Cf(n)). They increase to 2ω∖Nf, which has measure one. Choose the least m=m(f) for which μ(Km′(f))>1/2 and set Kf′=Km(f)′(f). This is a Borel choice: each measure is the decreasing limit of measures of finite clopen intersections, and the least-index threshold test is Borel. For the fixed basic clopens (Uj)j let Zj={f:μ(Kf′∩Uj)=0}, again Borel by the same finite-stage measure limits, and set Kf=Kf′∖⋃j:f∈ZjUj. This is compact, has the same measure as Kf′, is disjoint from Nf, and has the property that every nonempty Kf∩Uj has positive measure. The last assertion follows because a zero-measure intersection with Kf would be a zero-measure intersection with Kf′ unless Uj was removed, in which case the intersection is empty. Its closed code is Borel in f: the finite-stage closed approximants are clopen, and whether the compact intersection meets a basic clopen is the decreasing-limit nonemptiness test from compactness.

F1
2.1

Use [F3] to code S as a Borel subset of a Cantor parameter space; extend the Borel family HS by empty sections off that subset. Apply [F2] and restrict the resulting selector to obtain a Borel null-code map v(S) with HS⊆Nv(S). If u(f)⊆∗S, then for all sufficiently large n the two clopen sets Cf(2n) and Cf(2n+1) appear in the stage-n union defining HS. Every point of Nf lies in infinitely many even or odd code sets and hence in HS. Thus Nf⊆Nv(S), proving the first morphism.

step 1.1F2F3
3.1

For each pair (n,i) with n≥1, allocate a distinct block of n binary coordinates and let Gin be the clopen event that all bits in that block are zero. The blocks are disjoint, so the family of all these events is independent and μ(Gin)=2−n. For S∈S put LS=lim sup⁡n≥1⋃i∈S(n)Gin. The sum of stage measures is bounded by ∑n≥1∣S(n)∣2−n<∞, so LS is null. It is Borel in (S,y). As in step 2.1, [F2] supplies a Borel null-code map u′(S) with LS⊆Nu′(S).

F1F2F3
4.1

For each f,j,n define, when Kf∩Uj≠∅, Tf,j(n)={i:Kf∩Uj∩Gin=∅}; when Kf∩Uj=∅, put Tf,j(n)=∅. The compact-hit tests of step 1.2 make this a Borel family. In the nonempty case put a=μ(Kf∩Uj)>0. For every finite set of pairs (n,i) with i∈Tf,j(n), independence gives a≤∏(n,i)(1−2−n). Taking finite products increasingly shows both that every Tf,j(n) is finite and that ∑n≥1∣Tf,j(n)∣2−n<∞; indeed −log⁡(1−t)≥t and the logarithms of all finite products are bounded below by log⁡a. Thus Tf,j is a slalom.

step 3.1step 1.2
5.1

Choose Borelly the least increasing thresholds rj(f)≥j with ∑n≥rj(f)∣Tf,j(n)∣2−n<2−j. Such thresholds exist by step 4.1; each test is Borel as a limit of finite sums. Put v′(f)(n)=⋃j:rj(f)≤nTf,j(n). Only finitely many j≤n contribute, so the value is finite, and ∑n∣v′(f)(n)∣2−n≤∑j2−j<∞. Also Tf,j⊆∗v′(f) for every j.

step 4.1
6.1

Assume Nu′(S)⊆Nf. Since LS⊆Nu′(S), the compact Kf misses LS. Hence it is covered by the increasing closed sets Kf∩⋂n≥m(2ω∖⋃i∈S(n)Gin)(m∈ω). By [F4], one of these closed sets has nonempty relative interior in Kf. Choose a basic Uj witnessing that interior. Then Kf∩Uj is nonempty and, for all n≥m and i∈S(n), it misses Gin. Therefore S(n)⊆Tf,j(n) eventually, and step 5.1 gives S⊆∗v′(f). This is the second morphism. AC in [F5] supplies DC for the Baire category theorem [F4] at this step and underlies full null-ideal cofinality in [F2]; the displayed Borel maps make no further arbitrary choices. ∎

step 3.1step 5.1F2F4F5
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

A good clopen family for summable slaloms

Statement

In Cantor space 2ω there are fixed, countably indexed clopen sets Smn (n,m∈ω) and a sequence (Un)n∈ω in which every nonempty basic cylinder occurs infinitely often, with these properties:

  1. Smn∩Un≠∅ for every n,m;
  2. for every dense open D⊆2ω and every n, some Smn⊆D;
  3. whenever J⊆ω has ∣J∣≤2n, the intersection Un∩⋂m∈JSmn is nonempty.

The array has a fixed countable clopen code, and the construction uses no choice beyond finite, explicit least-index searches.

Facts & Assumptions

Given: Cantor space with its finite binary cylinder base.

Proof

technique · direct construction and finite diagonal argument
1.1

Enumerate all clopen subsets of 2ω as (Cl)l∈ω, with every clopen occurring infinitely often. Such sets are finite unions of basic cylinders: compactness of 2ω gives a finite subcover by cylinders, and compactness follows directly from the finite-branching binary tree. Fix a repeating enumeration (Un) of the nonempty basic cylinders. All enumerations can be obtained by listing finite binary words and finite lists, so their codes are fixed without a choice.

F1
2.1

Fix n. For each k, let Ak consist of indices l>k such that for every I⊆{0,…,k}, Un∩⋂i∈ICi≠∅⟹Un∩Cl∩⋂i∈ICi≠∅. The empty I is included. These are finite tests on clopen codes, so each Ak is a fixed, decidable set of indices.

step 1.1
3.1

If D is dense open, then Ak contains arbitrarily large indices l with Cl⊆D. Indeed, there are only finitely many nonempty clopen sets WI=Un∩⋂i∈ICi in step 2.1. For each such I choose the least coded basic cylinder BI⊆D∩WI. Their finite union C is clopen, lies in D, and meets every nonempty WI. The repeating clopen enumeration lists C beyond every prescribed k. Thus the required l exists, and all choices were finite least-index choices.

step 2.1F1
4.1

Put q=2n. List, with repetitions if necessary, every clopen set of the form Cm0∪⋯∪Cmq where Un∩Cm0≠∅ and mi+1∈Ami for i<q; call the resulting enumeration (Smn)m. There are infinitely many such tuples by step 3.1 with D=2ω. Every listed union meets Un through its first term. For a dense open D, choose m0 with Cm0⊆D∩Un, then recursively choose mi+1∈Ami with Cmi+1⊆D by step 3.1. The resulting Smn lies in D.

step 3.1
5.1

Take 1≤r≤q listed unions, writing the a-th one as Va=⋃i=0qCmia with mi+1a∈Amia. Select distinct rows a0,…,ar−1 as follows: at stage j, among rows not yet selected, choose one with the least j-th index mja. We claim by induction that Un∩⋂i≤jCmiai≠∅(j<r). At j=0 this is the condition on m0a0. For j>0, row aj was available at every earlier stage i<j, so miai≤miaj≤mj−1aj. Hence all previously selected indices belong to {0,…,mj−1aj}. As mjaj∈Amj−1aj, the defining implication of step 2.1 preserves the nonempty intersection when Cmjaj is added.

step 2.1step 4.1
6.1

Each selected diagonal clopen Cmjaj lies in its row union Vaj. Thus step 5.1 gives Un∩⋂a<rVa≠∅ for 1≤r≤q; the empty intersection is Un and is nonempty. Removing repeated members from a family of at most q sets only reduces r, so this proves the third property. The first two properties were proved in step 4.1. ∎

step 4.1step 5.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Meagre master codes are below summable slaloms

Statement

Let Smn be the good clopen array of A good clopen family for summable slaloms and put Mfgood=2ω∖lim sup⁡nSf(n)n for f∈ωω. These sets form an inclusion-cofinal subfamily of the meagre ideal. There are Borel maps u:ωω→S and v:S→ωω such that u(f)⊆∗T⟹Mfgood⊆Mv(T)good. Thus the meagre master family is below the summable slalom order in the ideal-inclusion morphism sense.

Facts & Assumptions

Given: The fixed good clopen array and repeating basic cylinders Un.

[F1]

Every Smn meets Un; some Smn is contained in any specified dense open set; and any at most 2n members in row n have intersection meeting Un. (A good clopen family for summable slaloms)

[F2]

A Borel family of meagre sections admits Borel-selected closed nowhere-dense covers. (Uniform closed nowhere-dense covers for Borel meagre sections)

[F3]

Meagre master codes are inclusion-cofinal. The summable slalom space is Borel in its product code. (Null and meagre master codes are cofinal, Borel master codes for null and meagre sets)

[F4]

Baire-space and Cantor-space parameters admit fixed Borel coding. (Cantor and Baire sequence spaces and coordinate codings)

Proof

technique · special cofinal meagre codes and a finite-intersection morphism
1.1

For each f, every tail union ⋃n≥mSf(n)n is dense open: a given basic cylinder U equals Un for some n≥m, and Sf(n)n meets it by [F1]. Hence Mfgood is meagre. It is represented by a code of Borel master codes for null and meagre sets: at master stage m, enumerate the basic cylinders contained in that dense open tail union. This enumeration is Borel in f because the tail union is a coded countable union of clopens and inclusion of a compact cylinder in it is a finite-subcover test.

F1F3
1.2

If A is meagre, take closed nowhere-dense Fj with A⊆⋃jFj. For each n, the complement of ⋃j≤nFj is dense open, so choose the least m=f(n) such that Smn lies in that complement, using [F1]. Every y∈A belongs to some Fj and therefore misses Sf(n)n for all n≥j; hence A⊆Mfgood. This proves cofinality.

F1
1.3

Define u(f)(n)={f(n)}, a slalom since ∑n2−n<∞. For T∈S, summability implies ∣T(n)∣≤2n for every sufficiently large n. Let r(T) be the least integer beyond which this holds; it is Borel because the condition is a countable conjunction of coordinate tests. Put Wn(T)=⋂i∈T(n)Sin for n≥r(T), and put Wn(T)=2ω for earlier n. Empty intersections are the whole space. By [F1], each Wn(T) for n≥r(T) meets Un. Therefore every tail union ⋃n≥mWn(T) is dense open, and LT=2ω∖lim sup⁡nWn(T) is meagre. Its membership relation is Borel in (T,y) because each Wn(T) is a finite clopen intersection with Borel dependence on T.

F1F3
1.4

Code the Borel slalom parameter space in a Cantor parameter space via [F4], extending LT by empty sections outside its coded domain. Apply [F2] to get Borel closed nowhere-dense codes Fj(T) with LT⊆⋃jFj(T). Set v(T)(n) to be the least m such that Smn∩⋃j≤nFj(T)=∅. The complement of that finite union is dense open, so [F1] gives such an m. For a Borel-coded closed set, disjointness from a fixed clopen set is a Borel finite-subcover test on its open complement; hence v is Borel. If y∈LT, then y∈Fj(T) for some j, and it misses Sv(T)(n)n whenever n≥j. Thus LT⊆Mv(T)good.

F1F2F4
2.1

If u(f)⊆∗T, then f(n)∈T(n) eventually and Wn(T)⊆Sf(n)n eventually. Hence lim sup⁡nWn(T)⊆lim sup⁡nSf(n)n and, on taking complements, Mfgood⊆LT⊆Mv(T)good. This is the required Borel morphism. The special family is cofinal by step 1.2, so it is an eligible cofinal master family for ideal inequalities. ∎

step 1.2step 1.3step 1.4
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Null-to-meagre Tukey inequalities

Statement

In ZFC, add⁡(N)≤add⁡(M) and cof⁡(M)≤cof⁡(N) for the Lebesgue-null and meagre ideals on R.

Facts & Assumptions

Given: The two ideals and the indicated ZFC background.

[F1]

The special good-clopen meagre family is inclusion-cofinal, and there are Borel maps uM,vM witnessing M0⪯S. (Meagre master codes are below summable slaloms)

[F2]

There are Borel maps uN,vN witnessing S⪯N0, where N0 is an inclusion-cofinal null master family. (Null master codes and summable slaloms are Tukey equivalent, Null and meagre master codes are cofinal)

[F3]

If I0⪯J0 for inclusion-cofinal ideal subfamilies, then add⁡(J)≤add⁡(I) and cof⁡(I)≤cof⁡(J); extending from cofinal families and selecting one code for each distinct coded set uses AC. (Ideal Tukey morphisms control additivity and cofinality, The Axiom of Choice)

[F4]

The four null and meagre ideal invariants agree between Cantor space and the real line. (Transfer of null and meagre invariants between Cantor space and the line)

Proof

technique · composition of the coded morphisms
1.1

For each distinct A∈M0, use [F3] to choose one special meagre code fA with A=MfAgood; for each distinct B∈N0, choose one null master code gB with B=NgB. Define maps on the actual cofinal set families by U(A)=NuN(uM(fA)) and V(B)=MvM(vN(gB))good. If U(A)⊆B, then NuN(uM(fA))⊆NgB, so [F2] gives uM(fA)⊆∗vN(gB); [F1] then gives A=MfAgood⊆MvM(vN(gB))good=V(B). Thus U,V witness M0⪯N0 for the actual inclusion-cofinal ideal subfamilies in the direction required by [F3]. Duplicate codes cause no ambiguity because the representatives were fixed once by AC.

F1F2F3
2.1

Apply [F3] on Cantor space, using the cofinality in [F1] and [F2]. It gives add⁡(N2ω)≤add⁡(M2ω) and cof⁡(M2ω)≤cof⁡(N2ω). AC selects the code representatives in step 1.1 and the cofinal master covers in the extension step of [F3]; the underlying coded maps remain Borel and use fixed least-code choices. Transfer both values to R by [F4]. ∎

step 1.1F3F4
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Cross-ideal and bounding inequalities in Cichoń's diagram

Statement

In ZFC, cov⁡(N)≤non⁡(M),cov⁡(M)≤non⁡(N), add⁡(M)≤b≤non⁡(M),cov⁡(M)≤d≤cof⁡(M).

Facts & Assumptions

Given: The null and meagre ideals on R, the eventual domination numbers b,d, and ZFC.

[F1]

The four ideal invariants have their usual witness minima, and b is the least size of an unbounded family in (ωω,≤∗), while d is the least size of a dominating family. (Add, cov, non and cof for null and meagre ideals, Eventual domination and the numbers b and d)

[F4]

AC permits selecting witness families of the attained cardinal minima and selecting one coded meagre cover for each member of a basis. (The Axiom of Choice)

Proof

technique · translation, Baire-space bounds, and a chopped-cylinder witness
1.1

Enumerate the rationals as (qi)i. For each n, choose open intervals around qi whose total length is <2−n, and let On be their union. Each On is dense open and has measure <2−n, so B=⋂nOn is dense Gδ and null. Its complement C=⋃n(R∖On) is meagre. Every translate of B is null and comeagre; every translate of C is meagre and conull.

F3
1.2

For g∈ωω put Bg={x∈ωω:x≤∗g}. It is meagre: it is the union over m of the closed nowhere-dense sets ⋂n≥m{x:x(n)≤g(n)}. A family of size below b is bounded by some g, so its image in Baire space is meagre. By [F2], a nonmeagre subset of R has a nonmeagre intersection with the irrationals, since the rationals are countable meagre. Consequently b≤non⁡(M). A dominating family D of size d gives the meagre cover (Bg)g∈D of Baire space; transport it to the irrationals and add the rational set to one cover member. Each transported member is meagre in R, because the irrationals are a dense Gδ subspace with countable complement. Hence cov⁡(M)≤d.

F1F2F4
1.3

In Cantor space, for each n list every clopen interval cylinder Smn={x:x↾[n,k)=s},k>n,s∈2[n,k). For any dense open D, some listed Smn lies in D: successively extend a common suffix while processing the finitely many length-n prefixes, so all their concatenations land in D. Every listed interval cylinder meets every length-n prefix cylinder. It follows that for any f∈ωω, each tail union ⋃n≥rSf(n)n is dense open, and Mf=2ω∖lim sup⁡nSf(n)n is meagre. This family is inclusion-cofinal: if A⊆⋃jFj with Fj closed nowhere dense, choose Sf(n)n inside the dense open complement of ⋃j≤nFj, making A⊆Mf.

F2
2.1

If X is nonmeagre and y∈R, then X cannot be contained in the meagre complement of y−B, so y=x+b for some x∈X,b∈B. Thus the null translates (x+B)x∈X cover R, giving cov⁡(N)≤∣X∣. Take ∣X∣=non⁡(M). Likewise, if X is nonnull, it meets the conull translate y−C for every y, so the meagre translates (x+C)x∈X cover R and give cov⁡(M)≤non⁡(N).

step 1.1F1F4
2.2

Let kf(n)>n be the right endpoint of Sf(n)n. For a strictly increasing g with g(n)>n, put Eg={x:for all sufficiently large n,some i∈[n,g(n)) has x(i)=1}. This is meagre: for every r, the union over n≥r of the zero-block cylinders {x:x↾[n,g(n))=0} is dense open, so its limsup is comeagre and its complement is Eg.

step 1.3
3.1

We claim Eg⊆Mf⇒g≤∗kf. If g(n)>kf(n) infinitely often, choose increasing nj from those indices with g(nj)<nj+1. Define x to agree with the prescribed pattern Sf(nj)nj on [nj,kf(nj)) and to equal 1 elsewhere. The blocks are disjoint, so x belongs to infinitely many Sf(nj)nj and hence x∉Mf. Yet x∈Eg: outside the prescribed blocks x(n)=1; when n lies inside the block starting at nj, monotonicity gives g(n)≥g(nj)>kf(nj), and the coordinate kf(nj) is outside all prescribed blocks and has value 1. Thus Eg⊈Mf, proving the claim.

step 2.2
4.1

Choose an unbounded family G of strictly increasing functions of size b; replacing an arbitrary witness by its strictly increasing running majorants preserves unboundedness. If ⋃g∈GEg were meagre, step 1.3 would put it in one Mf, and step 3.1 would make kf dominate every g∈G, a contradiction. Therefore add⁡(M2ω)≤b. If (Ai)i<cof⁡(M2ω) is an inclusion-cofinal meagre family, use [F4] to select fi with Ai⊆Mfi. Every Eg lies in some Ai, so step 3.1 says g≤∗kfi. The family (kfi)i dominates, whence d≤cof⁡(M2ω). Transfer these two inequalities to R by [F3]. AC is used exactly for the cardinal witness families and indexed choices of fi; the interval construction itself uses finite searches. ∎

step 1.3step 3.1F1F3F4
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

The ZFC inequalities of Cichoń's diagram

Statement

In ZFC, the ten cardinals add⁡(N), cov⁡(N), non⁡(N), cof⁡(N), add⁡(M), cov⁡(M), non⁡(M), cof⁡(M), b, and d satisfy the standard Cichoń-diagram inequalities: the elementary ideal arrows, the null-to-meagre arrows, the cross-ideal arrows, the eventual-domination arrows stated below, and all their transitive consequences. No independence or completeness assertion is part of this theorem.

Facts & Assumptions

Given: The null and meagre ideals and eventual-domination cardinals in ZFC.

[F1]

For I=N,M, add⁡(I)≤cov⁡(I), add⁡(I)≤non⁡(I), cov⁡(I)≤cof⁡(I), and non⁡(I)≤cof⁡(I). (Elementary bounds on ideal cardinal invariants)

[F2]

add⁡(N)≤add⁡(M) and cof⁡(M)≤cof⁡(N). (Null-to-meagre Tukey inequalities)

[F3]

cov⁡(N)≤non⁡(M), cov⁡(M)≤non⁡(N), add⁡(M)≤b≤non⁡(M), and cov⁡(M)≤d≤cof⁡(M). (Cross-ideal and bounding inequalities in Cichoń's diagram)

[F4]

b≤d; their definitions and the ideal minima are evaluated in ZFC, where AC supplies cardinal comparison. (Basic bounding and dominating relations, Eventual domination and the numbers b and d, The Axiom of Choice)

Proof

technique · assemble proved generating inequalities
1.1

Draw the ten named cardinals as nodes. For each of N and M, insert the four elementary arrows of [F1]. Insert the two null-to-meagre arrows of [F2], the six cross and bounding arrows of [F3], and b≤d from [F4]. Every inserted arrow is an inequality already proved under the same ZFC conventions.

F1F2F3F4
2.1

If a≤b and b≤c are among these arrows, ordinal/cardinal order transitivity gives a≤c. Repeated application yields exactly the transitive consequences asserted in the Statement. The statement makes no claim that an omitted arrow is independent of ZFC or that a diagram drawing captures every possible relation. AC is used in the cited supplier proofs and in regarding the ten minima as comparable cardinals; no additional selection occurs in this assembly. ∎

step 1.1F4
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

FALSE: ZFC fixes the value of 2κ for every infinite regular κ

Statement

False claim: ZFC fixes the value of 2κ for every infinite regular cardinal κ; that is, the function κ↦2κ on the infinite regular cardinals is determined by the axioms of ZFC (Cardinal (initial ordinal) and cardinality).

The claim is refuted at the single regular cardinal κ=ℵ1: the two consistency pictures below, read externally in the finite-fragment sense, give 2ℵ1=ℵ2 and 2ℵ1=ℵ3 respectively, and ℵ2 and ℵ3 are distinct cardinals (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1). What ZFC does prove is the necessary constraints on the function — κ<2κ and cf⁡(2κ)>κ — and the refutation here concerns the value, not those constraints.

Facts & Assumptions

Given: The metatheoretic hypothesis that ZF is consistent, in the finite-fragment sense of [F1] and [F3], and the Axiom of Choice inside the forcing constructions of [F2].

[F1]

A verified proof transformation establishes Con⁡(ZF)⇒Con⁡(ZFC+GCH) and Con⁡(ZF)⇒Con⁡(ZFC+CH), with no assumption of a transitive set model of ZF. (Formal consistency of ZFC plus GCH relative to ZF, Positive relative consistency of CH and GCH)

[F2]

In ZFC, if κ is infinite regular and λ>κ satisfies 2<κ=κ and λκ=λ, then the forcing Add⁡(κ,λ) preserves all cardinals and forces 2κ=λ; over a ground model of GCH, κ=ℵ1 and λ=ℵ3 satisfy these hypotheses and give a cardinal-preserving extension with CH and 2ℵ1=ℵ3. In particular a value λ≥κ++ is compatible with ZFC, while GCH asserts 2κ=κ+. (Higher Cohen forcing violates GCH at a regular cardinal, The Axiom of Choice)

[F3]

Externally, Con⁡(ZFC) implies Con⁡(ZFC+¬CH) and Con⁡(ZFC+¬GCH); the implication is a metatheorem obtained by applying a finite-fragment construction to any purported contradiction proof, and no PA proof of a uniform refutation transformer and no external transitive model is claimed. (Externally fixed-fragment relative consistency of not CH and not GCH)

[F4]

The aleph operation is strictly increasing, ℵα+1=ℵα+ is the least cardinal strictly above ℵα and is the successor cardinal of ℵα; every ℵα is an infinite cardinal, so ℵ2≠ℵ3 and both exceed ℵ1; in particular c=2ℵ0 is a cardinal. (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1, Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations, Cardinal (initial ordinal) and cardinality)

Refutation

technique · direct
1.1

First picture. [F1] gives Con⁡(ZF)⇒Con⁡(ZFC+GCH) by a proof transformation, so the finite fragments of ZFC+GCH are consistent whenever those of ZF are; in such a picture GCH holds, that is 2κ=κ+ at every infinite cardinal κ, so at κ=ℵ1 the value is 2ℵ1=ℵ1+=ℵ2.

F1F2F4
1.2

Second picture. Over a ground model of ZFC+GCH the cardinal parameters κ=ℵ1, λ=ℵ3 satisfy the hypotheses of [F2], since 2<ℵ1=ℵ1 and ℵ3ℵ1=ℵ3 under GCH; the extension by Add⁡(ℵ1,ℵ3) preserves all cardinals, keeps CH, and forces 2ℵ1=ℵ3.

F2F4
1.3

Choice is used, and only where stated. The forcing of the second picture is a ZFC construction: Add⁡(ℵ1,ℵ3) and its cardinal-preservation proof use the Axiom of Choice, and the identification of cardinals with alephs uses it as well; the first picture's relative-consistency theorem is a syntactic transformation that needs no choice in the metatheory.

F1F2F4
2.1

The two pictures disagree. One picture has 2ℵ1=ℵ2 and the other has 2ℵ1=ℵ3, and ℵ2≠ℵ3 because the aleph operation is strictly increasing; so the value of 2ℵ1 is not the same in all pictures of ZFC, and no single value of 2ℵ1 is a theorem of ZFC.

step 1.1step 1.2F4
3.1

By step 2.1 the claim is false at the regular cardinal ℵ1, and by [F3] the negative consistency statements are exactly the kind of metatheorem that records such failures; nothing here infers the existence of an external transitive model from Con⁡(ZFC), and no independence or completeness claim beyond the two pictures is made. ∎

step 2.1step 1.3F3

5 · Examples, counterexamples and false statements

None yet.

Sources