The Setting
Under the continuum hypothesis (CH), the array class is a class of structures in a countable relational language, the array language, with a strong substructure relation . Take members of indexed by a nonempty directed preorder and increasing under along it. The question is whether their union is a member of lying -above each of them, and whether it lies -below every member of that lies -above them all: for chains, these are the Tarski-Vaught chain axioms of an abstract elementary class.
Both membership in and the relation are read off normal forms, which present structures in the array language, so the item also concerns directed systems of normal forms: their direct limit, the maps from the members of the system into it and the maps out of it.
Normal Forms and the Class
A relational structure in a vocabulary is a set, its universe, with an interpretation of each -ary relation symbol of as a set of -tuples of its elements.✦ A structure is a substructure of a structure , written , when the universe of is contained in that of and each relation of is the restriction of the corresponding relation of .✦ 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 tuple from a set is an injective map for some , a sequence of distinct elements of ; its length is .✦ For an injection of into the tuple is ✦, and a subsequence of is a composite with an order embedding of into .✦
A normal form consists of a nonempty index set ; a nonempty base set with a 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: the index points , the base points , the finite subsets of , the finite subsets of , the rows with finite, and the columns with finite.✦ The bit of a row and a column over the same tuple is (1)✦
On its points, is a structure in the array language. The unary symbols of the array language hold of the index points, of the base points, of the finite subsets of , of the finite subsets of , of the rows with of length , for each and , and of the columns with of length , for each ; and for each finite subset of there is a unary symbol true of alone. The other symbols are the projections of a row onto the entries of its tuple and of a column onto its base point and the entries of its tuple, the order of the base points, the incidence of a base point in a finite subset of , the bit relation, true of a row and a column over the same tuple when their bit (1) is , the symmetric differences of finite subsets of and of , and the actions by symmetric difference of the finite subsets of on rows and of the finite subsets of on columns. The order, the incidence and the bit relation are binary symbols, the symmetric differences and the two actions are ternary, the projection of a row with a tuple of length has places, and the projection of a column with a tuple of length has places.
A label on a set of positions is a pair in which is a nonempty finite subset of and .✦ The root of a position is the label .✦ A diagram on a set of positions is a triple in which and are binary relations on the labels on and assigns to each label a tag in ✦; tags are compared as ordinals.✦ The restriction of a diagram on along an injection of into is the diagram on in which two labels are -related, or -related, exactly when their images under are so related in , and the tag of a label is the tag in of its image✦; the image of a label under is .✦
The palette of colors is the set of binary sequences modulo equality outside a finite set✦, two sequences being identified when they differ at only finitely many places✦; is the color of the sequence .✦
A diagram on a set of positions is valid when is an equivalence relation on its labels that and respect, whenever , labels with the same -predecessors are -equivalent, and positions with -equivalent roots are equal.✦ Under CH, the code is a fixed injection of the set of diagrams on the sets , , into .✦ A coloring of the tuples from a set is a map assigning a color to each tuple from ; it passes the test of a tuple of length when there is a diagram on such that, for every order embedding , the restriction is valid and has code .✦
The color of a tuple at is .✦ Under CH, a normal form is an object when, for every tuple from , (2)✦
A map of normal forms consists of an embedding of into and an order embedding of into , both written , with a row shift , a finite subset of , and a column shift , a finite subset of , for each tuple from , each and each , such that the bits agree: (3) The map acts on points: index and base points go to their images, a finite subset of to its image, a finite subset of to itself, a row to and a column to .✦ Maps compose: for maps and with shifts and , the map composes the embeddings, its row shift at is and its column shift at is ; the identity map has empty shifts✦.
Along a map , the color of a tuple from at is (4)✦ Under CH, a map of normal forms is strong when is an order-convex subset of and every outside passes the tests: for every tuple from , the coloring passes the test of .
A presentation of a structure in the array language is a normal form together with a bijection from the points of onto the universe of under which each relation of corresponds to the relation of with the same symbol.✦ Under CH, is the class of structures with a presentation by an object, its members being the objects of , and its strong substructure relation has when and have presentations by objects and joined by a strong map that induces the inclusion of in : each point of and its image present the same element.✦
Directed Systems of Normal Forms
Let be a nonempty directed preorder. A directed system of normal forms over is a family of normal forms , , called the stages of the system, with maps for such that is the identity and whenever .✦ A directed system of normal forms over has convex maps when each , for , is an order-convex subset of .
For such a system with convex maps, is the direct limit of the index sets ✦ and the direct limit of the base orders ✦, with canonical embeddings of and of into them; two elements of compare as their representatives in a common ✦. The limit of the system is the normal form whose bits are read in the direct limit of the sets of points of the : there a row over and a column over are fixed for each tuple from , each and each , and is their bit (1) at a stage that holds both.✦
The stage map is the map of normal forms with the embeddings of and and with the row and column shifts by which the images of the rows and the columns of differ from the fixed ones.✦ For a normal form and a compatible family of maps , that is, maps with whenever , the induced map is the map of normal forms that sends to for every and every point of .✦
The Claim
Theorem 1. Let be a nonempty directed preorder, and let be a directed system of normal forms over with convex maps, limit and stage maps . Then, for all and every , (5)✦ (6)✦
Assume CH from here on. If every is strong, then for every (7)✦ and if moreover every is an object, then (8)✦ If is a normal form and , , are strong maps with whenever , then (9)✦
Let be a family of objects of with whenever . Then the family has a union that is an object of , and (10)✦
In the paper, the result reads: for a nonempty family of objects of indexed by a set and directed under , the union is an object of with for every , and if for every , then .
What Is Checked
The claims are stated over relational structures in the array language and their unions, over the class and its relation , defined under CH through presentations by normal forms, objects and strong maps, and over a directed system of normal forms with convex maps over a nonempty directed preorder, with its limit , its stage maps and the map induced by a compatible family of maps.
About these constructions the library proves that every map of normal forms is injective on points✦, that each is an order embedding of into , that the stage maps together carry the direct limit of the sets of points of the bijectively onto the points of ✦, and that the map induced by a compatible family is injective on points✦.