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.
Easton's Theorem and Cardinal Invariants of the Continuum
1 · Prerequisites
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Arithmetization, Incompleteness, and Relative Consistency
- Binary Operations, Monoids, Groups and Subgroups
- Boolean Algebras, Stone Duality, and the Prime Ideal Theorem
- Borel and Analytic Sets, Perfect Sets, and Determinacy
- Cardinal Arithmetic, Cofinality and the Alephs
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Condensation, GCH, and Diamond in L
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Deduction, Soundness, Completeness, and Compactness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite-Support Iterations and Martin's Axiom
- Forcing Orders, Names, and Generic Extensions
- Formal Set-Theoretic Syntax, Structures, and Satisfaction
- Foundations of the Real Numbers for Analysis
- Large Cardinals, Measures, and Elementary Embeddings
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Outer Measure and the Caratheodory Extension Theorem
- Preservation, Cohen Forcing, and the Continuum
- Reflection, Absoluteness, and Elementary Submodels
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Set-Theoretic Trees, Delta Systems, and Diamond
- Sigma Algebras and Borel Sets
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Arithmetical Hierarchy and Post's Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Constructible Hierarchy and Inner Models
- The Forcing Theorem and Formal Consistency Transfer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Well-Founded Relations, Rank, and the Cumulative Hierarchy
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
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 , and regular and singular cardinals). Then the continuum function satisfies:
(a) ;
(b) whenever ;
(c) .
Clause (a) excludes values at most , clause (b) requires monotonicity, and clause (c) is König's stronger cofinality bound. Since (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , 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 .
Under the Axiom of Choice, for every cardinal , and . (Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: )
Under the Axiom of Choice, for every infinite cardinal . (Assuming the Axiom of Choice: for every infinite cardinal , and ; in particular )
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 )
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof technique: direct.
Proof
Assume [F4]. Let be an infinite cardinal. By [F1], is a cardinal and . Restricting to infinite regular gives clause (a).
Let be infinite regular cardinals. Every subset of is a subset of , so the inclusion is an injection; by the injection criterion of [F3], . Applying [F1] at and at turns this into , which is clause (b).
Clause (c) is [F2] at : for every infinite cardinal , in particular for every infinite regular one.
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 with and through König's theorem -- and no further selection is made in steps 1.2 and 1.3. ∎
Easton functions on regular cardinals
Definition
An Easton function is a function such that:
- is a set, or a definable class, of infinite regular cardinals (Cofinality , and regular and singular cardinals);
- is a cardinal for every ;
- is nondecreasing: whenever are in ;
- for every .
Because for every ordinal (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained), the last clause forces , so the values of an Easton function automatically satisfy the strictness ; 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 itself is one of the classes; there 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 . 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 .
The Easton-support product of higher Cohen forcings
Definition
Let be an Easton function (Easton functions on regular cardinals). A condition in the Easton-support product is a function with values in whose domain is a set of triples with , and , subject to the Easton support condition
Each coordinate carries the Cohen order (Cohen, collapse, and Lévy-collapse forcing orders), so the fibre is a partial function of domain size . A condition is stronger than , written , exactly when : stronger conditions extend functions, and the empty function is the largest condition. When is a set, is a set; when is a proper class, is a proper class and its conditions are still sets. The support condition at gives for every .
For an infinite regular (Cofinality , and regular and singular cardinals), the initial segment and the tail are the restrictions
with and . 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 , and both maps preserve extension. This proves the isomorphism of forcing orders. is the Easton product of the fibres with , the Easton product of the fibres with , and both split by first coordinate exactly as displayed.
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 . For each , let be the set-sized second-name carrier specified in Finite-support forcing iterations, and require a supplied with a largest condition of the nonempty preorder . The recursion satisfies:
- is the trivial order, and 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 on with , , and for every , whose non-top support meets in fewer than elements for every infinite regular (Cofinality , 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 , including the final , is a set: at a limit it is a definable subset of the set of functions with values in the supplied carriers . 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 -levels are built by recursion inside the ground model and need not be isomorphic to any , 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.
Easton head chain condition and tail closure
Statement
Work in ZFC and assume the Generalized Continuum Hypothesis, that is for every ordinal (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ). Let be an Easton function and let be an infinite regular cardinal. Write , and as in The Easton-support product of higher Cohen forcings. Then:
(a) ;
(b) has the -chain condition, that is, every antichain of has cardinality below (Closure, distributivity, and chain conditions for forcing orders);
(c) is -closed: every descending sequence of conditions of with has a common lower bound in ; indeed every set of at most pairwise compatible conditions of has a common lower bound in ;
(d) the factorization holds: for a set-sized it is an isomorphism of the whole orders, and for a class Easton function it holds for every set-sized condition, with a set.
Facts & Assumptions
Given: ZFC + GCH, an Easton function , an infinite regular cardinal , and the Easton product with its head and tail .
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 , every family of many below- subsets has a -sized delta subsystem. (Generalized delta systems for small supports)
A delta system with root is a family whose pairwise intersections are exactly . (Delta systems and roots)
is -cc when every antichain of 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)
is the least cardinal above , and is the supremum of the with ; each infinite cardinal is an . (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and )
For a regular infinite one has , so the supremum of fewer than ordinals below is again below . (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained)
For cardinals with infinite, ; also when , whereas . (Absorption: for cardinals with infinite and , , and when )
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 )
A condition of is a partial function on triples with , , , values in , with fewer than triples having first coordinate for every infinite regular ; stronger conditions extend functions, and splits conditions by first coordinate. (The Easton-support product of higher Cohen forcings)
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof technique: direct.
Proof
Under GCH every infinite cardinal satisfies , by [F4]. If , then . If for an infinite cardinal , then GCH gives and monotonicity gives for every , so again . If is a limit cardinal above , the successor cardinals for infinite are cofinal in , while each is at most ; thus . These cases prove clause (a) for every infinite regular .
Now let be a descending sequence in with , and put . The conditions form a -chain of functions, so is a function with values in , and every triple in its domain has first coordinate . Fix an infinite regular and let . Each by [F8], and . Regularity of gives , so (with the finite or empty cases immediate). For the set in question is empty. Hence and extends every , so 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.
Consequently for every set with , and by [F6]; with Choice [F9], this bounds a union of many sets each of size at most by .
We prove clause (b) by contraposition. Suppose is an antichain with . By the support condition of [F8] at the regular cardinal , every has . For any fixed domain there are at most bit assignments. Thus there are distinct domains, since otherwise Choice [F9] and would bound by . Select one condition for each distinct domain. Now [F1] applies with , of step 1.1 and yields of size and a root with for distinct , in the sense of [F2].
The map takes at most values on by step 2.1, and a union of many classes each of size at most has size at most ; since , two distinct have .
For such the union is a function, because the domains meet exactly in and the two agree on ; all its triples still have first coordinate . Let be an infinite regular cardinal with and let and similarly . By [F8] both have cardinality below , and by [F6], the case of finite cardinalities being immediate since is infinite. Hence satisfies the support condition at every regular , and the bound at also implies the bound at every regular . Thus it is a condition of extending both and . This contradicts the antichain property of , so no antichain of has cardinality : every antichain has cardinality below , which is clause (b) by [F3].
Every condition of splits uniquely as 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 and 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 is an isomorphism when is a set, and for a class Easton function the same computation applies to each set-sized condition; 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] ∎
A closed Easton tail adds no short sequences across its chain-condition head
Statement
Work in ZFC. Let be a transitive ground model of ZFC, let be an infinite cardinal of , and let be nonempty set-sized forcing preorders. Suppose, as computed in , that is -closed and is -cc: every descending -sequence of length below has a common lower bound, and every pairwise-incompatible subset of has cardinality below (Closure, distributivity, and chain conditions for forcing orders, Forcing preorders, compatibility and filters).
For every -generic filter on and every with , one has (Valuation of names and M[G]). Thus the factor adds no new -sequences of ground-model elements, subsets of , or cofinal maps from to ground-model ordinals over the head extension . The 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, is the closed tail and 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 , the cardinal , the closed preorder , the cc preorder , the product generic , and in .
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)
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)
Forcing is monotone, its relation for any fixed formula is definable in , and the truth lemma holds. The existential-name clause and the atomic membership clause for give dense ground-value decisions below a condition forcing a coordinate to lie in a ground set . (Monotonicity, density, and decision for forcing, Forcing theorem, Forcing relation for all formulas, Atomic forcing relation, Check names without a largest condition)
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)
Transfinite recursion builds set-length sequences; Choice inside well-orders the relevant ground sets and selects the witnesses used below. (Transfinite recursion, The Axiom of Choice)
Proof
Choose a -name with , and put . By [F4], . Every value belongs to and has rank below ; transitivity of therefore puts it in the ground set . The product extension satisfies ZFC by [F4], so the truth lemma supplies forcing that is a function from into . We will only use forcing below .
Form the cones and in . They are nonempty. Every descending sequence in of length below has a lower bound still in (include when the sequence is empty); every pairwise-incompatible subset of is one of , so is -cc. Here a maximal antichain of means a pairwise-incompatible subset such that every member of is compatible with some member of . This agrees with maximality by inclusion: a condition incompatible with all of could be added, and conversely.
For each let be the set of for which there are a maximal antichain and such that for every . The coordinate notation abbreviates the fixed first-order formula saying that has value at ; no function-value term is added to the forcing language. This forcing relation is definable in , and and range over ground sets, so Separation gives . Monotonicity makes downward closed in .
Fix . Recursively, for , suppose has been chosen with the descending and the pairwise incompatible. If is maximal in , stop. Otherwise choose incompatible with every member of . Closure gives below and every preceding , since their number is below . Because forces that the value of at lies in , the existential-name clause first gives, densely below , a name forced to be that value and to belong to . The atomic membership clause for then gives a further pair and forcing , hence . In particular remains incompatible with all earlier . The selected triples lie in the ground set ; Choice in well-orders this set and makes the recursion deterministic. No choice from the proper class of all names is needed.
The recursion stops at some : otherwise the distinct , , form a pairwise-incompatible subset of of size . At the stopping stage is maximal. Closure supplies below and every for . Monotonicity then gives for all , so and witness . Thus every is dense open in .
The intersection belongs to and is dense open in . Indeed, starting below any , use [F5] to meet 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 .
The projection is -generic for : if is dense in , then is dense in and the product generic meets it. To meet the cone-dense set , use the global dense set : if is compatible with , first strengthen into and then into . Since and a filter cannot contain incompatible conditions, . Fix . Choice in selects, for all , witnesses to ; their full sequence belongs to .
Similarly is -generic for . For each , the downward closure of is dense in : compatibility with a member of the maximal antichain yields a common stronger condition. Lifting this cone-dense set to by adjoining conditions incompatible with shows that meets it. Upward closure then gives some , and downward directedness makes unique because distinct members of are incompatible.
For each , forces , so the truth lemma gives . The ground sequence and belong to , which satisfies ZFC by [F4]. Its Separation and Replacement therefore construct there. This function is , hence . Characteristic functions and cofinal maps are special cases of such sequences, proving the stated relative conclusions. ∎
Set-sized Easton forcing preserves cardinals and cofinalities
Statement
Assume the Generalized Continuum Hypothesis, that is for every ordinal (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ). Let be a set-sized Easton function (Easton functions on regular cardinals), let be a transitive ground model of ZFC, and let be -generic for the set-sized Easton product of The Easton-support product of higher Cohen forcings.
Then and the generic extension have the same ordinals, the same cofinality function, and the same cardinals: for every ordinal , (Cofinality , and regular and singular cardinals), and every -cardinal remains a cardinal of .
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 , a transitive ground model of ZFC, and an -generic filter for .
Under GCH the successor cardinals satisfy ; every singular cardinal is a limit cardinal, so the smaller cardinals are cofinal in it. (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and , ; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained)
For every infinite regular , the head has the -chain condition, the tail is -closed, and . (Easton head chain condition and tail closure)
For a transitive ZF model containing a forcing order and its order, a filter is -generic when for every dense with , a set being dense when below every condition it contains a stronger one. (Dense open sets and generic filters over a model)
If a set forcing is -closed and is -cc, then every function in already lies in . (A closed Easton tail adds no short sequences across its chain-condition head)
If is regular and is -cc, then forcing with preserves every ground-model cofinality at least and every ground-model cardinal at least . (Chain conditions preserve high cofinalities and ccc preserves cardinals)
at every ordinal; a cofinal map of length may be taken strictly increasing; an infinite cardinal is regular exactly when . (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, Cofinality , and regular and singular cardinals)
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)
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof
Fix the data of the statement, so that are transitive models with the same ordinals and , and let be an ordinal.
For every infinite ground regular cardinal the factorization holds in . The coordinate projections and of are -generic: if is dense and , then the set of conditions with is dense in and lies in , so meets it and meets ; the same computation with a dense handles the tail. Hence .
Every ground regular cardinal remains regular in . Suppose is infinite and regular in but not in , and let with a cofinal in . Then is an infinite regular cardinal of and hence also of : if then would contain a cofinal map by [F7], making singular in . So is an infinite regular cardinal of with , and by step 1.2 the lemma [F4] applies with the -closed tail and the -cc head , giving . Thus , while [F5] at gives , a contradiction.
Every ground cardinal remains a cardinal of . Suppose not, and let be the least ground cardinal with . By step 2.1, cannot be regular in : 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 . A bijection in restricts to an injection , since and is an ordinal of ; hence , a contradiction.
All ground cofinalities are preserved. Let and fix a strictly increasing cofinal in , so that because still has unbounded range in . If , take a cofinal in and define in by letting be the least with . Then has cofinal range in : given , cofinality of gives with , hence and by strict increase of . So would hold, contradicting step 2.1 since is ground regular; therefore .
Steps 3.2 and 3.1 show that and have the same ordinals, the same cofinality function on the ordinals of , and the same cardinals, which is the statement. ∎
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 and ); let be an Easton function (Easton functions on regular cardinals) and let be an infinite regular cardinal of with . Write for the head of the Easton product at (The Easton-support product of higher Cohen forcings).
Then , and there are at most nice -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 and with ; the zero exponent has value .
Facts & Assumptions
Given: ZFC + GCH, an Easton function , an infinite regular cardinal with , and the head of the Easton product.
Under GCH for every ordinal , and cardinal arithmetic uses Choice. (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and )
An Easton function has cardinal values, is nondecreasing, and satisfies for every ; hence and for in . (Easton functions on regular cardinals)
A condition of is a partial function on triples with , , and values in , with fewer than triples of first coordinate for every infinite regular , and splits conditions by first coordinate into the head and the tail. (The Easton-support product of higher Cohen forcings)
Under GCH the head has the -chain condition, that is, every antichain of 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)
A nice -name for a subset of a ground-model set is a name with each an antichain. (Nice names for subsets of a ground-model set)
Cardinal exponentiation satisfies and and is monotone in the base and in the exponent for nonzero base, and for cardinals with , infinite, and when , while ; 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 )
; a cofinal map of length may be taken strictly increasing; an infinite cardinal is regular exactly when . (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, Cofinality , and regular and singular cardinals)
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof
Preliminary computation: if is a cardinal and is a cardinal, then ; consequently whenever . Fix a cofinal sequence of ordinals below . A function has bounded range because , so its range lies in some . Let and . Under GCH, . Thus by Choice and cardinal absorption; the reverse inequality follows from constant functions. The case has value and does not affect the displayed supremum, which includes .
Write for each with ; all block indices below are restricted to these . A condition is a partial bit function on satisfying the Easton support bounds. In particular, the graph of its -block is a subset of of size below . There are at most indices , , and by [F4] every antichain of the head has cardinality at most .
: for each the singleton bit condition satisfies every Easton support bound. These conditions are distinct, giving the lower bound.
: by step 1.2 the graph of each -block has size below , so the number of possible blocks is at most by step 1.1 and absorption; the term for is . Here the cofinality of exceeds . Coding a condition by its at most blocks therefore gives .
Steps 2.1 and 1.3 give injections in both directions between and , so by antisymmetry of cardinal comparison.
There are at most nice -names for subsets of : by [F5] such a name is coded by the function is an antichain sending , and two such functions that differ at an with give different names, since then either or contains some and lies in exactly one of the two names; by step 1.2 every antichain has cardinality at most , so there are at most antichains by steps 3.1 and 1.1, and at most 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].
Steps 3.1 and 4.1 give and at most nice -names for subsets of , which is the statement. ∎
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 and ), let be a transitive ground model of ZFC, let be a set-sized Easton function (Easton functions on regular cardinals) and let be an -generic filter for the set-sized Easton product (The Easton-support product of higher Cohen forcings).
Then:
(a) and have the same ordinals, the same cofinality function and the same cardinals; and
(b) in the continuum function on is realized by : for every , , the ground-model cardinal being still a cardinal of .
The proof is the source's realization computation: the head alone carries every subset of in the extension and has at most nice names for them, while the many -columns of the generic are pairwise distinct by density.
Facts & Assumptions
Given: GCH, a transitive ground model of ZFC, a set-sized Easton function , and an -generic filter for .
and have the same ordinals, the same cofinality function and the same cardinals, and every -cardinal remains a cardinal of . (Set-sized Easton forcing preserves cardinals and cofinalities)
An Easton function has cardinal values, is nondecreasing, and satisfies for , so and . (Easton functions on regular cardinals)
For every infinite regular : has the -chain condition, is -closed, and with head and tail , both sets when is set-sized. (Easton head chain condition and tail closure)
A condition of is a partial function on the triples , , , , values in , with fewer than triples of first coordinate for every infinite regular , ordered by reverse inclusion; a condition of the head therefore has fewer than triples, and the fibre at is . (The Easton-support product of higher Cohen forcings)
A filter is -generic when for every dense with , a set being dense when below every condition it contains a stronger one. (Dense open sets and generic filters over a model)
If a set-sized forcing is -closed and is -cc, then for every -generic and every with one has ; in particular the -factor adds no new subsets of over the intermediate head extension . (A closed Easton tail adds no short sequences across its chain-condition head)
Under GCH, for every : , and there are at most nice -names for subsets of . (GCH counts Easton head conditions and subset names)
Every -name forced to be a subset of a ground-model set is forced equal to a nice name, that is, to a name with each an antichain. (Nice-name reduction and the ccc counting bound, Nice names for subsets of a ground-model set)
For each fixed formula the forcing relation is definable from and the name parameters over , implies for every -generic , and every element of is the value of a name in . (Forcing theorem, Forcing names and their rank, Check names without a largest condition)
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof
Fix . Then is an infinite regular cardinal, is a ground cardinal with and by [F2], and by [F1] the models have the same ordinals, cofinality function and cardinals, so keeps its cofinality and is still a cardinal of .
The head and the tail are the factors of at : with -closed, -cc and both set-sized [F3, F4]. The coordinate projections and of are -generic: if is dense and , then is dense in and lies in , so meets it and meets , and symmetrically for the tail; hence .
: let with . Its characteristic function is a function in , so by [F6] applied to the pair , of step 1.2. By [F9] there is a -name with . Form in the usual name for ; the top condition forces , and . By [F8] there is a nice -name with . By [F7] the set of nice -names for subsets of has at most elements in , and is a cardinal of by step 1.1, so the assignment the ground well-order-least such , which is defined in using the well-order that [F10] gives in , is an injection of the subsets of in into . Hence .
: for each form the -name . Its value is a subset of . For each , the head conditions deciding the coordinate are dense, so belongs to exactly when the generic column at has bit . For distinct and any head condition , choose not occurring in any triple of , possible since . Then is a head condition stronger than with ; adding these two coordinates also leaves the support bounds below intact. The condition forces and . Thus the head conditions forcing are dense. By [F9] the map is an injection of into in , and .
Steps 2.1 and 2.2 and the fact that is a cardinal of give for the fixed , and was arbitrary, so the continuum function on is realized; step 1.1 gives the preservation clause (a). This is the statement. ∎
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 such that:
- (sets) is a countable transitive set with , that is, ZFC together with for every ordinal (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and );
- (classes) is a countable collection of subsets of , the classes of the ground, containing all -definable subsets with set parameters, every set of (identified with its -elements), and the set itself; complements relative to and finite intersections belong to by comprehension below;
- (comprehension) for every formula of the two-sorted language whose bound variables range over sets only, and all parameters and , is a class in ; class quantifiers are thus never used in comprehension, and every class of is a subset of ;
- (class Replacement) if is a functional class and , then the image is an element of , so set-indexed class images are sets;
- (Global Choice) there is a class that well-orders all of 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 .
The set part 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 , arising as a class of via a fixed definition with set parameters (Easton functions on regular cardinals), that is defined on every infinite regular cardinal of , takes cardinal values, is nondecreasing, and satisfies for every infinite regular . The Easton class product is the class of conditions of The Easton-support product of higher Cohen forcings for this ; it is a class of , and each of its conditions is a set of , while itself is not a set of .
Finally, an -generic filter for the class product is a filter (nonempty, upward closed and directed under the order , a condition being stronger the larger its domain) such that for every that is dense in . It is part of this hypothesis that such a is available externally: since and are countable, and the dense classes in question form a subcollection of the countable , 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 : take , the subsets definable over with set parameters. Substituting the finitely many definitions of class parameters proves elementary comprehension; for a definable functional class, Replacement in gives its image on each set. The constructible well-order is definable in , providing Global Choice. There are countably many formulas and finite tuples of parameters from , so is countable. GCH holds in because 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.
Set-stage names and the forcing truth lemma for the Easton class product
Statement
Let be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), let be a definable Easton class function, let be the Easton class product and let be an -generic filter on . For an infinite regular write for the head, and for the set-forcing extension (Valuation of names and M[G]).
Then:
(a) Stages. For every infinite regular the head is a set of , is an -generic filter on , and for .
(b) Names. Every condition of lies in for some infinite regular ; call a set a -name if it is a -name (Forcing names and their rank) for some infinite regular . Every individual -name is a set of , the predicate " is a -name" is definable in from , and the -names are exactly the members of the class ; for each fixed , itself denotes an internally proper class of , not an element of containing all names.
(c) Valuation. For a -name and any infinite regular with , set (Valuation of names and M[G]). This value is independent of , and with a -name every element of is the value of a -name and each is contained in .
(d) Definable forcing and the truth lemma. For a fixed membership formula , define for and -names by the clauses of Atomic forcing relation and Forcing relation for all formulas, read with the class in place of a set preorder and with "name" meaning "P-name" as in (b). Then the relation is a class of , definable in from and by a single formula for each fixed , and it satisfies the truth lemma
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 meets every dense class of the ground.
Facts & Assumptions
Given: A GBC + Global Choice + GCH ground , a definable Easton class function , its class product , and a filter meeting every dense class in .
Class comprehension with set quantifiers and class parameters, class Replacement, Global Choice, and set-level ZFC + GCH hold in ; is a class in . (Class-theoretic ground assumptions for Easton forcing)
Every is a set condition, is a set, and the restrictions split 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)
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)
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])
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)
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)
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
Set stages. For every infinite regular , by [F2]. If is dense in that head, the class belongs to by [F1] and is dense in : below , choose in and take . Thus meets . Because restriction of a member of is weaker and hence also belongs to , meets . Restrictions of common extensions show that is directed; it is upward closed in the head, so it is -generic. For , and .
Names. Every has a set of first coordinates, bounded by some infinite regular , and therefore belongs to . For a set , the assertion that there is a regular for which is a -name is a first-order assertion over with parameter : the order is a set uniformly defined from , and the set-name predicate is uniform by [F3]. Comprehension [F1] makes the -names a class in . Each such name is individually a set of ; for each fixed , the collection of all names is internally a proper class of (it includes for every ). No element of containing all names is used.
Atomic reduction to a set head. Suppose are infinite regular, are -names, and . In the factorization , the set-forcing atomic clauses give for . 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 projects to a condition below , and every head condition below lifts by union with . 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.
Meeting a dense class below a condition. If and is dense below , then is a dense class in : a condition incompatible with is already in it, while a compatible one has a common extension with and then an extension in . Genericity makes meet this union. Directedness prevents any member of from being incompatible with , so . The cone itself is not claimed dense in all of .
Valuation. The name classes increase with the heads: a -name remains a -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 from step 1.1 and induction in the valuation recursion [F4] yield . Hence is independent of stage, the set extensions are nested, and is precisely the class of values of -names.
The same rank induction works with the full class product in place of . For , choose a regular containing ; every class condition projects to , and every head condition below lifts by union with . A witness below an arbitrary lifts with . Thus the atomic clauses read with the class define exactly . 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 with class parameter , so its extension belongs to 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.
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 -name predicate of step 1.2. All these are set quantifiers with class parameter , so finite induction on the fixed formula and comprehension [F1] give one defining class in 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.
Atomic truth. Fix atomic and a regular containing all its names. Their values in equal their values in by step 2.1. If is true there, the set-forcing truth lemma [F6] supplies forcing it in the head; step 2.2 makes . Conversely if forces the atom in , enlarge to include ; then forces it in the set head by step 2.2, so [F6] gives its truth in the head and hence in .
Connectives. Induct on a fixed formula, the atomic case being step 3.2. For conjunction, if both conjuncts are true, their induction witnesses have a common stronger member , which forces both by monotonicity from step 3.1. The converse follows from the two induction soundness directions. For negation, the class 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 meets . If is false in , the induction soundness direction excludes the positive side of this meeting, leaving some that forces . Conversely if forces but were true, induction would give forcing ; a common extension of in would force , contrary to the negation clause.
Existential quantifier. If , choose a witness by step 2.1. Induction gives forcing ; monotonicity makes the matrix hold below every , so the existential forcing clause gives . Conversely suppose forces the existential. The class belongs to by step 3.1 and is dense below by the existential clause. Step 1.4 gives and a witnessing name ; induction yields and hence the existential.
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). ∎
Uniform head-antichain decisions below a class tail
Statement
Let be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), a definable Easton class function with class product and an -generic filter, and let be an infinite regular cardinal of (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 and a ground sequence of tuples of -names.
A tail condition decides on when for every there is a maximal antichain such that for every the condition forces or forces its negation. If has the form , each positive cell also carries a ground set name with .
Then:
(a) The class of conditions that decide on is dense in , open, and a member of ; hence some decides it.
(b) For such , every decision is confirmed at the level of the head: for each the unique has in the class filter, so the truth value of in is the value recorded at , and the set , together with the sets of head antichains and decisions, belongs to .
(c) For an outer existential formula, the witness names attached to its positive decisions form a ground set , and there is an infinite regular of with ; consequently 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 , the class product , an -generic filter , an infinite regular , an ordinal , a formula and a ground sequence of tuples of -names.
is closed under comprehension with set quantifiers and class parameters, , class Replacement holds, meets every class of that is dense in , and Global Choice supplies class choices. (Class-theoretic ground assumptions for Easton forcing)
is a set with the -chain condition, is -closed, and with ; 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)
The class forcing relation is defined over the class of -names by the atomic and formula clauses, is a class of definable from and , and satisfies the truth lemma . (Set-stage names and the forcing truth lemma for the Easton class product)
The formula clauses are: iff no forces ; iff below every there are and a name with ; iff both. (Forcing relation for all formulas, Atomic forcing relation)
Forcing is monotone and decidable: and imply , and every condition has a stronger one forcing or forcing . (Monotonicity, density, and decision for forcing)
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)
Ground AC is assumed: every set-indexed family of nonempty sets has a choice function (The Axiom of Choice). Since and each head is a set forcing with an -generic filter, every head extension satisfies ZFC, including AC, Separation and Replacement. (Generic extensions satisfy ZF and preserve ground-model Choice)
Proof
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 : 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 . 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 and belongs to by [F1]; the set-indexed choices and antichains are supplied by Global Choice and class Replacement in [F1] and ground Choice [F7].
Iterating step 1.1 along the many indices: given good for all , apply step 1.1 to and to get 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 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 of tail conditions deciding on is the intersection of the many open dense classes, it is open and in , and it is dense in : given , build a descending sequence with good for all by recursion of length , taking lower bounds at limits by -closure, and a lower bound of the whole sequence is in by openness.
The class is dense in and lies in , because below any the class supplies a tail condition and then has its tail in ; so by the genericity of there is with , and by [F6] is a directed filter in the tail.
Confirmation and definability in the head stage. Fix from step 3.1 and . The antichain and the decisions are ground sets, hence lie in ; since is an -generic filter on [F6] and is a maximal antichain of , there is exactly one , and uniqueness uses directedness of the filter and pairwise incompatibility inside the antichain. The condition is extended by an element of : any common extension of and in is below it, so by [F3] and [F5] the truth value of in is exactly the value recorded at , and the recorded value is a formula of with the ground parameters and the decision function; consequently the set is defined in 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.
The witness names. The witnesses attached in step 4.1 are names of and they are indexed by the set , which is a set of because each is a set of cardinality at most by [F2] and ; by Replacement in [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 ; then by the stage valuation of [F3] and Replacement in the set extension [F7], which is the last clause.
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. ∎
Separation and Power Set in the Easton class extension
Statement
Let be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), a definable Easton class function with class product and an -generic filter (Set-stage names and the forcing truth lemma for the Easton class product).
Then satisfies the Separation scheme, formula by formula with set parameters, and for every there is an infinite regular of with such that every subset of in lies in and the power set is an element of . In particular every subset of an ordinal of that belongs to already belongs to a single set stage, and Power Set holds in .
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 , the class product , an -generic filter , and a set .
Stages, names, valuation and truth lemma: every element of is for a -name , stages are nested set-forcing extensions, and with a definable class relation. (Set-stage names and the forcing truth lemma for the Easton class product)
Uniform decisions: for a fixed formula, an ordinal and many ground tuples of head names, there is a tail condition together with maximal antichains and recorded decisions such that the truth value of each instance in is the value recorded at the unique ; the decision data lies in , and the attached witness names lie in one stage . (Uniform head-antichain decisions below a class tail)
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)
The head has the -chain condition and the tail is -closed; the middle factor of the factorization is -closed by the same union computation: for each regular support bound , a union of compatible supports of size below has size at most . (Easton head chain condition and tail closure, The Easton-support product of higher Cohen forcings)
For stages , splits conditions by first coordinate into two set-sized factors, and is a transitive model of ZFC with the same ordinals as 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)
The Axiom of Choice, hence every ground set is well-orderable and can be enumerated. (The Axiom of Choice)
Proof
Fix with for an infinite regular [F1]. Choose an infinite regular with , possible because the ground has arbitrarily large regular cardinals, and enumerate using [F6]. Let . Since is a head name, the valuation clause of [F1] gives ; the activity set and lie in by Separation and valuation there, and .
Separation. Let be a fixed formula with parameter names naming elements of ; enlarging if necessary, we may assume the parameters also lie in [F1]. Apply [F2] with the tuples , , to get and maximal antichains with decisions; the decision data lie in . For each let be the unique member met by the generic head, and let . The activity set is in the head stage by step 1.1, and the decision data and the enumeration are there too, so and are sets of the ZFC head stage [F5]. By [F2] the recorded value is the truth value of in , and step 1.1 says the active enumerate exactly . Thus this set is , which proves Separation.
Power Set. Let with . Choose an infinite regular with [F1] and define the membership code if and otherwise, for ; extend it to by for and read as a function into . Both and lie in because and the enumeration do. In the factorization of [F5] the second factor is -closed by [F4] and the first is -cc by [F4], so [F3] gives and hence . Therefore is a set of by Replacement there, again using [F5]. As was arbitrary, every subset of in lies in ; since by step 1.1 and , this says , which is Power Set for .
Steps 2.1 and 2.2 prove Separation and the bounded power-set clause for the arbitrary ; applying the clause with an ordinal of gives the subset clause, and since every set has its -power set inside some stage, Power Set holds in . This is the statement. ∎
Replacement in the Easton class extension
Statement
Let be a GBC + Global Choice + GCH ground, a definable Easton class function with class product and an -generic filter (Class-theoretic ground assumptions for Easton forcing, Set-stage names and the forcing truth lemma for the Easton class product).
Then satisfies the Replacement scheme: for every fixed formula and all set parameters , if for some , then the image is a set of ; indeed it is contained in the value of a ground set of witness names lying in one stage .
Facts & Assumptions
Given: a GBC + Global Choice + GCH ground, a definable Easton class function , the class product , an -generic filter , a fixed formula , parameter names and a set .
Stages, names, valuation, definable class forcing and truth lemma for . (Set-stage names and the forcing truth lemma for the Easton class product)
Uniform decisions with witnesses: applied to the formula and the tuples for a ground enumeration of with , there are and maximal antichains such that each cell carries a recorded truth value and, when positive, a ground set name with ; the truth values are computed in and all witness names lie in one stage . (Uniform head-antichain decisions below a class tail)
Separation and the bounded power-set clause hold in , and each is a transitive model of ZFC with the same ordinals as 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)
The Axiom of Choice, so ground sets can be enumerated and images formed. (The Axiom of Choice)
Proof
Fix , choose an infinite regular above the stages of and with , and enumerate [F4]; then and by the valuation and stage clauses of [F1]. Assume . This assertion concerns only the active values ; a name in whose coefficient is not met by may have a value outside .
Apply [F2] to the formula and the tuples , obtaining , maximal antichains and, for every cell with a positive recorded value, a ground name with . Put , a ground set indexed by the set [F3, F4]; by the last clause of [F2] there is an infinite regular with , and then by [F1].
Every actual value lies in that image. Let and let be the unique element of with . The truth value of the existential instance was decided on the antichain by the unique from [F2]. Its recorded value cannot be negative: then a condition of extending would force , contradicting soundness in the actual extension and the existence of . Hence the positive cell carries and forces . Soundness gives , so uniqueness yields . Thus the image is a subset of this set and is itself a set of by Separation [F3].
Replacement follows since , the parameters and 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 : this is the statement. ∎
The Easton class-generic union satisfies ZFC
Statement
Let be a GBC + Global Choice + GCH ground, a definable Easton class function with class product and an -generic filter (Class-theoretic ground assumptions for Easton forcing, Set-stage names and the forcing truth lemma for the Easton class product).
Then is a transitive model of ZFC containing and having exactly the ordinals of , the class forcing relation satisfies the truth lemma in it, and for every ordinal of every subset of in belongs to a single set stage: there is an infinite regular with .
Facts & Assumptions
Given: a GBC + Global Choice + GCH ground , a definable Easton class function , the class product and an -generic filter .
, the stages are nested, every element of is the value of a -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)
Separation, Power Set and the bounded power-set clause hold in . (Separation and Power Set in the Easton class extension)
Replacement holds in . (Replacement in the Easton class extension)
Each stage is, via the regular-open completion of the set forcing , a transitive model of ZFC having exactly the ordinals of and satisfying Choice, and 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)
Every element of is 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)
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
Transitivity and ordinals. If , then for some pair by the valuation clause of [F1], so and is transitive; and every equals its check-name value in by [F5], so . Each stage has exactly the ordinals of by [F4], and the stages are nested by [F1], so the ordinals of are exactly those of .
The easy axioms. Extensionality and Foundation are inherited from the ambient universe because is transitive and its membership relation is the true one; Infinity holds because by step 1.1. For Pairing and Union, given , choose by [F1] a single stage containing all of them, possible because the stages are nested and every element lies in some stage; then and are elements of that ZFC model by [F4] and hence of . Choice holds because each stage satisfies it by [F4] and [F6], so every element of carries a well-ordering in , and the well-orderable sets of an extension form a model of Choice.
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 a transitive model of ZFC containing with the same ordinals and the truth lemma of [F1]. Applying the bounded power-set clause of [F2] to the ordinal gives an infinite regular with , which is the last clause.
Steps 1.1, 2.1 and 3.1 establish every clause: is a transitive ZFC model containing with the ordinals of , 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. ∎
Easton's theorem for regular cardinals
Statement
Let be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), let be a definable Easton class function defined on every infinite regular cardinal of (Easton functions on regular cardinals), and let be -generic for the Easton class product .
Then the generic union is a model of ZFC containing , has the same ordinals, the same cardinals and the same cofinality function as , and at every infinite regular cardinal of . Consequently the three necessary conditions of Necessary constraints on the regular-cardinal continuum function, namely , monotonicity and 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 , a definable Easton class function defined on every infinite regular cardinal of , the class product and an -generic filter .
is a transitive model of ZFC containing with exactly the ordinals of , the class forcing relation satisfies the truth lemma, and every element of is the value of a -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)
For every infinite regular , the head is a set with the -chain condition, the tail is -closed, and the set-sized Easton product of the fibres with first coordinate . (Easton head chain condition and tail closure)
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)
If is a regular cardinal of 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)
For a set-sized Easton function on a set of regular cardinals, forcing with its Easton product over a ZFC + GCH ground realizes at every regular of the domain and preserves cardinals and cofinalities. (Set-sized Easton realization on regular cardinals)
In ZFC the continuum function at infinite regular cardinals satisfies , monotonicity and . (Necessary constraints on the regular-cardinal continuum function)
An Easton function has cardinal values, is nondecreasing, satisfies , and for every , here the class of all infinite regular cardinals of . (Easton functions on regular cardinals)
GCH in the ground means 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 and , Class-theoretic ground assumptions for Easton forcing)
The ground-model Axiom of Choice is a hypothesis (The Axiom of Choice); an infinite cardinal is regular exactly when , and cofinality has the basic bounds and increasing witnesses used below (Cofinality , and regular and singular cardinals, ; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained).
Proof
By [F1] and have the same ordinals; fix an infinite regular of . The head is a set-sized Easton product with the -chain condition and the tail is -closed [F2]. Any subset of in has a name in a set stage for some infinite regular [F1], and the factorization has -closed second factor and -cc first factor, so [F3] puts the subset already in . The set-sized realization theorem gives in [F5]. Thus the full extension has the same set of subsets of as that head extension.
Every ground regular cardinal remains regular in : suppose is infinite and regular in but not in , and let with a cofinal in . Then is regular in and therefore in , since otherwise a ground cofinal map of shorter length would persist into ; so is an infinite regular cardinal of with . By [F1] the function lies in some stage with , and the factorization has -closed second factor and -cc first factor [F2], so [F3] gives and hence ; but [F4] at gives , a contradiction.
Every ground cardinal remains a cardinal of : suppose is the least ground cardinal with . By step 1.2, cannot be regular in , 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 , whereas a bijection in restricts to an injection , a contradiction. Hence all ground cardinals remain cardinals.
All ground cofinalities are preserved. Let for an ordinal of and fix a strictly increasing cofinal in ; then because is still cofinal in . If , take a cofinal in and define in by letting be the least with ; then is cofinal in , because for any cofinality of gives with , hence and by strict increase of . So , contradicting step 1.2 because is regular in ; therefore .
By step 1.1 the full extension and the head extension have the same subsets of each regular , and by step 2.1 remains a cardinal; hence . Steps 2.1 and 2.2 therefore give a ZFC model with the ordinals, cardinals and cofinalities of and with at every infinite regular cardinal; for the final clause, if satisfies the three necessary conditions of [F6] then is an Easton function in the sense of [F7] and the construction above realizes it, while conversely those necessary conditions must hold of 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. ∎
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 , monotonicity and (Necessary constraints on the regular-cardinal continuum function) are exactly the constraints that the construction can meet there. It makes no assignment of 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 for every , Cantor's theorem gives , and König's theorem gives (Necessary constraints on the regular-cardinal continuum function, Assuming the Axiom of Choice: for every infinite cardinal , and ; in particular ). In the GCH case , so Cantor's strict inequality gives . 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.
Almost inclusion, pseudointersections and towers
Definition
The definitions in this item work in ZF. As usual is the set of von Neumann naturals (The natural numbers (von Neumann)), a set is finite when for some , and is infinite when it is not finite (Finite, countably infinite, countable, uncountable, The cardinality of a finite set). An infinite has , but nothing below uses that. Write
for the set of infinite subsets of ; it is a set by Separation (The power set ) and it is nonempty, for instance . No cardinal comparison is needed to define the notions below.
Almost inclusion. For write
and say that is almost contained in . Here is the set difference (The difference , the symmetric difference , and the complement relative to a set ) and finiteness is the notion of Finite, countably infinite, countable, uncountable. Thus holds exactly when for some finite . Two sets are almost equal, written , when and ; equivalently when the symmetric difference is finite.
Pseudointersections. Let . A set is a pseudointersection of when for every . The family has the strong finite intersection property (SFIP) when is infinite for every and all . 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 , indexed by an ordinal , of infinite subsets of such that
that is, the family is decreasing in the almost-inclusion order , and such that the family has no pseudointersection.
Removing repetitions. Call new when for every , let be the set of new indices, let be the order type of and list increasingly as , and put . Then:
- is decreasing up to almost equality, and it is strictly decreasing: if , then and , so ;
- every member of the original family is almost equal to some : if and is the least with , then , since with would give and contradict the minimality of ;
- consequently a pseudointersection of the is almost contained in every , hence is a pseudointersection of the original family, and therefore the have none and is itself a tower.
So every tower contains a strictly decreasing tower of order type . The map injects into . For the following cardinal comparison assume AC (The Axiom of Choice): choose one representative from each almost-equality class to inject the quotient into , which has cardinality by The continuum is equinumerous with the power set of the naturals. Hence . This does not assert as ordinals: an ordinal may be longer than its initial cardinal.
There is a second normalization that preserves the lack of a pseudointersection. If is cofinal, meaning that for every some satisfies , restrict the tower to the indices in in increasing order. An infinite set almost contained in every selected would also be almost contained in every original : choose such an and use . Thus the restricted sequence is again a tower, with length the order type of , which need not equal its cardinality. Removing repetitions also leaves unchanged the family of sets almost contained in every member.
The quotient and its forcing order. Almost equality is an equivalence relation on , and the quotient 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
which is reflexive and transitive on and is well defined on almost-equality classes: if and then exactly when . Thus smaller infinite sets are stronger conditions, and the relation displayed by some sources as the weaker-than order, , 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 holds for distinct but almost equal sets.
Conventions for this page. In the items below, when a family is written together with the assertion that it is decreasing, the assertion is always that 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 says that is infinite, and for infinite this is not the same as : the disjoint sets the even numbers and the odd numbers satisfy and . 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 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.
A tower of size at most the continuum exists
Statement
In ZFC there is a tower of infinite subsets of whose length is at most (Almost inclusion, pseudointersections and towers for towers, almost inclusion and pseudointersections).
The construction below enumerates , keeps a running pseudointersection of the part of the family built so far, and at stage chooses one of the two infinite halves of that pseudointersection on which the -th set fails to be almost contained. If the running pseudointersection ever disappears the family built so far is already a tower; otherwise every one of the at most infinite sets is defeated by some member, and the whole family is a tower.
Facts & Assumptions
Given: the Axiom of Choice (The Axiom of Choice).
is the set of infinite subsets of ; means that is finite; a pseudointersection of a family is an with for every ; a tower is a family , indexed by an ordinal, of infinite sets with for and with no pseudointersection. (Almost inclusion, pseudointersections and towers)
The Axiom of Choice: every family of nonempty sets has a choice function; equivalently, every set is well-orderable. (The Axiom of Choice, The well-ordering theorem)
Transfinite recursion on a well-order produces the unique function satisfying a prescribed rule at each stage, the rule being a formula with set parameters. (Transfinite recursion)
Under AC, as cardinals, and whenever . (The continuum is equinumerous with the power set of the naturals, Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations)
Recursion on the natural numbers produces the unique function with a prescribed value at and prescribed successor step, and every nonempty subset of has a least element. (The recursion theorem, The natural numbers (von Neumann))
Proof
By [F2], is well-orderable. Let be its initial cardinal and choose a bijection from onto . This induces a particular well-order of the latter set, so "least" below refers to this enumeration. Since , [F4] gives . An arbitrary well-order of could have order type larger than and would not justify this bound.
For let be the increasing enumeration of , which exists by [F5] applied to the well-ordered set ; put and . Then and are infinite, disjoint, , and , . Consequently for every at least one of , holds: if both and were finite, then would be finite, contradicting .
Define, by transfinite recursion on ([F3]), values for , using the sentinel value for . Say that is free when for every . For a free let for every . If , set and ; if we set and at every later , so that the recursion is total on . If , let be the well-order-least member of and split it as in step 1.2, setting if , and otherwise; by step 1.2 one of the two cases applies, so is a well-defined infinite subset of with .
Let be the least such that either , or and . Such a exists because is an ordinal and the second alternative is decided for each ; and , since and hence by step 2.1 and the definition of .
For every the stage was free and , so , , , and for every ; hence for every , and the family is decreasing in the sense of [F1]. Moreover for every , and the family is a set, being the image of the ordinal under a definable function.
If , then , which by step 2.1 and the minimality of happened because : no satisfies for all . By step 4.1 the family is a decreasing family of infinite sets with no pseudointersection, that is a tower, of length .
If and some were a pseudointersection of , then for some by step 1.1, so ; but step 4.1 gives , a contradiction. Hence is a tower of length , again by step 4.1.
In the case step 5.1 exhibits a tower of length , and in the case step 5.2 exhibits a tower of length ; in both cases the length is at most . This is the statement. ∎
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. is the least cardinality of a family 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 with contains minus the union of the finitely many finite sets , and 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 as the least element of that set; the minimum is attained, so there is an SFIP family of size with no pseudointersection.
The tower number. is the least ordinal for which there is a tower of length , that is, a tower . By A tower of size at most the continuum exists there is such a tower of some length ; take the least member of the set of qualifying ordinals . Thus exists, is attained and satisfies . No assertion that every possible tower length is at most 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 , because its last member is almost contained in every earlier member and is itself an infinite pseudointersection. Hence is a limit ordinal. Put (Cofinality , and regular and singular cardinals). There is a strictly increasing cofinal map (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 to the indices : by the cofinal-subsequence argument in Almost inclusion, pseudointersections and towers, this remains a tower and has length exactly . Minimality gives , while by ; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, so . Since the cofinality of a limit ordinal is an infinite cardinal by that theorem, 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 , minimality gives , so:
- there is a tower that is strictly decreasing, that is, and whenever ;
- , by the existence construction above;
- is a regular cardinal, by the cofinal-subsequence argument above.
Equivalently, is the least number of distinct members in a tower. The strictly decreasing tower of length has exactly members. Conversely, if a tower has member set , removal of repeats gives a tower of order type with . Minimality gives as ordinals; because is an initial cardinal, this implies as cardinals. Thus no tower has fewer than 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 . Monk states the pseudointersection number as 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 , 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 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 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 .
Basic bounds for p and t
Statement
In ZFC, with and as in The pseudointersection and tower numbers,
and moreover every countable family of infinite subsets of with the strong finite intersection property has a pseudointersection, and every countable descending family 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 and ; a tower is an SFIP family with no pseudointersection, which gives ; and is the normal form of a shortest tower.
Facts & Assumptions
Given: the Axiom of Choice (The Axiom of Choice).
A pseudointersection of is an with for all ; has SFIP when every finite intersection of members is infinite; a tower is a decreasing family of infinite sets with no pseudointersection. (Almost inclusion, pseudointersections and towers)
is the least cardinality of an SFIP family with no pseudointersection, and the minimum is attained; is the least length of a tower, the minimum is attained by a strictly decreasing tower , and is a cardinal with . (The pseudointersection and tower numbers)
Every nonempty subset of has a least element, and recursion on defines the unique sequence with prescribed value at and prescribed successor step. (The well-ordering principle, The recursion theorem, The natural numbers (von Neumann))
Under AC every set has a cardinality, cardinals are comparable, and every family of nonempty sets has a choice function. (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, The Axiom of Choice)
Proof
Let be a sequence of infinite subsets of all of whose finite intersections are infinite, and set ; then each is infinite, and .
: by [F2] there is a strictly decreasing tower ; its member family has cardinality , since is injective. The family has SFIP: for the intersection contains minus the finitely many finite sets . It has no pseudointersection, because it is a tower. Hence some SFIP family without pseudointersection has size , and .
Recursively choose to be the least element of ; this is legitimate because is infinite and only finitely many elements have been removed, so the set is nonempty, and it has a least element by [F3]. Then and the are pairwise distinct, since .
is infinite by step 2.1, and for every : indeed whenever , so is finite. Hence is a pseudointersection of .
Now let be countable and have the strong finite intersection property. If , then is a pseudointersection and the claim follows. Otherwise list as a sequence , repeating one member if is finite; that is possible by [F3] and [F4], and the finite intersections of the are still infinite. Put ; each is infinite by SFIP, and the sequence has all finite intersections infinite, since . By steps 1.1, 2.1 and 3.1 applied to there is with for every .
Every countable descending family of infinite sets has a pseudointersection: reaching from earlier members removes only finitely many points, so satisfies , a finite set, and is infinite because is; the family therefore consists of infinite sets with all finite intersections infinite, and steps 1.1, 2.1 and 3.1 applied to it give with for every .
For each the pseudointersection of step 4.1 is almost contained in , hence has a pseudointersection.
: a tower of length 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 is a cardinal, is excluded, so .
: if has size below , then is finite or countably infinite and, when nonempty, can be listed as a sequence with repetitions if finite; if has SFIP then step 5.1 supplies a pseudointersection. Hence no family of size below has SFIP and lacks a pseudointersection, and since is a cardinal with an attained minimum, .
is clause [F2]. Combining steps 6.1, 1.2, 5.2 and 7.1 gives , and steps 5.1 and 4.2 are the two countable pseudointersection assertions. This is the statement. ∎
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 (von Neumann)). For put
and say that eventually dominates . The relation is reflexive and transitive. A family is
- -unbounded when there is no single with for every ;
- -dominating (equivalently -cofinal) when for every there is with .
The bounding number. is the least cardinality of a -unbounded family .
The dominating number. is the least cardinality of a -dominating family .
Both minima exist and are cardinals. The collection of candidate cardinalities for is the image under 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 , the function lies in and is not -below . The same argument shows the candidates for form a nonempty set of ordinals, because is -dominating, each 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 available. Thus
and the minima are attained, so there are an unbounded family of size and a dominating family of size .
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 for "eventually strictly below" and define and with ; the two readings give the same numbers, since replacing by turns -domination into -domination. Monk and Bartoszyński use exactly the definitions above, with as the largest candidate size.
Remarks
The set has cardinality 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 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 by its running maximum preserves both properties, since implies and pointwise. A dominating or unbounded family may therefore be assumed to consist of nondecreasing functions.
Basic bounding and dominating relations
Statement
In ZFC, with and the bounding and dominating numbers (Eventual domination and the numbers b and d) and the cofinality function (Cofinality , and regular and singular cardinals),
The right-hand bound is the observation that is a dominating family and has size ; the left-hand bounds are the countable pointwise-maximum argument; is the standard singular-cardinal contradiction; and partitions a dominating family of size along a cofinal sequence of length and diagonalizes against the non-dominating pieces.
Facts & Assumptions
Given: the Axiom of Choice (The Axiom of Choice).
means that for all but finitely many ; is -unbounded when no single lies -above every member, is -dominating when every lies -below some member, and are the least cardinalities of such families, the minima being attained. (Eventual domination and the numbers b and d)
; for a limit ordinal , is an infinite cardinal with , and there is a strictly increasing cofinal map . (Cofinality , and regular and singular cardinals, ; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, For every ordinal there is a least ordinal admitting a map with cofinal range, and that map may always be taken strictly increasing)
Under AC every set has a cardinality, cardinals are comparable, and every family of nonempty sets has a choice function. (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, The Axiom of Choice)
and ; ; ; and . (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations, Absorption: for cardinals with infinite and , , and when , Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: , The continuum is equinumerous with the power set of the naturals, The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and )
is a linear order on , so every nonempty finite subset of has a greatest element, and recursion on defines sequences with prescribed initial value and successor step. ( is a linear order on , Order on the natural numbers, The recursion theorem, The natural numbers (von Neumann))
Proof
Every countable family is bounded: given in , define as the greatest element of the finite nonempty set , which exists by [F5]; then for each and every one has , so . Hence no family of size at most is -unbounded, and since is a cardinal that is the least size of an unbounded family, , that is, .
No countable family is dominating: the empty family is not dominating, and any nonempty finite or countably infinite family can be listed as , repeating entries if necessary. Set , so for each one has whenever . Thus . An infinite cardinal is a limit ordinal, and [F2] gives .
: the map injects into , so by [F4] and is -dominating, since for every . Hence some dominating family has size at most , and .
: by [F2] , so suppose . By [F1] fix an unbounded family of size , and by [F2] fix a strictly increasing cofinal map from into . For each the subfamily has cardinality at most , so by the minimality in [F1] it is bounded: choose with for every (the choices are made by [F3]). The family has size at most , so it too is bounded; fix with for every . Every satisfies for some , because the map is cofinal, so and bounds the allegedly unbounded family, a contradiction. Hence and is regular.
: let be a dominating family of size by [F1], put , and fix a strictly increasing cofinal map from into by [F2]. For put ; then , the sets increase with , and . No is dominating, since is the least size of a dominating family, so by [F3] choose not dominated by any member of . The family is unbounded: if some satisfied for every , then by domination some satisfies , and for some , so contradicts the choice of . Therefore .
Steps 1.1, 1.2, 1.4 and 1.5 give , and step 1.3 adds ; together these are the displayed chain. This is the statement. ∎
The splitting and reaping numbers
Definition
In ZFC, with the infinite subsets of (Almost inclusion, pseudointersections and towers) and (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations):
Splitting. For , say that splits when both and are infinite. A family is a splitting family when every is split by some member of . The splitting number is
Reaping. A family is unreaped when no single set splits every member of ; the negation, " is reaped by ", thus means that splits each . The reaping number is
Both minima exist and are cardinals. Candidates for are subsets of , and the minimum is attained: itself is a splitting family, since has an increasing enumeration and the even part is an infinite subset of whose complement in is the infinite set of odd-indexed elements. Candidates for are again subsets of , and itself is unreaped: given , either is infinite, in which case the member of meets in the empty set and so is not split by , or is finite, in which case the member of satisfies and so is not split by either. In both cases some member of is not split by , so and ; 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: splits is a statement about 's two parts, and it implies is infinite but imposes no infinitude condition on beyond being infinite; splitting families are, however, customarily taken inside , as above. The comparison of and with , and is Splitting and reaping comparisons with b and d; the elementary lower bounds and are proved there, and the upper bounds are the ones just displayed.
Remarks
Monk attributes the splitting number and the diagonal lower bound to Blass, and the inequality 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: is unreaped by when fails to split some member, so in a reaping family every candidate splitter fails on at least one member.
Splitting and reaping comparisons with b and d
Statement
In ZFC, with the splitting number, the reaping number (The splitting and reaping numbers) and the bounding and dominating numbers (Eventual domination and the numbers b and d),
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 almost dominates a partition when every sufficiently late block of contains a whole block of ; is the union of the even blocks of and is the partition whose blocks each meet minimally. The two coding lemmas are that implies almost dominates and that almost dominating implies ; the splitter lemma is that almost dominating forces to split . The countable lower bound for is the classical two-sided diagonalization against a countable family of candidate splitters, and applies the splitter lemma contrapositively to an unreaped family of size .
Facts & Assumptions
Given: the Axiom of Choice (The Axiom of Choice).
splits when and are both infinite; a splitting family is a family in meeting every in some member that splits , and is its least size; a family is unreaped when no single set splits all its members, and is the least size of an unreaped family; both minima are attained and . (The splitting and reaping numbers)
means eventually; is the least size of a -unbounded family and the least size of a -dominating family, both attained. (Eventual domination and the numbers b and d)
; in particular every family of fewer than functions is eventually dominated by a single function, and every -dominating family has size at least . (Basic bounding and dominating relations, Eventual domination and the numbers b and d)
Under AC every set has a cardinality, and a subset of a set injects into it. (The Axiom of Choice, Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations)
Every nonempty subset of has a least element, is a linear order on so every nonempty finite set of naturals has a greatest element, and recursion on defines sequences with prescribed initial value and successor step. (The well-ordering principle, is a linear order on , Order on the natural numbers, The recursion theorem, The natural numbers (von Neumann))
Proof
Interval partitions. Call a partition when and for all ; it is identified with the partition of into the finite intervals . For partitions say that almost dominates when
Every is a natural number and the intervals cover , so the notation is well founded. [F5]
The functions and the partition . For a partition and let , where is the unique index with , so that . For define by and, given , let be the least such that for every ; the finite set has a greatest element by [F5], and qualifies. Then is a partition, and its defining property is
[F5, step 1.1]
Countable lower bound for . Let be a countable family; we construct that no splits. Write and . Recursively choose so that is infinite: at stage , one of and its complement is infinite; at each later stage, the infinite set is the union , so at least one part is infinite. After choosing , let be its least element outside the finite set . Then the are pairwise distinct and . For fixed and every one has , so is finite. If , then is finite; if , then is finite. In neither case are both and infinite, so does not split . Thus no countable family is a splitting family, and since is a cardinal, .
The partition of a set. For define by and, given , let be the least with . Such a exists because is infinite, so there is with , and qualifies; the least one is determined by [F5]. Then is a partition and by construction for every .
The even-block set . For a partition put . Each interval is nonempty because , these intervals are pairwise disjoint, and they are infinitely many, so .
First coding lemma. If is a partition, and , then almost dominates . Let and choose with for all . Given , choose with and let ; then , using the defining property of at . Hence , and was arbitrary, so almost dominates .
Second coding lemma. If is a partition, and almost dominates , then . Let and choose so that for every there is with . Let and let be the index with , so and hence also . Choose with ; then , so , that is . Hence .
Splitter lemma. If a partition almost dominates for some , then splits . Let and choose so that for all there is with . Since every block of meets by step 2.1, for every . The intervals are pairwise disjoint, so the sets for even are pairwise disjoint nonempty subsets of , and the sets for odd are pairwise disjoint nonempty subsets of . Both families are infinite, so and are infinite and splits by step 2.2.
. Let be a -dominating family with , and fix . The partition of step 2.1 is a partition, and is dominated by some . By step 2.3 the partition almost dominates , so by step 3.1 the set splits . Hence is a splitting family: it is contained in by step 2.2 and its size is at most . Therefore .
. Let be an unreaped family of infinite sets, of size . Consider the family of partitions. No partition almost dominates every member of : otherwise almost dominates for every , so by step 3.1 the set splits every , contradicting that is unreaped. Consequently the family of functions is -unbounded: if some dominated all of them, step 2.3 would make a partition almost dominating every member of , contrary to what was just shown. An unbounded family has size at least , and , so .
Steps 1.3, 4.1 and [F3] give , and steps 4.2 and [F1] with [F3] give . This is the statement. ∎
Add, cov, non and cof for null and meagre ideals
Definition
Work in ZFC. Let carry its usual topology and its Lebesgue measure (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of , Lebesgue measurable sets, the family , and the restricted set function ), and let a subset of 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 , 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
the Lebesgue-null ideal and the meagre ideal on the real line (Measure-null sets and almost-everywhere statements relative to a measure). Since is complete (Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume), a set belongs to exactly when it is contained in a Lebesgue-null measurable set, so the measurability clause in the definition of is not an extra restriction on the members.
The four invariants. Let be a set and let be a family of subsets of (in the applications below is or and ). Define
- the additivity ;
- the covering number ;
- the non number ;
- the cofinality .
The family in the last clause is an inclusion-cofinal subfamily of ; "I-cover" is the reading of the second clause when is an ideal of subsets of .
The four minima exist and are attained for each of and , with . For the two "family" numbers one exhibits a single family: the family of singletons , indexed by , is a subfamily both of and of . Each singleton is null, indeed has (Every at most countable subset of is Lebesgue null; in particular , where the Axiom of Countable Choice The Axiom of Countable Choice () supplies the measure theory), and each singleton is meagre: is open, because for the neighbourhood with contains no with , since would give (The -neighbourhood and the punctured -neighbourhood of a point of , Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Ordered field); so is closed, it has empty interior, since would put into , and therefore is nowhere dense (Interior, closure, boundary and exterior of a subset of ), hence meagre, its union with the constant sequence of empty sets being itself. Since , the families of candidates for and for are nonempty and contain the cardinality . For the remaining two numbers a single set suffices: itself is neither null nor meagre, because (Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume) and no meagre subset of exhausts (Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets), so witnesses , and ; and itself is an inclusion-cofinal subfamily of , since for .
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 of a subset of the power set of or of , hence a set by Replacement. The minimum is attained: there is a subfamily of of size whose union is not in , a subfamily of of size with union , a set of size with , and an inclusion-cofinal subfamily of of size . 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 and , 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 of subsets of a set is exactly the four displayed clauses: he writes and , and , and and and . The eight numbers of this page are the values of the four functions at and , read as , , , , , , and . It is part of the definition that these are evaluated on the real line, with Lebesgue measure and the usual topology; and are proper (that is, ) 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 , , , , and do. The null side uses through the cited suppliers (Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume, Every at most countable subset of is Lebesgue null; in particular ); the meagre side uses no choice principle to speak of meagreness or in the two facts needed above — the two elementary computations for and the Baire fact for (Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so 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 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 "" in the definition of excludes the empty family when . The equation excludes the empty family when ; if , the empty family instead witnesses . Here and both ideals contain , so the empty subfamily is never a candidate for either additivity or covering.
Elementary bounds on ideal cardinal invariants
Statement
In ZFC, for the Lebesgue-null ideal and for the meagre ideal of subsets of (Add, cov, non and cof for null and meagre ideals),
The two middle terms are not an assertion that and are comparable: and of the two cardinals are displayed, and is immediate. The content is the four inequalities , , , , the lower bound coming from countable closure, and the upper bound coming from Borel hulls.
Facts & Assumptions
Given: ZFC, hence the Axiom of Choice and the Axiom of Countable Choice.
For or 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, , 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)
is a complete measure space, and in a complete measure space a countable union of measurable null sets is measurable and null. (Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume, Null sets are closed under countable unions and, in a complete space, under arbitrary subsets, Measure-null sets and almost-everywhere statements relative to a measure)
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)
Every has a set with and ; such a is Borel. (Every subset of has a measurable hull of the same outer measure)
; the Borel sigma-algebra contains the open sets and is closed under complements and countable unions, so it contains every closed set and every set. (Assuming the Axiom of Choice, the Borel sigma-algebra on R^n has cardinality continuum for n at least one, The continuum is equinumerous with the power set of the naturals, The Borel sigma-algebra of a topological space, Sigma-algebras, and subsets of a topological space, agreeing with the real-line notion, Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations)
is the least cardinal strictly above ; the Axiom of Choice supplies a choice function for every family of nonempty sets, and under it every set has a cardinality. (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and , 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)
For the closure is the smallest closed superset of , and is closed exactly when ; a set is nowhere dense exactly when the interior of its closure is empty. (The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, Interior, closure, boundary and exterior of a subset of , Nowhere dense, meagre, residual, and comeagre subsets of a topological space)
Proof
Finite unions. If with , then : extend the finite list to the sequence for , the empty set being in both ideals, and apply the countable-union clause of [F2] respectively [F3].
. If with , then gives , so is a candidate in the minimum defining the additivity and ; minimizing over covers of by members of gives .
. If with , then is the union of the family of members of , of cardinality ; this family is a candidate in the minimum defining the additivity, so , and minimizing over gives .
. Let be inclusion-cofinal in with (attained by [F1]). For each the singleton is a member of , so the set is nonempty, and the Axiom of Choice selects a member containing . Every real therefore lies in some member of , that is, , so is a cover of by members of and .
. Let again be inclusion-cofinal with . Since , no member equals , so each set is nonempty and the Axiom of Choice selects a point for every . Put ; then and because is the image of under . If were a member of , cofinality would give with , and then would contradict ; hence and .
. Let . By [F4] there is a set with and ; here because is measurable with , so , and is a Borel set, hence a member of , containing . Therefore the family consists of members of and is inclusion-cofinal in it, so by [F1] and [F5].
. Let and, by [F1], let be a sequence of nowhere dense sets with . Put . Each is closed by [F7], hence by [F7], so its interior is empty, that is, is nowhere dense; thus is the union of a sequence of nowhere dense sets and is meagre, and is , hence Borel and a member of , with . Therefore is inclusion-cofinal in , and .
Countable families never witness. If is at most countable, then : 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 and of [F3] for .
. By [F1] the minimum defining the additivity is attained, so there is with and . Step 2.1 shows that such an is not at most countable, so , and since is a cardinal and is the least cardinal strictly above , it follows that .
Combining step 3.1 with steps 1.2 and 1.3 gives ; steps 1.4 and 1.5 give ; steps 1.6 and 1.7 give for the two ideals; and of two cardinals is immediate. This is the displayed chain. ∎
The fair-coin measure on Cantor space
Statement
In ZFC the Cantor space (Cantor sequence space, Cantor and Baire sequence spaces and coordinate codings) carries a probability measure on its Borel sigma-algebra (The Borel sigma-algebra of a topological space) such that
the construction using the Axiom of Countable Choice (The Axiom of Countable Choice ()). The measure is the Carathéodory extension of the fair-coin content , which assigns to the cylinder prescribing the coordinates of a finite set the value ; it satisfies , and it is multiplicative on cylinders with disjoint coordinate sets: if are finite and disjoint, and , then .
This is the fair-coin product measure on used by the master-code constructions below; the cylinders are the basic clopen sets of the product topology of copies of the discrete two-point space (The product set 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 with is the usual one, .
Facts & Assumptions
Given: ZFC, hence the Axiom of Countable Choice (The Axiom of Countable Choice ()).
is a compact metric space with no isolated points whose topology consists of unions of the cylinders over finite and ; these cylinders form a base of clopen sets, and the metric is for the first coordinate at which and differ. (Cantor sequence space, Cantor and Baire sequence spaces and coordinate codings)
If are finite and disjoint then ; if is finite then , the set of functions ; for the integer powers satisfy for all integers . (The sum rule: a finite disjoint union is finite with and , and a sum over a finite index set splits along a partition, The set of functions between finite sets is finite, with , Integer powers , Exponentiation of natural numbers, , and its agreement with the integer power in , Laws of integer exponents, The cardinality of a finite set)
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 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)
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)
A closed subset of a compact metric space is a compact subset, compactness of a subset is intrinsic to its metric subspace and agrees with the ambient reading, and compactness is the finite-subcover property for open covers of the space. (A closed subset of a compact metric space is compact, A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, Open cover, subcover, compact metric space, and compact subset of a metric space, Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right)
Proof
For finite and put ; each is open because the topology of consists of unions of cylinders, and closed because is a finite union of cylinders and hence open; in particular . Consequently the family of all finite unions of cylinders, the empty union included, contains and and is closed under complements, and it is closed under finite intersections because when and agree on and is otherwise; by de Morgan it is therefore an algebra of subsets of .
If are finite and , then the prescriptions with are in bijection with the functions , so there are of them, and is their pairwise disjoint union: a point of agrees with exactly one such on .
The fair-coin content is well defined on . Let and let be a presentation; put , a finite set. By step 1.2 each is a disjoint union of cylinders , and these lie inside ; since the -cylinders partition , is the disjoint union of the -cylinders contained in it, and we let be their number and set . If are finite, step 1.2 splits each -cylinder into many -cylinders, so and because and ; two finite sets containing all are compared through their union, which contains both, so the value does not depend on the presentation or on .
From step 2.1, , and ; if are disjoint and is finite and contains the supports of presentations of both, then the -cylinders inside are exactly those inside together with those inside , because a -cylinder meets the disjoint sets and in all of itself or in nothing, so and ; hence is monotone, and for every .
Let be pairwise disjoint members of whose union lies in . For every the set is contained in , so step 3.1 gives and hence . Conversely 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 ; the are open and cover , so the finite-subcover property read in the ambient space through [F5] gives with , and then by step 3.1. Hence is a premeasure on the algebra .
Assume the Axiom of Countable Choice. By [F4] the outer set function induced by the premeasure has a restriction that is a measure on the sigma-algebra generated by the cylinders, and for every ; in particular , so is a probability measure.
The cylinders form a base of the topology of and each is a union of open sets, so the sigma-algebra they generate is the Borel sigma-algebra: . Hence is a Borel probability measure and for every finite and ; for a finite binary word the cylinder is with , so .
If , and , then by step 1.1, so , the middle equality using and the power laws.
Steps 6.1 and 6.2 are the two claims: carries the Borel probability measure with , obtained as the Carathéodory extension of the fair-coin content, and is multiplicative on cylinders with disjoint coordinate sets. ∎
Borel master codes for null and meagre sets
Definition
Work in ZFC in Cantor space , the product of countably many copies of the discrete two-point space, with the product topology (The product set 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 on the basic clopen cylinders (The Borel sigma-algebra of a topological space).
For this page define the Cantor-space null and meagre ideals by
Thus null membership means being contained in a Borel fair-coin null set; it does not assign to a possibly non-Borel set . These are the completed null ideal and the meagre ideal on . In ZFC, 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 by flattening the countable nowhere-dense witnesses over ; subsets preserve meagreness by definition. The unqualified symbols and in Add, cov, non and cof for null and meagre ideals denote the corresponding ideals on .
The fixed clopen basis. Fix once and for all a bijection from the natural numbers onto the finite binary words, for definiteness the length-lexicographic one , and write for the -th basic clopen set, so that enumerates the basic clopen sets of and . Every open subset of 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 . Fix a second enumeration of all clopen subsets of , including the empty set, by coding finite unions of basic cylinders in length-lexicographic order. The null-code condition is
The null set coded by is the limsup of the sequence of clopen sets that selects,
which is Borel, and null: by countable subadditivity and the geometric series, so continuity from above along the decreasing sequence of unions gives . Thus every null master code names a member of , and the coded family is a family of null Borel sets.
Meagre master codes. A meagre master code is a function , read through a fixed bijection , such that for every the open set
is dense in . The meagre set coded by is the complement of the intersection of those dense open sets,
and it is meagre: each complement is closed because is open, and has empty interior because is dense, so each complement is nowhere dense (Nowhere dense, meagre, residual, and comeagre subsets of a topological space) and is a countable union of closed nowhere dense sets, hence .
The slalom order. A slalom is a function with domain and finite values (The cardinality of a finite set), subject to the summability condition (Series, partial sums, convergence and the sum, divergence, and the tail series). Slaloms are ordered by eventual inclusion,
and the space of slaloms with this preorder is written below; it is the slalom space of the master-code construction. The order is reflexive and transitive, and it is one-sided: allows for finitely many .
Remarks
The two code families mirror each other. A null code fixes, at stage , one finite union of cylinders of measure at most , 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 , 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 and 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 and in Add, cov, non and cof for null and meagre ideals refer to the real-line ideals; and 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 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, or , 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 is Borel as well, being the union over of the conditions that every finite partial sum is at most . 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.
Uniform open hulls for Borel sections of small measure
Statement
Assume the Axiom of Choice (The Axiom of Choice).
Let be Borel, and let be rational. There is a Borel map into codes for open subsets such that and for every . Equivalently, the set is Borel and its sections have the specified open codes. If every is null, then for every .
Facts & Assumptions
Given: A Borel and positive rational ; is the fair-coin Borel probability measure on Cantor space.
Finite binary cylinders form a countable clopen base of Cantor space and rectangles made from such cylinders generate the product Borel algebra. (The product set 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, The Borel sigma-algebra of a topological space)
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
For every Borel , the function is Borel. Let 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 , 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 . Explicitly, for a fixed rectangle the class of sets whose intersections with it lie in is a Dynkin class; applying the same closure twice extends the assertion from rectangles to their generated sigma algebra.
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.
We prove the stronger hull assertion simultaneously at all countable Borel ranks. If 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 , retain exactly the second-factor cylinders of rectangles whose first factor contains . These are Borel coordinate tests and code the open section itself, with zero excess.
If and hull-code operators have been constructed for the at smaller rank, apply them with errors and union their open sections. This union covers ; the points added outside lie in the union of the individual excess sets, whose total measure is at most . The output code depends Borelly on .
It remains to handle the complement stage of the Borel hierarchy. In its standard additive/multiplicative normal form, write the set under consideration as where decrease and belong to an additive class already handled at this stage of the Borel hierarchy. For 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 with . Put Each is Borel by step 1.1. Since decreases to and is finite, continuity from above makes the increasing with union all parameters. The least with is therefore a Borel integer-valued function. Set . Then The selected open code is Borel by step 1.2.
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 ; no pointwise arbitrary choice of hulls is made. If , the disjoint decomposition gives . ∎
Uniform closed nowhere-dense covers for Borel meagre sections
Statement
If is Borel and every vertical section is meagre, there are Borel maps into codes for closed nowhere-dense subsets of such that for every .
Facts & Assumptions
Given: A Borel set with meagre vertical sections.
Cantor space has a fixed countable basis of clopen cylinders; finite intersections and inclusions between cylinders are decidable from their finite words. (The product set 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, The Borel sigma-algebra of a topological space)
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
Code an open section by a subset of the fixed cylinder list. If its code is Borel in , then the relation is Borel: it is the countable disjunction over listed cylinders of the finite test . Consequently the open set has a Borel open code in . Its boundary error has a Borel closed code, is closed, and is nowhere dense: every open set meeting meets , hence no nonempty open set is contained in .
We construct for every Borel a Borel open-section code and Borel closed nowhere-dense-section codes satisfying For an open product set, list all basic product rectangles contained in it; their second-factor cylinders with first factor containing form the desired open section. Its error list is empty.
For , use the induction data and put . If , it lies in some . If , it lies in some . Thus the symmetric difference is covered by the countable list . The union open code and paired error list are Borel in .
For , let be the interior of the complement of from step 1.1. Complementing both and preserves their symmetric difference, while . Hence Append the Borel closed nowhere-dense code to the old error list.
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 .
For a fixed , both and its error set are meagre, so the open set 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 is empty and . The recursion and least-cylinder fusion use fixed countable enumerations and no countable-choice selection of sectionwise covers. ∎
Null and meagre master codes are cofinal
Statement
The meagre master family of Borel master codes for null and meagre sets is inclusion-cofinal in the meagre ideal on Cantor space. If 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 is inclusion-cofinal in the null ideal on Cantor space, and if 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.
Borel null sections admit Borel-selected open hulls with arbitrarily small measure. (Uniform open hulls for Borel sections of small measure)
Borel meagre sections admit Borel-selected sequences of closed nowhere-dense covers. (Uniform closed nowhere-dense covers for Borel meagre sections)
A valid null code is a sequence of finite clopen unions with ; its Borel null coded set belongs to . A valid meagre code is a sequence of dense open sets assembled from the fixed cylinder basis; its coded set belongs to . (Borel master codes for null and meagre sets)
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)
The Axiom of Choice permits simultaneous selection of countably many uniform open-hull codes for the rational errors when starting from a Borel null hull. (The Axiom of Choice)
Proof
Suppose every is null. By [F1] and the countable selection permitted by [F4], for each obtain Borel open codes with . 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 is Borel in : compactness of 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 and their measures sum to . Enumerate all pairs 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 . It depends Borelly on and .
Suppose every is meagre. By [F2] obtain Borel closed nowhere-dense codes covering it. Put ; this is dense open. List all basic cylinders contained in , repeating a fixed cylinder if necessary to make an infinite sequence. Inclusion is Borel in : for each it requires , equivalently a finite subcover of the compact cylinder 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 with . As lies in the union of the , it lies in .
Let , a Borel pointwise limit of finite partial sums. Its value decreases to zero. Starting with , choose as the least integer with . The threshold tests are Borel, so each is Borel. Define , a finite clopen union. Then . Its index in the fixed clopen enumeration can be chosen canonically by least search, hence Borelly. This gives a valid null code . Every belongs to at least one canonical cylinder from each ; these have distinct pair-slots as varies, so belongs to infinitely many . Thus .
Let . By the definition [F3] choose a Borel null set . Apply [F1] to the constant Borel family and the fixed parameter , at errors , to obtain open sets with ; [F4] permits choosing the sequence of hull codes. Their intersection is a Borel null hull of . The one-parameter versions of steps 1.1 and 2.1 applied to produce a null master set containing and hence . For an arbitrary , take its defining sequence of nowhere-dense sets. Each is closed nowhere dense by [F5], so is Borel and meagre and contains . Apply step 1.2 to the constant Borel family and evaluate at to obtain a meagre master set containing , hence . Taking the closures is canonical and uses no additional choice. This proves cofinality and the uniform Borel clauses. ∎
Transfer of null and meagre invariants between Cantor space and the line
Statement
In ZFC, let and be the Cantor-space ideals defined in Borel master codes for null and meagre sets, and put and for the real-line ideals of Add, cov, non and cof for null and meagre ideals. For each space and its corresponding ideal , use the four cardinal definitions of Add, cov, non and cof for null and meagre ideals with and . Then the four values for each Cantor-space ideal equal the corresponding values for its real-line ideal. Here carries the fair-coin Borel probability measure and carries Lebesgue measure.
Facts & Assumptions
Given: The two spaces and their indicated measures and ideals.
Fair-coin measure gives each length- binary cylinder mass ; Lebesgue measure gives each half-open interval its length. (The fair-coin measure on Cantor space, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
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)
Countable sets belong to both corresponding ideals in either space. In , a singleton is the intersection of its nested length- cylinders, whose measures tend to zero; it is nowhere dense because Cantor space has no isolated points. A countable union of members of is contained in the union of selected Borel null hulls, which is Borel and null; is a sigma-ideal under Countable Choice, and both are closed under subsets. On , 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 is Lebesgue null; in particular , 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)
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
Let be the countable set of eventually constant binary sequences, and let be the dyadic rationals. The binary-value map 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- cylinder to the corresponding half-open dyadic interval of length after the countable dyadic exceptions are removed. Thus [F1] and the - argument show that binary value pushes fair-coin measure to Lebesgue measure on ; the discarded countable sets have measure zero. Therefore 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.
The complement splits into the disjoint relative clopen components for . The Cantor core splits into the disjoint relative clopen components for . Choose a fixed bijection . On first translate by , then apply , then prefix the resulting binary sequence by . This gives a homeomorphism between the two cores. On this component, prefixing scales fair-coin measure by the positive constant : 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 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.
Both omitted sets and are countably infinite, so both cores are dense in their ambient spaces. For any dense subspace and , is nowhere dense in exactly when it is nowhere dense in : if contained a nonempty open , then would be a nonempty relative open subset of ; conversely, if contained a nonempty relative open , density of would force . Taking countable unions gives the same equivalence for meagreness. Extend by a fixed bijection to a bijection . For any , the difference between and is a subset of . Conversely, the difference between and is a subset of . By [F3], both null and meagre ideal membership are therefore preserved in both directions by .
The bijection preserves ideal membership, unions, and set containment. Since [F2] gives the real-line minima, 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 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. ∎
Ideal Tukey morphisms control additivity and cofinality
Statement
Let be a set and let be proper ideals: each contains , is closed under taking subsets, and does not contain . Let and be defined for a family of subsets of by the minimum clauses of Add, cov, non and cof for null and meagre ideals, and . Assume these minima exist for both and ; equivalently for additivity, each family has a subfamily whose union lies outside it. Suppose and are functions satisfying
Then and . The same two inequalities hold in the weaker form in which and are inclusion-cofinal subfamilies (every member of is contained in a member of , and similarly for ) and the morphism is given only between and , with the Axiom of Choice available to extend it.
The relevant instances are 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 , proper ideals , functions and with the displayed property, and the attained and minima for both families as assumed in the Statement.
For a family of subsets of , is the least cardinality of a subfamily of whose union is not in , and is the least cardinality of an inclusion-cofinal subfamily of ; for and the two minima exist and are attained. (Add, cov, non and cof for null and meagre ideals)
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
If and is a family of members of , then : otherwise that subfamily would be a subfamily of of cardinality at most whose union is not in , and its cardinality would be a candidate in the minimum defining strictly below that minimum.
: let be inclusion-cofinal in with . For every , cofinality of gives some with , and the displayed morphism property gives . Thus the image is inclusion-cofinal without simultaneously selecting a witness for each , and .
: let and let be a family of members of ; by step 1.1 the set is a member of , and gives for every by the displayed property, so ; since and is closed under subsets, . Hence no subfamily of of size below has its union outside , and the minimum clause for gives .
The cofinal-subfamily form: assume and are inclusion-cofinal and that , satisfy the displayed property there. By [F2] choose for every a member with and for every a member with , and put and ; if for , , then with and , so the cofinal-subfamily property gives and hence ; thus and satisfy the hypotheses of steps 2.1 and 1.2, which give and .
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. ∎
Null master codes and summable slaloms are Tukey equivalent
Statement
In ZFC, let , ordered by inclusion, and let be the summable slalom order of Borel master codes for null and meagre sets. There are Borel morphisms in both directions:
- : Borel maps from null codes to slaloms and from slaloms to null codes with ;
- : Borel maps from slaloms to null codes and from null codes to slaloms with .
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.
Valid null codes select clopen of measure at most ; their limsups are null. The slalom space is Borel in the standard product code of finite subsets because the finite partial sums of are uniformly coded. (Borel master codes for null and meagre sets)
Borel families with null sections have Borel-selected covering null master codes. (Null and meagre master codes are cofinal)
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)
The Baire category theorem holds on every nonempty compact metric space, in particular on a nonempty closed subset of Cantor space. (Cantor and Baire sequence spaces and coordinate codings, A closed subset of a compact metric space is compact, Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior)
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
Enumerate all clopen sets as , as in [F1], and put when and otherwise. For a null code define . This is a slalom, since . For let Its stage- measure is at most , and the sum of these bounds is finite by summability. The elementary tail-union estimate therefore gives . Membership in is Borel in , since each stage is a finite clopen union.
For a null code , define the closed sets They increase to , which has measure one. Choose the least for which and set . 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 let , again Borel by the same finite-stage measure limits, and set This is compact, has the same measure as , is disjoint from , and has the property that every nonempty has positive measure. The last assertion follows because a zero-measure intersection with would be a zero-measure intersection with unless was removed, in which case the intersection is empty. Its closed code is Borel in : the finite-stage closed approximants are clopen, and whether the compact intersection meets a basic clopen is the decreasing-limit nonemptiness test from compactness.
Use [F3] to code as a Borel subset of a Cantor parameter space; extend the Borel family by empty sections off that subset. Apply [F2] and restrict the resulting selector to obtain a Borel null-code map with . If , then for all sufficiently large the two clopen sets and appear in the stage- union defining . Every point of lies in infinitely many even or odd code sets and hence in . Thus , proving the first morphism.
For each pair with , allocate a distinct block of binary coordinates and let 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 . For put The sum of stage measures is bounded by , so is null. It is Borel in . As in step 2.1, [F2] supplies a Borel null-code map with .
For each define, when , when , put . The compact-hit tests of step 1.2 make this a Borel family. In the nonempty case put . For every finite set of pairs with , independence gives Taking finite products increasingly shows both that every is finite and that ; indeed and the logarithms of all finite products are bounded below by . Thus is a slalom.
Choose Borelly the least increasing thresholds with . Such thresholds exist by step 4.1; each test is Borel as a limit of finite sums. Put Only finitely many contribute, so the value is finite, and . Also for every .
Assume . Since , the compact misses . Hence it is covered by the increasing closed sets By [F4], one of these closed sets has nonempty relative interior in . Choose a basic witnessing that interior. Then is nonempty and, for all and , it misses . Therefore eventually, and step 5.1 gives . 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. ∎
A good clopen family for summable slaloms
Statement
In Cantor space there are fixed, countably indexed clopen sets () and a sequence in which every nonempty basic cylinder occurs infinitely often, with these properties:
- for every ;
- for every dense open and every , some ;
- whenever has , the intersection 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.
Finite unions and intersections of cylinders are clopen; every nonempty open set contains a cylinder. (The product set 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)
Proof
Enumerate all clopen subsets of as , with every clopen occurring infinitely often. Such sets are finite unions of basic cylinders: compactness of gives a finite subcover by cylinders, and compactness follows directly from the finite-branching binary tree. Fix a repeating enumeration 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.
Fix . For each , let consist of indices such that for every , The empty is included. These are finite tests on clopen codes, so each is a fixed, decidable set of indices.
If is dense open, then contains arbitrarily large indices with . Indeed, there are only finitely many nonempty clopen sets in step 2.1. For each such choose the least coded basic cylinder . Their finite union is clopen, lies in , and meets every nonempty . The repeating clopen enumeration lists beyond every prescribed . Thus the required exists, and all choices were finite least-index choices.
Put . List, with repetitions if necessary, every clopen set of the form where and for ; call the resulting enumeration . There are infinitely many such tuples by step 3.1 with . Every listed union meets through its first term. For a dense open , choose with , then recursively choose with by step 3.1. The resulting lies in .
Take listed unions, writing the -th one as with . Select distinct rows as follows: at stage , among rows not yet selected, choose one with the least -th index . We claim by induction that At this is the condition on . For , row was available at every earlier stage , so . Hence all previously selected indices belong to . As , the defining implication of step 2.1 preserves the nonempty intersection when is added.
Each selected diagonal clopen lies in its row union . Thus step 5.1 gives for ; the empty intersection is and is nonempty. Removing repeated members from a family of at most sets only reduces , so this proves the third property. The first two properties were proved in step 4.1. ∎
Meagre master codes are below summable slaloms
Statement
Let be the good clopen array of A good clopen family for summable slaloms and put for . These sets form an inclusion-cofinal subfamily of the meagre ideal. There are Borel maps and such that 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 .
Every meets ; some is contained in any specified dense open set; and any at most members in row have intersection meeting . (A good clopen family for summable slaloms)
A Borel family of meagre sections admits Borel-selected closed nowhere-dense covers. (Uniform closed nowhere-dense covers for Borel meagre sections)
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)
Baire-space and Cantor-space parameters admit fixed Borel coding. (Cantor and Baire sequence spaces and coordinate codings)
Proof
For each , every tail union is dense open: a given basic cylinder equals for some , and meets it by [F1]. Hence is meagre. It is represented by a code of Borel master codes for null and meagre sets: at master stage , enumerate the basic cylinders contained in that dense open tail union. This enumeration is Borel in because the tail union is a coded countable union of clopens and inclusion of a compact cylinder in it is a finite-subcover test.
If is meagre, take closed nowhere-dense with . For each , the complement of is dense open, so choose the least such that lies in that complement, using [F1]. Every belongs to some and therefore misses for all ; hence . This proves cofinality.
Define , a slalom since . For , summability implies for every sufficiently large . Let be the least integer beyond which this holds; it is Borel because the condition is a countable conjunction of coordinate tests. Put for , and put for earlier . Empty intersections are the whole space. By [F1], each for meets . Therefore every tail union is dense open, and is meagre. Its membership relation is Borel in because each is a finite clopen intersection with Borel dependence on .
Code the Borel slalom parameter space in a Cantor parameter space via [F4], extending by empty sections outside its coded domain. Apply [F2] to get Borel closed nowhere-dense codes with . Set to be the least such that The complement of that finite union is dense open, so [F1] gives such an . For a Borel-coded closed set, disjointness from a fixed clopen set is a Borel finite-subcover test on its open complement; hence is Borel. If , then for some , and it misses whenever . Thus .
If , then eventually and eventually. Hence and, on taking complements, . 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. ∎
Null-to-meagre Tukey inequalities
Statement
In ZFC, and for the Lebesgue-null and meagre ideals on .
Facts & Assumptions
Given: The two ideals and the indicated ZFC background.
The special good-clopen meagre family is inclusion-cofinal, and there are Borel maps witnessing . (Meagre master codes are below summable slaloms)
There are Borel maps witnessing , where is an inclusion-cofinal null master family. (Null master codes and summable slaloms are Tukey equivalent, Null and meagre master codes are cofinal)
If for inclusion-cofinal ideal subfamilies, then and ; 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)
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
For each distinct , use [F3] to choose one special meagre code with ; for each distinct , choose one null master code with . Define maps on the actual cofinal set families by and . If , then , so [F2] gives ; [F1] then gives . Thus witness 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.
Apply [F3] on Cantor space, using the cofinality in [F1] and [F2]. It gives and . 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 by [F4]. ∎
Cross-ideal and bounding inequalities in Cichoń's diagram
Statement
In ZFC,
Facts & Assumptions
Given: The null and meagre ideals on , the eventual domination numbers , and ZFC.
The four ideal invariants have their usual witness minima, and is the least size of an unbounded family in , while 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)
The irrationals are homeomorphic to Baire space ; finite binary cylinders form a basis of Cantor space. (Baire sequence space is homeomorphic to the irrational real numbers, The product set 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)
Cantor-space and real-line meagre ideal invariants agree; interval length gives Lebesgue measure of an interval. (Transfer of null and meagre invariants between Cantor space and the line, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
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
Enumerate the rationals as . For each , choose open intervals around whose total length is , and let be their union. Each is dense open and has measure , so is dense and null. Its complement is meagre. Every translate of is null and comeagre; every translate of is meagre and conull.
For put . It is meagre: it is the union over of the closed nowhere-dense sets . A family of size below is bounded by some , so its image in Baire space is meagre. By [F2], a nonmeagre subset of has a nonmeagre intersection with the irrationals, since the rationals are countable meagre. Consequently . A dominating family of size gives the meagre cover of Baire space; transport it to the irrationals and add the rational set to one cover member. Each transported member is meagre in , because the irrationals are a dense subspace with countable complement. Hence .
In Cantor space, for each list every clopen interval cylinder For any dense open , some listed lies in : successively extend a common suffix while processing the finitely many length- prefixes, so all their concatenations land in . Every listed interval cylinder meets every length- prefix cylinder. It follows that for any , each tail union is dense open, and is meagre. This family is inclusion-cofinal: if with closed nowhere dense, choose inside the dense open complement of , making .
If is nonmeagre and , then cannot be contained in the meagre complement of , so for some . Thus the null translates cover , giving . Take . Likewise, if is nonnull, it meets the conull translate for every , so the meagre translates cover and give .
Let be the right endpoint of . For a strictly increasing with , put This is meagre: for every , the union over of the zero-block cylinders is dense open, so its limsup is comeagre and its complement is .
We claim . If infinitely often, choose increasing from those indices with . Define to agree with the prescribed pattern on and to equal elsewhere. The blocks are disjoint, so belongs to infinitely many and hence . Yet : outside the prescribed blocks ; when lies inside the block starting at , monotonicity gives , and the coordinate is outside all prescribed blocks and has value . Thus , proving the claim.
Choose an unbounded family of strictly increasing functions of size ; replacing an arbitrary witness by its strictly increasing running majorants preserves unboundedness. If were meagre, step 1.3 would put it in one , and step 3.1 would make dominate every , a contradiction. Therefore . If is an inclusion-cofinal meagre family, use [F4] to select with . Every lies in some , so step 3.1 says . The family dominates, whence . Transfer these two inequalities to by [F3]. AC is used exactly for the cardinal witness families and indexed choices of ; the interval construction itself uses finite searches. ∎
The ZFC inequalities of Cichoń's diagram
Statement
In ZFC, the ten cardinals , , , , , , , , , and 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.
For , , , , and . (Elementary bounds on ideal cardinal invariants)
; 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
Draw the ten named cardinals as nodes. For each of and , 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 from [F4]. Every inserted arrow is an inequality already proved under the same ZFC conventions.
If and are among these arrows, ordinal/cardinal order transitivity gives . 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. ∎
FALSE: ZFC fixes the value of for every infinite regular
Statement
False claim: ZFC fixes the value of for every infinite regular cardinal ; that is, the function 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 : the two consistency pictures below, read externally in the finite-fragment sense, give and respectively, and and are distinct cardinals (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ). What ZFC does prove is the necessary constraints on the function — and — 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].
A verified proof transformation establishes and , 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)
In ZFC, if is infinite regular and satisfies and , then the forcing preserves all cardinals and forces ; over a ground model of GCH, and satisfy these hypotheses and give a cardinal-preserving extension with CH and . In particular a value is compatible with ZFC, while GCH asserts . (Higher Cohen forcing violates GCH at a regular cardinal, The Axiom of Choice)
Externally, implies and ; 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)
The aleph operation is strictly increasing, is the least cardinal strictly above and is the successor cardinal of ; every is an infinite cardinal, so and both exceed ; in particular is a cardinal. (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and , Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations, Cardinal (initial ordinal) and cardinality)
Refutation
First picture. [F1] gives by a proof transformation, so the finite fragments of are consistent whenever those of ZF are; in such a picture GCH holds, that is at every infinite cardinal , so at the value is .
Second picture. Over a ground model of ZFC+GCH the cardinal parameters , satisfy the hypotheses of [F2], since and under GCH; the extension by preserves all cardinals, keeps CH, and forces .
Choice is used, and only where stated. The forcing of the second picture is a ZFC construction: 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.
The two pictures disagree. One picture has and the other has , and because the aleph operation is strictly increasing; so the value of is not the same in all pictures of ZFC, and no single value of is a theorem of ZFC.
By step 2.1 the claim is false at the regular cardinal , 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 , and no independence or completeness claim beyond the two pictures is made. ∎
5 · Examples, counterexamples and false statements
None yet.
Sources
- Thomas Jech, Set Theory, Chapter 15: Applications of Forcing, condition (15.7), printed p.232
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Definition 52, PDF p.11
- Thomas Jech, Set Theory, Chapter 15, Theorem 15.18 conditions (15.7), printed p.232
- Thomas Jech, Set Theory, Chapter 15, conditions (15.8)-(15.12), printed pp.233-234
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Definitions 51 and 53, PDF p.11
- Thomas Jech, Set Theory, Chapter 15, Easton-support presentation (15.9)-(15.10), printed pp.233-234
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Definitions 51-53, PDF p.11
- Thomas Jech, Set Theory, Chapter 15, the head/tail factorization (15.11)-(15.12), printed p.234
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Lemma 54, PDF p.11
- Thomas Jech, Set Theory, Chapter 15, Lemma 15.19, printed p.234
- Thomas Jech, Set Theory, Chapter 15, cardinal preservation argument after Lemma 15.19, printed pp.234-235
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Corollary 56, PDF p.12
- Thomas Jech, Set Theory, Chapter 15, head cardinality and nice-name count, printed p.234
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Theorem 58 proof, PDF p.12
- Thomas Jech, Set Theory, Chapter 15, the set-sized Easton calculation, printed p.234
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Theorem 58, PDF p.12
- Kameryn J. Williams, The Structure of Models of Second-order Set Theories, Definition 1.1, Fact 1.18 and Observation 1.21
- Thomas Jech, Set Theory, Chapter 15, forcing with a class of conditions, printed pp.235-237
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Theorem 77 (global Easton, proof sketch), PDF p.16
- Thomas Jech, Set Theory, Chapter 15, class forcing, Boolean-valued model M^B and the Forcing Theorem (15.15), printed pp.235-236
- Thomas Jech, Set Theory, Chapter 15, the classes D_alpha of the Power Set and Replacement proofs (Power Set section and (15.17)), printed pp.236-237
- Thomas Jech, Set Theory, Chapter 15, Power Set and the Separation step left to the reader, printed p.236
- Thomas Jech, Set Theory, Chapter 15, Replacement in the class extension, (15.16)-(15.17), printed pp.236-237
- Thomas Jech, Set Theory, Chapter 15, M[G] is a model of ZFC, printed p.237
- Thomas Jech, Set Theory, Chapter 15, Theorem 15.18 (Easton) and its class-forcing proof, printed pp.232-237
- Thomas Jech, Set Theory, Chapter 15, the theorem is about regular cardinal values; Silver's theorem is cited for singular cardinals, printed pp.232 and 235
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Theorem 77 statement, PDF p.16
- J. D. Monk, Continuum cardinals, almost inclusion and the tower discussion, printed pp.1, 13-14
- M. Malliaris and S. Shelah, Cofinality Spectrum Theorems, Definition 14.3, PDF pp.54-55
- J. D. Monk, Continuum cardinals, tower discussion immediately before Proposition 34, printed p.14
- J. D. Monk, Continuum cardinals, Blass 6.22 and 6.2, printed pp.15, 19
- M. Malliaris and S. Shelah, Cofinality Spectrum Theorems, Definition 14.3 and the surrounding discussion, PDF pp.54-55
- J. D. Monk, Continuum cardinals, Blass 6.23 and Proposition 34, printed pp.14-15, 19
- J. D. Monk, Continuum cardinals, Theorem 1 and the surrounding definitions, printed p.1
- Tomek Bartoszynski, Invariants of Measure and Category, Section 2 conventions, printed pp.2-3
- J. D. Monk, Continuum cardinals, Theorem 1, printed p.1
- Tomek Bartoszynski, Invariants of Measure and Category, Section 2, printed pp.2-3
- J. D. Monk, Continuum cardinals, Blass 3.1 and Proposition 27, printed pp.5, 8
- J. D. Monk, Continuum cardinals, Blass 2.9-2.10, Lemma 14, Lemma 15, Theorem 16 and Proposition 27, printed pp.4-5, 8
- Tomek Bartoszynski, Invariants of Measure and Category, Section 3, printed pp.2-12
- Tomek Bartoszynski, Invariants of Measure and Category, Section 2 (the list of cardinal invariants of an ideal), printed p.2
- Tomek Bartoszynski, Invariants of Measure and Category, Section 2 (elementary properties of add, cov, non, cof), printed p.2
- Tomek Bartoszynski, Invariants of Measure and Category, Section 3 (the fair-coin measure on Cantor space), printed pp.5-6
- Tomek Bartoszynski, Invariants of Measure and Category, Section 3 (coding of null and meagre sets, the slalom order), printed pp.5-7
- Tomek Bartoszyński, Invariants of Measure and Category, Lemma 3.8, printed pp.6–7
- Tomek Bartoszyński, Invariants of Measure and Category, Lemma 3.9, printed p.7
- Tomek Bartoszyński, Invariants of Measure and Category, Lemmas 3.2, 3.4, 3.8 and 3.9, printed pp.4–7
- Tomek Bartoszyński, Invariants of Measure and Category, Cantor-space convention in Definition 3.1, printed pp.4–5
- Tomek Bartoszynski, Invariants of Measure and Category, Lemma 2.2 and the surrounding Tukey discussion, printed pp.2-3
- Tomek Bartoszyński, Invariants of Measure and Category, Lemma 3.13, printed pp.9–10
- Tomek Bartoszyński, Invariants of Measure and Category, Lemma 3.15, printed pp.10–11
- Tomek Bartoszyński, Invariants of Measure and Category, Lemmas 3.14–3.15, printed pp.10–11
- Tomek Bartoszyński, Invariants of Measure and Category, Theorem 3.12 and Lemmas 3.13–3.15, printed pp.8–11
- Tomek Bartoszyński, Invariants of Measure and Category, Theorems 3.16–3.18, printed pp.11–12
- Tomek Bartoszyński, Invariants of Measure and Category, Theorem 3.11, printed p.8
- T. Jech, Set Theory, Chapter 15 (Easton's theorem and the independence of the continuum function), printed pp.232-237