Jump to content

Tree (descriptive set theory)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Trovatore (talk | contribs) at 03:33, 8 July 2005 (Restate def of "pruned"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In descriptive set theory, a tree on a set is a subset of (that is, a set of finite sequences of elements of ) that is closed under subsequence (that is, if and , then ). A branch through is an infinite sequence of elements of such that, for every natural number , , where denotes the sequence of the first elements of . The set of all branches through is denoted . A tree that has no branches is called wellfounded; a tree with at least one branch is illfounded.

A node (that is, element) of is terminal if there is no node of properly extending it; that is, is terminal if there is no element of such that that . A tree with no terminal nodes is called pruned.

Frequently trees on cartesian products are considered. In this case, by convention, the set is identified in the natural way with , and is considered as a subset of . We may then form the projection of ,