Content deleted Content added
whitespace |
expand |
||
Line 1:
In [[mathematical logic]], '''descriptive set theory''' is the study of certain classes of "[[well-behaved]]" [[set (mathematics)|
== Polish spaces ==
Descriptive set theory begins with the study of Polish spaces and their Borel sets.
Many questions in descriptive set theory ultimately depend upon [[set theory|set-theoretic]] considerations and the properties of [[ordinal number|ordinal]] and [[cardinal number]]s.▼
A '''[[Polish space]]''' is a [[second countable]] [[topological space]] that is [[metrizable]] with a [[complete metric]]. Equivalently, it is a complete separable metric space from which the metric has been "forgotten". Examples include the [[real line]], the [[Baire space]], the [[Cantor space]], and the [[Hilbert cube]].
=== Universality properties ===
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.
* Every Polish space is [[homeomorphic]] to a ''G''<sub>δ</sub> [[subspace topology|subspace]] of the [[Hilbert cube]], and every ''G''<sub>δ</sub> subspace of the Hilbert cube is Polish.
* Every Polish space is obtained as a continuous image of Bairse space; in fact every Polish space is the image of a continuous bijection defined on a closed subset of Baire space. Similarly, every compact Polish space is a continuous image of Cantor space.
Because of these universality properties, and because the Baire space <math>\mathcal{N}</math> has the convenient property that it is homeomorphic to <math>\mathcal{N}^\omega</math>, many results in descriptive set theory are proved in the context of Baire space alone.
== Borel sets ==
The class of '''[[Borel set]]s''' of a topological space ''X'' consists of all sets in the smallest [[sigma-algebra|σ-algebra]] containing the open sets of ''X''. This means that the the Borel sets of ''X'' are the smallest collection of sets such that:
* Every open subset of ''X'' is a Borel set.
* If ''A'' is a Borel set, so is <math>X \setminus A</math>. That is, the class of Borel sets are closed under complementation.
* If ''A''<sub>''n''</sub> is a Borel set for each natural number ''n'', then the union <math>\bigcup A_n</math> is a Borel set. That is, the Borel sets are closed under countable unions.
Each Borel set of a Polish space is classified in the '''[[Borel hierarchy]]''' based on how many times the operations of countable union and complementation must be used to obtain the set, beginning from open sets.
<!-- diagram -->
A fundamental result shows that any two Polish spaces ''X'' and ''Y'' are '''Borel isomorphic''': there is a bijection from ''X'' to ''Y'' 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.
Classical descriptive set theory includes the study of regularity properties of Borel sets. For example, all Borel sets of a Polish space have the [[property of Baire]] and the [[perfect 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.
== Analytic and coanalytic sets ==
Just beyond the Borel sets in complexity are the [[analytic set]]s and [[coanalytic set]]s. A subset of a Polish space ''X'' is '''analytic''' 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 is '''coanalytic''' if its complement is analytic.
== Projective sets and Wadge degrees ==
▲Many questions in descriptive set theory ultimately depend upon [[set theory|set-theoretic]] considerations and the properties of [[ordinal number|ordinal]] and [[cardinal number]]s. This phenomenon is particularly apparent in the '''projective sets'''. These are defined via the [[projective hierarchy]] on a Polish space ''X'':
* A set is declared to be <math>\mathbf{\Sigma}^1_1</math> if it is analytic.
* A set if <math>\mathbf{\Pi}^1_1</math> if it is coanalytic.
* A set ''A'' is <math>\mathbf{\Sigma}^1_{n+1}</math> if there is a <math>\mathbf{\Pi}^1_n</math> subset ''B'' of <math>X \times X</math> such that ''A'' is the projection of ''B'' to the first coordinate.
* A set ''A'' is <math>\mathbf{\Pi}^1_{n+1}</math> if there is a <math>\mathbf{\Sigma}^1_n</math> subset ''B'' of <math>X \times X</math> such that ''A'' is the projection of ''B'' to the first coordinate.
* A set is <math>\mathbf{\Delta}^1_{n}</math> if it is both <math>\mathbf{\Pi}^1_n</math> and <math>\mathbf{\Sigma}^1_n</math> .
As with the Borel hierarchy, for each ''n'', any <math>\mathbf{\Delta}^1_n</math> set is both <math>\mathbf{\Sigma}^1_{n+1}</math> and <math>\mathbf{\Pi}^1_{n+1}.</math>
The properties of the projective sets are not completely determined by ZFC. Under the assumption [[axiom of constructibility|''V = L'']], not all projective sets have the perfect set property or the property of Baire. However, under the assumption of [[projective determinacy]], all projective sets have both the perfect set property and the property of Baire. This is related to the fact that ZFC proves [[Borel determinacy]], but not projective determinacy.
More generally, the entire collection of sets of elements of a Polish space ''X'' can be grouped into equivalence classes, known as [[Wadge degree]]s, that generalize the projective hierarchy. These degrees are ordered in the [[Wadge hierarchy]]. The [[axiom of determinacy]] implies that the Wadge hierarchy on any Polish space is well-founded and of length [[Θ (set theory)|Θ]], with structure extending the projective hierarchy.
== Borel equivalence relations ==
A contemporary area of research in descriptive set theory studies '''[[Borel equivalence relation]]s'''. A '''Borel equivalence relation''' on a Polish space ''X'' is a Borel subset of <math>X \times X</math> that is an [[equivalence relation]] on ''X''.
== Effective descriptive set theory ==
The area of [[effective descriptive set theory]] combines the methods of descriptive set theory with those of [[generalized recursion theory]] (especially [[hyperarithmetical theory]]). In particular, it focuses on [[lightface]] analogues of hierarchies of classical descriptive set theory. Thus the [[hyperarithmetic hierarchy]] is studied instead of the Borel hierarchy, and the [[analytical hierarchy]] instead of the projective hierarchy. This research is related to weaker version of set theory such as [[Kripke-Platek set theory]] and [[second-order arithmetic]].
==See also==
Line 10 ⟶ 63:
==References==
* {{cite book | author=Kechris, Alexander S. | title=Classical Descriptive Set Theory | publisher=Springer-Verlag | year=1994 | id=ISBN 0-387-94374-9}}
* {{cite book | author=Moschovakis, Yiannis N. | title=Descriptive Set Theory | publisher=North Holland | year=1980 |id=ISBN 0-444-70199-0}}
== External links ==
* [http://www.math.uic.edu/~marker/math512/dst.pdf Descriptive set theory], David Marker, 2002. Lecture notes.
[[Category:Descriptive set theory| ]]
Line 16 ⟶ 75:
[[it:Teoria descrittiva degli insiemi]]
[[zh:描述集合論]]
| |||