|
|
| Line 1: |
Line 1: |
| {{for|the concept in descriptive set theory|Tree (descriptive set theory)}}
| | Νame: Clarence Blakеley<br>Мy age: 26 years old<br>Country: Iceland<br>Town: Hvammstangi <br>Postal code: 530<br>Street: Brеkkuɡata 35<br>http://www.fotografpeo.se/max/?2014/nike=best-ll-converse<br><br>Also visit my blog post ... [http://www.fotografpeo.se/max/?2014/nike=21k-new-balance-2011 Www.Louisvuitton.Com] |
| In [[set theory]], a '''tree''' is a [[partially ordered set]] (''T'', <) such that for each ''t'' ∈ ''T'', the set {''s'' ∈ ''T'' : ''s'' < ''t''} is [[well-ordered]] by the relation <. Frequently trees are assumed to have only one root (i.e. [[minimal element]]), as the typical questions investigated in this field are easily reduced to questions about single-rooted trees.
| |
| | |
| ==Definition==
| |
| A '''tree''' is a [[partially ordered set]] (poset) (''T'', <) such that for each ''t'' ∈ ''T'', the set {''s'' ∈ ''T'' : ''s'' < ''t''} is [[well-ordered]] by the relation <. In particular, each well-ordered set (''T'', <) is a tree. For each ''t'' ∈ ''T'', the [[order type]] of {''s'' ∈ ''T'' : ''s'' < ''t''} is called the '''height''' of ''t'' (denoted ht(''t'', ''T'')). The '''height''' of ''T'' itself is the least [[Ordinal number|ordinal]] greater than the height of each element of ''T''. A '''root''' of a tree ''T'' is an element of height 0. Frequently trees are assumed to have only one root.
| |
| | |
| Trees with a single root in which each element has finite height can be naturally viewed as rooted trees in the sense of [[tree (graph theory)|graph-theory]], or of [[tree (data structure)|theoretical computer science]]: there is an edge from ''x'' to ''y'' if and only if ''y'' is a direct successor of ''x'' (i.e., ''x''<''y'', but there is no element between ''x'' and ''y''). However, if ''T'' is a tree of height > ω, then there is no natural edge relation that will make ''T'' a tree in the sense of graph theory. For example, the set <math>\omega + 1 = \left\{0, 1, 2, \dots, \omega\right\}</math> does not have a natural edge relationship, as there is no predecessor to ω.
| |
| | |
| A '''branch''' of a tree is a maximal chain in the tree (that is, any two elements of the branch are comparable, and any element of the tree ''not'' in the branch is incomparable with at least one element of the branch). The '''length''' of a branch is the [[Ordinal number|ordinal]] that is [[Order isomorphism|order isomorphic]] to the branch. For each ordinal α, the '''α-th level''' of ''T'' is the set of all elements of ''T'' of height α. A tree is a κ-tree if and only if it has height κ and every level has size{{clarify|reason=Clarify which notion of 'size' (in particular for infinite level sets) is meant: probably cardinality - ? But cardinality is cardinal and the height is ordinal, so how can they both be the same number?|date=December 2013}} less than κ. The '''width''' of a tree is the supremum of the cardinalities of its levels.
| |
| | |
| Single-rooted trees of height ≤ ω forms a meet-semilattice, where meet (common ancestor) is given by maximal element of intersection of ancestors, which exists as the set of ancestors is non-empty and finite well-ordered, hence has a maximal element. Without a single root, the intersection of parents can be empty (two elements need not have common ancestors), for example <math>\left\{a, b\right\}</math> where the elements are not comparable; while if there are an infinite number of ancestors there need not be a maximal element – for example, <math>\left\{0, 1, 2, \dots, \omega_0, \omega_1\right\}</math> where <math>\omega_0, \omega_1</math> are not comparable.
| |
| | |
| ==Properties==
| |
| There are some fairly simply stated yet hard problems in infinite tree theory. Examples of this are the [[Kurepa conjecture]] and the [[Suslin conjecture]]. Both of these problems are known to be independent of [[Zermelo–Fraenkel set theory]]. [[König's lemma]] states that every ω-tree has an infinite branch. On the other hand, it is a theorem of ZFC that there are uncountable trees with no uncountable branches and no uncountable levels; such trees are known as [[Aronszajn tree]]s. A '''κ-[[Suslin tree]]''' is a tree of height κ which has no chains or antichains of size κ. In particular, if κ is singular (i.e. not [[regular cardinal|regular]]) then there exists a κ-Aronszajn tree and a κ-Suslin tree. In fact, for any infinite cardinal κ, every κ-Suslin tree is a κ-Aronszajn tree (the converse does not hold).
| |
| | |
| The Suslin conjecture was originally stated as a question about certain [[totally ordered set|total orderings]] but it is equivalent to the statement: Every tree of height [[First uncountable ordinal|ω<sub>1</sub>]] has an [[antichain]] of cardinality ω<sub>1</sub> or a branch of length ω<sub>1</sub>.
| |
| | |
| ==Tree (automata theory)==
| |
| [[File:An example of infinite tree structure.png|thumb|500px|alt=The graphic illustration of the example labeled tree|Graphic illustration of the labeled tree described in the example]]
| |
| Following definition of a tree is slightly different from the above formalism. For example, each node of the tree is a [[Formal language#Words over an alphabet|word]] over set of [[natural numbers]] (ℕ), which helps this definition to be used in [[automata theory]].
| |
| | |
| A '''tree''' is a set ''T'' ⊆ ℕ<sup></sup> such that if ''t''.''c'' ∈ ''T'', with ''t'' ∈ ℕ<sup>*</sup> and ''c'' ∈ ℕ, then ''t'' ∈ ''T'' and ''t''.''c''<sub>1</sub> ∈ ''T'' for all 0 ≤ ''c''<sub>1</sub> < ''c''. The elements of ''T'' are known as '''nodes''', and the empty word ε is the (single) '''root''' of ''T''. For every ''t'' ∈ ''T'', the element ''t''.''c'' ∈ ''T'' is a '''successor''' of ''t'' in '''direction''' ''c''. The number of successors of ''t'' is called its '''degree''' or '''arity''', and represented as ''d''(''t''). A node is a '''leaf''' if it has no successors. If every node of a tree has finitely many successors, then it is called a '''finitely''', otherwise an '''infinitely branching''' tree. A '''path''' π is a subset of ''T'' such that ε ∈ π and for every ''t'' ∈ ''T'', either ''t'' is a leaf or there exists a unique ''c'' ∈ ℕ such that ''t''.''c'' ∈ π. A path may be a finite or infinite set. If all paths of a tree are finite then the tree is called finite, otherwise infinite. A tree is called '''fully infinite''' if all its paths are infinite. Given an [[alphabet_(computer_science)|alphabet]] Σ, a '''Σ-labeled tree''' is a pair (''T'',''V''), where ''T'' is a tree and ''V'': ''T'' → Σ maps each node of ''T'' to a symbol in Σ. A labeled tree formally defines a commonly used [[term (logic)|term]] tree structure. A set of labeled trees is called a '''tree language'''.
| |
| | |
| A tree is called '''ranked''' if there is an order among the successors of each of its nodes. Above definition of tree naturally suggests an order among the successors, which can be used to make the tree ranked. Sometimes, an extra function ''Ar'': Σ → ℕ is defined. This function associates a fixed arity to each symbol of the alphabet. In this case, each ''t'' ∈ ''T'' has to satisfy ''Ar''(''V''(''t'')) = ''d''(''t'').
| |
| | |
| For example, above definition is used in the definition of an [[infinite tree automaton]].
| |
| | |
| ===Example===
| |
| | |
| Let ''T'' = {0,1}<sup>*</sup> and Σ = {''a'',''b''}. We define a labeling function ''V'' as follows: the labeling for the root node is ''V''(ε) = ''a'' and, for every other node ''t'' ∈ {0,1}<sup>*</sup>, the labellings for its successor nodes are ''V''(''t''.0) = ''a'' and ''V''(''t''.1) = ''b''. It is clear from the picture that ''T'' forms a (fully) infinite binary tree.
| |
| | |
| == See also ==
| |
| | |
| *[[Cantor tree]]
| |
| *[[Kurepa tree]]
| |
| *[[Laver tree]]
| |
| *[[Tree (descriptive set theory)]]
| |
| *[[Continuous graph]]
| |
| | |
| == External links ==
| |
| * [http://www.math.uu.nl/people/jvoosten/syllabi/logicasyllmoeder.pdf Sets, Models and Proofs] by [[Ieke Moerdijk]] and [http://www.math.uu.nl/people/jvoosten/ Jaap van Oosten], see Definition 3.1 and Exercise 56 on pp. 68–69.
| |
| * [http://planetmath.org/encyclopedia/TreeSetTheoretic.html tree (set theoretic)] by [http://planetmath.org/?op=getuser&id=455 Henry] on [http://planetmath.org/ PlanetMath]
| |
| * [http://planetmath.org/encyclopedia/Branch.html branch] by [http://planetmath.org/?op=getuser&id=455 Henry] on [http://planetmath.org/ PlanetMath]
| |
| * [http://planetmath.org/encyclopedia/ExampleOfTreeSetTheoretic.htm example of tree (set theoretic)] by [http://planetmath.org/?op=getuser&id=4983 uzeromay] on [http://planetmath.org/ PlanetMath]
| |
| | |
| == References ==
| |
| * {{cite book|author=Jech, Thomas|title=Set Theory|publisher=Springer-Verlag|year=2002|isbn=3-540-44085-2}}
| |
| * {{cite book|authorlink=Kenneth Kunen|author=Kunen, Kenneth|title=[[Set Theory: An Introduction to Independence Proofs]]|publisher=North-Holland|year=1980|isbn=0-444-85401-0}} Chapter 2, Section 5.
| |
| * {{cite book|last=Monk|first=J. Donald|title=Mathematical Logic|publisher=Springer-Verlag|location=New York|year=1976|pages=517|isbn=0-387-90170-1}}
| |
| * {{cite book|authorlink=András Hajnal|last=Hajnal|first=András|coauthors=Hamburger Péter|title=Set Theory|publisher=Cambridge University Press|location=Cambridge|year=1999}}
| |
| | |
| [[Category:Set theory]]
| |
| [[Category:Trees (set theory)|*]]
| |