The Setting
Fix the set , a copy of the von Neumann stage , and a tag , a countable ordinal. To every finite injective sequence of points of the library attaches a diagram on the positions of . Its labels, defined below, name points of the countable closures, also defined below, of the sets of members of , and it records equality and membership among them, with a countable ordinal for each point computed from its rank and from . Under the continuum hypothesis (CH), , the diagram of a tuple is coded by a color, an element of a palette defined below. Lemma 4.4 asks how these diagrams behave on the subsequences of , called its subtuples, and at how many tags the colors of the subtuples of fail the test defined below.
Closures and Tags
The copy of is a set whose points correspond one to one to the sets of rank below .✦ A point of is a member of a point , written , when the set that stands for is an element of the set that stands for✦, and the rank of is the rank of the set it stands for, an ordinal below ✦.
A witness for two distinct points of is a point that is a member of exactly one of them, and is a fixed map on pairs of points of that sends two distinct points to a witness for them. The countable closure of a nonempty finite set is the union of the stages (1) and its enumeration is a surjection whose first term lies in ✦.
For each , is a fixed injection of the set of ordinals below into ✦, and the functions of Lemma 4.1 are defined by recursion on : (2)✦
The local tag of a point of at a tag is .✦ A tag is good for a nonempty finite set when local tags at strictly increase along membership in : (3)✦
Diagrams, Colors 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 of a set of positions into sends a label on to the label on .✦ A diagram on is a triple of binary relations and on the labels on and a map from these labels to the tags.✦ The restriction of a diagram on along an injection of into is the diagram on in which two labels are related by , or by , when their images under are, and each label has the tag of its image.✦
A diagram on a set of positions is valid when is an equivalence relation, and respect , for all labels with , two labels with the same -predecessors are -equivalent, and the roots of distinct positions of are not -equivalent.✦
Let be a finite injective sequence of points of on the positions . For a nonempty , is the set of the points with ✦, and the entry of a label is the point of the closure of ✦. The diagram of at a tag is the diagram on the positions of given by (4)✦
A tuple from a set is an injective map from into , for some ; it is the same as a finite injective sequence of points of on the positions .✦ The subtuple of along an order embedding is the tuple .✦ For a tuple from , is the set of its members.
Under CH, fix an injection of the disjoint union over of the sets of diagrams on into the palette of binary sequences modulo equality outside a finite set; the elements of are called colors.✦ The coloring at a tag gives a tuple from on the color (5)✦
Assume CH. A family that assigns a color to every order embedding of some into passes when there is a diagram on such that, for every such , (6)✦ For a coloring of the tuples from by colors in , the test of a tuple from holds when the family of the colors of its subtuples passes.✦
The Claim
Theorem 1. (i) Let be a finite injective sequence of points of on the positions , let be an injection of the positions into , and let be a tag. Then (7)✦
(ii) Let be a tuple from and a tag good for . Then (8)✦
(iii) Assume CH. Let be a tuple from and a tag good for . Then (9)✦
(iv) Assume CH. For every tuple from , (10)✦
In the paper, the result reads: for every tuple , the quotient of by is with membership; (i) ; (ii) if , every is valid; hence, for , the colors pass the full test; there is , is the subtuple of on a set of its positions, is its color , and says that is good for .
What Is Checked
The claim is stated over the copy of with membership and rank, the closures with their enumerations, the functions of (2) and the goodness of tags (3), the diagrams of (4) with restriction and validity, and, under CH, the coloring of (5) and the test built on (6).
Beside the claim, the library proves that membership separates the points of : any two distinct points of have a witness.✦