The Setting
Under the continuum hypothesis (CH), , the class is a class of structures in a countable relational language, each presented by a normal form, an array of bits over an index set and a dense base order. Its strong substructure relation comes from the strong maps between normal forms. Lemma 3.12 is the downward Löwenheim-Skolem axiom for : given a structure in and a subset of its universe, it asks for a strong substructure of that contains and has at most elements.✦
The library states this for and for normal forms, together with two statements on restricting a normal form to part of its index set and part of its base.
Normal Forms
A tuple from a set is an injective map , for some , of length .✦ A subsequence of a tuple from is a composite with an order embedding, and the image of under an injection of into a set is the tuple from .
A normal form consists of a nonempty index set , a nonempty base set with a dense linear order , the base order, that has no least or greatest element and in which every closed interval is countable, and a bit for every tuple from , every and every .✦
The points of are of six kinds: the index points ; the base points ; the group points, finite subsets of ; the star points, finite subsets of ; the rows ; and the columns , where is a tuple from , , , and and are as before. The set of points of is written , and is its cardinality.✦
The array language is a countable relational language, and each normal form is a structure in with universe . The unary symbols of are one for each of the index points, the base points, the group points and the star points, true of the points of that kind; for each and , a row symbol true of the rows with of length ; for each , a column symbol true of the columns with of length ; and for each finite , a unary symbol true of the star point alone. For each and , the row projection of arity holds of a row with of length , followed by the index points , and for each , the column projection of arity holds of a column with of length , followed by the base point and . The binary symbols are the base order, incidence between a base point and a group point, and the bit relation, true of a row and a column on the same tuple when their bit, where is if and otherwise, (1) is . The ternary symbols are the additions, true of for group points and for star points, and the actions, true of for a row and a group point and of for a column and a star point . No symbol holds of any other tuple of points.
The palette is the set of binary sequences modulo equality outside a finite set✦, and is the color of a sequence ✦. The color of a tuple from at a base point is (2)✦
Diagrams and Tests
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 ✦. A diagram on consists of binary relations and on the labels on and a tag for each label .✦ The restriction of along an injection is the diagram on in which two labels are related by , or by , when their images are so related in , and each label has the tag of its image.✦
A diagram is valid when is an equivalence relation, and are invariant under , whenever , labels with the same -predecessors are -equivalent, and distinct positions have -inequivalent roots.✦
Under CH, the coding of diagrams by colors is an injection of the set of all diagrams on the sets , , into .✦ A family of colors , one for each order embedding of some into , passes when there is a diagram on with (3)✦ For a coloring of the tuples from by , a tuple from of length passes the test for when the family of the colors of its subsequences passes.✦
For a normal form and a tuple from , the failure set is the set of base points at which does not pass the test for the coloring . Under CH, a normal form is an object when all its failure sets are countable: (4)✦
Maps and Restrictions
A map of normal forms consists of an injection , an order embedding , a row shift , a finite subset of , for each tuple from and each , and a column shift , a finite subset of , for each such and each , such that the bits agree: (5)✦ Such a map sends the points of to points of : index and base points go to their images under and , a group point to , a star point to itself, and (6)✦
The color along of a tuple from at a point is (7)✦ Under CH, a map of normal forms is strong when the image is convex in and, at every outside it, every tuple from passes the test for the coloring .✦
For a normal form , a nonempty and a nonempty that is dense and has no least or greatest element in the order of , the restriction is the normal form with index set , base order and bits for tuples from , and .✦ The restriction map is the map of normal forms whose injection and order embedding are the inclusions of in and of in , with empty row and column shifts.✦
The Class
A structure in is a set , its universe, with an interpretation of each -ary symbol of as a set of -tuples from ; is the cardinality of .✦ A presentation of is a normal form with a bijection that is an isomorphism of onto .✦ For presentations of and of , a map of normal forms is an inclusion when for every point of .✦
Under CH, the class consists of the structures in with a presentation whose normal form is an object.✦ The strong substructure relation on is defined as follows: for structures and in , when there are presentations of and of whose normal forms are objects and a strong map that is an inclusion.
The Claim
Theorem 1. Assume CH.
(a) Let be a structure in and a subset of . There is a structure in with (8)✦
(b) Let be a normal form that is an object and a set of points of . There are a normal form that is an object and a map with (9)✦
Let be a normal form, a nonempty subset of , and a nonempty subset of that is dense and has no least or greatest element.
(c) If is an object, then (10)✦
(d) If is convex in and contains the failure set of every tuple from , then (11)✦
What Is Checked
The four statements are made under CH, over the class and its relation , defined through presentations by normal forms, and over objects, strong maps of normal forms and the restriction map .