The Setting
The continuum hypothesis (CH) is the statement .✦ Under CH one has a class of structures in a countable relational language, the array class, built from arrays of bits over dense linear orders, with a relation of strong substructure given by maps of arrays. The question is whether satisfies the axioms of an abstract elementary class, the chain axioms included, and how small a Löwenheim-Skolem bound it admits.
Abstract Elementary Classes
Fix a vocabulary , a set of relation symbols, each with an arity . A relational structure in is a set , its universe, with an interpretation of each -ary symbol of as a set of -tuples from ; its cardinality is that of .✦ A substructure of a structure , written , is a structure in whose universe is contained in and whose relations are the restrictions to of those of .✦ An isomorphism of onto is a bijection of onto that preserves every relation in both directions.✦ A structure is the union of a family of structures, indexed by a set , when every is a substructure of and every element of lies in some .✦
A class with strong maps in is a class of structures in , the models of , together with a binary relation on structures in ; says that is a strong substructure of .✦
A Löwenheim-Skolem bound for is an infinite cardinal , at least the number of symbols of , such that for every model of and every subset of there is a model with and (1)✦ The Löwenheim-Skolem number of is the least Löwenheim-Skolem bound for .✦
A class with strong maps in is an abstract elementary class when it satisfies the following axioms.
The relation holds only between models of and is a partial order on them.
If , then .
Coherence: if , and , then .
A structure isomorphic to a model of is a model of , and if and isomorphisms of onto and of onto agree on , then .
Chains: for every nonzero ordinal and every family of models of with for , there is a model of that is the union of the family, with for every , and with for every model such that for every .
has a Löwenheim-Skolem bound.
The Array Class
A tuple from a set is an injective map from into , for some , and is the length of .✦ The subsequence of along an order embedding of into is the tuple ✦, and the image of under an injection of into a set is the tuple from .✦
The palette is the set of binary sequences modulo equality outside a finite set, holding when and differ at only finitely many places.✦ The color of a sequence is its class in .✦
Let be a set of positions. A label on is a pair with a nonempty finite subset of and ✦; the root of a position is the label ✦, and an injection of a set into carries a label on to the label on .✦ A diagram on is a triple in which and are binary relations on the labels on and assigns to each label a tag in .✦ The diagram is valid when is an equivalence relation, and are compatible with , as ordinals whenever , any two labels with the same -predecessors are -equivalent, and positions with -equivalent roots are equal.✦ The restriction of along an injection of into is the diagram on with when , when , and .✦
Under CH, fix an injection of the set of all diagrams on the positions , for all together, into ; the code of a diagram is its image under this injection.✦ A family assigning a color to every order embedding of some into passes when there is a diagram on such that, for every such , the restriction is valid and its code is .✦ If assigns a color to each tuple from , a tuple from passes the test for when the family of the colors of its subsequences passes.✦
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 ; the base order is dense, has no least and no greatest element, and is locally countable, every closed interval being countable.✦ The color of at is .✦
The carrier of is the set of its points✦, which are of six distinct kinds: an index point for each element of , a base point for each element of , a group point for each finite subset of , a star point for each finite subset of , a row for each tuple from , and finite , and a column for each tuple from , and finite .✦
The array language is the countable vocabulary whose symbols are the unary sort symbols for index, base, group and star points, a unary row symbol for each , a unary column symbol for each and a unary label for each finite ; the binary order, incidence and bit symbols; the ternary group addition, star addition, row action and column action; a row projection of arity for each and ; and a column projection of arity for each .✦
The points of form a structure in the array language, in which a symbol holds of a list of points only in the following cases. A sort symbol holds of the points of its sort. The row symbol for , holds of the rows with of length , the column symbol for of the columns with of length , and the label of of the star point . The row projection for , holds of such a row followed by the index points , and the column projection for of such a column followed by the base point and then . The order holds of base points , and incidence of a base point and a group point with . The bit holds of a row and a column on the same tuple when (2) Group and star addition hold of triples of group, respectively star, points; the row action holds of , a group point and , and the column action of , a star point and .
Under CH, a normal form is an object when, for every tuple from , (3)✦
A map from a normal form to a normal form consists of an injection of into , an order embedding of into , a row shift , a finite subset of , and a column shift , a finite subset of , for every tuple from , and , such that for all , and (4)✦ The map sends an index point of to , a base point to , a group point to , a star point to itself, a row to and a column to .
Along such a map , the color of a tuple from at a point is .✦ Under CH, the map is strong when is a convex subset of and every outside it passes the tests: every tuple from passes the test for the coloring .✦
A presentation of a structure in the array language is a normal form with a bijection of the points of onto that respects every relation: a symbol holds in of exactly when it holds of among the points of .✦ For presentations of and of , a map from to is an inclusion when for every point of .✦
Under CH, the array class is the class of structures in the array language that have a presentation whose normal form is an object, and holds when and have presentations and with and objects and a strong map from to that is an inclusion.✦
The Claim
Theorem 1. Assume CH, and let be the array class with its strong substructure relation . Then (5)✦ (6)✦ and (7)✦
In the paper, the result reads: is an abstract elementary class in a fixed countable finitary relational language, with and with the union and common-upper-bound properties for every nonempty set-indexed directed family.
What Is Checked
The claim is stated over the array class and its strong substructure relation , defined under CH from presentations by normal forms that are objects and from strong maps of normal forms, and over the notions of abstract elementary class, Löwenheim-Skolem bound and Löwenheim-Skolem number.