The Setting
The counterexample to the packing/covering conjecture is built on the countable set of pairs with and : its ground sets are , two copies of , and the double ray . The set falls into the finite blocks , of elements each.β¦
An ultrafilter on and a rank with values below the continuum enter the later sections only through a rank model: an ideal on , an ultrafilter disjoint from it, and a rank tied to both. The question is whether carries a rank model whose ideal is the ideal of small subsets of defined below. The other question is about ideals in general: given an ideal on a set and a family of subsets of , when can an ultrafilter avoid , contain every , and still have each of its members contained modulo in only finitely many ?
Ideals, Patterns and Forbidden Sets
An ideal on a set is a family of subsets of that contains the empty set, contains every subset of each of its members and the union of any two of them, and does not contain .β¦ A subset of is -positive when it is not in . For subsets and of , is contained in modulo , written , when .β¦
Let be a family of subsets of . For finite sets , the signed pattern is the set of points of that lie in for every and outside for every : (1)β¦
A subset of is forbidden for and when for infinitely many .β¦
The Ideal
For a finite subset and a subset of a set, the trace of on is the finite set β¦, and the density of in is β¦. The density ideal consists of the subsets of whose density in the block tends to : (2)β¦
A column tag is a pair of an index and a label .β¦ Fix a bijection from the ordinals below onto the set of binary sequences.β¦ The binary string of a tag is the binary sequence given by (3)β¦ and the column of is the set of points of at which takes the value on the prefix of length of : (4)β¦
For the column is β¦, and for a finite set of indices below the meet is , with β¦. The ideal consists of the -small subsets of , those whose part inside some meet belongs to : (5)
Rank Models
A rank model on a set is a triple of an ideal on , an ultrafilter on containing no member of , and a map assigning to each subset of an ordinal below , such that is antitone modulo on , (6) and admits rank-raising thinning: for every , every with and every there is with (7)β¦ The ideal of a rank model on is .
The Claim
Theorem 1. Let be an ideal on a set and let be a family of subsets of such that the signed pattern is -positive for all disjoint finite sets .
(a) There is an ultrafilter on with (8)β¦
(b) For every , every finite set and every finite family of sets forbidden for and , (9)β¦
(c) On there are an ultrafilter and a map from the subsets of to the ordinals below such that (10)β¦
In the paper, the result reads: there is an ultrafilter on disjoint from , containing every , such that for the set is finite, the sets for being the paperβs -columns of .
What Is Checked
Parts (8) and (9) are stated over an arbitrary ideal on an arbitrary set and an arbitrary family of its subsets, through the relation , the signed patterns (1) and forbidden sets; part (10) is stated over rank models and the ideal of (5), built from the density ideal and the columns .
About the library proves that it is an idealβ¦: a subset of a -small set is -smallβ¦, the union of two -small sets is -smallβ¦, and itself is not -smallβ¦.