The Setting
In §3 of the counterexample, large sets carry an ordinal rank. The small sets are the members of an ideal , the large sets are the members of an ultrafilter disjoint from , and each large set has a rank , an ordinal below the continuum . Lemma 3.3 asks how much of a set the rank sees: whether altering a set by a small set can change its largeness or its rank, and how the ranks of two large sets compare when one lies inside the other modulo .
The library states the lemma for an arbitrary ideal on a set and an ultrafilter on : once for the ordinal rank built from an enumeration of , and once for a rank model, a triple of an ideal, an ultrafilter and a rank, which is the form in which and enter §5 and §6.
Ideals, Ultrafilters and Ranks
An ideal of subsets of a set is a family of subsets of that contains the empty set, is closed under taking subsets and under unions of two members, and does not contain ; its members are the small sets.✦ For an ideal on and subsets and of , is contained in modulo when the difference is small: (1)✦
A subset of is large when it belongs to the ultrafilter on , and is disjoint from when no small set is large.
The continuum index set is the set of ordinals below , the continuum taken as its initial ordinal✦; it has cardinality , and a bijection of it onto the set of binary sequences is fixed once and for all✦. Let be a family of subsets of indexed by the ordinals below that enumerates , that is, whose members are exactly the large sets. The ordinal rank of a large set , relative to and this family, is the least index such that is contained in modulo : (2)✦
A rank model on a set is a triple of an ideal of subsets of , an ultrafilter on disjoint from , and a rank assigning to every subset of an ordinal below , such that is antitone modulo on large sets and admits rank-raising thinning.✦ The first condition means that whenever and are large and . The second means that if is large and is a subset of that is not large, then for every there is a large set with (3)
The Claim
Theorem 1. Let be an ideal of subsets of a set , let be an ultrafilter on , and let and be subsets of .
If is disjoint from and , then (4)✦
If is the ordinal rank relative to and an enumeration of , and and are large with , then (5)✦
If is a rank model and , then (6)✦
In the paper, the result reads: if , then is large if and only if is large, and then ; if and are large and , then .
The lemma’s first half is (4), together with (6) for the rank of any rank model, and its second half is (5), for the ordinal rank.
What Is Checked
The claim is stated over an ideal of subsets of a set with the relation of (1), an ultrafilter on , the ordinal rank (2) of an enumeration of indexed by the ordinals below , and rank models.
The library proves that the least index in (2) exists: for every large set , the set of indices with is nonempty.✦