The Setting
The basic structures of the abstract elementary class are handled in normal form, by an index set, a base order and an array of bits, and each tuple of indices has a color at each base point. A map of normal forms matches the bits of its source with those of its target only up to finite corrections, defined below, so a color of the source can be read in the target in more than one way, and so can a test, a condition on the colors of the subtuples of a tuple. The question is how much of a color, and of a test, depends on these translations. The library answers it along a single map and along a composite of two.
Throughout, the continuum hypothesis (CH) is the statement .✦
Normal Forms and Their Maps
A binary sequence is a function , and is the set of them.✦ Two binary sequences and differ at finitely many places when the set of with is finite✦, and equality outside a finite set, written , is the equivalence relation on of differing at finitely many places.✦ The palette is the set of its classes, the colors✦, and the color of a sequence is its class.✦
A tuple from a set is an injective map for some .✦ For an order embedding , the subtuple of along is the tuple ✦; for an injection , the image of is the tuple from , of the same length.✦
A normal form of a basic structure consists of a nonempty index set , a nonempty set of base points with a linear order , the base order, and a bit for every tuple from , every and every base point ; the base order is dense, has no least and no greatest element, and is locally countable, every closed interval of being countable.✦ The color of at is (1)✦ With several normal forms in play, , and are those of .
A map of normal forms consists of an embedding of the index sets, an order embedding of the base orders, a finite set , the row translation, for each tuple from and each , and a finite set , the column translation, for each such and each , such that the bit of at , and , corrected by the indicator that lies in and by the indicator that lies in , is the bit of at , and : (2)✦
The composite of with a map of normal forms has index embedding , base embedding , and translations, where is the symmetric difference and the image of under , (3)
The color of a tuple from along a map , at a base point of , is the color of the bits of at with the rows translated by : (4)✦
The exceptional set of a map at a tuple is the set of base points of that lie in a row translation at a subtuple of , (5)✦ the middle union taken over the order embeddings .
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 ✦, and the image of under an injection of into a set is .✦ A diagram on consists of binary relations and on the labels on and a map giving each label a tag, an ordinal in .✦ The restriction of a diagram on along an injection is the diagram on under which two labels are related by , or by , exactly when their images under are so related in , and a label has the tag of its image.✦
A diagram is valid when is an equivalence relation, and are invariant under , whenever , any two labels with the same -predecessors are -equivalent, and positions with -equivalent roots are equal.✦
Assuming CH, the coding of diagrams by colors is an injection into of the disjoint union, over , of the sets of diagrams on .✦
Let color the tuples from by colors in , and assume CH. The test of a tuple holds for , written , when the family of the colors of its subtuples passes✦: there is a diagram on such that for every and every order embedding the restriction is valid and (6)✦
For a normal form and a base point of , the colors give the coloring of the tuples from ; for a map and a base point of , the colors along give the coloring of the tuples from .
The Claim
Theorem 1. Let be a binary sequence and a finite subset of . Then (7)✦ Let be a map of normal forms and a tuple from . Then for every base point of (8)✦ and the exceptional set of at satisfies (9)✦ If moreover CH holds and is a base point of outside , then (10)✦ If is a second map of normal forms and is a base point of outside the image of , then (11)✦
In the paper, the result reads: the color of at computed with a system of row representatives does not depend on the column representative; two systems of row choices give colors that agree outside a countable set, so that the test for a fixed tuple has the same truth value outside a countable set; and for basic structures and with a basic inclusion , the colors at new base points computed with old row representatives do not depend on the choice, with no exceptions.
What Is Checked
The claim is stated over normal forms whose base order is dense, locally countable and without endpoints, over maps of normal forms with their row and column translations and the composite (3), over the colors (1) and the colors along a map (4), over the exceptional set (5), and, for the test, over valid diagrams and their coding by colors under CH.
Two facts about these constructions hold beyond the claim: equality outside a finite set is an equivalence relation on ✦, and the composite of two maps of normal forms is again a map, its translations (3) satisfying the agreement of bits (2).✦