Suslin–Kleene theorem

From testwiki
Jump to navigation Jump to search

Template:Short description

In effective descriptive set theory, the Suslin–Kleene theoremTemplate:R characterizes the hyperarithmetic subsets of ℕ. Informally, it states that the hyperarithmetic, i.e., lightface Δ11 subsets of ℕ form the “effective” σ-algebra “effectively” generated by the singletons. This is an effective analog of Suslin's theorem, which states that the subsets of a Polish space which are boldface 𝜟11, i.e., both analytic and co-analytic, are exactly the Borel subsets, which form the σ-algebra generated by open subsets.

Statement

Let X be a set. A modest assembly structure on X is a function which maps every x∈X to a non-empty subset E(x)⊆ℕ, whose elements are called the realizers of x, such that different elements do not share realizers: E(x) and E(y) are disjoint for x≠y. The realizers of x are intuitively understood as concrete computational representations of the abstract element x.

The Suslin–Kleene theorem states that the class of hyperarithmetic subsets of ℕ is the least Γ⊆𝒫(ℕ) such that there exists a modest assembly structure on Γ for which the following conditions are satisfied:

  1. For all n∈ℕ, the singleton {n} belongs to Γ. Moreover, there exists a (total) computable function S:ℕ→ℕ such that S(n) realizes {n} for all n.
  2. For all P∈Γ, the complement Pc belongs to Γ. Moreover, there exists a computable function C:ℕ→ℕ such that C(n) realizes Pc for all P∈Γ and for all n∈ℕ realizing P.
  3. For all sequence of subsets Pn∈Γ, if there exists a computable function r:ℕ→ℕ such that r(n) realizes Pn for all n, then the union ⋃n∈ℕPn belongs to Γ. Moreover, there exists a computable function U such that U(e) realizes ⋃n∈ℕPn for all sequence Pn∈Γ and for all e∈ℕ such that ϕe(n) is defined and realizes Pn for all n.

References

Template:Reflist