Definition:Tree (Set Theory)
From ProofWiki
(Redirected from Definition:Branch (Set Theory))
Definition
A tree is a partially ordered set $\left({T, \le}\right)$ such that for every $t \in T$, the set $\left\{{s \in T: s \le t}\right\}$ is well-ordered.
Branch
A branch of a tree is a maximal chain in it.
Subtree
A subtree of a tree $\left({T, \le}\right)$ is an ordered subset $\left({S, \le}\right)$ with the property that for every $s \in S$ and every $t \in T$ such that $t \le s$, $t \in S$.
Further amplification of the concepts to be done.
You can help Proof Wiki by completing it.
To discuss it in more detail, feel free to use the talk page.
When this has been done, {{WIP}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
