The Setting
The continuum hypothesis (CH) is the statement .✦ Under CH, is a class of structures in a countable relational language, with a strong substructure relation , whose structures are read off from normal forms: an index set, a base order and an array of bits.
Put . The tail threshold is (1)✦ the beth function at the initial ordinal of the successor cardinal . The question is what looks like in a cardinal : how many models of cardinality it has up to isomorphism, and how the number of points of a normal form, the elements of the structure it presents, is shared between its index set and its base order. A second question is whether has a model in every infinite cardinality.
Colors, Diagrams and Tests
A binary sequence is a map , and is the set of binary sequences.✦ Two sequences and are equal outside a finite set, , when for only finitely many .✦ The palette of colors is the quotient (2)✦ and the color of a sequence is its class.✦
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 ✦, and an injection of into a set sends a label on to the label on .✦ A diagram on consists of binary relations and on the labels on and a map assigning to each label a tag in .✦ The diagram is valid when is an equivalence relation, and respect , whenever , any two labels with the same -predecessors are -equivalent, and the roots of distinct positions are not -equivalent.✦
For a diagram on and an injection of into , the restriction is the diagram on in which two labels are related by , or by , exactly when their images under are so related in , and each label has the tag of its image.✦ Under CH, is a fixed injection from the diagrams on the sets , , taken together, into .✦
A tuple from a set is an injective map , of length .✦ Its subsequences are the composites with order embeddings ✦, and for an injection of into a set , the composite is a tuple from .✦
Assume CH, and let assign a color to every tuple from . A tuple from of length passes the test for when some diagram on satisfies, for every and every order embedding , (3)✦ otherwise fails the test for .
Normal Forms
A normal form consists of a nonempty index set , a nonempty set with a linear order , the base order, and a bit for every tuple from , every and every .✦ In a normal form the base order is required to be dense, to have no least and no greatest element, and to be locally countable: every closed interval of is countable. The color of a tuple from at a point is (4)✦
The points of are of six kinds: an index point for each element of , a base point for each element of , the finite subsets of , the finite subsets of , the rows and the columns , for a tuple from , , , a finite subset of and a finite subset of .✦ For a normal form , is the number of points of .
The points carry a structure in a countable relational language. The language has unary relations that pick out each of the first four kinds of points, for each and the rows with of length , for each the columns with of length , and, for each finite subset of , the point alone. Its binary relations are the order on base points, incidence between a base point and a finite subset of , and the bit relation, which holds of a row and a column when and (5) Its ternary relations are symmetric difference , on the finite subsets of and on those of , and the actions of these two groups, relating a row and a finite subset of to , and a column and a finite subset of to . The row projection for and , of arity , holds of a row with of length followed by the index points ; the column projection for , of arity , holds of a column with of length followed by the base point and the index points .
A structure in this language is presented by a normal form when there is a bijection from the points of onto the universe of such that each relation holds in of the images of some points exactly when it holds of those points in .✦
The Class
Assume CH. A normal form is an object when every tuple from passes the test for the coloring at all but countably many : (6)✦ The models of are the structures presented by an object.✦
For normal forms and , a map from to consists of an injection , an order embedding , a row shift assigning a finite subset of to each tuple from and each , and a column shift assigning a finite subset of to each such and each , under which the bits agree: for all , and , (7) A map from to as above sends an index point to , a base point to , a finite subset of to , a finite subset of to itself, a row to and a column to .
Given a map from to with data , , , as above, the color of a tuple from at a point along the map is (8) A map from to is strong when the image of is convex in and, at every point of outside that image, every tuple from passes the test for . For structures and , when they are presented by objects and joined by a strong map from to that induces the inclusion of in : each point of and its image present the same element.✦
Let be the number of models of of cardinality up to isomorphism. The class is categorical in a cardinal when .✦
The Claim
Theorem 1.
Assume CH. For every cardinal , (9)✦
Assume CH. For every infinite cardinal , (10)✦
Let be a cardinal and a normal form with . Then (11)✦
Assume CH. Let be a cardinal and an object with . Then (12)✦
What Is Checked
The claim is stated over the class defined under CH, with its models presented by objects and its strong substructure relation, over normal forms with their points, colors and tests and the coding of diagrams by colors, and over the threshold of (1). About these constructions, the library proves that equality outside a finite set, , is an equivalence relation on .