Let be disjoint and have the same cardinality. For a set , its -compression is
For a uniform set family , a member is replaced only when its image is absent from ; this convention preserves the family's cardinality.
Let be disjoint, equally sized, nonempty sets, with . Suppose an intersecting family is unchanged by all such UV-compressions of smaller size. Then its -UV-compression is still an intersecting family. Indeed, a newly moved member can only be disjoint from a retained old member , since two newly moved members share . Here and . If , retaining forces to have been present, contradicting the old intersection property with . Otherwise choose with and . Stability under the smaller -UV-compression forces to be present; this member is disjoint from , again a contradiction. Repeatedly applying a changing UV-compression of smallest size terminates, since the sum of lexicographic order positions decreases. A terminal set family is a lexicographic initial segment: a missing earlier member and present later member would be moved by , .
A set family is left-compressed when replacing a member by a missing smaller element always produces another member. Equivalently, it is fixed by every -compression with .
Suppose that for every there is a such that is fixed by the smaller compression . Then
Indeed, deleting an element outside from a newly compressed member gives the -compression of an old shadow member. If the deleted element is , stability under the chosen smaller compression shows that the resulting set already belongs to the old lower shadow. Thus
and compression preserves cardinality.

Articles by others on the same topic (0)

There are currently no matching articles.