This paper demonstrates the consistent existence of a singular uncountable cofinality cardinal with a weakly inaccessible power set, where all intermediate regular cardinals are ultrafilter characters, advancing set theory understanding.
Contribution
It establishes the consistent existence of such a cardinal with specific ultrafilter and cardinal properties, linking ultrafilter characters to large cardinal hypotheses.
Findings
01
Existence of a singular cardinal with uncountable cofinality and a weakly inaccessible power set.
02
All regular cardinals between the singular and its power set are ultrafilter characters.
03
Provides a new consistency result connecting ultrafilters and large cardinals.
Abstract
We prove that consistently there is a singular cardinal κ of uncountable cofinality such that 2κ is weakly inaccessible, and every regular cardinal strictly between κ and 2κ is the character of some uniform ultrafilter on κ.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Homotopy and Cohomology in Algebraic Topology · Rings, Modules, and Algebras
Full text
Ultrafilters on singular cardinals of uncountable cofinality
We prove that consistently there is a singular cardinal κ of
uncountable cofinality such that 2κ is weakly inaccessible, and every
regular cardinal strictly between κ and 2κ is the character of some
uniform ultrafilter on κ.
Cummings was partially supported by the National Science Foundation, DMS-1500790.
1. Introduction
The cardinal invariants of the continuum are a family of cardinal numbers which
measure structural properties of the continuum.
Many of them are defined
from ωω with the eventual domination ordering ≤∗, [ω]ω with the almost inclusion
ordering ⊆∗ or R with the null and meagre ideals,
Well known examples include:
•
b, the least size of an unbounded subset of (ωω,≤∗).
•
d, the least size of a cofinal subset of (ωω,≤∗).
•
s, the least size of a splitting family in [ω]ω, that is a family
S such that for every A∈[ω]ω there is B∈S with A∩B and A∖B both
infinite.
•
u, the least size of a family in [ω]ω that generates a non-principal ultrafilter.
Assuming CH makes every reasonable cardinal invariant take the value ω1, while assuming MA makes every
reasonable cardinal invariant take the value 2ℵ0. A substantial research program in the set theory
of the continuum has been to prove ZFC results which constrain the values of one or more cardinal invariants,
either absolutely or in terms of other cardinal invariants, and
complementary consistency results.
One natural direction for generalisation is to replace ω by an uncountable regular cardinal κ.
Some results generalise readily but new phenomena occur: notably the value of κ<κ is sometimes
important, cardinal invariants associated with κ and κ+ can interact, and while the generalised
invariants are typically defined using the co-bounded filter on κ the club filter also plays a major role.
We can also replace ω by a singular cardinal κ. Various issues arise here which are not present
for regular κ: in general 2<κ and κ<κ may not be equal, it’s always true that
κ<κ>κ, the cobounded and club filters are only cf(κ)-complete and the
eventual domination and eventual inclusion orderings are less well-behaved. Nevertheless, Zapletal [16] proved
interesting results about the invariant s(κ) in this setting.
When κ is an uncountable cardinal, the correct
generalisation u(κ) of the cardinal
invariant u involves uniform ultrafilters on κ, since a non-uniform ultrafilter on κ is
morally an ultrafilter on a smaller cardinal.
Definition 1.1**.**
Let κ be an infinite cardinal.
•
If U is a uniform ultrafilter on κ, then a base for U
is a set U′⊆U such that for every X∈U there is Y∈U′ with
Y⊆∗X.
•
The characterCh(U) of a uniform ultrafilter U on κ is the least
size of a base for U.
•
The character spectrumSpχ(κ) of κ is the set of characters
of uniform ultrafilters on κ.
•
u(κ)* is the minimum element of Spχ(κ).*
It is not hard to see that κ<u(κ)≤2κ, so that for
κ singular and strong limit we can only obtain models with u(κ)<2κ
by violating the Singular Cardinals Hypothesis.
There are several results about u(κ) and Spχ(κ) when κ is singular strong limit
in the literature:
•
(Garti and Shelah [4, Corollary 1.5]) Let κ be supercompact, let GCH hold and let λ<κ be regular.
Then there are cardinal-preserving generic extensions in which cf(κ)=λ, 2κ is arbitrarily
large and u(κ)=κ+.
•
(Garti, Magidor and Shelah [5, Theorem 9])
Let κ be strong,111The authors say supercompact but their proof uses only that κ is strong
with measurable cardinals above it.
let GCH hold
and let ⟨μi:i<j⟩ be an increasing sequence
of measurable cardinals above κ. Let ⟨χi:i<j⟩ be an increasing sequence of
regular cardinals above κ with χi≤μi<χi+1. Then there is a generic extension
in which κ is a singular strong limit cardinal of cofinality ω, the cardinals
χi remain regular, and {χi:i<j}⊆Spχ(κ).
•
(Garti, Gitik and Shelah [3]) It is consistent that uℵω<2ℵω
with ℵω strong limit.
•
(Gitik [6]) It is consistent that a uniform ultrafilter over a singular cardinal can have singular character.
Gitik [7, 8] has also proved a number of interesting results about the related
notion of “strongly uniform ultrafilter” and the related invariants.
In this paper we extend the results of [5] to the situation where
the singular cardinal κ has uncountable cofinality (see Theorems 1 and
2 in Section 7).
Our main tool is a variant of Merimovich’s
“extender-based Magidor-Radin forcing” [12], which has been modified
to exert finer control over the cardinal arithmetic and PCF structure of the
generic extension.
A key point is to construct certain PCF-theoretic scales in the extension,
defined on reduced products of measurable cardinals where GCH holds and the
corresponding reduced products of their successors. The arguments are somewhat
parallel to those from [5] but there are new difficulties,
in particular:
•
By Silver’s theorem and the subsequent work of Galvin and Hajnal, a severe failure
of GCH at a singular strong limit cardinal κ of uncountable cofinality implies
severe failure of GCH at almost every smaller cardinal. This is reflected in the structure
of the forcing, and makes it harder to find suitable sets of cardinals on which to define
our scales.
•
The arguments of [5] use an extender-based forcing built from
a single extender, and hinge on some analysis of the PCF structure in the corresponding extension
due to Merimovich [11]. The PCF analysis is substantially harder
for us: there are many extenders involved, and there are
various difficulties whose root cause is that the forcing conditions are much more
complex objects than in the one-extender case.
See the beginning of Section 6
for a more detailed discussion of the issues that arise in the scale construction.
Here is an outline of the rest of the paper:
•
In Section 2, we review the construction of uniform ultrafilters
with specified characters from appropriate scales.
•
In Section 3, we give some background on Radin forcing and
the one-extender form of extender-based forcing, intended to motivate the extender-based
Radin forcing of the following section.
•
In Section 4 we define a version of extender-based Radin forcing, and discuss
its basic properties and its relationship with the construction of [12].
•
In Section 5, we construct some finite iterated ultrapowers involving extenders,
which will be useful in the scale analysis of the following section.
•
In Section 6, we construct a family of scales in the generic extension
by the forcing from Section 4.
•
In Section 7, we state and prove our main results, Theorems
1 and 2.
Notation**.**
Our notation is mostly standard. The arguments involve various manipulations with sequences, and we use the following conventions:
•
Sequences are generally written with either a bar or an arrow over them, for example uˉ or ν.
•
The concatenation of two sequences σ and τ is written σ⌢τ. The result of prepending (resp. appending)
an object x to σ is ⟨x⟩⌢σ (resp. σ⌢⟨x⟩).
•
If σ is a sequence and i≤lh(σ), then σ↾i is the restricted sequence
⟨σj:j<i⟩.
•
If ν is a sequence of (possibly partial) functions on some domain D, and d⊆D, then
ν↾d is the sequence of restricted functions ⟨νi↾d:i<lh(ν)⟩.
In principle this could clash with the notation “σ↾i” as above, but this will not happen here.
•
Restriction has a higher precedence than concatenation, so that for example
⟨κ⟩⌢U↾i is the concatenation of the sequences ⟨κ⟩ and
U↾i.
2. Generating ultrafilters
We need some machinery for generating ultrafilters on singular cardinals. We use results from
[4] and [5],
which we sketch here to make this paper more self-contained.
Definition 2.1**.**
Let κ be a regular cardinal, and let U be a uniform ultrafilter U.
An almost-decreasing generating sequence for U is a ⊆∗-decreasing sequence
⟨Ai:i<θ⟩ such that {Ai:i<θ} forms a base for U.
It is easy to see that:
•
If U has an almost-decreasing generating sequence, then it has such a sequence
⟨Ai:i<θ⟩ such that θ=cf(θ)>κ. Moreover, in this situation θ=Ch(U).
•
If U has an almost-decreasing generating sequence then U is κ-complete, in particular
κ is a measurable cardinal.
•
If κ is measurable, 2κ=κ+ and U is a normal measure on κ, then
U has an almost decreasing generating sequence of length κ+.
Remark 2.2**.**
It is possible to produce measures on κ with almost decreasing generating
sequences of a prescribed length. The basic idea is to start with κ which is indestructibly
supercompact and regular θ>κ+, iterate the “long Prikry forcing” (also known as
“long Mathias forcing”) at κ for θ steps,
and then do a delicate argument to produce a measure U such that for many i<θ
we have that U∩V[Gi] is the measure which was used at stage i and the generic subset
added at stage i is in U. See for example [2] or [1] for constructions of this type:
the posets iterated in these papers are elaborations of long Prikry forcing, but the arguments
work equally well for iterating long Prikry forcing.
We recall the concept of a scale from PCF theory. We only need this concept in its simplest form.
Definition 2.3**.**
Let λ be a singular cardinal with cf(λ)=τ, and let
⟨λi:i<τ⟩ be an increasing sequence of regular cardinals which
is cofinal in λ. A scale of length ν in ∏i<τλi
is a sequence ⟨gη:η<ν⟩ of functions
which is increasing and cofinal in (∏i<τλi,<∗), where <∗
is the eventual domination ordering.
Remark 2.4**.**
Typically the length ν of a scale as above is a regular cardinal,
and this will always be the case in this paper. It is easy to see that λ<ν≤2λ.
The following result is a very mild generalisation of [5, Claim 4]
and [4, Theorem 1.4]
Lemma 2.5**.**
Suppose κ is a singular cardinal such that cf(κ)=ρ and
2ρ≤κ. Let ⟨μi:i<ρ⟩ be an increasing and cofinal sequence
in κ such that each μi is measurable and carries a measure Ui which is
generated by an almost decreasing sequence of regular length θi. Let
⟨fα:α<σ⟩ be a scale in ∏i<ρμi
with σ regular and κ<σ, and let ⟨gβ:β<τ⟩ be a scale
in ∏i<ρθi with τ regular and σ≤τ.
Then there exists a uniform ultrafilter U on κ such that Ch(U)=τ.
Proof.
We may assume that ρ<μ0.
Let μi∗=supi′<iμi′ for i<ρ, and note that
μi∗<μi because i<ρ<μ0≤μi and μi, being measurable, is regular.
Then the sequence ⟨μi∗:i<ρ⟩ is continuous, increasing
and cofinal in ρ. Clearly μ0∗=0 and μi+1∗=μi,
so the cardinal κ is the union of pairwise disjoint non-empty intervals of the form
[μi∗,μi) for i<ρ.
For each i<ρ, fix an almost decreasing generating sequence ⟨Aηi:η<θi⟩
for Ui such that Aηi⊆[μi∗,μi) for all η<θi.
Fix a uniform ultrafilter E on ρ. We use the data f, g, A and E to define a
uniform ultrafilter
U on κ with a small generating set.
Given X∈E, α<σ and β<τ, let
[TABLE]
Note that YX,α,β∩[μi∗,μi)=Agβ(i)i∖fα(i)
for i∈X and YX,α,β∩[μi∗,μi)=∅ for i∈/X.
Claim 2.6**.**
The sets YX,α,β form a filter base of size τ, which generates a uniform filter.
Proof.
Since 2ρ≤σ≤τ, it is immediate that ∣E×σ×τ∣=τ.
Let n<ω, let γ<κ and let (Xk,αk,βk)∈E×σ×τ for k<n. Let
i∈⋂k<nXk with μi>γ. Note that each
of the sets Agβk(i)i∖fαk(i) is in Ui,
and choose η in their intersection with η>γ. Then
clearly η∈⋂k<nYXk,αk,βk.
∎
Claim 2.7**.**
The sets YX,α,β generate an ultrafilter.
Proof.
Let Y⊆κ. Either {i:Y∩μi∈Ui}∈E or
{i:Yc∩μi∈Ui}∈E, so replacing Y by Yc if necessary we may assume that
X0∈E, where X0={i:Y∩μi∈Ui}. For each i∈X0, let g(i)<θi
be such that Ag(i)i⊆∗Y∩μi, and note that
Aηi⊆∗Y∩μi for all η≥g(i). Since
⟨gβ:β<τ⟩ is a scale, there exist β<τ and i0<ρ such that
g(i)<gβ(i) for all i∈X0∖i0.
Let X1=X0∖i0. For every i∈X1 we have
Agβ(i)i⊆∗Ag(i)i⊆∗Y∩μi,
so we may choose f(i)<μi such that Agβ(i)i∖f(i)⊆Y∩μi. Since ⟨fα:α<σ⟩ is a scale, there exist α<σ and i1 with
i0<i1<ρ such that f(i)<fα(i) for all i∈X1∖i1. If we let X=X1∖i1 then X∈E
and Agβ(i)i∖fα(i)⊆Y∩μi
for all i∈X, so by definition YX,α,β⊆Y.
∎
Let U be the ultrafilter generated by the sets YX,α,β.
From the proof of the last claim, we see that Y∈U if and only if
YX,α,β⊆Y for some X,α,β; the proof also shows that
α and β may be chosen arbitrarily large.
Claim 2.8**.**
The character of U is exactly τ.
Proof.
Suppose for a contradiction that U′ is a base for U with ∣U′∣<τ.
Fix X∈E and α<σ, and find Y′∈U′ and i0<ρ such that
Y′∖μi0⊆YX,α,β for unboundedly many β<τ. Find
X0,α0,β0 such that YX0,α0,β0⊆Y′∖μi0, so that
YX0,α0,β0⊆YX,α,β for unboundedly many β<τ.
For all i with i0<i<ρ, find Di⊆Agβ0(i)i such that
Di∈Ui and Agβ0(i)i∖Di is unbounded, and then g(i)>gβ0(i)
such that Ag(i)i⊆∗Di; note that if η>g(i) then
Aηi⊆∗Di, so that Agβ0(i)i∖Aηi is unbounded.
Choose β>β0 such that g<∗gβ and YX0,α0,β0⊆YX,α,β.
Choose i∈X0∩X such that g(i)<gβ(i). Finally choose
δ∈Agβ0(i)i∖Agβ(i)i such that δ>fα0(i),fα(i).
YX0,α0,β0∩[μi∗,μi)=Agβ0(i)i∖fα0(i) and
similarly
YX0,α,β∩[μi∗,μi)=Agβ(i)i∖fα(i).
So δ∈YX0,α0,β0 and δ∈/YX,α,β, contradicting the
choice of β.
∎
As we mentioned in the introduction, the proof of our main result uses a form of extender-based Radin forcing.
In this short section we describe a simple form of Radin forcing (due in this version to Mitchell [13], building on
work of Radin [14])
and a simple form of extender-based forcing (due in this version to Gitik and Merimovich [10, Section 3],
building on work
of Gitik and Magidor [9]). The intention is to help the reader who is less familiar with this type of
forcing construction to see the wood for the trees in the construction of Section 4. We encourage the expert reader
to skip this section and go straight to Section 4.
3.1. Radin forcing
Let κ be a measurable cardinal, let ρ<κ be regular and uncountable
and let U=⟨Ui:i<ρ⟩ be a sequence of normal measures on κ which is
Mitchell increasing,
that is ⟨Ui:i<j⟩∈Ult(V,Uj) for all j<ρ.
Let uˉ=⟨κ⟩⌢U. For each i<ρ define a
measure Wi={X:⟨κ⟩⌢U↾i∈jUi(X)},
and note that Wi concentrates on sequences of the form
uˉ′=⟨κ′⟩⌢⟨Ui′′:i′<i⟩
where κ′<κ and ⟨Ui′′:i′<i⟩
is a Mitchell increasing sequence of measures on κ′. Let W=⋂i<ρWi,
so that W is a κ-complete filter.
The associated Radin forcing has conditions of the form
[TABLE]
where uˉn=uˉ and An∈W. For k<n,
uˉk is a typical object for some measure Wi of the sort described above.
If lh(uˉk)=1 then Ak=∅, otherwise Ak is a large set for the
filter derived from uˉk in the same way that W was derived from uˉ.
The sequence of cardinals (uˉk)0 is strictly increasing with k.
A condition can be extended by performing a finite series of “elementary” extensions.
One type of elementary extension is simply to shrink some Ai. The other
is to interpolate a new pair (vˉ,B) where for some i we have
vˉ∈Ai, B⊆Vv0∩Ai, and (ui−1)0<v0 in the case when i>0.
The construction of the filter derived from uˉi when lh(uˉi)>1 assures that there is a large
set of candidates for v.
The generic object for this forcing is a ρ-sequence ⟨uˉ(i):i<ρ⟩
where the sequence ⟨uˉ(i)0:i<ρ⟩ is increasing, continuous and cofinal in κ.
A condition ⟨(uˉ0,A0),…(uˉn,An)⟩ carries the information that uˉi
must appear on the generic sequence, and that the remaining points on the generic sequence must be drawn from the appropriate
large set Ai. The forcing is κ+-cc and satisfies a version of the Prikry lemma, asserting that
any question can be decided by shrinking large sets. The forcing preserves cardinals but changes many cofinalities.
We note a point which is salient later for the forcing of Section 4. Having n>0 and
lh(uˉ0)=1+η, for some η with 0<η<ρ, is not enough on its own to ensure that
uˉ0 appears as uˉ(ωη) on the generic sequence:
although the filter derived from uˉ0 concentrates on shorter
sequences, A0 may contain sequences of length at least 1+η.
By shrinking A0 to eliminate such sequences we may obtain
a condition which forces uˉ(ωη) to be uˉ0.
Remark 3.1**.**
The forcing we described here is a very simple special case of Mitchell’s forcing from [13],
which (in common with other forms of Radin forcing) permits the defining sequence of measures to be much longer than
the common critical point.
3.2. Extender-based forcing with one extender
Let j:V→M be an embedding with crit(j)=κ and κM⊆M,
and let λ be a cardinal with κ+≤λ<j(κ).
Let d∈[κ,λ)
with κ∈d and ∣d∣≤κ.
Define
E(d)={X:(j↾d)−1∈j(X)}. E(d) is a measure and
concentrates on the set of d-objects,
where a d-object is an order-preserving partial function ν from d to κ such that
κ∈dom(ν) and ∣dom(ν)∣≤ν(κ)<κ.
If μ and ν are d-objects then μ<ν if and only if dom(μ)⊆dom(ν)
and μ(α)<ν(α) for all α∈dom(μ). A d-tree is
a tree T of finite increasing sequences of d-objects, such that for every node μ∈T the
set {ν:μ⌢⟨ν⟩∈T} is E(d)-large.
If d⊆d′ then it is easy to see that the map ν↦ν↾d is
a map from the set of d′-objects to the set of d-objects, and projects E(d′) to E(d).
If T is a d′-tree then we abuse notation by writing
T↾d={μ↾d:μ∈T}.
Conditions in the associated extender based forcing are pairs (f,A) where
f is a function with dom(f)=d for some set d as above, f(α) is a finite increasing sequence
of elements of κ for each α∈dom(f), and A is a d-tree.
A condition can be extended by performing a finite series of “elementary” extensions.
One type of elementary extension is to extend (f,A) to (f′,A′) where
f′↾dom(f)=f and A′↾dom(f)⊆A.
The other is to choose some ⟨ν⟩∈A such that
f(α)⌢⟨ν(α)⟩ is increasing for all α∈dom(ν),
replace f(α) by f(α)⌢⟨ν(α)⟩ for α∈dom(ν),
and replace A by A⟨ν⟩={μ:⟨ν⟩⌢μ∈A}.
The generic object for this forcing has the form ⟨fα:κ≤α<λ⟩
where each fα is an increasing ω-sequence and is cofinal in κ.
The forcing is κ++-cc and satisfies a version of the Prikry lemma, asserting that
any question can be decided by forming an elementary extension of the first type decribed above. The forcing adds no bounded subsets of κ,
preserves all cardinals, and changes the cofinality of κ to ω.
Remark 3.2**.**
The extender based Radin forcing which we describe in the next section is a
common generalisation of
the two forcings we have just described. It changes the cofinality of κ to ρ while adding
λ many cofinal ρ-sequences. This kind of result was first achieved by Segal [15],
with an extender-based Magidor forcing.
Remark 3.3**.**
The forcing from Section 3.2 is closely related to a forcing of Gitik and Magidor [9].
The main difference is that Gitik and Magidor’s forcing is based on a Rudin-Keisler directed sequence of
ultrafilters ⟨Uν:κ≤ν<λ⟩, where Uν={X⊆κ:ν∈j(X)}.
A condition in their forcing is of the form (f,A)
where f is as above and A is a tree of finite increasing sequences of elements of κ
having Uν-large branching for a particular “maximum coordinate” ν=mc(dom(f))∈dom(f); when
⟨β⟩∈A is used to extend the condition, “projected” versions of β are added at a
certain set of fewer than κ coordinates in dom(f). In the forcing we described here there
is no need for the maximum coordinate ν, instead each d-object chooses where its values are to be added,
and the role of the maximum coordinate ν in generating a suitable measure is played by (j↾d)−1.
4. Extender-based Radin forcing
Let GCH hold.
Let ρ, κ and λ be cardinals such that ρ<κ<λ and:
(1)
ρ is regular and uncountable.
2. (2)
λ is an inaccessible limit of measurable cardinals, and is the least
such cardinal greater than κ.
3. (3)
There exists a sequence of extenders
E=⟨Ei:i<ρ⟩ such that each Ei
witnesses that κ is λ-strong and has κUlt(V,Ei)⊆Ult(V,Ei), and
the sequence is Mitchell increasing in the sense that ⟨Ei:i<j⟩∈Ult(V,Ej) for all j<ρ.
We note that it is straightforward to build a sequence E as above if κ is (λ+1)-strong.
We will describe an extender-based forcing which preserves all cardinals and forces that cf(κ)=ρ and
2κ=λ. The key point will be that for every V-measurable cardinal μ with
κ<μ<λ, the generic extension will contain scales that can be fed into the
machinery of Lemma 2.5 to produce a uniform ultrafilter on κ with character μ+.
Let h:κ+1→λ+1 be the function which maps α
to the least inaccessible limit of measurable cardinals above
α, and note that:
(1)
h↾κ is a function from κ to κ.
2. (2)
h(κ)=λ.
3. (3)
jE(h)(κ)=λ for any extender
E witnessing that κ is λ-strong.
We will use E to build a version P of the extender-based Radin
forcing PE,λ of Merimovich [12].
For more details about the relationship between P and PE,λ,
see Remark 4.2 at the end of this section.
Our forcing is
designed to exert finer control over cardinal arithmetic and scales in the generic extension.
We will use several ideas from [12], in particular
[12, Lemma 4.10] and [12, Lemma 4.11]
afford an analysis of dense open sets which will play a critical role.
Here is an overview of the forcing P.
•
For each α with κ≤α<λ, αˉ=⟨α⟩⌢E. The intention is
that αˉ will be a coordinate, to which the forcing will associate a certain ρ-sequence of elements of Vκ.
•
D={αˉ:κ≤α<λ}. To each non-empty d⊆D
with ∣d∣≤κ and each ξ<ρ
we associate a function mcξ(d) with domain jEξ[d], defined by the equation
mcξ(d)(jEξ(αˉ))=⟨α⟩⌢E↾ξ.
Since mcξ(d)∈Ult(V,Eξ) by our hypotheses,
we may define a measure Eξ(d)={X:mcξ(d)∈jEξ(X)} and a filter E(d)=⋂ξ<ρEξ(d).
•
Eξ(d) concentrates on a set OB(d)⊆Vκ of d-objects which resemble mcξ(d):
in particular if ν is a d-object then κˉ∈dom(ν)⊆d, ν(αˉ) is a sequence
consisting of an ordinal
in the interval [ν(κˉ)0,h(ν(κˉ)0))
followed by a Mitchell increasing sequence of extenders (which does not depend on αˉ) of some length ξ<ρ,
each extender has critical point ν(κˉ)0,
∣dom(ν)∣≤ν(κˉ)0, and ν is order preserving in the sense that
if α<β then ν(αˉ)0<ν(βˉ)0.
•
Merimovich [12] uses the term extender sequence both for
sequences consisting of extenders (such as E), and for sequences consisting of an ordinal followed
by a sequence of extenders (such as the values assumed by a d-object).
To avoid any confusion we will reserve the term
extender sequence for sequences consisting of extenders, consistent with usage in
inner model theory, and will use the term tagged extender sequence for sequences
consisting of an ordinal followed by a sequence of extenders.
Tagged extender sequences are ordered by comparing their initial entries.
The ordero(e) of a extender sequence e is just its length,
the ordero(x) of a tagged extender sequence x=⟨τ⟩⌢e is
o(e), and the ordero(μ) of a d-object μ is the order of the tagged extender sequence μ(κˉ)
(which is also the order of μ(αˉ) for all αˉ∈dom(μ)).
•
The d-objects are ordered by μ<ν iff dom(μ)⊆dom(ν),
h(μ(κˉ)0)<ν(κˉ)0, and
μ(αˉ)0<ν(αˉ)0 for all αˉ∈dom(μ).
•
A condition p is a non-empty finite sequence whose last entry is denoted p→,
where p→ is a pair (fp→,Ap→).
Here fp→ is a function such that κˉ∈dom(fp→)⊆D,
∣dom(fp→)∣≤κ,
and fp→(αˉ) is a finite increasing sequence of tagged extender sequences whose orders
are less than ρ and are non-increasing, while Ap→
is a tree of finite increasing sequences of dom(fp→)-objects such that for each μ∈T the set
SuccT(μ)={ν:μ⌢⟨ν⟩∈T} is in the filter E(dom(fp→)).
•
A condition p has the form p←⌢⟨p→⟩,
where each entry in p← is a pair (g,B) with g a function and B a tree,
where the pair (g,B) is defined (in essentially the same way that
p→ was just defined from E) from some extender sequence e∈Vκ
such that crit(e)>ρ and e reflects the properties of E↾ξ in Ult(V,Eξ) for some
ξ with 0<ξ<ρ. If ν is a d-object with o(ν)>0 for some d as above then
⟨ν(κˉ)1+i:i<o(ν)⟩ would be a typical value for e.
•
If (g,B) is an entry in p←, then the associated extender sequence e can be computed
by inspecting dom(g), whose least element is the tagged extender sequence
⟨κˉ⟩⌢e where κˉ=crit(e).
•
An entry q in p←
corresponding to e as above is a pair (fq,Aq)
where dom(fq)⊆{⟨β⟩⌢e:crit(e)≤β<h(crit(e))},
the values of fq are finite increasing sequences of tagged extender sequences with non-increasing orders
each less than o(e), and Aq is a tree of
finite increasing sequences of dom(fq)-objects,
which has large branching with respect to a filter e(domfq).
•
If the ith entry in p← is defined from a extender sequence ei, then crit(ei) increases
with i.
•
A condition can be extended by refining existing entries, or by using sequences from the “A-parts”:
the second operation typically interpolates new entries between the entry from whose A-part the sequence was drawn and
its immediate predecessor. For the sake of simplicity
we only describe how to refine p→ and how to extend it using a sequence of length one
⟨ν⟩∈Ap→.
A refinement of p→=(fp→,Ap→) is a pair (g,B)
where dom(fp→)⊆dom(g), g↾dom(fp→)=fp→,
and {ν↾dom(fp→):ν∈B}⊆Ap→.
If ⟨ν⟩∈Ap→,
and fp→(αˉ)⌢⟨ν(αˉ)⟩
is increasing for all αˉ∈dom(ν), then we may extend by ⟨ν⟩.
In the special case of o(ν)=0 we just extend fp→(αˉ)
to fp→(αˉ)⌢⟨ν(αˉ)⟩ for αˉ∈dom(ν)
and replace Ap→ by
A⟨ν⟩p→={μ:⟨ν⟩⌢μ∈Ap→}:
no new entry is interpolated.
When o(ν)>0 we write fp(αˉ) as x(αˉ)⌢y(αˉ)
where y(αˉ) is the longest end-segment consisting of tagged extender sequences with order less than o(ν):
we replace fp→(αˉ) by x(αˉ)⌢⟨ν(αˉ)⟩ for αˉ∈dom(ν)
and again replace Ap→ by A⟨ν⟩p→. In this case we interpolate a new
entry (h,C) associated with the extender sequence
e=⟨ν(κˉ)1+i:i<o(ν)⟩:
dom(h)=rge(ν), h(ν(αˉ))=y(αˉ) for each αˉ∈dom(ν),
and C=Ap→↓ν where A^{p_{\rightarrow}}\downarrow\nu=\{\vec{\mu}\circ\nu^{-1}:\mbox{\vec{\mu}\in A^{p_{\rightarrow}}andforallio(\nu_{i})<o(\mu)and\nu_{i}<\mu}\}.
We work below the condition with a single entry (f,A) where dom(f)={κˉ},
f(κˉ)=⟨⟩,
and A is the f-tree of all finite increasing sequences of dom(f)-objects μ such that o(μ)<ρ.
As the definition of extension suggests, for each αˉ∈dom(fp→) a condition
contains finitely much information about an increasing ρ-sequence of tagged extender sequences: some of this
information is contained in fp→(αˉ), but in general
fp→(αˉ) also contains “pointers” (in the form of tagged extender sequences)
to extender sequences appearing in the entries of p← and coordinates in those entries where more information
about the sequence associated with αˉ is to be found.
More formally, let G be P-generic and work in V[G].
For each α with κ≤α<λ the generic sequence Gα is defined
to contain the tagged extender sequences which appear in fp→(αˉ) for some p∈G,
enumerated in increasing order. For j<ρ let Gα(j) be the jth entry in Gα,
and let gα(j)=Gα(j)0.
Remark 4.1**.**
In the light of the discussion above, it may seems counterintuitive that
the definition of Gα and gα only uses p→. To clarify this point
consider how we may extend the trivial condition (f,A) above to control the value of the first entry
Gα(0) in Gα.
We may use an object μ with o(μ)>0 and αˉ∈dom(μ) to extend
to a condition p′ with two entries in which fp→′(αˉ)=μ(αˉ),
and then in the first entry of p′ use an object ν′ of order zero with μ(αˉ)∈dom(ν′)
to obtain a condition p′′. Since ν′=ν∘μ−1 for some ν of order
zero, we may also use ν first to extend to q=⟨q→⟩ with
fq→(αˉ)=ν(αˉ), and then produce p′′ by using μ.
The forcing poset P satisfies a version of the Prikry property, which we will state
formally in Section 6. Roughly speaking, for any p any question about the forcing extension can
be decided by refining the entries in p. It is also useful to note that if p is a condition
with p← nonempty, then below p the forcing factors as
P/p≃P′/p←×P/p→,
where the last entry in p← is defined from an extender sequence e,
and
P′ is defined from e and h(crit(e)) in the same way that
P is defined from E and λ. Note that ∣P′∣=h(crit(e)),
and that using the Prikry property for P/p→ one can show that
p forces “if crit(e)=gκ(j) then all subsets
of gκ(j+ω) lie in the sub-extension by P′/p←”.
Using the Prikry property and the factorisation, standard arguments show:
•
P adds no new subsets of ρ, in particular ρ is still regular and uncountable after forcing with
P.
•
P preserves cardinals, and in the extension κ is a strong limit cardinal of cofinality ρ.
In particular gκ is a continuous, increasing and cofinal ρ-sequence in κ.
•
All the generic sequences Gα have order type ρ.
•
If κ<γ<λ then gκ(i)<gγ(i)<h(gκ(i))<gκ(i+1) for all large i.
•
2gκ(i)=h(gκ(i)) for limit i with i<ρ.
•
Let κ<γ<λ. In the generic extension, for all large i:
–
If γ is regular in V, then gγ(i+1) is regular in the generic extension.
–
If γ is measurable in V, then gγ(i+1) is measurable in the generic extension.
–
If κ<cf(γ) in V, then gκ(i+1)<cf(gγ(i+1)) in the generic extension.
•
GCH holds in the intervals [h(gκ(i)),gκ(i+ω)) for i limit, in particular
if κ<γ<λ then GCH holds at gγ(i+1) for all large i.
Remark 4.2**.**
The forcing P is PE,λ from [12] with the following
small changes and simplifications:
•
Since λ<jE0(κ), every coordinate αˉ consists of α followed
by the whole extender sequence E.
•
Because of the previous remark and the fact that ρ<κ,
every tagged extender sequence
in the range of a d-object contains the same extender sequence, and Eσ(d) concentrates
on objects of order σ.
•
The definition of the ordering on d-objects is slightly more stringent than in
**[12]**, but this is harmless because every d-object still has E(d)-many
d-objects above it.
•
The definition of the forcing guarantees that no new subsets of ρ are added.
•
If q is an entry in p← associated with e, then the domain of
fq can only contain sequences ⟨β⟩⌢e for
crit(e)≤β<h(crit(e)): this gives us better control over
the continuum function in the generic extension, in particular it is why
2gκ(i)=h(gκ(i)) for limit i<ρ.
5. Fat trees and iterations
Merimovich [11] used iterated ultrapowers to analyse names in the extension
by a “one-extender” extender based Prikry forcing. Roughly speaking, the iteration maps
afford a compact way of doing integration with respect to product measures which characterise
the trees appearing in the forcing conditions. We will carry out a similar construction here in the
more complicated context of our forcing poset P from Section 4: the situation here
is more complicated because in the context of [11] there is only one extender to iterate,
while here at stage n we choose ε<ρ and then apply j0n(Eε).
Recall that if p is a condition with p→=(fp→,Ap→) and
dom(fp→)=d, then Ap→ is a tree of finite increasing sequences
with E(d)-large branching at each node. Following Merimovich, we call such trees d-trees,
and introduce the related notion of a d-fat tree.
A d-fat tree is a tree T of finite height consisting of finite increasing sequences of d-objects,
all of the same length, such that
for every non-maximal node μ∈T there is ε such that
{ν:μ⌢⟨ν⟩∈T}∈Eε(d).
Note that if a tree is d-fat then its intersection with any d-tree is also d-fat, in
particular it is non-empty.
Since ρ<κ, it is easy to see that any d-fat tree can be thinned to a d-fat subtree such that
for every non-maximal level l, there is εl<ρ such that all points
on level l have an Eεl(d)-large set of successors. Thinning further
we may also assume that a d-fat tree consists of sequences ν such that
νj has order εj for all j; in a mild abuse of notation we
say that ν has order ε. We say that such a tree is (ε,d)-fat.
Given ε and d, define a finite iteration jε where we use the extender
j0i(Eεi) at stage i. As usual, for m<n we let jmn denote the embedding
from the mth iterate to the nth iterate.
Lemma 5.1**.**
Let mcε(d)=⟨(jilh(ε)↾j0i(d))−1:i<lh(ε)⟩.
Then mcε(d) is a maximal element in jε(T) for every (ε,d)-fat tree T.
Proof.
We prove this by induction on n>0 where n=lh(ε).
For use in the successor step we note that for every ζ<ρ, since λ<jEζ(κ)
we have that d is fixed by jEζ: appealing to elementarity j0i(d) is fixed by
jii+1 for all i.
•
Base case (n=1): The empty sequence has an Eε0(d)-large set of successors in T,
so by definition mcε(d)=⟨(j01↾d)−1⟩ is on level one of j01(T).
•
Successor step: Suppose that ε has length n+1 and T is
(ε,d)-fat. By the induction hypothesis,
mcε↾n(d)∈j0n(T), where we have
mcε↾n(d)=⟨(jin↾j0i(d))−1:i<n⟩.
Each entry in mcε↾n(d)
is a bijective partial function of size at most j0n−1(κ),
so that jnn+1 maps it to its pointwise image: that is,
[TABLE]
The tree j0n(T) is (ε,j0n(d))-fat, in particular
since mcε↾n(d) is in j0n(T) it
has a j0n(Eεn(d))-large set of successors.
The measure j0n(Eεn(d)) is generated by the embedding
jnn+1 together with the object
j0n(mcεn(d))=(jnn+1↾j0n(d))−1,
so that
The embedding jε and the sequence
mcε(d) can be used to characterise the (ε,d)-fat trees:
for any tree of sequences U,
if mcε(d) is an element of jε(U)
then U contains a (ε,d)-fat tree.
For use in Section 6, we calculate some values of the entries in mcε(d).
Lemma 5.2**.**
Let mc=mcε(d).
For every i<lh(ε) and αˉ∈d,
mci(jε(αˉ))=jε↾i(αˉ).
Proof.
By definition mci=(jilh(ε)↾j0i(d))−1, and clearly
j0i=jε↾i and jε=j0lh(ε).
Since αˉ∈d,
j0i(αˉ)∈j0i(d), and by the commutativity of the embeddings in the
iteration, jilh(ε)(j0i(αˉ))=jε(αˉ).
It follows that jε(αˉ)∈dom(mci) and
mci(jε(αˉ))=jε↾i(αˉ).
∎
6. Scale analysis
To use Lemma 2.5, we need appropriate scales in the generic extension by
P. For κ≤α<λ and η<ρ, let gα∗(η)=gα(ωη+1)
The scales we use will be appropriate initial segments of ⟨gα∗:κ≤α<λ⟩.
The choice of the indices ωη+1 may seem arbitrary, so we digress briefly to explain it.
Successor indices are needed because for limit i the values of gα(i) lie in an interval
where the forcing has destroyed GCH, and this is bad for our intended application.
Indecomposable ordinals ωη are useful because it is comparatively easy to
design a condition which decides the values of gα(ωη) and gα(ωη+1),
see for example the proof of Lemma 6.1 below. See also the discussion of the
“offset problem” below.
Our analysis here owes an intellectual debt to work of Merimovich [11],
who proved parallel results
in the context of the generic ω-sequences added by a “one-extender” Prikry forcing
of the sort discussed in Section 3.2. The analysis is harder in some
respects and easier in others.
On the one hand, the complexity of the forcing P makes the analysis harder.
To note a few salient points:
•
The conditions themselves are more complex objects, in particular typically many entries
in p← will themselves contain extender sequences, functions and trees.
•
The connection between a condition p and what it forces about the values
gα(i) of the generic functions is much more complex.
•
All the objects in the one-extender forcing of Section 3.2 have order [math] and
behave in a rather uniform way, while in P objects of order [math] and
of positive order behave very differently.
•
On a more technical note, we will need an analysis of
dense open sets in P.
In the case of the one-extender forcing of Section 3.2 the parallel fact
just asserts that if D is dense open and (f,A) is a condition, then there exist an extension
(f′,A′) and an integer n such that f′↾dom(f)=f, and for every ν′
of length n in A′ the minimal extension of (f′,A′) using ν′ lies in D.
Compare this with Lemmas 6.3 and 6.4 below.
On the other hand, one source of difficulty in the one-extender case is that the
ω-sequences assigned to different coordinates are “offset” from each other
by a finite amount. To see the issue note that
if fp(α) and fp(β) are finite increasing sequences of ordinals
with different lengths, and Ap is a tree consisting of objects which all have α and β
in their domain, then ν(α)<ν(β) for all ν appearing in Ap but
p only forces that a shifted version of the sequence at α is eventually dominated
by the sequence at β. In our case we are able to avoid this difficulty: the point is that
since ρ is a regular uncountable cardinal it is a limit of indecomposable ordinals,
that is those of form ωη, and this helps us argue
(see Lemma 6.1) that the sequences gα∗
and gβ∗ will eventually “synchronise” and no offset is needed.
If (f,A) is an entry in a condition and ν∈A then we write (f,A)ν for
the sequence of entries obtained by extending (f,A) using each entry in ν in turn.
If p=⟨p→⟩ and ν∈Ap→ then
we write pν for the condition (p→)ν. In the more general situation
where p← is non-empty and ν∈Ap→, we let
pν=p←⌢(p→)ν.
Lemma 6.1**.**
⟨gα∗:κ≤α<λ⟩*
is strictly increasing in the eventual domination ordering.*
Proof.
Let p be a condition and let α<β<λ.
Let η<ρ be so large that o(e)<η for every
extender sequence e associated with an entry in p←, and
also o(x)<η for every tagged extender sequence x appearing in
fp→(α) or fp→(β).
Choose an object μ such that ⟨μ⟩∈Ap→,
o(μ)=η, μ(κˉ)0>crit(e) for every extender sequence e associated with an entry
in p←, and αˉ,βˉ∈dom(μ). Form the condition p⟨μ⟩,
and refine the A-parts of the entries in p⟨μ⟩← so that
only objects of order less than η appear, to obtain a condition q.
Note that fq→(αˉ)=fq→(βˉ)=⟨⟩,
and also αˉ,βˉ∈dom(ν) for all ν appearing in Aq→.
It is routine to check that q forces that:
•
gα(ωη)=μ(αˉ) and gβ(ωη)=μ(βˉ).
•
For all i with ωη<i<ρ, there is ν appearing in Aq→
such that gα(i)=ν(αˉ) and gβ(i)=ν(βˉ).
In particular gα(i)<gβ(i) since ν is order-preserving.
•
gα∗<∗gβ∗.
∎
Lemma 6.5 below is our main technical result. In its proof we will use
two lemmas from [12] which give an analysis of dense sets
in the forcing. For the reader’s convenience we quote those lemmas here.
We start with the definitions of Prikry extension and strong Prikry extension [12, Definition 4.5].
•
If
p and q are conditions in P with
p=⟨p→⟩ and q=⟨q→⟩,
then p is a Prikry extension of q (p≤∗q)
if and only if fp→↾dom(fq→)=fq→
and Ap→↾dom(fq→)⊆Aq→.
More generally for p,q∈P we define recursively p≤∗q
if and only if p→≤∗q→ and p←≤∗q←: unwrapping the recursion,
this implies that p and q contain the same number of entries and each entry in p is a Prikry extension
of the corresponding entry in q.
•
For p and q conditions in P with
p=⟨p→⟩ and q=⟨q→⟩,
p is a strong Prikry extension of q (p≤∗∗q)
if and only if fp→=fq→ and Ap→⊆Aq→.
The extension to arbitrary p and q is defined as for the notion of Prikry extension.
The precise statement of the Prikry lemma is that for every condition q
and every sentence ϕ of the forcing language, there is p≤∗q such that
p decides ϕ. The following fact is crucial in the discussion that follows:
Fact 6.2**.**
If p=⟨p→⟩ and q≤p, then there is a unique ν∈Ap→
such that q≤∗pν.
We refer the reader to [12, Definition 4.5] and the discussion
in Remark 4.1 for more on the ordering of conditions in extender-based Radin forcing.
In the situation of Fact 6.2, or the more general one where p← is non-empty and it’s
only a tail of q that is a Prikry extension of (p→)ν,
we say that q* is an extension of p by ν.*
We can view the construction of q from p as happening in stages: first we form pν (the minimal extension
of p by ν), then we take a Prikry extension of each entry in pν. Taking an even more granular
approach, at each entry we can view the process of Prikry extension as occurring by first extending the f-part,
and then forming a strong Prikry extension of the resulting entry by shrinking the A-part.
Before stating Lemmas 6.3 and 6.4, we need one more piece of notation:
if T is a d-fat tree, r is a function with domain T and ν∈T then
r(ν)=⟨r(ν↾i):0<i≤lh(ν)⟩.
The following facts appear as Lemmas 4.10 and 4.11 in [12].
Lemma 6.3**.**
Let p∈P, let T⊆Ap→ be a dom(p→)-fat subtree, and
let r be a function with domain T such that
r(ν)≤∗∗pν← for every maximal ν∈T. Then there is a
strong Prikry extension q≤∗∗p such that q←=p← (that is q is obtained by
merely replacing p→ by some strong Prikry extension q→) and
the set of conditions of form p←⌢r(ν)⌢⟨pν→⟩
for ν∈T maximal is predense below q.
Lemma 6.4**.**
Let p∈P with p=⟨p→⟩, and let D⊆P
be a dense open set. Then there exist a Prikry extension q≤∗p, a dom(fq→)-fat tree
T⊆Aq→ and a function r with domain T such that
r(ν)≤∗∗qν←
and r(ν)⌢⟨qν→⟩∈D for every maximal ν∈T.
Of course the dense sets which we need to analyse are rather special,
but we have chosen to use the general machinery of [12] rather than
reprove the relevant special cases.
Lemma 6.5**.**
If κ<γ<λ with cf(γ)>κ, then
gγ∗ is an exact upper bound for ⟨gδ∗:κ≤δ<γ⟩.
Proof.
Let p∈P and ⟨τ˙η:η<ρ⟩ be
such that p⊩∀η<ρτ˙η<g˙γ∗(η).
We will ultimately produce a condition q≤p, together with ordinals δ<γ and η<ρ such that
q⊩∀ζ>ητζ<g˙δ∗(ζ).
Claim 6.6**.**
Extending p if necessary, we may assume that:
•
Both κˉ and γˉ are in dom(fp→).
•
For every object ν appearing in any sequence from Ap→,
both κˉ and γˉ appear in dom(ν), and
cf(ν(γˉ)0)>ν(κˉ)0.
•
fp→(κˉ)=fp→(γˉ)=⟨⟩.
•
There is η<ρ such that:
–
p←* determines the values of gκ(ωη) and gγ(ωη),
say as κ∗ and γ∗.*
–
If q≤p via some ν∈Ap→, and q determines
gκ(i) or gγ(i) for some i with ωη<i,
then the minimal extension pν already determines gκ(i) and gμ(i).
–
p* forces that cf(gγ(i))>gκ(i) for all successor i>ωη.*
Proof.
Choose η as in the proof of Lemma 6.1,
and then replace p by a suitable strong Prikry extension
of p⟨μ⟩ for some ⟨μ⟩∈Ap→
with o(μ)=η. Now p← determines
gκ(ωη) as μ(κˉ)0
and gγ(ωη) as μ(γˉ)0. If q extends p via ν, then
κˉ and γˉ are in dom(νk) for all k, and the minimal extension already
determines the relevant values.
∎
Claim 6.7**.**
Without loss of generality, we may assume that p=p→.
Proof.
As in the discussion at the end of Section 4,
P/p is isomorphic to the product of a “low part” Plow
below p← and
a “high part” Phigh below p→.
We view τ˙η as a Phigh-name
for a Plow-name. Since Plow has size h(κ∗),
and p forces cf(gγ∗(ζ))>gκ∗(ζ) for all ζ>η,
it is easy to find Phigh-names σ˙ζ for ζ>η such that
p⊩∀ζ>ητ˙ζ<σ˙ζ<gγ∗(ζ).
Replacing P by Phigh, p by p→
and τ˙ζ by σ˙ζ, we have the claim.
∎
In the light of the preceding Claim, it is clearly sufficient to prove that we can find δ<γ
such that p extends to
a condition forcing ∀ζ<ρτ˙ζ<gδ∗(ζ).
For each ζ with ζ<ρ, let Dζ be the dense open set of conditions
t in P such that:
•
t determines the values of τζ and gγ∗(ζ).
•
t← has at least one entry defined from an extender sequence with order
ζ.222 The first requirement on t actually implies the second one, but we preferred to make this
point explicit.
Claim 6.8**.**
There exist q≤∗p, integers nζ, dom(fq→)-fat subtrees Tζ of Aq→
with height nζ, and functions Rζ and hζ for ζ<ρ with the following properties.
For all ζ<ρ and all maximal ν∈Tζ:
•
Rζ(ν)≤∗∗qν←.
•
Rζ(ν)⌢⟨qν→⟩∈Dζ.
•
hζ(ν)* is the value which Rζ(ν)⌢⟨qν→⟩
determines for τζ.*
Proof.
We will build a ≤∗ decreasing chain ⟨qζ:ζ<ρ⟩, together with
trees Sζ and functions Rζ, such that:
•
q0=p.
•
Sζ is a dom(fq→ζ+1)-fat tree.
•
For all maximal ν∈Sζ,
Rζ(ν)≤∗∗qν←ζ+1
and Rζ(ν)⌢⟨qν→ζ+1⟩∈Dζ.
Once we have chosen qζ, we appeal to Lemma 6.4 to produce qζ+1≤∗qζ
together with Sζ and Rζ. To choose qζ for ζ limit we use the
κ-completeness of the ≤∗ ordering and the fact that ρ<κ.
At the end of the construction, let q be a lower bound in the ≤∗-ordering for
the sequence ⟨qζ:ζ<ρ⟩.
Subclaim 6.9**.**
For every ζ<ρ:
•
For every ν∈Aq→,
qν≤∗qν↾dom(fq→ζ)ζ.
•
If we let Tζ={ν∈Aq→:ν↾dom(fq→ζ+1)∈Sζ}, then
Tζ is a dom(fq→)-fat tree with the same height as Sζ.
•
There exists a function Rζ with domain Tζ, such that
Rζ(ν)≤∗∗qν← and
Rζ(ν)≤∗Rζ(ν↾dom(fq→ζ+1)).
Proof.
We take each assertion in turn.
•
To lighten the notation, let f=fq→, A=Aq→, q′=qζ, f′=fqζ→,
A′=Aqζ→, and d′=dom(f′)
Let ν∈A, and note that since q≤∗q′
we have ν′∈A′ where ν′=ν↾d′. Note also that
o(νi)=o(νi′) for all i<lh(ν).
Now we compare the construction process for entries in qν and qν′′.
Since q≤∗q′, f↾d′=f′
and A↾d′⊆A′.
By definition Aqν→=Aνq→: if μ∈Aqν→ then
ν⌢μ∈A, so
(ν↾d′)⌢(μ↾d′)∈A′,
and hence μ↾d′∈Aν′′=Aqν′→′. As for the f-parts,
dom(fqν→)=dom(f), dom(fqν′→′)=dom(f′)=d′,
and the value of fqν→(αˉ) depends only on fq→(αˉ) and ν(αˉ),
so that fqν→↾d′=fqν′→′.
The argument comparing entries in qν← and qν′←′ is quite similar. Suppose that
o(νi)>0, so that using νi generates an entry (g,B) in qν← with
(g′,B′) the corresponding entry in qν′←′. Note that dom(g)=rge(νi) and dom(g′)=rge(νi′).
The value of g(νi(αˉ)) depends only on the
values of νj(αˉ) (for j such that αˉ∈dom(νj)) and fq→(αˉ),
so that easily g↾dom(g′)=g′. If μ∈B=A↓νi,
then μ=μ∗∘νi−1 for some μ∗∈A with o(μk∗)<o(νi) and μk∗<νi
for all k<lh(μ∗). Then μ∗↾d′∈A′, o(μk∗↾d′)<o(νi′)
and μk∗↾d′<νi′
for all k, so that μ↾dom(g′)∈B′=A′↓ν′.
•
Since Sζ is a tree it is easy to see that Tζ is a tree.
Let ν∈Tζ, let d′=dom(fq→ζ+1) and let ν′=ν↾d′,
so that ν′∈Sζ. Suppose that ν′ is not maximal in Sζ.
Since Sζ is a fat tree there is an i<ρ such that
{μ′:ν′⌢⟨μ′⟩∈Sζ}∈Ei(d′), and
then since Aq→ is an E(dom(fq→)-tree and ν∈Aq→
we also have {μ:ν⌢⟨μ⟩∈Aq→}∈Ei(dom(fq→)
Since Ei(d′) is the projection of Ei(dom(fq→) via the restriction map
μ↦μ↾d′, we also have
{μ:ν′⌢⟨μ↾d′⟩∈Sζ}∈Ei(dom(fq→).
So {μ:ν⌢⟨μ⟩∈Tζ}∈Ei(dom(fq→).
It follows easily that Tζ is a fat tree with the same height as Sζ. In particular
if ν∈Tζ is maximal then ν↾d′ is maximal in Sζ.
•
To define Rζ(ν) for ν∈Tζ, let
ν′=ν↾dom(fq→ζ+1) so that ν′∈Sζ.
By the choice of Rζ, Rζ(ν′)≤∗∗qν′←ζ+1.
As we just showed, qν≤∗qν′ζ+1.
Let νi be the last entry in ν. If o(νi)=0 there is nothing to do,
so assume that o(νi)>0. Let (g′,B′) and (g,B) be the last entries
in qν′←ζ+1 and qν← respectively,
so that they correspond to νi′ and νi.
Let (g′,C′)=Rζ(ν′), so that C′⊆B′.
Let C={μ∈B:μ↾dom(g′)∈C′}
and note that (g,C) is a legitimate entry with (g,C)≤∗∗(g,B) and (g,C)≤∗(g′,B′).
Set Rζ(ν) equal to (g,C).
Let ν∈Tζ be maximal.
By Subclaim 6.9, Rζ(ν)≤∗∗qν←.
By the choice of Rζ, we have Rζ(ν↾dom(fq→ζ+1))⌢⟨qν→ζ+1⟩∈Dζ.
By Subclaim 6.9 again, Rζ(ν)≤∗Rζ(ν↾dom(fq→ζ+1)),
and also qν≤∗qν↾dom(fq→ζ)ζ.
It follows that
Rζ(ν)⌢⟨qν→⟩≤∗Rζ(ν↾dom(fq→ζ+1))⌢⟨qν→ζ+1⟩,
and so since Dζ is open that Rζ(ν)⌢⟨qν→⟩∈Dζ.
By the definition of Dζ, we may now choose hζ(ν) to be the value which Rζ(ν)⌢⟨qν→⟩
determines for τζ.
Replacing Tζ by a subtree if necessary, we may assume that
for every ζ<ρ there is a sequence
εζ such that
Tζ is a (εζ,dom(fq→))-fat tree.
It is immediate from the definition of the set Dζ that ζ appears at
least once in the sequence εζ.
Let ζ<ρ and let the first appearance of ζ
in εζ have index nζ.
Shrinking the values of the function Rζ if necessary, we may assume that
for all maximal ν∈Tζ, all objects appearing in the tree
parts of the entries in Rζ(ν↾nζ)
have order less than ζ. The advantage of this is that
now for every maximal ν∈Tζ,
Rζ(ν)⌢⟨qν→⟩
decides the value of gγ(ωζ) as νnζ(γˉ)0.
Claim 6.10**.**
Let ζ<ρ, ε=εζ and n=nζ. Then:
•
εn+1=0.
•
For all maximal ν∈Tζ,
the condition Rζ(ν)⌢⟨qν→⟩
decides the value of gγ∗(ζ) as νn+1(γˉ)0.
Proof.
For the first claim, suppose for a contradiction that either εn is the last entry of
ε or εn+1>0. Let ν∈Tζ be maximal
and let t=Rζ(ν)⌢⟨qν→⟩
so that t determines the value of gγ(ωζ) as νn(γˉ)0,
and the value gγ∗(ζ) as θ say.
At this point we need to be slightly careful, and keep in mind that when we use objects
of order zero in ν in the construction of qν they do not give rise to new entries.
Accordingly let εn have index m in the increasing enumeration of the non-zero entries
of ε, and note that if it exists εn+1 has index m+1.
Since entry m+1 in t is defined from an extender sequence e with
crit(e)>θ, we may now extend t using an object of order zero drawn from the tree part
of entry m+1 to force gγ(ωζ+1)>θ. This contradiction establishes the first claim,
and the second claim follows immediately.
∎
For each ζ<ρ, we form the iteration jεζ as in Section 5.
Claim 6.11**.**
Let ζ<ρ, ε=εζ, n=nζ
and mc=mcε(domfq).
Then for all large δ<γ,
jε(hζ)(mc)<jε↾n+1(δ)
Proof.
Recall that for ν maximal in Tζ,
hζ(ν) is the value which Rζ(ν)⌢⟨qν→⟩
determines for τζ, and νn+1(γˉ)0 is the value it determines for gγ∗(ζ),
so hζ(ν)<νn+1(γˉ)0.
Recall also that mc is a maximal element in jε(Tζ).
By elementarity,
jε(hζ)(mc)<mcn+1(jε(γˉ))0.
By Lemma 5.2,
mcn+1(jε(γˉ))=jε↾n+1(γ).
Since cf(γ)>κ, and jε↾n+1 can be represented as the ultrapower by
a short extender with critical point κ,
we have that jε↾n+1 is continuous at γ and the claim follows.
∎
Recall that dom(fq→) is bounded in γ, because cf(γ)>κ.
Hence we can choose δ<γ so large that δˉ∈/dom(fq→)∩γ, and
jεζ(hζ)(mcεζ(dom(fq→)))<jεζ↾n+1(δ)
for all ζ<ρ.
We find q′≤∗q such that δˉ∈dom(fq→′) and fq→′(δˉ)=⟨⟩.
For each ζ<ρ we choose a (εζ,dom(fq→′))-fat
tree Tζ′ and a function Rζ′ so that
Tζ′↾dom(fq)⊆Tζ and
Rζ′(μ)≤∗Rζ(μ↾dom(fq))
for all maximal μ∈Tζ′.
For all ζ<ρ we have
mcεζ(dom(fq→′))∈jεζ(Tζ′),
and by the choice of δ and Lemma 5.2
[TABLE]
Using the connection between fat trees and iterations, and elementarity,
we choose fat subtrees Tζ′′⊆Tζ′ such that for all maximal ν∈Tζ′′,
Rζ′(ν)⌢⟨qν→′⟩ forces
τζ<gδ∗(ζ), where the key point is that
Rζ′(ν)⌢⟨qν→′⟩
decides the value of gδ∗(ζ) as νn+1(δˉ).
Now we make ρ many applications of Lemma 6.3 to get r≤∗∗q′ such that for every
ζ<ρ, the set of conditions of form R′ζ(ν)⌢⟨qν→′⟩
with ν∈Tζ′′ maximal is predense below r. Then r forces that τζ<gδ∗(ζ)
for all ζ, as required to finish the proof of Lemma 6.5.
∎
7. The main theorem
Theorem 1**.**
Let ρ<κ<λ where ρ is regular and uncountable,
λ is the least inaccessible limit of measurable cardinals greater than κ,
and there is a Mitchell increasing sequence ⟨Ei:i<ρ⟩ such that each
extender Ei witnesses that κ is λ-strong and
is such that κUlt(V,Ei)⊆Ult(V,Ei).
Then there is a cardinal-preserving generic extension
in which cf(κ)=ρ, 2κ=λ, and Spχ(κ) is unbounded in λ.
Proof.
In V let μ∈(κ,λ) be measurable in V, and let θ=2μ=μ+.
In the generic extension for each i<ρ let μi=gμ∗(i) and θi=gθ∗(i).
For all large i we have that in the extension:
(1)
μi is measurable and 2μi=θi=μi+.
2. (2)
There is a normal measure Ui on μi generated by an almost decreasing sequence of length
θi.
3. (3)
There exist a cofinal sequence in ∏i<ρμi under eventual domination of length μ,
and a cofinal sequence in ∏i<ρθi under eventual domination of length θ.
Appealing to Lemma 2.5, in the extension there is a uniform ultrafilter
U on κ with Ch(U)=θ.
∎
Theorem 2**.**
From the same hypotheses as Theorem 1,
it is consistent that
2κ is the least weakly inaccessible cardinal greater than κ, and
every regular cardinal between κ and λ is in the spectrum.
Proof.
We will force over the model from the proof of Theorem 1 with a suitable
product of collapsing posets.
We enumerate the measurable cardinals in the interval (κ,λ) as
⟨μη:η<λ⟩.
For every limit ζ<λ, supη<ζμη
is singular by the minimality of λ,
in particular it is less than μζ. Now we choose an increasing sequence of regular cardinals ⟨χη:η<λ⟩ in
the interval (κ,λ) as follows:
χ0=κ+, χη+1=μη++ for η<λ, and
χζ=(supη<ζμη)+ when ζ is a limit ordinal.
We force with the Easton support product of the Levy collapses Coll(χζ,μζ+)
for ζ<λ.
By a routine calculation the surviving cardinals in the interval (κ,λ) are those
of the form χζ and their limits. All the limits are singular so the regular cardinals in
(κ,λ) are those of the form χζ. Now we argue exactly as
in [5, Claim 8 and Theorem 9] that
χζ is in the spectrum for all ζ.
∎
Bibliography16
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] J. Cummings, M. Džamonja, M. Magidor, C. Morgan and S. Shelah, A framework for forcing constructions at successors of singular cardinals , Transactions of the American Mathematical Society 369 (2017), 7405–7441.
2[2] M. Džamonja and S. Shelah, Universal graphs at the successor of a singular cardinal , Journal of Symbolic Logic 68 (2003), 366–388.
3[3] S. Garti, M. Gitik and S. Shelah, Cardinal characteristics at aleph omega , to appear.
4[4] S. Garti and S. Shelah, The ultrafilter number for singular cardinals , Acta Math Hungarica 137 (2012), 296–301.
5[5] S. Garti, M. Magidor and S. Shelah, On the spectrum of characters of ultrafilters , Notre Dame Journal of Formal Logic 59 (2018), 371–379.
6[6] M. Gitik, A uniform ultrafilter over a singular cardinal with a singular character, to appear.
7[7] M. Gitik, More on uniform ultrafilters over a singular cardinal, to appear.
8[8] M. Gitik, On spectrum of strongly uniform ultrafilters over a singular cardinal, to appear.