Descriptive set theory

In mathematical logic, descriptive set theory (DST) is the study of certain classes of "well-behaved" subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other areas of mathematics such as functional analysis, ergodic theory, the study of operator algebras and group actions, and mathematical logic.

Polish spaces

Descriptive set theory begins with the study of Polish spaces and their Borel sets.

A Polish space is a second-countable topological space that is metrizable with a complete metric. Heuristically, it is a complete separable metric space whose metric has been "forgotten". Examples include the real line $\mathbb {R}$ , the Baire space ${\mathcal {N}}$ , the Cantor space ${\mathcal {C}}$ , and the Hilbert cube $I^{\mathbb {N} }$ .

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_δ subspace of the Hilbert cube, and every G_δ subspace of the Hilbert cube is Polish.
Every Polish space is obtained as a continuous image of Baire 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 ${\mathcal {N}}$ has the convenient property that it is homeomorphic to ${\mathcal {N}}^{\omega }$ , many results in descriptive set theory are proved in the context of Baire space alone.

Borel sets

The class of Borel sets of a topological space X consists of all sets in the smallest σ-algebra containing the open sets of X. This means that 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 $X\setminus A$ . That is, the class of Borel sets are closed under complementation.
If A_n is a Borel set for each natural number n, then the union $\bigcup A_{n}$ is a Borel set. That is, the Borel sets are closed under countable unions.

A fundamental result shows that any two uncountable 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.

Borel hierarchy

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. The classification is in terms of countable ordinal numbers. For each nonzero countable ordinal α there are classes $\mathbf {\Sigma } _{\alpha }^{0}$ , $\mathbf {\Pi } _{\alpha }^{0}$ , and $\mathbf {\Delta } _{\alpha }^{0}$ .

Every open set is declared to be $\mathbf {\Sigma } _{1}^{0}$ .
A set is declared to be $\mathbf {\Pi } _{\alpha }^{0}$ if and only if its complement is $\mathbf {\Sigma } _{\alpha }^{0}$ .
A set A is declared to be $\mathbf {\Sigma } _{\delta }^{0}$ , δ > 1, if there is a sequence ⟨ A_i ⟩ of sets, each of which is $\mathbf {\Pi } _{\lambda (i)}^{0}$ for some λ(i) < δ, such that $A=\bigcup A_{i}$ .
A set is $\mathbf {\Delta } _{\alpha }^{0}$ if and only if it is both $\mathbf {\Sigma } _{\alpha }^{0}$ and $\mathbf {\Pi } _{\alpha }^{0}$ .

A theorem shows that any set that is $\mathbf {\Sigma } _{\alpha }^{0}$ or $\mathbf {\Pi } _{\alpha }^{0}$ is $\mathbf {\Delta } _{\alpha +1}^{0}$ , and any $\mathbf {\Delta } _{\beta }^{0}$ set is both $\mathbf {\Sigma } _{\alpha }^{0}$ and $\mathbf {\Pi } _{\alpha }^{0}$ for all α > β. Thus the hierarchy has the following structure, where arrows indicate inclusion.

${\begin{matrix}&&\mathbf {\Sigma } _{1}^{0}&&&&\mathbf {\Sigma } _{2}^{0}&&\cdots \\&\nearrow &&\searrow &&\nearrow \\\mathbf {\Delta } _{1}^{0}&&&&\mathbf {\Delta } _{2}^{0}&&&&\cdots \\&\searrow &&\nearrow &&\searrow \\&&\mathbf {\Pi } _{1}^{0}&&&&\mathbf {\Pi } _{2}^{0}&&\cdots \end{matrix}}{\begin{matrix}&&\mathbf {\Sigma } _{\alpha }^{0}&&&\cdots \\&\nearrow &&\searrow \\\quad \mathbf {\Delta } _{\alpha }^{0}&&&&\mathbf {\Delta } _{\alpha +1}^{0}&\cdots \\&\searrow &&\nearrow \\&&\mathbf {\Pi } _{\alpha }^{0}&&&\cdots \end{matrix}}$

Regularity properties 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 sets and coanalytic sets. 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-theoretic considerations and the properties of ordinal and cardinal numbers. 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 $\mathbf {\Sigma } _{1}^{1}$ if it is analytic.
A set is $\mathbf {\Pi } _{1}^{1}$ if it is coanalytic.
A set A is $\mathbf {\Sigma } _{n+1}^{1}$ if there is a $\mathbf {\Pi } _{n}^{1}$ subset B of $X\times X$ such that A is the projection of B to the first coordinate.
A set A is $\mathbf {\Pi } _{n+1}^{1}$ if there is a $\mathbf {\Sigma } _{n}^{1}$ subset B of $X\times X$ such that A is the projection of B to the first coordinate.
A set is $\mathbf {\Delta } _{n}^{1}$ if it is both $\mathbf {\Pi } _{n}^{1}$ and $\mathbf {\Sigma } _{n}^{1}$ .

As with the Borel hierarchy, for each n, any $\mathbf {\Delta } _{n}^{1}$ set is both $\mathbf {\Sigma } _{n+1}^{1}$ and $\mathbf {\Pi } _{n+1}^{1}$ .

The properties of the projective sets are not completely determined by ZFC. Under the assumption 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.

There are also generic extensions of $L$ for any natural number $n>2$ in which ${\mathcal {P}}(\omega )\cap L$ consists of all the lightface $\Delta _{n}^{1}$ subsets of $\omega$ .^[1]

More generally, the entire collection of sets of elements of a Polish space X can be grouped into equivalence classes, known as Wadge degrees, 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 Θ, with structure extending the projective hierarchy.

Borel equivalence relations

A contemporary area of research in descriptive set theory studies Borel equivalence relations. A Borel equivalence relation on a Polish space X is a Borel subset of $X\times X$ 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 versions of set theory such as Kripke–Platek set theory and second-order arithmetic.

Table

Lightface		Boldface
Σ⁰ ₀ = Π⁰ ₀ = Δ⁰ ₀ (sometimes the same as Δ⁰ ₁)		Σ⁰ ₀ = Π⁰ ₀ = Δ⁰ ₀ (if defined)
Δ⁰ ₁ = recursive		Δ⁰ ₁ = clopen
Σ⁰ ₁ = recursively enumerable	Π⁰ ₁ = co-recursively enumerable	Σ⁰ ₁ = G = open	Π⁰ ₁ = F = closed
Δ⁰ ₂		Δ⁰ ₂
Σ⁰ ₂	Π⁰ ₂	Σ⁰ ₂ = F_σ	Π⁰ ₂ = G_δ
Δ⁰ ₃		Δ⁰ ₃
Σ⁰ ₃	Π⁰ ₃	Σ⁰ ₃ = G_δσ	Π⁰ ₃ = F_σδ
⋮		⋮
Σ⁰ _<ω = Π⁰ _<ω = Δ⁰ _<ω = Σ¹ ₀ = Π¹ ₀ = Δ¹ ₀ = arithmetical		Σ⁰ _<ω = Π⁰ _<ω = Δ⁰ _<ω = Σ¹ ₀ = Π¹ ₀ = Δ¹ ₀ = boldface arithmetical
⋮		⋮
Δ⁰ _α (α recursive)		Δ⁰ _α (α countable)
Σ⁰ _α	Π⁰ _α	Σ⁰ _α	Π⁰ _α
⋮		⋮
Σ⁰ _ω^CK ₁ = Π⁰ _ω^CK ₁ = Δ⁰ _ω^CK ₁ = Δ¹ ₁ = hyperarithmetical		Σ⁰ _ω₁ = Π⁰ _ω₁ = Δ⁰ _ω₁ = Δ¹ ₁ = B = Borel
Σ¹ ₁ = lightface analytic	Π¹ ₁ = lightface coanalytic	Σ¹ ₁ = A = analytic	Π¹ ₁ = CA = coanalytic
Δ¹ ₂		Δ¹ ₂
Σ¹ ₂	Π¹ ₂	Σ¹ ₂ = PCA	Π¹ ₂ = CPCA
Δ¹ ₃		Δ¹ ₃
Σ¹ ₃	Π¹ ₃	Σ¹ ₃ = PCPCA	Π¹ ₃ = CPCPCA
⋮		⋮
Σ¹ _<ω = Π¹ _<ω = Δ¹ _<ω = Σ² ₀ = Π² ₀ = Δ² ₀ = analytical		Σ¹ _<ω = Π¹ _<ω = Δ¹ _<ω = Σ² ₀ = Π² ₀ = Δ² ₀ = P = projective
⋮		⋮

References

Kechris, Alexander S. (1994). Classical Descriptive Set Theory. Springer-Verlag. ISBN 0-387-94374-9.
Moschovakis, Yiannis N. (1980). Descriptive Set Theory. North Holland. p. 2. ISBN 0-444-70199-0.

Citations

^ V. Kanovei, V. Lyubetsky, "On the $\Delta _{n}^{1}$ problem of Harvey Friedman. In Mathematical Logic and its Applications (2020), DOI 10.3380/math8091477.

External links

Descriptive set theory, David Marker, 2002. Lecture notes.

[1] V. Kanovei, V. Lyubetsky, "On the $\Delta _{n}^{1}$ problem of Harvey Friedman. In Mathematical Logic and its Applications (2020), DOI 10.3380/math8091477.

[1]