The Setting
A color is an element of the palette , a binary sequence taken up to equality outside a finite set, (1)✦ and is the color of . A tuple of length is an injective map from into a set of positions; its subsequences of length are its composites with the order embeddings of into , and a coloring of the tuple gives each such subsequence a color, the color for arity . Under the continuum hypothesis (CH), , colors code diagrams, structures on a set of positions, and the test at each arity matches the colors of a tuple’s subsequences against one diagram on its positions.
A pattern is a sequence of colors, being the color for arity on every subsequence alike. The question of Lemma 5.2 is whether, under CH, some pattern passes the test at every arity. Behind it stands a question on diagrams alone, with validity and restriction as defined in the next section: whether a family of valid diagrams, on , can be coherent, that is, satisfy for every order embedding .
Diagrams and the Test
A label on a set of positions is a pair with a nonempty finite subset of and ✦; the root of a position is the label .✦ An injection carries a label on to the label on .✦ A diagram on consists of binary relations and on the labels on and a map that gives each label a tag in , read as a countable ordinal.✦ The restriction of a diagram on along an injection is the diagram on in which two labels are related by , or by , exactly when their images under are, and each label has the tag of its image.✦
A diagram on is valid when is an equivalence relation, and are unchanged when a label is replaced by an -equivalent one, and for all labels and positions of : (2)✦ The quotient of a valid diagram is the set of -classes of labels✦, with the relation when ✦ and the tag .✦ For valid diagrams on and on and an injection with , the quotient map along sends the class of a label to the class of its image.✦
Assume CH. The coding of diagrams by colors is an injection (3)✦ and is the color of a diagram on . Fix , and let give a color to each and each order embedding , a color for arity on the subsequence of a tuple of length . The family passes the test at arity when there is a diagram on such that, for every and , (4)✦
Coherent Families and Their Limits
Fix a coherent family of valid diagrams and a linear order . For a finite set with elements, the stage diagram on is the restriction of along the inverse of the increasing enumeration of .✦
The stage quotient carries the stage relation and the stage tag that induces on its classes. For finite sets the inclusion is an order embedding✦, and the transition is the quotient map along it.✦ The limit of over is the direct limit $\varinjlim_X F(X)$ of the stage quotients along the transitions, running over the finite subsets of ordered by inclusion.✦ The root of a point is the element of the limit represented by the class of the root label in .✦
Let be a directed system of sets with injective transitions, each carrying a relation and a tag , the transitions preserving and reflecting the relations and preserving the tags. The limit relation and the limit tag on $\varinjlim_i F(i)$ are given, for with images in the limit, by (5)
The Mostowski collapse of a well-founded relation on a set is the map from to sets defined by well-founded recursion as (6)✦
Suppose further that every is extensional, elements of with the same -predecessors being equal, that implies , and that every tag lies below an ordinal . Then the embedding of the limit into the von Neumann level is the Mostowski collapse of the limit relation, an injection $$\pi \colon \varinjlim_i F(i) \hookrightarrow V_\delta.$$(7)✦
Distinct points of have distinct roots: (8)✦ The roots embedding of into is the injection (9)✦ with the embedding (7) of the limit of the stage quotients, their relations and tags , and .
The Claim
Theorem 1 (Lemma 5.2). For every family of valid diagrams, on , there are and an order embedding with (10)✦ Assume CH. There is no sequence of colors such that, for every , the family (11)✦ passes the test at arity .
In the paper, the result reads: there is no sequence in such that holds for every , where stands for and for the test at arity .
What Is Checked
The claim is stated over CH, the palette and the coding , diagrams with their labels, restrictions and validity, the test (4), and families of valid diagrams on ; the statements (7), (8) and (9) are stated over directed systems with relations and ordinal tags, the stage quotients with their transitions, the roots and the Mostowski collapse.
The library proves about these constructions that the quotient map along a restriction is injective, and that every stage diagram is valid✦ and, for , equals .✦ The transitions preserve and reflect the stage relations✦ and preserve the stage tags.✦ For a directed system as in (5), the limit relation is extensional when every is✦, and the limit tag is smaller on every predecessor of an element when this holds for every and .