HAL Id: hal-00852718
https://hal.archives-ouvertes.fr/hal-00852718
Preprint submitted on 21 Aug 2013
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires
Descriptive complexity of countable unions of Borel rectangles
Dominique Lecomte, Miroslav Zeleny
To cite this version:
Dominique Lecomte, Miroslav Zeleny. Descriptive complexity of countable unions of Borel rectangles.
2013. �hal-00852718�
Descriptive complexity of countable unions of Borel rectangles
Dominique LECOMTE and Miroslav ZELENY1 August 21, 2013
•Universit´e Paris 6, Institut de Math´ematiques de Jussieu, Projet Analyse Fonctionnelle Couloir 16-26, 4`eme ´etage, Case 247, 4, place Jussieu, 75 252 Paris Cedex 05, France
•Universit´e de Picardie, I.U.T. de l’Oise, site de Creil, 13, all´ee de la fa¨ıencerie, 60 107 Creil, France
•1Charles University, Faculty of Mathematics and Physics, Department of Mathematical Analysis Sokolovsk´a 83, 186 75 Prague, Czech Republic
Abstract. We give, for each countable ordinalξ≥1, an example of a∆02 countable union of Borel rectangles that cannot be decomposed into countably manyΠ0ξ rectangles. In fact, we provide a graph of a partial injection with disjoint domain and range, which is a difference of two closed sets, and which has no∆0ξ-measurable countable coloring.
2010 Mathematics Subject Classification.Primary: 03E15, Secondary: 54H05
Keywords and phrases.Borel chromatic number, Borel class, coloring, product, rectangle
Acknowledgements.The results were partly obtained during the second author’s stay at the Universit´e Paris 6 in May 2013. The second author thanks the Universit´e Paris 6 for the hospitality.
The research was supported by the grant GA ˇCR P201/12/0436 for the second author.
1 Introduction
In this paper, we work in products of two Polish spaces. One of our goals is to give an answer to the following simple question. Assume that a countable union of Borel rectangles has low Borel rank. Is there a decomposition of this union into countably many rectangles of low Borel rank? In other words, is there a mapr:ω1\{0} →ω1\{0}such thatΠ0ξ∩(∆11×∆11)σ⊆(Π0r(ξ)×Π0r(ξ))σ for eachξ∈ω1\{0}?
By Theorem 3.6 in [Lo], a Borel set with open vertical sections is of the form(∆11×Σ01)σ. This leads to a similar problem: is there a maps:ω1\ {0} →ω1\ {0} such that, for eachξ∈ω1\ {0}, Π0ξ∩(∆11×Σ01)σ⊆(Π0s(ξ)×Σ01)σ?
The answer to these questions is negative:
Theorem 1.1 Let1≤ξ < ω1. Then there exists a partial mapf:ωω→ωωsuch that the complement
¬Gr(f)of the graph off isΠ02but not(Σ0ξ×∆11)σ.
In fact, we prove a result related to∆0ξ-measurable countable colorings. A study of such colorings is made in [L-Z]. It was motivated by the G0-dichotomy (see Theorem 6.3 in [K-S-T]). More pre- cisely, letB be a Borel binary relation having a Borel countable coloring (i.e., a Borel mapc:X→ω such thatc(x)6=c(y)if(x, y)∈B). Is there a relation between the Borel class ofB and that of the coloring? In other words, is there a mapk:ω1\{0} →ω1\{0}such that anyΠ0ξbinary relation having a Borel countable coloring has in fact a∆0k(ξ)-measurable countable coloring, for eachξ∈ω1\{0}?
Here again, the answer is negative:
Theorem 1.2 Let1 ≤ξ < ω1. Then there exists a partial injection with disjoint domain and range i:ωω→ωω whose graph is the difference of two closed sets, and has no∆0ξ-measurable countable coloring.
These two results are consequences of Theorem 4 in [M´a] and its proof. This latter can also be used positively, to produce examples of graphs of fixed point free partial injections having reasonable chances to characterize the analytic binary relations without∆0ξ-measurable countable coloring. We will see in Section 4 that such a characterization indeed holds whenξ= 3, and give an example much simpler than the one in [L-Z]. In Section 2, we give a proof of Theorem 4 in [M´a], inωωinstead of2ω, and also prove some additional properties needed for the construction of our partial maps. In Section 3, we prove Theorems 1.1 and 1.2. At the end of Section 4, we show that Theorem 1.2 is optimal in terms of descriptive complexity of the graph, and also give a positive result concerning the first two problems in the case of finite unions of rectangles.
2 M´atrai sets
Before proving our version of Theorem 4 in [M´a], we need some notation, definition, and a few basic facts. The maps with closed graph will be of particular interest for us.
Lemma 2.1 Let(Xi)i∈ω,(Yi)i∈ωbe sequences of metrizable spaces, and, for eachi∈ω,fi:Xi→Yi
be a partial map whose graph is a closed subset of Xi×Yi. Then the graph of the partial map f:= Πi∈ωfi: Πi∈ωXi→Πi∈ωYiis closed.
Proof. Let (xj)j∈ω be a sequence of elements of Πi∈ω Xi converging to x := (xi)i∈ω such that f(xj)
j∈ωconverges toy:= (yi)i∈ω∈Πi∈ω Yi. Thenyi=fi(xi), since Gr(fi)is closed, for each i∈ω. This implies thaty=f(x)and the proof is finished.
Notation. LetX be a set and F be a family of subsets of X. Then the symbol hFi denotes the smallest topology onXcontainingF.
The next two lemmas can be found in [K] (see Lemmas 13.2 and 13.3).
Lemma 2.2 Let (X, σ) be a Polish space and F be a σ-closed subset of X. Then the topology σF:=hσ∪ {F}iis Polish andF isσF-clopen.
Lemma 2.3 Let(σn)n∈ωbe a sequence of Polish topologies onX. Then the topologyhS
n∈ω σniis Polish.
Lemma 2.4 Let(Hn)n∈ω be a disjoint family of sets in a zero-dimensional Polish space(X, σ)and (σn)n∈ω be a sequence of topologies onXsuch that
σ0 =σ,H0isσ0-closed,
σn+1=hσn∪ {Hn}i,Hn+1isσn+1-closed for everyn∈ω.
Then the topologyσ∞=hS
n∈ω σnisatisfies the following properties:
(a)σ∞is zero-dimensional Polish, (b)σ∞|X\Sn∈ωHn=σ|X\Sn∈ωHn, and, for everyn∈ω,
(c)σ∞|Hn=σ|Hn, (d)Hnisσ∞-clopen.
Proof.Using Lemma 2.2 we see that each topologyσnis Polish. Then the topologyσ∞is Polish by Lemma 2.3. Now observe that the following claim holds.
Claim.A setG⊆Xisσ∞-open if and only ifGcan be written asG=G′∪(S
n∈ωGn∩Hn), where G′, Gnareσ-open.
Note thatHn∈Σ01(σn+1)⊆Σ01(σ∞)andHn∈Π01(σn)⊆Π01(σ∞), thusHnisσ∞-clopen. Thus (d) is satisfied. LetBbe a basis forσmade ofσ-clopen sets. Then the family
B ∪ {G∩Hn|G∈ B ∧ n∈ω}
is made ofσ∞-clopen sets and form a basis forσ∞by the claim. This gives (a).
LetG∈Σ01(σ∞). By the claim, we findσ-open setsG′, Gnsuch thatG=G′∪(S
n∈ω Gn∩Hn).
ThenG∩(X\S
n∈ω Hn) =G′∩(X\S
n∈ω Hn). This implies (b). Moreover,G∩Hn=Gn∩Hn,
and (c) holds.
Notation.The symbolτ denotes the product topology onωω.
Definition 2.5 We say that a partial mapf:ωω→ωωisniceif Gr(f)is a(τ×τ)-closed subset of ωω×ωω.
The construction ofPξandτξ, and the verification of the properties (1)ξ-(3)ξfrom the next lemma, can be found in [M´a], up to minor modifications.
Lemma 2.6 Let1≤ξ < ω1. Then there arePξ⊆ωω, and a topologyτξonωωsuch that (1)ξτξis zero-dimensional perfect Polish andτ⊆τξ⊆Σ0ξ(τ),
(2)ξPξis a nonemptyτξ-closed nowhere dense set,
(3)ξifS∈Σ0ξ(ωω, τ)isτξ-nonmeager inPξ, thenSisτξ-nonmeager inωω, (4)ξ ifU is a nonempty τξ|P
ξ-open subset ofPξ, then we can find aτξ-denseGδ subsetGofU, and a nice(τξ, τ)-homeomorphismϕξ,GfromGontoωω,
(5)ξifV is a nonemptyτξ-open subset ofωω, then we can find aτξ-denseGδsubsetHofV, and a nice(τξ, τ)-homeomorphismψξ,HfromHontoωω,
(6)ξ if U is a nonemptyτξ|P
ξ-open subset ofPξ and W is a nonempty open subset ofωω, then we can find aτξ-dense Gδ subsetGofU, aτξ-dense Gδ subset K ofW\Pξ, and a nice (τξ, τξ)- homeomorphismϕξ,G,KfromGontoK,
(7)ξ if V, W are nonemptyτξ-open subsets ofωω, then we can find a τξ-dense Gδ subsetH of V\Pξ, aτξ-denseGδsubsetLofW\Pξ, and a nice(τξ, τξ)-homeomorphismψξ,H,LfromHontoL.
Proof.We proceed by induction onξ.
The caseξ= 1
We setP1:={α∈ωω | ∀n∈ω α(2n) = 0}and τ1:=τ. The properties (1)1-(3)1 are clearly satisfied.
(4)1 Note that (P1, τ1) is homeomorphic to (ωω, τ). As any nonempty open subset of (ωω, τ) is homeomorphic to(ωω, τ),(U, τ1)is homeomorphic to(ωω, τ). This givesϕξ,U, which is nice since ωωis closed in itself. This shows that we can takeG:=U.
(5)1As in (4)1we see that(V, τ1)is homeomorphic to(ωω, τ), and we can takeH:=V.
(6)1Note thatU is the disjoint union of a sequence(Cn)n∈ω of nonempty clopen subsets of(P1, τ1).
Let(U1,n)n∈ωbe a partition ofW\P1into clopen subsets of(ωω, τ1). As any nonempty open subset of(P1, τ1)or(ωω, τ1)is homeomorphic to(ωω, τ), we can find homeomorphisms
ϕ0: (C0, τ1)→([
n>0
U1,n, τ1) andϕ1: (S
n>0 Cn, τ1)→(U1,0, τ1). AsC0 andU1,0 areτ-closed,ϕ0 andϕ1 are nice. This shows that the gluing ofϕ0 andϕ1 is a nice homeomorphism from(U, τ1)onto(W\P1, τ1). Thus we can takeG:=U andK:=W\P1.
(7)1As in (6)1 we writeV as the disjoint union of a sequence(Dn)n∈ω of nonempty clopen subsets of(ωω, τ1). As the(Dn, τ1)’s are homeomorphic to(ωω, τ1), we can takeH:=V\P1andL:=W\P1.
The induction step
We assume that1< ξ < ω1 and that the assertion holds for each ordinalθ < ξ. We fix a sequence of ordinals(ξn)n∈ωcontaining each ordinal inξ\{0}infinitely many times. We set
Pξ=ωω×(Πi∈ω¬Pξi), τξ<=τ×(Πi∈ωτξi),
Uξ,n=ωω×(Πi<n¬Pξi)×Pξn×(ωω)ω (n∈ω).
The family{Uξ,n |n∈ω}is disjoint. We setσ0=τξ<andσn+1=hσn∪ {Uξ,n}i. It is easy to check thatUξ,n∈Π01(σn). Applying Lemma 2.4 we get a topologyτξ:=σ∞such that
(a)τξis zero-dimensional Polish, (b)τξ|P
ξ=τξ<
|Pξ, and, for everyn∈ω,
(c)τξ|U
ξ,n=τξ<
|Uξ,n, (d)Uξ,nisτξ-clopen.
We defined the topology τξ on (ωω)ω instead of ωω. However, since the spaces (ωω)ω, τω) and (ωω, τ)are homeomorphic we can replace the latter space by the former one in the proof. Since there is no danger of confusion we will writeτ instead ofτωto simplify the notation.
(1)ξ Clearly,τ⊆τξ. Note thatUξ,n∈Σ0ξ(τ)for everyn∈ω and τξ<⊆Σ0ξ(τ), so that τξ⊆Σ0ξ(τ).
Moreover,(ωω, τξ)is clearly perfect.
(2)ξAsUξ,nisτξ-clopen,Pξisτξ-closed. Note thatτξ|P
ξ=τξ<
|Pξ andPξcontains no nonempty basic τξ<-open set. This implies thatPξisτξ-nowhere dense.
(3)ξ LetS∈Σ0ξ(τ) be τξ-nonmeager inPξ. We may assume that S∈Π0θ(τ)for someθ < ξ. As τξ|P
ξ=τξ<
|Pξ andShas the Baire property with respect to the topologyτξ<there exists aτξ<-open set V such thatSisτξ<-comeager inPξ∩V. Moreover, we may assume thatV has the following form:
V= ˜V×(Πi≤kVi)×(ωω)ω,
whereV˜∈τ,Vi∈τξi andVi⊆ ¬Pξifor eachi≤k. The setV∗= ˜V×(Πi≤kVi)×(Πi>k¬Pξi)isτξ<- comeager inV since¬Pξiisτξi-comeager inωωfor everyi∈ω. AsPξ∩V=V∗,Sisτξ<-comeager inV∗. Letp∈ωbe such thatp > kandξp≥θ. Define
τ∗=τ×(Πi6=pτξi),
Z= ˜V×V0×· · ·×Vk׬Pξk+1×· · ·×¬Pξp−1×(ωω)ω, τ♯=τ×(Πi<pτξi)×τ×(Πi>pτξi).
Forα∈ωωdefine a set(¬S)αby
(¬S)α:={(˜y, y0, y1, . . . , yp−1, yp+1, . . .)∈ωω |(˜y, y0, y1, . . . , yp−1, α, yp+1, . . .)∈ ¬S}.
DenoteS∗:={α∈ωω |(¬S)αisτ∗-nonmeager inZ}. Note that¬S∈Σ0θ(τ)⊆Σ0θ(τ♯). By the Montgomery theorem (see 22.D in [K]),S∗∈Σ0θ(τ)⊆Σ0ξp(τ). By the Kuratowski-Ulam theorem,S∗ isτξp-meager in¬Pξp. Using the induction hypothesis, Condition (3)ξpimplies thatS∗isτξp-meager inPξp. Using the Kuratowski-Ulam theorem again, we see thatSisτξ<-comeager in theτξ-open set
W= ˜V×V0×· · ·×Vk׬Pξk+1×· · ·×¬Pξp−1×Pξp×(ωω)ω. AsW⊆Uξ,p,τξ|W=τξ<
|W by (c), and consequentlySisτξ-comeager inW. ThusSisτξ-nonmeager in(ωω)ωsinceW isτξ-open.
(4)ξWe first construct aτξ-dense open subset ofU, which is the disjoint union of sets of the form Un:= Wn×(Πi<knWin)×(ωω)ω
∩Pξ=Wn×(Πi<knWin\Pξi)×(Πi≥kn ¬Pξi),
whereWnis a nonemptyτ-clopen set andWinis a nonemptyτξi-clopen set. In order to do this, we fix an injectiveτξ-dense sequence (xn)n∈ω ofU, which is possible since(Pξ, τξ) is nonempty and perfect. We first chooseW0 and theWi0’s in such a way thatU0is a properτξ-clopen neighborhood ofx0inU, which is possible sinceτξ|P
ξ=τξ<
|Pξ. For the induction step, we choosepnminimal such thatxpn∈/S
q≤n Uq. Then we choose Wn+1 and theWin+1’s in such a way thatUn+1 is a proper τξ-clopen neighborhood ofxpn inU\(S
q≤n Uq).
There is a nice homeomorphism ψn fromWnontoNn:={α∈ωω | α(0) =n}. The induction assumption gives,
- fori < kn, aτξi-denseGδsubsetGni ofWin\Pξi, and a nice(τξi, τ)-homeomorphismψξi,Gni of Gni ontoωω,
- fori≥kn, aτξi-denseGδsubsetGni of¬Pξi, and a nice(τξi, τ)-homeomorphismψξi,Gni ofGni ontoωω.
By Lemma 2.1, the mapψn×(Πi∈ω ψξi,Gni)is a nice(τξ<, τ)-homeomorphism from Wn×(Πi∈ωGni)
ontoNn×(ωω)ω. If we setG:=S
n∈ω Wn×(Πi∈ωGni)
, then we get a nice(τξ<, τ)-homeomorphism fromGontoωω. We are done sinceτξ|P
ξ=τξ<
|Pξ.
(5)ξWe essentially argue as in (4)ξ. AsPξisτξ-closed nowhere dense, we may assume that V⊆ ¬Pξ=[
n∈ω
Uξ,n.
We first construct aτξ-dense open subset ofV ∩Uξ,n, which is the disjoint union of sets of the form Vn,p:=Wn,p×(Πi<nWin,p\Pξi)×(Wnn,p∩Pξn)×(Πn<i<kpnWin,p)×(ωω)ω, whereWn,pis a nonempty τ-clopen set andWin,pis a nonemptyτξi-clopen set. This is possible sinceτξ|U
ξ,n=τξ<
|Uξ,n. We are done sinceUξ,nisτξ-clopen.
(6)ξ As in (4)ξ we construct aτξ-dense open subset ofU, which is the disjoint union of sets of the formUn:= Wn×(Πi<kn Win)×(ωω)ω
∩Pξ=Wn×(Πi<kn Win\Pξi)×(Πi≥kn¬Pξi), whereWn is a nonemptyτ-clopen set andWinis a nonemptyτξi-clopen set. Recall also that
Uξ,n=ωω×(Πi<n¬Pξi)×Pξn×(ωω)ω.
We also construct aτξ-dense open subset ofW, which is the disjoint union of sets of the form πn:=Zn×(Πi<lnZin\Pξi)×(Zlnn∩Pξln)×(Πln<i<mnZin)×(ωω)ω⊆Uξ,ln,
whereZnis a nonemptyτ-clopen set andZinis a nonemptyτξi-clopen set. Let(W0,p)p∈ω(respec- tively, (Z0,p)p∈ω) be a partition of W0 (respectively, Z0) into nonempty τ-clopen sets. Using the facts thatτξ|P
ξ=τξ<
|Pξ andτξ|U
ξ,n=τξ<
|Uξ,n, we will build
- a nice(τξ, τξ)-homeomorphism from a denseGδsubsetG0,pof U0,p:=W0,p×(Πi<k0 Wi0\Pξi)×(Πi≥k0 ¬Pξi)
onto a denseGδsubsetK0,pofπp+1. Then, using the fact that theW0,p’s areτ-clopen, the gluing of these homeomorphisms will be a nice(τξ, τξ)-homeomorphismϕ0fromG0:=S
p∈ω G0,p⊆U0onto K0:=S
p∈ω K0,p⊆S
p>0 πp.
- a nice homeomorphism from a denseGδsubsetG1,p ofUp+1onto a denseGδ subsetK1,pof Z0,p×(Πi<l0 Zi0\Pξi)×(Zl0
0 ∩Pξl
0)×(Πl0<i<m0 Zi0)×(ωω)ω. Then the gluing of these home- omorphisms will be a nice(τξ, τξ)-homeomorphism ϕ1 from G1 :=S
p∈ω G1,p ⊆S
p>0 Up onto K1:=S
p∈ω K1,p⊆π0.
The gluing of these two homeomorphisms will be a nice homeomorphism fromG:=G0∪G1onto K:=K0∪K1. The setG0,p(respectively,K0,p) will be of the formW0,p×(Πi∈ωGpi)(respectively, Zp+1×(Πi∈ω Kip)). Note first that there is a homeomorphism ψp fromW0,p ontoZp+1. Then we build a permutationi7→ji of the coordinates (with inverseq7→Jq). This permutation is constructed in such a way that ξji =ξi, which will be possible since (ξn)n∈ω contains each ordinal in ξ\ {0}
infinitely many times. If i < mp+1 (respectively, q < k0), then we choose ji ≥k0 (respectively, Jq≥mp+1), ensuring injectivity. For a remaining coordinateq /∈ {0, ..., k0−1} ∪ {jl |l < mp+1}, we chooseJq∈ {0, ..., m/ p+1−1} ∪ {Jl |l < k0}, ensuring that the mapq7→Jq is a bijection from
¬({0, ..., k0−1} ∪ {jl | l < mp+1}) onto¬ {0, ..., mp+1−1} ∪ {Jl | l < k0}
. Then, using the induction assumption, we build our homeomorphism coordinate by coordinate, which means thatGpji will be homeomorphic toKip. The induction assumption gives
- fori < lp+1, aτξji-denseGδsubsetGpji of¬Pξji, aτξi-denseGδsubsetKip ofZip+1\Pξi, and a nice(τξi, τξi)-homeomorphismψξi,Gp
ji,KipfromGpjiontoKip. - aτξ
jlp+1-dense Gδ subsetGpj
lp+1 of¬Pξ
jlp+1, a τξlp+1-denseGδ subsetKlpp+1 ofPξlp+1, and a nice(τξlp+1, τξlp+1)-homeomorphismϕ−1ξ
lp+1,Klp+1p ,Gp
jlp+1 fromGpj
lp+1 ontoKlpp+1.
- forlp+1< i < mp+1, aτξji-denseGδsubsetGpjiof¬Pξji, aτξi-denseGδsubsetKipofZip+1\Pξi, and a nice(τξi, τξi)-homeomorphismψξi,Gp
ji,KipfromGpji ontoKip.
- forq < k0, aτξq-denseGδsubsetGpqofWq0\Pξq, aτξJq-dense Gδ subsetKJpq of¬PξJq, and a nice(τξq, τξq)-homeomorphismψξq,Gpq,Kp
Jq fromGpqontoKJpq.
- for a remaining coordinate q /∈ {0, ..., k0−1} ∪ {jl | l < mp+1}, aτξq-dense GδsubsetGpq of
¬Pξq, aτξJq-dense Gδ subsetKJp
q of¬PξJq, and a nice (τξq, τξq)-homeomorphismψξq,Gpq,Kp
Jq from GpqontoKJpq.
By Lemma 2.1, the product ϕ0p of ψp with these nice homeomorphisms is a nice (τξ<, τξ<)- homeomorphism from G0,p := W0,p×(Πi∈ω Gpi) onto K0,p := Zp+1×(Πi∈ω Kip), as well as a (τξ, τξ)-homeomorphism since τξ|P
ξ =τξ<
|Pξ and τξ|U
ξ,lp+1 =τξ<
|Uξ,lp+1. AsG0 is the sum of the G0,p’s,Gis aτξ-denseGδ subset ofU0. Similarly, K0is aτξ-denseGδsubset ofS
p>0 πp. More- over, the gluingϕ0of theϕ0p’s is a(τξ, τξ)-homeomorphism fromG0ontoK0.
The construction ofϕ1is similar.
(7)ξWe argue as in (6)ξ.
Lemma 2.7 Let1≤ξ < ω1. Then there are disjoint familiesFξ,Gξof subsets ofωωand a topology Tξonωω such that
(a)ξTξis zero-dimensional perfect Polish andτ⊆Tξ⊆Σ0ξ(τ),
(b)ξFξisTξ-dense, i.e., for any nonemptyTξ-open setV, there isF∈ FξwithF⊆V, and, for everyF∈ Fξ,
(c)ξF is nonempty,Tξ-nowhere dense, and inΠ02(Tξ),
(d)ξifS∈Σ0ξ(τ)isTξ-nonmeager inF, thenSisTξ-nonmeager inωω, (e)ξthere is a nice(Tξ, τ)-homeomorphismϕF fromF ontoωω,
(f)ξ for any nonemptyTξ-open setsV, V′, there are disjointG, G′∈ Gξ withG⊆V,G′⊆V′, and there is a nice(Tξ, Tξ)-homeomorphismϕG,G′ fromGontoG′,
and, for everyG∈ Gξ,
(g)ξGis nonempty,Tξ-nowhere dense, and inΠ02(Tξ),
(h)ξifS∈Σ0ξ(τ)isTξ-nonmeager inG, thenSisTξ-nonmeager inωω.
Proof.LetPξandτξbe as in Lemma 2.6. We setTξ= (τξ)ω. Let(Un)n∈ωbe a basis for the topology Tξmade of nonempty sets. For eachn∈ω, there is a finite sequence(Vin)i<knof nonemptyτξ-open sets such that(Πi<kn Vin)×(ωω)ω⊆Un. Moreover, the sequence(kn)n∈ω is chosen to be strictly increasing. Lemma 2.6 provides
- fori < kn, aτξ-denseGδsubsetHinofVin\Pξand a nice(τξ, τ)-homeomorphismψξ,Hin, - aτξ-denseGδsubsetGnkn ofPξand a nice(τξ, τ)-homeomorphismϕξ,Gn
kn,
- fori > kn, aτξ-denseGδsubsetHinofωωand a nice(τξ, τ)-homeomorphismψξ,Hin.
We then putFn:= (Πi<kn Hin)×Gnkn×(Πi>kn Hin), so thatFn⊆Un. We setFξ={Fn|n∈ω}.
ThenFξis clearly a disjoint family and the properties (a)ξand (b)ξare obviously satisfied.
(c)ξAsPξisτξ-nowhere dense, eachFnisTξ-nowhere dense. EachFnis obviously also inΠ02(Tξ).
(d)ξLetn∈ωandS∈Σ0ξ(τ)beTξ-nonmeager inFn. We define Z= Πi6=kn Hin,
Tξ∗= Πi6=knτξ|Hn i , T˜ξ= (Πi<knτξ|Hn
i )×τ×(Πi>kn τξ|Hn i).
Ifα∈ωω, then we denote
Sα:={(y0, . . . , ykn−1, ykn+1, . . .)∈ωω|(y0, . . . , ykn−1, α, ykn+1, . . .)∈S}.
We set S∗ ={α ∈ωω | SαisTξ∗-nonmeager}. By the Montgomery theorem, S∗ ∈Σ0ξ(τ) since S ∈Σ0ξ( ˜Tξ). The set S∗ is τξ-nonmeager in Gnkn by the Kuratowski-Ulam theorem, in Pξ also, and thus S∗ isτξ-nonmeager in ωω. Using the Kuratowski-Ulam theorem again, we see thatS is Tξ-nonmeager in(Πi<knHin)×ωω×(Πi>kn Hin), and thus in(ωω)ω.
(e)ξWe setϕF= (Πi<kn ψξ,Hni)×ϕξ,Gnkn×(Πi>kn ψξ,Hni). The mapϕF is clearly a(Tξ, τ)-homeo- morphism fromF onto(ωω)ω. It is nice by Lemma 2.1.
We now construct Gξ. For each m ∈ ω, there are finite sequences (Vim)i<km, (Wim)i<lm of nonemptyτξ-open sets such that(Πi<km Vim)×(ωω)ω⊆U(m)0 and(Πi<lmWim)×(ωω)ω⊆U(m)1. Moreover, the sequences (km)m∈ω and (lm)m∈ω are chosen to be strictly increasing and disjoint.
Assume for example thatkm< lm. Lemma 2.6 provides
- fori < km, aτξ-dense Gδ subsetHim ofVim\Pξ, aτξ-dense GδsubsetLmi ofWim\Pξ, and a nice(τξ, τξ)-homeomorphismψξ,Him,Lmi ,
- aτξ-dense Gδ subsetGmkm ofPξ, aτξ-dense Gδ subsetKkmm ofWim\Pξ, and a nice (τξ, τξ)- homeomorphismϕξ,Gm
km,Kmkm,
- forkm< i < lm, aτξ-denseGδsubsetHim of¬Pξ, aτξ-denseGδ subsetLmi ofWim\Pξ, and a nice(τξ, τξ)-homeomorphismψξ,Him,Lmi ,
- a τξ-dense Gδ subset Klmm of ¬Pξ, a τξ-dense Gδ subset Gmlm of Pξ, and a nice (τξ, τξ)- homeomorphismϕ−1ξ,Gm
lm,Klmm,
- for i > lm, a τξ-dense Gδ subsetHim of¬Pξ, aτξ-dense Gδ subsetLmi of ¬Pξ, and a nice (τξ, τξ)-homeomorphismψξ,Hm
i ,Lmi . We then put
Fm′ := (Πi<km Him)×Gmkm×(Πkm<i<lnHim)×Klmm×(Πi>lm Him), Gm:= (Πi<kmLmi )×Kkmm×(Πkm<i<lm Lmi )×Gmlm×(Πi>lmLmi ),
so thatFm′ ×Gm⊆U(m)0×U(m)1. We setGξ={Fm′ |m∈ω} ∪ {Gm |m∈ω}. ThenGξis clearly a disjoint family.
(f)ξThe mapϕFm′ ,Gmis by definition (Πi<km ψξ,Hm
i ,Lmi )×ϕξ,Gmkm,Kkmm ×(Πkm<i<lmψξ,Hm
i ,Lmi )×ϕ−1ξ,Gm
lm,Klmm ×(Πi>lmψξ,Hm
i ,Lmi ).
Note thatϕFm′ ,Gmis clearly a(Tξ, Tξ)-homeomorphism fromFm′ ontoGm. It is nice by Lemma 2.1.
(g)ξWe argue as in (c)ξ.
(h)ξWe argue as in (d)ξ.
3 Negative results
Proof of Theorem 1.1.We apply Lemma 2.7 to the ordinalξ+1, which gives a familyFξ+1 and a topologyTξ+1satisfying (a)ξ+1-(e)ξ+1. Let(Un×Vn)n∈ω be a sequence of nonempty sets such that
-Un∈Tξ+1,Vnisτ-clopen,
-{Un×Vn|n∈ω}is a basis for the topologyTξ+1×τ.
For eachn∈ωwe findFn∈ Fξ+1\{Fq |q < n}withFn⊆Un. By the property (e)ξ+1ofFξ+1we find, for eachn∈ω, a nice(Tξ+1, τ)-homeomorphismfnfromFnontoVn. We definef:S
n∈ω Fn→ωω byf(x) :=fn(x)ifx∈Fn. AsFξ+1is a disjoint family,fis well-defined. The graph offisΣ02(τ×τ) since each Gr(fn)is(τ×τ)-closed.
Suppose, towards a contradiction, that there exist, forn∈ω,Cn∈Σ0ξ(τ)andDn∈∆11(τ)such that¬Gr(f) =S
n∈ω Cn×Dn. By the Baire category theorem there isn0∈ωsuch thatCn0 isTξ+1- nonmeager andDn0 isτ-nonmeager. AsCn0 has the Baire property, we find a nonemptyTξ+1-open setO1 such thatCn0 isTξ+1-comeager inO1. Similarly, we find aτ-open set O2 such that Dn0 is τ-comeager inO2.
Letn∈ω andFn⊆O1. Suppose thatCn0 is notTξ+1-comeager inFn. ThenO1\Cn0 isTξ+1- nonmeager inFn. Note thatO1∈Σ0ξ+1(τ) andCn0∈Σ0ξ(τ). ThereforeO1\Cn0∈Σ0ξ+1(τ). Thus O1\Cn0 isTξ+1-nonmeager inωω by (d)ξ+1. Consequently, O1\Cn0 isTξ+1-nonmeager inO1, a contradiction. ThusCn0 isTξ+1-comeager inFnfor anyn∈ωwithFn⊆O1.
Findn∈ωsuch that Gr(fn)⊆O1×O2. ThenCn0 isTξ+1-comeager inFnandDn0isτ-comeager inVn. Asfnis a homeomorphism,fn−1(Vn∩Dn0)isTξ+1-comeager inFn. AsFn∈Π02(Tξ+1)there existsα∈fn−1(Vn∩Dn0)∩Fn∩Cn0. This implies that α, fn(α)
∈Cn0×Dn0, a contradiction.
Proof of Theorem 1.2. Apply Lemma 2.7 to the ordinal ξ + 1, which gives a family Gξ+1 and a topologyTξ+1 satisfying (a)ξ+1-(h)ξ+1. LetU={Un | n∈ω}be a basis for the space (ωω, Tξ+1) made of nonempty sets. For eachn∈ωwe findTξ+1-open setsVn,Wnsuch that
Vn×Wn⊆Bτ×τ ∆(ωω),2−n
∩(Un×Un)\∆(ωω) (we use the standard metric on(ωω, τ)).
By the properties (f)ξ+1 and (g)ξ+1 ofGξ+1 we find, for eachn∈ω, setsFn andHnfromGξ+1 such that
(∗) Fn⊆Vn\([
j<n
Fj∪Hj) ∧ Hn⊆Wn\ Fn∪([
j<n
Fj ∪Hj) .
Moreover, there is a nice(Tξ+1, Tξ+1)-homeomorphismfnfromFnontoHn. We set G=[
{Gr(fn)|n∈ω}.
Now we check the desired properties.
Asτ⊆Tξ+1,Gτ×τ=G ∪∆(ωω), by construction. ThusGis a difference of two(τ×τ)-closed sets.
As eachfn is a homeomorphism, the property(∗)implies thatf is a partial injection with disjoint domain and range. In order to see thatGhas no∆0ξ-measurable countable coloring, we proceed by contradiction. Suppose that there areG-discrete setsCn∈∆0ξ(τ)(a setCisG-discreteifC2∩ G=∅), forn∈ω, such that ∆(ωω)⊆S
n∈ω Cn2. By the Baire theorem there existsn0∈ω such that Cn0 isTξ+1-nonmeager. AsCn0 has the Baire property, we find a nonempty Tξ+1-open set Osuch that Cn0 ∩OisTξ+1-comeager inO.
Let F ∈ Gξ+1 with F ⊆O. Suppose that Cn0 is not Tξ+1-comeager in F. Then O\Cn0 is Tξ+1-nonmeager in F. Note thatO∈Σ0ξ+1(τ) and Cn0 ∈∆0ξ(τ). Therefore O\Cn0 ∈Σ0ξ+1(τ).
ThusO\Cn0 isTξ+1-nonmeager inωωby (h)ξ+1. Consequently,O\Cn0 isTξ+1-nonmeager inO, a contradiction. ThusCn0 isTξ+1-comeager inF for anyF∈ Gξ+1withF⊆O.
Find n∈ω such that Gr(fn)⊆O2. ThenCn0 isTξ+1-comeager in Fn and inHn. As fnis a homeomorphism,fn−1(Hn∩Cn0)isTξ+1-comeager inFn∈Π02(Tξ+1). Thus there exists
α∈fn−1(Hn∩Cn0)∩Fn∩Cn0. This implies that α, fn(α)
∈Cn20, a contradiction.
4 Positive results
(A)∆0ξ-measurable countable colorings In [L-Z], the following conjecture is made.
ConjectureLet1≤ξ < ω1. Then there are - a0-dimensional Polish spaceXξ, - an analytic relationAξonXξ
such that for any (0-dimensional if ξ= 1) Polish space X, and for any analytic relation A on X, exactly one of the following holds:
(a) there is a∆0ξ-measurable countable coloring ofA(i.e., a∆0ξ-measurable mapc:X→ωsuch thatA⊆(c×c)−1(6=)),
(b) there is a continuous mapf:Xξ→Xsuch thatAξ⊆(f×f)−1(A).