The higher Cichoń diagram in the degenerate case
Jörg Brendle
Graduate School of System Informatics
Kobe University
Rokko-dai 1-1, Nada-ku
Kobe 657-8501, Japan
email: [email protected]
Partially supported by Grants-in-Aid for Scientific Research
(C) 15K04977 and 18K03398, Japan Society for the Promotion of Science.
2020 Mathematics Subject Classification. Primary 03E05; Secondary 03E17, 03E35
Keywords. higher cardinal invariants, higher meager ideal, unbounding number, dominating number, forcing
Abstract
For a regular uncountable cardinal κ, we discuss the order relationship between the
unbounding and dominating numbers bκ and dκ on κ and
cardinal invariants of the higher meager ideal Mκ. In particular, we obtain an almost complete
characterization of add(Mκ) and cof(Mκ) in terms of cov(Mκ) and
non(Mκ) and unbounding and dominating numbers, and we provide models showing
that there are no restrictions on the value of non(Mκ) in the degenerate case 2<κ>κ
except 2<κ≤non(Mκ)≤2κ. The corresponding question for
cof(Mκ) remains open. Our results answer questions of joint work of the author with
Brooke-Taylor, Friedman, and Montoya [BBFM, Questions 29 and 32].
1 Introduction
Cardinal invariants of the continuum, describing the combinatorial properties of the real numbers (2ω or ωω) and taking
values between ω1 and the continuum c, have been studied intensively for several decades, and a rich theory with ZFC-results
and independence proofs about the order relationship between various cardinal invariants has evolved (see [BJ] and [Bl]).
More recently, higher cardinal invariants, that is, cardinal invariants of the higher Cantor space 2κ or the higher Baire
space κκ, where κ is an uncountable regular cardinal, have started to be investigated and our work is
a contribution to this ongoing research.
Our focus lies on cardinal invariants in the higher Cichoń diagram (see [BBFM] and [BGS]). The original
Cichoń diagram [BJ] describes the relationship between cardinal invariants related to measure and category as well
as the unbounding and dominating numbers b and d. The latter can be easily redefined in the context of regular
uncountable κ, by
bκ=min{∣F∣:F⊆κκ and ∀g∈κκ∃f∈F(f≤∗g)},
the
κ-unbounding number, and
dκ=min{∣F∣:F⊆κκ and ∀g∈κκ∃f∈F(g≤∗f)},
the
κ-dominating number,
where f≤∗g if there is α<κ such that f(β)≤g(β) for all β≥α. Clearly bκ≤dκ.
Also, there is a natural analog of the meager ideal on the higher Cantor space 2κ: give 2 the discrete topology and equip
2κ with the κ-box topology. That is, basic clopen sets are of the form
[TABLE]
where σ∈2<κ, and open sets are arbitrary unions of such basic clopen sets. Thus a set A⊆2<κ
is nowhere dense in this topology if for all σ∈2<κ there is τ⊇σ such that [τ]∩A=∅. This implies that the nowhere dense ideal on 2κ, denoted by NWDκ, is <κ-closed
(i.e. closed under unions of size <κ). Say that A⊆2κ is κ-meager if it is a union of at most
κ many nowhere dense sets, and let Mκ denote the (κ-closed) ideal of κ-meager sets.
It is much less clear how the null ideal should be generalized to regular uncountable κ; a very interesting candidate has been
proposed (for weakly compact κ) by Baumhauer, Goldstern, and Shelah in [BGS]. We shall not pursue this here.
Let I be a non-trivial ideal on a set X, that is, all the singletons {x}, x∈X, belong to I and X∈/I. Define
add(I)=min{∣F∣:F⊆I and ⋃F∈/I}, the additivity of I,
cov(I)=min{∣F∣:F⊆I and ⋃F=X}, the covering number of I,
non(I)=min{∣Y∣:Y⊆X and Y∈/I}, the uniformity of I, and
cof(I)=min{∣F∣:F⊆I and ∀A∈I∃B∈F(A⊆B)},
the cofinality of I.
Easily add(I)≤cov(I),non(I)≤cof(I). In our earlier work [BBFM] we observed that
bκ≤non(Mκ) and cov(Mκ)≤dκ [BBFM, Observation 17], and proved:
add(Mκ)≤bκ and dκ≤cof(Mκ) for strongly inaccessible κ [BBFM, Corollary 28],
add(Mκ)≥min{bκ,cov(Mκ)} [BBFM, Corollary 31], and
cof(Mκ)≤max{dκ,non(Mκ)} in case 2<κ=κ [BBFM, Corollary 31].
In particular, add(Mκ)=min{bκ,cov(Mκ)} and cof(Mκ)=max{dκ,non(Mκ)}
for strongly inaccessible κ, and the cardinals can be displayed in the following diagram.
We asked whether the assumptions were necessary in (i) and (iii) above [BBFM, Questions 29 and 32], and these
questions are the starting point of the present work.
Note that in the degenerate case 2<κ>κ, some of the cardinal invariants become trivial. Namely Landver [La, 1.3]
(see also [BBFM, Observation 23(ii)]) observed that add(Mκ)=cov(Mκ)=κ+ and this accounts for (ii)
above in case 2<κ>κ. Blass, Hyttinen, and Zhang [BHZ, 4.15] (see also [BBFM, Observation 23(iii)]) noticed
that 2<κ≤non(Mκ). Finally, we proved [Br, Proposition 2 (c)] that 2<κ<cof(Mκ) and this
implies that cof(Mκ)>max{dκ,non(Mκ)} in any model of 2<κ=2κ; in particular, (iii) may
fail in the degenerate case. We will obtain better lower bounds for cof(Mκ) (see in particular Corollary 2). The results about
add(Mκ) and cov(Mκ) in the degenerate case suggest the problem of whether one can say more about non(Mκ) and
cof(Mκ) in this situation. We shall see this is not the case for non(Mκ) (see in particular Theorems 7
and 8), while for cof(Mκ) some interesting questions remain open.
This paper is organized as follows. In Section 2, we obtain several ZFC-results about higher cardinal invariants which strengthen
those of [BBFM]; in particular we will compute add(Mκ) and cof(Mκ) in terms of the other cardinals in most cases
(Corollary 3). In Section 3, we present independence results for the values of non(Mκ) and
cof(Mκ) in the degenerate context. Section 4 investigates dominating numbers naturally arising in the
discussion of cof(Mκ).
Preliminaries. Let κ be regular and λ≥κ. For f,g∈κλ say that g eventually dominates f (f≤∗g
in symbols) if the set {γ<λ:f(γ)>g(γ)} has size less than κ. Let bκλ and
dκλ be the unbounding and dominating numbers of (κλ,≤∗), respectively111As
we will see in Proposition 12 in Section 4, it does not really matter whether we use domination everywhere,
modulo <κ or modulo <λ for our results; however, for the proofs in Section 2 the present definition is
most convenient.. That is,
bκλ=min{∣F∣:F⊆κλ and ∀g∈κλ∃f∈F(f≤∗g)}
dκλ=min{∣F∣:F⊆κλ and ∀g∈κλ∃f∈F(g≤∗f)}
For κ=λ we have bκλ=bκ and dκλ=dκ.
In general dκλ≥dκμ≥dκ where κ≤μ≤λ.
If λ>κ then bκλ=κ, as witnessed by the constant functions.
2 ZFC results
For this whole section, let κ be regular uncountable and let λ=∣2<κ∣.
Theorem 1**.**
There are functions Φ−:κλ→NWDκ and Φ+:Mκ→[κλ]λ such that if A∈Mκ,
g∈κλ, and g is not eventually bounded by
Φ+(A), then Φ−(g)⊆A.
Proof.
Let Σ={σ~}∪{σγ:γ<λ}⊆2<κ be a maximal antichain
in 2<κ.
Fix g∈κλ. We recursively define a nowhere dense tree Tg⊆2<κ.
More explicitly, we define sets Cgα⊆2<κ for α<κ such that
Cgα is an antichain in 2<κ,
if α<β and τ∈Cgβ then there is (necessarily unique) σ∈Cgα such that σ⊊τ,
if α<β and σ∈Cgα then there is τ∈Cgβ such that σ⊊τ,
for each σ∈Cgα there is τ⊋σ incompatible with all members of Cgα+1.
Then let Tg be the downward closure of ⋃α<κCgα, i.e., σ∈Tg if
σ⊆τ for some τ∈Cgα and some α.
Clearly Tg is a nowhere dense tree, and we let Φ−(g)=[Tg].
Let Cg0={⟨⟩}.
Assume Cgα has been defined and let σ∈Cgα. Assume lh(σ)=ζ.
Then τ⊋σ belongs to Cgα+1 if for some γ<λ,
σ^σγ⊆τ and lh(τ)=ζ+lh(σγ)+g(γ).
Note that this implies that τ=σ^σ~ is incompatible with all of Cgα+1.
If α is a limit ordinal, put σ into Cgα if there is a strictly increasing
sequence (τβ:β<α) such that σ=⋃β<ατβ and each
τβ belongs to Cgβ. This completes the construction of the Cgα and of Tg.
Next fix A∈Mκ, A=⋃α<κAα, where the Aα form an increasing
sequence of nowhere dense sets. Define h=hA:2<κ→2<κ such that
for all α<κ and all σ∈2α, σ⊆h(σ) and [h(σ)]∩Aα=∅.
Fix σ∈2<κ. Say lh(σ)=ζ. Define fσA∈κλ such that
lh(h(σ^σγ))=ζ+lh(σγ)+fσA(γ) for all γ<λ.
Let Φ+(A)={fσA:σ∈2<κ}.
Now assume g is not eventually bounded by Φ+(A). We need to show Φ−(g)⊆A. To this end
we recursively construct an increasing sequence (τα:α<κ) such that τα∈Cgα
and [τα+1]∩Aα=∅ for all α<κ. Letting x=⋃τα,
we see x∈Φ−(g)∖A.
Let τ0=⟨⟩.
Assume τα has been defined as required. Since g is not eventually bounded by fταA, there is
γ<λ such that fταA(γ)<g(γ). Thus we can find τα+1∈Cgα+1 such that h(τα^σγ)⊊τα+1.
[τα+1]∩Aα=∅ follows because [h(τα^σγ)]∩Alh(τα^σγ)=∅, [τα+1]⊆[h(τα^σγ)], and
lh(τα^σγ)>lh(τα)≥α
and thus Aα⊆Alh(τα^σγ).
If α is a limit ordinal, simply let τα=⋃β<ατβ.
∎
Corollary 2**.**
-
add(Mκ)≤bκ* and cof(Mκ)≥dκλ.*
2. 2.
In particular, cof(Mκ)≥dκ.
Proof.
(2) follows from (1) and dκλ≥dκ. Also, if 2<κ>κ,
then add(Mκ)=κ+≤bκ, so the first inequality of (1) holds trivially.
To see the first inequality of (1) in case 2<κ=κ, let F⊆κκ be an unbounded family. If A∈Mκ, there
is g∈F not eventually bounded by Φ+(A) because ∣Φ+(A)∣=κ and thus Φ+(A) is bounded.
So Φ−(g)⊆A. Thus we see that the union of the Φ−(g), g∈F, does not belong to Mκ,
and add(Mκ)≤bκ follows.
For the second inequality of (1), let A⊆Mκ, and assume ∣A∣<dκλ. Let F=⋃{Φ+(A):A∈A}.
Since ∣Φ+(A)∣≤λ for all A and dκλ>λ, we also have ∣F∣<dκλ.
Hence there is g∈κλ, which is not eventually bounded by F. But then Φ−(g)⊆A
for all A∈A, and A is not cofinal in Mκ. Thus cof(Mκ)≥dκλ follows.
∎
Corollary 3**.**
-
add(Mκ)=min{bκ,cov(Mκ)}* and cof(Mκ)≥max{dκλ,non(Mκ)}222An earlier
version of this paper claimed equality here, but the proof was flawed..*
2. 2.
If 2<κ=κ, then cof(Mκ)=max{dκ,non(Mκ)}.
Proof.
Since add(Mκ)≤cov(Mκ) is trivial and add(Mκ)≤bκ holds
by Corollary 2 (1), the first part of (1) follows from [BBFM, Corollary 31] (see also item (ii) in the Introduction).
Similarly, the second part of (2) is immediate by Corollary 2 (1) and the obvious cof(Mκ)≥non(Mκ).
For (2), use (1) and [BBFM, Corollary 31] (see also item (iii) in the Introduction).
∎
Assume additionally λ is regular. With an argument similar to the proof of Theorem 1 we obtain:
Proposition 4**.**
There are functions Φ−:λλ→NWDκ and Φ+:Mκ→λλ such that if A∈Mκ, g∈λλ, and g is not eventually bounded by
Φ+(A), then Φ−(g)⊆A.
Proof.
Let Σ be as in the proof of Theorem 1. Also let T={τδ:δ<λ}=2<κ.
Assume this enumeration satisfies additionally
σ^0=τδ implies σ^1=τδ+1,
τδ⊂τϵ implies δ<ϵ.
Given g∈λλ, we define Cgα⊆2<κ, Tg⊆2<κ, and Φ−(g)=[Tg]
as in this proof, except for the successor step where for given σ∈Cgα, we first let τ∈Dgα+1 if for some
γ<λ, τ=σ^σγ^τδ for δ<g(γ) and then
define Cgα+1 as the set of all τ such that
either τ∈Dgα+1 and no proper extension of τ belongs to Dgα+1
or ζ:=lh(τ) is a limit ordinal, for all ξ<ζ with ξ≥lh(σ), τ↾ξ∈Dgα+1
and τ∈/Dgα+1.
It is then easy to see that Cgα+1 is an antichain with the required properties. Note in particular that
for all τ∈Dgα+1 there is τ′⊇τ with τ′∈Cgα+1.
(For suppose this fails for some τ. Assume τ′⊇τ with τ′∈Dgα+1. Then
τ′ is not a maximal node in Dgα+1 and therefore τ′^0∈Dgα+1. Since the latter is
not maximal either, also τ′^1∈Dgα+1. Similarly if τ′⊇τ and lh(τ′) is a limit such that
τ′↾ξ∈Dgα+1 for all ξ with lh(τ)≤ξ<lh(τ′) then τ′∈Dgα+1,
for otherwise it would belong Cgα+1. This means that the full binary tree below τ belongs to Dgα+1,
a contradiction.)
Given A=⋃α<κAα∈Mκ as in the proof of Theorem 1, α<κ, and σ∈2α, define
fσA∈λλ such that [σ^σγ^τfσA(γ)]∩Aα=∅. Let
Φ+(A) eventually dominate all fσA.
If g is not eventually bounded by Φ+(A), we construct an increasing sequence (τα:α<κ) in 2<κ with τα∈Cgα
and [τα+1]∩Aα=∅ as in the proof of Theorem 1.
∎
As a consequence we immediately get (though this will follow from Corollary 2 if Question 14 has a positive answer):
Corollary 5**.**
cof(Mκ)≥dλ.
A family F⊆λλ of functions is called almost disjoint if given any distinct f,g∈F, the set {γ<λ:f(γ)=g(γ)}
has size less than λ.
Yet another modification of the proof of Theorem 1 gives us an absolute result under certain assumptions.
Theorem 6**.**
Assume λ=∣2<κ∣≥κ++. Let F⊆λλ be an almost disjoint family of functions. Then there is A⊆NWDκ
of size ∣F∣ such that for all B∈Mκ, the set {A∈A:A⊆B} has size at most κ. In particular, if there is an almost disjoint family of functions
of size 2λ, then cof(Mκ)=2λ.
Proof.
Let Σ={σγ:γ<λ}⊆2<κ be a maximal antichain in 2<κ.
By κ<2<κ, it is easy to see that we may additionally assume that Σ forms a front, that is,
for each x∈2κ there is a (necessarily unique) σ∈Σ with σ⊆x333This may be false
if κ=2<κ. For example, if κ is weakly compact, it is easy to see there is no front of size κ. This was pointed out
to us by Tristan van der Vlugt..
Recursively define fronts Cα, α<κ, such that
C0={⟨⟩},
Cα+1={σ^σγ:σ∈Cα and γ<λ}, and
Cα={σ∈2<κ:∃(τβ:β<α) strictly increasing such that σ=⋃β<ατβ and
τβ∈Cβ} for limit ordinals α.
Construe f∈F as a function from 2<κ to λ. Define a nowhere dense tree Tf⊆2<κ by recursion on α<κ
by producing sets Cfα⊆Cα such that Cf0=C0={⟨⟩}, Cfα is obtained from the previous Cfβ as in (iii) for limit
ordinals α, and
Cfα+1={σ^σγ:σ∈Cfα and f(σ)=γ}.
Let Tf be the downward closure of ⋃α<κCfα and put Af=[Tf]. Since for σ∈Cfα, σ^σf(σ)
is incompatible with all elements of Cfα+1, we see that [σ^σf(σ)]∩[Tf]=∅, and Af is indeed nowhere dense.
Put A={Af:f∈F}.
Assume B=⋃α<κBα is a κ-meager set, where the Bα form an increasing sequence of nowhere dense sets.
We claim that {f∈F:Af⊆B} has size at most κ.
Indeed, assume that {fζ:ζ<κ+}⊆F. We need to find ζ<κ+ and x∈Afζ∖B.
By almost disjointness and λ>κ+, we can find σ∈⋂ζ<κ+Cfζ1 such that
for all α≥1, all σ′∈Cα with σ⊆σ′ and all distinct ζ,ζ′<κ+,
we have fζ(σ′)=fζ′(σ′). Recursively build τα∈Cα, α<κ, such that
-
τ0=⟨⟩, τ1=σ,
2. 2.
τα=⋃β<ατβ for limit ordinals α, and
3. 3.
if τα has been constructed for α≥1, find τ∗⊇τα such that [τ∗]∩Bα=∅, let
β>α and τβ⊇τ∗ be such that τβ∈Cβ, and define τγ∈Cγ for α<γ<β such that
τα⊆τγ⊆τβ.
Put x=⋃α<κτα. Clearly x∈/B.
Define a function f on all τα, α<κ, as follows.
-
f(τ0)=f(⟨⟩) is the unique γ such that τ1=σ=σγ and
2. 2.
f(τα) is the unique γ such that τα^σγ=τα+1 for α≥1.
Now notice that by disjointness of the functions fζ, there is ζ<κ+ such that for all α≥1, we have fζ(τα)=f(τα).
This means, however, that for all α, τα belongs to Cfζα: indeed τ1=σ∈Cfζ1,
τα∈Cfζα implies τα+1=τα^σf(τα)∈Cfζα+1 because fζ(τα)=f(τα),
and τα∈Cfζα for limit α follows trivially. Therefore x∈[Tfζ]=Afζ, as required, and the proof is complete.
∎
By an old result of Baumgartner, almost disjoint families of functions of size 2λ may not exist.
Indeed, if κ<λ are regular and GCH holds, and we first add at least λ++ Cohen subsets of κ and then add λ Cohen reals, then
λ=∣2<κ∣, 2λ≥λ++ and there is no almost disjoint family of functions in λλ of size
λ++, by [Ba, Theorem 5.4 (a)].
3 Models
Models for non(Mκ). We know [BBFM, Observation 23 (iii)] that 2<κ≤non(Mκ)≤2κ. We shall now
see that this is all we can say, even if 2<κ>κ.
In the model obtained by adding κ+ Cohen reals over a model of GCH, we have κ<2<κ=non(Mκ)=2κ.
For a model with κ<2<κ<non(Mκ)=2κ, simply add κ++ many κ-Hechler functions (see [BBFM, Subsection 4.2])
followed by κ+ many Cohen reals to a model of GCH. In the intermediate model, bκ=κ++. Since Cohen forcing is κκ-bounding,
it does not change the value of bκ. Also bκ≤non(Mκ) in ZFC. Therefore the final model satisfies non(Mκ)=2κ=κ++.
Theorem 7**.**
It is consistent that κ<2<κ=non(Mκ)<2κ.
Proof.
Assume GCH in the ground model V. Add first κ++ many Cohen subsets of κ to obtain the model V[G]. Denote the forcing by Cκκ++
and, more generally, for A⊆κ++, use CκA for the forcing adding the Cohen sets with index in A. Next add κ+ many
Cohen reals to obtain the model V[G][H]. Work in the model V[H]. The forcing (Cκκ++)V is still <κ-distributive in
this model (though not <κ-closed anymore) and κ+-cc; in particular, it does not add new sequences of length <κ.
In V[H], 2<κ=2κ=κ+, and we claim that 2κ∩V[H] is a witness for non(Mκ) in
V[G][H].
Let (A˙α:α<κ) be a (Cκκ++)V-name for an increasing sequence of nowhere dense sets. Thus there is
a name f˙ for a function from 2<κ to 2<κ such that for α<κ and σ∈2α, the trivial
condition forces σ⊆f˙(σ) and [f˙(σ)]∩A˙α=∅ Without loss, lh(f˙(σ))
is forced to be at least α+1. Let p∈(Cκκ++)V.
Recursively produce sets Cα⊆κ++ with Cα∈V, conditions pα,qα∈(Cκκ++)V, and
sequences τα∈2<κ, α<κ, such that
∣Cα∣=κ, and the Cα are an increasing chain,
pα≤p,qα≤pα,
pα∈(CκCα)V,qα∈(CκCα+1)V, and for every q∈(CκCα)V there is a β≥α
such that q=pβ,
τα∈2≥α and τα⊆τβ for α≤β,
qα⊩[τα+1]∩A˙α=∅.
Note that for C⊆κ++ of size κ, ∣(CκC)V∣=(2<κ)V=κ, and thus the second clause
of the third item can easily be achieved by a book-keeping argument.
Let C0⊆κ++ be such that C0∈V and p∈(CκC0)V. Put τ0=⟨⟩. Let p0≤p be the condition in (CκC0)V handed
down by the book-keeping, and find q0≤p0 and τ1 such that q0 forces τ1=f˙(τ0) (note that this is possible because
no new <κ-sequences are added). In particular, q0⊩[τ1]∩A˙0=∅.
Let C1⊇C0 be such that C1∈V and q0∈(CκC1)V.
Assume we are at stage α, and everything has been constructed for β<α. In case α is successor, we also
assume Cα and τα have been produced, and if α is limit we let Cα⊇⋃β<αCβ
with Cα∈V and τα=⋃β<ατβ. Let pα≤p be the condition in (CκCα)V
given by the book-keeping, and proceed as in the basic step to get qα≤pα, τα+1⊇τα,
and Cα+1⊇Cα such that Cα+1∈V and qα∈(CκCα+1)V forces τα+1=f˙(τα) and thus
[τα+1]∩A˙α=∅. This completes the recursive construction.
Now let C=⋃α<κCα and x=⋃α<κτα∈2κ. We claim that
p forces that x∈/A˙ where A˙=⋃α<κAα. Let β<κ. Take any q′≤p in (Cκκ++)V
and let q=q′↾C. Thus q=pα for some α≥β (by the book-keeping). By construction, qα≤pα
forces that [τα]∩A˙α=∅. Clearly qα and q′ are compatible. Let q′′=qα∪q′ be
the smallest common extension. Then q′′ forces x∈/A˙β. Since this holds for any q′≤p and any β,
p forces x∈/A˙.
Hence 2κ∩V[H] is indeed non-meager in V[G][H].
∎
The proof of the following result is somewhat more complicated.
Theorem 8**.**
It is consistent that κ<2<κ<non(Mκ)<2κ.
Proof.
Again assume GCH. First add κ+++ Cohen subsets of κ. Then perform a κ++-stage iteration of κ-Hechler
forcing (see [BBFM, Subsection 4.2]). In the resulting model V[G0][G1], 2<κ=κ<bκ=non(Mκ)=κ++<2κ=κ+++. Next add κ+ Cohen reals to make 2<κ=κ+ in the final model
V[G0][G1][H]. Again it is clear this model will satisfy bκ=κ++, so that non(Mκ)≥κ++,
and it suffices to show non(Mκ)≤κ++. In V[H] the remainder forcing is <κ-distributive and
κ+-cc.
It is well-known (see e.g. [BBFM, Subsection 4.2]) that κ-Hechler forcing also adjoins a κ-Cohen function.
In V[G0][G1] let (cα∈κκ:α<κ++) be the Cohen functions decoded from the κ++
many Hechler functions added in the iteration. We will use the cα to code cαγ∈2κ, κ≤γ<κ+,
in such a way that the set C={cαγ:α<κ++,κ≤γ<κ+} is non-meager in V[G0][G1][H].
More explicitly, let f:κ+→2<κ be a bijection with f∈V[H]. By distributivity of the remainder forcing,
f is still a bijection in V[G0][G1][H]. Assume f(0)=⟨⟩. Next, for each γ with κ≤γ<κ+, let
gγ:κ→γ be a bijection with gγ∈V and gγ(0)=0. Define cαγ∈V[G0][G1][H]
to be the concatenation of the f(gγ(cα(ζ))) where ζ<κ, i.e.
[TABLE]
Note that if cα(ζ)=0 then f(gγ(cα(ζ)))=⟨⟩ so that by genericity κ many of the
f(gγ(cα(ζ))) are non-empty sequences and cαγ is indeed an element of 2κ.
To see that C is non-meager, let A be a meager set in V[G0][G1][H], say A=⋃ζ<κAζ where
the Aζ form an increasing sequence of nowhere dense sets. Thus there is h:2<κ→2<κ such that
for all ζ<κ and all σ∈2ζ, [σ^h(σ)]∩Aζ=∅. By the κ+-cc
of the remainder forcing, there is α<κ++ such that h∈V[H][G0][G1α], where G1α is the generic
for the α first stages of the iteration of κ-Hechler forcing. That is, cα is still CκV-generic over
Vα:=V[H][G0][G1α]. Work in Vα. We shall show that for some γ<κ+, c˙αγ
is forced to be outside A.
Let γ<κ+ with γ≥κ. For τ∈γ<κ let fˉ(τ) be the concatenation
of the f(τ(ζ)), ζ<lh(τ), i.e.
[TABLE]
Say that γ is h-good if
δ<γ implies that f−1(h(f(δ)))<γ,
τ∈(γ<κ∩V) implies that f−1(fˉ(τ))<γ.
Claim 9**.**
There are h-good γ.
Proof.
This is a standard closure argument. Let γ0 be arbitrary with κ≤γ0<κ+.
Recursively construct an increasing continuous sequence (γζ:ζ≤κ) of ordinals
below κ+ such that
if δ<γζ then f−1(h(f(δ)))<γζ+1,
if τ∈(γζ<κ∩V) then f−1(fˉ(τ))<γζ+1.
Since ∣γζ<κ∩V∣=κ, this is possible. Clearly γκ is h-good.
∎
Claim 10**.**
If γ is h-good, then c˙αγ is forced to be outside A.
Proof.
Let ζ<κ and let υ∈CκV=κ<κ∩V be a κ-Cohen condition.
We need to find υ′≤υ such that υ′⊩c˙αγ∈/Aζ.
Let τ∈γ<κ∩V be the image of υ under gγ, that is,
lh(τ)=lh(υ) and τ(ζ)=gγ(υ(ζ)) for all ζ<lh(υ).
Let σ:=fˉ(τ). Without loss of generality we may assume that η:=lh(σ)≥ζ;
otherwise extend the condition υ. Clearly υ⊩c˙αγ∈[σ].
Since γ is h-good, we know that
δ:=f−1(σ)<γ. Note f(δ)=σ. We also have that ϵ:=f−1(h(σ))<γ.
Note f(ϵ)=h(σ). By definition of h, we obtain [σ^h(σ)]∩Aη=∅
and therefore also [σ^h(σ)]∩Aζ=∅.
Let τ′=τ^ϵ and υ′=υ^gγ−1(ϵ).
Thus fˉ(τ′)=fˉ(τ)^f(ϵ)=σ^h(σ) and υ′⊩c˙αγ∈[σ^h(σ)].
In particular υ′⊩c˙αγ∈/Aζ.
∎
This completes the proof of the theorem.
∎
Models for cof(Mκ). As before let λ=∣2<κ∣. By the results of Section 2 we know in
particular that λ<cof(Mκ)≤2λ. We are interested in models with κ<λ.
If we add
κ+ Cohen reals over a model of GCH, we obtain a model of κ<λ=2κ=κ+<cof(Mκ)=2λ=κ++.
For the consistency of κ<λ<cof(Mκ)=2κ, use the model of Theorem 7.
To obtain a model of κ<λ<2κ<cof(Mκ), first add κ+++ Cohen subsets of κ+, then
κ++ Cohen subsets of κ, and finally κ+ Cohen reals over a model for GCH. For λ=κ+, dλ=κ+++
in the first extension, and this is preserved. Therefore the final model satisfies dλ=cof(Mκ)=2λ=κ+++,
by Corollary 5.
Question 11**.**
Is κ<2<κ together with cof(Mκ)<22<κ consistent?
In view of the results Section 2, this is related to questions about the dominating numbers in the next section.
4 Dominating numbers
For this section, let κ be regular (not necessarily uncountable) and λ≥κ arbitrary.
Let us first see that in the definition of dκλ it does not matter whether we use everywhere domination or domination modulo
<κ or <λ (in case cf(λ)≥κ).
For f,g∈κλ, say f≤λg if there is δ<λ such that for all γ≥δ,
f(γ)≤g(γ).
Let dκλ(≤) be the dominating number of κλ with the everywhere domination ordering,
and let dκλ(≤λ) be the dominating number of κλ with the ordering ≤λ.
Proposition 12**.**
dκλ(≤)=dκλ(≤λ). In particular, if cf(λ)≥κ,
dκλ=dκλ(≤)=dκλ(≤λ).
Proof.
The second statement follows from the first because cf(λ)≥κ obviously implies dκλ(≤λ)≤dκλ≤dκλ(≤). So it suffices to see that dκλ(≤)≤dκλ(≤λ).
Take F⊆κλ dominating in (κλ,≤λ). For f,g∈F and α,β<λ define the
function hf,g,α,β∈κλ by
[TABLE]
Since ∣{hf,g,α,β:f,g∈F,α,β<λ}∣=∣F∣, it suffices to show that this family is dominating
everywhere. To this end let h∈κλ be arbitrary. There are f∈F and β<λ such that
f(γ)≥h(γ) for all γ≥β. Now partition λ into intervals Iζ, ζ<λ, so
that each Iζ has length exactly β. Let iζ=minIζ for all ζ. Define h′∈κλ by
[TABLE]
for all ζ<λ and all ξ<β. There are g∈F and η<λ such that g(δ)≥h′(δ) for all δ≥iη.
Then, for ξ<β,
[TABLE]
and we see that hf,g,iη,β dominates h everywhere.
∎
Since cf(2<κ)≥κ the second statement is true when λ=∣2<κ∣ as in Section 2.
Theorem 13**.**
Let κ be regular and λ>κ. Then dκλ≥dκ+λ.
Proof.
We do the proof using Tukey connections. First define Φ−(f):κλ→(κ+)λ by
[TABLE]
for f∈κλ and α<λ. Here ∃κβ denotes the quantifier “there are κ many β”.
This is clearly well-defined by the pigeonhole principle.
For defining Φ+:(κ+)λ→κλ, fix h∈(κ+)λ. Assume without loss that h(α)>0
for all α. Let (αξ:ξ<λ) be the strictly increasing club
sequence in λ recursively defined by α0=0, αξ+1=αξ+h(αξ), and αη=⋃ξ<ηαξ for limit ordinals η. Notice that for η<λ we always have αη<λ (even for
singular λ) because the sequence increases only by ordinals of size at most κ. Replacing h recursively by a larger
function, if necessary, we may also assume that for every ξ<λ and every α∈[αξ,αξ+1),
h(αξ+1)≥h(α). Now define Φ+(h) such that for every ξ<λ, Φ+(h)↾[αξ,αξ+1)
is a one-to-one function into κ.
We first claim that if h≤∗Φ−(f) then Φ+(h)≤∗f.
To see this let α<λ be such that Φ−(f)(α)<h(α). There are at least κ+ many such α.
Let ξ<λ be such that α∈[αξ,αξ+1). By choice of h we have Φ−(f)(α)<h(α)≤h(αξ+1) so that also
[TABLE]
In particular there is ζ<κ such that f assumes value ζ exactly κ many times in the interval [αξ,αξ+2).
Since Φ+(h) is one-to-one on both intervals [αξ,αξ+1) and [αξ+1,αξ+2), it follows that there
are κ many places where Φ+(h) is above f. Thus Φ+(h)≤∗f.
As a consequence, it now readily follows that if F⊆κλ is dominating then so is
{Φ−(f):f∈F} in (κ+)λ.
∎
Question 14**.**
Let κ and μ be regular and κ<μ≤λ. Does dκλ≥dμλ hold?
In particular, is dκλ≥dλ for regular λ?
The inequality in Theorem 13 is consistently strict.
Observation 15**.**
Assume GCH.
Let κ0<κ1<...<κn be regular cardinals, let λ≥κn, and let μn<...<μ1<μ0
be cardinals with μn>λ and cf(μi)>λ.
Then there is a forcing extension with dκiλ=μi.
Proof.
Start by adding μn many Cohen subsets of κn. By backwards recursion add μi many Cohen subsets of κi.
Finish by adding μ0 many Cohen subsets of κ0. The first forcing forces 2κn=2λ=dκnλ=μn.
Since the remainder forcing is κn−1+-cc and thus κnκn-bounding, it preserves the value of dκnλ.
Iterating this argument we see that 2κi=2λ=μ0 and dκiλ=μi in the final model.
∎
In particular dκλ<2λ is consistent for κ<λ, but in the model provided by the observation 2<κ>dκλ>λ holds. On the other hand, for an affirmative answer to Question 11 we would need a model with λ:=2<κ>κ
and dκλ<2λ. Let us formulate this question somewhat more generally:
Question 16**.**
Assume κ is regular and λ>κ with λ≥2<κ. Is dκλ<2λ consistent?
For κ=ω and λ=ω1 this is a famous old question of Jech and Prikry [JP] (see also [Mi, Problem 8.1]):
Question 17** (Jech, Prikry).**
Is dωω1<2ω1 consistent?
The dominating numbers dκλ have since been used in [BS].