In mathematical logic and descriptive set theory, the analytical hierarchy is an extension of the arithmetical hierarchy. The analytical hierarchy of formulas includes formulas in the language of second-order arithmetic, which can have quantifiers over both the set of natural numbers, , and over functions from to . The analytical hierarchy of sets classifies sets by the formulas that can be used to define them; it is the lightface version of the projective hierarchy.

The analytical hierarchy of formulas

edit

The notation   indicates the class of formulas in the language of second-order arithmetic with number quantifiers but no set quantifiers. This language does not contain set parameters. The Greek letters here are lightface symbols, indicating the language choice. Each corresponding boldface symbol denotes the corresponding class of formulas in the extended language with a parameter for each real; see projective hierarchy for details.

A formula in the language of second-order arithmetic is defined to be   if it is logically equivalent to a formula of the form   where   is  . A formula is defined to be   if it is logically equivalent to a formula of the form   where   is  . This inductive definition defines the classes   and   for every natural number  .

Kuratowski and Tarski showed in 1931 that every formula in the language of second-order arithmetic has a prenex normal form,[1] and therefore is   or   for some  . Because meaningless quantifiers can be added to any formula, once a formula is given the classification   or   for some   it will be given the classifications   and   for all   greater than  .

The analytical hierarchy of sets of natural numbers

edit

A set of natural numbers is assigned the classification   if it is definable by a   formula (with one free number variable and no free set variables). The set is assigned the classification   if it is definable by a   formula. If the set is both   and   then it is given the additional classification  .

The   sets are called hyperarithmetical. An alternate classification of these sets by way of iterated computable functionals is provided by the hyperarithmetical theory.

The analytical hierarchy on subsets of Cantor and Baire space

edit

The analytical hierarchy can be defined on any effective Polish space; the definition is particularly simple for Cantor and Baire space because they fit with the language of ordinary second-order arithmetic. Cantor space is the set of all infinite sequences of 0s and 1s; Baire space is the set of all infinite sequences of natural numbers. These are both Polish spaces.

The ordinary axiomatization of second-order arithmetic uses a set-based language in which the set quantifiers can naturally be viewed as quantifying over Cantor space. A subset of Cantor space is assigned the classification   if it is definable by a   formula (with one free set variable and no free number variables). The set is assigned the classification   if it is definable by a   formula. If the set is both   and   then it is given the additional classification  .

A subset of Baire space has a corresponding subset of Cantor space under the map that takes each function from   to   to the characteristic function of its graph. A subset of Baire space is given the classification  ,  , or   if and only if the corresponding subset of Cantor space has the same classification. An equivalent definition of the analytical hierarchy on Baire space is given by defining the analytical hierarchy of formulas using a functional version of second-order arithmetic; then the analytical hierarchy on subsets of Cantor space can be defined from the hierarchy on Baire space. This alternate definition gives exactly the same classifications as the first definition.

Because Cantor space is homeomorphic to any finite Cartesian power of itself, and Baire space is homeomorphic to any finite Cartesian power of itself, the analytical hierarchy applies equally well to finite Cartesian powers of one of these spaces. A similar extension is possible for countable powers and to products of powers of Cantor space and powers of Baire space.

Extensions

edit

As is the case with the arithmetical hierarchy, a relativized version of the analytical hierarchy can be defined. The language is extended to add a constant set symbol A. A formula in the extended language is inductively defined to be   or   using the same inductive definition as above. Given a set  , a set is defined to be   if it is definable by a   formula in which the symbol   is interpreted as  ; similar definitions for   and   apply. The sets that are   or  , for any parameter Y, are classified in the projective hierarchy, and often denoted by boldface Greek letters to indicate the use of parameters.[2]

Examples

edit
  • For a relation   on  , the statement "  is a well-order on  " is  . (Not to be confused with the general case for well-founded relations on sets, see Lévy hierarchy)
  • The set of all natural numbers that are indices of computable ordinals is a   set that is not  .
  • A function   is definable by Herbrand's 1931 formalism of systems of equations if and only if   is hyperarithmetical.[3]
  • The set of continuous functions   that have the mean value property is no lower than   on the hierarchy.[4]
  • The set of elements of Cantor space that are the characteristic functions of well orderings of   is a   set that is not  . In fact, this set is not   for any element   of Baire space.
  • If the axiom of constructibility holds then there is a subset of the product of the Baire space with itself that is   and is the graph of a well ordering of Baire space. If the axiom holds then there is also a   well ordering of Cantor space.

Properties

edit

For each   we have the following strict containments:

 ,
 ,
 ,
 .

A set that is in   for some n is said to be analytical. Care is required to distinguish this usage from the term analytic set, which has a different meaning, namely  .[5]

Table

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


See also

edit

References

edit
  1. ^ P. Odifreddi, Classical Recursion Theory (1989), p.378. North-Holland, 0-444-87295-7
  2. ^ P. D. Welch, "Weak Systems of Determinacy and Arithmetical Quasi-Inductive Definitions" (2010 draft ver., p. 3). Accessed 31 July 2022.
  3. ^ P. Odifreddi, Classical Recursion Theory (1989), p.33. North-Holland, 0-444-87295-7
  4. ^ Quintanilla, M. (2022). "The realm numbers in inner models of set theory". arXiv:2206.10754 [math.LO].
  5. ^ T. Jech, "The Brave New World of Determinacy" (PDF download). Book review, Bulletin of the American Mathematical Society, vol. 5, number 3, November 1981 (pp.339--349).