Inmathematical logic,descriptive set theory (DST) is the study of certain classes of "well-behaved"subsets of thereal line and otherPolish spaces. As well as being one of the primary areas of research inset theory, it has applications to other areas of mathematics such asfunctional analysis,ergodic theory, the study ofoperator algebras andgroup actions, andmathematical logic.
Descriptive set theory begins with the study of Polish spaces and theirBorel sets.
APolish space is asecond-countabletopological space that ismetrizable with acomplete metric. Heuristically, it is a completeseparable metric space whose metric has been "forgotten". Examples include thereal line, theBaire space, theCantor space, and theHilbert cube.
The class of Polish spaces has several universality properties, which show that there is no loss of generality in considering Polish spaces of certain restricted forms.
Because of these universality properties, and because the Baire space has the convenient property that it ishomeomorphic to, many results in descriptive set theory are proved in the context of Baire space alone.
The class ofBorel sets of a topological spaceX consists of all sets in the smallestσ-algebra containing the open sets ofX. This means that the Borel sets ofX are the smallest collection of sets such that:
A fundamental result shows that any two uncountable Polish spacesX andY areBorel isomorphic: there is a bijection fromX toY such that the preimage of any Borel set is Borel, and the image of any Borel set is Borel. This gives additional justification to the practice of restricting attention to Baire space and Cantor space, since these and any other Polish spaces are all isomorphic at the level of Borel sets.
Each Borel set of a Polish space is classified in theBorel hierarchy based on how many times the operations of countable union and complementation must be used to obtain the set, beginning from open sets. The classification is in terms ofcountableordinal numbers. For each nonzero countable ordinalα there are classes,, and.
A theorem shows that any set that is or is, and any set is both and for allα >β. Thus the hierarchy has the following structure, where arrows indicate inclusion.
Classical descriptive set theory includes the study of regularity properties of Borel sets. For example, all Borel sets of a Polish space have theproperty of Baire and theperfect set property. Modern descriptive set theory includes the study of the ways in which these results generalize, or fail to generalize, to other classes of subsets of Polish spaces.
Just beyond the Borel sets in complexity are theanalytic sets andcoanalytic sets. A subset of a Polish spaceX isanalytic if it is the continuous image of a Borel subset of some other Polish space. Although any continuous preimage of a Borel set is Borel, not all analytic sets are Borel sets. A set iscoanalytic if its complement is analytic.
Many questions in descriptive set theory ultimately depend uponset-theoretic considerations and the properties ofordinal andcardinal numbers. This phenomenon is particularly apparent in theprojective sets. These are defined via theprojective hierarchy on a Polish spaceX:
As with the Borel hierarchy, for eachn, any set is both and.
The properties of the projective sets are not completely determined by ZFC. Under the assumptionV = L, not all projective sets have the perfect set property or the property of Baire. However, under the assumption ofprojective determinacy, all projective sets have both the perfect set property and the property of Baire. This is related to the fact that ZFC provesBorel determinacy, but not projective determinacy.
There are also generic extensions of for any natural number in which consists of all the lightface subsets of.[1]
More generally, the entire collection of sets of elements of a Polish spaceX can be grouped into equivalence classes, known asWadge degrees, that generalize the projective hierarchy. These degrees are ordered in theWadge hierarchy. Theaxiom of determinacy implies that the Wadge hierarchy on any Polish space is well-founded and of lengthΘ, with structure extending the projective hierarchy.
A contemporary area of research in descriptive set theory studiesBorel equivalence relations. ABorel equivalence relation on a Polish spaceX is a Borel subset of that is anequivalence relation onX.
The area ofeffective descriptive set theory combines the methods of descriptive set theory with those ofgeneralized recursion theory (especiallyhyperarithmetical theory). In particular, it focuses onlightface analogues of hierarchies of classical descriptive set theory. Thus thehyperarithmetic hierarchy is studied instead of the Borel hierarchy, and theanalytical hierarchy instead of the projective hierarchy. This research is related to weaker versions of set theory such asKripke–Platek set theory andsecond-order arithmetic.
| Lightface | Boldface | ||
|---|---|---|---|
| Σ0 0 = Π0 0 = Δ0 0 (sometimes the same as Δ0 1) | Σ0 0 =Π0 0 =Δ0 0 (if defined) | ||
| Δ0 1 =recursive | Δ0 1 =clopen | ||
| Σ0 1 =recursively enumerable | Π0 1 = co-recursively enumerable | Σ0 1 =G =open | Π0 1 =F =closed |
| Δ0 2 | Δ0 2 | ||
| Σ0 2 | Π0 2 | Σ0 2 =Fσ | Π0 2 =Gδ |
| Δ0 3 | Δ0 3 | ||
| Σ0 3 | Π0 3 | Σ0 3 =Gδσ | Π0 3 =Fσδ |
| ⋮ | ⋮ | ||
| Σ0 <ω = Π0 <ω = Δ0 <ω = Σ1 0 = Π1 0 = Δ1 0 =arithmetical | Σ0 <ω =Π0 <ω =Δ0 <ω =Σ1 0 =Π1 0 = Δ1 0 = boldface arithmetical | ||
| ⋮ | ⋮ | ||
| Δ0 α (αrecursive) | Δ0 α (αcountable) | ||
| Σ0 α | Π0 α | Σ0 α | Π0 α |
| ⋮ | ⋮ | ||
| Σ0 ωCK 1 = Π0 ωCK 1 = Δ0 ωCK 1 = Δ1 1 =hyperarithmetical | Σ0 ω1 =Π0 ω1 =Δ0 ω1 =Δ1 1 =B =Borel | ||
| Σ1 1 = lightface analytic | Π1 1 = lightface coanalytic | Σ1 1 = A =analytic | Π1 1 = CA =coanalytic |
| Δ1 2 | Δ1 2 | ||
| Σ1 2 | Π1 2 | Σ1 2 = PCA | Π1 2 = CPCA |
| Δ1 3 | Δ1 3 | ||
| Σ1 3 | Π1 3 | Σ1 3 = PCPCA | Π1 3 = CPCPCA |
| ⋮ | ⋮ | ||
| Σ1 <ω = Π1 <ω = Δ1 <ω = Σ2 0 = Π2 0 = Δ2 0 =analytical | Σ1 <ω =Π1 <ω =Δ1 <ω =Σ2 0 =Π2 0 = Δ2 0 =P =projective | ||
| ⋮ | ⋮ | ||