The Setting
Let be the countable set of pairs in which is a natural number and is a Boolean functionβ¦, and let be two copies of , a left copy and a right copy .β¦ The left slice of a subset of is the set of points of whose copy in lies in , and its right slice is the set of those whose copy in lies in .β¦
In the assembling of a self-dual matroid, an ultrafilter on and an ordinal rank on the subsets of sort the subsets of into three zones, Upper, Lower and admissible, according to whether and belong to the ultrafilter and how their ranks compare. The question is how the three zones divide the subsets of : whether every subset falls in exactly one, and which changes to a set keep it in its zone.
Ideals and Densities
An ideal on a set is a family of subsets of that contains the empty set, every subset of each of its members and the union of any two of its members, and does not contain .β¦ For subsets and of , is contained in modulo , written , when ; a subset of outside is -positive.β¦
The density of a set in a finite set is the proportion of the elements of that lie in .β¦ For each natural number , the block of has elementsβ¦, and the doubled block is its two copies in .β¦ The ideal on consists of the subsets of whose density in tends to as β¦, and the ideal on consists of the subsets of whose density in tends to .β¦
Columns and the Larger Ideals
The indices , and run over the ordinals below , the continuum taken as its initial ordinalβ¦, and is a bijection, fixed once and for all, from these ordinals onto the set of infinite binary sequences.β¦ A column tag is a pair of an index and a label .β¦ The binary string of a column tag is the sequence in whose bit is exactly when , for , and is bit of , for .β¦
The column of a column tag is the subset of (1)β¦ For an index , the column is β¦; for a finite set of indices, , which is when is empty.β¦
A subset of is -small when (2)β¦ and is the family of -small subsets of .β¦ The family consists of the subsets of whose slices and both lie in .β¦
Rank Models and the Three Zones
A rank model on a set consists of an ideal on , an ultrafilter on whose members, the large sets, all lie outside , and a rank that assigns to each subset of an ordinal below , such that is antitone modulo on large sets, (3)β¦ and admits rank-raising thinning: whenever is large and a subset of is not, there is for each a large with and .
Fix a rank model on with ultrafilter and rank . A subset of is Upper for the model when (4)β¦ and Lower for the model when its complement is Upper.β¦ A subset of is admissible for the model when (5)β¦
The Claim
Theorem 1. Let a rank model on have ideal , and let and be subsets of . Then (6)β¦ and if is Upper, then (7)β¦ If is Upper and , then (8)β¦ and if is Lower and , then (9)β¦ If , then (10)β¦ If is admissible, then (11)β¦ Moreover (12)β¦ and (13)β¦ Finally, if is admissible, then (14)β¦
In the paper, the result reads: the Upper zone, the Lower zone and the admissible sets partition ; the Upper zone is upward closed and the Lower zone downward closed; all three are invariant under symmetric differences in ; complementation exchanges the Upper and Lower zones and preserves admissibility; is Lower and is Upper; and every admissible set and its complement are -positive.
The partition stands in the box as (6) and (7), and the exchange of Upper and Lower under complements is the definition of a Lower set.
What Is Checked
The claim is stated over a rank model on whose ideal is , the Upper, Lower and admissible subsets of that its ultrafilter and rank define through the slices, the family of subsets of with both slices in , and the ideal of subsets of whose density in tends to .
On these constructions the library proves that is a proper ideal on β¦: it contains the empty set, every subset of a -small setβ¦ and the union of two -small setsβ¦, and it does not contain .β¦