The Setting
The abstract elementary class is built on basic structures: many-sorted structures over an index set and a base order , in which rows and columns attached to the tuples from are joined by a bit relation. The bits give colors, elements of a palette ; under the continuum hypothesis (CH), , colors code diagrams on finite sets of positions, and a test on these codes singles out, among the basic structures, those that are objects of .
Take a nonempty set , a base order and an arbitrary array of bits , one for each tuple from (an injective map ), each and each . The question is whether some basic structure carries exactly these bits, with which colors, and when it is an object of ; the library handles a basic structure in normal form and codes the normal forms as structures on ordinals.
Normal Forms
The length of a tuple is , and its subsequences are the composites with the order embeddings .✦
A normal form consists of a nonempty set , the index set; a nonempty set with a dense linear order without least or greatest element in which every closed interval is countable, the base order; and a bit for every tuple from , every and every .✦
The points of form the set , the disjoint union of six 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 , each and each finite , and a column for each tuple from , each and each finite .✦ The bit of a row and a column of the same tuple is (1)✦
The Array Language
The array language is a countable relational language, and a normal form interprets each -ary symbol as a relation that fails on points of the wrong kinds. Its unary symbols are the four sort symbols, for the index, base, group and star points; for all and , a symbol for the rows with of length ; for each , a symbol for the columns whose tuple has length ; and for each finite , a label true of the star point alone. The row projection for and , of arity , holds of such a row followed by the index points , and the column projection for , of arity , of a column with of length followed by the base point and the same index points.
The order holds of base points , incidence of a base point and a group point with , and the bit relation of a row and a column with whose bit (1) is . Group and star addition hold of the triples of group points and of star points. The row action holds of for a group point , and the column action of for a star point .
A structure in the array language is a set, its universe, with an -ary relation on it for each -ary symbol .✦ For a set and a bijection , the structure is the structure with universe that induces through : (2)✦
A presentation of a structure in the array language is a normal form together with a bijection of onto the universe of that respects every symbol: holds exactly when does.✦
The canonical bijection of a set is a bijection, fixed once and for all, of onto the von Neumann ordinal , the initial ordinal of .✦ For a normal form we write and for and .
Colors and the Test
A binary sequence is a map , an element of .✦ Two sequences and are equal outside a finite set, , when they differ at only finitely many .✦ The palette is the set of -classes of binary sequences✦, and the color of a sequence is its class.✦
A label on a set of positions is a pair of a nonempty finite and an ✦, and the root of a position is the label .✦ A diagram on is a triple of binary relations and on the labels on and a tag for each label .✦ For an injection , the restriction is the diagram on that induces through : a label on is -related or -related to another exactly when their images under are, and takes the tag of its image, the image of being .✦
A diagram is valid when is an equivalence relation respected by and , whenever , labels with the same -predecessors are -equivalent, and distinct positions have roots in distinct -classes.✦
Under CH, the coding of diagrams is an injection into of the disjoint union, over , of the sets of diagrams on .✦
Assume CH, let color the tuples from by , and let be a tuple of length . The tuple passes the test of when there is a diagram on such that for every and every order embedding the restriction is valid and codes the color of the subsequence : (3)✦
The Claim
Theorem 1. Let be a normal form. The color of a tuple from at a point of is the color of the sequence of its bits at , (4)✦ Under CH, is an object when, for every tuple from , the points of at which fails the test of the coloring form a countable set.✦ If CH holds and is countable, then (5)✦ The coded structure of is the structure on the ordinal that induces through , (6)✦ and (7)✦
In the paper, the result reads: for every nonempty , every order as in Definition 3.2(a) and every family , there is a basic structure whose index and base sorts are copies of and and whose colors are , and if is countable, every basic structure with base is an object; the paper’s is the sequence here.
What Is Checked
The claim is stated over normal forms with their points and the relations of the array language, the palette of colors, the coding of diagrams by colors and the test it defines under CH, the structures and their presentations, and the canonical bijections onto initial ordinals.
The library proves that is an equivalence relation on ✦, and that for every set and every bijection the pair is a presentation of .✦