Strongly bounded groups of various cardinalities
Samuel M. Corson
Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM, 28049 Madrid, Spain.
[email protected]
and
Saharon Shelah
Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem 91904 Israel
Department of Mathematics, Rutgers University, Piscataway, NJ 08854 USA
[email protected]
Abstract.
Strongly bounded groups are those groups for which every action by isometries on a metric space has orbits of finite diameter. Many groups have been shown to have this property, and all the known infinite examples so far have cardinality at least 2ℵ0. We produce examples of strongly bounded groups of many cardinalities, including ℵ1, answering a question of Yves de Cornulier [4]. In fact, any infinite group embeds as a subgroup of a strongly bounded group which is, at most, two cardinalities larger.
Key words and phrases:
strongly bounded group, strong uncountable cofinality, Bergman property, isometric action, small cancellation over free product
2010 Mathematics Subject Classification:
Primary 20A15, 20E15; Secondary 03E05, 03E17
The first author’s work was supported by the European Research Council grant PCG-336983 and by the Severo Ochoa Programme for Centres of Excellence in R&D SEV-20150554.
The second author’s work was supported by the European Research Council grant 338821. Paper number 1169 on Shelah’s archive. A new 2019 version of the second author’s paper number 1098 will in some respect continue this paper on other problems and cardinals.
1. Introduction
In geometric group theory one extracts information regarding groups via actions on metric spaces. Little knowledge can be gleaned from a group action which has bounded orbits, and so one often uses non-geometric approaches for the study of, say, a finite group. Interestingly there are infinite groups which are similarly not suited for study using geometric techniques. A group G is strongly bounded if every action of G by isometries on a metric space has bounded orbits [4] (this is sometimes referred to as the Bergman property). We emphasize that we are considering all abstract actions of G on all metric spaces, regardless of any natural topology which G may carry. Examples of infinite strongly bounded groups were produced by the second author in [11] using extra set theoretic assumptions, and more recently Bergman showed that the full symmetric group on a set is strongly bounded [1]. The group of self-homeomorphisms of the Cantor set and of the irrational numbers [5], ω1-existentially closed groups, and arbitrary powers of a finite perfect group are also strongly bounded [4].
All infinite strongly bounded groups are necessarily uncountable (see [4, Remark 2.5]), and all known infinite examples so far have cardinality at least 2ℵ0. It is natural to ask whether there exists a strongly bounded group of cardinality ℵ1 (see [4, Question 4.16]). We give an affirmative answer to this and many other such questions (see Section 2 for set theoretic definitions):
Theorem A**.**
Let λ be a cardinal of uncountable cofinality and K be a group such that ∣K∣<λ. Then there exists a strongly bounded group G≥K which is of cardinality λ, except possibly when λ=μ+ where cof(μ)=ω and μ is a limit of weakly inaccessible cardinals.
Thus, for example, there exist strongly bounded groups of cardinality ℵ1, ℵ2, ℵω+1, and ℵℵ1. Moreover, if an infinite group is of cardinality κ then it embeds as a subgroup of a strongly bounded group of cardinality κ++, though often the strongly bounded group can be made to have cardinality κ+ instead. The proof utilizes small cancellation over free products. One cannot drop the assumption regarding uncountable cofinality: a group which is countably infinite, or uncountable of cardinality which is ω-cofinal, cannot be strongly bounded. It is already known that any group K embeds in a strongly bounded group of cardinality ∣K∣ℵ0 (see [4, Corollary 3.2]).
By assuming some extra set theory we can produce other examples of strongly bounded groups of cardinality ℵ1 which seem slightly more tame. In the next theorem, the hypothesis cof(LM)=ℵ1 is equivalent to the assertion that there exists an increasing sequence {Xα}α<ℵ1 of sets of Lebesgue measure zero such that any set of measure zero eventually includes in the elements of the sequence.
Theorem B**.**
Suppose that cof(LM)=ℵ1 and that H is a nontrivial finite perfect group. Then there exists a strongly bounded group of cardinality ℵ1 which is a subgroup of ∏ωH.
Such groups will be constructed by producing a special type of Boolean algebra and applying a result of de Cornulier. The group ∏ωH mentioned in Theorem B is itself already known to be strongly bounded [4, Theorem 4.1]. Assuming that ZF is consistent, one can produce models of ZFC in which cof(LM)=ℵ1 and also 2ℵ0 is any cardinal which is not ruled out by the classical theorems of set theory [8]. Thus we obtain:
Corollary 1.1**.**
If κ is a cardinal of uncountable cofinality then there exists a model of ZFC in which 2ℵ0=κ and there is a strongly bounded group of cardinality ℵ1 which is a subgroup of ∏ωH, where H is any nontrivial finite perfect group. (Assuming, of course, that ZF is consistent.)
In Section 2 we prove Theorem A and in Section 3 we prove Theorem B.
2. Proof of Theorem A
In this section we will first quote an alternative characterization for a group to be strongly bounded and then review small cancellation over free products. Then we review some set theory and furnish the proof of Theorem A.
If G is a group, 1G denotes the identity element of G and Z⊆G, we denote
G(Z)=Z∪{1G}∪{g−1∣g∈Z}∪{gh∣g,h∈Z}.
Lemma 2.1**.**
([4, Proposition 2.7]) A group G is strongly bounded if and only if for every sequence {Zm}m∈ω of subsets of G such that G(Zm)⊆Zm+1 and ⋃m∈ωZm=G there exists an m∈ω for which Zm=G.
Now for the review of free products (see [10, V.9]). Recall that elements of a free product F=∗i∈IHi are naturally viewed as words whose letters are nontrivial elements of ⋃i∈IHi. We will write w≡u to say that two such words are equal as words, letter for letter, and write w=u if the group element given by the product w is equal in F to the group element given by the product u. Concatenation of words w and u will be denoted as usual by wu, meaning that one writes the word w and then to the right of this one writes the word u.
Each element g of F has a unique writing as such a word g=w≡g1⋯gk which is of minimal length (the normal form) in which no two consecutive letters in the word are elements of the same Hi, and we let L(g)=k denote the length of such an expression. Given two normal forms w≡g1⋯gk and u≡h1⋯hj one computes the normal form of the group element wu in the following way. First we find s∈ω which is maximal such that gk+1−r=hr−1 for all 1≤r≤s (we allow s to be [math]). In case k−s≥1 and s+1≤j we get gk−s=hs+1−1. If gk−s is in the same Hi as hs+1 then we let gk−shs+1=h∈Hi and obtain the normal form g1⋯gk−s−1hhs+2⋯hj for the group element wu. Otherwise we get g1⋯gk−shs+1⋯hj as the normal form. We say a group element w∈F has semi-reduced form uv if both u and v are normal forms, w=uv, and the number s used in the computation for the normal form for uv is [math].
An element in F with normal form w≡g1⋯gk is cyclically reduced if either L(w)≤1, or g1 and gk are in different Hi. More generally we say w is weakly cyclically reduced if either L(w)≤1, or g1=gk−1. A subset R⊆F is symmetrized if every w∈R is weakly cyclically reduced and every weakly cyclically reduced conjugate of w and of w−1 is also in R. From a set Γ of weakly cyclically reduced elements of F one obtains a symmetrized set by taking all weakly cyclically reduced conjugates of Γ and then taking their inverses. Given a symmetrized set R, a word u is a piece if there exist distinct w1,w2∈R with semi-reduced forms w1=uv1 and w2=uv2.
Definition 2.2**.**
A symmetrized set R for the free product F=∗i∈IHi satisfies the C′(η) condition, where η>0, if for each w∈R we have
- (1)
L(w)>η1; and
2. (2)
whenever w=uv is a semi-reduced form, with u a piece, we have L(u)<ηL(w).
We use the following:
Lemma 2.3**.**
(see [10, Corollary V.9.4]) Let F=∗i∈IHi be a free product and R a symmetrized subset of F which satisfies C′(61). Let N be the normal closure of R in F. Then the natural map F→F/N embeds each factor Hi of F.
Lemma 2.4**.**
For each n≥1 there is a group word w(x0,x1,…,xn−1,y) such that the following holds: If G is a group and f:(G∖{1G})n→G then there exist group H and c∈H such that
- (a)
G≤H;
2. (b)
c∈H∖G;
3. (c)
for all g∈(G∖{1G})n we have w(g,c)=f(g);
4. (d)
H=⟨G∪{c}⟩.
Proof.
Let u(x0,x1,…,xn−1,y) be given by
[TABLE]
and let w(x0,…,xn−1,y) be given by
[TABLE]
where k=32. Let F be the free product given by F=⟨c⟩∗G, where c has infinite order. Let Γ0={(f(g))−1w(g,c)∣g∈(G∖{1G})n}. Notice that the elements of Γ0 are weakly cyclically reduced unless gn−1=f(g), in which case we replace the word (f(g))−1w(g,c) with the weakly cyclically reduced word obtained by reducing the word w(g,c)(f(g))−1. By performing all these replacements we obtain a new set Γ.
Notice that the symmetrization R of Γ satisfies C′(61) over the free product F. More specifically each element of Γ is weakly cyclically reduced and of length (2n−1)k+k+1=2nk+1 in case f(g)=1G,gn−1; of length 2nk+1−2=2nk−1 in case gn−1=f(g); or of length 2nk in case f(g)=1G. Weakly cyclically reduced conjugates of elements of Γ will have length at least 2nk−2, similarly for the inverses of such elements. It is clear that no normal form which has form
[TABLE]
where v1,v3∈F and m1,m2,m3∈Z∖{0} can be a piece. Thus we can use, for example, 10n as a very naïve upper bound on the length of a piece. For any w∈R we have
[TABLE]
as well as
[TABLE]
and so R indeed satisfies C′(61).
Let N be the normal subgroup in F generated by R and by Lemma 2.3 that the homomorphism F→F/N=H embeds each of G and ⟨c⟩. The claim is immediate.
∎
As is usual, we shall consider each ordinal number to be the set of ordinal numbers below itself (e.g. 0=∅, 1={0}, ω+1={0,1,…,ω}) and the cardinal numbers to be the ordinals which cannot inject to a proper initial subinterval of themselves. The notation ∣Y∣ denotes the cardinality of the set Y. A subset X of ordinal α is bounded if there is an upper bound β<α for all elements of X. The cofinality of an ordinal α (denoted cof(α)) is the least cardinality of an unbounded subset of α. An infinite cardinal λ is regular if cof(λ)=λ, and is singular otherwise. We use κ+ to denote the smallest cardinal which is strictly greater than κ, and similarly κ++=(κ+)+. An infinite cardinal λ is a successor cardinal if λ=κ+ for some cardinal κ, and is a limit cardinal otherwise. An uncountable cardinal which is a limit regular cardinal is weakly inaccessible. For any infinite cardinal κ the successor cardinal κ+ is regular.
Next we remind the reader of some notation from Ramsey coloring theory.
Definitions 2.5**.**
If X is a set and n∈ω we let [X]n denote the set of subsets of X of cardinality n. If κ, λ, and μ are cardinals and n∈ω then we write
λ→[μ]κn
to mean than if f:[λ]n→κ is any function then for some A⊆λ with ∣A∣=μ we have f([A]n) is a proper subset of κ (see [6]). The negation of this relation is denoted λ↛[μ]κn. The reader should take care not to confuse this square bracket partition relation with the parenthetical notation λ→(μ)κn.
Proof of Theorem A.
The relation ⊕λ,n, where λ is an infinite cardinal and n∈ω, will mean that there exists some f:[λ]n→λ such that if h:λ→ω is any function then for some m∈ω we have
λ={f(Z)∣Z⊆{α<λ∣h(α)<m} and ∣Z∣=n}.
Clearly λ↛[λ]λn implies ⊕λ,n. We note that if λ is a successor of a regular cardinal, or if λ=μ+ where μ is singular and not a limit of weakly inaccessible cardinals, then λ↛[λ]λ2, and therefore ⊕λ,2, holds (see [12, Theorems 3.1, 3.3(3)] and [13]). We consider three cases.
Case I: ⊕λ,n holds, cof(λ)>ω. In this case we let K be a group, without loss of generality infinite, with ∣K∣<λ. The construction is by induction. First we define an increasing sequence of ordinals {βα}α<λ by letting β0=∣K∣, βα+1=βα+βα and βα=⋃γ<αβγ when α is a limit ordinal.
Next we let f:[λ∖{0}]n→λ∖{0} witness ⊕λ,n. We can without loss of generality assume that f(W)∈βα for all α<λ and W∈[βα]n. To see this, let U be a set such that ∣U∣=λ and by assumption let g:[U]n→U be such that for any h:U→ω there exists m∈ω for which
U={g(W)∣W⊆{x∈U∣h(x)<m} and ∣W∣=n}.
Pick a well order U={xϵ}ϵ<λ. Given a subset W⊆U we let g′′(W)=⋃k∈ωWk where W0=W and Wk+1=Wk∪{g(W)∣W⊆Wk and ∣W∣=n}. Let U0′⊆U be such that ∣U0′∣=∣K∣. Let U0=g′′(U0′). If α<λ is a limit ordinal we let Uα=⋃γ<αUγ. If α=γ+1 then we pick U⊇Uα′⊇Uγ such that the minimal element of U∖Uγ is in Uα′ and ∣Uα′∣=∣Uα′∖Uγ∣=∣Uγ∣. Let Uα=g′′(Uα′). Notice that g([Uα])⊆Uα for each α<λ. By the induction we also have U=⋃α<λUλ. Taking p:U→λ∖{0} to be any bijection such that p(Uα)=βα for all α and defining f=p∘g∘p−1 we obtain the required f.
We define the group G to have set of elements λ and give it a group structure as an increasing union of subgroups Gα, with Gα having βα as its underlying set of elements. Define G0 to have the group structure of K on the set of elements β0 with [math] identified with the trivial group element 1K. If we have defined the group structure Gγ for all γ<α≤λ and α is a limit ordinal then we let Gα have the unique group structure imposed by the Gγ with γ<α. If λ>α=γ+1 then by Lemma 2.4 we define Gα to have group structure such that
- (a)
Gγ≤Gα;
2. (b)
for all g∈(Gγ∖{1Gγ})n such that g0<g1<⋯<gn−1 we have w(g,βγ)=f({g0,…,gn−1});
3. (c)
Gα=⟨Gγ∪{βγ}⟩
(here we use the fact that ∣βα∣=∣βα∖βγ∣=∣βγ∣).
Now G=Gλ and we let X={βα}α<λ. Suppose that {Zm}m∈ω is a sequence of subsets of G such that G=⋃m∈ωZm and Zm+1⊇G(Zm). Select m∈ω large enough that
λ∖{0}={f(W)∣W⊆{0=α<λ∣α∈Zm} and ∣W∣=n}
and that 1G∈Zm and that X∩Zm is unbounded in λ. Given arbitrary g∈G∖{1G} we select nontrivial g0<…<gn−1 in Zm such that f({g0,…,gn−1})=g. Pick gn∈X∩Zm which is larger than all g0,…,gn−1. Then we have w(g0,…,gn−1,gn)=f({g0,…,gn−1})=g and so G=Zm+j where j is the length of the word w. Case I is proved.
Case II: λ is a limit cardinal, cof(λ)>ω. In this case we let λ=⋃α<cof(λ)λα where {λα}α<cof(λ) is a strictly increasing sequence of cardinals below λ such that λ0≥∣K∣. Notice that each cardinal λα++ satisfies Case I. Let λ0 be given any group structure such that K is a subgroup in λ0. By Case I we let λ0++ be given a group structure G0 which is strongly bounded. For each α<cof(λ) we endow λα++ with a group structure Gα which extends the group structure on ⋃γ<αλγ++ and such that Gα is strongly bounded (by Case I). Now let λ be given the group structure G inherited from all the Gα. Let {Zm}m∈ω be such that G(Zm)⊆Zm+1 and ⋃m∈ωZm=G and notice that for each α<cof(λ) there exists some minimal mα∈ω such that Ymα∩Gα=Gα. Then α↦mα is a nondecreasing sequence from cof(λ) to ω, so it eventually stabilizes, and so G is strongly bounded.
Case III: λ=μ+ where cof(μ)>ω and μ is singular. Let K be a group of cardinality <λ. We let μ=⋃α<cof(μ)μα with {μα}α<cof(μ) being a strictly increasing sequence of cardinals. We have μα++↛[μα++]μα++2. Let fα:[μα++]2→μα++ witness this. Let f:[μ]2→μ be defined by f(W)=fα(W) where α<cof(μ) is minimal such that W∈[μα++]2.
For each ordinal μ≤γ<μ+=λ we let jγ:γ→μ be any bijection and define hγ:[γ]2→γ by jγ−1∘f∘jγ (here jγ(W), where W∈[γ]2, means the 2-element set obtained by applying jγ to the elements of W). Define h:[λ]3→λ by hmax(W)(W∖{max(W)}).
We define a group structure on λ by induction. Let β0=μ, βδ+1=βδ+βδ and βδ=⋃ϵ<δβϵ when δ is a limit ordinal. Let G0 be any group structure on β0 which includes K as a subgroup. If Gδ has been defined for all ϵ<δ≤λ and δ is a limit ordinal then we let Gδ be the induced group structure on βδ. If λ>δ=ϵ+1 then we let Gδ be the group given by
- (a)
Gϵ≤Gδ;
2. (b)
for all g∈(Gϵ∖{1Gϵ})2 with jβϵ(g0)<jβϵ(g1) we have w(g,βϵ)=h({g0,g1,βϵ});
3. (c)
Gδ=⟨Gϵ∪{βϵ}⟩
where w is as in Lemma 2.4. Now we have our group structure G on λ. Let {Zm}m∈ω be as usual.
We claim that for each δ<λ there exists some m∈ω such that Gδ⊆Zm. Fix δ<λ and select m0∈ω large enough that βδ∈Zm0. Notice that for each α<cof(μ) there is some natural number m>m0 for which ∣μα++∩jβδ(Zm∩βδ)∣=μα++ (since μα++ is necessarily of cofinality >ω). As cof(μ)>ω there must exist some m1>m0 for which
{α<cof(μ)∣∣μα++∩jβδ(Zm1∩βδ)∣=μα++}
is unbounded in cof(μ). Let g∈Gδ be given. Select α<cof(μ) large enough that jβδ(g)∈μα++ and such that ∣μα++∩jβδ(Zm1∩βδ)∣=μα++. Select elements μα+<ζ0<ζ1<μα++ which are elements of jβδ((Zm1∖{1G})∩βδ) for which fα({ζ0,ζ1})=jβδ(g). Then f({ζ0,ζ1})=jβδ(g), and by construction it follows that
[TABLE]
and so Gδ⊆Zm1+j where j is the length of the word w.
Now letting mδ be minimal such that Gδ⊆Zmδ we get a nondecreasing function δ↦mδ from λ to ω, which must stabilize. Thus G is strongly bounded.
∎
3. Proof of Theorem B
We assume that the reader is familiar with the definition of a Boolean algebra (see [7, I. 7]). We shall use notation x∧y and x∨y for the meet and join of x and y in a Boolean algebra, xc for the complement of x, x−y=x∧yc, and 1 and [math] for the top and bottom elements. Given a subset Z of a Boolean algebra A we let R(Z) equal the following set:
[TABLE]
Definition 3.1**.**
A proper R-filtration of a Boolean algebra A is a sequence {Zn}n∈ω such that Zn properly includes in Zn+1, R(Zn)⊆Zn+1, and A=⋃n∈ωZn. A proper R-filtration induces a function f:A→ω by letting f(x)=min{n∈ω∣x∈Zn}.
Definition 3.2**.**
(see [4, Remark 4.5]) An infinite Boolean algebra has strong uncountable cofinality if it has no proper R-filtration.
We shall be especially interested in a specific type of algebra.
Definition 3.3**.**
An algebra on a set X is a collection A of subsets of X for which
X∈A;
Z,Z′∈A implies Z∩Z′∈A; and
Z∈A implies X∖Z∈A.
Intersection, union and set theoretic complementation answer for the meet, join and complementation which endow A with a natural Boolean algebra structure.
Given an algebra A on X and a function f:X→Y we shall say that f is measurable if each preimage f−1(y) is in A for each y∈Y. If Y is a finite group then it is easy to check that the set of measurable functions from X to Y forms a group under component wise multiplication: (f0∗f1)(x)=f0(x)f1(x).
The following was essentially proved by Yves de Cornulier in [4]:
Theorem 3.4**.**
Suppose A is an algebra of sets on a set X which is of strong uncountable cofinality and H is a finite perfect group. Then the group of measurable functions from X to H is strongly bounded.
Proof.
See proof of [4, Thm. 4.1].
∎
Thus to prove Theorem B it suffices to prove the following:
Proposition 3.5**.**
If cof(LM)=ℵ1 then there exists an algebra of sets on ω of cardinality ℵ1 which is of strong uncountable cofinality.
This is a slight refinement of the main result of [3] in which Cielsielski and Pawlikowski construct from the assumption cof(LM)=ℵ1 an algebra of cardinality ℵ1 which is of uncountable cofinality (i.e. an algebra that is not the union of a strictly increasing ω sequence of subalgebras). Models of ZFC + ℵ1<2ℵ0 in which such an algebra exists were first constructed by Just and Koszmider [8]. Under Martin’s axiom the existence of an algebra of cardinality ℵ1 of uncountable cofinality implies the continuum hypothesis [9, Prop. 5]. Thus one cannot hope to prove the conclusion of Proposition 3.5 without extra set theoretic assumptions.
The proof of Proposition 3.5 will follow a slight modification to the lovely proof used in [3]. Given a set X we let [X]≤n denote the set of all subsets of X of cardinality at most n. Consistent with [3] we let CH denote the collection of all subsets T⊆ωω of form T=∏n∈ωTn where Tn∈[ω]≤n+1. The cardinal cof(LM) is equal to the cardinal
[TABLE]
(see [2]), and for our construction we will use this latter formulation.
Lemma 3.6**.**
For each T∈CH these exists a strictly increasing g∈ωω such that for every strictly increasing f∈T we have f(n)<g(n) for all n∈ω, and whenever g(n)≥f(m) we have g(n+1)>f(m+2).
Proof.
Let g(0)=max(T0)+1 and generally let g(n+1)=max(Tg(n)+2∪{g(n)})+1. Clearly g(n+1)≥g(n)+1 for all n∈ω and so g is strictly increasing and moreover g(n)>n. Given a strictly increasing f∈T we notice that f(0)<g(0) since f(0)∈T0 and f(n+1)<f(g(n)+2)<g(n+1) for all n. Finally, suppose that
m,n∈ω are such that g(n)≥f(m). Then g(n)≥f(m)≥m and so g(n)+2≥m+2. Now
f(m+2)≤f(g(n)+2)≤max(Tg(n)+2)<g(n+1)
and we are finished.
∎
The argument for the next lemma follows that of [4, Proposition 4.4].
Lemma 3.7**.**
If f:A→ω corresponds to a proper R-filtration of Boolean algebra A then there exists a sequence {an}n∈ω for which an∧am=0 whenever m=n and such that f(a0)<f(a1)<⋯.
Proof.
Let L={a∈A∣f(↓a) is unbounded in ω} where ↓a denotes the set of elements in A below a. We know that 1∈L and if a∈L and a′≤a then either a′ or a−a′ is in L. Let c0=1 and select a0∈A such that c1=c0−a0∈L. Suppose that we have selected disjoint a0,…,an∈A as well as decreasing c0,…,cn+1∈L with cm=cm+1∨am and cm+1∧am=0 and f(a0)<f(a1)⋯<f(an). Select an+1′≤cn+1 such that f(an+1′)≥max({f(an),f(cn+1)})+2. Notice that f(cn+1)+2≤f(an+1′)≤max({f(cn+1),f(cn+1−an+1′)})+1, and so f(cn+1−an+1′)+1≥f(an+1′) and f(cn+1−an+1′)≥f(an)+1. Thus f(an+1′),f(cn+1−an+1′)>f(an). If cn+1−an+1′∈L then let an+1=an+1′ and cn+2=cn+1−an+1′, else an+1′∈L and we let cn+2=an+1′ and an+1=cn+1−an+1′. Now it is clear that the produced sequence {an}n∈ω consists of disjoint elements and f(a0)<f(a1)<⋯.
∎
For the following, cf. [3, Lemma 3]:
Lemma 3.8**.**
If cof(LM)=ℵ1 then for every countably infinite Boolean algebra A there exists a family of sequences {anζ}n∈ω,ζ<ℵ1 in A such that
- (1)
anζ∧amζ=0 whenever ζ<ℵ1 and n=m; and
2. (2)
for every proper R-filtration f of A there exists ζ<ℵ1 for which f(anζ)>n for all n∈ω.
Proof.
Since A is countably infinite, and finitely generated Boolean algebras are finite, we can write A as the union of a strictly increasing chain A0⊊A1⊊⋯ of finite Boolean subalgebras. By cof(LM)=ℵ1 we select a subset {Tθ}θ<ℵ1⊆CH such that ωω=⋃θ<ℵ1Tθ. For each Tθ select a function gθ as in Lemma 3.6.
We notice that if f is a proper R-filtration of A there exist θ0,θ1<ℵ1 such that both of the following hold for all n∈ω:
- (a)
gθ0(n)>f(b) for every b∈An;
2. (b)
there is an antichain bn,0,…,bn,2n∈Agθ1(n+1) such that
[TABLE]
To see this we select a strictly increasing h0∈ωω such that f(b)<h0(n) for each b∈An. Since h0∈ωω=⋃θ<ℵ1Tθ, we select θ0 such that h0∈Tθ0. Then gθ0 satisfies property (a) since gθ0(n)>h0(n) for all n∈ω. Select a sequence {an}n∈ω as in Lemma 3.7. Define h1∈ωω by first letting h1(0)=0 and then selecting a0,0 in {an}n∈ω for which gθ0(h1(0))+5<f(a0,0). Suppose we have already selected h1(0),…,h1(m) and {ar,i}0≤r≤m,0≤i≤2r such that for each 0≤r<m we have
[TABLE]
and ar,0,ar,1,…,ar,2r∈Ah1(r+1), and so that
[TABLE]
Select h1(m+1) such that am,0,…,am,2m∈Ah1(m+1) and select further elements am+1,0,…,am+1,2(m+1) among {an}n∈ω so that
[TABLE]
Such an h1 is obviously strictly increasing and h1∈Tθ1 for some θ1<ℵ1.
We know that for each n∈ω there exists a maximal mn∈ω such that h1(mn)≤gθ1(n) and certainly mn≥n; moreover by Lemma 3.6 we know mn+1≥mn+2. We select the antichains bn,0,…,bn,2(n+1) for each n∈ω by letting bn,i=amn+1,i. Thus (a) and (b) are both satisfied.
Formally setting Agθ1(−1)=∅ we know that the proper R-filtration f is an element of the set
Xθ0,θ1=∏n∈ω(gθ0(gθ1(n))Agθ1(n)∖Agθ1(n−1).
Each set ωAgθ1(n)∖Agθ1(n−1) is countably infinite and can therefore be bijected with ω. This bijection extends to a bijection of ωω with ∏n∈ωωAgθ1(n)∖Agθ1(n−1). Since cof(LM)=ℵ1 there exists a covering of cardinality ℵ1 of ∏n∈ωωAgθ1(n)∖Agθ1(n−1) by sets of form Sη=∏n∈ωSnη where Snη∈[ωAgθ1(n)∖Agθ1(n−1)]≤n+1. Let Jθ0,θ1,η denote the set of all proper R-filtrations of A which are in Sη∩Xθ0,θ1 and satisfy (a) and (b) for the parameters θ0,θ1.
There are only ℵ1-many choices for θ0,θ1 and each Xθ0,θ1 can be covered by ℵ1-many sets Sη. Therefore it is now sufficient to construct a sequence {an}n∈ω for which
- (1)
an∧am=0 whenever n=m; and
2. (2)
f(an)>n for any f∈Jθ0,θ1,η.
Let {fi:Agθ1(n)∖Agθ1(n−1)→gθ1(gθ0(n))}0≤i≤n be the set of restrictions f↾Agθ1(n)∖Agθ1(n−1) where f∈Jθ0,θ1,η. We inductively define a set of elements {dni}0≤i≤n⊆Agθ1(n) such that for all j≤i we have fj(dni)>gθ0(gθ1(n−1))+4n−2i.
For i=0 we can select by (b) an element dn0∈Agθ1(n) for which f0(dn0)>gθ0(gθ1(n−1))+4n+1. Suppose that we have selected dni∈Agθ1(n), where i<n, such that for all 0≤j≤i we have fj(dni)>gθ0(gθ1(n))+4n−2i. If also
[TABLE]
then we set dni+1=dni. Else we have
[TABLE]
By (b) we select an antichain bn−1,0,…,bn−1,2n∈Agθ1(n) such that
[TABLE]
Notice that
max({fi+1(dni∧bn−1,k),fi+1((dni)c∧bn−1,k)})≥fi+1(bn−1,k)−1
since otherwise fi+1(bn−1,k)=fi+1((dni∧bn−1,k)∨((dni)c∧bn−1,k))≤fi+1(bn−1,k)−1. Thus we may select d∈{dni,(dni)c} for which fi+1(d∧bn−1,k)≥fi+1(bn−1,k)−1 for n+1 elements of {0,…,2n} by the pigeon hole principle. Let K⊆{0,…,2n} denote the set of all k for which fi+1(d∧bn−1,k)≥fi+1(bn−1,k)−1. Letting ek=d∧bn−1,k for each k∈K we have fi+1(ek)≥fi+1(bn−1,k)−1>gθ0(gθ1(n−1))+4n. This means that for all k∈K we have
[TABLE]
for otherwise we would have
gθ0(gθ1(n−1))+4n<fi+1(ek)
=fi+1((dc∨ek)∧d)
≤gθ0(gθ1(n−1))+4n−2(i+1)+2
≤gθ0(gθ1(n−1))+4n
Next we notice that for every 0≤j≤i there is at most one k∈K for which
[TABLE]
for if distinct k,k′∈K satisfied this inequality we would have
gθ0(gθ1(n−1))+4n−2(i+1)+1≥fj((dc∨ek)∧(dc∨ek′))
=fj(dc)
>gθ0(gθ1(n−1))+4n−2i−1
which is absurd. Thus by the pigeon hole principle, since i<n, there exists some k∈K for which fj(dc∨ek)>gθ0(gθ1(n−1))+4n−2(i+1) for all 0≤j≤i+1 and we let dni+1=dc∨ek. The construction of the dni is now complete.
Letting {dn}n≥1 be given by dn=dnn we notice that for every f∈Jθ0,θ1,η we have f(dn)=f(dnn)>gθ0(gθ1(n−1))+2n for each n≥1. Thus letting cn=dn+1 we get for all f∈Jθ0,θ1,η
gθ0(gθ1(n+1))>f(cn)>gθ0(gθ1(n))+2(n+1)
and
gθ0(gθ1(n+1))≥f(cnc)≥gθ0(gθ1(n))+2(n+1)
since cn∈Agθ1(n+1).
For each n∈ω let cn0=cn and cn1=cnc. We define a sequence n0<n1<⋯ of natural numbers, a sequence σ of [math]s and 1s, as well as a sequence of subsets ω⊇Z0⊇Z1⊇. Let n0=0. Notice that it is either the case that there are infinitely many k for which
f(cn0∧ck)≥f(ck)−1 for all f∈Jθ0,θ1,η
or infinitely many k for which
f(cn0c∧ck)≥f(ck)−1 for all f∈Jθ0,θ1,η.
Select σ(0) so that for infinitely many k∈ω we have f(cn0σ(0)∧ck)≥f(ck)−1 for f∈Jθ0,θ1,η and let
Z0={k>n0∣f(cn0σ(0)∧ck)≥f(ck)−1 for all f∈Jθ0,θ1,η}
Let n1=min(Z0). Select σ(1) so that the set
Z1={k>n1,k∈Z0∣f(cn0σ(0)∧cn1σ(1)∧ck)≥f(ck)−2 for all f∈Jθ0,θ1,η}
is infinite. Continuing in this manner we construct a sequence lm=cn0σ(0)∧⋯∧cnmσ(m) in A such that f(lm)≥f(cnm)−m−1, lm≥lm+1 and lm∈Agθ1(nm+1). Since
f(lm)≥f(cnm)−m−1
≥f(cnm)−nm−1
>gθ0(gθ1(nm))
>f(lm−1)
for all f∈Jθ0,θ1,η we get that
f(lm−lm+1)≥f(lm+1)−1
>f(cnm+1)−m−2
>gθ0(gθ1(nm+1))+2(nm+1+1)−m−2
≥gθ0(gθ1(nm+1))+2(m+2)−m−2
>m.
Thus letting am=lm−lm+1 we are done.
∎
The construction for Proposition 3.5 now follows that used for [3, Theorem 1] with almost no alteration. For completeness we provide the construction and proof below.
Proof of Proposition 3.5.
As cof(LM)=ℵ1 we have by Lemma 3.6 a set {gθ}θ<ℵ1 of strictly increasing functions gθ:ω→ω such that for each f:ω→ω there is some θ<ℵ1 for which f(n)<gθ(n) for all n∈ω. Let {Xm}m∈ω be a partition of ω into infinite pairwise disjoint sets. For each θ<ℵ1 we let gθ′(m)=min(Xm∩(gθ(m),∞)). Given any sequence a={an}n∈ω of pairwise disjoint subsets of ω we let
[TABLE]
and
[TABLE]
Moreover we let
[TABLE]
The Boolean algebra A will be constructed by induction over the ordinals less than ℵ1. Let A0 be a Boolean algebra on ω of cardinality ℵ1. Whenever ϵ<ℵ1 is a limit ordinal we let Aϵ=⋃δ<ϵAδ. Construct Aδ+1 from Aδ by letting Aδ={bγ}γ<ℵ1 be an enumeration and for each ω≤α<ℵ1 let Aδ,α be the Boolean subalgebra generated by {bγ}γ<α. Since Aδ,α is countably infinite we select, by Lemma 3.8, sequences {aζ,α}ζ<ℵ1 such that anζ,α∧amζ,α=0 when m=n and for any proper R-filtration f of Aδ,α there exists ζ<ℵ1 for which f(anζ,α)>n for all n∈ω. Let Aδ+1 be the Boolean algebra generated by Aδ∪⋃ω≤α<ℵ1,ζ<ℵ1F(aζ,α). Let A=⋃δ<ℵ1Aδ.
We check that A is as required. Certainly the cardinality of A is correct. To see that A is of strong uncountable cofinality we suppose for contradiction that f:A→ω is a proper R-filtration. Select elements bn∈A such that f(bn)>n. Then {bn}n∈ω⊆Aδ for some δ<ℵ1, and therefore {bn}n∈ω⊆Aδ,α for some α<ℵ1. The restriction f↾Aδ,α is therefore a proper R-filtration of Aδ,α. Letting {aζ,α}ζ<ℵ1 be the sequence selected for Aδ,α, we know for some ζ<ℵ1 that f(anζ,α)>n for all n∈ω.
Now F(aζ,α)⊆Aδ+1⊆A. Select θ<ℵ1 for which f((aζ,α)m)+m+1<gθ(m) for all m∈ω. Now f((aζ,α)θ)=m for some m∈ω. We notice that (aζ,α)θ∩(aζ,α)m=agθ′(m), whence
gθ′(m)<f(agθ′(m))
≤max({m,f((aζ,α)m)})+1
<gθ(m)
<gθ′(m)
which is a contradiction.
∎