König's lemma

From Wikipedia, the free encyclopedia

For other uses, see König's theorem (disambiguation).

König's lemma or König's infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated by researchers in mathematical logic, especially in computability theory. This theorem also has important roles in constructive mathematics and proof theory. Note that, although Kőnig's name is properly spelled with a double acute accent, the lemma named after him is customarily spelled with an umlaut.

1 Statement of the lemma
- 1.1 Proof
2 Computability aspects
3 Relationship to constructive mathematics and compactness
4 Relationship with the axiom of choice
5 References
6 External links

[edit] Statement of the lemma

If G is a connected graph with infinitely many vertices such that every vertex has finite degree (that is, each vertex is adjacent to only finitely many other vertices) then every vertex of G is part of an infinitely long simple path, that is, a path with no repeated vertices.

A common special case of this is that every tree that contains infinitely many vertices, each having finite degree, has at least one infinite simple path.

Note that the vertex degrees must be finite, but need not be bounded: it is possible to have one vertex of degree 10, another of degree 100, a third of degree 1000, and so on.

[edit] Proof

For the proof, assume that the graph consists of infinitely many vertices $v i$ and is connected.

Start with any vertex v₁. Every one of the infinitely many vertices of G can be reached from v₁ with a simple path, and each such path must start with one of the finitely many vertices adjacent to v₁. There must be one of those adjacent vertices through which infinitely many vertices can be reached without going through v₁. If there were not, then the entire graph would be the union of finitely many finite sets, and thus finite, contradicting the assumption that the graph is infinite. We may thus pick one of these vertices and call it v₂.

Now infinitely many vertices of G can be reached from v₂ with a simple path which doesn't use the vertex v₁. Each such path must start with one of the finitely many vertices adjacent to v₂. So an argument similar to the one above shows that there must be one of those adjacent vertices through which infinitely many vertices can be reached; pick one and call it v₃.

Continuing in this fashion, an infinite simple path can be constructed by mathematical induction. At each step, the induction hypothesis states that there are infinitely many nodes reachable by a simple path from a particular node $v i$ that does not go through one of a finite set of vertices. The induction argument is that one of the vertices adjacent to $v i$ satisfies the induction hypothesis, even when $v i$ is added to the finite set.

The proof just given may not be considered constructive, because at each step it uses a proof by contradiction to establish that there exists an adjacent vertex from which infinitely many other vertices can be reached. Facts about the computational aspects of the lemma suggest that no proof can be given that would be considered constructive by the main schools of constructive mathematics.

[edit] Computability aspects

The computability aspects of König's lemma have been thoroughly investigated. The form of König's lemma most convenient for this purpose is the one which states that any infinite finitely branching subtree of $\omega^{<\omega}\,$ has an infinite path. Here $ω$ denotes the set of natural numbers and $\omega^{<\omega}\,$ the canonical tree of all finite sequences of natural numbers, ordered by extension. Each finite sequence can be identified with a partial function from $ω$ to itself, and each infinite path can be identified with a total function. This allows for an analysis using the techniques of computability theory.

A subtree of $\omega^{<\omega}\,$ in which each sequence has only finitely many immediate extensions (that is, the tree has finite degree when viewed as a graph) is called finitely branching. Not every infinite subtree of $\omega^{<\omega}\,$ has an infinite path, but König's lemma shows that any finitely branching subtree must have a path.

For any subtree T of $\omega^{<\omega}\,$ the notation Ext(T) denotes the set of nodes of T through which there is an infinite path. Even when T is computable the set Ext(T) may not be computable. Every subtree T of $\omega^{<\omega}\,$ that has a path has a path computable from Ext(T).

It is known that there are finitely branching computable subtrees of $\omega^{<\omega}\,$ that have no arithmetical path, and indeed no hyperarithmetical path. Every computable subtree of $\omega^{<\omega}\,$ with a path must have a path computable from Kleene's O, the canonical $\Pi^1_1$ complete set. This is because the set Ext(T) is always $\Sigma^1_1$ (see analytical hierarchy) when T is computable.

A finer analysis has been conducted for computably bounded trees. A subtree of $\omega^{<\omega}\,$ is called computably bounded or recursively bounded if there is a computable function f from $ω$ to $ω$ such that for all n there is no sequence in the tree whose nth element is larger than f(n). Thus f gives a bound for how “wide” the tree is. The following basis theorems apply to infinite, computably bounded, computable subtrees of $\omega^{< \omega}\,$ .

Any such tree has a path computable from $0'$ , the canonical Turing complete set that can decide the halting problem.
Any such tree has a path that is low. This is known as the low basis theorem.
Any such tree has a path that is hyperimmune free. This means that any function computable from the path is dominated by a computable function.
For any noncomputable subset X of $ω$ the tree has a path that does not compute X.

A weak form of König's lemma which states that every infinite binary tree has an infinite branch is used to define the subsystem WKL₀ of second-order arithmetic. This subsystem has an important role in reverse mathematics. Here a binary tree is one in which every term of every sequence in the tree is 0 or 1, which is to say the tree is computably bounded via the constant function 2. The full form of König's lemma is not provable in WKL₀, but is equivalent to the stronger subsystem ACA₀.

[edit] Relationship to constructive mathematics and compactness

The fan theorem of Brouwer is, from a classical point of view, the contrapositive of a form of König's lemma. A subset S of $\{0,1\}^{<\omega}\,$ is called a bar if any function from $ω$ to the set ${0,1}$ has some initial segment in S. A bar is detachable if every sequence is either in the bar or not in the bar (this assumption is required because the theorem is ordinarily considered in situations where the law of the excluded middle is not assumed). A bar is uniform if there is some number N so that any function from $ω$ to ${0,1}$ has an initial segment in the bar of length no more than $N$ . Brouwer's fan theorem says that any detachable bar is uniform.

This can be proven in a classical setting by considering the bar as an open covering of the compact topological space ${0,1} ω$ . Each sequence in the bar represents a basic open set of this space, and these basic open sets cover the space by assumption. By compactness, this cover has a finite subcover. The N of the fan theorem can be taken to be the length of the longest sequence whose basic open set is in the finite subcover. This topological proof can be used in classical mathematics to show that the following form of König's lemma holds: for any natural number k, any infinite subtree of the tree $\{0,\ldots,k\}^{<\omega}\,$ has an infinite path.

[edit] Relationship with the axiom of choice

König's lemma may be considered to be a choice principle; the first proof above illustrates the relationship between the lemma and the axiom of dependent choice. At each step of the induction, a vertex with a particular property must be selected. Although it is proved that at least one appropriate vertex exists, if there is more than one suitable vertex there may be no canonical choice. This issue cannot arise if the graph is assumed to be countable.

König's lemma is essentially the restriction of the axiom of dependent choice to entire relations R such that for each x there are only finitely many z such that xRz. The form of König's lemma that says Every infinite finitely branching tree has an infinite path is equivalent to the principle that every sequence of finite sets has a choice function (compare Levy [1979, Exercise IX.2.18]). Thus there are models of ZF set theory, without choice, in which this form of König's lemma fails.

[edit] References

Cenzer, D. (1999). " $\Pi^0_1$ classes in recursion theory". Handbook of Computability Theory: 37–85, Elsevier. ISBN 0444898824.

Kőnig, D. (1936). Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Leipzig: Akad. Verlag.

Levy, A. (1979). Basic Set Theory. Springer. Reprint Dover 2002, ISBN 0486420795.

Simpson, S. (1999). Subsystems of Second Order Arithmetic. Springer.

Soare, R. (1987). Recursively Enumerable Sets and Degrees. Springer.

[edit] External links

Stanford Encyclopedia of Philosophy: Constructive Mathematics
Eric W. Weisstein, König's Lemma at MathWorld.
The Mizar project has completely formalized and automatically checked the proof of a version of König's lemma in the file TREES_2.

See also ebooksgratis.com: no banners, no cookies, totally FREE.

König's lemma

From Wikipedia, the free encyclopedia

Contents

[edit] Statement of the lemma

[edit] Proof

[edit] Computability aspects

[edit] Relationship to constructive mathematics and compactness

[edit] Relationship with the axiom of choice

[edit] References

[edit] External links

Views

Navigation

Interaction

Search

Languages