A small ultrafilter number at smaller cardinals
Dilip Raghavan
Department of Mathematics
National University of Singapore
Singapore 119076
[email protected]
http://www.math.nus.edu.sg/$\sim$raghavan
and
Saharon Shelah
Abstract.
It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets.
It is also shown to be consistent relative to a supercompact cardinal that there is a uniform ultrafilter on ℵω+1 which is generated by fewer than 2ℵω+1 sets.
Key words and phrases:
cardinal invariant, uniform ultrafilter, indecomposable ultrafilter, large cardinal
2010 Mathematics Subject Classification:
03E17, 03E35, 03E05, 03E55
First author was partially supported by the Singapore Ministry of Education’s research grant number MOE2017-T2-2-125.
Both authors were partially supported by European Research Council grant 338821.
Publication 1160 on Shelah’s list.
1. Introduction
The purpose of this short note is to show that it is possible to make the ultrafilter number small at relatively small accessible regular cardinals assuming the existence of large cardinals.
Recall the following definitions.
Definition 1**.**
Let κ≥ω be a regular cardinal.
An ultrafilter U on κ is said to be uniform if ∣A∣=κ for every A∈U.
A set X⊆U generates U if
[TABLE]
The cardinal u(κ) is defined to be smallest size of a family that generates a uniform ultrafilter on κ.
More formally,
[TABLE]
Much is known about u(ω).
The consistency of u(ω)=ℵ1<2ℵ0 seems to have been first noted by Kunen in the early 1970s (see Exercise (A10) of Chapter VIII in [5]).
To obtain Kunen’s model, one starts with ℵ1<2ℵ0 and then adjoins an ultrafilter witnessing u(ω)=ℵ1 by a finite support iteration of c.c.c. forcings of length ω1.
Baumgartner and Laver (see [2]) noticed later that both countable support iterations and countable support products of Sacks forcing preserve P-points, and hence they showed that u(ω)=ℵ1<ℵ2=2ℵ0 holds in both the iterated and side-by-side Sacks models.
The Miller model (see [6] and [1]) provides an example of a model where u(ω)=ℵ1<ℵ2=d(ω) holds.
Much later, Shelah proved the consistency of u(ω)<a(ω) assuming the consistency of a measurable cardinal in [9].
The situation above ω is much less clear.
Kunen asked in the seventies whether u(ℵ1)<2ℵ1 or even whether r(ℵ1)<2ℵ1 is consistent.
Kunen’s questions remain completely open.
If κ≥ℶω is regular, then d(κ)≤r(κ) (see [8]), and therefore d(κ)≤r(κ)≤u(κ).
Hence there can be no perfect analogue of the Miller model at sufficiently large regular cardinals.
It remains an open problem whether d(κ)≤r(κ) is provable for uncountable regular cardinals κ less than ℶω.
For regular κ>ω, the consistency of u(κ)<2κ was only known for supercompact κ until now.
An unpublished result of Carlson from the eighties showed that if κ is a Laver indestructible supercompact cardinal, then there is a forcing extension in which κ remains supercompact and u(κ)=κ+<2κ.
Carlson’s model is obtained in a manner analogous to how Kunen’s model for u(ω)=ℵ1<2ℵ0 is obtained.
In this note, we produce models where u(κ)<2κ for accessible values of κ.
More precisely, assuming a measurable cardinal in the ground model, we produce a model where 2ℵ0 is regular and u(2ℵ0)<22ℵ0, and assuming a supercompact cardinal in the ground model we produce a model where u(ℵω+1)<2ℵω+1.
We do not know if any large cardinals are necessary to produced models satisfying these statements.
Our models are unlikely to be optimal in several other ways.
For instance in all of our models, 2κ is much larger than κ+.
At present, we do not know how to produce models of u(κ)<2κ for accessible values of κ where the gap between κ+ and 2κ is small.
See Section 5 for further discussion of open problems.
Most of the ideas needed to prove our theorems come from a paper of Shelah and Thomas [10] in which several statements about subgroups of the symmetric group on κ were shown to be consistent relative to large cardinals.
In fact we show that u(ℵω+1)<2ℵω+1 holds in the model constructed in Section 4 of [10].
A crucial ingredient used in the proofs in our paper and in the paper of Shelah and Thomas [10] is the notion of an indecomposable filter.
In particular we will use a theorem of Ben-David and Magidor [3] saying that indecomposable filters may exist on ℵω+1.
While we will only consider u(κ) for regular κ in this note, several other works such as Garti and Shelah [4] have dealt with the ultrafilter number at singular cardinals.
2. A general result
In this section we will present a general theorem saying that if μ is a singular strong limit cardinal, if λ and κ are specifically chosen cardinals below μ, and if P is any forcing notion that satisfies a combinatorial condition relative to λ,κ, and μ, then P forces that u(κ)≤μ.
We will apply this general result in Sections 3 and 4 to obtain consistency results.
Definition 2**.**
Let ⟨P,≤P,\mathbbm1P⟩ and ⟨Q,≤Q,\mathbbm1Q⟩ be notions of forcing.
We will write ⟨P,≤P,\mathbbm1P⟩⊆c⟨Q,≤Q,\mathbbm1Q⟩ if the following conditions are satisfied:
- (1)
\mathbbm1P=\mathbbm1Q;
2. (2)
P⊆Q;
3. (3)
≤P=≤Q∩(P×P);
4. (4)
for any p,p′∈P, p⊥Pp′⟺p⊥Qp′;
5. (5)
if A⊆P is any maximal antichain in ⟨P,≤P,\mathbbm1P⟩, then A remains a maximal antichain in ⟨Q,≤Q,\mathbbm1Q⟩.
The relation ⟨P,≤P,\mathbbm1P⟩⊆c⟨Q,≤Q,\mathbbm1Q⟩ is usually expressed by saying that ⟨P,≤P,\mathbbm1P⟩ is a complete suborder of ⟨Q,≤Q,\mathbbm1Q⟩.
We also usually abuse notation and simply write P⊆cQ or say that P is a complete suborder of Q.
It is clear that ⊆c is a transitive relation.
The following simple fact will be useful.
Lemma 3**.**
Let ⟨P,≤P,\mathbbm1P⟩, ⟨Q,≤Q,\mathbbm1Q⟩, and ⟨R,≤R,\mathbbm1R⟩ be any forcing notions.
If P⊆cQ, then P×R⊆cQ×R.
Proof.
Points (1)–(4) of Definition 2 are clear.
For (5), consider any ⟨q,r⟩∈Q×R.
Since P⊆cQ, there exists p∈P with the property that ∀p′≤Pp[p′⊥Qq].
Now ⟨p,r⟩∈P×R.
Moreover if ⟨p′,r′⟩ is any condition such that ⟨p′,r′⟩≤P×R⟨p,r⟩, then ⟨p′,r′⟩⊥Q×R⟨q,r⟩.
This implies (5).
∎
The notion of an indecomposable filter was first considered by Prikry [7] and investigated by many other afterwards.
Ben-David and Magidor [3] showed that it is consistent relative to a supercompact cardinal that uniform ℵn-indecomposable ultrafilters can exist on ℵω+1 for 0<n<ω.
This is the key combinatorial notion needed for our proofs.
Definition 4**.**
Let κ and λ be infinite cardinals.
A filter F on λ is said to be κ-indecomposable if whenever ⟨Yξ:ξ<κ⟩ is a partition of λ (i.e. λ=⋃ξ<κYξ and ∀ζ<ξ<κ[Yζ∩Yξ=0]), then there exists T⊆κ such that ∣T∣<κ and ⋃ξ∈TYξ∈F.
We next introduce a technical combinatorial condition on a forcing notion P involving several other parameters.
In Section 3 it will be proved that forcing notions of the form Fn(I,J,λ) and products of forcing notions of this form satisfy this combinatorial condition for a suitable choice of the other parameters.
In this section, we will prove that if P satisfies the combinatorial condition for some choice of the other parameters, then P forces that the ultrafilter number at one of these parameters is bounded by another parameter.
Definition 5**.**
Let ⟨P,≤P,\mathbbm1P⟩ be a forcing notion.
We say that ⟨P,≤P,\mathbbm1P⟩ has a (λ,κ,μ,D)-filtration if there exists a sequence ⟨Pα:α<μ⟩ satisfying the following:
- (1)
λ,κ, and μ are infinite cardinals satisfying λ<cf(μ)<κ<μ;
2. (2)
μ is a strong limit cardinal and λ<λ=λ;
3. (3)
D is a uniform cf(μ)-indecomposable filter on κ;
4. (4)
P is λ+-c.c. and ∀p∈P∃α<μ[p∈Pα];
5. (5)
for each α<μ, Pα⊆cP, and ∀ξ<α[Pξ⊆Pα];
6. (6)
for each α<μ, ∣Pα∣<μ.
Observe that there is no connection between P and the filter D.
In other words, we only need the existence of some uniform cf(μ)-indecomposable filter on κ.
Conditions (4)–(6) simply say that P is a λ+-c.c. poset which can be written as an increasing union of small complete subposets.
Actually the condition that Pα is a complete sub order of P for each α<μ is not necessary for the proof of our main results.
It is sufficient if each Pα is any sub order of P.
However Condition (5) is automatically satisfied in all of our applications.
Hence we have not sought to weaken it.
Lemma 6**.**
Let ⟨P,≤P,\mathbbm1P⟩ and ⟨R,≤R,\mathbbm1R⟩ be forcing notions.
Assume that λ,κ,μ, and D are so that ⟨P,≤P,\mathbbm1P⟩ has a (λ,κ,μ,D)-filtration.
If ∣R∣<μ and
[TABLE]
then P×R also has a (λ,κ,μ,D)-filtration.
Proof.
Fix ⟨Pα:α<μ⟩ witnessing that ⟨P,≤P,\mathbbm1P⟩ has a (λ,κ,μ,D)-filtration.
For each α<μ, let Qα=Pα×R.
We check that ⟨Qα:α<μ⟩ is a witness that P×R has a (λ,κ,μ,D)-filtration.
Indeed clauses (1)–(3) of Definition 5 only depend on λ,κ,μ, and D, which satisfy these clauses by hypothesis.
Also, by hypothesis P is λ+-c.c. and ⊩P“Rˇ is λˇ+-c.c.\@”.
It is a standard fact (e.g. Lemma 5.7 of [5]) that this implies that P×R is λ+-c.c.
Also if ⟨p,r⟩∈P×R, then there is α<μ with p∈Pα, whence ⟨p,r⟩∈Pα×R=Qα.
This verifies (4) of Definition 5.
Next for each α<μ, since Pα⊆cP, Qα=Pα×R⊆cP×R.
Also for each ξ<α, we have Qξ=Pξ×R⊆Pα×R=Qα because Pξ⊆Pα.
Finally, for each α<μ, ∣Qα∣=∣Pα×R∣<μ.
This concludes the verification.
∎
The next theorem shows that P forces u(κ) to be bounded by μ whenever P has a (λ,κ,μ,D)-filtration.
The proof is similar to the proof of Theorem 6 from [10], though our theorem below is formulated in a slightly more general context.
Theorem 7**.**
Let ⟨P,≤P,\mathbbm1P⟩ be a forcing notion.
Assume that λ,κ,μ, and D are so that ⟨P,≤P,\mathbbm1P⟩ has a (λ,κ,μ,D)-filtration.
Assume moreover that cf(κ)=κ.
Then P forces that every uniform ultrafilter on κ that extends D is generated by a set of size at most μ.
In particular, P forces that u(κ)≤μ.
Proof.
Let ⟨Pα:α<μ⟩ witness that ⟨P,≤P,\mathbbm1P⟩ has a (λ,κ,μ,D)-filtration.
For each α<μ, let Aα=Pαλ and let B=λ2.
Define Lα=Aα×B.
Then ∣Lα∣<μ because μ is a strong limit.
For any D∈D, define Lα,D={α}×{D}×LαD.
Again ∣Lα,D∣<μ, and so if L=⋃{Lα,D:⟨α,D⟩∈μ×D}, then ∣L∣≤μ.
Fix a strictly increasing cofinal sequence ⟨αi:i<cf(μ)⟩ in μ.
Suppose A˚ is any P-name such that ⊩PA˚⊆κ.
We will associate a member of L to A˚ as follows.
Since P is λ+-c.c., we can find for each δ<κ, sequences ⟨pA˚,δ,ε:ε<λ⟩ and τA˚,δ such that:
- (1)
⟨pA˚,δ,ε:ε<λ⟩∈Pλ and {pA˚,δ,ε:ε<λ} is a predense set in P;
2. (2)
τA˚,δ∈λ2 and for each ε<λ, (pA˚,δ,ε⊩δ∈A˚)⟺(τA˚,δ(ε)=1) and (pA˚,δ,ε⊩δ∈/A˚)⟺(τA˚,δ(ε)=0).
For each δ<κ and ε<λ, there is i(A˚,δ,ε)<cf(μ) with pA˚,δ,ε∈Pαi(A˚,δ,ε).
Since λ<cf(μ), for each δ<κ, there exists i(A˚,δ)<cf(μ) which satisfies ∀ε<λ[i(A˚,δ,ε)<i(A˚,δ)].
Now for each i<cf(μ), put Yi={δ<κ:i=i(A˚,δ)}.
Then ⟨Yi:i<cf(μ)⟩ is a partition of κ.
Since D is cf(μ)-indecomposable, there is a set T⊆cf(μ) such that ∣T∣<cf(μ) and ⋃i∈TYi∈D.
Define D(A˚)=⋃i∈TYi.
cf(μ) being a regular cardinal, there is i(A˚)<cf(μ) with T⊆i(A˚).
Define α(A˚)=αi(A˚)∈μ.
Note that if δ∈D(A˚), then i(A˚,δ)<i(A˚), and so for any ε<λ, i(A˚,δ,ε)<i(A˚,δ)<i(A˚), whence pA˚,δ,ε∈Pαi(A˚,δ,ε)⊆Pαi(A˚,δ)⊆Pαi(A˚)=Pα(A˚).
Thus we conclude that for each δ∈D(A˚), ⟨⟨pA˚,δ,ε:ε<λ⟩,τA˚,δ⟩∈Pα(A˚)λ×λ2=Aα(A˚)×B=Lα(A˚).
Therefore l(A˚)∈{α(A˚)}×{D(A˚)}×Lα(A˚)D(A˚)=Lα(A˚),D(A˚)⊆L, where
[TABLE]
Claim 8**.**
Suppose A˚ and B˚ are P-names such that ⊩PA˚⊆κ and ⊩PB˚⊆κ.
Suppose l=⟨α,D,⟨⟨⟨pδ,ε:ε<λ⟩,τδ⟩:δ∈D⟩⟩ is a member of L such that l=l(A˚)=l(B˚).
Then ⊩PA˚∩D=B˚∩D.
Proof.
Suppose not.
Then, without loss of generality, there exists p∈P and δ∈D such that p⊩Pδ∈A˚∖B˚.
Since δ∈D=D(A˚)=D(B˚), τA˚,δ=τδ=τB˚,δ and ⟨pA˚,δ,ε:ε<λ⟩=⟨pδ,ε:ε<λ⟩=⟨pB˚,δ,ε:ε<λ⟩.
In particular, {pδ,ε:ε<λ} is a predense set.
Choose ε<λ and q∈P with q≤Pp,pδ,ε.
It follows from (2) that pδ,ε⊩Pδ∈A˚, and hence τA˚,δ(ε)=1.
Similarly, pδ,ε⊩Pδ∈/B˚, and hence τB˚,δ(ε)=0.
However this contradicts τA˚,δ(ε)=τδ(ε)=τB˚,δ(ε).
∎
Suppose G is a (V,P)-generic filter.
Since P is λ+-c.c. and cf(κ)=κ≥λ+, κ remains a regular cardinal in V[G].
Suppose U is any uniform ultrafilter on κ extending D.
Define
[TABLE]
For each l∈K choose A˚l∈VP such that (⊩PA˚l⊆κ)V, l(A˚l)=l, and A˚l[G]∈U.
Define X={D∩A˚l[G]:⟨D,l⟩∈D×K}.
Note that if ⟨D,l⟩∈D×K, then D∈U because U extends D, and A˚l[G]∈U by choice of A˚l, whence D∩A˚l[G]∈U.
Thus X⊆U.
Furthermore ∣X∣≤μ (note that μ remains a cardinal in V[G]).
Claim 9**.**
X* generates U.*
Proof.
Since X⊆U, {B⊆κ:∃A∈X[A⊆B]}⊆U.
Suppose that C∈U.
Find C˚∈VP with C=C˚[G].
Also find p∈G so that (p⊩PC˚⊆κ)V.
In V, applying the maximal principle, we can find a P-name B˚ so that ⊩PB˚⊆κ and p⊩PB˚=C˚.
Let l=l(B˚)∈L.
In V[G], B˚[G]=C˚[G]=C∈U, and B˚ is a witness that l∈K.
Hence A˚l is defined and l(A˚l)=l=l(B˚).
It follows from Claim 8 that for some D∈D, A˚l[G]∩D=B˚[G]∩D=C∩D.
Since ⟨D,l⟩∈D×K, D∩A˚l[G]∈X.
So C∩D∈X, and since C∩D⊆C, C∈{B⊆κ:∃A∈X[A⊆B]}.
Thus U={B⊆κ:∃A∈X[A⊆B]}, as needed.
∎
This proves that U is generated by a set of size at most μ.
Since D is a uniform filter on κ, there is at least one uniform ultrafilter on κ extending D.
Therefore u(κ)≤μ in V[G].
∎
The proof of Theorem 7 shows that the results in Section 4 of [10] can also be obtained from the assumption that P has a (λ,κ,μ,D)-filtration.
Note also that the condition that Pα⊆cP for every α<μ is not used in the proof of Theorem 7.
Hence this theorem can be proved under a weaker formulation of Definition 5.
We leave it to the interested reader to formulate the optimal hypotheses under which the proof of Theorem 7 can be carried out.
3. Small ultrafilter number at the continuum
Several posets of the form Fn(I,J,χ) as well as products of such posets have a (λ,κ,μ,D)-filtration for suitable values of the cardinals λ,κ, and μ, and any uniform cf(μ)-indecomposable filter D on κ.
Lemma 10**.**
Suppose that λ,κ,μ, and D satisfy (1)–(3) of Definition 5.
Then Fn(μ×λ,2,λ) has a (λ,κ,μ,D)-filtration.
Proof.
For each α<μ, define Pα to be Fn(α×λ,2,λ).
We will check that the sequence ⟨Pα:α<μ⟩ witnesses that there is a (λ,κ,μ,D)-filtration.
Clauses (1)–(3) of Definition 5 are already satisfied by hypothesis.
It is well-known (see Lemma 6.10 of [5]) that Fn(μ×λ,2,λ) is (2<λ)+-c.c.
This means that Fn(μ×λ,2,λ) is (λ)+-c.c. because λ<λ=λ.
Also for each p∈Fn(μ×λ,2,λ), there exists α<μ with p∈Fn(α×λ,2,λ)=Pα because λ<cf(μ).
Next for any α<μ, α×λ⊆μ×λ, and so Pα=Fn(α×λ,2,λ)⊆cFn(μ×λ,2,λ).
Similarly if ξ<α, then Pξ=Fn(ξ×λ,2,λ)⊆cFn(α×λ,2,λ)=Pα.
Finally for each α<μ, ∣Pα∣<μ because μ is a strong limit cardinal.
Therefore (1)–(6) of Definition 5 are satisfied.
∎
Lemma 11**.**
Suppose that λ,κ,μ, and D satisfy (1)–(3) of Definition 5.
Suppose moreover that θ is an infinite cardinal such that θ<λ, θ is regular, 2<θ=θ, κθ=κ, and cf(κ)=κ.
Let P=Fn(μ×λ,2,λ) and R=Fn(κ×θ,2,θ).
Then P×R has a (λ,κ,μ,D)-filtration.
Proof.
We will check the hypotheses of Lemma 6.
Firstly, by Lemma 10 P has a (λ,κ,μ,D)-filtration.
Using the fact that μ is a strong limit cardinal, it is easy to verify that ∣R∣<μ.
Finally suppose that G is (V,P)-generic.
Since P is λ-closed in V, it follows that R is still Fn(κ×θ,2,θ) as calculated in V[G].
Similarly in V[G], 2<θ=θ holds, and so R is θ+-c.c. in V[G].
Therefore in V, ⊩P“Rˇ is λˇ+-c.c.\@”.
Hence P×R also has a (λ,κ,μ,D)-filtration by Lemma 6.
∎
We are now able to show that if there is a measurable cardinal κ, then for any regular cardinal θ<κ satisfying 2<θ=θ, it is possible to force u(2θ)<22θ.
Theorem 12**.**
Suppose that θ, λ,κ, and μ are infinite cardinals satisfying θ<λ<cf(μ)<κ<μ, that θ is regular, and that 2<θ=θ.
Assume also that μ is a strong limit cardinal and that λ<λ=λ.
Suppose moreover that κ is measurable and that D is a normal measure on κ.
Then there is a cofinality preserving extension in which 2θ=κ, u(κ)≤μ, and 2κ=μκ>μ.
Proof.
Note that since κ is measurable and D is a normal measure on κ, cf(κ)=κ, κθ=κ, and D is a uniform cf(μ)-indecomposable ultrafilter on κ.
Let P=Fn(μ×λ,2,λ) and R=Fn(κ×θ,2,θ).
It is well-known that P×R is cofinality preserving.
By Lemma 11, P×R has a (λ,κ,μ,D)-filtration.
Suppose H is a (V,P×R)-generic filter.
By Theorem 7, u(κ)≤μ holds in V[H].
By standard arguments (see proof of Theorem 6.18 in [5]), V[H] satisfies 2θ=κ and 2λ=μ.
Since cofinalities and cardinals are preserved, we have 2κ=(2λ)κ=μκ≥μcf(μ)>μ.
∎
Corollary 13**.**
It is consistent relative to a measurable cardinal that there is a uniform ultrafilter on the reals which is generated by fewer than 22ℵ0 many sets.
Proof.
Apply Theorem 12 with θ=ω.
∎
Note that the fact that μ is a singular cardinal with cofinality less than κ plays a crucial role in these proofs.
In Corollary 13, if we assume that GCH holds in the ground model and pick the minimal values of λ and μ required to run the proof, then in the resulting model, 2ℵ0=κ and 22ℵ0>κ+ℵ2.
4. Small ultrafilter number at ℵω+1
The continuum is a weakly inaccessible cardinal in the model constructed in the previous section.
In this section we will get a model where u(κ)<2κ for a κ which is well below the first weakly inaccessible cardinal, namely ℵω+1.
However we must start with a supercompact cardinal.
Thomas and Shelah [10] considered the following statement for regular cardinals κ:
[TABLE]
Here Sym(κ) is the symmetric group on κ and S(Δ) denotes the pointwise stabilizer of the set Δ⊆κ.
It turns out that (∗ℵ0) is a theorem of ZFC.
In [10], Shelah and Thomas used a supercompact cardinal to produce a model where (∗ℵω+1) fails.
We show below that u(ℵω+1)<2ℵω+1 in this model constructed by Shelah and Thomas, and moreover our proof is quite similar to their argument that (∗ℵω+1) fails.
However we are not aware of any direct connection between (∗ℵω+1) and u(ℵω+1).
It would be especially interesting if the failure of (∗κ) implied u(κ)<2κ for some uncountable regular κ.
In order to apply Theorem 7 with κ=ℵω+1, it must be possible to find uniform filters on ℵω+1 that are ℵn-indecomposable for some n<ω.
A by now classical theorem of Ben-David and Magidor [3] says that it is consistent relative to a supercompact cardinal to have a uniform ultrafilter on ℵω+1 which is ℵn-indecomposable for all 0<n<ω.
Theorem 14** (Ben-David and Magidor [3]).**
Assume that there is a supercompact cardinal.
There is a forcing extension in which GCH holds and there is a uniform ultrafilter on ℵω+1 which is ℵn-indecomposable for all 0<n<ω.
The proof of the next theorem is now just a matter of combining Theorem 14 with Theorem 7 and Lemma 10.
Theorem 15**.**
Assume that there is a supercompact cardinal.
Then there is a forcing extension in which u(ℵω+1)<2ℵω+1.
Proof.
By Theorem 4, we can pass to a forcing extension V′ in which GCH holds and there exists a uniform ultrafilter D on ℵω+1 which is ℵn-indecomposable for all 0<n<ω.
Working in V′, put κ=ℵω+1 and choose λ and μ so that (1)–(3) of Definition 5 are satisfied.
In fact, since GCH holds in V′, we can simply choose λ=ℵ0 and μ=ℵω1.
By Lemma 10, P=Fn(μ×λ,2,λ) has a (λ,κ,μ,D)-filtration.
Let G be (V′,P)-generic.
By standard arguments, 2λ=μ in V′[G].
By Theorem 7 and by the fact the all cofinalities and cardinals are preserved between V′ and V′[G], ℵω+1=κ, u(κ)≤μ, and 2κ=(2λ)κ=μκ≥μcf(μ)>μ in V′[G].
∎
The reader will again notice the crucial role played by the fact that μ is a singular cardinal whose cofinality is smaller than κ.
Choosing the minimal values for λ and μ that are allowed by the proof, as we have done above, still results in a model where 2ℵω+1>ℵω1.
This is very unlikely to be sharp.
It ought to be possible to produce models where u(ℵω+1)=ℵω+2<ℵω+3=2ℵω+1.
It is not difficult to combine the proof of Theorem 15 with the proof of Theorem 12 to produce a model where 2ℵ0=ℵω+1 and u(ℵω+1)<2ℵω+1.
One would then need to choose μ to be ℵω2 (or bigger).
Details are left to the reader.
5. Remarks and Questions
As mentioned in Section 1, the models constructed in this paper have several features that are likely to be accidental rather than essential.
The first such feature is the use of large cardinals.
Question 16**.**
What is the consistency strength of the inequality u(2ℵ0)<22ℵ0 or of u(ℵω+1)<2ℵω+1?
We are not aware that these statements have any large cardinal strength.
The next question is about how large 2κ needs to be for u(κ)<2κ to be consistent.
We pose this question in a very weak form below.
Question 17**.**
Is the following statement consistent relative to large cardinals: There exists an uncountable regular cardinal κ such that κ is smaller than the first weakly inaccessible cardinal and u(κ)=κ+<κ++=2κ?
Finally of course the method in this paper is not applicable to any of the ℵn.
Question 18**.**
Is it consistent to have u(ℵn)<2ℵn, for some 0<n<ω?