The Setting
A matroid on a set is self-dual when on the same labelled set, which holds exactly when the complement of every basis of is a basis of . Section 5 assembles a self-dual matroid on , two copies of the countable set of pairs with and , with the copy and the copy . Every basis of this matroid is to be admissible for a rank model, a condition comparing the ranks of the parts of the basis in and in .
A matroid on can be given by its bases: a nonempty family of subsets of with base exchange and the maximality axiom is the family of bases of exactly one matroid on . Theorem 5.5 gives conditions on a family closed under complements under which both axioms hold and the matroid is self-dual, and it supplies a family on meeting them with every member admissible.
Basis Systems
A family of subsets of has the interval alternative when, for all sets with infinite, some satisfies (1)β¦
A basis system on a set is a nonempty family of subsets of with the interval alternative, no member of which properly contains another, closed under complements and under exchanging one element of a member for one outside it: for all , and , (2)β¦
A subset of is independent for a basis system when it lies in some member of .β¦
Ideals and Rank Models
An ideal on a set is a family of subsets of that contains , contains every subset of each of its members and the union of any two of its members, and does not contain .β¦ For an ideal and sets , we write when .β¦
A rank model on a set consists of an ideal on , an ultrafilter on containing no member of , and a rank assigning to each subset of an ordinal below , the continuum taken as its initial ordinal.β¦ The rank is antitone modulo on large sets, those in , and admits rank-raising thinning: for all , every with and every , (3)β¦
The slices of a set are and .β¦ For a rank model on with ultrafilter and rank , a set is admissible for when (4)β¦
Columns and Small Sets
The block of has elements.β¦ The density of a set in a finite set is β¦, and is the density of in β¦. A subset of is density small when as ; the density small sets form the ideal .β¦
Fix a bijection from the indices below onto the set of binary sequences.β¦ A column tag is a pair of an index and a label β¦, and its binary string is the sequence with (5)β¦ The column of the tag is the set of pairs for which takes the value at , the prefix of made of its first bits.β¦ For the column is the column of the tag β¦, and for a finite set of indices below the meet is the intersection of these columns, with β¦.
The family consists of the subsets of , called -small, for which the part of inside some meet of finitely many columns is density small: (6)β¦
The Claim
Theorem 1. Let be a basis system on a set . Then satisfies base exchange: for all and every there is with (7)β¦ It satisfies the maximality axiom: for every set independent for and every with there is a set with (8)β¦ The matroid on given by these bases has exactly the members of as its bases: for every , (9)β¦ This matroid is self-dual, (10)β¦ and if is independent in but is not a basis of it, then for every (11)β¦ For every rank model on whose ideal is , there is a basis system on with (12)β¦
In the paper, the result reads: there is a matroid on whose bases are exactly the members of the family of Proposition 5.4, with on the same labels and every basis admissible, so that in particular every basis with has and , and every independent set of that is not a basis extends by any element outside it. The matroid of a basis system as in (12) is such a matroid .
What Is Checked
The claim is stated over basis systems (2) on an arbitrary set , with the interval alternative (1), independence for and the matroid given by its bases, and, in (12), over rank models (3) on whose ideal is the family of (6), with the admissible subsets (4) of .
The library proves that is an ideal on β¦: the empty set is -small, every subset of a -small setβ¦ and the union of any two -small sets are -smallβ¦, and is not -smallβ¦.