The Setting
How many diagrams are there on a set of positions, and can one map send the diagrams on , for all at once, injectively to colors, so that diagrams on different numbers of positions never share a color? Lemma 2.2 settles both under the continuum hypothesis (CH), the statement that the cardinal of the continuum equals , the least uncountable cardinal.
Colors
A binary sequence is a map , and is the set of binary sequences.✦
Two binary sequences and are equal outside a finite set, written , when the set of places where they differ is finite: (1)✦
The palette is the quotient of by ; its elements are the colors, and the color of a sequence is its class .✦
Diagrams
A label on a set of positions is a pair of a nonempty finite subset of and a natural number ; the labels on form the set (2)✦
A diagram on a set of positions is a triple of two binary relations and on the set of labels (2) and a map that gives each label a tag, a countable ordinal.✦
The diagrams on form the set , and a diagram of arity is a diagram on the positions .
The Claim
Theorem 1. Assume CH. For every natural number , the set of diagrams on the positions has cardinality at most : (3)✦ Moreover, there is an injection , the code of diagrams, that sends each pair with a diagram of arity to a color: (4)✦
In the paper, the result reads: for each there is an injection from the diagrams of arity into , and the ranges of the are pairwise disjoint.
The maps on the diagrams of arity are injections of this kind, with pairwise disjoint ranges.
What Is Checked
The claims (3) and (4) are stated over the continuum hypothesis, the diagrams on the finite sets of positions with their labels and their tags in , and the palette of binary sequences modulo equality outside a finite set.
Of these constructions, the library proves that equality outside a finite set (1) is an equivalence relation on .✦