The Setting
Fix a subset of the ground set , two copies of a countable set cut into finite blocks. Attached to are two families of subsets of , a lower rule and an upper rule . Their members differ from by a set of density zero, and they are selected by a count of their elements against those of over the first blocks, as grows. The question is whether these families behave near like the set of bases of a matroid: whether is a member, and whether each is an antichain closed under trading one element of a member for one outside it.
Blocks and Densities
The set is the countable set of pairs of a natural number and a Boolean function .✦ For a natural number , the block is the finite subset of made of the pairs with first entry : (1)✦
The ground set is the disjoint union of two copies of : the left copy holds the pairs with second entry false, the right copy those with second entry true.✦ For a natural number , the doubled block is the finite subset of formed by both copies of .✦
The density of a set in a finite set is , the share of the elements of that lie in .✦ The density of a subset of at is its density in the doubled block : (2)✦
A subset of is small when tends to as , and the small subsets of form the ideal (3)✦ Two subsets and of are equivalent modulo small sets when their symmetric difference is small.✦
The Probes
For , the prefix is the finite subset of formed by the first doubled blocks, and is its number of elements.✦ For subsets and of , the prefix count difference and the density difference of relative to are the real numbers (4)
The probe of a subset of relative to is the number obtained by adding to the product of with the sum of the tail supremum and the tail infimum of the density differences from on: (5) The lower limit of is the lower limit of its probes, taken in the extended reals: (6)✦
The Local Rules
For a subset of , the local lower rule is the family of subsets of that are equivalent to modulo small sets and whose lower limit lies in the half-open interval : (7)✦
The local upper rule at a subset of is the family of subsets of whose complement lies in the local lower rule at the complement of : (8)✦
Given a Boolean , the local rule at is when is false and when is true.✦
The Claim
Theorem 1. Let be a subset of . Then (9)✦ the local lower rule is an antichain: if and are members of with , then (10)✦ and it is closed under swaps: if is a member of , and , then (11)✦ Likewise, for each Boolean , (12)✦ if and are members of with , then (13)✦ and if is a member of , and , then (14)✦
In the paper, the result reads: each of and contains , is an antichain, and is preserved by finite modifications that add and delete equally many elements.
The library states the swap of a single element, (11) and (14); a finite modification that deletes elements of a member and adds elements outside it is such swaps in succession.
What Is Checked
The claims (9), (10), (11), (12), (13) and (14) are stated over an arbitrary subset of and the local rules (7) and (8), built on the blocks (1), the densities (2), the ideal of small sets (3), and the probes (4) and (5) with their lower limit (6).