The Setting
A tuple from a set is an injective map for some ; its length is .✦ The subsequence of a tuple along an order embedding is the tuple , of length .✦
A normal form consists of a nonempty index set , a nonempty base set with a linear order on it, the base order, and a bit for every tuple from , every and every ; the base order is dense, has no least and no greatest element, and is locally countable: every closed interval of is countable.✦
Under the continuum hypothesis (CH), , the objects of this page are certain normal forms, defined below by a condition on the colors of their tuples. Proposition 5.7 asks how large the index set of an object can be once its base order is uncountable. Two cardinals enter the answer: ✦ and the tail threshold (1)✦ the value of the beth function at the initial ordinal of the successor cardinal . The library states the answer for objects, and also for tuples from an index set colored at the points of an arbitrary set of size at most , with colors and tests as defined below, together with two facts on colors.
Colors
A binary sequence is a map , and is the set of binary sequences.✦ Two binary sequences and are equal outside a finite set when they differ at finitely many places: (2)✦ The palette is the set of colors, the equivalence classes of ✦, and the color of a binary sequence is its class.✦ The color of a tuple from the index set of a normal form at a point of its base order is .✦
When is linearly ordered, the increasing enumeration of a finite subset of with elements is the tuple that lists in increasing order.✦ For a coloring of the tuples from by a set and an element of , the color of a finite subset of is (3)✦
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 an injection carries a label on to the label on .✦ A tag is an element of , a countable ordinal.✦
A diagram on a set of positions is a triple in which and are binary relations on the labels on and assigns a tag to each label.✦ A diagram on is valid when is an equivalence relation, is unchanged when a label is replaced by an -equivalent one, is constant on -classes, 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 that relates two labels by , or by , when so relates their images under , and gives each label the tag of its image.✦
Let be the set of diagrams on . Under CH, is a one-to-one map from the disjoint union of the sets to the palette , as in (4), (4)✦ written at a diagram .
Let . A family of colors , one for each order embedding with , passes when there is a diagram such that for every such (5)✦ A tuple from of length passes the test for a coloring of the tuples from by when the family of the colors of its subsequences passes, and fails it otherwise.✦
Under CH, a normal form is an object when for every tuple from its index set the set (6)✦ is countable.
The Claim
Theorem 1 (Proposition 5.7).
Assume CH, and let be an object whose base order is uncountable. Then its index set satisfies (7)✦
Assume CH. Let be a set, let be an uncountable set with , and let assign to every tuple from and every a color . If for every tuple from the points at which fails the test for the coloring form a countable set, then (8)✦
If is a set with , then the set of maps from to , the color profiles on , satisfies (9)✦
Let be a linearly ordered set, a coloring of the tuples from by a set , an element of and a sequence in , with the colors of finite sets as in (3). Let be a finite subset of with elements such that for every and every subset of with elements. Then for every order embedding , (10)✦
In the paper, the result reads: if and is uncountable, then , with the paper’s class and , the index set and the base order of .
What Is Checked
The claim is stated over CH, the cardinals and of (1), tuples and their subsequences, the palette and the colors , increasing enumerations and the colors of finite sets (3), labels, tags and diagrams with their validity, restrictions and code (4), the test of a tuple (5), and normal forms, their colors and the objects among them (6).