The Setting
A diagram on a set of positions presents a structure, its quotient, whose elements are named by labels built from finite subsets of . When the positions move along an injection , the labels move with them, and the question is when this induces a map between the presented structures, and whether that map is injective. Lemma 2.4 of the paper takes the case of a diagram on that is the restriction along of a diagram on ; it also takes the finite stages in the proof of Lemma 5.2 of the paper, diagrams on finite sets of a linear order, where one asks in addition whether the maps respect the relation and the tags of the diagrams.
Diagrams and Their Quotients
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 .✦ An injection carries a label on to the label on with the image set and the same index: (1)✦
A diagram on is a triple in which and are binary relations on the labels on and assigns to each label a tag in , tags being compared as ordinals.✦ A diagram on is valid when is an equivalence relation, and are invariant under , distinct positions have -inequivalent roots, and for all labels and (2)✦
The restriction of a diagram on along an injection is the diagram on that induces through : for labels and on , (3)✦
The quotient of a valid diagram on is the set of -classes of labels on ✦, with the relation and the tag passed to the classes: (4)
Finite Stages
The proof of Lemma 5.2 fixes a linear order and, for each , a diagram on the positions , such that every is valid and the sequence is coherent: for , is the restriction of along every order embedding of into . For a finite set , let be the order isomorphism; the stage diagram on is (5)✦ and its quotient carries the relation and the tag of (4). For finite sets , is the inclusion✦, and the transition map is the map of quotients that carries labels along .✦
The Claim
Theorem 1. Let be a valid diagram on , let be an injection, and let be valid. Then carrying labels along gives a well-defined injective map ✦ with (6)✦ Let be finite subsets of . Then the transition map is injective, and for all (7)✦ (8)✦
In the paper, the result reads: if the test passes and , then induces an injective map that preserves tags and preserves and reflects , and these maps compose, with in the role of ; here is the paper’s finite set of positions, and are the paper’s diagrams on and on , is the paper’s map carrying into , and the test is the paper’s check that these diagrams fit together.
What Is Checked
The claim is stated over valid diagrams on and on , for an injection , with their quotients and ; and over a linear order with diagrams on under the validity and coherence hypotheses, through the stage quotients , their relations and tags , and the transition maps .
From those hypotheses the library proves that every stage diagram is valid✦, and that whenever .✦