The Setting
The array class is a class of structures in a countable relational language with a relation of strong substructure, built under the continuum hypothesis (CH), . A structure belongs to , and one structure is a strong substructure of another, according to how the structures are presented by normal forms, descriptions of a structure by an index set, a dense base order and a family of bits, and to the maps between those normal forms. The question is whether meets the axioms of an abstract elementary class on isomorphism, on the order and on coherence, and whether the membership of a structure in is independent of the normal form chosen to present it, a normal form being an object when it satisfies the condition that defines .
Structures
A structure in a relational vocabulary is a set, the universe of , with an interpretation of each -ary symbol of as a set of -tuples from it.✦ A substructure of , written , is a structure whose universe is a subset of that of and whose relations are the restrictions of those of .✦ An isomorphism from onto is a bijection between their universes under which each relation holds of a tuple exactly when it holds of the image of that tuple.✦
A class with strong maps in is a class of structures in together with a binary relation on structures in , called strong substructure.✦
Normal Forms
The array language is the relational language with unary sort symbols for the index, base, group and star points of a normal form, a unary row symbol for each pair , a unary column symbol for each , and a unary symbol for each finite that marks the star point . It also has a row projection of arity for each , a column projection of arity for each , binary symbols for order, incidence and bit, and ternary symbols for group addition, star addition, row action and column action.
A tuple from a set is an injective map , and is its length.✦ The subsequences of a tuple are the composites with order embeddings , and the image of under an injection of into another set is .
A normal form consists of a nonempty index set , a nonempty base order that is a dense linear order without endpoints in which every closed interval is countable, and a bit for each tuple from , each and each .✦ The points of 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 , a star point for each finite , and a row and a column for each tuple from , each , each and all finite and .✦ The bit of a row and a column is (1)✦
The structure of is the structure in the array language whose universe is the set of points of . In the structure of , each sort symbol holds of the points of its kind, the row symbol for of the rows with of length , the column symbol for of the columns whose tuple has length , and the symbol for of the star point alone. 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 the index points .✦ The order holds of base points , incidence of a base point and a group point with , and the bit symbol of a row and a column on the same tuple whose bit (1) is .✦ The group and star additions hold of the triples of group points and of star points, the row action of a row , a group point and the row , and the column action of a column , a star point and the column ; no symbol holds of any other tuple of points.✦
A presentation of a structure in the array language is a normal form together with an isomorphism from the structure of onto .✦
For normal forms and , a map consists of an injection , an order embedding , a row shift giving a finite for each tuple from and each , and a column shift giving a finite for each such and each , such that for all , and (2)✦ The map sends an index point to , a base point to , a group point to and a star point to itself, and it sends rows and columns by (3)✦ The composite of and is the map from to with index and base maps and and with the shifts (4)✦
Colors and Tests
The palette is the set of binary sequences modulo equality outside a finite set✦, when and differ at only finitely many places✦, and is the color of ✦. In a normal form the color of a tuple at , and along a map the color of a tuple from at , are (5)
A label on a set of positions is a pair with a nonempty finite subset of and ✦, 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 respect , 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 under which labels are related and tagged as their images are under ✦, the image of being ✦. Under CH, fix an injection of the disjoint union over of the sets of diagrams on into ; it is the coding of diagrams by colors.✦
A family of colors , one for each order embedding with , passes when there is a diagram on such that for every such (6)✦ For a coloring of the tuples from by colors, a tuple from of length passes the test for when the family of the colors of its subsequences passes.✦
The Array Class
Assume CH. A normal form is an object when, for every tuple from , the set (7)✦ is countable. A map of normal forms is strong when is convex in and, at every , every tuple from passes the test for .✦ For presentations of and of , a map is an inclusion when for every point of , the action of on points being (3).✦
The array class is the class with strong maps in the array language whose members are the structures with a presentation whose normal form is an object. The strong substructure relation of is defined by: for structures and in the array language, when there are presentations of and of whose normal forms are objects and a strong map that is an inclusion.
The Claim
Theorem 1 (Lemma 3.9). Assume CH, and let , , , and be structures in the array language. If and is isomorphic to , then (8)✦ If , and is an isomorphism from onto and one from onto with for every element of , then (9)✦ For , (10)✦ If and , then (11)✦ and if and , then (12)✦ If , then (13)✦ If , and , then (14)✦ Let , and be normal forms. If and are strong maps, then (15)✦ If is a strong map, and and are maps with , then (16)✦ If and are presentations of the same structure , then (17)✦
What Is Checked
The claims (8) through (17) are stated under CH over structures in the array language, each with a set as its universe; over the array class and its relation , defined through presentations by normal forms that are objects and strong maps that are inclusions; and over maps of normal forms, their composites and the strong maps among them.
The library also shows that equality outside a finite set is an equivalence relation on ✦.