Under the Axiom of Determinacy, the paper demonstrates that all non-selfdual Wadge classes can be systematically constructed from level ω₁ classes using expansion and separated differences, providing new insights and proofs in descriptive set theory.
Contribution
It introduces a method to construct all non-selfdual Wadge classes from level ω₁ classes through specific operations, offering a new proof of Van Wesep's theorem.
Findings
01
Every non-selfdual Wadge class can be constructed from level ω₁ classes.
02
A new proof of Van Wesep's theorem is provided.
03
The construction uses expansion and separated differences operations.
Abstract
We show that, assuming the Axiom of Determinacy, every non-selfdual Wadge class can be constructed by starting with those of level ω1 (that is, the ones that are closed under Borel preimages) and iteratively applying the operations of expansion and separated differences. The proof is essentially due to Louveau, and it yields at the same time a new proof of a theorem of Van Wesep (namely, that every non-selfdual Wadge class can be expressed as the result of a Hausdorff operation applied to the open sets). The exposition is self-contained, except for facts from classical descriptive set theory.
Equations168
Γ={f−1[A]:f:Z⟶Z is a continuous function}.
Γ={f−1[A]:f:Z⟶Z is a continuous function}.
ΓD(Z)={HD(U0,U1,…):U0,U1,…∈Σ10(Z)}
ΓD(Z)={HD(U0,U1,…):U0,U1,…∈Σ10(Z)}
A↓={B⊆Z:B≤A}.
A↓={B⊆Z:B≤A}.
\left.\begin{array}[]{lcl}&&\mathsf{D}_{\eta}(A_{\mu}:\mu<\eta)=\left\{\begin{array}[]{ll}\bigcup\{A_{\mu}\setminus\bigcup_{\zeta<\mu}A_{\zeta}:\mu<\eta\text{ and }\mu\text{ is odd}\}&\text{if }\eta\text{ is even,}\\
\bigcup\{A_{\mu}\setminus\bigcup_{\zeta<\mu}A_{\zeta}:\mu<\eta\text{ and }\mu\text{ is even}\}&\text{if }\eta\text{ is odd.}\end{array}\right.\end{array}\right.
\left.\begin{array}[]{lcl}&&\mathsf{D}_{\eta}(A_{\mu}:\mu<\eta)=\left\{\begin{array}[]{ll}\bigcup\{A_{\mu}\setminus\bigcup_{\zeta<\mu}A_{\zeta}:\mu<\eta\text{ and }\mu\text{ is odd}\}&\text{if }\eta\text{ is even,}\\
\bigcup\{A_{\mu}\setminus\bigcup_{\zeta<\mu}A_{\zeta}:\mu<\eta\text{ and }\mu\text{ is even}\}&\text{if }\eta\text{ is odd.}\end{array}\right.\end{array}\right.
NSD(Z)={Γ:Γ is a non-selfdual Wadge class in Z}.
NSD(Z)={Γ:Γ is a non-selfdual Wadge class in Z}.
Wa(Z)={{Γ,Γ}:Γ is a Wadge class in Z}.
Wa(Z)={{Γ,Γ}:Γ is a Wadge class in Z}.
∣∣Γ∣∣=1+ϕ({Γ,Γ}).
∣∣Γ∣∣=1+ϕ({Γ,Γ}).
U∖A=(Z∖(A∩U))∩U≤Z∖(A∩U)≤A,
U∖A=(Z∖(A∩U))∩U≤Z∖(A∩U)≤A,
I(A)={V∈Δ10(Z): there exists a partition U⊆Δ10(V) of V such that U∩A<A in Z for every U∈U}.
I(A)={V∈Δ10(Z): there exists a partition U⊆Δ10(V) of V such that U∩A<A in Z for every U∈U}.
ΓD(Z)={HD(A0,A1,…):An∈Σ10(Z) for every n∈ω}.
ΓD(Z)={HD(A0,A1,…):An∈Σ10(Z) for every n∈ω}.
Ha(Z)={ΓD(Z):D⊆P(ω)}.
Ha(Z)={ΓD(Z):D⊆P(ω)}.
Δξ+10(Z)=1≤η<ω1⋃Dη(Σξ0(Z)).
Δξ+10(Z)=1≤η<ω1⋃Dη(Σξ0(Z)).
A∩U=(Z∖((Z∖A)∩U))∩U∈Dξ(Σ10(Z))
A∩U=(Z∖((Z∖A)∩U))∩U∈Dξ(Σ10(Z))
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
We show that, assuming the Axiom of Determinacy, every non-selfdual Wadge class can be constructed by starting with those of level ω1 (that is, the ones that are closed under Borel preimages) and iteratively applying the operations of expansion and separated differences. The proof is essentially due to Louveau, and it yields at the same time a new proof of a theorem of Van Wesep (namely, that every non-selfdual Wadge class can be expressed as the result of a Hausdorff operation applied to the open sets). The exposition is self-contained, except for facts from classical descriptive set theory.
The first-listed author acknowledges the support of the FWF grant P 28153 and of the PRIN grant 2017NWTM8R. The second-listed author acknowledges the support of the FWF grant P 30823. The third-listed author (formerly known as Sandra Uhlenbrock) acknowledges the support of the FWF grants P 28157 and V 844, as well as funding from L’ORÉAL Austria, in collaboration with the Austrian UNESCO Commission and in cooperation with the Austrian Academy of Sciences, through the fellowship “Determinacy and Large Cardinals”. The authors are grateful to Alessandro Andretta for valuable bibliographical help, to Alain Louveau for allowing them to use his unpublished book [Lo2], and to Salvatore Scamperti for spotting several inaccuracies.
Throughout this article, unless we specify otherwise, we will be working in the theory ZF+DC, that is, the usual axioms of Zermelo-Fraenkel (without the Axiom of Choice) plus the principle of Dependent Choices (see Section 2 for more details). Given a set Z, we will denote by P(Z) the collection of all subsets of Z. By space, we will always mean separable metrizable topological space.
Given a space Z, we will say that Γ is a Wadge class in Z if there exists A⊆Z such that
[TABLE]
Given a set Z and Γ⊆P(Z), define Γ={Z∖A:A∈Γ}. We will say that Γ is selfdual if Γ=Γ. Observe that {∅} and {Z} are non-selfdual Wadge classes whenever Z is non-empty. The systematic study of these classes, founded by William Wadge in his doctoral thesis [Wa1] (see also [Wa2]), is known as Wadge theory, and it has become a classical topic in descriptive set theory (see [Ke, Section 21.E]). Under suitable determinacy assumptions, the collection of all Wadge classes on a zero-dimensional Polish space Z, ordered by inclusion, constitutes a well-behaved hierarchy that is similar to, but much finer than the well-known Borel hierarchy (and not limited to sets of low complexity).
In [Lo1], Alain Louveau gave a complete description of the non-selfdual Borel Wadge classes, by using an iterative process built on five basic operations.
Subsequently, in his unpublished book [Lo2], he obtained the following theorem, that reduces the number of operations to two (namely, expansion and separated differences).
Since it would not be feasible to introduce all the relevant notions here, for now we will only mention that Γ(ξ) denotes the operation of expansion, SDη denotes the operation of separated differences, and ℓ(Γ) denotes the level of Γ (see Sections 13, 19, and 15 respectively).
Theorem 1.1** (Louveau).**
The collection of all non-selfdual Borel Wadge classes in ωω is equal to Lo, where Lo is the smallest collection satisfying the following conditions:
•
{∅}∈Lo* and {ωω}∈Lo,*
•
Γ(ξ)∈Lo* whenever Γ∈Lo and ξ<ω1,*
•
SDη(Δ,Γ)∈Lo, where Δ=⋃n∈ω(Λn∪Λn), whenever 1≤η<ω1, Γ∈Lo and Λn∈Lo for n∈ω are such that Γ⊆Δ and ℓ(Λn)≥1 for each n.
The final fundamental notion for this article is that of a Hausdorff operation. In Section 8, given D⊆P(ω), we will show how to simultaneously define a function HD:P(Z)ω⟶P(Z) for every set Z. Functions of this form are known as Hausdorff operations. The most basic examples of Hausdorff operation are those obtained by combining the usual set-theoretic operations of union, intersection, and complement (see Proposition 8.2). When Z is a space (as opposed to just a set), we will let
[TABLE]
denote the class in Z associated to HD. Under rather mild assumptions on Z, using universal sets, it is not hard to show that each ΓD(Z) is a non-selfdual Wadge class in Z (see Theorem 10.5).
In fact, in his doctoral thesis, Robert Van Wesep built on work of Addison, Steel, and Radin to obtain the following result (see [VW, Proposition 5.0.3 and Theorem 5.3.1]).
Theorem 1.2** (Van Wesep).**
Assume that the Axiom of Determinacy holds. Then the following conditions are equivalent:
•
Γ* is a non-selfdual Wadge class in ωω,*
•
Γ=ΓD(ωω)* for some D⊆P(ω).*
The purpose of this article is to give a self-contained (except for facts from [Ke]) proof of Theorem 22.2, which simultaneously generalizes Theorems 1.1 and 1.2. There are several ways in which Theorem 22.2 generalizes the above results. First, the ambient space is an arbitrary uncountable zero-dimensional Polish space instead of ωω. Second, unlike Theorem 1.1, it applies to classes beyond the Borel realm. Third, it gives a level-by-level result, in the sense that to obtain the desired result for classes of a given complexity, only the corresponding determinacy assumption will be required.
In our previous paper [CMM] (which has a significant overlap with the present one111 In particular, Sections 8, 9, 10, 13 and 16 are almost verbatim the same as the corresponding sections in [CMM].), we generalized results of van Engelen from Borel spaces to arbitrary spaces (assuming the Axiom of Determinacy). We hope and expect that the results proved here will yield similar applications in the future.
We would like to point out that many of our proofs are essentially the same as those from [Lo2, Section 7.3]. However, as that is an unpublished manuscript, numerous gaps had to be filled. Most notably, [Lo2] lacks any treatment of relativization (see Sections 6, 7 and 14). Furthermore, for the general case, we will employ ideas of Radin that were not needed in the Borel case (see Section 21).
Finally, we remark that Theorem 22.2 is in a sense more transparent than Theorem 1.2, as it specifies more clearly which Hausdorff operations generate the given Wadge classes. This approach is based once again on unpublished results of Louveau, which are however limited to the Borel realm (see [Lo2, Corollary 7.3.11 and Theorem 7.3.12]).
2. Preliminaries and notation
Given a function f:Z⟶W, A⊆Z and B⊆W, we will use the notation f[A]={f(x):x∈A} and f−1[B]={x∈Z:f(x)∈B}.
Definition 2.1** (Wadge).**
Let Z be a space, and let A,B⊆Z. We will write A≤B if there exists a continuous function f:Z⟶Z such that A=f−1[B].222 Wadge-reduction is usually denoted by ≤W, which allows to distinguish it from other types of reduction (such as Lipschitz-reduction). Since we will not consider any other type of reduction in this article, we decided to simplify the notation. In this case, we will say that A is Wadge-reducible to B, and that fwitnesses the reduction. We will write A<B if A≤B and B≤A. We will write A≡B if A≤B and B≤A.
Definition 2.2** (Wadge).**
Let Z be a space. Given A⊆Z, define
[TABLE]
Given Γ⊆P(Z), we will say that Γ is a Wadge class if there exists A⊆Z such that Γ=A↓, and that Γ is continuously closed if A↓⊆Γ for every A∈Γ.
Both of the above definitions depend of course on the space Z. Often, for the sake of clarity, we will specify what the ambient space is by saying, for example, that “A≤B in Z” or “Γ is a Wadge class in Z”. We will say that A⊆Z is selfdual if A≤Z∖A in Z. It is easy to check that A is selfdual iff A↓ is selfdual.
Our reference for descriptive set theory is [Ke]. In particular, we assume familiarity with the basic theory of Polish spaces, and their Borel and projective subsets. We use the same notation as in [Ke, Section 11]. For example, given a space Z, the collection of all Borel subsets of Z is denoted by B(Z), while Σ10(Z), Π10(Z) and Δ10(Z) denote the collections of all open, closed and clopen subsets of Z respectively. Given spaces Z and W, we will say that j:Z⟶W is an embedding if j:Z⟶j[Z] is a homeomorphism. Recall that the classes Σn1(Z) for 1≤n<ω can be defined for an arbitrary (that is, not necessarily Polish) space Z by declaring A∈Σn1(Z) if there exist a Polish space W and an embedding j:Z⟶W such that j[A]=B∩j[Z] for some B∈Σn1(W).444 This is the same definition given in [Ke, page 315]. Using the methods of the proof of [MZ, Proposition 4.2], one can show that A∈Σn1(Z) iff for every Polish space W and embedding j:Z⟶W there exists B∈Σn1(W) such that j[A]=B∩j[Z]. Our reference for other set-theoretic notions is [Je].
The classes defined below constitute the so-called difference hierarchy (or small Borel sets). For a detailed treatment, see [Ke, Section 22.E] or [vE2, Chapter 3]. Here, we will only mention that the classes Dη(Σξ0(Z)) are among the simplest concrete examples of Wadge classes (see Propositions 13.4 and 13.6).
Definition 2.3** (Kuratowski).**
Let Z be a space, let 1≤η<ω1, and let 1≤ξ<ω1. Given a sequence of sets (Aμ:μ<η), define
[TABLE]
Define Dη(Σξ0(Z)) by declaring A∈Dη(Σξ0(Z)) if there exist Aμ∈Σξ0(Z) for μ<η such that A=Dη(Aμ:μ<η).555 Notice that requiring that (Aμ:μ<η) is ⊆-increasing would yield an equivalent definition of Dη(Σξ0(Z)).
The following two lemmas are useful for proving by induction statements regarding the difference hierarchy. Their straightforward proofs are mostly left to the reader.
Lemma 2.4**.**
Let Z be a space, let 1≤η<ω1, and let 1≤ξ<ω1. Then the following are equivalent:
•
A∈Dη+1(Σξ0(Z)),
•
There exist B∈Σξ0(Z) and C∈Dη(Σξ0(Z)) such that C⊆B and A=B∖C.
Proof.
Proceed by induction on η. ∎
Lemma 2.5**.**
Let Z be a space, let 1<ξ<ω1, and let η<ω1 be a limit ordinal. Then the following are equivalent:
•
A∈Dη(Σξ0(Z)),
•
There exist An∈⋃η′<ηDη′(Σξ0(Z)) and pairwise disjoint Vn∈Σξ0(Z) for n∈ω such that A=⋃n∈ωAn∩Vn.
Furthermore, if Z is zero-dimensional then the result holds for ξ=1 as well.
For an introduction to the topic of games, we refer the reader to [Ke, Section 20]. Here, we only want to give the precise definition of determinacy. Given a set A, a play of the game G(A,X) is described by the diagram
[TABLE]
in which an∈A for every n∈ω and X⊆Aω is called the payoff set. We will say that Player I wins this play of the game G(A,X) if (a0,a1,…)∈X. Player II wins if Player I does not win.
A strategy for a player is a function σ:A<ω⟶A. We will say that σ is a winning strategy for Player I if setting a2n=σ(a1,a3,…,a2n−1) for each n makes Player I win for every (a1,a3,…)∈Aω. A winning strategy for Player II is defined similarly. We will say that the game G(A,X) (or simply the set X) is determined if (exactly) one of the players has a winning strategy. In this article, we will exclusively deal with the case A=ω. Given Σ⊆P(ωω), we will write Det(Σ) to mean that every element of Σ is determined. The assumption Det(P(ωω)) is known as the Axiom of Determinacy (briefly, AD).666 Quite amusingly, Van Wesep referred to AD as a “frankly heretical postulate” (see [VW, page 64]), while Steel deemed it “probably false” (see [St, page 63]). The assumption Det(⋃1≤n<ωΣn1(ωω)) is known as the axiom of Projective Determinacy.
It is well-known that AD is incompatible with the Axiom of Choice (see [Je, Lemma 33.1]). This is the reason why, throughout this article, we will be working in ZF+DC. Recall that the principle of Dependent Choices (briefly, DC) states that if R is a binary relation on a non-empty set A such that for every a∈A there exists b∈A such that (b,a)∈R, then there exists a sequence (a0,a1,…)∈Aω such that (an+1,an)∈R for every n∈ω. This principle is what is needed to carry out recursive constructions of length ω. Another consequence (in fact, an equivalent formulation) of DC is that a relation R on a set A is well-founded iff there exists no sequence (a0,a1,…)∈Aω such that (an+1,an)∈R for every n∈ω (see [Je, Lemma 5.5.ii]). Furthermore, DC implies the Countable Axiom of Choice (see [Je, Exercise 5.7]). To the reader who is unsettled by the lack of the full Axiom of Choice, we recommend [HR].
It is a theorem of Martin that Det(B(ωω)) holds in ZF+DC (this was originally proved in [Ma1], but see also [Ma2, Remark (2) on page 307]). On the other hand, Harrington showed that Det(Σ11(ωω)) has large cardinal strength (see [Har]). For the consistency of ZF+DC+AD, see [Ne] and [Ka, Proposition 11.13].
We conclude this section with more notation and well-known definitions, for the sake of clarity. A partition of a set Z is a collection V⊆P(Z) consisting of pairwise disjoint non-empty sets such that ⋃V=Z. We will denote by idZ:Z⟶Z the identity function on a set Z. Given a set A, we will denote by A<ω the collection of all functions s:n⟶A, where n∈ω. Given s∈A<ω, we will use the notation Ns={z∈Aω:s⊆z}.777 In all our applications, we will have A=2 or A=ω. Given a set Z and Σ⊆P(Z), we will denote by bΣ the smallest subset of P(Z) that contains Σ and is closed under complements and finite intersections.
A subset of a space is clopen if it is closed and open. A base for a space Z is a collection U⊆Σ10(Z) consisting of non-empty sets such that for every x∈Z and every U∈Σ10(Z) containing x there exists V∈U such that x∈V⊆U. A space is zero-dimensional if it is non-empty888 The empty space has dimension −1 (see [En, Section 7.1]). and it has a base consisting of clopen sets. A space Z is a Borel space if there exists a Polish space W and an embedding j:Z⟶W such that j[Z]∈B(W). By proceeding as in the proof of [MZ, Proposition 4.2], it is easy to show that a space Z is Borel iff j[Z]∈B(W) for every Polish space W and every embedding j:Z⟶W. For example, by [Ke, Theorem 3.11], every Polish space is a Borel space.
Given 1≤ξ<ω1 and spaces Z and W, a function f:Z⟶W is Σξ0-measurable if f−1[U]∈Σξ0(Z) for every U∈Σ10(W). A function f:Z⟶W is Borel if f−1[U]∈B(Z) for every U∈Σ10(W). Using the existence of a countable base, it is easy to see that a function is Borel iff it is Σ1+ξ0-measurable for some ξ<ω1.
3. Nice topological pointclasses
In this section we will consider the natural concept of a topological pointclass, and then define a strengthening of it that will be convenient for technical reasons (without resulting in any loss of generality for our intended applications). It is in terms of these classes that our determinacy assumptions will be stated. In fact, the typical result in this article will begin by assuming Det(Σ(ωω)), where Σ is a suitable topological pointclass.
Notice that the term “function” in the following definition is an abuse of terminology, as each topological pointclass is a proper class. Therefore, every theorem in this paper that mentions these pointclasses is strictly speaking an infinite scheme (one theorem for each suitable topological pointclass). In fact, as we will make clear in the remainder of this section, topological pointclasses are simply a convenient expositional tool that will allow us to simultaneously state the Borel, Projective, and full-Determinacy versions of our results.
Definition 3.1**.**
We will say that a function Σ is a topological pointclass if it satisfies the following requirements:
•
The domain of Σ is the class of all spaces,999 Recall from Section 1 that we are only considering separable metrizable spaces.
•
Σ(Z)⊆P(Z) for every space Z,
•
If f:Z⟶W is a continuous function and B∈Σ(W) then f−1[B]∈Σ(Z).
Furthermore, we will say that a topological pointclass Σ is nice if it satisfies the following additional properties:
(1)
bΣ(Z)=Σ(Z) for every space Z,
2. (2)
B(Z)⊆Σ(Z) for every space Z,
3. (3)
If f:Z⟶W is a Borel function and B∈Σ(W) then f−1[B]∈Σ(Z),
4. (4)
For every space Z, if j[Z]∈Σ(W) for some Borel space W and embedding j:Z⟶W, then j[Z]∈Σ(W) for every Borel space W and embedding j:Z⟶W.
Condition (\refniceboolean) is mostly due to the complexity of the payoff set in the proof of Lemma 4.3, but it also ensures other useful closure properties, especially in conjunction with condition (\refniceborel). Condition (\refnicepreimages) ensures that Σ is suitably closed under expansions, in the terminology of Definition 13.1. Furthermore, as in the proof of the implication (\refuncountablelevelpreimages)→(\refuncountablelevelomega1) of Corollary 18.4, it is easy to see that condition (\refnicepreimages) implies the following:
(3′)
For every space Z and A∈Σ(Z), if Vn∈Δ20(Z) and An≤A for n∈ω, and the Vn are pairwise disjoint, then ⋃n∈ω(An∩Vn)∈Σ(Z).
Condition (3′) will be tacitly used in Section 20 (see Claims 5 and 10 in the proof of Theorem 20.1, and Lemma 20.5), as it ensures that Σ is suitably closed under PU1, in the notation of Definition 15.1.
Condition (\refniceabsoluteness) encapsulates the appropriate degree of “topological absoluteness” for spaces of complexity Σ, and it will be used exclusively in the proof of Lemma 6.3. We remark that our focus on Borel spaces is due to the fact that we will need a certain portion of the machinery of relativization to work for these spaces (see Section 6, in particular Footnote 12).
For the purposes of this paper, the following are the intended examples of nice topological pointclasses (this can be verified using [Ke, Exercise 37.3] and the methods of [MZ, Section 4]):
(A)
Σ(Z)=B(Z) for every space Z,
(B)
Σ(Z)=bΣn1(Z) for every space Z, where 1≤n<ω,
(C)
Σ(Z)=⋃1≤n<ωΣn1(Z) for every space Z,
(D)
Σ(Z)=P(Z) for every space Z.
Regarding example (B), we remark that Det(bΣn1(ωω)) is equivalent to Det(Σn1(ωω)) whenever 1≤n<ω (this easily follows from [MSW, Corollary 4.1]).
We conclude with two well-known results, which clarify the relationship between determinacy assumptions and the Baire property in Polish spaces. Given Σ⊆P(ωω), we will write BP(Σ) to mean that every element of Σ has the Baire property in ωω.
Theorem 3.2**.**
Let Σ be a nice topological pointclass. If Det(Σ(ωω)) holds then BP(Σ(ωω)) holds.
Let Σ be a topological pointclass, and assume that BP(Σ(ωω)) holds. Let Z be a Polish space, and let A∈Σ(Z). Then A has the Baire property in Z.
Proof.
Use the fact that, if Z is non-empty, then there exists an open continuous surjection f:ωω⟶Z (see [Ke, Exercise 7.14]).
∎
4. The basics of Wadge theory
We begin by introducing a special notation for the collection of all non-selfdual Wadge classes in a given space. Throughout the paper, starting from the discussion at the end of this section and culminating with Theorem 22.2, it will become increasingly clear that these are the most important Wadge classes.
Definition 4.1**.**
Given a space Z, define
[TABLE]
Also set NSDΣ(Z)={Γ∈NSD(Z):Γ⊆Σ(Z)} whenever Σ is a topological pointclass.
The following simple lemma will allow us to generalize many Wadge-theoretic results from ωω to an arbitrary zero-dimensional Polish space. This approach has already appeared in [An, Section 5], where it is credited to Marcone. Recall that, given a space Z and W⊆Z, a retraction is a continuous function ρ:Z⟶W such that ρ↾W=idW. By [Ke, Theorem 7.8], every zero-dimensional Polish space is homeomorphic to a closed subspace Z of ωω, and by [Ke, Proposition 2.8] there exists a retraction ρ:ωω⟶Z.
Lemma 4.2**.**
Let Z⊆ωω, and let ρ:ωω⟶Z be a retraction. Fix A,B⊆Z. Then A≤B in Z iff ρ−1[A]≤ρ−1[B] in ωω.
Proof.
If f:Z⟶Z witnesses that A≤B in Z, then f∘ρ:ωω⟶ωω will witness that ρ−1[A]≤ρ−1[B] in ωω. On the other hand, if f:ωω⟶ωω witnesses that ρ−1[A]≤ρ−1[B] in ωω, then ρ∘(f↾Z):Z⟶Z will witness that A≤B in Z.
∎
The most fundamental result of Wadge theory is Lemma 4.4 (commonly known as “Wadge’s Lemma”). Among other things, it shows that antichains with respect to ≤ have size at most 2. However, instead of proving it directly, we will deduce it from the following lemma, which is essentially due to Louveau and Saint-Raymond (see [LSR2, Theorem 4.1.b]).
Lemma 4.3 will also be a crucial tool in Section 6.
The following “Extended Wadge game” was also introduced by Louveau and Saint-Raymond (see [LSR2, Section 3]), and it will be used in the proof of Lemma 4.3. Given D,A0,A1⊆ωω, consider the game EW(D,A0,A1) described by the following diagram
[TABLE]
where x=(x0,x1,…)∈ωω, y=(y0,y1,…)∈ωω, and Player II wins if one of the following conditions is verified:
•
x∈D and y∈A0,
•
x∈/D and y∈A1.
Lemma 4.3**.**
Let Σ be a topological pointclass, and assume that Det(bΣ(ωω)) holds. Let Γ⊆bΣ(ωω) be continuously closed, and let A0,A1∈bΣ(ωω) be such that A0∩A1=∅. Then, one of the following conditions holds:
(1)
There exists C∈Γ such that A0⊆C and C∩A1=∅,
2. (2)
For all D∈Γ there exists a continuous f:ωω⟶A0∪A1 such that f−1[A0]=D.
Proof.
Assume that condition (\refstrongwadgeforall) fails. We will show that condition (\refstrongwadgeexists) holds. Fix D∈Γ such that f−1[A0]=D for every continuous f:ωω⟶A0∪A1. First we claim that Player II does not have a winning strategy in the game EW(D,A0,A1). Assume, in order to get a contradiction, that there exists a winning strategy σ for Player II. Given x∈ωω, view x as describing the moves of Player I, then define f(x)=y, where y is the response of Player II to x according to the strategy σ. It is easy to realize that f contradicts the assumption at the beginning of this proof.
Since the payoff set of the game EW(D,A0,A1) belongs to bΣ(ωω), the assumption of Det(bΣ(ωω)) guarantees the existence of a winning strategy τ for Player I. Given y∈ωω, view y as describing the moves of Player II, then define g(y)=x, where x is the response of Player I to y according to the strategy τ.
Set C=g−1[ωω∖D], and observe that C∈Γ because Γ is continuously closed. Notice that, since τ is a winning strategy for Player I, for every y∈A0∪A1 neither of the following conditions holds:
•
g(y)∈D and y∈A0,
•
g(y)∈/D and y∈A1.
Using this observation, one sees that A0⊆C and C∩A1=∅.
∎
Lemma 4.4** (Wadge).**
Let Σ be a topological pointclass, and assume that Det(bΣ(ωω)) holds. Let Z be a zero-dimensional Polish space, and let A,B∈bΣ(Z). Then either A≤B or Z∖B≤A.
Proof.
For the case Z=ωω, apply Lemma 4.3 with A0=A, A1=ωω∖A, and Γ=B↓. To obtain the full result from this particular case, use Lemma 4.2 and the remarks preceding it.
∎
The following two results are simple applications of Wadge’s Lemma, whose proofs are left to the reader.
Lemma 4.5**.**
Let Σ be a topological pointclass, and assume that Det(bΣ(ωω)) holds. Let Z be a zero-dimensional Polish space, and let Γ⊆bΣ(Z). If Γ is continuously closed and non-selfdual then Γ is a Wadge class.
Lemma 4.6**.**
Let Σ be a topological pointclass, and assume that Det(bΣ(ωω)) holds. Let Z be a zero-dimensional Polish space, let Γ⊆bΣ(Z) be a non-selfdual Wadge class, and let Δ⊆bΣ(Z) be continuously closed and selfdual. If Γ⊈Δ then Δ⊊Γ.
The following is the second most fundamental theorem of Wadge theory after Wadge’s Lemma. In fact, it is at the core of many proofs of important Wadge-theoretic results.
Theorem 4.7** (Martin, Monk).**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space. Then the relation ≤ on Σ(Z) is well-founded.
Proof.
For the case Z=ωω, proceed as in [Ke, proof of Theorem 21.15], using Theorem 3.2 and Proposition 3.3. To obtain the full result from this particular case, use Lemma 4.2 and the remarks preceding it.
∎
Next, we state an elementary result, which shows that clopen sets are “neutral sets” for Wadge-reduction. By this we mean that, apart from trivial exceptions, intersections or unions with these sets do not change the Wadge class. The straightforward proof is left to the reader. For more sophisticated closure properties, see [CMM, Section 12].
Lemma 4.8**.**
Let Z be a space, let Γ be a Wadge class in Z, and let A∈Γ.
•
Assume that Γ={Z}. Then A∩V∈Γ for every V∈Δ10(Z).
•
Assume that Γ={∅}. Then A∪V∈Γ for every V∈Δ10(Z).
We conclude this section with some basic facts that will not be needed in the rest of the paper, but hopefully will help the reader in understanding how Wadge classes behave. In order to simplify the discussion, we will assume that AD holds until the end of this section. Given a zero-dimensional Polish space Z, define
[TABLE]
Given p,q∈Wa(Z), define p≺q if Γ⊆Λ for every Γ∈p and Λ∈q. Using Lemma 4.4 and Theorem 4.7, one sees that the ordering ≺ on Wa(Z) is a well-order. Therefore, there exists an order-isomorphism ϕ:Wa(Z)⟶Θ for some ordinal Θ.101010 For a characterization of Θ, see [So, Definition 0.1 and Lemma 0.2]. The reason for the “1+” in the definition below is simply a matter of technical convenience (see [AHN, page 45]).
Definition 4.9**.**
Let Z be a zero-dimensional Polish space, and let Γ be a Wadge class in Z. Define
[TABLE]
We will say that ∣∣Γ∣∣ is the Wadge-rank of Γ.
It is easy to check that {{∅},{Z}} is the minimal element of Wa(Z). Furthermore, elements of the form {Γ,Γ} for Γ∈NSD(Z) are always followed by {Δ} for some selfdual Wadge class Δ in Z, while elements of the form {Δ} for some selfdual Wadge class Δ in Z are always followed by {Γ,Γ} for some Γ∈NSD(Z). This was proved by Van Wesep for Z=ωω (see [VW, Corollary to Theorem 2.1]), and it can be generalized to arbitrary uncountable zero-dimensional Polish spaces using Corollary 5.5 and the machinery of relativization that we will develop in Sections 6 and 7. Since these facts will not be needed in the remainder of the paper, we omit their proofs.
In fact, as Theorem 7.1 will show, the ordering of the non-selfdual classes is independent of the space Z (as long as it is uncountable, zero-dimensional, and Borel). However, the situation is more delicate for selfdual classes. For example, it follows easily from Corollary 5.5 that if Γ is a Wadge class in 2ω such that ∣∣Γ∣∣ is a limit ordinal of countable cofinality, then Γ is non-selfdual. On the other hand, if Γ is a Wadge class in ωω such that ∣∣Γ∣∣ is a limit ordinal of countable cofinality, then Γ is selfdual (see [VW, Corollary to Theorem 2.1] again).
5. The analysis of selfdual sets
The aim of this section is to show that a set is selfdual iff it can be constructed in a certain way using sets of lower complexity. The easy implication is given by Proposition 5.1, while the hard implication can be obtained by applying Corollary 5.5 with U=Z. These are well-known results (see for example [Lo2, Lemmas 7.3.1.iv and 7.3.4]). Our approach is essentially the same as the one used in the proof of [AM, Theorem 16] or in [MR, Theorem 5.3]. However, since we would like our paper to be self-contained, and the proof becomes slightly simpler in our context, we give all the details below.
Proposition 5.1**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, and let A∈Σ(Z). Assume that U is an open cover of Z such that A∩U<A in Z for every U∈U. Then A is selfdual.
Proof.
First notice that U=∅ because Z=∅. It follows that A=∅ and A=Z. In particular, A∩U=Z for every U∈U. So, by Lemma 4.8, A∩V≤A∩U<A whenever V∈Δ10(Z) and V⊆U∈U. Therefore, since Z is zero-dimensional, we can assume without loss of generality that U is a disjoint clopen cover of Z.
We claim that U∖A≤A for every U∈U. Pick U∈U. If A∩U=∅ then U∖A=U∈Δ10(Z), hence the claim holds because A=∅ and A=Z. On the other hand, if A∩U=∅ then
[TABLE]
where the first reduction holds by Lemma 4.8 and the second reduction follows from A≰A∩U using Lemma 4.4. In conclusion, we can fix fU:Z⟶Z witnessing that U∖A≤A in Z for every U∈U. It is clear that f=⋃{fU↾U:U∈U} will witness that Z∖A≤A.
∎
Given a space Z and A⊆Z, define
[TABLE]
Notice that I(A) is σ-additive, in the sense that if Vn∈I(A) for n∈ω and V=⋃n∈ωVn∈Δ10(Z), then V∈I(A).
We begin with two simple preliminary results. Recall that F⊆2ω is a flip-set if whenever z,w∈2ω are such that ∣{n∈ω:z(n)=w(n)}∣=1 then z∈F iff w∈/F.
Lemma 5.2**.**
Let F⊆2ω be a flip-set. Then F does not have the Baire property.
Proof.
Assume, in order to get a contradiction, that F has the Baire property. Since 2ω∖F is also a flip-set, we can assume without loss of generality that F is non-meager in 2ω. By [Ke, Proposition 8.26], we can fix n∈ω and s∈2n such that F∩Ns is comeager in Ns. Fix k∈ω∖n and let h:Ns⟶Ns be the homeomorphism defined by
[TABLE]
for x∈Ns and i∈ω. Observe that (Ns∩F)∩h[Ns∩F] is comeager in Ns, hence it is non-empty. It is easy to realize that this contradicts the definition of flip-set.
∎
Lemma 5.3**.**
Let Z be a space, and let A⊆Z be a selfdual set such that A∈/Δ10(Z). Assume that V∈Δ10(Z) and V∈/I(A). Then V∩A≤V∖A in V.
Proof.
Using Lemma 4.8, one sees that V∩A≤A and V∖A≤Z∖A, where both reductions are in Z. On the other hand, since V∩A<A would contradict the assumption that V∈/I(A), we see that V∩A≡A. It follows that V∖A≤Z∖A≡A≡V∩A. Let f:Z⟶Z be a function witnessing that V∖A≤V∩A. Notice that V∖A=∅, otherwise we would have V=V∩A≡A, contradicting the assumption that A∈/Δ10(Z). So we can fix z∈V∖A, and define g:Z⟶V by setting
[TABLE]
Since V∈Δ10(Z), the function g is continuous. Finally, it is straightforward to verify that g∘(f↾V):V⟶V witnesses that V∩A≤V∖A in V.
∎
Theorem 5.4**.**
Let Σ be a topological pointclass, and assume that BP(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, and let A∈Σ(Z) be selfdual. Assume that A∈/Δ10(Z). Then Δ10(Z)=I(A).
Proof.
Assume, in order to get a contradiction, that V∈Δ10(Z)∖I(A). Fix a complete metric on Z that induces the given Polish topology. We will recursively construct sets Vn and functions fn:Vn⟶Vn for n∈ω. Before specifying which properties we require from them, we introduce some more notation. Given a set X and a function f:X⟶X, set f0=idX and f1=f. Furthermore, given m,n∈ω such that m≤n and z∈2ω (or just z∈2[m,n]), define
[TABLE]
We will make sure that the following conditions are satisfied for every n∈ω, where diam(X) denotes the diameter of X⊆Z:
(1)
Vn∈Δ10(Z),
2. (2)
Vn∈/I(A),
3. (3)
Vm⊇Vn whenever m≤n,
4. (4)
fn:Vn⟶Vn witnesses that Vn∩A≤Vn∖A in Vn,
5. (5)
diam(f[m,n]s[Vn+1])≤2−n whenever m≤n and s∈2[m,n].
Start by setting V0=V and let f0:V0⟶V0 be given by Lemma 5.3. Now fix n∈ω, and assume that Vm and fm have already been constructed for every m≤n. Fix a partition U of Z consisting of clopen sets of diameter at most 2−n. Given m≤n and s∈2[m,n], define
[TABLE]
Observe that each Vms⊆Δ10(Vn) because each f[m,n]s is continuous. Furthermore, it is clear that each Vms consists of pairwise disjoint sets, and that ⋃Vms=Vn. Since there are only finitely many m≤n and s∈2[m,n], it is possible to obtain a partition V⊆Δ10(Vn) of Vn that simultaneously refines each Vms. This clearly implies that any choice of Vn+1∈V will satisfy condition (\refsmalldiam). On the other hand since I(A) is σ-additive and Vn∈/I(A), it is possible to choose Vn+1∈V such that Vn+1∈/I(A), thus ensuring that condition (\refideal) is satisfied as well. To obtain fn+1:Vn+1⟶Vn+1 that satisfies condition (\refreduction), simply apply Lemma 5.3. This concludes the construction.
Fix an arbitrary yn+1∈Vn+1 for n∈ω. Given m∈ω and z∈2ω, observe that the sequence (f[m,n]z(yn+1):m≤n) is Cauchy by condition (\refsmalldiam), hence it makes sense to define
[TABLE]
To conclude the proof, we will show that F={z∈2ω:x0z∈A} is a flip-set. Since the function g:2ω⟶Z defined by setting g(z)=x0z is continuous and A∈Σ(Z), Proposition 3.3 and Lemma 5.2 will easily yield a contradiction.
Define A0=A and A1=Z∖A. Given any m∈ω and ε∈2, it is clear from the definition of fmε and condition (\refreduction) that
[TABLE]
for every x∈Vm. Furthermore, using the continuity of fmε and the definition of xmz, it is easy to see that
[TABLE]
for every z∈2ω and m∈ω.
Fix z∈2ω and notice that, by the observations in the previous paragraph,
[TABLE]
for every m∈ω. Now fix w∈2ω and m∈ω such that z↾ω∖{m}=w↾ω∖{m} and z(m)=w(m). We need to show that x0z∈A iff x0w∈/A. For exactly the same reason as above, we have
[TABLE]
Since z↾m=w↾m and z(m)=w(m), in order to finish the proof, it will be enough to show that xm+1z=xm+1w. To see this, observe that
[TABLE]
where the middle equality uses the assumption z↾ω∖(m+1)=w↾ω∖(m+1).
∎
Corollary 5.5**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, let A∈Σ(Z) be selfdual, and let U∈Δ10(Z). Then there exist pairwise disjoint Vn∈Δ10(U) and non-selfdual An<A in Z for n∈ω such that ⋃n∈ωVn=U and ⋃n∈ω(An∩Vn)=A∩U.
Proof.
As one can easily check, it will be enough to show that there exists a partition V⊆Δ10(U) of U such that for every V∈V either A∩V∈Δ10(Z) or A∩V is non-selfdual in Z. If this were not the case, then, using Theorem 5.4, one could recursively construct a strictly ≤-decreasing sequence of subsets of Z, which would contradict Theorem 4.7.
∎
6. Relativization: basic facts
When one tries to give a systematic exposition of Wadge theory, it soon becomes apparent that it would be very useful to be able to say when A and B belong to “the same” Wadge class Γ, even when A⊆Z and B⊆W for distinct ambient spaces Z and W. It is clear how to do that in certain particular cases, for example when Γ=Π20 or Γ=D2(Σ10), because elements of those classes are obtained by performing set-theoretic operations111111 The key fact here is that these are Hausdorff operations (see Section 8). In fact, in [CMM], we used Hausdorff operations (together with Theorem 1.2) to give an alternative treatment of relativization. to the open sets. However, it is not a priori clear how to deal with this issue in the case of arbitrary, possibly rather exotic Wadge classes.
We will solve the problem by using Wadge classes in ωω to parametrize Wadge classes in arbitrary spaces. Roughly, using this approach, two Wadge classes Λ in Z and Λ′ in W will be “the same” if there exists a Wadge class Γ in ωω such that Γ(Z)=Λ and Γ(W)=Λ′. We will refer to this process as relativization. This is essentially due to Louveau and Saint-Raymond (see [LSR2, Theorem 4.2]), but here we tried to give a more systematic exposition. Furthermore, as we mentioned in Section 1, this topic does not appear at all in [Lo2].
The reason why we used the word “roughly” is that, in order for relativization to work, the Wadge classes in question have to be non-selfdual (see the discussion at the end of Section 4). Furthermore, the ambient spaces Z and W are generally assumed to be be zero-dimensional and Polish, even though for some results the assumption “Polish” can be relaxed to “Borel”,121212 This form of relativization will be needed in the proof of Theorem 17.1. or even dropped altogether.
Lemma 6.2, whose straightforward proof is left to the reader, gives several “reassuring” and extremely useful facts about relativization. Lemma 6.3 gives equivalent definitions of Γ(Z). An important application of these appears in the proof of Lemma 6.4, which shows that relativization is well-behaved with respect to subspaces. As another application, observe that if Σ is a nice topological pointclass and Det(Σ(ωω)) holds, then Γ(Z)⊆Σ(Z) whenever Γ∈NSDΣ(ωω) and Z is a zero-dimensional Borel space. Finally, Lemma 6.5 shows that every non-selfdual Wadge class can be obtained through relativization, and in a unique way.
Definition 6.1** (Louveau, Saint-Raymond).**
Given a space Z and Γ⊆P(ωω), define
[TABLE]
Lemma 6.2**.**
Let Γ⊆P(ωω), and let Z and W be spaces.
(1)
If f:Z⟶W is continuous and B∈Γ(W) then f−1[B]∈Γ(Z).
2. (2)
If h:Z⟶W is a homeomorphism then A∈Γ(Z) iff h[A]∈Γ(W).
3. (3)
Γ(Z)=Γ(Z).
4. (4)
If Γ is continuously closed then Γ(ωω)=Γ.
Lemma 6.3** (Louveau, Saint-Raymond).**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Borel space, let Γ∈NSDΣ(ωω), and let A∈Σ(Z). Then, the following conditions are equivalent:
(1)
A∈Γ(Z),
2. (2)
For every embedding j:Z⟶ωω there exists B∈Γ such that A=j−1[B],
3. (3)
There exists an embedding j:Z⟶ωω and B∈Γ such that A=j−1[B],
4. (4)
There exists a continuous f:Z⟶ωω and B∈Γ such that A=f−1[B].
Proof.
In order to prove that (\refforallcont)→(\refforallemb), assume that condition (\refforallcont) holds. Pick an embedding j:Z⟶ωω, then set A0=j[A] and A1=j[Z∖A]. Using the fact that Σ is a nice topological pointclass and that Z is a Borel space, it is easy to see that A0,A1∈Σ(ωω). Therefore, by the assumption Det(Σ(ωω)), it is possible to apply Lemma 4.3. Notice that it would be sufficient to show that there exists B∈Γ such that A0⊆B and B∩A1=∅, as j−1[B]=A would clearly follow. So assume, in order to get a contradiction, that no such B∈Γ exists. Then, by Lemma 4.3, for all B∈Γ there exists a continuous f:ωω⟶ωω such that f[ωω]⊆A0∪A1 and f−1[A0]=B. In particular, we can fix such a function f when B is such that Γ=B↓. Set g=j−1∘f:ωω⟶Z, and observe that g is continuous because j is an embedding. Then
[TABLE]
by condition (\refforallcont), contradicting the fact that Γ is non-selfdual.
The implication (\refforallemb)→(\refexistsemb) holds because Z is zero-dimensional. The implication (\refexistsemb)→(\refexistscont) is trivial. In order to prove that (\refexistscont)→(\refforallcont), assume that f:Z⟶ωω and B∈Γ are such that A=f−1[B]. Pick a continuous g:ωω⟶Z. Since f∘g:ωω⟶ωω is continuous and Γ is continuously closed, one sees that
[TABLE]
Lemma 6.4**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z and W be zero-dimensional Borel spaces such that W⊆Z, and let Γ∈NSDΣ(ωω). Then B∈Γ(W) iff A∩W=B for some A∈Γ(Z).
Proof.
In order to prove the left-to-right implication, pick B∈Γ(W). Since Z is zero-dimensional, we can fix an embedding j:Z⟶ωω. Notice that i=j↾W:W⟶ωω is also an embedding, hence by condition (\refforallemb) of Lemma 6.3 there exists C∈Γ such that i−1[C]=B. Let A=j−1[C], and observe that A∩W=B. The fact that A∈Γ(Z) follows from condition (\refexistsemb) of Lemma 6.3. In order to prove the right-to-left implication, pick A∈Γ(Z). Let i:W⟶Z be the inclusion. It follows from Lemma 6.2.1 that A∩W=i−1[A]∈Γ(W).
∎
Lemma 6.5**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, and let Λ∈NSDΣ(Z). Then there exists a unique Γ∈NSDΣ(ωω) such that Γ(Z)=Λ.
Proof.
First we will prove the existence of Γ. Pick A⊆Z such that Λ=A↓. By [Ke, Theorem 7.8] and Lemma 6.2.2 we can assume without loss of generality that Z is a closed subspace of ωω. Therefore, by [Ke, Proposition 2.8], we can fix a retraction ρ:ωω⟶Z. Set Γ=ρ−1[A]↓ in ωω, and observe that Γ is non-selfdual by Lemma 4.2. We claim that Λ=Γ(Z). Since A=ρ−1[A]∩Z∈Γ(Z) by Lemma 6.4 and Γ(Z) is continuously closed, one sees that Λ=A↓⊆Γ(Z). To see that the other inclusion holds, pick B∈Γ(Z). Then ρ−1[B]∈Γ, hence ρ−1[B]≤ρ−1[A]. It follows from Lemma 4.2 that B≤A.
Now assume, in order to get a contradiction, that Γ,Γ′∈NSDΣ(ωω) are such that Γ=Γ′ and Γ(Z)=Λ=Γ′(Z). Notice that Γ′=Γ is impossible, as an application of Lemma 6.2.3 would contradict the fact that Λ is non-selfdual. Therefore, we can assume without loss of generality that Γ⊆Γ′, hence Γ′⊈Γ. By Lemma 4.4, it follows that Γ⊆Γ′. Therefore Γ(Z)⊆Γ′(Z)=Γ(Z), which contradicts the fact that Γ(Z)=Λ is non-selfdual.
∎
7. Relativization: uncountable spaces
Notice that, in the previous section, we never assumed the uncountability of the ambient spaces. As the following two results show, the situation gets particularly pleasant when this assumption is satisfied.
In particular, Theorem 7.1 shows that the ordering of non-selfdual Wadge classes becomes independent of the ambient space. Observe that the uncountability assumption cannot be dropped in either result, as Γ(Z)=P(Z) whenever Z is a countable space and Γ⊆P(ωω) is such that Δ20(ωω)⊆Γ.
Theorem 7.1**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z and W be uncountable zero-dimensional Borel spaces, and let Γ,Λ∈NSDΣ(ωω). Then
[TABLE]
Proof.
It will be enough to prove the left-to-right implication, as the other implication is perfectly analogous. So assume that Γ(Z)⊆Λ(Z), and let B∈Γ(W). Since Z is an uncountable Borel space and W is zero-dimensional, there exists an embedding of W into Z. Hence, using Lemma 6.2.2, we can assume without loss of generality that W⊆Z. By Lemma 6.4, there exists A∈Γ(Z) such that A∩W=B. Since A∈Λ(Z) by our assumption, a further application of Lemma 6.4 shows that B∈Λ(W). ∎
Theorem 7.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space. Then
[TABLE]
Proof.
The inclusion ⊆ holds by Lemma 6.5. In order to prove that the inclusion ⊇ holds, pick Γ∈NSDΣ(ωω). By Lemma 4.5, it will be enough to show that Γ(Z) is continuously closed and non-selfdual. The fact that Γ(Z) is continuously closed follows from Lemma 6.2.1. Now assume, in order to get a contradiction, that Γ(Z) is selfdual. Then Γ(Z)=Γ(Z) by Lemma 6.2.3, which implies Γ(ωω)=Γ(ωω) by Theorem 7.1. It follows from Lemma 6.2.4 that Γ=Γ, which is a contradiction.
∎
8. Hausdorff operations: basic facts
For a history of the following important notion, see [Hau, page 583]. For a modern survey, we recommend [Za]. Most of the proofs in this section are straightforward, hence we leave them to the reader.
Definition 8.1**.**
Given a set Z and D⊆P(ω), define
[TABLE]
whenever A0,A1,…⊆Z. Functions of this form are called Hausdorff operations (or ω-ary Boolean operations).
Of course, the function HD depends on the set Z, but what Z is will usually be clear from the context. In case there might be uncertainty about the ambient space, we will use the notation HDZ. Notice that, once D is specified, the corresponding Hausdorff operation simultaneously defines functions P(Z)ω⟶P(Z) for every Z.
The following proposition lists the most basic properties of Hausdorff operations. Given n∈ω, set Sn={A⊆ω:n∈A}.
Proposition 8.2**.**
Let I be a set, and let Di⊆P(ω) for every i∈I. Fix an ambient set Z and A0,A1,…⊆Z.
•
HSn(A0,A1,…)=An* for all n∈ω.*
•
⋂i∈IHDi(A0,A1,…)=HD(A0,A1,…), where D=⋂i∈IDi.
•
⋃i∈IHDi(A0,A1,…)=HD(A0,A1,…), where D=⋃i∈IDi.
•
Z∖HD(A0,A1,…)=HP(ω)∖D(A0,A1,…)* for all D⊆P(ω).*
The point of the above proposition is that any operation obtained by combining unions, intersections and complements can be expressed as a Hausdorff operation. For example, if D=⋃n∈ω(S2n+1∖S2n), then HD(A0,A1,…)=⋃n∈ω(A2n+1∖A2n).
The following proposition shows that the composition of Hausdorff operations is again a Hausdorff operation. We will assume that a bijection ⟨⋅,⋅⟩:ω×ω⟶ω has been fixed.
Proposition 8.3**.**
Let Z be a set, let D⊆P(ω) and Em⊆P(ω) for m∈ω. Then there exists F⊆P(ω) such that
[TABLE]
for all A0,A1,…⊆Z, where Bm=HEm(A⟨m,0⟩,A⟨m,1⟩,…) for m∈ω.
Proof.
Define z∈F if {m∈ω:{n∈ω:⟨m,n⟩∈z}∈Em}∈D. The rest of the proof is a straightforward verification.
∎
Finally, we state a result that will be needed in the next section (see the proof of Lemma 9.5).
Lemma 8.4**.**
Let Z and W be sets, let D⊆P(ω), let A0,A1,…⊆Z, and let B0,B1,…⊆W.
(1)
f−1[HD(B0,B1,…)]=HD(f−1[B0],f−1[B1],…)* for all f:Z⟶W.*
2. (2)
f[HD(A0,A1,…)]=HD(f[A0],f[A1],…)* for all bijections f:Z⟶W.*
3. (3)
In the context of this article, the most important fact regarding Hausdorff operations is that they all give rise in a natural way to a non-selfdual Wadge class. More precisely, as in the following definition, this class is obtained by applying the given Hausdorff operation to all open subsets of a given space. The claim that these are all non-selfdual Wadge classes will be proved in the next section (see Theorem 10.5), by employing the classical notion of a universal set.
Definition 9.1**.**
Given a space Z and D⊆P(ω), define
[TABLE]
Definition 9.2**.**
Given a space Z, define
[TABLE]
Also set HaΣ(Z)={Γ∈Ha(Z):Γ⊆Σ(Z)} whenever Σ is a topological pointclass.
As examples (that will be useful later), consider the following two simple propositions.
Proposition 9.3**.**
Let 1≤η<ω1. Then there exists D⊆P(ω) such that ΓD(Z)=Dη(Σ10(Z)) for every space Z.
Proof.
This follows from Propositions 8.2 and 8.3 (in case η>ω, use a bijection π:η⟶ω).
∎
Proposition 9.4**.**
Let 1≤ξ<ω1. Then there exists D⊆P(ω) such that ΓD(Z)=Σξ0(Z) for every space Z.
Proof.
This can be proved by induction on ξ, using Propositions 8.2 and 8.3.
∎
Finally, we state a useful lemma, which shows that this notion behaves well with respect to subspaces and continuous functions. It extends (and is inspired by) [vE3, Lemma 2.3].
Lemma 9.5**.**
Let Z and W be spaces, and let D⊆P(ω).
(1)
If f:Z⟶W is continuous and B∈ΓD(W) then f−1[B]∈ΓD(Z).
2. (2)
If h:Z⟶W is a homeomorphism then A∈ΓD(Z) iff h[A]∈ΓD(W).
3. (3)
Assume that W⊆Z. Then B∈ΓD(W) iff there exists A∈ΓD(Z) such that B=A∩W.
Proof.
This is a straightforward consequence of Lemma 8.4.
∎
10. Hausdorff operations: universal sets
The aim of this section is to show that Ha(Z)⊆NSD(Z) whenever Z is an uncountable zero-dimensional Polish space (see Theorem 10.5 for a more precise statement). Notice that the uncountability requirement cannot be dropped, as Σ20(Z)=P(Z) is selfdual whenever Z is countable. The ideas presented here are well-known, but since we could not find a satisfactory reference, we will give all the details. Our approach is inspired by [Ke, Section 22.A].
Definition 10.1**.**
Let Z and W be spaces, and let D⊆P(ω). Given U⊆W×Z and x∈W, let Ux={y∈Z:(x,y)∈U} denote the vertical section of U above x. We will say that U⊆W×Z is a W-universal set for ΓD(Z) if the following two conditions hold:
•
U∈ΓD(W×Z),
•
{Ux:x∈W}=ΓD(Z).
Notice that, by Proposition 9.4, the above definition applies to the class Σξ0(Z) whenever 1≤ξ<ω1. Furthermore, for these classes, this definition agrees with [Ke, Definition 22.2].
Proposition 10.2**.**
Let Z be a space, and let D⊆P(ω). Then there exists a 2ω-universal set for ΓD(Z).
Proof.
By [Ke, Theorem 22.3], we can fix a 2ω-universal set U for Σ10(Z). Let h:2ω⟶(2ω)ω be a homeomorphism, and let πn:(2ω)ω⟶2ω be the projection on the n-th coordinate for n∈ω. Notice that, given any n∈ω, the function fn:2ω×Z⟶2ω×Z defined by fn(x,y)=(πn(h(x)),y) is continuous. Let Vn=fn−1[U] for each n, and observe that each Vn∈Σ10(2ω×Z). Set V=HD(V0,V1,…).
We claim that V is a 2ω-universal set for ΓD(Z). It is clear that V∈ΓD(2ω×Z). Furthermore, using Lemma 9.5, one can easily check that Vx∈ΓD(Z) for every x∈2ω. To complete the proof, fix A∈ΓD(Z). Let A0,A1,…∈Σ10(Z) be such that A=HD(A0,A1,…). Since U is 2ω-universal, we can fix zn∈2ω such that Uzn=An for every n∈ω. Set z=h−1(z0,z1,…). It is straightforward to verify that Vz=A.
∎
Corollary 10.3**.**
Let Z be a space in which 2ω embeds, and let D⊆P(ω). Then there exists a Z-universal set for ΓD(Z).
Proof.
By Proposition 10.2, we can fix a 2ω-universal set U for ΓD(Z). Fix an embedding j:2ω⟶Z and set W=j[2ω]. Notice that (j×idZ)[U]∈ΓD(W×Z) by Lemma 9.5.2. Therefore, by Lemma 9.5.3, there exists V∈ΓD(Z×Z) such that V∩(W×Z)=(j×idZ)[U]. Using Lemma 9.5 again, one can easily check that V is a Z-universal set for ΓD(Z).
∎
Lemma 10.4**.**
Let Z be a space, and let D⊆P(ω). Assume that there exists a Z-universal set for ΓD(Z). Then ΓD(Z) is non-selfdual.
Proof.
Fix a Z-universal set U⊆Z×Z for ΓD(Z). Assume, in order to get a contradiction, that ΓD(Z) is selfdual. Let f:Z⟶Z×Z be the function defined by f(x)=(x,x), and observe that f is continuous. Since f−1[U]∈ΓD(Z)=ΓD(Z), we see that Z∖f−1[U]∈ΓD(Z). Therefore, since U is Z-universal, we can fix z∈Z such that Uz=Z∖f−1[U]. If z∈Uz then f(z)=(z,z)∈U by the definition of Uz, contradicting the fact that Uz=Z∖f−1[U]. On the other hand, if z∈/Uz then f(z)=(z,z)∈/U by the definition of Uz, contradicting the fact that Z∖Uz=f−1[U].
∎
The case Z=ωω of the following result is [VW, Proposition 5.0.3], and it is credited to Addison by Van Wesep.
Theorem 10.5**.**
Let Z be a zero-dimensional space in which 2ω embeds. Then Ha(Z)⊆NSD(Z).
Proof.
Pick D⊆P(ω). The fact that ΓD(Z) is non-selfdual follows from Corollary 10.3 and Lemma 10.4. Therefore, it will be enough to show that ΓD(Z) is a Wadge class. By Proposition 10.2, we can fix a 2ω-universal set U⊆2ω×Z for ΓD(Z). Fix an embedding j:2ω×Z⟶Z and set W=j[2ω×Z]. By Lemma 9.5, we can fix A∈ΓD(Z) such that A∩W=j[U]. We claim that ΓD(Z)=A↓. The inclusion ⊇ follows from Lemma 9.5.1. In order to prove the other inclusion, pick B∈ΓD(Z). Since U is 2ω-universal, we can fix z∈2ω such that B=Uz. Consider the function f:Z⟶2ω×Z defined by f(x)=(z,x), and observe that f is continuous. It is straightforward to check that j∘f:Z⟶Z witnesses that B≤A in Z.
∎
11. The complete analysis of Δ20
Let Z be an uncountable zero-dimensional Polish space. Observe that Dη(Σ10(Z))∈NSD(Z) whenever 1≤η<ω1 by Proposition 9.3 and Theorem 10.5. In this section we will show that these are the only non-trivial elements of NSD(Z) contained in Δ20(Z). We will need this fact in the proof of Theorem 20.1. The case Z=ωω of this result is already mentioned in [VW, pages 84-85], but we are not aware of a satisfactory reference for it. We begin by stating a classical result (see [Ke, Theorem 22.27] for a proof).
Theorem 11.1** (Hausdorff, Kuratowski).**
Let Z be a Polish space, and let 1≤ξ<ω1. Then
[TABLE]
Theorem 11.2**.**
Let Z be a zero-dimensional Polish space, and let Γ∈NSD(Z) be such that Γ⊆Δ20(Z). Assume that Γ={∅} and Γ={Z}. Then there exists 1≤η<ω1 such that Γ=Dη(Σ10(Z)) or Γ=Dη(Σ10(Z)).
Proof.
Pick A⊆Z such that Γ=A↓. By Theorem 11.1, we can fix the minimalη such that 1≤η<ω1 and A∈Dη(Σ10(Z))∪Dη(Σ10(Z)). We will only give the proof in the case A∈Dη(Σ10(Z)), as the other case is perfectly analogous. More specifically, assume that A=Dη(Aξ:ξ<η), where each Aξ∈Σ10(Z) and (Aξ:ξ<η) is a ⊆-increasing sequence. We claim that Γ=Dη(Σ10(Z)). By Lemma 4.4 and the fact that Dη(Σ10(Z))∈NSD(Z), it will be enough to show that A∈/Dη(Σ10(Z)).
Assume, in order to get a contradiction, that A∈Dη(Σ10(Z)). More specifically, assume that Z∖A=Dη(Bξ:ξ<η), where each Bξ∈Σ10(Z) and (Bξ:ξ<η) is a ⊆-increasing sequence. First assume that η is a limit ordinal. Define U={Aξ:ξ<η}∪{Bξ:ξ<η}. It is clear that U is an open cover of Z. Furthermore, it is easy to realize that for every U∈U there exists ξ<η such that either A∩U∈Dξ(Σ10(Z)) or (Z∖A)∩U∈Dξ(Σ10(Z)). Using Lemma 4.8 and the fact that Z is zero-dimensional, we can assume without loss of generality that U consists of clopen subsets of Z.
We claim that A∩U<A for every U∈U. This will conclude the proof by Proposition 5.1, as it will contradict the fact that A is non-selfdual. Pick U∈U. If there exists ξ<η such that A∩U∈Dξ(Σ10(Z)), then the claim holds by the minimality of η. If (Z∖A)∩U∈Dξ(Σ10(Z)), then
[TABLE]
by Lemma 4.8. Hence the claim follows from the minimality of η again.
Finally, assume that η=ζ+1 is a successor ordinal. Notice that ζ=0, otherwise A would be a clopen subset of Z such that ∅⊊A⊊Z, contradicting the fact that A is non-selfdual. So it makes sense to set C=Dζ(Aξ:ξ<ζ) and D=Dζ(Bξ:ξ<ζ). Observe that A=Aζ∖C and Z∖A=Bζ∖D. Since Aζ∪Bζ=Z, using the fact that Z is zero-dimensional it is possible to find U,V∈Δ10(Z) such that U⊆Aζ, V⊆Bζ, U∪V=Z and U∩V=∅. Notice that A∩U=U∖C=(Z∖C)∩U∈Dζ(Σ10(Z)) and A∩V=D∩V∈Dζ(Σ10(Z)) by Lemma 4.8. As above, this contradicts the fact that A is non-selfdual.
∎
12. Kuratowski’s transfer theorem
In this section, we will prove many forms of a classical result, known as “Kuratowski’s transfer theorem”. The most powerful form of this result (as it gives the sharpest bounds in terms of complexity) is Theorem 12.2 (which is taken from [Lo2, Theorem 7.1.6]). This strong version of the result will only be needed in Section 17. The weaker versions will be used to successfully employ the notion of expansion. We also point out that Corollary 12.4 can be easily obtained from [Ke, Theorem 22.18], and viceversa.
Given f:Z⟶W, we will denote by f∗:Z⟶Z×W the function defined by setting f∗(x)=(x,f(x)) for every x∈Z. Given a set I, a function f:Z⟶∏k∈IWk and k∈I, we will denote the k-th coordinate of f by fk:Z⟶Wk. More precisely, set fk(x)=f(x)(k) for every x∈Z. In almost all of our applications, I=ω and Wk=ω for each k, so that f:Z⟶ωω and fk(x)=nk for x∈Z, where f(x)=(n0,n1,…).
The following is the crucial concept in Theorem 12.2, and it will feature prominently in Section 17 as well. Its name comes from the fact that it yields a finer topology (see Corollary 12.4).
Definition 12.1**.**
Let Z be a space, let 2≤ξ<ω1, and let A⊆Σξ0(Z). We will say that f:Z⟶ωω is a ξ-refining function for A if it satisfies the following conditions, where F=f∗[Z] denotes the graph of f:
(1)
F is closed in Z×ωω,
2. (2)
f∗[A]∈Σ10(F) for every A∈A,
3. (3)
For all k∈ω there exists ξk such that 1≤ξk<ξ and fk−1(j)∈Πξk0(Z) for every j∈ω.
Theorem 12.2** (Louveau).**
Let Z be a zero-dimensional space, let 2≤ξ<ω1, and let A⊆Σξ0(Z) be countable. Then there exists a ξ-refining function f:Z⟶ωω for A.
Proof.
The result is trivial if A=∅, so assume that A=∅. Let A={An:n∈ω} be an enumeration. We will proceed by induction on ξ. First assume that ξ=2. Pick A(n,i)∈Π10(Z) for n,i∈ω such that An=⋃i∈ωA(n,i). Since Z is zero-dimensional, it is possible to pick A(n,i,j)∈Δ10(Z) for n,i,j∈ω such that Z∖A(n,i)=⋃j∈ωA(n,i,j) and A(n,i,j)∩A(n,i,j′)=∅ whenever j=j′. Define f(n,i):Z⟶ω for n,i∈ω by setting
[TABLE]
Fix a bijection ⟨⋅,⋅⟩:ω×ω⟶ω and define f:Z⟶ωω by setting f(x)(⟨n,i⟩)=f(n,i)(x) for n,i∈ω. It is clear that condition (\refkuratowskistrictlysmaller) holds.
To show that condition (\refkuratowskigraphclosed) holds, pick xm∈Z for m∈ω such that (xm,f(xm))→(x,y)∈Z×ωω. We need to show that y=f(x). So fix k=⟨n,i⟩∈ω. By the definition of f, in order to see that y(k)=f(x)(k), we need to show that y(k)=f(n,i)(x). But f(n,i)(xm)=f(xm)(k) is eventually constant (with value y(k)), hence all but finitely many xm belong to A(n,i), or there exists j∈ω such that all but finitely many xm belong to A(n,i,j). Since xm→x and these sets are all closed, it follows that f(n,i)(x)=y(k).
To show that condition (\refkuratowskiinverseimage) holds for a given n∈ω, pick x∈An. We need to find V∈Σ10(F) such that (x,f(x))∈V⊆f∗[An]. Pick i∈ω such that x∈A(n,i), then set U={y∈ωω:y(⟨n,i⟩)=0}, and observe that U∈Δ10(ωω). Using the definition of f, it is easy to realize that V=(U×Z)∩F is as required.
Now assume that ξ≥3 and that the theorem holds for all ξ′ such that 2≤ξ′<ξ. Pick A(n,i)∈Πξ(n,i)0(Z) for n,i∈ω such that An=⋃i∈ωA(n,i), where 1≤ξ(n,i)<ξ. Then pick A(n,i,j)∈Δξ(n,i)0 for n,i,j∈ω such that Z∖A(n,i)=⋃j∈ωA(n,i,j) and A(n,i,j)∩A(n,i,j′)=∅ whenever j=j′.
Set A(n,i)={A(n,i,j):j∈ω}∪{Z∖A(n,i,j):j∈ω} for (n,i)∈ω×ω. By the inductive hypothesis, for each (n,i) we can fix a ξ(n,i)-refining function g(n,i):Z⟶ωω for A(n,i). This means that the following conditions will hold, where G(n,i)=g(n,i)∗[Z] denotes the graph of g(n,i):
(4)
G(n,i) is closed in Z×ωω,
2. (5)
g(n,i)∗[A(n,i,j)]∈Δ10(G(n,i)) for every j∈ω,
3. (6)
For all k∈ω there exists ξk such that 1≤ξk<ξ(n,i) and (g(n,i))k−1(j)∈Πξk0(Z) for every j∈ω.
Fix a bijection ⟨⋅,⋅,⋅⟩:ω×ω×ω⟶ω and define g:Z⟶ωω by setting g(x)(⟨n,i,j⟩)=g(n,i)(x)(j) for every x∈Z and n,i,j∈ω. Denote by G=g∗[Z] the graph of g. Using condition (4) and arguments as in the case ξ=2, one can show that G is closed in Z×ωω. Using condition (5), it is easy to see that each g∗[A(n,i,j)]∈Δ10(G). Since G∖g∗[A(n,i)]=⋃j∈ωg∗[A(n,i,j)], by proceeding as in the proof of the case ξ=2 it is possible to obtain h:G⟶ωω that satisfies the following conditions, where H=h∗[G] denotes the graph of h:
(7)
H is closed in G×ωω,
2. (8)
h∗[g∗[An]]∈Σ10(H) for every n∈ω,
3. (9)
h⟨n,i⟩−1(0)=g∗[A(n,i)] and h⟨n,i⟩−1(j+1)=g∗[A(n,i,j)] for every n,i,j∈ω.
Finally, define f:Z⟶ωω+ω by setting
fk(x)=gk(x) and fω+k(x)=hk(x,g(x)) for every x∈Z and k∈ω. Also set F=f∗[Z]. Using conditions (6) and (9), it is easy to check that condition (\refkuratowskistrictlysmaller) will hold. By identifying ωω+ω with ωω×ωω in the obvious way, F can be identified with H. Therefore, condition (\refkuratowskiinverseimage) holds by condition (8). Furthermore, since condition (7) holds and G×ωω is closed in Z×ωω×ωω, it follows that condition (\refkuratowskigraphclosed) holds.
∎
Corollary 12.3**.**
Let Z be a zero-dimensional Polish space, let 1≤ξ<ω1, and let A⊆Σξ0(Z) be countable. Then there exists a zero-dimensional Polish space W and a Σξ0-measurable bijection f:Z⟶W such that f[A]∈Σ10(W) for every A∈A.
Proof.
The case ξ=1 is trivial, so assume that ξ≥2. Then the desired result follows from Theorem 12.2, by setting W=F and f=f∗.
∎
Corollary 12.4** (Kuratowski).**
Let (Z,τ) be a zero-dimensional Polish space, let 1≤ξ<ω1, and let B⊆Σξ0(Z,τ) be countable. Then there exists a zero-dimensional Polish topology σ on the set Z such that τ⊆σ⊆Σξ0(Z,τ) and B⊆σ.
Proof.
Let U be a countable base for (Z,τ). Let f and W be given by applying Corollary 12.3 with A=B∪U, then define
[TABLE]
It is straightforward to verify that σ satisfies all of the desired properties.
∎
We conclude this section with the “two-variable” versions of Corollaries 12.4 and 12.3 respectively. Corollary 12.6 will be needed in Section 18.
Theorem 12.5**.**
Let (Z,τ) be a zero-dimensional Polish space, let ξ,η<ω1, and let A⊆Σ1+η+ξ0(Z,τ) be countable. Then there exists a zero-dimensional Polish topology σ on the set Z such that τ⊆σ⊆Σ1+η0(Z,τ) and A⊆Σ1+ξ0(Z,σ).
Proof.
By [Ke, Lemma 13.3], it will be enough to consider the case A={A}. We will proceed by induction on ξ. The case ξ=0 is Corollary 12.4. Now assume that ξ>0 and the result holds for every ξ′<ξ. Write A=⋃n∈ω(Z∖An), where each An∈Σ1+η+ξn0(Z,τ) for suitable ξn<ξ. By the inductive assumption, for each n, we can fix a zero-dimensional Polish topology σn on the set Z such that τ⊆σn⊆Σ1+η0(Z,τ) and An∈Σ1+ξ0(Z,σn). Using [Ke, Lemma 13.3] again, it is easy to check that the topology σ on Z generated by ⋃n∈ωσn is as desired.
∎
Corollary 12.6**.**
Let Z be a zero-dimensional Polish space, let ξ,η<ω1, and let A⊆Σ1+η+ξ0(Z) be countable. Then there exists a zero-dimensional Polish space W and a Σ1+η0-measurable bijection f:Z⟶W such that f[A]∈Σ1+ξ0(W) for every A∈A.
Proof.
The space W is simply the set Z with the finer topology given by Theorem 12.5, while f=idZ.
∎
13. Expansions: basic facts
The following notion is essentially due to Wadge (see [Wa1, Chapter IV]), and it is inspired by work of Kuratowski. It is one of the fundamental concepts needed to state our main result (see Definition 22.1). Proposition 13.2, whose straightforward proof is left to the reader, lists some of its most basic properties.
Definition 13.1**.**
Let Z be a space, and let ξ<ω1. Given Γ⊆P(Z), define
[TABLE]
We will refer to Γ(ξ) as an expansion of Γ.
Proposition 13.2**.**
Let Z be a space, let Γ⊆P(Z), and let ξ<ω1.
•
Γ(ξ)* is continuously closed.*
•
Γ⊆Γ(η)⊆Γ(ξ)* whenever η≤ξ.*
•
Γ(0)=Γ* whenever Γ is continuously closed.*
•
Γ(ξ)=Γ(ξ).
The following is the corresponding definition in the context of Hausdorff operations. Lemma 13.9 below shows that this is in fact the “right” definition.
Definition 13.3**.**
Let Z be a space, let D⊆P(ω), and let ξ<ω1. Define
[TABLE]
As an example (that will be useful later), consider the following simple observation.
Proposition 13.4**.**
Let 1≤η<ω1. Then there exists D⊆P(ω) such that ΓD(ξ)(Z)=Dη(Σ1+ξ0(Z)) for every space Z and every ξ<ω1.
Proof.
This is proved like Proposition 9.3 (in fact, the same D will work).
∎
The following proposition shows that Definition 13.3 actually fits in the context provided by Section 9.
Proposition 13.5**.**
Let D⊆P(ω), and let ξ<ω1. Then there exists E⊆P(ω) such that ΓD(ξ)(Z)=ΓE(Z) for every space Z.
Proof.
This is proved by combining Propositions 9.4 and 8.3.
∎
Corollary 13.6**.**
Let Z be a zero-dimensional space in which 2ω embeds, let D⊆P(ω), and let ξ<ω1. Then ΓD(ξ)(Z)∈NSD(Z).
Proof.
This is proved by combining Proposition 13.5 and Theorem 10.5.
∎
The following useful result is the analogue of Lemma 6.2 in the present context.
Lemma 13.7**.**
Let Z and W be spaces, let D⊆P(ω), and let ξ<ω1.
(1)
If f:Z⟶W is continuous and B∈ΓD(ξ)(W) then f−1[B]∈ΓD(ξ)(Z).
2. (2)
If f:Z⟶W is Σ1+ξ0-measurable and B∈ΓD(W) then f−1[B]∈ΓD(ξ)(Z).
3. (3)
If h:Z⟶W is a homeomorphism then A∈ΓD(ξ)(Z) iff h[A]∈ΓD(ξ)(W).
4. (4)
Assume that W⊆Z. Then B∈ΓD(ξ)(W) iff there exists A∈ΓD(ξ)(Z) such that B=A∩W.
Proof.
This is a straightforward consequence of Proposition 8.4.
∎
Finally, we show that Ha(Z) is closed under expansions (see Proposition 13.10). We will need the following result, which is another variation on the theme of Kuratowski’s transfer theorem. Notice however that, at this point, we do not know that Γ(ξ) is a non-selfdual Wadge class whenever Γ is. That this is true will follow from Theorem 22.2.
Lemma 13.8**.**
Let Z be a zero-dimensional Polish space, let D⊆P(ω), let ξ<ω1, and let A⊆ΓD(ξ)(Z) be countable. Then there exists a zero-dimensional Polish space W and a Σ1+ξ0-measurable bijection f:Z⟶W such that f[A]∈ΓD(W) for every A∈A.
Proof.
If A=∅ the desired result is trivial, so assume that A=∅. Let A={Am:m∈ω} be an enumeration. Given m∈ω, fix B(m,n)∈Σ1+ξ0(Z) for n∈ω such that Am=HD(B(m,0),B(m,1),…). Define B={B(m,n):m,n∈ω}. By Corollary 12.3, we can fix a zero-dimensional Polish space W and a Σ1+ξ0-measurable bijection f:Z⟶W such that f[B]∈Σ10(W) for every B∈B. It remains to observe that
[TABLE]
for every m∈ω, where the second equality follows from Proposition 8.4.2.
∎
Lemma 13.9**.**
Let Z be an uncountable zero-dimensional Polish space, let D⊆P(ω), and let ξ<ω1. Then ΓD(Z)(ξ)=ΓD(ξ)(Z).
Proof.
The inclusion ΓD(Z)(ξ)⊆ΓD(ξ)(Z) follows from Lemma 13.7.2. In order to prove the other inclusion, pick A∈ΓD(ξ)(Z). By Lemma 13.8, we can fix a zero-dimensional Polish space W and a Σ1+ξ0-measurable bijection f:Z⟶W such that f[A]∈ΓD(W). Since 2ω embeds in Z and W is zero-dimensional, using Lemma 9.5.2 we can assume without loss of generality that W is a subspace of Z, so that f:Z⟶Z. By Lemma 9.5.3, we can fix B∈ΓD(Z) such that B∩W=f[A]. It is easy to check that A=f−1[B], which concludes the proof.
∎
Proposition 13.10**.**
Let Z be an uncountable zero-dimensional Polish space, let ξ<ω1, and let Γ∈Ha(Z). Then Γ(ξ)∈Ha(Z).
Proof.
This follows from Lemma 13.9 and Proposition 13.5.
∎
14. Expansions: relativization
In this section we collect some useful results, showing that expansions interact in the expected way with the machinery of relativization. Lemma 14.3 is yet another variation on the theme of Kuratowski’s transfer theorem. These facts will be needed in Section 16.
Lemma 14.1**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z and W be zero-dimensional Polish spaces, let Γ∈NSDΣ(ωω), let ξ<ω1, and let f:Z⟶W be Σ1+ξ0-measurable. Then f−1[A]∈Γ(ξ)(Z) for every A∈Γ(W).
Proof.
Pick A∈Γ(W). To see that f−1[A]∈Γ(ξ)(Z), we have to show that g−1[f−1[A]]∈Γ(ξ) for every continuous g:ωω⟶Z. So pick such a g. Since A∈Γ(W), by condition (\refexistsemb) of Lemma 6.3, we can fix an embedding j:W⟶ωω and B∈Γ such that A=j−1[B]. The proof is concluded by observing that
[TABLE]
by the definition of expansion, since j∘f∘g is Σ1+ξ0-measurable by Lemma 18.1.
∎
Lemma 14.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space, let Γ∈NSDΣ(ωω), and let ξ<ω1. Then Γ(Z)(ξ)=Γ(ξ)(Z).
Proof.
In order to prove the inclusion ⊆, pick A∈Γ(Z)(ξ). We have to show that g−1[A]∈Γ(ξ) for every continuous function g:ωω⟶Z. So pick such a g. By the definition of expansion, there exists a Σ1+ξ0-measurable function f:Z⟶Z and B∈Γ(Z) such that f−1[B]=A. By condition (\refexistsemb) of Lemma 6.3, there exists an embedding j:Z⟶ωω and C∈Γ such that B=j−1[C]. Using Lemma 18.1, one sees that j∘f∘g:ωω⟶ωω is a Σ1+ξ0-measurable function. Therefore g−1[A]=(j∘f∘g)−1[C]∈Γ(ξ) by the definition of expansion.
In order to prove the inclusion ⊇, pick A∈Γ(ξ)(Z). By [Ke, Theorem 7.8], we can fix an embedding i:Z⟶ωω such that i[Z] is closed in ωω. Therefore, by [Ke, Proposition 2.8], there exists a retraction ρ:ωω⟶i[Z]. Observe that i[A]∈Γ(ξ)(i[Z]) by Lemma 6.2.2. Set A′=ρ−1[i[A]], and observe that A′∈Γ(ξ). Therefore, there exist a Σ1+ξ0-measurable function f:ωω⟶ωω and B′∈Γ such that f−1[B′]=A′. Since Z is uncountable, we can fix an embedding j:ωω⟶Z. By Lemmas 6.2.2, 6.2.4 and 6.4, there exists B∈Γ(Z) such that B∩j[ωω]=j[B′]. The proof is concluded by observing that A=(j∘f∘i)−1[B], and that j∘f∘i is Σ1+ξ0-measurable by Lemma 18.1.
∎
Lemma 14.3**.**
Let Z be a zero-dimensional Polish space, let Γ⊆P(ωω), and let ξ<ω1. Assume that A⊆Γ(Z)(ξ) and B⊆Σ1+ξ0(Z) are countable. Then there exists a zero-dimensional Polish space W and a Σ1+ξ0-measurable bijection f:Z⟶W such that f[A]∈Γ(W) for every A∈A and f[B]∈Σ10(W) for every B∈B.
Proof.
If A=∅ then the desired result is Corollary 12.3, so assume that A=∅. Let A={An:n∈ω} be an enumeration. By the definition of expansion, we can fix Σ1+ξ0-measurable functions gn:Z⟶Z and Bn∈Γ(Z) for n∈ω such that An=gn−1[Bn]. Fix a countable base U for Z, and set
[TABLE]
By Corollary 12.3, there exists a zero-dimensional Polish space W and Σ1+ξ0-measurable bijection f:Z⟶W such that f[C]∈Σ10(W) for every C∈C. We claim that f[An]∈Γ(W) for every n∈ω. So pick n∈ω. Since f[An]=f[gn−1[Bn]]=(gn∘f−1)−1[Bn], by Lemma 6.2.1, it will be enough to show that gn∘f−1 is continuous. This follows from the fact that (gn∘f−1)−1[U]=f[gn−1[U]]∈Σ10(W) for every U∈U.
∎
15. Level: basic facts
In this section we will introduce the notion of level, which is one of the fundamental concepts involved in our main result (see Definition 22.1). We will need the following preliminary definition. Both notions are taken from [LSR1], which was however limited to the Borel context (see also [Lo2, Section 7.3.4]).131313 In [LSR1], the notation Δ1+ξ0-PU is used instead of PUξ, and λC is used instead of ℓ.
Definition 15.1** (Louveau, Saint-Raymond).**
Let Z be a space, let Γ⊆P(Z), and let ξ<ω1. Define PUξ(Γ) to be the collection of all sets of the form
[TABLE]
where each An∈Γ, each Vn∈Δ1+ξ0(Z), the Vn are pairwise disjoint, and ⋃n∈ωVn=Z. A set in this form is called a partitioned union of sets in Γ.
Notice that the sets Vn in the above definition are not required to be non-empty. The following proposition, whose straightforward proof is left to the reader, collects the most basic facts about partitioned unions.
Proposition 15.2**.**
Let Z be a space, let Γ⊆P(Z), and let ξ<ω1.
(1)
If Γ is continuously closed then PUξ(Γ) is continuously closed.
2. (2)
Γ⊆PUη(Γ)⊆PUξ(Γ)* whenever η≤ξ.*
3. (3)
PU0(Γ)=Γ* whenever Γ is a Wadge class in Z.*
4. (4)
PUξ(Γ)=PUξ(Γ).
5. (5)
PUξ(PUξ(Γ))=PUξ(Γ).
Definition 15.3** (Louveau, Saint-Raymond).**
Let Z be a space, let Γ⊆P(Z), and let ξ<ω1. Define
•
ℓ(Γ)≥ξ if PUξ(Γ)=Γ,
•
ℓ(Γ)=ξ if ℓ(Γ)≥ξ and ℓ(Γ)≥ξ+1,
•
ℓ(Γ)=ω1 if ℓ(Γ)≥η for every η<ω1.
We refer to ℓ(Γ) as the level of Γ.
Notice that, by Proposition 15.2.3, ℓ(Γ)≥0 for every Wadge class Γ. Using [Ke, Theorem 22.4 and Exercise 37.3], one sees that the following hold for every uncountable Polish space Z:
•
ℓ({∅})=ℓ({Z})=ω1,
•
ℓ(Σ1+ξ0(Z))=ℓ(Π1+ξ0(Z))=ξ whenever ξ<ω1,
•
ℓ(Σn1(Z))=ℓ(Πn1(Z))=ω1 whenever 1≤n<ω.
In fact, the classes of uncountable level can be characterized as those closed under Borel preimages (see Corollary 18.4 for a more precise statement).
We remark that it is not clear at this point whether for every non-selfdual Wadge class Γ there exists ξ≤ω1 such that ℓ(Γ)=ξ.141414 It is conceivable that PUξ(Γ)=Γ for all ξ<η, where η is a limit ordinal, while PUη(Γ)=Γ. In Section 17, we will show that this is in fact the case (see Corollary 17.2).
The following simple proposition shows that the notion of level becomes rather trivial when the ambient space is countable.
Proposition 15.4**.**
Let Z be a countable space, and let {∅,Z}⊆Γ⊆P(Z). Assume that ℓ(Γ)≥1. Then Γ=P(Z).
Proof.
Use the fact that {{x}:x∈Z} is a countable partition of Z consisting of Δ20 sets. ∎
We conclude this section with another simple result, which shows that classes of high level are guaranteed to have certain closure properties. Its straightforward proof is left to the reader.
Lemma 15.5**.**
Let Z be a space, let Γ⊆P(Z) be such that ∅∈Γ, and let ξ<ω1. Assume that ℓ(Γ)≥ξ. Then A∩V∈Γ whenever A∈Γ and V∈Δ1+ξ0(Z).
16. Expansions: the main theorem
The main result of this section is Theorem 16.1, which clarifies the crucial connection between level and expansion. This result can be traced back to [LSR1, Théorème 8], but the proof given here is essentially the same as [Lo2, proof of Theorem 7.3.9.ii]. Both of these are however limited to the Borel context.
Theorem 16.1**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space, and let ξ<ω1. Then, for every Γ∈NSDΣ(Z), the following conditions are equivalent:
(1)
ℓ(Γ)≥ξ,
2. (2)
Γ=Λ(ξ)* for some Λ∈NSDΣ(Z).*
Proof.
First we will prove that the implication (\reflevelgeqxi)→(\refexpansionofsomething) holds. Pick Γ(Z)∈NSDΣ(Z), where Γ∈NSDΣ(ωω). Assume that ℓ(Γ(Z))≥ξ. Let Λ(Z)∈NSDΣ(Z), where Λ∈NSDΣ(ωω), be ⊆-minimal with the property that Γ(Z)⊆Λ(Z)(ξ). We claim that Γ(Z)=Λ(Z)(ξ). Assume, in order to get a contradiction, that Λ(Z)(ξ)⊈Γ(Z). It follows from Lemma 4.4 that Γ(Z)⊆Λ(Z)(ξ). Fix A⊆Z such that Γ(Z)=A↓, and observe that {A,Z∖A}⊆Λ(Z)(ξ). Then, by Corollary 14.3, we can fix a zero-dimensional Polish space W and a Σ1+ξ0-measurable bijection f:Z⟶W such that {f[A],f[Z∖A]}⊆Λ(W).
Next, we will show that f[A] is selfdual in W. Assume, in order to get a contradiction, that this is not the case. Then we can fix Π∈NSDΣ(ωω) such that f[A]↓=Π(W). Notice that Π(W)⊆Λ(W). Furthermore W∖f[A]=f[Z∖A]∈Λ(W), hence Π(W)⊆Λ(W). Since Π(W) is non-selfdual, it follows that Π(W)⊊Λ(W). Therefore, Π(Z)⊊Λ(Z) by Theorem 7.1. On the other hand, Lemmas 14.1 and 14.2 show that A=f−1[f[A]]∈Π(ξ)(Z)=Π(Z)(ξ). Hence Γ(Z)⊆Π(Z)(ξ), which contradicts the minimality of Λ(Z).
Since f[A] is selfdual in W, by Corollary 5.5, we can fix An⊆W, pairwise disjoint Vn∈Δ10(W), and Γn∈NSDΣ(ωω) for n∈ω such that ⋃n∈ωVn=W,
[TABLE]
and An∈Γn(W)⊊Λ(W) for each n. Notice that Γn(Z)⊊Λ(Z) for each n by Theorem 7.1, hence Γ(Z)⊈Γn(Z)(ξ) for each n by the minimality of Λ(Z). It follows from Lemma 4.4 that Γn(Z)(ξ)⊆Γ(Z) for each n.
Set Bn=W∖An∈Γn(W) for n∈ω. Observe that f−1[Bn]∈Γn(ξ)(Z)=Γn(Z)(ξ)⊆Γ(Z) for each n by Lemmas 14.1 and 14.2. Furthermore, it is clear that f−1[Vn]∈Δ1+ξ0(Z) for each n and ⋃n∈ωf−1[Vn]=Z. In conclusion, since W∖f[A]=⋃n∈ω(Bn∩Vn), we see that
[TABLE]
where the last equality uses the assumption that ℓ(Γ(Z))≥ξ. This contradicts the fact that Γ(Z) is non-selfdual.
In order to show that (\refexpansionofsomething)→(\reflevelgeqxi), assume that Γ,Λ∈NSDΣ(ωω) are such that Λ(Z)(ξ)=Γ(Z). Pick An∈Γ(Z) and pairwise disjoint Vn∈Δ1+ξ0(Z) for n∈ω such that ⋃n∈ωVn=Z. We need to show that ⋃n∈ω(An∩Vn)∈Γ(Z). By Lemma 14.3, we can fix a zero-dimensional Polish space W and a Σ1+ξ0-measurable bijection f:Z⟶W such that each f[An]∈Λ(W) and each f[Vn]∈Δ10(W). Set B=⋃n∈ω(f[An]∩f[Vn]), and observe that B∈PU0(Λ(W))=Λ(W). It follows from Lemmas 14.1 and 14.2 that
[TABLE]
Corollary 16.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z and W be uncountable zero-dimensional Polish spaces, let ξ<ω1, and let Γ∈NSDΣ(ωω). Then ℓ(Γ(Z))≥ξ iff ℓ(Γ(W))≥ξ.
Proof.
We will only prove the left-to-right implication, as the other one can be proved similarly. Assume that ℓ(Γ(Z))≥ξ. Then, by Theorem 16.1, there exists Λ∈NSDΣ(ωω) such that Λ(Z)(ξ)=Γ(Z). Therefore Λ(ξ)(Z)=Γ(Z) by Lemma 14.2. Notice that Λ(ξ) is non-selfdual, otherwise Γ(Z) would be selfdual. Furthemore, Λ(ξ) is continuously closed by Proposition 13.2. So Λ(ξ)∈NSDΣ(ωω) by Lemma 4.5. Hence it is possible to apply Theorem 7.1, which yields Λ(ξ)(W)=Γ(W). By applying Corollary 14.2 again, we see that Λ(W)(ξ)=Γ(W), which implies ℓ(Γ(W))≥ξ by Theorem 16.1.
∎
17. Level: every non-selfdual Wadge class has one
The main result of this section states that every non-selfdual Wadge classes has an exact level (see Corollary 17.2). This fact will be needed in the proof of our main result (Theorem 22.2), and its proof requires the sharp analysis given by Theorem 12.2, as well as the machinery of relativization. The Borel version of Corollary 17.2 appears as [Lo2, Proposition 7.3.7], however we believe that the proof given there is not correct. The proof given here is inspired by the proof of [Lo2, Theorem 7.1.9].
We will need the basic theory of trees. For a comprehensive treatment, we refer to [Ke, Section 2]. However, we will remind the reader of the necessary notions as follows. Given a set A, a tree on A is a subset T of A<ω such that s↾n∈T for all s∈T and n≤m, where m is the domain of s. An infinite branch of T is a function f:ω⟶A such that f↾n∈T for every n∈ω. A terminal node of T is an element s∈T such that s^a∈/T for every a∈A. A tree is well-founded if it has no infinite branches. If A is countable and T is well-founded then there exists a unique rank functionρT:T⟶ω1 such that
[TABLE]
for every s∈T and ρT(s)=0 for every terminal node s∈T. The rank of a well-founded tree T is defined as follows
[TABLE]
Given a tree T on a set A and s∈A<ω, define
[TABLE]
Notice that T/s=∅ whenever s∈/T. For our purposes, the fundamental property of T/s is that if T is well-founded then T/s is well-founded and ρ(T/s)<ρ(T) whenever s∈T and s=∅.
Theorem 17.1**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, let Γ∈NSDΣ(ωω), and let η<ω1 be a limit ordinal. Assume that ℓ(Γ(Z))≥ξ for every ξ<η. Then ℓ(Γ(Z))≥η.
Proof.
By [Ke, Theorem 7.8] and Lemma 6.2.2, we can assume without loss of generality that Z is a closed subspace of ωω. By Proposition 15.4, we can also assume that Z is uncountable. Given a subspace W of ωω, we will use the notation Ws=W∩Ns for s∈ω<ω. Given a subspace W of ωω, a function f:W⟶ωω and V⊆P(W), define
[TABLE]
where F=f∗[W] denotes the graph of f. It is clear that T(f,V) is a subtree of ω<ω×ω<ω, where we identify ω<ω×ω<ω with (ω×ω)<ω in the natural way. Furthermore, it is a simple exercise to check that if W is closed in ωω, V is a cover of W, and f∗[V]∈Σ10(F) for every V∈V, then T(f,V) is well-founded. In particular, this will be the case when W=Z, V⊆Ση0(Z) is a countable partition of Z and f is an η-refining function for V. Since the existence of such a function is guaranteed by Theorem 12.2, in order to conclude the proof, it will be sufficient to show that the following condition holds for every ξ<ω1.
⊛(ξ)
Let W be a non-empty Borel subspace of ωω, let V⊆Ση0(W) be a countable partition of W, and let f:W⟶ωω be an η-refining function for V such that T(f,V) is well-founded and has rank at most ξ. Then ⋃V∈V(ψ(V)∩V)∈Γ(W) for every ψ:V⟶Γ(W).
First we will show that ⊛(0) holds. In this case T(f,V)=∅, hence there exists V∈V such that F=(W×ωω)∩F⊆f∗[V]. Therefore V={W}. It is clear that the desired conclusion holds in this case.
Now assume that 0<ξ<ω1 and that ⊛(ξ′) holds whenever ξ′<ξ. Fix W, V and f as in the statement of ⊛(ξ). Pick ψ:V⟶Γ(W). Set
[TABLE]
Given (m,n)∈I, make the following definitions:
•
W(m,n)=W(m)∩f0−1(n),
•
V(m,n)={V∩W(m,n):V∈V}∖{∅},
•
f(m,n):W(m,n)⟶ωω is the function obtained by setting f(m,n)(x)(k)=f(x)(k+1) for every k∈ω,
•
ψ(m,n):V(m,n)⟶Γ(W(m,n)) is the unique function such that ψ(m,n)(V∩W(m,n))=ψ(V)∩W(m,n) for every V∈V such that V∩W(m,n)=∅.
It is straightforward to check that
[TABLE]
hence the right-hand side has rank strictly smaller than ξ. It follows from the inductive hypothesis that ⋃V∈V(m,n)(ψ(m,n)(V)∩V)∈Γ(W(m,n)), so by Lemma 6.4 we can fix A(m,n)∈Γ(W) such that this union is equal to A(m,n)∩W(m,n). In conclusion,
[TABLE]
Let 1≤η0<η be such that f0−1(n)∈Πη00(W) for every n∈ω, as in the definition of η-refining function. Since each W(m,n)∈Δη0+10(W), in order to show that the right-hand side of the above equation belongs to Γ(W) it will be enough to show that ℓ(Γ(W))≥ξ for every ξ<η. This can be easily achieved by viewing W as a subspace of Z (which can be done since Z is uncountable), and using the corresponding assumption on Z in conjunction with Lemma 6.4.
∎
Corollary 17.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, and let Γ∈NSDΣ(Z). Then there exists ξ≤ω1 such that ℓ(Γ)=ξ.
18. Expansions: composition
In this section we will show that the composition of two expansions can be obtained as a single expansion (see Theorem 18.2). While this fact is of independent interest, our reason for proving it is Corollary 18.3, which will be needed in the proof of Theorem 22.2.
Lemma 18.1**.**
Let Z, W and T be spaces, and let ξ,η<ω1. Assume that f:Z⟶W is Σ1+ξ0-measurable and g:W⟶T is Σ1+η0-measurable. Then g∘f is Σ1+ξ+η0-measurable.
Proof.
It will be enough to prove that f−1[A]∈Σ1+ξ+η0(Z) for every A∈Σ1+η0(W). We will proceed by induction on η. The case η=0 is trivial. Now assume that the claim holds for every η′<η. Pick A∈Σ1+η0(W), and let An∈Σ1+ηn0(W) for n∈ω be such that A=⋃n∈ω(W∖An), where each ηn<η. Then
[TABLE]
because each f−1[An]∈Σ1+ξ+ηn0(Z) by the inductive assumption.
∎
Theorem 18.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space, and let ξ,η<ω1. Then (Γ(η))(ξ)=Γ(ξ+η) whenever Γ,Γ(η)∈NSDΣ(Z).
Proof.
Fix Γ∈NSDΣ(ωω) such that Γ(Z),Γ(Z)(η)∈NSDΣ(Z). We will show that
[TABLE]
The inclusion ⊆ follows from Lemma 18.1. In order to prove the inclusion ⊇, pick A∈Γ(Z)(ξ+η). Fix a Σ1+ξ+η0-measurable function g:Z⟶Z and B∈Γ(Z) such that g−1[B]=A. Fix a countable base U for Z. By Corollary 12.6, there exists a Polish space W and a Σ1+ξ0-measurable bijection f:Z⟶W such that f[g−1[U]]∈Σ1+η0(W) for every U∈U. Observe that this ensures that g∘f−1 is Σ1+η0-measurable. Set C=f[A], and observe that C=(g∘f−1)−1[B]∈Γ(η)(W) by Lemma 14.1. A further application of Lemma 14.1 shows that
Notice that, in order to apply Lemma 14.2 to obtain the middle equality above, we need to know that Γ(η)∈NSDΣ(ωω). We conclude the proof by showing that this is the case. Fix Λ∈NSDΣ(ωω) such that Λ(Z)=Γ(Z)(η). First, we claim that Λ⊆Γ(η). In order to prove the claim, pick A∈Λ. Fix an embedding j:ωω⟶W. By Lemma 6.4, there exists A′∈Λ(Z) such that A′∩W=j[A]. So we can fix a Σ1+η0-measurable f:Z⟶Z and B∈Γ(Z) such that f−1[B]=A′. Now let i:Z⟶ωω be an embedding. By Lemma 6.4, we can pick B′∈Γ(ωω)=Γ such that B′∩i[Z]=i[B]. Notice that i∘f∘j:ωω⟶ωω is Σ1+η0-measurable by Lemma 18.1. It follows from the definition of expansion that A=(i∘f∘j)−1[B′]∈Γ(η), which proves the claim.
Now assume, in order to get a contradiction, that Λ⊊Γ(η). Pick A∈Γ(η)∖Λ and B⊆ωω such that B↓=Λ. Lemma 4.4 shows that Λ⊆Γ(η), hence
[TABLE]
where the last equality holds by Lemma 14.2. This contradicts the fact that Γ(Z)(η) is non-selfdual.
∎
Corollary 18.3**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space, let Γ∈NSDΣ(Z), and let ξ=ℓ(Γ). Assume that 0<ξ<ω1. Then Γ⊊Γ(ξ).
Proof.
Assume, in order to get a contradiction, that Γ=Γ(ξ). Then
[TABLE]
where the last equality holds by Theorem 18.2. It follows from Theorem 16.1 that ξ=ℓ(Γ)≥ξ+ξ, which contradicts the assumption that ξ>0.
∎
We conclude this section with a result that will not be needed in the remainder of the article, but helps to clarify the notion of level. Given a space Z and Γ⊆P(Z), we will say that Γ is closed under Borel preimages if f−1[B]∈Γ whenever f:Z⟶Z is a Borel function and B∈Γ.
Corollary 18.4**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space, and let Γ∈NSDΣ(Z). Then the following are equivalent:
(1)
Γ* is closed under Borel preimages,*
2. (2)
ℓ(Γ)=ω1.
Proof.
In order to prove that (\refuncountablelevelpreimages)→(\refuncountablelevelomega1), assume that condition (\refuncountablelevelpreimages) holds. Pick ξ<ω1. We will show that ℓ(Γ)≥ξ. Fix A such that Γ=A↓. Pick An∈Γ and pairwise disjoint Vn∈Δ1+ξ0(Z) for n∈ω such that ⋃n∈ωVn=Z. Let fn:Z⟶Z for n∈ω witness that An≤A. Define
[TABLE]
and observe that f:Z⟶Z is a Borel function. Since Γ is closed under Borel preimages, it follows that ⋃n∈ω(An∩Vn)=f−1[A]∈Γ.
In order to prove that (\refuncountablelevelomega1)→(\refuncountablelevelpreimages), assume that condition (\refuncountablelevelomega1) holds. Pick a Borel f:Z⟶Z, and let ξ<ω1 be such that f is Σ1+ξ0-measurable. By Theorem 16.1, there exists Λ∈NSDΣ(Z) such that Λ(ξ⋅ω)=Γ. Then
[TABLE]
where the first equality holds by Theorem 18.2. It follows from the definition of expansion that f−1[A]∈Γ for every A∈Γ.
∎
19. Separated differences: basic facts
The following notion was essentially introduced in [Lo1], but we will follow the simplified approach from [Lo2]. It is the last fundamental concept needed to state our main result (see Definition 22.1).
Definition 19.1** (Louveau).**
Let Z be a space, let 1≤η<ω1, and let Vξ,n,Aξ,n,A∗⊆Z for ξ<η and n∈ω. Define
[TABLE]
Given Δ,Γ∗⊆P(Z), define SDη(Δ,Γ∗) as the collection of all sets of the form SDη((Vξ,n:ξ<η,n∈ω),(Aξ,n:ξ<η,n∈ω),A∗), where each Vξ,n∈Σ10(Z) and Vξ,m∩Vξ,n=∅ whenever m=n, each Aξ,n∈Δ, and A∗∈Γ∗.
We begin with two preliminary results. In particular, Lemma 19.3 gives the first “concrete” examples of Wadge classes that can be obtained using separated differences.
Lemma 19.2**.**
Let Z be a space, let 1≤η<ω1, and let Δ,Γ⊆P(Z). Then
[TABLE]
Proof.
It is not hard to realize that the equality
[TABLE]
holds whenever Vξ,n,Aξ,n,A∗⊆Z for each ξ<η and n∈ω. The desired result follows immediately.
∎
Lemma 19.3**.**
Let Z be a zero-dimensional space, let 1≤η<ω1, and let Δ={∅}∪{Z}. Then
[TABLE]
Proof.
We will only prove the first equality, as the second one follows from it by Lemma 19.2. We will proceed by induction on η. The case η=1 is trivial. For the successor case, assume that the desired result holds for a given η. We will show that it also holds for η+1. In order to prove the inclusion ⊆, pick A=SDη+1((Vξ,n:ξ<η+1,n∈ω),(Aξ,n:ξ<η+1,n∈ω),∅) for suitable Vξ,n and Aξ,n. It is easy to realize that A=B∖C, where
[TABLE]
and C=SDη((Vξ,n:ξ<η,n∈ω),(Z∖Aξ,n:ξ<η,n∈ω),∅). By Lemma 2.4, this shows that A∈Dη+1(Σ10(Z)).
In order to prove the inclusion ⊇, pick A∈Dη+1(Σ10(Z)). By Lemma 2.4, it is possible to write A=B∖C, where B∈Σ10(Z), C∈Dη(Σ10(Z)), and C⊆B. Since C∈SDη(Δ,{∅}) by the inductive hypothesis, it is possible to write C=SDη((Vξ,n:ξ<η,n∈ω),(Cξ,n:ξ<η,n∈ω),∅) for suitable Vξ,n and Cξ,n. Let Vη,0=B and Vη,n=∅ whenever 1≤n<ω. It is easy to realize that A=SDη+1((Vξ,n:ξ<η+1,n∈ω),(Aξ,n:ξ<η+1,n∈ω),∅), where Aξ,n=Z∖Cξ,n if ξ<η, and Aη,n=Z.
Finally, assume that η is a limit ordinal and that the desired result holds for all η′<η. Since 2⋅η=η, the inclusion ⊆ follows easily from the definition of separated differences. In order to prove the inclusion ⊇, pick A∈Dη(Σ10(Z)). Using Lemma 2.5, it is possible to find pairwise disjoint Vk∈Σ10(Z) for k∈ω such that A=⋃k∈ω(A∩Vk) and for each k there exists η′<η such that A∩Vk∈Dη′(Σ10(Z)). Therefore, by the inductive assumption, for every k we can fix suitable Vξ,nk and Aξ,nk such that A∩Vk=SDη((Vξ,nk:ξ<η,n∈ω),(Aξ,nk:ξ<η,n∈ω),∅). Without loss of generality, assume that each Vξ,nk⊆Vk. Under this assumption, one sees that A=SDη((Vξ,nk:ξ<η,(n,k)∈ω×ω),(Aξ,nk:ξ<η,(n,k)∈ω×ω),∅).
∎
Finally, we show that Ha(Z) is closed under separated differences (see Proposition 19.4). Notice however that, at this point, we do not know that SDη(Δ,Γ∗) is a non-selfdual Wadge class whenever each of the classes Λn and Γ∗ described below are. That this is true will follow from Theorem 22.2.
Proposition 19.4**.**
Let Z be a zero-dimensional space in which 2ω embeds, let 1≤η<ω1, and let Γ=SDη(Δ,Γ∗), where Δ and Γ∗ satisfy the following conditions:
•
Δ=⋃n∈ω(Λn∪Λn), where each Λn∈Ha(Z) and each ℓ(Λn)≥1,
•
Γ∗∈Ha(Z)* and Γ∗⊆Δ.*
Then Γ∈Ha(Z) and ℓ(Γ)=0.
Proof.
First we will show that Γ∈Ha(Z). If Δ={∅,Z} then this follows from Lemma 19.3 and Proposition 9.3. So assume that {∅,Z}⊊Δ, and notice that this implies that Σ10(Z)∪Π10(Z)⊆Δ. Fix π:ω⟶ω such that for every m∈ω there exist infinitely many n∈ω such that π(2n)=π(2n+1)=m. Let Γ′ be the collection of all sets of the form
[TABLE]
where Aξ,n∈Λπ(n) if n is even, Aξ,n∈Λπ(n) if n is odd, A∗∈Γ∗, and each Vξ,n∈Σ10(Z). Since each Λn∈Ha(Z) and Γ∗∈Ha(Z), using Lemmas 8.3 and 8.2 it is easy to realize that Γ′∈Ha(Z). Therefore, to conclude this part of the proof, it will be enough to show that Γ′=Γ.
Notice that, in the case that Vξ,m∩Vξ,n=∅ whenever m=n, the term ⋃m∈ωm=nVξ,m is redundant. This shows that Γ′⊇SDη(Δ,Γ∗). To see that the other inclusion holds, pick A∈Γ′ as above. For every ξ<η, by [Ke, Theorem 22.16], we can fix open sets Vξ,n′⊆Vξ,n for n∈ω such that ⋃n∈ωVξ,n′=⋃n∈ωVξ,n and Vξ,m′∩Vξ,n′=∅ whenever m=n. Also set
[TABLE]
for ξ<η and n∈ω. We claim that each Aξ,n′∈Δ. This will conclude the proof because, as is straightforward to check,
[TABLE]
If Aξ,n∈Λn∪Λn for some n∈ω such that Λn={∅} and Λn={Z}, then the claim follows from Lemma 15.5. If Aξ,n=∅, the claim is trivial. Finally, if Aξ,n=Z, the claim holds because Π10(Z)⊆Δ.
It remains to show that ℓ(Γ)=0. Observe that Γ∈NSD(Z) by the first part of this proof and Theorem 10.5. It is easy to realize that Δ⊆Γ⊆PU1(Δ), where the second inclusion uses the assumption Γ∗⊆Δ. Therefore, using Proposition 15.2.5, one sees that
[TABLE]
which implies that PU1(Δ)=PU1(Γ). Since PU1(Δ) is selfdual by Proposition 15.2.4, it follows that Γ=PU1(Γ), hence ℓ(Γ)=0.
∎
20. Separated differences: the main theorem
The aim of this section is to show that every non-selfdual Wadge class Γ of level zero can be obtained by applying the operation of separated differences to classes of lower complexity (see Theorem 20.1). For technical reasons, we will need to assume that Λ∈Ha(Z) whenever Λ∈NSD(Z) is such that Λ⊊Γ. Notice however that, once Theorem 22.2 is proved, it will be possible to drop this assumption. To avoid cluttering the exposition, several preliminary lemmas are postponed until the end of the section.
Theorem 20.1**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space, and let Γ∈NSDΣ(Z). Assume that ℓ(Γ)=0 and Λ∈Ha(Z) whenever Λ∈NSD(Z) is such that Λ⊊Γ. Then there exist 1≤η<ω1, Δ and Γ∗ satisfying the following conditions:
•
Δ=⋃n∈ω(Λn∪Λn), where each Λn∈NSDΣ(Z) and each ℓ(Λn)≥1,
•
Γ∗∈NSDΣ(Z)* and Γ∗⊆Δ,*
•
Γ=SDη(Δ,Γ∗).
Proof.
Fix A such that Γ=A↓, and a countable base U⊆Δ10(Z) for Z. Define
[TABLE]
and observe that Φ is non-empty by Lemma 20.4. Furthermore, using the uniqueness part of Lemma 6.5, one sees that Φ is countable. Given a space W, define
[TABLE]
Also define Δ=⋃{Λ∪Λ:Λ∈Φ}.151515 This notation is limited to this proof, as it is easy to realize that the desired Δ (the one mentioned in the statement of the theorem) will in fact be Δ[Z]. It is easy to check that the following facts hold whenever W is a space and Λ is a Wadge class in ωω:
•
If Λ⊆Δ then Λ(W)⊆Δ[W],
•
If Δ⊆Λ then Δ[W]⊆Λ(W).
Given W⊆Z, define
[TABLE]
Recursively define a subset Zξ of Z for every ξ<ω1 as follows:
•
Z0=Z,
•
Zξ=⋂ξ′<ξZξ′ if ξ is a limit ordinal,
•
Zξ+1=∂(Zξ).
Since the Zξ form a decreasing sequence of closed sets, we can fix the minimal ζ<ω1 such that Zζ=Zζ+1.
Define
[TABLE]
for every ξ<ζ. Given ξ<ζ, using the fact that Z is zero-dimensional, it is possible to obtain {Vξ,n:n∈ω}⊆Δ10(Z) satisfying the following conditions:
•
Vξ,m∩Vξ,n=∅ whenever m=n,
•
for all n∈ω there exists U∈Uξ such that Vξ,n⊆U,
•
⋃n∈ωVξ,n=⋃Uξ.
Observe that
[TABLE]
for every ξ<ω1.
Notice that, by Lemma 6.4, for every ξ<ζ and U∈Uξ we can fix Aξ,U∈Δ[Z] such that Aξ,U∩U∩Zξ=A∩U∩Zξ. Given ξ<ζ and n∈ω, choose U∈Uξ such that Vξ,n⊆U and define Aξ,n=Aξ,U. At this point, it is easy to check that
⊛(ξ)
A=SDξ((Vξ′,n:ξ′<ξ,n∈ω),(Aξ′,n:ξ′<ξ,n∈ω),A∩Zξ)
whenever 1≤ξ<ζ.
The next part of the proof is aimed at showing that {ξ<ω1:Zξ=∅} has a maximal element. This will follow from Claims 1 and 5. Claim 2 is a technical result, which will be needed in the proofs of Claims 5 and 7. The significance of Claim 3 will be explained later. Claim 4 will be needed in the proofs of Claims 5 and 10, in order to show that certain separated differences are non-selfdual Wadge classes.
Claim 1:Zζ=∅.
Assume, in order to get a contradiction, that Zζ=∅. Notice that Zζ cannot have isolated points, otherwise we would have Zζ+1⊊Zζ. By applying Lemma 20.4 to Zζ and its base {U∩Zζ:U∈U}∖{∅}, we can fix Λ∈NSDΣ(ωω) and U∈U such that U∩Zζ=∅, ℓ(Λ)≥1, Λ(U∩Zζ) is non-selfdual, and Λ(U∩Zζ)=(A∩U∩Zζ)↓. Observe that U is uncountable because Zζ has no isolated points. First we will show that Δ⊆Λ. If this were not the case, then Lemma 4.6 would imply that Λ⊆Δ. Then, it would follow that A∩U∩Zζ∈Λ(U∩Zζ)⊆Δ[U∩Zζ], which would contradict the assumption that Zζ=Zζ+1.
To finish the proof of the claim, we will show that Λ(U)=(A∩U)↓. Notice that this will imply Λ∈Φ, hence Λ⊆Δ. Since we have already seen that Δ⊆Λ, this will contradict the fact that Λ is non-selfdual.
Observe that
[TABLE]
is cover of U consisting of pairwise disjoint Δ20 sets. By Lemma 6.4, we can fix B∈Λ(U) such that B∩U∩Zζ=A∩U∩Zζ. It is easy to realize that
[TABLE]
Notice that each Aξ,n∩U∈Δ[U]⊆Λ(U) by Lemma 6.4. Since Λ={ωω} by the fact that Δ⊆Λ, it follows from Lemma 4.8 that each Aξ,n∩Vξ,n∩U∈Λ(U). In conclusion, since ℓ(Λ(U))≥1 by Corollary 16.2, one sees that A∩U∈PU1(Λ(U))=Λ(U). This allows us to apply Lemma 20.3 with Z=U, W=U∩Zζ, and g the natural embedding, which yields Λ(U)=(A∩U)↓. ■
Claim 2: Let 1≤ν<ζ, and let Γ′∈NSDΣ(ωω). If A∈SDν(Δ[Z],Γ′(Z)) then A∩Zν∈Γ′(Zν).
Suppose A=SDν((Vξ,n′:ξ<ν,n∈ω),(Aξ,n′:ξ<ν,n∈ω),A′), where the Vξ,n′∈Σ10(Z) are pairwise disjoint, each Aξ,n′∈Δ[Z], and A′∈Γ′(Z). Define
[TABLE]
for ξ≤ν. First we will prove, by induction on ξ, that Zξ⊆Zξ′ for every ξ≤ν. The case ξ=0 and the limit case are trivial. Now assume that Zξ⊆Zξ′ for a given ξ<ν. In order to prove that Zξ+1⊆Zξ+1′, it will be enough to show that A∩U∩Zξ∈Δ[U∩Zξ] for every U∈U such that U∩Zξ=∅ and U⊆Vξ,n′ for some n∈ω. This follows from Lemma 6.4 plus the fact that A∩U∩Zξ=Aξ,n′∩U∩Zξ for every such U, which can easily be deduced by inspecting the expression of A as a separated difference, using the inductive assumption that Zξ⊆Zξ′.
At this point, using the fact that Zν⊆Zν′, it is easy to realize that A∩Zν=A′∩Zν. Since A′∩Zν∈Γ′(Zν) by Lemma 6.4, this concludes the proof of the claim. ■
From this point on, it will be useful to assume that {∅,ωω}⊊Δ. The following claim, together with Theorem 11.2 and Lemma 19.3, shows that this does not result in any loss of generality. In the remainder of the proof, we will use two consequences of this assumption. The first one is that, by Lemma 4.8, we will have A∩U∈Δ[Z] whenever A∈Δ[Z] and U∈Δ10(Z). The second one is given by Claim 8.
Claim 3: Assume that Δ={∅,ωω}. Then A∈Δ20(Z).
Notice that {Zξ∖Zξ+1:ξ<ζ} is a partition of Z by Claim 1. Therefore
[TABLE]
By inspecting the definition of ∂, using the fact that Δ={∅,ωω}, it is easy to realize that both
[TABLE]
for every ξ<ζ. Since Σ10(F)⊆Σ20(Z) for every F∈Π10(Z), it follows that both A∈Σ20(Z) and Z∖A∈Σ20(Z). Hence A∈Δ20(Z). ■
Claim 4:Λ(Z)⊊Γ for every Λ∈Φ. In particular, Λ(Z)∈Ha(Z) for every Λ∈Φ.
Pick Λ∈Φ, and let U∈U be such that Λ(U) is non-selfdual and Λ(U)=(A∩U)↓. It will be enough to show that Λ(Z)⊆Γ, as ℓ(Γ)=0 by assumption, while ℓ(Λ(Z))≥1 by Corollary 16.2.
First assume that U is countable. Observe that Σ20(ωω),Π20(ωω)∈NSDΣ(ωω) by Proposition 9.4 and Theorem 10.5. Since Λ(U) is non-selfdual, we must have Σ20(ωω)⊈Λ and Π20(ωω)⊈Λ. Therefore, Λ⊆Δ20(ωω) by Lemma 4.4. Notice that it is not possible that Λ=Dν(Σ10(ωω)) or Λ=Dν(Σ10(ωω)) for some 1≤ν<ω1, because these classes have level [math] by Lemma 19.3 and Proposition 19.4. It follows from Theorem 11.2 that Λ={∅} or Λ={ωω}, which concludes the proof of the claim in this case.
Now assume that U is uncountable, and that Λ={ωω}. By Lemma 6.4, there exists A′∈Λ(Z) such that A′∩U=A∩U. It follows from Lemma 4.8 that A∩U∈Λ(Z). Therefore, an application of Lemma 20.3 with W=U and g:U⟶Z the natural embedding yields Λ(Z)=(A∩U)↓. Since A∩U∈Γ by Lemma 4.8, this concludes the proof of the claim. ■
Claim 5: Let ν<ω1 be a limit ordinal such that Zξ=∅ for every ξ<ν. Then Zν=∅.
Observe that ν≤ζ by Claim 1. Assume, in order to get a contradiction, that Zν=∅. Given any ξ<ν and W⊆⋃ξ′<ξ+1n∈ωVξ′,n, using condition ⊛(ξ+1), it is easy to realize that
[TABLE]
Furthermore, if W∈Δ10(Z) then each Aξ′,n∩W∈Δ[Z] by Lemma 4.8, since we are assuming that {∅,ωω}⊊Δ. In particular, A∩Vξ,n∈SDξ+1(Δ[Z],{∅}) for every ξ<ν and n∈ω. By Claim 4, Lemma 19.4, and Theorem 10.5, for every ξ<ω1 we can fix Bξ⊆Z such that SDξ+1(Δ[Z],{∅})=Bξ↓. Finally, we will show that Bξ<A in Z whenever ξ<ν. Since {Vξ,n:ξ<ν and n∈ω} is a cover of Z by the assumption that Zν=∅, an application of Proposition 5.1 will contradict the fact that A is non-selfdual, hence conclude the proof of the claim.
Pick ξ<ν. We need to show that A≰Bξ and Bξ≤A. First assume, in order to get a contradiction, that A≤Bξ. Then A∩Zξ+1=∅ by Claim 2. It follows from the definition of ∂ that Zξ+2=∅, which contradicts our assumptions. Now assume, in order to get a contradiction, that Bξ≰A. Then A≤Z∖Bξ by Lemma 4.4, hence A∈SDξ+1(Δ[Z],{Z}) by Lemma 19.2. Therefore A∩Zξ+1=Zξ+1 by Claim 2. Again, it follows from the definition of ∂ that Zξ+2=∅, which contradicts our assumptions. ■
As we mentioned above, Claims 1 and 5 allow us to define
[TABLE]
Observe that 1≤η<ζ, where the first inequality is given by the following claim, while the second one is an obvious consequence of Claim 1.
Claim 6:η≥1.
Assume, in order to get a contradiction, that η=0. This means that U0={U∈U:A∩U∈Δ[U]} is a cover of Z0=Z. We will show that A∩U<A in Z for every U∈U0. This will conclude the proof by Proposition 5.1, as the fact that A is non-selfdual will be contradicted.
The reduction A∩U≤A follows from Lemma 4.8. Now assume, in order to get a contradiction, that A≤A∩U. By Lemma 6.4, there exists A′∈Δ[Z] such that A′∩U=A∩U. On the other hand A′∩U∈Δ[Z] by Lemma 4.8, because are assuming that {∅,ωω}⊊Δ. In conclusion, we see that A≤A∩U=A′∩U∈Δ[Z], which contradicts Claim 4. ■
The next claim will allow us to define Γ∗. Set A∗=A∩Zη.
Claim 7:A∗ is non-selfdual in Zη.
Assume, in order to get a contradiction, that A∗ is selfdual in Zη. By Corollary 5.5, we can fix pairwise disjoint Uk∈Δ10(Zη) and non-selfdual Ak<A∗ in Zη for k∈ω such that ⋃k∈ωUk=Zη and ⋃k∈ω(Ak∩Uk)=A∗. By Lemma 6.5, we can fix Γk∈NSDΣ(ωω) for k∈ω such that Γk(Zη)=Ak↓. By [Ke, Theorem 7.3], we can fix a retraction ρ:Z⟶Zη. Define Wk=ρ−1[Uk] for each k. Next, we will show that A∩Wk<A in Z for each k. Notice that, by Proposition 5.1, this will contradict the fact that A is non-selfdual, hence conclude the proof of the claim.
Pick k∈ω. First assume that Γk={ωω}. Then Ak∩Uk∈Γk(Zη) by Lemma 4.8. Therefore, since A∗∩Wk=A∗∩Uk=Ak∩Uk, by Lemma 6.4 there exists A′∈Γk(Z) such that A′∩Zη=A∗∩Wk. Using condition ⊛(η), it is easy to realize that
[TABLE]
Furthermore, using Lemma 4.8 and the assumption that {∅,ωω}⊊Δ, one sees that each Aξ,n∩Wk∈Δ[Z]. In conclusion, we see that A∩Wk∈SDη(Δ[Z],Γk(Z)). To see that the same holds in the case Γk={ωω}, observe that
[TABLE]
where Vξ,n′=Vξ,n∩Wk for every n∈ω, Vξ,−1′=Z∖Wk, and Aξ,−1=∅.
Using the fact that Ak<A∗ in Zη and Ak is non-selfdual in Zη, one sees that A∗∈/Γk(Zη) and A∗∈/Γk(Zη). Therefore A∈/SDη(Δ[Z],Γk(Z)) and A∈/SDη(Δ[Z],Γk(Z)) by Claim 2. In particular, A∈/Γk(Z) and A∈/Γk(Z). Hence Γk(Z)⊊Γ by Lemma 4.4, which implies Γk(Z)∈Ha(Z) by assumption. In conclusion, by Claim 4, Proposition 19.4, and Theorem 10.5, we can fix B⊆Z such that B↓=SDη(Δ[Z],Γk(Z)). It remains to show that B<A. This follows from the second sentence of this paragraph, using Lemmas 4.4 and 19.2. ■
By Claim 7, we can fix Γ∗∈NSDΣ(ωω) such that Γ∗(Zη)=A∗↓. The final part of the proof (namely, Claims 9 and 10) will show that Δ[Z] and Γ∗(Z) satisfy the desired requirements. Claim 8 will be used in the proof of Claim 9.
Claim 8:Σ20(ωω)∪Π20(ωω)⊆Δ.
Since Δ is selfdual, it will be enough to show that Σ20(ωω)⊆Δ or Π20(ωω)⊆Δ. Using the assumption {∅,ωω}⊊Δ, we can pick Λ∈Φ such that Λ={∅} and Λ={ωω}. Assume, in order to get a contradiction, that Σ20(ωω)⊈Λ and Π20(ωω)⊈Λ. Now proceed as in the proof of Claim 4. ■
Claim 9:Γ∗(Z)⊆Δ[Z].
First assume that Zη is countable. Observe that Γ∗⊆Π20(ωω), otherwise we would have Σ20(ωω)⊆Γ∗ by Lemma 4.4, hence Γ∗(Zη)=P(Zη), which would contradict the fact that Γ∗(Zη) is non-selfdual. It follows that Γ∗(Z)⊆Π20(Z)⊆Δ[Z], where the last inclusion holds by Claim 8. Now assume that Zη is uncountable. Assume, in order to get a contradiction, that Γ∗(Z)⊈Δ[Z]. Then Δ[Z]⊊Γ∗(Z) by Lemma 4.6. Since Zη is uncountable, it follows from Theorem 7.1 that Δ[Zη]⊊Γ∗(Zη). Notice that
[TABLE]
is a cover of Zη by the definition of η. To conclude the proof of the claim, it will be enough to show that A∗∩V<A∗ in Zη for every V∈Vη, as this will contradict Claim 7 by Proposition 5.1. Pick V∈Vη. It is clear from the definition of Uη that A∗∩V∈Δ[V∩Zη]. Therefore, by Lemma 6.4, there exists B∈Δ[Zη] such that B∩V=A∗∩V. By Lemma 4.8, using the assumption that {∅,ωω}⊊Δ, it follows that A∗∩V∈Δ[Zη]. Since Δ[Zη]⊊Γ∗(Zη), this finishes the proof of the claim. ■
Claim 10:Γ=SDη(Δ[Z],Γ∗(Z)).
Notice that SDη(Δ[Z],Γ∗(Z))∈NSDΣ(Z) by Claims 4 and 9, Lemma 19.4, and Theorem 10.5. Furthermore, condition ⊛(η) shows that A∈SDη(Δ[Z],Γ∗(Z)). This proves that the inclusion ⊆ holds. By Lemma 4.4, in order to prove that the inclusion ⊇ holds, it will be enough to show that Z∖A∈/SDη(Δ[Z],Γ∗(Z)). Assume, in order to get a contradiction, that this is not the case. Then A∈SDη(Δ[Z],Γ∗(Z)) by Lemma 19.2, hence A∗=A∩Zη∈Γ∗(Zη) by Claim 2. This contradicts Claim 7. ■
∎
Lemma 20.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Borel space, let W be an uncountable zero-dimensional Polish space, and let Λ∈NSDΣ(ωω). Assume that A∈Λ(Z) and B↓=Λ(W). Then there exists a continuous function f:Z⟶W such that A=f−1[B].
Proof.
By Lemma 6.2.2, we can assume without loss of generality that Z and W are subspaces of ωω. In fact, we will also assume that Z=ωω, since the general case follows easily from Lemma 6.4 and this particular case.
Set A0=B and A1=W∖B. Assume, in order to get a contradiction, that there exists C∈Λ such that A0⊆C and C∩A1=∅. It follows from Lemma 6.4 that B=A0∈Λ(W). Since Λ(W) is non-selfdual by Theorem 7.2, this is a contradiction. Therefore, an application of Lemma 4.3 with Γ=Λ and D=A yields the desired function.
∎
Lemma 20.3**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Borel space, let W be an uncountable zero-dimensional Polish space, and let Λ∈NSDΣ(ωω). Assume that A∈Λ(Z), B↓=Λ(W), and that there exists a continuous function g:W⟶Z such that B=g−1[A]. Then A↓=Λ(Z).
Proof.
Since A∈Λ(Z), we only need to show that Λ(Z)⊆A↓. So pick C∈Λ(Z). By Lemma 20.2 there exists a continuous function f:Z⟶W such that C=f−1[B]. It is clear that g∘f witnesses that C≤A. Hence C∈A↓.
∎
Lemma 20.4**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, let A∈Σ(Z), and let U⊆Δ10(Z) be a base for Z. Then there exist U∈U and Λ∈NSDΣ(ωω) such that ℓ(Λ)≥1, Λ(U) is non-selfdual, and Λ(U)=(A∩U)↓.
Proof.
Observe that if U∈U is such that A∩U=∅ or U⊆A, then setting Λ={∅} or Λ={ωω} respectively will yield the desired result. Therefore, we can assume without loss of generality that A∩Z and Z∖A are both dense in Z. Notice that, in particular, it follows that Z has no isolated points.
Set A={A∩U:U∈U}, and observe that A has a ≤-minimal element by Theorem 4.7. Let B be such an element of A, and fix U∈U such that B=A∩U. First we will show that B is non-selfdual in Z. Assume, in order to get a contradiction, that B is selfdual in Z. The assumption that A and Z∖A are both dense in Z implies that B∈/Δ10(Z), hence it is possible to apply Theorem 5.4. In particular, we can fix V∈Δ10(Z) such that U∩V=∅ and B∩V<B. Notice that B∩V=Z because B=Z, hence by Lemma 4.8 we can assume without loss of generality that V∈U and V⊆U. This contradicts the minimality of B.
Since B is non-selfdual in Z, we can fix Λ∈NSDΣ(ωω) such that Λ(Z)=B↓. We claim that Λ(U)=B↓. First notice that B∈Λ(U) by Lemma 6.4, and that U is uncountable because Z has no isolated points. Furthermore, using the fact that U⊈A, it is easy to construct a continuous function g:Z⟶U such that g−1[B]=B. Hence, the claim follows from Lemma 20.3.
Finally, we will show that ℓ(Λ)≥1. By Corollary 16.2, it will be enough to show that ℓ(Λ(U))≥1. Assume, in order to get a contradiction, that ℓ(Λ(U))=0. By Lemma 20.5, there exists a non-empty V∈Δ10(U) such that B∩V<B in U, hence in Z. As above, this contradicts the minimality of B.
∎
Lemma 20.5**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space, and let Γ=B↓∈NSDΣ(Z) be such that ℓ(Γ)=0. Then there exists a non-empty V∈Δ10(Z) such that B∩V<B.
Proof.
Notice that PU1(Γ)⊈Γ because ℓ(Γ)=0. By Lemma 4.4 and the fact that PU1(Γ) is continuously closed, it follows that Γ⊆PU1(Γ). Therefore, we can fix Bn∈Γ and pairwise disjoint Vn∈Δ20(Z) for n∈ω such that ⋃n∈ωVn=Z and
[TABLE]
Since Z is a Baire space, we can also fix n∈ω and a non-empty V∈Δ10(Z) such that V⊆Vn.
Observe that Γ={Z} and Γ={∅} because ℓ(Γ)=0, hence it is possible to apply Lemma 4.8. In particular, one sees that V∖B=Bn∩V∈Γ, hence Z∖(B∩V)=(Z∖V)∪(V∖B)∈Γ. In conclusion, we have B∩V∈Γ (again by Lemma 4.8) and Z∖(B∩V)∈Γ. Since Γ is non-selfdual, it follows that B∩V<B.
∎
21. The stretch operation and Radin’s theorem
As part of the proof of our main result (Theorem 22.2), we will need to show that every non-selfdual Wadge class Γ such that ℓ(Γ)=ω1 is the class associated to some Hausdorff operation. The purpose of this section is to give a proof of this fact (see Theorem 21.6).
First, we will deal with the case in which the ambient space is ωω. We will mostly follow the approach of [VW]. More precisely, Definition 21.1 corresponds to [VW, Definitions 5.1.1 and 5.1.2], while Lemma 21.3 is [VW, Lemma 5.1.3]. The novelty here consists in observing that the assumption needed to apply Radin’s Lemma 21.3 (namely, that A≡As) will hold whenever ℓ(A↓)≥2. This is the content of Lemma 21.2.
Set C={S⊆ω:ω∖S is infinite}. Given S∈C, let πS:ω∖S⟶ω denote the unique increasing bijection. Define ϕ:C×ωω⟶ωω by setting
[TABLE]
Definition 21.1** (Radin).**
Given A⊆ωω, define
[TABLE]
We will refer to As as the stretch of A.
Informally, As consists of all reals obtained by picking an element of A, inserting some number (finite or infinite) of zeros, and increasing by 1 every other entry. The fact that this operation can be reversed will be used in the proof of the next lemma. Also notice that A≤As for every A⊆ωω, as witnessed by the function f:ωω⟶ωω defined by setting f(x)(n)=x(n)+1 for x∈ωω and n∈ω.
Lemma 21.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Γ=A↓∈NSDΣ(ωω). Assume that ℓ(Γ)≥2. Then A≡As.
Proof.
We have already observed that A≤As. It remains to show that As≤A.
Set
[TABLE]
Define f:W⟶ωω by “erasing all the zeros, and decreasing by 1 all other entries”. More precisely, given x∈W, set f(x)(n)=x(πS−1(n))−1 for n∈ω, where S={n∈ω:x(n)=0}. Observe that f−1[A]=As. Furthermore, it is easy to realize that f is continuous, hence As=f−1[A]∈Γ(W) by Lemma 6.2.1. By Lemma 6.4, there exists B∈Γ(ωω)=Γ such that B∩W=As. Finally, since W∈Π20(ωω)⊆Δ30(ωω) and ℓ(Γ)≥2, an application of Lemma 15.5 shows that As∈Γ.
∎
Lemma 21.3** (Radin).**
Let Γ=A↓∈NSD(ωω). Assume that A≡As. Then Γ∈Ha(ωω).
Proof.
Given an ambient set Z and a sequence (Us:s∈ω<ω) consisting of subsets of Z, define the operation H by declaring z∈H(Us:s∈ω<ω) if the following conditions are satisfied:
(1)
For all n∈ω there exists a unique s∈ωn such that z∈Us,
2. (2)
There exists x∈A such that z∈Ux↾n for all n∈ω.
After identifying ω<ω with ω, one sees that H is a Hausdorff operation. In fact, it is clear that H=HD, where D={{x↾n:n∈ω}:x∈A}⊆P(ω<ω). We claim that Γ=ΓD(ωω), which will conclude the proof. In particular, Z=ωω from now on.
To see that Γ⊇ΓD(ωω), fix a sequence (Us:s∈ω<ω) consisting of open subsets of ωω. Given x=(x0,x1,…)∈ωω, define f(x)=y=(y0,y1,…)∈ωω recursively as follows. Fix j∈ω, and assume that yi has been defined for all i<j. Set n=∣{i<j:yi=0}∣.
•
If there exists a unique s∈ωn+1 such that N(x0,…,xj)⊆Us, then set yj=s(n)+1.
•
Otherwise, set yj=0.
It is not hard to realize that f:ωω⟶ωω witnesses that H(Us:s∈ω<ω)≤As.
To see that the inclusion Γ⊆ΓD(ωω) holds, pick B≤A, and let f:ωω⟶ωω witness this reduction. Define Us=f−1[Ns] for s∈ω<ω. We claim that B=H(Us:s∈ω<ω). In order to prove the inclusion ⊆, pick z∈B. Condition (\refradinforall) is certainly verified, as {Us:s∈ωn} is a partition of ωω for every n∈ω. Furthermore, it is straightforward to check that x=f(z) witnesses that condition (\refradinexists) holds. In order to prove the inclusion ⊇, pick z∈H(Us:s∈ω<ω). Fix x∈A witnessing that condition (\refradinexists) holds. Assume, in order to get a contradiction, that z∈/B. Observe that f(z)∈/A. On the other hand, z∈Ux↾n for every n∈ω, hence f(z)∈Nx↾n for every n∈ω. This clearly implies that f(z)=x, which contradicts the fact that x∈A.
∎
Theorem 21.4**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Γ∈NSDΣ(ωω) be such that ℓ(Γ)≥2. Then Γ∈HaΣ(ωω).
We conclude this section by generalizing Theorem 21.4 from ωω to an arbitrary zero-dimensional Polish space Z (see Theorem 21.6). The transfer will be accomplished by exploiting once again the machinery of relativization.
Lemma 21.5**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Γ=ΓD(ωω) for some D⊆P(ω), and let Z be a zero-dimensional Polish space. Assume that Γ⊆Σ(ωω). Then Γ(Z)=ΓD(Z).
Proof.
Observe that Γ∈NSDΣ(ωω) by Theorem 10.5. To see that the inclusion ⊆ holds, pick A∈Γ(Z). By condition (\refexistsemb) of Lemma 6.3, there exist an embedding j:Z⟶ωω and B∈Γ such that A=j−1[B]. It follows from Lemma 9.5.1 that A∈ΓD(Z).
To see that the inclusion ⊇ holds, pick A∈ΓD(Z). By [Ke, Theorem 7.8] and Lemma 9.5.2, we can assume without loss of generality that Z is a closed subspace of ωω. By [Ke, Proposition 2.8], we can fix a retraction ρ:ωω⟶Z. Observe that ρ−1[A]∈ΓD(ωω) by Lemma 9.5.1. Since ΓD(ωω)=Γ=Γ(ωω), it follows from Lemma 6.4 that A=ρ−1[A]∩Z∈Γ(Z).
∎
Theorem 21.6**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be a zero-dimensional Polish space. If Γ∈NSDΣ(Z) and ℓ(Γ)≥2 then Γ∈HaΣ(Z).
Proof.
Let Γ(Z)∈NSDΣ(Z), where Γ∈NSDΣ(ωω), and assume that ℓ(Γ(Z))≥2. If Z is countable, then it follows from Proposition 15.4 that Γ(Z)={∅} or Γ(Z)={Z}, which clearly implies the desired result. So assume that Z is uncountable. Notice that ℓ(Γ)≥2 by Corollary 16.2, hence Γ∈HaΣ(ωω) by Theorem 21.4. It follows from Lemma 21.5 that Γ(Z)∈HaΣ(Z).
∎
22. The main result
The following is the main result of this article. It states that every non-selfdual Wadge class can be obtained by starting with all classes of uncountable level, and then suitably iterating the operations of expansion and separated differences. As will become clear from the proof, classes of countable non-zero level are the expansion of some previously considered class, while classes of level zero are the separated differences of some previously considered classes.
At the same time, this yields a more explicit proof of Van Wesep’s Theorem 1.2, in the sense that (aside from classes of uncountable level) it is made clear exactly which operations generate new classes from the old ones. This was first accomplished by Louveau in the Borel case (see [Lo2, Theorem 7.3.12]). The proof of the general case is essentially the same, except that the results from Section 21 are also needed.
The Borel version of following definition is due to Louveau (see [Lo2, Corollary 7.3.11]), which explains our choice of notation.
Definition 22.1**.**
Given a space Z, define Lo(Z) as the smallest collection satisfying the following conditions:
•
Γ∈Lo(Z) whenever Γ∈NSD(Z) and ℓ(Γ)=ω1,
•
Γ(ξ)∈Lo(Z) whenever Γ∈Lo(Z) and ξ<ω1,
•
SDη(Δ,Γ)∈Lo(Z), where Δ=⋃n∈ω(Λn∪Λn), whenever 1≤η<ω1, Γ∈Lo(Z) and Λn∈Lo(Z) for n∈ω are such that Γ⊆Δ and ℓ(Λn)≥1 for each n.
Also set LoΣ(Z)={Γ∈Lo(Z):Γ⊆Σ(Z)} whenever Σ is a topological pointclass.
We remark that, when Σ is a nice topological pointclass, an equivalent definition of LoΣ(Z) can be given by starting with the elements of NSDΣ(Z) of uncountable level, then closing under expansions and separated differences as in Definition 22.1.
Theorem 22.2**.**
Let Σ be a nice topological pointclass, and assume that Det(Σ(ωω)) holds. Let Z be an uncountable zero-dimensional Polish space. Then
[TABLE]
Proof.
The inclusion LoΣ(Z)⊆HaΣ(Z) follows from Theorem 21.6, Corollary 13.10, and Proposition 19.4. The inclusion HaΣ(Z)⊆NSDΣ(Z) is given by Theorem 10.5. Now assume, in order to get a contradiction, that NSDΣ(Z)⊈LoΣ(Z). By Theorem 4.7, we can pick a ⊆-minimal Γ∈NSDΣ(Z)∖LoΣ(Z).
By Corollary 17.2, we can fix ξ≤ω1 such that ξ=ℓ(Γ). Observe that ξ<ω1 by the definition of LoΣ(Z). First assume that ξ≥1. By Theorem 16.1, we can fix Λ∈NSDΣ(Z) such that Λ(ξ)=Γ. Clearly Λ⊆Γ, and Λ=Γ is impossible by Corollary 18.3. Therefore Λ⊊Γ, which implies Λ∈LoΣ(Z) by the minimality of Γ, contradicting the definition of LoΣ(Z). It follows that ξ=0. Since LoΣ(Z)⊆HaΣ(Z) and Γ is minimal, we can apply Theorem 20.1, contradicting again the definition of LoΣ(Z).
∎
List of symbols and terminology
The following is a list of most of the symbols and terminology used in this article, organized by the section in which they are defined.
collection NSD(Z) of all non-selfdual Wadge classes, collection NSDΣ(Z) of the non-selfdual Wadge classes of complexity Σ, retraction, Extended Wadge game EW(D,A0,A1).
Louveau hierarchy Lo(Z), Louveau hierarchy LoΣ(Z) of classes of complexity Σ.
Bibliography30
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[An] A. Andretta. The SLO principle and the Wadge hierarchy. In: Foundations of the Formal Sciences V. Infinite Games , 1–38, Stud. Log. 11 , Coll. Publ., London, 2007.
2[AHN] A. Andretta, G. Hjorth, I. Neeman. Effective cardinals of boldface pointclasses. J. Math. Log. 7:1 (2007), 35–82.
3[AM] A. Andretta, D. A. Martin. Borel-Wadge degrees. Fund. Math. 177:2 (2003), 173–190.
4[CMM] R. Carroy, A. Medini, S. Müller. Every zero-dimensional homogeneous space is strongly homogeneous under determinacy. J. Math. Log. 20:3 (2020), 2050015.
5[v E 1] F. van Engelen. Homogeneous Borel sets. Proc. Am. Math. Soc. 96 (1986), 673–682.
6[v E 2] A. J. M. van Engelen. Homogeneous zero-dimensional absolute Borel sets. CWI Tract, 27. Stichting Mathematisch Centrum, Centrum voor Wiskunde en Informatica, Amsterdam, 1986. iv+133 pp. Available at http://ir.cwi.nl/pub/12724 .
7[v E 3] F. van Engelen. On Borel ideals. Ann. Pure Appl. Logic 70:2 (1994), 177–203.
8[En] R. Engelking. General topology. Revised and completed edition. Sigma Series in Pure Mathematics, vol. 6. Heldermann Verlag, Berlin, 1989.