Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Descriptive set theory

From Wikipedia, the free encyclopedia
Subfield of mathematical logic

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.

Polish spaces

[edit]

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 lineR{\displaystyle \mathbb {R} }, theBaire spaceN{\displaystyle {\mathcal {N}}}, theCantor spaceC{\displaystyle {\mathcal {C}}}, and theHilbert cubeIN{\displaystyle I^{\mathbb {N} }}.

Universality properties

[edit]

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 ishomeomorphic to aGδ subspace of theHilbert cube, and everyGδ 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 spaceN{\displaystyle {\mathcal {N}}} has the convenient property that it ishomeomorphic toNω{\displaystyle {\mathcal {N}}^{\omega }}, many results in descriptive set theory are proved in the context of Baire space alone.

Borel sets

[edit]

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:

  • Every open subset ofX is a Borel set.
  • IfA is a Borel set, so isXA{\displaystyle X\setminus A}. That is, the class of Borel sets are closed under complementation.
  • IfAn is a Borel set for each natural numbern, then the unionAn{\displaystyle \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 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.

Borel hierarchy

[edit]

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Σα0{\displaystyle \mathbf {\Sigma } _{\alpha }^{0}},Πα0{\displaystyle \mathbf {\Pi } _{\alpha }^{0}}, andΔα0{\displaystyle \mathbf {\Delta } _{\alpha }^{0}}.

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

Σ10Σ20Δ10Δ20Π10Π20Σα0Δα0Δα+10Πα0{\displaystyle {\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

[edit]

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.

Analytic and coanalytic sets

[edit]

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.

Projective sets and Wadge degrees

[edit]

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Δn1{\displaystyle \mathbf {\Delta } _{n}^{1}} set is bothΣn+11{\displaystyle \mathbf {\Sigma } _{n+1}^{1}} andΠn+11{\displaystyle \mathbf {\Pi } _{n+1}^{1}}.

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 ofL{\displaystyle L} for any natural numbern>2{\displaystyle n>2} in whichP(ω)L{\displaystyle {\mathcal {P}}(\omega )\cap L} consists of all the lightfaceΔn1{\displaystyle \Delta _{n}^{1}} subsets ofω{\displaystyle \omega }.[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.

Borel equivalence relations

[edit]

A contemporary area of research in descriptive set theory studiesBorel equivalence relations. ABorel equivalence relation on a Polish spaceX is a Borel subset ofX×X{\displaystyle X\times X} that is anequivalence relation onX.

Effective descriptive set theory

[edit]

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.

Table

[edit]
LightfaceBoldface
Σ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

See also

[edit]

References

[edit]

Citations

[edit]
  1. ^V. Kanovei, V. Lyubetsky, "On theΔn1{\displaystyle \Delta _{n}^{1}} problem of Harvey Friedman. InMathematical Logic and its Applications (2020), DOI10.3380/math8091477.

External links

[edit]
International
National
Retrieved from "https://en.wikipedia.org/w/index.php?title=Descriptive_set_theory&oldid=1336896856"
Category:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp