• Non ci sono risultati.

1Introduction Severalcommentsaboutthecombinatoricsof τ -covers

N/A
N/A
Protected

Academic year: 2021

Condividi "1Introduction Severalcommentsaboutthecombinatoricsof τ -covers"

Copied!
7
0
0

Testo completo

(1)

Several comments about the combinatorics

of τ -covers

Boaz Tsabani

Department of Mathematics, Bar-Ilan University, Ramat-Gan 52900, Israel; and

Department of Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel

http://www.cs.biu.ac.il/~tsaban tsaban@math.biu.ac.il

Received: 03/01/2006; accepted: 03/09/2006.

Abstract. In a previous work with Mildenberger and Shelah, we showed that the combina-torics of the selection hypotheses involving τ -covers is sensitive to the selection operator used. We introduce a natural generalization of Scheepers’ selection operators, and show that:

(1) A slight change in the selection operator, which in classical cases makes no difference, leads to different properties when τ -covers are involved.

(2) One of the newly introduced properties sheds some light on a problem of Scheepers concerning τ -covers.

Improving an earlier result, we also show that no generalized Luzin set satisfies Ufin(Γ, T).

Keywords: combinatorial cardinal characteristics of the continuum, γcover, ωcover, τ -cover, selection principles, Borel covers, open covers

MSC 2000 classification:03E05, 54D20, 54D80

1

Introduction

Topological properties defined by diagonalizations of open or Borel covers have a rich history in various areas of general topology and analysis, and they are closely related to infinite combinatorial notions, see [8, 12, 5, 13] for surveys on the topic and some of its applications and open problems.

Let X be an infinite set. By a cover of X we mean a family U with X 6∈ U and X = ∪ U. A cover U of X is said to be

(1) a large cover of X if: (∀x ∈ X) { U ∈ U : x ∈ U } is infinite. (2) an ω-cover of X if: (∀ finite F ⊆ X)(∃U ∈ U) F ⊆ U .

(3) a τ -cover of X if: U is a large cover of X, and (∀x, y ∈ X) { U ∈ U : x ∈ U and y 6∈ U } is finite, or { U ∈ U : y ∈ U and x 6∈ U } is finite.

(2)

(4) a γ-cover of X if: U is infinite and (∀x ∈ X) { U ∈ U : x 6∈ U } is finite. Let X be an infinite, zero-dimensional, separable metrizable topological space (in other words, a set of reals). Let Ω, T and Γ denote the collections of all open ω-covers, τ -covers and γ-covers of X, respectively. Additionally, denote the collection of all open covers of X by O. Similarly, let CΩ, CT, CΓ, and

C denote the corresponding collections of clopen covers. Our restrictions on X imply that each member of any of the above classes contains a countable member of the same class [11]. We therefore confine attention in the sequel to countable covers, and restrict the above four classes to contain only their countable members. Having this in mind, we let BΩ, BT, BΓ, and B denote the

corresponding collections of countable Borel covers.

Let A and B be any of the mentioned classes of covers (but of the same descriptive type, i.e., both open, or both clopen, or both Borel). Scheepers [7] introduced the following selection hypotheses that X might satisfy:

• S1(A , B): For each sequence hUn: n ∈ Ni of members of A , there exist

members Un∈ Un, n ∈ N, such that { Un: n ∈ N } ∈ B.

• Sfin(A , B): For each sequence hUn: n ∈ Ni of members of A , there exist

finite (possibly empty) subsets Fn⊆ Un, n ∈ N, such thatSn∈NFn∈ B.

• Ufin(A , B): For each sequence hUn: n ∈ Ni of members of A which do

not contain a finite subcover, there exist finite (possibly empty) subsets Fn⊆ Un, n ∈ N, such that { ∪Fn: n ∈ N } ∈ B.

Some of the properties are never satisfied, and many equivalences hold among the meaningful ones. The surviving properties appear in Figure 1, where an arrow denotes implication [10]. It is not known whether any other implication can be added to this diagram – see [6] for a summary of the open problems concerning this diagram.

Below each property P in Figure 1 appears its critical cardinality, non(P ), which is the minimal cardinality of a space X not satisfying that property. The definitions of most of the cardinals appearing in this figure can be found in [2, 1], whereas od is defined in [6], and the results were established in [4, 10, 9, 6].

A striking observation concerning Figure 1 is, that in the top plane of the figures, the critical cardinality of Π(Γ, B) for Π ∈ { S1, Sfin, Ufin} is independent

of Π in all cases except for that where B = T. We demonstrate this anomaly fur-ther in Section 2, where we also give a partial answer to a problem of Scheepers. In Section 3 we show that no Luzin set satisfies Ufin(Γ, T), improving a result

(3)

Ufin(Γ, Γ) b // Ufin(Γ, T) max{ b, s } // Ufin(Γ, Ω) d // Ufin(Γ, O) d Sfin(Γ, T) b // 77 o o o Sfin(Γ, Ω) d 88 p p p S1(Γ, Γ) b 77 o o o o o o o o o o o o o o o //S1(Γ, T)b 88 p p p //S1(Γ, Ω) d 77 o o o //S1(Γ, O) d 88 q q q q q q q q q q q q q Sfin(T, T) min{ s, b } // OO Sfin(T, Ω) d OO S1(T, Γ) t // OO S1(T, T) t OO 88 q q q //S1(T, Ω) od OO 77 p p p p //S1(T, O) od OO Sfin(Ω, T) p OO //Sfin(Ω, Ω) d OO S1(Ω, Γ) p OO //S1(Ω, T)p OO 88 q q q //Scov(M)1(Ω, Ω) OO 88 p p p p //Scov(M)1(O, O) OO

Figure 1. The surviving properties

2

Generalized selection hypotheses

1 Definition. Let κ < λ be any (finite or infinite) cardinal numbers. Denote • S[κ,λ)(A , B): For each sequence hUn: n ∈ Ni of members of A , there exist

subsets Fn⊆ Un with κ ≤ |Fn| < λ for each n ∈ N, andSnFn∈ B.

• U[κ,λ)(A , B): For each sequence hUn: n ∈ Ni of members of A which do

not contain subcovers of size less than λ, there exist subsets Fn⊆ Unwith

κ ≤ |Fn| < λ for each n ∈ N, and { ∪Fn: n ∈ N } ∈ B.

So that S[1,2)(A , B) is S1(A , B), S[0,ℵ0)(A , B) is Sfin(A , B), and

U[0,ℵ0)(A , B) is Ufin(A , B).

2 Definition. Say that a family A ⊆ { 0, 1 }N×N is semi τ -diagonalizable if there exists a partial function g : N → N such that:

(1) For each A ∈ A: (∃∞n ∈ dom(g)) A(n, g(n)) = 1; (2) For each A, B ∈ A:

Either (∀∞n ∈ dom(g)) A(n, g(n)) ≤ B(n, g(n)), or (∀∞n ∈ dom(g)) B(n, g(n)) ≤ A(n, g(n)).

In the following theorem, note that min{ s, b, od } ≥ min{ s, b, cov(M) } = min{ s, add(M) }.

(4)

(1) X satisfies S[0,2)(BT, BT) if, and only if, for each Borel function Ψ : X →

{ 0, 1 }N×N: If Ψ[X] is a τ -family, then it is semi τ -diagonalizable (Defi-nition 2). The corresponding clopen case also holds.

(2) The minimal cardinality of a τ -family that is not semi τ -diagonalizable is at least min{ s, b, od }.

(3) min{ s, b, od } ≤ non(S[0,2)(BT, BT)) = non(S[0,2)(T, T)) =

non(S[0,2)(CT, CT)).

Proof. (1) is proved as usual, (2) is shown in the proof of Theorem 4.15

of [6], and (3) follows from (1) and (2). QED

4 Definition ([9]). For functions f, g, h ∈ NN, and binary relations R, S on

N, define subsets [f R g] and [h R g S f ] of N by:

[f R g] = { n : f (n)Rg(n) }, [f R g S h] = [f R g] ∩ [g S h].

For a subset Y of NN and g ∈ NN, we say that g avoids middles in Y with

respect to hR, Si if:

(1) for each f ∈ Y , the set [f R g] is infinite;

(2) for all f, h ∈ Y at least one of the sets [f R g S h] and [h R g S f ] is finite. Y satisfies the hR, Si-excluded middle property if there exists g ∈ NN which

avoids middles in Y with respect to hR, Si.

In [10] it is proved that Ufin(BΓ, BT) is equivalent to having all Borel images

in NN satisfying the h<, ≤i-excluded middle property (the statement in [10] is

different but equivalent).

5 Theorem. For a set of reals X, the following are equivalent: (1) X satisfies U[1,ℵ0)(BΓ, BT).

(2) Each Borel image of X in NNsatisfies the h≤, <i-excluded middle property.

The corresponding assertion for U[1,ℵ0)(CΓ, CT) holds when “Borel” is replaced

by “continuous”.

Proof. The proof is similar to the one given in [10] for Ufin(BΓ, BT), but is

somewhat simpler.

1 ⇒ 2: Assume that Y ⊆ NN is a Borel image of X. Then Y satisfies

U[1,ℵ0)(BΓ, BT). For each n, the collection Un = { Umn : m ∈ N }, where Umn =

{ f ∈ NN : f (n) ≤ m }, is a clopen γ-cover of NN. By standard arguments

(5)

contains a finite cover. For all n, the sequence { Un

m : m ∈ N } is monotonically

increasing with respect to ⊆, therefore—as large subcovers of τ -covers are also τ -covers—we may use S1(BΓ, BT) instead of U[1,ℵ0)(BΓ, BT) to get a τ -cover

U = { Ψ−1[Un

mn] : n ∈ N } for X. Let g ∈ N

N be such that g(n) = m

n for all n.

Then g avoids middles in Y with respect to h≤, <i.

2 ⇒ 1: Assume that Un = { Umn : m ∈ N }, n ∈ N, are Borel covers of X

which do not contain a finite subcover. Replacing each Un

m with the Borel set

S

k≤mUkn we may assume that the sets Umn are monotonically increasing with

m. Define Ψ : X → NN by: Ψ(x)(n) = min{ m : x ∈ Un

m}. Then Ψ is a Borel

map, and so Ψ[X] satisfies the h≤, <i-excluded middle property. Let g ∈ NN be a witness for that. Then U = { Un

g(n): n ∈ N } is a τ -cover of X.

The proof in the clopen case is similar. QED

6 Corollary. The critical cardinalities of U[1,ℵ0)(BΓ, BT), U[1,ℵ0)(Γ, T), and

U[1,ℵ0)(CΓ, CT), are all equal to b.

Proof. This follows from Theorem 5 and the corresponding combinatorial

assertion, which was proved in [9]. QED

Recall from Figure 1 that the critical cardinality of Ufin(Γ, T) = U[0,ℵ0)(Γ, T)

is max{ s, b }. Contrast this with Corollary 6.

According to Scheepers [12, Problem 9.5], one of the more interesting prob-lems concerning Figure 1 is whether S1(Ω, T) implies Ufin(Γ, Γ). If U[1,ℵ0)(Γ, T) is

preserved under taking finite unions, then we get a positive solution to Scheep-ers’ Problem. (Note that S1(Ω, T) implies S1(Γ, T).)

7 Corollary. If U[1,ℵ0)(Γ, T) is preserved under taking finite unions, then

it is equivalent to Ufin(Γ, Γ) and S1(Γ, T) implies Ufin(Γ, Γ).

Proof. The last assertion of the theorem follows from the first since S1(Γ, T)

implies U[1,ℵ0)(Γ, T).

Assume that X does not satisfy Ufin(Γ, Γ). Then, by Hurewicz’ Theorem [3],

there exists an unbounded continuous image Y of X in NN. For each f ∈ Y , define f0, f1 ∈ NN by fi(2n + i) = f (n) and fi(2n + (1 − i)) = 0. For each

i ∈ { 0, 1 }, Yi = { fi : f ∈ Y } is a continuous image of Y . It is not difficult

to see that Y0∪ Y1 does not satisfy the h≤, <i-excluded middle property [9].

By Theorem 5, Y0 ∪ Y1 does not satisfy U[1,ℵ0)(Γ, T), thus, by the theorem’s

hypothesis, one of the sets Yi does not satisfy that property. Therefore Y (and

therefore X) does not satisfy U[1,ℵ0)(Γ, T) either. QED

We do not know whether U[1,ℵ0)(Γ, T) is preserved under taking finite unions.

We also do not know the situation for Ufin(Γ, T). The following theorem is only

(6)

8 Theorem. If there exists a set of reals X satisfying Ufin(Γ, T) but not

Ufin(Γ, Γ), then Ufin(Γ, T) is not preserved under taking unions of s many

ele-ments.

Proof. The proof is similar to the last one, except that here we define s many continuous images of Y as we did in [9] to prove that the critical cardinality

of Ufin(Γ, T) is max{ s, b }. QED

3

Luzin sets

A set of reals L is a generalized Luzin set if for each meager set M , |L∩M | < |L|. In [10] we constructed (assuming a portion of the Continuum Hypothesis) a generalized Luzin set which satisfies S1(BΩ, BΩ) but not Ufin(Γ, T). We now

show that the last assertion always holds.

9 Theorem. Assume that L ⊆ NN is a generalized Luzin set. Then L does

not satisfy the h<, ≤i-excluded middle property. In particular, L does not satisfy Ufin(CΓ, CT).

Proof. We use the following easy observation.

10 Lemma ([10]). Assume that A is an infinite set of natural numbers, and f ∈ NN. Then the sets

Mf,A = { g ∈ NN: [g ≤ f ] ∩ A is finite }

˜

Mf,A = { g ∈ NN: [f < g] ∩ A is finite }

are meager subsets of NN. QED

Fix any f ∈ NN. We will show that f does not avoid middles in Y with

respect to h<, ≤i. The sets Mf,N = { g ∈ NN : [g ≤ f ] is finite } and ˜Mf,N =

{ g ∈ NN: [f < g] is finite } are meager, thus there exists g

0 ∈ L \ (Mf,N∪ ˜Mf,N).

Now consider the meager sets Mf,[f <g0]= { g ∈ N

N: [g ≤ f < g

0] is finite } and

˜

Mf,[g0≤f ] = { g ∈ N

N : [g

0 ≤ f < g] is finite }, and choose g1 ∈ L \ (Mf,[f <g0]∪

˜

Mf,[g0≤f ]). Then both sets [g0< f ≤ g1] and [g1 < f ≤ g0] are infinite. QED

References

[1] A. R. Blass: Combinatorial cardinal characteristics of the continuum, Handbook of Set Theory, M. Foreman, A. Kanamori, and M. Magidor, eds., Kluwer Academic Publishers, Dordrecht, to appear.

[2] E. K. van Douwen: The integers and topology, Handbook of Set Theoretic Topology, eds. K. Kunen and J. Vaughan, North-Holland, Amsterdam 1984, 111–167.

(7)

[4] W. Just, A. W. Miller, M. Scheepers, P. J. Szeptycki: The combinatorics of open covers II, Topology and its Applications, 73 (1996), 241–266.

[5] Lj. D. R. Koˇcinac: Selected results on selection principles, Proceedings of the 3rd Semi-nar on Geometry and Topology, Sh. Rezapour, ed., July 15–17, Tabriz, Iran 2004, 71–104. [6] H. Mildenberger, S. Shelah, B. Tsaban: The combinatorics of τ -covers, Topology

and its Applications, 154 (2007), 263–276.

[7] M. Scheepers: Combinatorics of open covers I: Ramsey theory, Topology and its Appli-cations, 69 (1996), 31–62.

[8] M. Scheepers: Selection principles and covering properties in topology, Note Mat., 22 (2003), 3–41.

[9] S. Shelah, B. Tsaban: Critical cardinalities and additivity properties of combinatorial notions of smallness, Journal of Applied Analysis, 9 (2003), 149–162.

[10] B. Tsaban: Selection principles and the minimal tower problem, Note Mat., 22 (2003), 53–81.

[11] B. Tsaban: The combinatorics of splittability, Annals of Pure and Applied Logic, 129 (2004), 107–130.

[12] B. Tsaban: Selection principles in Mathematics: A milestone of open problems, Note Mat., 22 (2003), 179–208.

Riferimenti

Documenti correlati

Field (at 300 K and 10 K) and temperature (ZFC–FC protocols) dependences of the magnetization of the sample Ag@Co8 were measured (Fig.  6 ), to study the magnetic properties of

È nella lettera a Emanuele d’Azeglio del 23-30 marzo 1863, commentata da William Spaggiari, che ritroviamo la più chiara e più compiuta illustrazione della sua posizione politica

quale necessario corollario del nuovo principio di ordine pubblico che ha fatto ingresso nell’ordinamen- to italiano nel momento stesso dell’entrata in vigore della legge

2014 , for a compilation of host magnitudes) indicating that a simple way of isolating them in higher redshift searches could be to target transients with either no host detected

For this reason we will show that a Model Selection (MS) procedure is needed in order to select the set of hyperparameters [12] which allow to build a RF model characterised by the

In fact, isolated puri fied nerve terminals prepared from rodent brain regions are helpful models allowing pharmacological characterization of the receptors located on the