Kruskal's tree theorem

In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered (under homeomorphic embedding). The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960); a short proof was given by Nash-Williams (1963).

Higman's lemma is a special case of this theorem, of which there are many generalizations involving trees with a planar embedding, infinite trees, and so on. A generalization from trees to arbitrary graphs is given by the Robertson–Seymour theorem.

Friedman's finite form

Friedman (2002) observed that Kruskal's tree theorem has special cases that can be stated but not proved in first-order arithmetic (though they can easily be proved in second-order arithmetic). Another similar statement is the Paris–Harrington theorem.

Suppose that P(n) is the statement

There is some m such that if T1,...,Tm is a finite sequence of trees where Tk has k+n vertices, then Ti  Tj for some i < j.

This is essentially a special case of Kruskal's theorem, where the size of the first tree is specified, and the trees are constrained to grow in size at the simplest non-trivial growth rate. For each n, Peano arithmetic can prove that P(n) is true, but Peano arithmetic cannot prove the statement "P(n) is true for all n". Moreover the shortest proof of P(n) in Peano arithmetic grows phenomenally fast as a function of n; far faster than any primitive recursive function or the Ackermann function for example.

Friedman also proved the following finite form of Kruskal's theorem for labelled trees with no order among siblings, parameterising on the size of the set of labels rather than on the size of the first tree in the sequence (and the homeomorphic embedding, ≤, now being inf- and label-preserving):

For every n, there is an m so large that if T1,...,Tm is a finite sequence of trees with vertices labelled from a set of n labels, where each Ti has at most i vertices, then Ti  Tj for some i < j.

The latter theorem ensures the existence of a rapidly growing function that Friedman called TREE, such that TREE(n) is the length of a longest sequence of n-labelled trees T1,...,Tm in which each Ti has at most i vertices, and no tree is embeddable into a later tree.

The TREE sequence begins TREE(1) = 1, TREE(2) = 3, then suddenly TREE(3) explodes to a value so enormously large that many other "large" combinatorial constants, such as Friedman's n(4),[*] are extremely small by comparison.[1] A lower bound for n(4), and hence an extremely weak lower bound for TREE(3), is A(A(...A(1)...)), where the number of As is A(187196),[2] and A() is a version of Ackermann's function: A(x) = 2 [x+1] x in hyperoperation. Graham's number, for example, is approximately A64(4) which is much smaller than the lower bound AA(187196)(1). It can be shown that the growth-rate of the function TREE far exceeds that of the function fΓ0 in the fast-growing hierarchy, where Γ0 is the Feferman–Schütte ordinal.

The ordinal measuring the strength of Kruskal's theorem is the small Veblen ordinal (sometimes confused with the smaller Ackermann ordinal).

See also


^ * n(k) is defined as the length of the longest possible sequence that can be constructed with a k-letter alphabet such that no block of letters xi,...,x2i is a subsequence of any later block xj,...,x2j.[3] n(1) = 3, n(2) = 11 and n(3) > 2 [7199] 158386.


  3.; p.5, 48 (Thm.6.8)
This article is issued from Wikipedia - version of the 11/17/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.