The Setting
Let be the countable set of pairs of a natural number and a function β¦, and let be the doubled ground set, with the copy of at false and the copy at true. The bases of a self-dual matroid on are closed under complements. A rank model on singles out the admissible subsets of , and a basis system is a family of admissible subsets, closed under complements, with further exchange and interval properties. The candidate bases come from local rules attached to a set of prototypes, which is built up by a recursion of length , the continuum as an initial ordinal.
Columns and the Ideal
Fix a bijection between the indices below and the binary sequences in .β¦ A column tag is a pair of an index and a label β¦; its binary string is the sequence whose first two bits are , or according as is , or , and whose bit is bit of the sequence of .β¦ The column of a tag is the subset of consisting of the pairs for which takes the value at the prefix of length of the tagβs binary string.β¦ For , the column is the column of the tag β¦, and for a finite set of indices below , the set is the meet of these columns, with .β¦
The density of a set in a finite set is .β¦ The block of has elementsβ¦, and is the family of subsets of whose density in tends to as .β¦ A subset of is -small when (1)β¦ and is the family of -small subsets of .β¦
Rank Models and Admissible Sets
An ideal on 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 .β¦ A subset of is contained in a subset modulo , written , when .β¦
A rank model on consists of an ideal on , an ultrafilter on containing no member of , and a rank that assigns to each subset of an ordinal below , subject to two conditions.β¦ The rank is antitone modulo on large sets: whenever and lie in and .β¦ It admits rank-raising thinning: whenever and with , for every there is with and .β¦
The left and right slices of a subset of are the subsets and of .β¦ Given a rank model on , a subset of is admissible when (2)β¦
Local Rules
The family consists of the subsets of whose density in the doubled block tends to as .β¦ Fix a subset of , write β¦ and , and for let be the density of in minus that of β¦, and .β¦ The probes of relative to and their lower limit in the extended reals are (3)
The local lower rule and the local upper rule at are the families (4) For a rule , a Boolean, is when is false and when is true.β¦
Basis Systems
A basis system on a set is a nonempty family of subsets of that is an antichain under inclusion, is closed under complements, is closed under single swaps, so that whenever , and , and satisfies the interval alternative:β¦ (5)β¦ For subsets and of , a set is an outcome against the interval when it satisfies one of the three alternatives of (5)β¦, and a family of subsets of meets when one of its members is an outcome against it.β¦
Prototypes and Their Assembly
A prototype is a pair of a subset of and a rule β¦, and its flip is the prototype .β¦ The bases of a set of prototypes form the family (6)β¦ Given a rank model on , a set of prototypes is good when is admissible for every , contains the flip of each of its members, and is separated: whenever and are distinct members of .β¦
The complementary pair of a subset of is the set of prototypes.β¦ A stage is either blank or a subset of ; a blank stage has no prototypes, and the prototypes of a stage are the complementary pair of .β¦ Given a rank model on with ideal and a family of pairs of subsets of , the assembly is the sequence of stages defined by transfinite recursion, each being determined from the family and the earlier stages , , by the assembly step, which adds a complementary pair for the interval when that interval is not yet met.β¦ The assembled prototypes form the set of the prototypes of all the stages .β¦ When the prototypes of the earlier stages form a good set, the assembly step at chooses so that adding the prototypes of keeps the set good and, whenever , makes the bases of the resulting prototypes meet .
The Claim
Theorem 1. Let be a rank model on whose ideal is the family of -small sets. There is a family of subsets of such that (7)β¦ There is a good set of prototypes such that (8)β¦ For every family of pairs of subsets of , the assembled prototypes satisfy (9)β¦ For every good set of fewer than prototypes and all subsets and of , there is a stage such that the union of and the prototypes of is good and (10)β¦ Let be a good set of prototypes, and let be such that does not meet . Then every satisfies (11)β¦ and if has fewer than members, there is a subset of such that the union of and the complementary pair of satisfies (12)β¦
In the paper, the result reads: there is a nonempty family of admissible subsets of that is an antichain closed under complements, is closed under the balanced finite swaps, that is, contains for every and all finite sets and with , and for every with infinite contains some with , or , or .
What Is Checked
The claim is stated over the doubled ground set and its slices, a rank model on whose ideal is the family of (1), the admissible sets of (2), the basis systems of (5), and the prototypes with their local rules (4), their bases (6) and their assembly. The library proves that is an ideal on :β¦ a subset of a member of β¦ and the union of two members are membersβ¦, and is not.β¦