The Setting
This lemma is a step in the assembly of a self-dual matroid in Β§5. It works on the doubled ground set , two copies of a countable set , with an ultrafilter on and a rank that assigns to subsets of ordinals below the continuum , taken as its initial ordinal.
The set consists of the pairs of a natural number and a function β¦; its block is finite, with elements.β¦ The doubled ground set is , where holds the pairs with second entry false and those with second entry true.β¦ A subset of has two slices, the subsets of (1)β¦ and the doubled block is the finite subset of lying over .β¦
Density Ideals and Columns
An ideal of subsets of a set is a family of subsets of that contains the empty set, is closed under subsets and under unions of two members, and does not contain .β¦ For subsets and of , is contained in modulo , written , when .β¦
The density of a subset of a set in a finite subset of is the number of elements of the trace divided by .β¦ The ideal on and the ideal on collect the sets whose density in the blocks tends to as : (2) A subset of is -positive when it does not belong to .
The indices are the ordinals below .β¦ Fix a bijection from the set of these indices onto the set of infinite binary sequences.β¦ A column tag is a pair of an index and a label β¦, and its binary string is the sequence with bits (3)β¦ The column of a tag is the set of pairs with β¦, where the prefix of a sequence is the string of its first bits.β¦ For an index , the column is the column of the tag β¦; for a finite set of indices, , which is when is empty.β¦ The ideal of subsets of consists of the sets for which (4)
Rank Models and Admissible Sets
A rank model on a set is a triple of an ideal of subsets of , an ultrafilter on containing no member of , and a rank assigning to each subset of an ordinal below , subject to two conditions.β¦ Call a subset of large when it belongs to . The rank is antitone modulo on large sets, (5) and it admits rank-raising thinning: whenever , is not in and , some has (6)
For a rank model on , a subset of is upper when (7)β¦ and lower when its complement is upper.β¦ A subset of is admissible for the model when one of two cases holds: (8)β¦
The Claim
Theorem 1. Let be a rank model on whose ideal is , let be a family of subsets of indexed by a set of cardinality less than , and let be subsets of such that is not upper, is not lower, and and are -positive for every . Then there is an admissible subset of with (9)β¦
In the paper, the result reads: for a set of fewer than admissible subsets of and subsets of with not upper, not lower and for every , some admissible with has and for every .
The theorem does not ask the sets to be admissible, so the paperβs statement is its case of an admissible family.
What Is Checked
The claim (9) is stated over a rank model on whose ideal is the ideal of (4), over the ideal of (2), over the upper, lower and admissible sets of (7) and (8), and over families of subsets of indexed by sets of cardinality less than .
The library proves that is a proper idealβ¦: a subset of a member of is a memberβ¦, the union of two members is a memberβ¦, is not a memberβ¦, and every member of , the empty set among them, is a member.