Pointclass

In the mathematical field of descriptive set theory, a pointclass is a collection of sets of points, where a point is ordinarily understood to be an element of some perfect Polish space. In practice, a pointclass is usually characterized by some sort of definability property; for example, the collection of all open sets in some fixed collection of Polish spaces is a pointclass. (An open set may be seen as in some sense definable because it cannot be a purely arbitrary collection of points; for any point in the set, all points sufficiently close to that point must also be in the set.)

Pointclasses find application in formulating many important principles and theorems from set theory and real analysis. Strong set-theoretic principles may be stated in terms of the determinacy of various pointclasses, which in turn implies that sets in those pointclasses (or sometimes larger ones) have regularity properties such as Lebesgue measurability (and indeed universal measurability), the property of Baire, and the perfect set property.

Basic framework

In practice, descriptive set theorists often simplify matters by working in a fixed Polish space such as Baire space or sometimes Cantor space, each of which has the advantage of being zero dimensional, and indeed homeomorphic to its finite or countable powers, so that considerations of dimensionality never arise. Yiannis Moschovakis provides greater generality by fixing once and for all a collection of underlying Polish spaces, including the set of all naturals, the set of all reals, Baire space, and Cantor space, and otherwise allowing the reader to throw in any desired perfect Polish space. Then he defines a product space to be any finite Cartesian product of these underlying spaces. Then, for example, the pointclass ${\displaystyle {\boldsymbol {\Sigma }}_{1}^{0}}$ of all open sets means the collection of all open subsets of one of these product spaces. This approach prevents ${\displaystyle {\boldsymbol {\Sigma }}_{1}^{0}}$ from being a proper class, while avoiding excessive specificity as to the particular Polish spaces being considered (given that the focus is on the fact that ${\displaystyle {\boldsymbol {\Sigma }}_{1}^{0}}$ is the collection of open sets, not on the spaces themselves).

Boldface pointclasses

The pointclasses in the Borel hierarchy, and in the more complex projective hierarchy, are represented by sub- and super-scripted Greek letters in boldface fonts; for example, ${\displaystyle {\boldsymbol {\Pi }}_{1}^{0}}$ is the pointclass of all closed sets, ${\displaystyle {\boldsymbol {\Sigma }}_{2}^{0}}$ is the pointclass of all F_σ sets, ${\displaystyle {\boldsymbol {\Delta }}_{2}^{0}}$ is the collection of all sets that are simultaneously F_σ and G_δ, and ${\displaystyle {\boldsymbol {\Sigma }}_{1}^{1}}$ is the pointclass of all analytic sets.

Sets in such pointclasses need be "definable" only up to a point. For example, every singleton set in a Polish space is closed, and thus ${\displaystyle {\boldsymbol {\Pi }}_{1}^{0}}$. Therefore, it cannot be that every ${\displaystyle {\boldsymbol {\Pi }}_{1}^{0}}$ set must be "more definable" than an arbitrary element of a Polish space (say, an arbitrary real number, or an arbitrary countable sequence of natural numbers). Boldface pointclasses, however, may (and in practice ordinarily do) require that sets in the class be definable relative to some real number, taken as an oracle. In that sense, membership in a boldface pointclass is a definability property, even though it is not absolute definability, but only definability with respect to a possibly undefinable real number.

Boldface pointclasses, or at least the ones ordinarily considered, are closed under Wadge reducibility; that is, given a set in the pointclass, its inverse image under a continuous function (from a product space to the space of which the given set is a subset) is also in the given pointclass. Thus a boldface pointclass is a downward-closed union of Wadge degrees.

Lightface pointclasses

The Borel and projective hierarchies have analogs in effective descriptive set theory in which the definability property is no longer relativized to an oracle, but is made absolute. For example, if one fixes some collection of basic open neighborhoods (say, in Baire space, the collection of sets of the form {x∈ω^ω ${\displaystyle \mid }$ s is an initial segment of x} for each fixed finite sequence s of natural numbers), then the open, or ${\displaystyle {\boldsymbol {\Sigma }}_{1}^{0}}$, sets may be characterized as all (arbitrary) unions of basic open neighborhoods. The analogous ${\displaystyle \Sigma _{1}^{0}}$ sets, with a lightface ${\displaystyle \Sigma }$, are no longer arbitrary unions of such neighborhoods, but computable unions of them. That is, a set is lightface ${\displaystyle \Sigma _{1}^{0}}$, also called effectively open, if there is a computable set S of finite sequences of naturals such that the given set is the union of the sets {x∈ω^ω ${\displaystyle \mid }$ s is an initial segment of x} for s in S.

A set is lightface ${\displaystyle \Pi _{1}^{0}}$ if it is the complement of a ${\displaystyle \Sigma _{1}^{0}}$ set. Thus each ${\displaystyle \Sigma _{1}^{0}}$ set has at least one index, which describes the computable function enumerating the basic open sets from which it is composed; in fact it will have infinitely many such indices. Similarly, an index for a ${\displaystyle \Pi _{1}^{0}}$ set B describes the computable function enumerating the basic open sets in the complement of B.

A set A is lightface ${\displaystyle \Sigma _{2}^{0}}$ if it is a union of a computable sequence of ${\displaystyle \Pi _{1}^{0}}$ sets (that is, there is a computable enumeration of indices of ${\displaystyle \Pi _{1}^{0}}$ sets such that A is the union of these sets). This relationship between lightface sets and their indices is used to extend the lightface Borel hierarchy into the transfinite, via recursive ordinals. This produces the hyperarithmetic hierarchy, which is the lightface analog of the Borel hierarchy. (The finite levels of the hyperarithmetic hierarchy are known as the arithmetical hierarchy.)

A similar treatment can be applied to the projective hierarchy. Its lightface analog is known as the analytical hierarchy.

Summary

Each class is at least as large as the classes above it.

This box:

• view
• talk
• edit

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
⋮		⋮

References

• Moschovakis, Yiannis N. (1980). Descriptive Set Theory. North Holland. ISBN 0-444-70199-0.