The Setting
Let be a copy of the von Neumann stage , the set of all sets of rank below ✦: a set whose points correspond one to one to the elements of , each point standing for the set it copies.✦ For points and of , holds when the set that stands for is an element of the set that stands for✦, and the rank of is the rank of its set, an ordinal below .✦ A tuple from is an injective map from into , for some .✦
The item turns a tuple from and a countable ordinal into a diagram, defined below, that records equality and membership among the points of the countable closures of parts of , each point tagged by a countable ordinal read off its rank at . Under the continuum hypothesis (CH), , the diagrams are coded by the colors of the palette defined below.
Closures, Tags and Diagrams
A binary relation on a set separates points when any two distinct points and of have a witness, a point that the relation relates to exactly one of them. Fix such a relation and a witness map on pairs of points of that picks a witness for any distinct and . The closure of a subset of under witnesses is the union of its stages , defined by recursion on : (1)✦
A seed in is a nonempty finite subset of .✦ The enumeration of the closure of a seed is a sequence of points of in which is a point chosen in and is a surjection of onto .✦ For membership on and a seed in , the closure is the countable set , and its enumeration is .
For each , let be a fixed injection of into .✦ The functions , for , are defined by recursion on : (2)✦
A label on a set of positions is a pair with a nonempty finite subset of and .✦ A diagram on is a triple in which and are binary relations on the labels on and assigns to each label a tag, an element of ; denotes the set of diagrams on .✦
The palette is the set of binary sequences modulo equality outside a finite set, and its elements are the colors.✦ If CH holds, the code of diagrams by colors is an injection (3)✦
The Claim
Definition 1. Let be an injective map from the set of positions into , for some , and for a nonempty finite let , the seed of the members of at the positions .✦ The entry of at a label on is (4)✦ For , the tag of a point of at is (5)✦ The diagram of at is the diagram on given, for labels and on , by (6)✦ For a seed in , an ordinal is good for when the tags increase along membership in , (7)✦ and bad for otherwise. For every seed in , (8)✦ and for every seed in with , (9)✦ If CH holds, the color of a tuple from of length at is (10)✦
In the paper, the result reads: the bad set is the union of the countable sets over the membership edges in , the diagram has the equality and membership of the entries and the tags , and , the paper’s being the page’s code .
What Is Checked
The claim is stated over the copy of with its membership and ranks, the closures of seeds under witnesses with their enumerations , the functions built from the injections , labels and diagrams on sets of positions, tuples from , and, under CH, the code of diagrams by colors in the palette .
Beside the claim, the library proves that membership separates the points of : any two distinct points of have a witness, a point of that is a member of exactly one of them.✦