Well-quasi-orders on finite trees and transfinite sequences

We study the well-quasi-order (wqo) consisting of the set of finite trees with leaf labels coming from an arbitrary wqo $Q$, ordered by tree homomorphisms which respect the order on the labels. This is a variant of the usual Kruskal tree ordering without infima preservation. We calculate the precise maximal order types of this class of wqos as a function of the maximal order type of the labels $Q$. In the process, we sharpen some recent results of Friedman and Weiermann. Furthermore, we show a correspondence with indecomposable transfinite sequences with finite range, over elements of the wqo $Q$, of length less than $ω^ω$. Nash-Williams proved that arbitrary transfinite sequences with finite range are also well-quasi-ordered, but there are no known methods to extract bounds on the maximal order type from the proof. More concrete proofs for sequences of length less than $α$ for some $α< ω^ω$ were given by Erdős and Rado. Using the correspondence, we obtain precise bounds for the entire collection of transfinite sequences with finite range of length less than $ω^ω$.

💡 Research Summary

The paper investigates two closely related families of well‑quasi‑orders (wqos): the set Tf(Q) of finite trees whose leaves are labelled by elements of an arbitrary wqo Q, ordered by tree homomorphisms that preserve the ancestor‑descendant relation and respect the order on leaf labels; and the family sFα(Q) of transfinite sequences of length < α with finite range in Q, ordered by sequence embeddability. The main goal is to compute the maximal order type o(·) of these structures as a precise function of o(Q), the maximal order type of the label wqo.

The authors begin with a concise review of wqo theory, emphasizing three ordinal invariants—maximal order type, height, and width—and recalling that o(Q) can be characterized as the supremum of ordinals that embed into Q. They also recall the natural sum (⊕) and natural product (⊗) operations, which will later appear in the ordinal calculations.

Section 3 introduces Tf(Q) formally. A tree τ belongs to Tf(Q) if it is finite, all internal nodes are unlabeled, and each leaf carries a label from Q. A homomorphism f:V(τ₀)→V(τ₁) is required to be monotone with respect to the tree order (i.e., preserve ancestor‑descendant) and to satisfy ℓ(v) ≤Q ℓ(f(v)) for every leaf v. This definition weakens the classical Kruskal tree theorem by dropping the requirement that infima of sibling sets be preserved. The authors first verify that Tf(Q) is a wqo whenever Q is, citing earlier work by Montalbán on signed trees. The central technical contribution of the section is Theorem 3.27, which gives an exact closed‑form expression for o(Tf(Q)). If α = o(Q), the theorem shows that o(Tf(Q)) = φ_α(0), where φ denotes the Veblen hierarchy (the α‑th Veblen function evaluated at 0). The proof proceeds by a detailed structural induction on trees, decomposing a tree into its root’s subtrees, applying the induction hypothesis to each, and then combining the resulting ordinals using natural sum and product. This yields a tight upper bound that matches a lower bound obtained via an explicit embedding of the Veblen hierarchy into Tf(Q). Consequently, the previously known non‑tight bounds of Friedman and Weiermann are sharpened to an exact equality.

Section 4 shifts focus to transfinite sequences. For a wqo Q and an ordinal α, sFα(Q) denotes the set of all sequences of length < α whose entries lie in Q and whose range is finite. The ordering is the usual embeddability of sequences (i.e., there exists a strictly increasing index map preserving the order of the entries). Nash‑Williams proved that sFα(Q) is a wqo for every α, but his proof is non‑constructive and yields no information about o(sFα(Q)). Erdős and Rado gave constructive proofs for specific α < ω^ω, obtaining concrete bounds. The authors define a sub‑order iFα(Q) consisting of “indecomposable” sequences—those that cannot be expressed as a non‑trivial concatenation of shorter sequences respecting the embedding order. They then establish a back‑and‑forth correspondence between Tf(Q) and iFω^ω(Q) (Theorem 4.26). This correspondence is built by interpreting a tree as a hierarchical decomposition of a sequence: each leaf label becomes a block, and the tree structure dictates how blocks are nested. Conversely, an indecomposable sequence can be parsed into a tree by repeatedly extracting maximal initial segments that are themselves indecomposable. The two transformations are shown to be order‑preserving and mutually inverse up to the equivalence relation inherent in wqos. As a result, Tf(Q) and iFω^ω(Q) are order‑isomorphic, and therefore share the same maximal order type.

Theorem 4.27 then states that o(iFω^ω(Q)) = φ_α(0) = o(Tf(Q)), providing the exact ordinal for the indecomposable sequences. Finally, Theorem 4.29 leverages the relationship between arbitrary finite‑range sequences and indecomposable ones (every sequence can be uniquely factored into a finite concatenation of indecomposable blocks) to compute o(sFω^ω(Q)). The factorisation yields a natural product of copies of o(iFω^ω(Q)), leading to the formula o(sFω^ω(Q)) = o(Tf(Q)) ⊗ ω, i.e., the natural product of the tree order type with the first infinite ordinal. This matches the lower bound obtained by embedding ω‑many copies of Tf(Q) into sFω^ω(Q) and shows that the earlier upper bounds in the literature were far from optimal.

Section 5 discusses related work and future directions. The authors note that their techniques could be extended to trees with internal node labels, to longer transfinite sequences (α ≥ ω^ω), or to other combinatorial structures such as graphs of bounded tree‑width. They also mention potential applications in proof theory (ordinal analysis of theories involving inductive definitions), program verification (termination arguments for programs manipulating tree‑like data), and the study of ordinal invariants of wqos more generally.

In summary, the paper achieves three major milestones: (1) it provides an exact closed‑form calculation of the maximal order type of the tree wqo Tf(Q) in terms of the Veblen hierarchy applied to o(Q); (2) it establishes a precise order‑isomorphism between Tf(Q) and the indecomposable finite‑range transfinite sequences iFω^ω(Q); and (3) it derives the exact maximal order type of the full collection of finite‑range transfinite sequences of length < ω^ω, namely o(Tf(Q)) ⊗ ω. These results sharpen previous non‑tight bounds, give constructive ordinal analyses where only non‑constructive existence proofs were known, and open the way for further quantitative investigations of wqos in both theoretical and applied contexts.