The Setting
The continuum hypothesis (CH) is the hypothesis .✦ Under it the Hanf number is , the endpoint. The class is a class of structures in a countable relational vocabulary with a strong substructure relation , and its models are presented by normal forms. Theorem 4.5 settles whether, under CH, any two models of of cardinality are isomorphic.
These notes define the normal forms and the class , then the two normal forms the theorem is about.
Normal Forms
A tuple from a set is an injective map from into , for some ✦; its subsequences are the composites with order embeddings .✦
A normal form consists of a nonempty index set ; a nonempty dense linear order without endpoints, the base order, in which every closed interval is countable; and a bit for every tuple from , every and every .✦ Its points 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 , where is a tuple from , , , and and are finite.✦ The cardinality of a normal form is the number of its points. The bit of a row and a column with the same tuple is (1)✦
The points of form the universe of a structure in the array language, a countable relational vocabulary. Its unary symbols pick out the index points, the base points, the finite subsets of , the finite subsets of , the rows with a given length of tuple and a given , the columns with a given length of tuple, and each single finite subset of . Its other symbols project a row onto the index points of its tuple and a column onto its base point and the index points of its tuple, and interpret the order of , the membership of a base point in a finite subset of , the bit (1) being , symmetric difference of finite sets, and the translations of rows and of columns by finite sets and .
A presentation of a structure in the array language is a normal form together with a bijection of the points of onto the universe of under which each relation holds in exactly where it holds in .✦
The palette is the set of binary sequences modulo equality outside a finite set✦, and is the color of the sequence .✦ The color of a tuple from at a point of is .✦
Diagrams, Tests and Objects
A label on a set of positions is a pair with a nonempty finite subset of and ✦; the root of a position is .✦ A diagram on consists of binary relations and on the labels on and a tag for each label .✦ A diagram is valid when is an equivalence relation, and are invariant under , whenever , labels with the same -predecessors are -equivalent, and positions with -equivalent roots are equal.✦ The restriction of a diagram on along an injection is the diagram on that relates and tags each label as relates and tags .✦
Under CH, a fixed injection of the diagrams on , over all , into is given, and is the code of the diagram .✦ A tuple of length from a set then passes the test for an assignment of colors to the tuples from when there is a diagram on such that, for every order embedding , the restriction is valid and (2)✦ A normal form is an object when, for every tuple from , the set (3)✦ is countable.
The Class
A map of normal forms from to , where , and denote the index set, the base order and the bits of , and likewise for , consists of an embedding of into , an order embedding of into , and finite sets and , for a tuple from , and , such that the bits agree: (4) On points, acts by on index points and by on base points and on finite subsets of , fixes finite subsets of , and sends a row to and a column to .✦
Under CH, a map of normal forms from to is strong when is convex in and, at every , every tuple from passes the test (2) for the colors along , which give a tuple from the color .✦ The class consists of the structures in the array language that have a presentation by an object. For structures and in , the strong substructure relation holds when and have presentations by objects joined by a strong map under which each point and its image present the same element.✦ Two structures and in the array language are isomorphic, , when some bijection of their universes preserves every relation in both directions. The cardinality of a structure is the cardinality of its universe.
The Two Normal Forms
The set is a copy of the von Neumann stage , the sets of rank below , with the membership relation of the sets it copies✦; the rank of is the rank of the set copies, an ordinal below .✦ For a nonempty finite , the countable closure is the union of the stages and , where the witness of distinct and is an element of that is a member of exactly one of them.✦ The enumeration of is a map that takes a point of at and then runs through a fixed surjection of onto .✦
The functions of Lemma 4.1, for , are defined by recursion on : with a fixed injection of into , for every , (5)✦
For a tuple from of length , the entry of a label on is , where .✦ The diagram of at a tag is the diagram on with (6)✦ Under CH, the endpoint color of at is the code of this diagram.✦
Let be a fixed bijection of the lexicographic product , ordered by the first coordinate and then the second, onto , and a fixed representative of each color .✦ Under CH, the endpoint normal form has index set , base order , and bits (7)✦ For an infinite cardinal , the normal form has as index set the ordinals below the initial ordinal of , as base order , and all bits .✦
The Claim
Theorem 1. Assume CH. Then there are models and of with (8)✦ Moreover, (9)✦ (10)✦ and, for every infinite cardinal , (11)✦ Without assuming CH, the order satisfies (12), for all its elements and the closed interval satisfies (13), and for every infinite cardinal we have (14). (12)✦ (13)✦ (14)✦
In the paper, the result reads: has two nonisomorphic models of cardinality , one with an order sort of cardinality and one with a countable order sort, the order sort being the paper’s name for the base order.
What Is Checked
The claim is stated over CH, the endpoint , the class of structures presented by objects with its relation , and the normal forms , built from the diagrams of tuples from and the functions , and . About these constructions the library also proves that membership separates the points of : for any two distinct elements of , some element of is a member of exactly one of them.✦