The tree property at first and double successors of singular cardinals with an arbitrary gap
Alejandro Poveda
Departament de Matemàtiques i Informàtica, Universitat de Barcelona.
Gran Via de les Corts Catalanes, 585,
08007 Barcelona, Catalonia.
[email protected]
Abstract.
Let cof(μ)=μ and κ be a supercompact cardinal with μ<κ. Assume that there is an increasing and continuous sequence of cardinals ⟨κξ∣ξ<μ⟩ with κ0:=κ and such that, for each ξ<μ, κξ+1 is supercompact. Besides, assume that λ is a weakly compact cardinal with supξ<μκξ<λ. Let Θ≥λ be a cardinal with cof(Θ)>κ. Assuming the GCH≥κ, we construct a generic extension where κ is strong limit, cof(κ)=μ, 2κ=Θ and both TP(κ+) and TP(κ++) hold. Further, in this model there is a very good and a bad scale at κ. This generalizes the main results of [Sin16] and [FHS18].
2000 Mathematics Subject Classification:
Primary: 03Exx. Secondary: 03E50, 03E57.
This research has been supported by MECD (Spanish Government) Grant no FPU15/00026, MEC project number MTM2017-86777-P and SGR (Catalan Government) project number 2017SGR-270.
1. Introduction
Infinite trees play a central role in infinite combinatorics. Recall that a κ-tree is called κ-Aronszajn if it has no cofinal branches.
Given a regular cardinal κ it is said that the tree property holds at κ, denoted by TP(κ), if every κ-tree has a cofinal branch. By classical results of König and Aronszajn it is well-known that TP(ℵ0) holds while TP(ℵ1) fails.
In 1972, Mitchell proved that assuming the existence of a weakly compact cardinal κ there is a generic extension by a forcing M(κ) where κ=ℵ2, 2ℵ0=ℵ2 and TP(ℵ2) holds. Thereby the consistency of a weakly compact cardinal gives an upper bound for the consistency of TP(ℵ2). It is worth mentioning that the failure of the CH in Mitchell’s model is necessary, for otherwise, by virtue of Specker’s theorem, there would be a special ℵ2-Aronszajn tree. The converse implication is also true on the basis of a theorem of Silver (see e.g. [Jec78]) who proved that if TP(ℵ2) holds then ℵ2 is a weakly compact cardinal in L. Combining both theorems, it follows that TP(ℵ2) is equiconsistent with the existence of a weakly compact cardinal. In this paper we are interested in the forcing devised by Mitchell in [Mit72], as well as in other similar constructions developed by several authors over the years [Abr83] [CF98] [Sin16] [Ung13] [FH11] [FHS18].
Intuitively, Mitchell forcing M(κ) can be conceived as the amalgam of two components: the first one intended to blow up the power set of ℵ0 to κ (Cohen component) and the second one devised to collapse the interval (ω1,κ) (Collapsing component). Combining this with a fine analysis of the quotients of M(κ), Mitchell’s theorem follows.
In the light of Mitchell’s result it is natural to ask whether it is consistent to have the tree property at two consecutive cardinals. The first result in this direction was due to Abraham, who proved in 1983 that from the existence of a supercompact cardinal with a weakly compact cardinal above, it is possible to force TP(ℵ2) and TP(ℵ3) [Abr83]. Prima facie it may seem surprising that for getting the consistency of TP(ℵ2)+TP(ℵ3) one needs much stronger hypotheses than those assumed by Mitchell: especially considering that the consistency of TP(ℵ2)+TP(ℵ4) follows from a straightforward application of Mitchell’s ideas to two weakly compact cardinals.
But, as Magidor observed, to get the consistency of the tree property at two consecutive cardinals one needs to trascend the level of 0♯ (see [Abr83, Theorem 1.1]).
Some years later, and building on Abraham’s ideas, Cummings and Foreman designed a forcing that, starting with infinitely many supercompact cardinals, yields a generic extension where the tree property holds at ℵn, for each 2≤n<ω [CF98].
In that paper the authors combined Mitchell’s construction with the Prikry-type forcing technology to get a model where TP(κ++) holds, κ is a strong limit cardinal with cof(κ)=ω, and the SCHκ fails [CF98]. Building on these ideas, as well as on others from [Ung13], Friedman, Honzik and Stejskalová [FHS18] exhibited an argument to obtain arbitrary values of 2κ in Cummings-Foreman’s model. In particular this shows that the tree property at the double successor of a strong limit singular cardinal κ is consistent with an arbitrary failure of the SCHκ. Building on [FHS18] this result was subsequently generalized in [GP18] to the setting of uncountable cofinalities.
A related discussion to that described previously is about the existence of Aronszajn trees at first successors of strong limit singular cardinals. This problem is related with the proof of the consistency of the failure of the SCH at a singular strong limit cardinal. Recall that if κ is a measurable cardinal with 2κ≥κ++ then Prikry forcing yields a generic extension where □κ∗ holds, hence TP(κ+) fails, and SCHκ fails.111The consistency of the former hypotheses is exactly the existence of a measurable cardinal κ with o(κ)=κ++ as proved by Gitik and Mitchell [Jec78].
Thus a natural question that arises is if this is essentially the only possible way to produce a model where the SCHκ fails. More formally, given a singular strong limit cardinal κ with cof(κ)=ω does TP(κ+) (and, in particular, ¬□κ∗) imply SCHκ? This question was originally posed in 1989 by Woodin and other authors (see e.g. [For05]) and remained unanswered for a long time. Possibly the most decided attempt towards settling this question was due to Gitik and Sharon, who proved the consistency of ¬SCHκ+¬□κ∗ from the existence of a κ+ω-supercompact cardinal κ [GS08]. Also in Gitik-Sharon model there is a very good scale at κ, a PCF object of central relevance in cardinal arithmetic (see [She94] for definitions). Shortly after, Cummings and Foremann observed that the failure of □κ∗ in Gitik-Sharon’s model was due to the existence of a bad scale at κ.
The construction of a model for ¬SCHκ+TP(κ+) finally came from Neeman [Nee09], who starting with ω-many supercompact cardinals was able to combine the ideas from [GS08] with the analysis of narrow systems of [MS96] to give rise the desired result. Following up on Neeman’s ideas, Sinapova proved in [Sin16] that the Mitchell-like forcing of [Ung13] can be used to yield a generic extension where TP(κ+) and TP(κ++) both hold while SCHκ fails. In fact, subsequent work of Sinapova and Unger showed that this can be also done for κ=ℵω2 [SU18].
In this paper we aim to combine Sinapova’s arguments from [Sin16] with those developed in [Ung13],[FHS18] and [GP18], in order to get a generic extension where TP(κ+) and TP(κ++) both hold, κ is a singular strong limit cardinal with cof(κ)=μ and there is an arbitrary failure of the SCHκ. Further, as a consequence of results of Sinapova [Sin08], in our generic extension there will be a very good scale and a bad scale at κ. The main result of the paper is the following.
Theorem 1.1** (Main Theorem).**
Let cof(μ)=μ and κ be a supercompact cardinal, with μ<κ. Assume that there is an increasing and continuous sequence of cardinals ⟨κξ∣ξ<μ⟩ with κ0:=κ and κξ+1 being supercompact, for each ξ<μ. Besides, assume that there is a weakly compact cardinal λ with supξ<μκξ<λ, and let Θ≥λ be a cardinal with cof(Θ)>κ. Assuming that the GCH≥κ holds, there is a generic extension of the universe where the following holds:
- (1)
κ* is a strong limit cardinal with cof(κ)=μ.*
2. (2)
All cardinals and cofinalities ≥λ are preserved, (supξ<μκξ)+V=κ+ and λ=κ++.
3. (3)
2κ=Θ, hence ¬SCHκ.
4. (4)
TP(κ+)* and TP(κ++) hold.*
5. (5)
There is a very good scale and a bad scale at κ.
For the proof of this result we shall make use of some ideas developed in [Sin16], [Sin08] and [Sin12] for the proof of TP(κ+) and (5). For the rest of items we will use some other ideas from [Ung13],[FHS18] and [GP18]. The structure of the paper is as follows: In Section 2 we will give an overview of Sinapova forcing following [Sin08]. In Section 3 we will proof a criterion for genericity for Sinapova forcing, which extends the classical Mathias’ criterion for Prikry forcing [Git10]. This result will be crucial in Section 4, where we will present our main forcing construction R, and also in Section 5, where we will prove VR⊨TP(κ++). We end up the paper with Section 6 proving VR⊨TP(κ+). Any non defined notion/notation is either standard or will be properly referred.
2. An overview on Sinapova forcing
In this section we will review a forcing construction due to D. Sinapova. Our exposition will follow Sinapova’s dissertation [Sin08]. Originally, Sinapova forcing (or also Diagonal Supercompact Magidor forcing) was conceived to generalize Gitik-Sharon’s (GS) theorem to uncountable cofinalities [GS08]. Also, inspired by the subsequent inquiries of Cummings and Foremann [CF] on GS-model, Sinapova devised this forcing to obtain a generic extension where the following hold:
- (1)
There is a strong limit cardinal κ of uncountable cofinality,
2. (2)
SCHκ fails,
3. (3)
There is a very good and a bad scale at κ.
Hereafter, μ, κ, ⟨κξ∣ξ<μ⟩, λ and Θ will be as in the statement of Theorem 1.1. Besides, we will define ε:=supξ<μκξ and δ:=ε+. Since we are assuming GCH≥κ in our ground model, modulo a suitable preparation, we may assume that GCH≥ε holds, 2κξ=κξ+, for each ξ<μ, and that {κ}∪⟨κξ+1∣ξ<μ⟩ are Laver indestructible supercompact cardinals.222In this section and in the latter sections 4 and 5 we will simply use that κ is Laver indestructible. The indestructibility of ⟨κξ+1∣ξ<μ⟩ will be important in Section 6 for the proof of Lemma 6.11. Through this and the latter sections we will rely on the following standard convention:
Convention 2.1**.**
If P is a forcing notion and p∈P, we will denote by P↓p the set of conditions in P below p.
2.1. Sinapova forcing
Let A:=Add(κ,Θ), G⊆A generic and ⟨fη∣η∈Θ⟩ be an enumeration of the generic functions added by this filter. During this section our ground model will be V[G]. The next series of result can be found in [Sin08, Chapter 2].
Proposition 2.2**.**
There is a Θ+-supercompact embedding j:V→M with crit(j)=κ, such that, for each η<δ, j(fη)(κ)=η. Also, κξ<κ≤κξ+, for each ξ<μ limit.
Proposition 2.3**.**
For all ξ<μ and all X⊆P(Pκ(κξ)), there is a κξ-supercompact measure Uξ on Pκ(κξ) such that X∈Ult(V,Uξ). Also, there are functions ⟨Fηξ∣η<δ⟩, Fηξ:κ→κ such that, for each η<δ, jUξ(Fηξ)(κ)=η.
Proposition 2.4**.**
There is a ⊲-sequence of measures ⟨Uξ∣ξ<μ⟩ (i.e. Uξ∈Ult(V,Uξ′), for ξ<ξ′) and functions ⟨Fηξ∣ξ<μ,η<δ⟩, Fηξ:κ→κ such that, Uξ is a κξ-supercompact measure on Pκ(κξ), and for all ξ<μ and η<δ, jUξ(Fηξ)(κ)=η.
Notation 2.5**.**
**
For ξ<μ, x∈Pκ(κξ) and κ≤τ≤κξ, τx:=otp(τ∩x).
For ξ<μ and x,y∈Pκ(κξ), x≺y iff x⊆y and κξx<κy.
Let U=⟨Uξ∣ξ<μ⟩ and F=⟨Fηξ∣ξ<μ,η<δ⟩ be witness for Proposition 2.4. Since U is a ⊲-chain , for each ζ<ξ<μ, there is a function x↦Uξ,xζ, over Pκ(κξ) representing Uζ in the ultrapower by Uξ.
Moreover, by restricting this function to a Uξ-large set, we may assume that each Uξ,xζ is a κζx-supercompact measure on Pκx(κζx).
Definition 2.6**.**
For ξ<μ, let Xξ be the Uξ-large set of x∈Pκ(κξ) such that
κx* is a (κξ)x-supercompact cardinal above μ.*
For each ζ≤ξ,
κζx<κx≤κζx+. If ξ is limit, supζ<ξκζx=κξx.
κx<κξx.333This means that our choice of the x’s is coherent with the fact that κ<κξ.
Analogously to other Prikry-type forcing, Sinapova forcing is articulated by two components: the first one (stem) is responsible of adding a generic club on κ, and the second one (large set part) plays the role of supplying the stem with new extensions. For technical reasons it is standard to require the stems to be ≺-increasing sequences. Roughly, this constraint guarantees that these stems are sound promises for a generic club in κ and also that two different local versions of the forcing do not interfere between them.
Let ζ<ξ and x∈Xξ and let πζ,x:Pκx(κζ∩x)→Pκx(κζx) be the usual projection. Set Uξ,xζ:={A⊆Pκx(κζ∩x)∣πζ,x[A]∈Uξ,xζ}. This lifting yields a supercompact measure over Pκx(κζ∩x). In [Sin08, Section 2.2] the following coherence properties are proved:
Proposition 2.7** (Coherence properties).**
**
For each ρ<ζ<ξ<μ and for Uξ-many x’s, Uξ,xρ⊲Uξ,xζ.
For each ξ<μ,
[TABLE]
For ζ<ξ and A∈Uζ,
∀Uξx(A∩Pκx(x∩κζ))∈Uξ,xζ.
For each ζ<η<ξ, z∈Bξ and A∈Uξ,zζ,
[TABLE]
Set B=⟨Bξ∣ξ<μ⟩.
Definition 2.8** (Sinapova forcing).**
Under the above conditions, Sinapova forcing with respect to (κ,μ,U,B) is the partial order S(κ,μ,U,B)444Formally this definition depends also of the functions representing the different measures.
whose conditions are pairs (g,H) for which the following hold:
- (1)
dom(g)∈[μ]<ω* and dom(H)=μ∖dom(g).*
2. (2)
*For each ξ∈dom(g), g(ξ)∈Bξ and κg(ξ)>θ+μ+1.555 Here θ is an inaccessible cardinal witnessing [Sin08, Lemma 2.7]. This requirement is technical and is necessary for the construction of the bad and the very good scale in the generic extension. * Also, g is ≺-increasing.
3. (3)
For each ξ∈dom(H),
- (a)
If ξ>max(dom(g)), H(ξ)⊆Bξ and H(ξ)∈Uξ;
2. (b)
If ξ<max(dom(g)) then, setting ξg:=min(dom(g)∖ξ+1) and x:=g(ξg), H(ξ)∈Uξg,xξ.
4. (4)
*For ξ<ζ with ξ∈dom(g) and ζ∈dom(H), g(ξ)≺x, for all x∈H(ζ). *
For a condition p=(g,H) we say that g is the stem and H the large set of p. For η∈dom(gp), denote (g,H)↾η:=(g↾η,H↾η) and (g,H)∖η:=(g∖η,H∖η).
Definition 2.9**.**
Let p,q∈S.
p≤q* iff*
- (1)
gp⊇gq,
2. (2)
If ξ∈dom(gp)∖dom(gq) then gp(ξ)∈Hq(ξ),
3. (3)
*If ξ∈/dom(gp), Hp(ξ)⊆Hq(ξ),
*
p≤∗q* iff p≤q and both conditions have the same stem.*
Let p,q∈S with gp=gq=g. Define p∧q as the condition r:=(g,Hp∧Hq), where Hp∧Hq is the function with domain dom(Hp) such that ξ↦Hp(ξ)∩Hq(ξ).
An important feature of S is that, below any p∈S, S↓p can be decomposed as the product of two Sinapova forcings. This feature is shared with other Prikry-type forcings, as Magidor or Radin, and is crucial to control the combinatorics of VκS. Let us formulate this in more formal terms.
Let (g,G)∈S, {⟨ξ,x⟩}⊆g and ξ<μ be limit. For each η<ξ, set Vη:=Uξ,xη and V=⟨Uζ,xη∣η<ζ<ξ⟩. Also, for each ζ<ξ, find a sequence C=⟨Cη∣η<ξ⟩ of Vη-large sets witnessing Proposition 2.7 with respect to V. Now let S⟨ξ,x⟩:={(g,G)∣∃(h,H)∈S(g,G)=(h,H)↾ξ,∧h(ξ)=x},
and set S⟨ξ,x⟩:=(S⟨ξ,x⟩,≤⟨ξ,x⟩), where ≤⟨ξ,x⟩ is the induced order by ≤. One may argue that S⟨ξ,x⟩ is Sinapova forcing with respect to ⟨κx,ξ,V,C⟩, S⟨κx,ξ,V,C⟩. The following is also immediate.
Proposition 2.10** (Factorization).**
Let (g,G)∈S, {⟨ξ,x⟩}⊆g and ξ<μ be limit. There is (g,G′)≤∗(g,G) such that the following hold:
- (1)
The restriction map π between S↓(g,G′) and S⟨ξ,x⟩↓(∅,G′↾ξ) defines a projection.
2. (2)
S↓(g,G′)* is isomorphic to S⟨ξ,x⟩↓(∅,G′↾ξ)×S⟨κ,μ,U∖ξ+1,B∖ξ+1⟩↓(g∖ξ+1,G′∖ξ+1).*
Let S⊆S be a generic filter for Sinapova forcing. Set g∗:=⋃p∈Sgp, κξ∗:=κg∗(ξ) and ϑξ:=κξg∗(ξ), for each ξ<μ. The following is a summary of the main properties of S and V[S]:
Theorem 2.11** (Properties of S).**
**
- (1)
S* is a δ-Knaster forcing notion.*
2. (2)
S* has the Prikry property: namely, for each p∈S and each sentence φ in the language of forcing, there is q≤∗p so that q decides φ.*
3. (3)
Let ρ<κ and let ξ be a limit ordinal such that ϑξ+≤ρ<κξ+1∗. Then, P(ρ)V[S]=P(ρ)V[S↾ξ]. Further, if ρ≤κ0∗, P(ρ)V[S]=P(ρ)V.
Proposition 2.12**.**
The following hold in V[S]:
- (1)
All cardinals and cofinalities ≥δ are preserved.
2. (2)
Let ρ<κ be a V-cardinal such that for some limit ξ<μ and some k<ω, ϑξ+≤ρ<κξ+k∗. Then ρ is preserved and cof(ρ)=cofV(ρ). In particular, for each ξ<μ, κξ∗ is preserved and thus κ also.
3. (3)
κ* is a strong limit cardinal with cof(κ)=μ and 2κ=Θ. Hence, the SCHκ fails.*
4. (4)
*If ρ∈(κ,ε] is a V-regular cardinal, cof(ρ)=μ. Thus, all V-cardinals ρ∈(κ,ε] are collapsed to κ.
*
Another remarkable property of Sinapova model is the existence of a bad and a very good scale at κ. The concept of scale is the cornerstone of Shelah’s PCF theory [She94]. For more information about these objects see [She94], [CFM01] or [AM10]. In [Sin08, Section 2.5] it is showed how to define in V[S] these scales by using the sequence F.
Theorem 2.13** (Sinapova).**
In V[S] the following hold true:
- (1)
κ* is a strong limit cardinal with cof(κ)=μ and δ=κ+.*
2. (2)
2κ≥Θ, hence SCHκ fails.
3. (3)
There is a very good and a bad scale at κ.
3. Geometric criterion for genericity for S:
Hereafter S will be a shorthand for S(κ,μ,U,B).
The present section we will devoted to the proof a Mathias-like criterion of genericity for S. Our exposition is inspired on [Fuc14], where a similar characterization for Magidor forcing is proved.
Notation 3.1**.**
[∏ξ<μPκ(κξ)] stands for the set of all ≺-increasing sequences in ∏ξ<μPκ(κξ) (c.f. Notation 2.5).
For n<ω, [∏ξ<μPκ(κξ)]n denote the set of ≺-sequences of length n in ∏ξ<μPκ(κξ) . Analogously, [∏ξ<μPκ(κξ)]<ω denotes the set of finite ≺-sequences.
For g∈[∏ξ<μPκ(κξ)]<ω we respectively denote by max(g) and min(g) the ≺-maximum and ≺-minimum value of g.
Let S be a S-generic filter over V. This set S yields a function g∗∈[∏ξ<μBξ], which we will call the Sinapova sequence induced by S. In particular, V[g∗]⊆V[S]. As in Prikry forcing (see [Git10, §1.1]) there is a way to recover the generic S from the induced sequence g∗.
Definition 3.2**.**
For each g∗∈[∏ξ<μBξ], define
[TABLE]
Proposition 3.3**.**
For each g∗∈[∏ξ<μBξ], S(g∗) is a filter on S. Moreover, if S⊆S is a generic filter and g∗ is the induced Sinapova sequence, S(g∗)=S.
Proof.
The proof is a routine verification. The only point that it is worth mentioning is the following. Suppose that g∗ is the sequence induced by S, for some generic filter S⊆S. It is easy to check that S⊆S(g∗). In particular, by maximality of generic filters, S=S(g∗).
∎
It follows from the above that if S is S-generic over V and g∗ is the corresponding Sinapova forcing then V[S]=V[g∗]. The previous proposition suggests the next concept:
Definition 3.4**.**
Let V be an inner model of W and S∈V. A sequence g∗∈[∏ξ<μBξ]∩W is S-generic over V if S(g∗) is a S-generic filter over V.
Proposition 3.5**.**
Let V be an inner model of W and S∈V. If g∗∈[∏ξ<μBξ]∩W is S-generic over V then the following hold:
- (1)
For each sequence H∈V∩∏ξ<μUξ, there is ξH<μ such that for all ordinal η∈(ξH,μ), g∗(η)∈H(η).
2. (2)
For each ξ<μ limit and each H∈V∩∏θ<ξUξ,g∗(ξ)θ, there is ξH<ξ such that for all ordinal η∈(ξH,ξ), g∗(η)∈H(η).
Proof.
We shall just sketch the proof for property (2) as the proof for the (1) is analogous. Let ξ<μ be a limit ordinal and a function H∈V∩∏θ<ξUξ,xθ. Since g∗ is generic, we may let (g,G)∈S(g∗) with g={⟨ξ,g∗(ξ)⟩}. Set
DH:={(i,I)≤(g,G)∣∃θ∈ξ∀η∈(θ,ξ)I(η)⊆H(η)}.
It is not hard to check that DH is dense below (g,G), hence DH∩S(g∗)=∅. Let (i,I) be a condition in this set and θi<ξ be a witness for (i,I)∈DH. Setting ξH:=θi it is routine to check that, for all η∈(ξH,ξ), g∗(η)∈H(η).
∎
The goal of this section is precisely to prove that the above properties already characterize those sequences which are S-generic over V.
Theorem 3.6** (Criterion for genericity).**
Let V be an inner model of W and S∈V. For a sequence g∗∈[∏ξ<μBξ]∩W,
g∗ is S-generic over V if and only if properties (1) and (2) of Proposition 3.5 hold.
We will tackle the proof of Theorem 3.6 in the next three subsections.
3.1. One step extensions and pruned conditions
Definition 3.7**.**
For each s∈[μ]<ω, define:
The left operator ℓs is the map ℓs:μ→μ∪{−1} defined by
[TABLE]
The right operator rs is the map rs:μ→μ+1 defined by rs(ξ):=min((s∪{μ})∖ξ+1).
Definition 3.8** (One-step extension).**
Let (g,G)∈S, ξ∈dom(G) and x∈G(ξ). Define (g,G)↷{⟨ξ,x⟩} as the pair (f,F), where f:=g∪{⟨ξ,x⟩} and F is the function with dom(F)=dom(G)∖{ξ} defined as
[TABLE]
For 1≤n<ω and a function f∈[∏ξ∈sBξ] with s∈[dom(G)]n, (g,G)↷f is defined by recursion as ((g,G)↷f↾n−1)↷{⟨sn−1,f(sn−1)⟩}.666By convention, (g,G)↷∅:=(g,G).
Remark 3.9**.**
Observe that not for all functions f∈[∏ξ∈sG(ξ)] the pair (g,G)↷f yields a condition in S: it may be the case that, for some ⟨ξ,f(ξ)⟩∈f, G(η)∩Pκf(ξ)(κη∩f(ξ))∈/Uξ,f(ξ)η, for rdom(g∪f)(η)=ξ.
Proposition 3.10**.**
Let (g,G)∈S and ξ∈dom(G).
- (1)
If there is a condition (f,F)≤(g,G) with g∪{⟨ξ,x⟩}=f, then (g,G)↷{⟨ξ,x⟩}∈S. Moreover, this is the ≤-greatest condition witnessing this property.
2. (2)
There is (g,Gξ,+)≤∗(g,G) such that for all x∈Gξ,+,
[TABLE]
Proof.
For (1), observe that it is enough with guaranteeing that G(η)∩Pκx(κη∩x)∈Uξ,xη, for η<ξ. Notice that this outright follows from (f,F)≤(g,G). For (2) we argue as follows. For η∈dom(G)∖{ξ}, set Gξ,+(η):=G(η). Now let ν:=rdom(g)(ξ) and σ:=ℓdom(g)(ξ). Without loss of generality assume that ν<μ, as otherwise the argument is similar. By using (⋄) of Proposition 2.7 it follows that for each ρ∈(σ,ξ), there is Aρ∈Uν,g(ν)ξ such that for each x∈Aρ, G(ρ)∩Pκx(κρ∩x)∈Uξ,xρ. Set Gξ,+(ξ):=G(ξ)∩⋂ρ∈(σ,ξ)Aρ. It is routine to check that (g,Gξ,+) is as desired.
∎
One can appeal recursively to Proposition 3.10 (1) to obtain the analogous result for functions f∈[∏ξ∈sBξ], s∈[dom(G)]<ω. The next concept will be useful in future arguments.
Definition 3.11**.**
A condition (g,G)∈S is said to be pruned if for all s∈[dom(G)]<ω and all f∈[∏ξ∈sG(ξ)], (g,G)↷f∈S.
Proposition 3.12**.**
A condition (g,G) is pruned iff for each ⟨ξ,x⟩∈G,
(g,G)↷{⟨ξ,x⟩}∈S.
Proof.
The first implication is obvious. For the converse let us argue, by induction over n≥1, that for each s∈[dom(G)]n and f∈[∏ξ∈sG(ξ)], (g,G)↷f∈S. For n=1 this follows from our hypothesis. Also, the inductive step follows by combining the recursive definition of (g,G)↷f, the induction hypothesis and our assumption.
∎
Arguing similarly to Proposition 3.10 one can prove the next strengthening of clause (2).
Proposition 3.13**.**
Let (g,G)∈S. There is a condition (g,G∗)∈S ≤∗-below (g,G) which is pruned.
3.2. The Strong Prikry Property for S
In this section we will prove that the usual strengthening of the Prikry property known as Strong Prikry property holds for S. For the sake of completeness we formulate this principle in the particular context of Sinapova forcing.
Notation 3.14**.**
For (g,G)∈S and s∈[dom(G)]<ω, set Ss(g,G):={(i,I)≤(g,G)∣dom(i)=dom(g)∪s}. Let Ss(g,G) be Ss(g,G) endowed with the induced order. Define S⊇s(g,G) analogously.
Definition 3.15** (Strong Prikry Property).**
We will say that S has the Strong Prikry Property (SPP, for short) if the following property holds: For each condition (g,G)∈S and each dense open set D⊆S, there is (g,G∗)≤∗(g,G) and s∈[dom(G)]<ω such that S⊇s(g,G∗)⊆D.
Lemma 3.16**.**
Let (g,G)∈S, D⊆S be dense open and s∈[dom(G)]<ω. There is a condition (g,Gs)≤∗(g,G) be such that
[TABLE]
Proof.
We argue by induction over n=∣s∣. If n=0, then we ask whether there is (g,G~)≤∗(g,G) witnessing (∗∅). If the answer to our query is affirmative then we let G∅ be such G~. Otherwise, set G∅:=G. It is easy to check that (g,G∅) is as desired.
Now assume that for (h,H)∈S and each t∈[dom(G)]n, there is (h,Gt)≤∗(h,H) witnessing (∗t). Let s be with ∣s∣=n+1. Also, say with δ:=min(s). Set t:=s∖{δ} and ξ:=rdom(g)(δ). For each y∈G(δ), let (gy,Gy):=(g,G)↷{⟨δ,y⟩} and (gy,Gy,t)≤∗(gy,Gy) witnessing (∗t). Now look at the set of y∈G(δ) for which the property (∗t) is non-trivial. Namely, set X:={y∈G(δ)∣St(gy,Gy,t)∩D=∅}. If X∈Uξ,g(ξ)δ, set Y:=X and, otherwise, let Y to be the complement. Let (g,Gs)≤∗(g,G) be the diagonalization of {(gy,Gy,t)∣y∈Y} (see [Sin08, Proposition 2.12]).
Claim 3.17**.**
(g,Gs)≤∗(g,G)* and witnesses (∗s).*
Proof of claim.
The first property is obvious so we are left with verifying that (∗s) holds. Without loss of generality, assume that Ss(g,Gs)∩D=∅.
Let (i,I)∈Ss(g,Gs)∩D. By definition of diagonalization, (i,I)≤(gy,Gy,t), where y=i(δ)∈Y. Hence, (i,I)∈St(gy,Gy,t)∩D, and thus y∈X∩Y. This shows that Y=X.
Now let (f,F)∈S⊇s(g,Gs). Again, by the definition of diagonalization, (f,F)∈S⊇t(gy,Gy,t), for y=f(δ)∈Y. Since X=Y, St(gy,Gy,t)∩D=∅, hence, by (∗t), S⊇t(gy,Gy,t)⊆D, and thus (f,F)∈D. Altogether, S⊇s(g,Gs)⊆D, which yields (∗s).
∎
∎
Lemma 3.18**.**
Let (g,G)∈S and D⊆S be dense open. There is a condition (g,G)∗≤∗(g,G) such that
[TABLE]
In particular, S has the SPP.
Proof.
For each s∈[dom(G)]<ω, let (g,Gs)≤(g,G) be given by Lemma 3.16. For each ξ∈dom(G), set G∗(ξ):=⋂{Gs(ξ)∣ξ∈s}. Observe that (g,G∗)∈S by Definition 2.6(α) and μ<ℵ0=μ. Evidently, (g,G)∗:=(g,G∗) satisfies (∗). For the last clause, since D is dense, there is s with Ss(g,G)∗∩D=∅, so that S⊇s(g,G)∗⊆D.
∎
One can be a bit more ambitious and require that (g,G)∗ and (g,G) would be equal up to some ξ∈dom(g). More formally, (g,G)↾ξ+1∗=(g,G)↾ξ+1. This more general result follows by combining Lemma 3.18 with the following result:
Lemma 3.19** (Diagonalization).**
Let (g,G)∈S, ξ∈dom(G) and η∈dom(g)∩ξ. Assume that A∈Uξ and A=⟨(gx,Gx)∣x∈A⟩ is a family of conditions below (g,G) with gx:=g∪{⟨ξ,x⟩} and (gx,Gx)↾η+1=(g,G)↾η+1. Then, there is (g,G∗)≤(g,G) such that (g,G∗)↾η+1=(g,G)↾η+1 which diagonalizes the family A.
We omit the proof of the above as it is identical to the proof of [Sin08, Proposition 2.12]. Bearing this in mind, one can use Lemma 3.18 to prove the following:
Lemma 3.20**.**
Let (g,G)∈S, D⊆S be dense open and η∈dom(g). There is (g,G)∗,η≤(g,G) such that if (i,I)≤(g,G)∗,η is in D then, for each (j,J)≤(i,I)↾η+1⌢(g,G)∖η+1∗,η, (j,J)∈D.
The proof runs in parallel to [Sin08, Corollary 2.14]: here instead of appealing to [Sin08, Proposition 2.13] one invokes Lemma 3.18.
3.3. The proof of the criterion
We are now in conditions to complete the proof of Theorem 3.6. Recall that we are left with showing that if g∗∈[∏ξ<μBξ]∩W witnesses properties (1) and (2) of Proposition 3.5 then g∗ is S-generic over V.
Proof of Theorem 3.6.
Towards a contradiction, assume that the implication was false. Let κ be the first cardinal for which we can define a Sinapova forcing S:=S(κ,μ,U,B) and for which there is some g∗∈[∏ξ<μB(ξ)] satisfying (1) and (2) but not being generic.
Henceforth D⊆S will be an arbitrary but fixed dense open set. We aim to prove that D∩S(g∗)=∅. We will be arguing in a similar fashion to [Git10, Theorem 1.12].
Set St:={g∈[∏ξ<μBξ]<ω∣∃G(g,G)∈S}. For each g∈St, set (g,Gg):=\mathds1↷g and777Since g∈St observe that Proposition 3.10 and the subsequent comments guarantee that \mathds1↷g∈S.
[TABLE]
where (g,Gg)∗ and (g,Gg)∗,ξ are the conditions given by Lemma 3.18 and Lemma 3.20, respectively.
For each ξ<μ and x∈Pκ(κξ) set Stξ,x:={g∈St∣dom(g)⊆ξ,max(g)≺x}. Observe that ∣Stξ,x∣≤∣Pκx(x)∣<κ. Thus,
G∗(ξ):=△x∈Pκ(κξ)(⋂g∈Stξ,xG~g(ξ))∈Uξ. This process yields a function G∗∈V∩∏ξ<μUξ. Set s:=(∅,G∗). Appealing to property (1) we find ξ∗<μ limit such that g∗(η)∈G∗(η), for each η∈(ξ∗,μ). Set g−∗:=g∗↾ξ∗, Vη:=Uξ∗,g∗(ξ∗)η and Cη:=Bη∩Pκg∗(ξ∗)(κη∩g∗(ξ∗)), for each η<ξ∗. Set V:=⟨Vη∣η<ξ∗⟩, C:=⟨Cη∣η<ξ∗⟩ and S(κg∗(ξ∗),ξ∗,V,C) be the corresponding Sinapova forcing. Clearly, g−∗ witnesses (1) and (2), and κg∗(ξ∗)<κ, hence S(g−∗) is a generic filter for S(κg∗(ξ∗),ξ∗,V,C). Let p−∗:=(∅,I↾ξ∗)∈S(g−∗). Define p∗:=({⟨ξ∗,g∗(ξ∗)⟩,H∗), where dom(H∗):=μ∖{ξ∗} and
[TABLE]
where I(η) denotes the lifting of I(η) to Pκg∗(ξ∗)(κη∩g∗(ξ∗)). Clearly, p∗∈S. Moreover, by appealing to Proposition 3.13, we may assume that p∗ is pruned.
By a very similar argument to Proposition 2.10 (1), there is a projection between S↓p∗ and S(κg∗(ξ∗),ξ∗,V,C)↓p−∗. Let π be such projection and set Dp∗:=D∩S↓p∗. Clearly, π[Dp∗] is dense and open in S(κg∗(ξ∗),ξ∗,V,C)↓p−∗. Since p−∗∈S(g−∗), it follows that S(g−∗)∩π[Dp∗]=∅. Let (f,F)∈Dp∗ be such that π(f,F)∈S(g−∗)∩π[Dp∗].
Claim 3.21**.**
(f,F)≤(g,G~g), where g:=f↾ξ∗+1.
Proof of claim.
Clearly, g⊆f.
▶ Let ξ∈dom(f)∖dom(g). Then ξ∗<ξ, so that, since (f,F)≤p∗, F(ξ)⊆H∗(ξ). By definition of diagonal intersection, and since max(g)=g∗(ξ∗), H∗(ξ)⊆G~g(ξ).
▶ Let ξ∈dom(G~g). If ξ∗<ξ then one may argue as before that F(ξ)⊆G~g(ξ). Thus, assume ξ<ξ∗. Since (g,G~g)↾ξ+1=(g,Gg)↾ξ+1=(\mathds1↷g)↾ξ+1, we have G~g(ξ)=Gg(ξ)=Pκg(η)(κξ∩g(η)), where η:=rdom(g)(ξ). Since f↾ξ∗+1=g↾ξ∗+1, clearly F(ξ)∈Uη,g(η)ξ and thus F(ξ)⊆G~g(ξ).
∎
Now let (f∗,F∗) be defined as
[TABLE]
This gives a condition in S, because p∗ was pruned and g∗(ξ)≺g∗(η)∈G∗(η), for η∈(ξ∗,μ). Observe that (f∗,F∗) is also pruned.
Claim 3.22**.**
(f∗,F∗)∈D∩S(g∗).
Proof of claim.
By combining the definition of (g,G~g), the above claim and the fact that (f,F)∈D, it follows that (f∗,F∗)∈D. The verification that (f∗,F∗)∈S(g∗) is mere routine.
∎
From the above arguments we infer that D∩S(g∗)=∅ hence, g∗ is S-generic over V. This produces a contradiction with our initial assumption on κ and S.
∎
For future reference we also include the proof of a general version of the classical Röwbottom lemma [Kan08, Theorem 7.17].
Definition 3.23**.**
Let g∈[∏ξ∈dom(g)Bξ] and s∈[μ∖dom(g)]<ω. A sequence ⟨Hθ∣θ∈s⟩, is amenable to ⟨g,s⟩ if for each θ∈s, if η:=rdom(g)(θ)<μ, then Hθ∈Uη,g(η)θ and, otherwise, Hθ∈Uθ.
A sequence ⟨Hθ∣θ∈μ∖dom(g)⟩ is said to be amenable to ⟨g⟩ if, for each s∈[μ∖dom(g)]<ω, ⟨Hθ∣θ∈s⟩ is amenable to ⟨g,s⟩.
Lemma 3.24** (Generalized Röwbottom’s lemma).**
Let
g be a sequence in [∏ξ∈dom(g)Bξ] and ⟨Hθ∣θ∈μ∖dom(g)⟩ be amenable to ⟨g⟩.
For each function c:[∏θ∈μ∖dom(g)Hθ]<ω→ϑ with ϑ≤μ, there is ⟨Hθ∗∣θ∈μ∖dom(g)⟩ amenable to ⟨g⟩ such that the following hold:
- (1)
for each θ∈μ∖dom(g), Hθ∗⊆Hθ;
2. (2)
⟨Hθ∗∣θ∈μ∖dom(g)⟩* is homogeneous for c: namely, for each n<ω and each s∈[μ∖dom(g)]n, the function c↾[∏θ∈sHθ∗] is constant.*
Proof.
Arguing by induction over n<ω, we will prove that for each function cˉ:[∏θ∈μ∖dom(g)Hθ]n→ϑ and s∈[μ∖dom(g)]n, there is a sequence Hs=⟨Hθs∣θ∈s⟩ which is amenable to ⟨g,s⟩ and such that c↾[∏θ∈sHθs] is constant. If n=1 the claim follows by appealing to the μ+-completedness of all the measures involved (see Definition 2.6(α)). Thus,
we shall assume that the result holds for each 1≤m≤n and will infer from this that it holds for n+1.
Fix cˉ:[∏θ∈μ∖dom(g)Hθ]n+1→ϑ be a function and let s∈[μ∖dom(g)]n+1. Set max(s)=ηs. Say, ξs:=rdom(g)(ηs) and assume, for instance, that ξs<μ. Thus, Hηs∈Uξηs,g(ξηs)ηs. For each g∈[∏θ∈s∩ηsHθ], let cg:Hηs→ϑ be the function defined by x↦cˉ(g∪{⟨ηs,x⟩}), provided max(g)≺x, or [math] otherwise. Appealing to the case n=1, for each such g we obtain ⟨Hgs⟩ which is amenable to ⟨g,{ηs}⟩ and homogeneous with respect to cg. Pick ϑg∈ϑ be the constant value of cg witnessing this. Let Hηss=△{Hgs:g∈[∏θ∈s∩ηsHθ]}, where recall that this diagonal intersection is defined as
[TABLE]
By normality of the measure Uξs,g(ξs)ηs, Hηss∈Uξηs,g(ξηs)ηs. On the other hand, let c∗:[∏θ∈μ∖dom(g)Hθ]n→ϑ be the function sending each g to ϑg, in case g∈[∏θ∈s∩ηsHθ], or [math] otherwise. By the induction hypothesis there is Hs∩ηs=⟨Hθs∩ηs∣θ∈s∩ηs⟩ which is amenable to ⟨g,s∩ηs⟩ and c⋆↾[∏θ∈s∩ηsHθs∩ηs] has constant value ϑ∗.
We claim that Hs=Hs∩ηs∪{⟨ηs,Hηss⟩} witnesses the inductive step relative to the function cˉ and the set s. It is easy to check that Hs is amenable to ⟨g,s⟩. For homogeneity, let f∈[∏θ∈sHθs] and say that f=g∪{⟨ηs,x⟩}, where g∈[∏θ∈s∩ηsHθs]. Since x∈Hηss and max(g)≺x, by definition of diagonal intersection, x∈Hgs. Thus, cg(x)=ϑg=ϑ∗. On the other hand, cˉ(f)=cg(x), so that cˉ(f)=ϑ∗. Since the choice of s was arbitrary, the inductive step follows.
For each n<ω use the previous argument to obtain a sequence ⟨Hs∣s∈[μ∖dom(g)]n⟩, Hs=⟨Hθs∣θ∈s⟩, such that Hs is amenable to ⟨g,s⟩ and c↾[∏θ∈sHθs] is constant. Define ⟨Hθ∗∣θ∈μ∖dom(g)⟩ as Hθ∗:=⋂{Hθs:s∈[μ∖dom(g)]<ω,θ∈s}.
Since all the measures involved are μ+-complete this process yields a sequence
⟨Hθ∗∣θ∈μ∖dom(g)⟩ which is amenable to ⟨g⟩. Finally,
it is routine to check that this sequence is homogeneous for c.
∎
4. The main forcing construction
The present section will be devoted to introduce the main forcing construction of the paper. This forcing is a variation of the forcings appearing in [Ung13] or in [GP18], where the Supercompact Prikry/ Magidor forcing is replaced by Sinapova forcing. This new choice will be the responsible of the very good and the bad scale in the generic extension. For enlightening the argument we will simply give details for the construction in case Θ=λ+. The general definition can be easily inferred from our arguments. For more details we refer the reader to [FHS18, §4].
Notation 4.1**.**
For each x⊆λ+, Ax:=(Add(κ,x),⊇).
For each y⊆x⊆λ+ and H⊆Ax a generic filter, H↾y will denote the generic filter induced by H and the standard projection between Ax and Ay.
Let G⊆Aλ+ generic over V. Since κ is Laver indestructible there is in V[G] a ⊲-increasing sequence Uλ+=⟨Uξ∣ξ<μ⟩ of supercompact measures on Pκ(κξ), ξ<μ. With Uλ+ we find a sequence Bλ+=⟨Bξ∣ξ<μ⟩ witnessing Proposition 2.7 and later define the corresponding
Sinapova forcing Sλ+:=S(κ,μ,U,B)∈V[G]. For each such ξ, let U˙ξ and B˙ξ be Aλ+-nice names for each of such objects. The next result shows that there are many intermediate extensions of V[G] where (Uλ+,Bλ+) projects. For details the reader is referred to [FHS18, Lemma 3.3] or to [GP18, Lemma 3.1] where a similar result is proved.
Lemma 4.2**.**
There is an unbounded set of ordinals A⊆λ+, closed under taking limits of ≥δ-sequences, such that, for each α∈A and each generic filter G⊆Aλ+, ⟨(U˙ξ)G∩V[G↾α]∣ξ<μ⟩,
⟨(B˙ξ)G∩V[G↾α]∣ξ<μ⟩ are suitable to define Sinapova forcing in V[G↾α].
Notation 4.3**.**
For each α∈A, let Uα and Bα be the sequences witnessing Lemma 4.2. Let S˙α be a Aα-name representing the Sinapova forcing S(κ,μ,Uα,Bα)∈V[G↾α].
Proposition 4.4**.**
Work in V[G]. For each α∈A, Sλ+ projects onto Sα.
Proof.
Let α∈A.
For g∗∈[∏ξ<μBξ] being a Sλ+-generic sequence set hα∗:=⟨g∗(ξ)∩V[G↾α]∣ξ<μ⟩. Clearly, hα∗∈[∏ξ<μBα(ξ)]. By appealing to Theorem 3.6 we infer that hα∗ is Sα-generic over V. In particular, each Sλ+-generic filter induces a Sα-generic filter, hence Sλ+ projects onto Sα.
∎
Before presenting our forcing it is convenient to discuss a technical issue that we will have to overcome. If one looks at Mitchell’s original proof of TP(ℵ2) [Mit72] one will immediately realize that both the Cohen component and the collapsing component need to have the same length. More formally, if we aim to add λ+-many subsets to κ (i.e. the Cohen part is Add(κ,λ+)) then the collapsing component will collapse the interval (κ,λ+). Thus, if one pretends to preserve λ, the corresponding Mitchell forcing should exhibit a
mismatch between both components. To overcome this difficulty we shall proceed as in [FHS18] and [GP18] defining a system of projections between Aλ+∗S˙λ+ and a family of intermediate forcings.
Let β0∈A∖λ+1 and π:β0→Even(λ) be a bijection888For an ordinal α, Even(α) stands for the set of all even and limit ordinals ≤α. . Hereafter, β0 will be fixed. The particular choice of this ordinal is not relevant, we could just have taken any other in A∖λ+1. Clearly, π entails an ∈-isomorphism between VAβ0 and VAEven(λ). Thus, defining U˙β0π:=π(U˙β0), (Uβ0π)π[G↾β0]=(U˙β0)G↾β0=Uβ0. Similarly with Bβ0. Say that Uξπ and Bξπ are the components of these sequences. For the ease of notation, let H be the AEven(λ)-generic filter generated by π[G↾β0]. The proof of the next result is analogous to Lemma 4.2.
Lemma 4.5**.**
There is an unbounded set of cardinals B⊆λ closed under taking limits of ≥δ-sequences, such that for each α∈B and each generic filter K⊆AEven(λ), the sequences ⟨(U˙ξπ)G∩V[K↾Even(α)]∣ξ<μ⟩ and
⟨(B˙ξπ)G∩V[K↾Even(α)]∣ξ<μ⟩ are suitable to define Sinapova forcing in V[K↾Even(α)].
Notation 4.6**.**
For each α∈B, let Uαπ and Bαπ denote the sequences witnessing Lemma 4.5. By convention, Uλπ:=Uβ0 and Bλπ:=Bβ0.
For each α∈B∪{λ}, let S˙απ be a AEven(α)-name for the Sinapova forcing S(κ,μ,Uαπ,Bαπ)∈V[H↾Even(α)].
The next lemma follows essentially from Proposition 4.4. For details see [FHS18, Lemma 3.8].
Lemma 4.7**.**
Let A^=(A∩(β0,λ+))∪{λ+}.
- (1)
For every γ,γ~∈A^ with γ<γ~, there is a projection
[TABLE]
2. (2)
For every γ∈A^ and α∈B, there is a projection
[TABLE]
3. (3)
For every γ∈A^ and α∈B, let σ^αγ be the extension of σαγ to the Boolean completion of Aγ∗S˙γ
[TABLE]
Then the projections commute with σαλ+:
[TABLE]
Definition 4.8** (Main forcing).**
A condition in R is a triple (p,q˙,r) for which all the following hold:
- (1)
(p,q˙)∈Aλ+∗S˙λ+;
2. (2)
r* is a partial function with dom(r)∈[B]<δ;*
3. (3)
For every γ∈dom(r), r(γ) is a AEven(γ)∗S˙γπ-name such that
[TABLE]
For conditions (p0,q˙0,r0),(p1,q˙1,r1) in R we will write (p0,q˙0,r0)≤R(p1,q˙1,r1) iff (p0,q˙0)≤Aλ+∗S˙λ+(p1,q˙1), dom(r1)⊆dom(r0) and for each γ∈dom(r1),
\sigma^{\lambda^{+}}_{\gamma}(p_{0},q_{0})\Vdash_{\mathbb{A}_{\rm{Even}(\gamma)}\ast\dot{\mathbb{S}}^{\pi}_{\gamma}}\text{``r_{0}(\gamma)\leq r_{1}(\gamma)''}.
Definition 4.9**.**
U* will denote the pair (U,≤) where U:={(\mathds1,\mathds1˙,r)∣(\mathds1,\mathds1˙,r)∈R} and ≤ is the order inherited from R. Set Rˉ:=(Aλ+∗S˙λ+)×U.*
The next result follows from standard arguments.
Proposition 4.10**.**
**
- (1)
U* is δ-directed closed.*
2. (2)
The function ρ:Rˉ→R given by ⟨(p,q˙),(\mathds1,\mathds1˙,r)⟩↦(p,q˙,r) entails a projection. In particular,
VAλ+∗S˙λ+⊆VR⊆VRˉ.
3. (3)
VAλ+∗Sλ+* and VR have the same <δ-sequences.*
Let Rˉ⊆Rˉ a generic filter whose projection onto Aλ+ generates the generic filter G. Also, let R⊆R be the generic filter generated by ρ[Rˉ] and S⊆Sλ+ be the generic filter over V[G] induced by Rˉ.
Proposition 4.11** (Some properties of R).**
**
- (1)
R* is λ-Knaster. In particular, all V-cardinals ≥λ are preserved.*
2. (2)
R* preserves κ and δ. Also, it collapses all the V-cardinals of (κ,δ) to κ and all the V-cardinals of (δ,λ) to δ. In particular, V[R]\models\text{``\delta=\kappa^{+},\wedge,\lambda=\kappa^{++}''}.*
3. (3)
V[R]\models\text{``2^{\kappa}=\lambda^{+}=\kappa^{+3}''}.
4. (4)
V[R]\models\text{``\kappaisstronglimitwith\mathrm{cof}(\kappa)=\mu''}.
5. (5)
In V[R] there is a bad and a very good scale at κ. In particular, □κ∗ fails and thus there are no special κ+-Aronszajn trees.
Proof.
- (1)
It follows from a similar argument to [GP18, Lemma 3.6].
2. (2)
Let θ∈{κ,δ}∪(κ,δ)∪(δ,λ) and let us discuss what happens in each case. If θ=κ it is enough to prove that Aλ+∗S˙λ+ preserves it, and this follows from a standard argument combining the κ-closedness of Aλ+ with the Prikry property and the κ-closedness of ⟨S˙λ+,≤∗⟩. If θ=δ the argument is similar but now appealing to Easton’s lemma (see e.g. [Kun14]). If θ∈(κ,δ), it is clear that R collapses θ because there is a projection between R and Aλ+∗S˙λ+, and this last forcing collapses the interval (κ,δ) (cf Proposition 2.12(4)). Finally, assume that θ∈(δ,λ) and let η∈B∩(δ,λ) with η>θ. It is easy to see that there is a projection between R and RO+(AEven(η)∗S˙ηπ)∗Add˙(δ,1). By standard arguments this latter iteration collapses the interval (δ,η] and thus θ.
3. (3)
The first equality follows by counting R-nice names and from the existence of a projection between R and Aλ+. For the latter, use item (2).
4. (4)
Clearly it suffices to argue that in V[G∗S˙] the property holds. Nevertheless, observe that this is true by Proposition 2.12(3).
5. (5)
This follows from the existence of a very good (resp. bad) scale in V[G∗S˙] (see Theorem 2.13), (κ+)V[G∗S˙]=(κ+)V[R]=δ and the fact that V[G∗S˙] and V[R] have the same <δ-sequences.
∎
5. TP(κ++) holds
In the present section we will prove that V[R]⊨TP(κ++). For enlightening the presentation, once again, we will simply give details for the proof in case γ=λ+. A sketch of the main ideas involved in the proof of the more general result can be found in [FHS18] or in [GP18].
Let us briefly summarize the structure of the argument. First we beging proving that any counterexample for TP(λ) in V[R] lies in an intermediate extension of R. More formally, any λ-Aronszajn tree in V[R] is a λ-Aronszajn tree in a generic extension given by some truncation of R (see Proposition 5.3). These truncations have the important feature that they are isomorphic to a Mitchell forcing R∗ without mismatches between the Cohen and the collapsing component.
In latter arguments we shall again consider truncations of R∗, R∗↾γ, and use the weak compactness of λ to prove that any λ-Aronszajn tree in VR∗ reflects to a γ-Aronszajn tree in VR∗↾γ (see Lemma 5.12). Then, we will be in conditions to use Unger’s ideas [Ung13] to show that there are no γ-Aronszajn trees in VR∗↾γ, and thus that V[R]⊨TP(λ). Let β0∈A∖λ+1 be the ordinal fixed in the previous section.
Definition 5.1** (Truncations of R).**
Let α∈A∩(β0,λ+). A condition in R↾α is a triple (p,q˙,r) for which all the following hold:
- (1)
(p,q)∈Aα∗S˙α;
2. (2)
r* is a partial function with dom(r)∈[B]<δ;*
3. (3)
For every β∈dom(r), r(β) is a AEven(β)∗S˙βπ-name such that
[TABLE]
For conditions (p0,q˙0,r0),(p1,q˙1,r1) in R↾α we will write (p0,q˙0,r0)≤(p1,q˙1,r1) in case (p0,q˙0)≤AEven(β)∗S˙βπ(p1,q˙1), dom(r1) ⊆dom(r0) and for each β∈dom(r1),
\sigma^{\alpha}_{\beta}(p_{0},q_{0})\Vdash_{\mathbb{A}_{\mathrm{Even}(\beta)}\ast\dot{\mathbb{S}}^{\pi}_{\beta}}\text{``\dot{r}{0}(\beta)\leq\dot{r}{1}(\beta)''}.
The proof of the next result is essentially the same as [FHS18, Lemma 3.13] or [GP18, Lemma 3.8].
Proposition 5.2**.**
Let α∈A∩(β0,λ+). Then there is a projection between R and RO+(R↾α).
Proposition 5.3**.**
Let T˙ be a R-name for a λ-Aronszajn tree. There is β∗∈A∩(β0,λ+), such that V^{\mathbb{R}\upharpoonright\beta^{*}}\models\text{``Tisa\lambda-Aronszajn tree''}
Proof.
Let T˙ be a R-name for a λ-Aronszajn tree T. Without loss of generality, \mathds1R⊩RT˙⊆λ. Let {Aα}α<λ be a family of maximal antichains deciding ‘‘α∈T˙”. Set A∗:=⋃α∈λAα and observe that ∣A∗∣≤λ. In particular, there is some β∗∈A∩(β0,λ+) be such that dom(p)⊆κ×β∗, for any condition (p,q˙,r)∈A∗. Clearly {Aα}α<λ is a family of maximal antichains in R↾β∗ deciding the same properties, hence V^{\mathbb{R}\upharpoonright\beta^{*}}\models\text{``Tis\lambda-Aronszajn''}.
∎
Let π∗:β∗→λ be a bijection extending π. We use π∗ to define an ∈-isomorphism between VAβ∗ and VAλ.999This choice will guarantee that our future construction coheres with the previous one.
Again, Uλπ∗:=π∗(U˙β∗)π∗[G↾β∗] is a ⊲-increasing sequence of measures which (pointwise) extends the sequence Uλπ. Similarly, define Bλπ∗:=π∗(Bβ∗)π∗[G↾β∗].
Let Sλπ∗:=S(κ,μ,Uλπ∗,Bλπ∗). For the ease of notation, let H∗ be the AEven(λ)-generic filter generated by π∗[G↾β∗].
Proposition 5.4**.**
**
- (1)
There is an isomorphism φ:Aβ∗∗S˙β∗→Aλ∗S˙λπ∗.
2. (2)
For each β∈B the function ϱβλ=σββ∗∘φ−1 establishes a projection between Aλ∗S˙λπ∗ and RO+(AEven(β)∗S˙βπ).
Proof.
For (1), observe that the subposet of Aβ∗∗S˙β∗ formed by conditions of the form (p,(gˇ,H˙)), is dense. Analogously, for Aλ∗S˙λπ∗. It is routine to check that (p,(gˇ,H˙))↦(π∗(p),(gˇ,π∗(H˙))) defines an isomorphism between these two dense subposets. Observe that now (2) is immediate as σββ∗ is a projection.
∎
Definition 5.5**.**
A condition in R∗ is a triple (p,q˙,r) for which all the following hold:
- (1)
(p,q)∈Aλ∗S˙λπ∗;
2. (2)
r* is a partial function with dom(r)∈[B]<δ;*
3. (3)
For every β∈dom(r), r(β) is a AEven(β)∗S˙βπ-name such that
[TABLE]
For conditions (p0,q˙0,r0),(p1,q˙1,r1) in R∗ we will write (p0,q˙0,r0)≤(p1,q˙1,r1) in case (p0,q˙0)≤AEven(β)∗S˙βπ(p1,q˙1), dom(r1) ⊆dom(r0) and for each β∈dom(r1),
ϱβλ(p0,q0)⊩AEven(β)∗S˙βπr˙0(β)≤r˙1(β).
Proposition 5.6**.**
R∗* and R↾β∗ are isomorphic. In particular, R∗ forces that T˙ is a λ-Aronszajn tree.*
Proof.
It is not hard to check that (p,q˙,r)↦(φ(p,q˙),r) defines an isomorphism between both forcings.
∎
Given a weakly compact cardinal θ the weakly compact filter on θ, Fθ, is the filter defined by all subsets X⊆θ such that θ∖X* is not Π11-indescribable in θ*. The filter Fθ is proper and normal (see [Kan08, Proposition 6.11]), hence it extends Club(θ), and thus concentrates on the set of Mahlo cardinals below θ.
Lemma 5.7**.**
There is B∗∈(Fλ)V, B∗⊆B, with δ<minB∗ such that for every α∈B∗, the sequences ⟨(U˙ξπ∗)H∗∩V[H↾α]∣ξ<μ⟩, ⟨(B˙ξπ∗)H∗∩V[H∗↾α]∣ξ<μ⟩ are suitable to define Sinapova forcing V[H∗↾α].
Proof.
The construction of B∗ is the same as for B but starting from B instead of λ. By construction, B∗ is an unbounded set closed by increasing sequences of length ≥δ, hence B∗∈(Fλ)V.
∎
Notation 5.8**.**
For each α∈B∗, let Uαπ∗ and Bαπ∗ denote the sequences witnessing Lemma 5.7 and set
Sαπ∗:=S(κ,μ,Uαπ∗,Bαπ∗).
Lemma 5.9**.**
Let B∗^=B∗∪{λ} and α<γ∈B^∗. There are projections
- (1)
ϱαγ:Aγ∗S˙γπ∗→RO+(AEven(α)∗S˙απ),
2. (2)
ϱ^αγ:RO+(Aγ∗S˙γπ∗)→RO+(AEven(α)∗S˙απ).
Moreover, for each α<γ∈B∗, ϱαγ=σαγ.
Proof.
The construction of ϱαγ and ϱ^αγ is analogous to Lemma 4.7, again using a suitable version of Proposition 4.4. A proof for the moreover part can be found in [FHS18, Lemma 3.18].
∎
The moreover clause of the previous lemma is crucial since it guarantees that there are no disagreements between the projections defining R∗ and the projections intended to define its truncations.
Definition 5.10** (Truncations of R∗).**
Let γ∈B∗. A condition in R∗↾γ is a triple (p,q˙,r) for which all the following hold:
- (1)
(p,q)∈Aγ∗S˙γπ∗,
2. (2)
r* is a partial function with dom(r)∈[B∗∩γ]<δ;*
3. (3)
For every α∈dom(r), r(α) is a AEven(α)∗S˙απ-name such that
[TABLE]
For conditions (p0,q˙0,r0),(p1,q˙1,r1) in R∗↾γ we will write (p0,q˙0,r0)≤(p1,q˙1,r1) in case (p0,q˙0)≤(p1,q˙1), dom(r1) ⊆dom(r0) and for each α∈dom(r1),
ϱαγ(p0,q0)⊩AEven(α)∗S˙απr˙0(α)≤r˙1(α).
The proof of the next result is analogous to Proposition 5.2.
Proposition 5.11**.**
For each γ∈B∗, there is a projection between R∗ and RO+(R∗↾γ). In particular, R∗ is isomorphic to the iteration R∗↾γ∗(R∗/R∗↾γ).
Lemma 5.12**.**
Assume there is a λ-Aronszajn tree T in VR∗. Then there is γ∈B∗ such that T∩γ is a γ-Aronszajn tree in VR∗↾γ.
Proof.
Let T˙ be a R∗-name such that \mathds{1}_{\mathbb{R}^{*}}\Vdash_{\mathbb{R}^{*}}\text{``\dot{T}isa\lambda-Aronszajn tree''}. Without loss of generality T˙ is a R∗-name for a subset of λ. It is not hard to check that this is equivalent to a Π11 sentence Φ in the language L={∈,R∗,T˙,λ}. Since λ is weakly compact, hence Π11-indescribable, there is a set X∈Fλ such that for each γ∈X, ⟨Vγ,∈,R∗∩Vγ,T˙∩γ,γ⟩⊨Φ. By Lemma 5.7 and the former discussion we can assume that all these γ are Mahlo and that γ∈B∗. In particular, R∗∩Vγ=R∗↾γ, and thus ⟨Vγ,∈,R∗↾γ,T˙∩γ,γ⟩⊨Φ. Notice that Φ is absolute between the universe of sets and this structure, hence \mathds{1}_{\mathbb{R}^{*}\upharpoonright\gamma}\Vdash_{\mathbb{R}^{*}\upharpoonright\gamma}\text{``\dot{T}\cap\gammaisa\gamma-Aronszajn tree''}.
∎
Lemma 5.13**.**
Assume that there is a λ-Aronszajn tree T⊆λ in VR∗. Let γ∈B∗ be as in the previous lemma. Then R∗/(R∗↾γ) adds bγ, a cofinal branch throughout T∩γ.
Proof.
Observe that in VR∗ there is a cofinal branch bγ for T∩γ, as T is a λ-tree. Nonetheless, T∩γ is γ-Aronszajn in VR∗↾γ so that this branch must be added by the quotient R∗/(R∗↾γ).
∎
By combining Proposition 5.3 and 5.6 with the above lemma it follows that if the quotients R∗/(R∗↾γ) do not add γ-branches then TP(λ) holds in V[R].
In the next series of lemmas we will prove that for each γ∈B∗ there are forcings Pγ and Qγ fulfilling the following properties:
Pγ×Qγ projects onto R∗/(R∗↾γ) in VR∗↾γ.
Pγ×Qγ does not add new branches to T∩γ over VR∗↾γ.
Combining (αγ) and (βγ) we would conclude that R∗/(R∗↾γ) does not add γ-branches to T∩γ. In particular, if this is true for each γ∈B∗ then V[R]⊨TP(λ).
Definition 5.14**.**
For each γ∈B∗∪{λ}, define Cγ:=Aγ∗S˙γπ∗ Pγ:=Cλ/Cγ and Uγ:={(\mathds1,\mathds1˙,r)∣(\mathds1,\mathds1˙,r)∈R∗↾γ}. Also, over VR∗↾γ, define Qγ:={(\mathds1,\mathds1˙,r)∣(\mathds1,\mathds1˙,r)∈R∗/R∗↾γ}.
Standard arguments shows that Qγ is δ-directed closed over VR∗↾γ. Moreover, arguing as in Proposition 4.10 and Proposition 4.11 one obtains the following:
Proposition 5.15**.**
For each γ∈B∗∪{λ}, the following hold:
- (1)
Uγ* is δ-directed closed.*
2. (2)
Cγ×Uγ* projects onto R∗↾γ via the map ⟨(p,q˙),(\mathds1,\mathds1˙,r)⟩↦(p,q˙,r).*
3. (3)
VCγ* and VR∗↾γ have the same <δ-sequences*
Proposition 5.16**.**
**
- (1)
R∗↾γ* is γ-Knaster. In particular, all V-cardinals ≥γ are preserved.*
2. (2)
V^{\mathbb{R}^{*}\upharpoonright\gamma}\models\text{``\kappaisstronglimitwith\mathrm{cof}(\kappa)=\mu''}.
3. (3)
R∗↾γ* collapses all the cardinals in the interval (κ,δ)∪(δ+,γ). In particular, V^{\mathbb{R}^{*}\upharpoonright\gamma}\models\text{ ``\delta=\kappa^{+},\wedge,\gamma=\kappa^{++}''}.*
4. (4)
V^{\mathbb{R}^{*}\upharpoonright\gamma}\models\text{``2^{\kappa}\geq\gamma''}.
Proposition 5.17**.**
For each γ∈B∗, Pγ×Qγ satisfies (αγ).
Proof.
By definition, a condition in R∗/R∗↾γ is a triple (p,q˙,r) such that (πγλ(p,q˙),r↾γ)∈R∗↾γ, where πγλ is the composition of ϱγλ with the standard isomorphism between Cγ and RO+(Cγ). In particular, (p,q˙)∈Pγ. Now, it is immediate to check that τ:Pγ×Qγ→R∗/R∗↾γ given by ⟨(p,q˙),(\mathds1,\mathds1,r)⟩↦(p,q˙,r) defines a projection.
∎
It thus remains to prove that Pγ×Qγ satisfies (βγ).
Proposition 5.18**.**
Let γ∈B∗. If Pγ×Pγ is δ-cc over VCγ then Pγ×Qγ witnesses (βγ).
Proof.
Let us first prove that if Pγ×Pγ is δ-cc over VR∗↾γ then Pγ×Qγ witnesses (βγ). Notice that \mathds{1}_{\mathbb{Q}_{\gamma}}\Vdash^{V^{\mathbb{R}^{*}\upharpoonright\gamma}}_{\mathbb{Q}_{\gamma}}\text{|\gamma|=\delta$''}$. Since $\mathbb{Q}_{\gamma}$ is $\delta$-directed closed, Easton’s Lemma (see e.g. [[GM18](#bib.bibx11), Lemma 4.4.]) yields $\mathds{1}_{\mathbb{Q}_{\gamma}}\Vdash^{V^{\mathbb{R}^{*}\upharpoonright\gamma}}_{\mathbb{Q}_{\gamma}}\text{$\mathbb{P}{\gamma}\times\mathbb{P}{\gamma}is\delta-cc''}. Now by appealing to [Ung13, Lemma 2.2] it follows that Qγ forces, over VR∗↾γ that Pγ does not add a cofinal branch to T∩γ. On the other hand, \mathds{1}_{\mathbb{R}^{*}\upharpoonright\gamma}\Vdash_{\mathbb{R}^{*}\upharpoonright\gamma}\text{2^{\kappa}\geq\gamma$''}$ and $\mathds{1}_{\mathbb{R}^{*}\upharpoonright\gamma}\Vdash_{\mathbb{R}^{*}\upharpoonright\gamma}\text{Qγ is κ+-closed''}, so by Silver’s theorem [[Kun14](#bib.bibx16), Lemma V.2.26], \mathbb{Q}{\gamma}doesnotaddcofinalbranchestoT\cap\gamma. Finally
we use Proposition [5.15](#S5.Thmtheo15) (3) to
infer that if \mathbb{P}{\gamma}\times\mathbb{P}{\gamma}is\delta−ccoverV^{\mathbb{C}{\gamma}}thenitisalso\delta−ccoverV^{\mathbb{R}^{*}\upharpoonright\gamma}$. ∎
Lemma 5.19**.**
Let P and Q be two forcing notions and π:P→Q be a projection. For every p∈P and q∈Q, q⊩Qp∈/(P/Q)˙ if and only if for every generic filter G⊆P with p∈G, q is not in H, the generic filter generated by π[G]. In particular, if π(p)⊥q, q⊩Qp∈/(P/Q)˙.
Proof.
The first implication is obvious. Conversely, assume that there is q′≤Qq be such that q′⊩Qp∈(P/Q)˙. Let H⊆Q be some generic filter over V containing q. Hence, p∈P/H. Now let G⊆P/H be some generic filter over V[H] containing p. Clearly π[G]=H and q∈H, which yields the desired contradiction.
∎
Remark 5.20**.**
Let γ∈B∗∪{λ}. Observe that C~γ:={(p,(gˇ,H˙))∣p∈Aγ,g∈V,p⊩Aγ(gˇ,H˙)∈S˙γπ∗} endowed with the induced order is a dense subposet of Cγ. Thus, for our current purposes it is enough to assume that Cγ=C~γ.
Notation 5.21**.**
For each γ∈B∗∪{λ}, set g(μ):=ε and κg(μ):=κ, for every g which is a stem for some q∈S˙γπ∗. Observe that Pκg(μ)(κη∩g(μ))=Pκ(κη), for each η<μ.
Convention 5.22**.**
For the ease of notation –and provided no confusion arise– we shall tend to omit the mention to the particular family of measures that we are working with. For instance, instead of writting (Uγπ∗)η,xξ we shall simply write Uη,xξ.
Lemma 5.23**.**
Let γ∈B∗, r=(p,(hˇ,H˙))∈Cλ and r′=(q,(fˇ,F˙))∈Cγ. Then, r^{\prime}\Vdash_{\mathbb{C}_{\gamma}}\text{``r\notin\mathbb{P}_{\gamma}''} if and only if one of the following hold:
- (1)
p↾γ⊥Aγq;
2. (2)
p↾γ∥Aγq* and h∪f is not a ≺-increasing function;*
3. (3)
p↾γ∥Aγq, h∪f is a ≺-increasing function and
[TABLE]
Proof.
First, observe that two conditions (h,H),(f,F)∈Sλπ∗ are compatible if and only if h∪f is a ≺-increasing function and (h,H)↷(f∖h),(f,F)↷(h∖f)∈Sλπ∗. Thereby, if some of the above conditions is true, ϱγλ(r)⊥Cγr′. Thus, Lemma 5.19 yields r^{\prime}\Vdash_{\mathbb{C}_{\gamma}}\text{r\notin\mathbb{P}_{\gamma}$''}$. Conversely, assume that (1)-(3) are false. Since (1) and (2) are false, $p\cup q\in\mathbb{A}_{\lambda}$ and $i:=f\cup h$ is $\prec$-increasing. Also, since (3) is false, we may let a condition $a\leq_{\mathbb{A}_{\lambda}}p\cup q$ forcing the opposite. Let $A\subseteq\mathbb{A}_{\lambda}$ generic (over $V$) containing $a$. By the above, in $V[A]$, $(f,F){}^{\curvearrowright}(h\setminus f)\in\mathbb{S}^{\pi^{*}}_{\gamma}$ and $(h,H){}^{\curvearrowright}(f\setminus h)\in\mathbb{S}^{\pi^{*}}_{\lambda}$, hence both Sinapova conditions are compatible. Let $(i,I)\in\mathbb{S}^{\pi^{*}}_{\lambda}$ be a condition witnessing this compatibility and $S\subseteq\mathbb{S}^{\pi^{*}}_{\lambda}$ generic (over $V[A]$) containing $(i,I)$. Set $r^{*}:=(a,(\check{i},\dot{I}))$. Clearly, $r^{*}\in A\ast\dot{S}$ and $r^{*}\leq_{\mathbb{C}_{\lambda}}r$, so $r\in A\ast\dot{S}$. On the other hand, $\varrho^{\lambda}_{\gamma}[A\ast\dot{S}]$ generates a $\mathbb{C}_{\gamma}$-generic filter containing $r^{\prime}$, hence Lemma [5.19](#S5.Thmtheo19) yields $r^{\prime}\nVdash_{\mathbb{C}_{\gamma}}\text{$r\notin\mathbb{P}_{\gamma}''}, as wanted.
∎
For each γ∈B∗∪{λ}, and unless otherwise stated, we will assume that for each r=(q,(fˇ,F˙))∈Cγ, q\Vdash_{\mathbb{A}_{\gamma}}\text{``(\check{f},\dot{F}) is pruned''}. This is of course feasible by virtue of Proposition 3.13.
Lemma 5.24**.**
Let γ∈B∗, r=(p,(hˇ,H˙))∈Cλ and r′=(q,(fˇ,F˙))∈Cγ. Assume that q≤Aγp↾γ, h⊆f and
[TABLE]
where q\cup p\Vdash_{\mathbb{A}_{\lambda}}\text{``\tau_{\theta}=r_{\text{dom},(\check{f})}(\check{\theta})''}.
Then there is a Aγ-name I˙ for which all the following hold:
- (I)
q\Vdash_{\mathbb{A}_{\gamma}}\text{``(\check{f},\dot{I})\leq_{\mathbb{S}^{\pi^{}}_{\gamma}}(\check{f},\dot{F}),\wedge,(\check{f},\dot{I}) is pruned''}.*
2. (II)
q\Vdash_{\mathbb{A}_{\gamma}}\text{``\forall\tau\in[\prod_{\xi}\dot{I}(\xi)]^{<\omega},\left(p\nVdash_{\mathbb{A}{\lambda}/\mathbb{A}{\gamma}}(\check{h},\dot{H}){}^{\curvearrowright}\tau\notin\dot{\mathbb{S}}^{\pi^{}}_{\lambda}\right)''}.*
Proof.
Let us work over VAγ↓q. Let c:[∏ξF(ξ)]→2 be defined as
[TABLE]
By Lemma 3.24 there is I⊆F a suitable function for ⟨f⟩ and homogeneous for c. In particular, (f,I)≤Sγπ∗(f,F) and (f,I) is pruned, as (f,F) was. Thus, (I) holds. Towards a contradiction, assume that (II) is false. Let r≤Aγq be such that r forces the negation of the above formula. By shrinking r we may assume that there is a ≺-increasing function i such that r⊩Aγiˇ∈[∏ξI˙(ξ)]<ω and r\Vdash_{\mathbb{A}_{\gamma}}\text{``\left(p\Vdash_{\mathbb{A}{\lambda}/\mathbb{A}{\gamma}}(\check{h},\dot{H}){}^{\curvearrowright}\check{i}\notin\dot{\mathbb{S}}^{\pi^{*}}_{\lambda}\right)''}. Since r≤Aγq, r∪p∈Aλ, hence r∪p⊩Aλ(hˇ,H˙)↷iˇ∈/S˙λπ∗. Now, since r forces I˙ to be homogenous for c˙, it follows that for all j with the same domain as i, r∪p⊩Aλ(hˇ,H˙)↷jˇ∈/S˙λπ∗. Since p forces (hˇ,H˙) to be pruned the only chance for this property to hold is that r∪p⊩Aλ∏θ∈dom(i)I˙(θ)∩∏θ∈dom(i)H˙(θ)=∅. Let us show that this is impossible.
Let θ∈dom(i). If θ>max(dom(f)), I˙(θ) and H˙(θ) are names for sets in the measure Uθ, and thus they are not forced to be disjoint. Otherwise, if θ<max(dom(f)), since r∪p≤Aλq∪p and (Υ) holds, we may find s≤Aλr∪p, such that s⊩AλH˙(θ)∩P˙κfˇ(τθ)(κθ∩fˇ(τθ))∈U˙τθ,fˇ(τθ)θ. In particular, s⊩AλI˙(θ)∩H˙(θ)∩P˙κfˇ(τθ)(κθ∩fˇ(τθ))∈U˙τθ,fˇ(τθ)θ. Altogether, this produces the desired contradiction.
∎
Lemma 5.25**.**
Let γ∈B∗, r=(p,(hˇ,H˙))∈Cλ and r′=(q,(fˇ,F˙))∈Cγ. Assume that
- (ℵ)
q≤Aγp↾γ;
2. (ℶ)
h⊆f;
3. (ℷ)
p\cup q\Vdash_{\mathbb{A}_{\lambda}}\text{``(\check{h},\dot{H}){}^{\curvearrowright}(\check{f}\setminus\check{h})\in\dot{\mathbb{S}}^{\pi^{*}}_{\lambda}''}.**
Let I˙ be the function obtained from Lemma 5.24 with respect to r and r′. Then, (q,(fˇ,I˙))⊩Cγ(p,(hˇ,H˙))∈Pγ.
Proof.
Otherwise, let r∗:=(r,(jˇ,J˙))≤Cγ(q,(fˇ,I˙)) forcing the opposite. By using Lemma 5.23 with respect to r∗ and r it follows that some of the conditions (1)-(3) must hold. It is not hard to check that (ℵ)-(ℷ) implies that (3) holds: particularly, that r\cup p\Vdash_{\mathbb{A}_{\lambda}}\text{(\check{h},\dot{H}){}^{\curvearrowright}(\check{j}\setminus\check{h})\notin\dot{\mathbb{S}}^{\pi^{*}}_{\lambda}$''}$ holds. By $(\gimel)$ and since $r\cup p\leq_{\mathbb{A}_{\lambda}}p\cup q$, $r\cup p\Vdash_{\mathbb{A}_{\lambda}}\text{$(\check{h},\dot{H}){}^{\curvearrowright}(\check{j}\setminus\check{f})\notin\dot{\mathbb{S}}^{\pi^{}}_{\lambda}''}. Clearly, r≤Aγq and r⊩Aγjˇ∖fˇ∈[∏ξI˙(ξ)]. Observe that (ℷ) yields (Υ) of Lemma 5.24, and this latter implies r\cup p\nVdash_{\mathbb{A}_{\lambda}}\text{``(\check{h},\dot{H}){}^{\curvearrowright}(j\setminus f)\notin\dot{\mathbb{S}}^{\pi^{}}_{\lambda}''}. This produces the desired contradiction.
∎
Remark 5.26**.**
As the referee has pointed out, there is a somewhat simpler way to prove the above lemma without relying on Lemma 5.24. Let A a Aγ-generic with q∈A. In V[A] appeal to the Prikry property of Sγπ∗ and find (f,I)≤∗(f,F) with (f,I)∥Sγπ∗V[A](p,(hˇ,H˙))∈Pγ. Now observe that (1)-(3) of Lemma 5.23 hold, hence (q,(fˇ,I˙))⊩Cγ(p,(hˇ,H˙))∈Pγ.
Lemma 5.27**.**
Let γ∈B∗, (q,(fˇ,F˙))∈Cγ and r˙0,r˙1 be two Cγ-names forced by \mathds1Cγ to be in Pγ. Then, there are (q∗,(fˇ∗,F˙∗))∈Cγ, (p0,(hˇ0,H˙0)), (p1,(hˇ1,H˙1))∈Pγ and pˉ0,pˉ1∈Aλ be such that the following hold: For i∈{0,1},
(q∗,(fˇ∗,F˙∗))≤Cγ(q,(fˇ,F˙)),
(q^{*},(\check{f}^{*},\dot{F}^{*}))\Vdash_{\mathbb{C}_{\gamma}}\text{``\dot{r}{i}=(p{i},(\check{h}{i},\dot{H}{i}))\in\mathbb{P}_{\gamma}''},
pˉi≤Aλpi* and (q∗,(fˇ∗,F˙∗)) and (pˉi,(hˇi,H˙i)) satisfy conditions (1)-(3) of Lemma 5.25.*
Proof.
Let (q∗,(fˇ∗,F˙∗))≤Cγ(q,(fˇ,F˙)) and (p0,(hˇ0,H˙0)), (p1,(hˇ1,H˙1))∈Pγ be such that (b0) and (b1) hold. By extending q∗ and f∗ if necessary, we may further assume that q∗≤Aγp0↾γ∪p1↾γ and h0∪h1⊆f∗. For each i∈{0,1}, combining this with Lemma 5.23 it follows that condition (4) must fail. Thus, there is pˉi≤Aλq∗∪pi with pˉi⊩Aλ(hˇi,H˙i)↷(fˇ∗∖hˇi)∈S˙λπ∗. Again, extend p∗ to ensure q∗≤Aγpˉ0,pˉ1. It should be clear at this point that, for i∈{0,1}, (q∗,(fˇ∗,F˙∗)) and (qˉi,(hˇi,H˙i)) witness (ci).
∎
Finally, we are in conditions to prove the δ-ccness of Pγ×Pγ.
Lemma 5.28**.**
Let γ∈B∗. Then, \mathds{1}_{\mathbb{C}_{\gamma}}\Vdash_{\mathbb{C}_{\gamma}}\text{``\mathbb{P}{\gamma}\times\mathbb{P}{\gamma}is\delta-cc''}.
Proof.
Let {(r˙α0,r˙α1)}α<δ be a collection of Cγ-names that \mathds1Cγ forces to be in a maximal antichain of Pγ×Pγ. Appealing to Lemma 5.27 we find families {(qα∗,(fˇα∗,F˙α∗))}α<δ, {⟨(pα0,(hˇα0,H˙α0)),(pα1,(hˇα1,H˙α1))⟩}α<δ and{⟨pˉα0,pˉα1⟩}α<δ witnessing it.
It is not hard to check that for each ϱ∈B∗∪{λ}, Cϱ is δ-Knaster, hence Cγ×Cλ2 also. In particular, Cγ×Cλ2 is δ-cc, and thus we may assume that all the above conditions are compatible. Modulo a further refinement, we may also assume that fα∗=f∗, hα0=h0 and hα1=h1, for each α<δ. For each α<β<δ, set rα,β:=(qα∗∪qβ∗,(f∗,F˙α∗∧F˙β∗)) and ri,α,β′:=(pˉαi∪pˉβi,(hi,H˙αi∧H˙βi)). It is routine to check that, for each i∈{0,1}, rα,β and ri,α,β′ witness the hypotheses of Lemma 5.25, hence there is rα,β∗≤Cγrα,β forcing that both r0,α,β′ and r1,α,β′ are in Pγ. In particular, rα,β∗⊩Cγ(r˙α0,r˙α1)∥Pγ×Pγ(r˙β0,r˙β1), which entails the desired contradiction.
∎
6. TP(κ+) holds
In this section we conclude the proof of Theorem 1.1 by showing that TP(κ+) holds in V[R]. Once again, we
only give details when Θ=λ+, as the more general case is completely parallel. In essence the arguments exposed here are due to Sinapova [Sin16] and Neeman [Nee09].
The only reason in favour of presenting them is to point out some subtle differences between their argument and ours. Also, by showing explicitly the arguments, we hope to convince the skeptic reader
that similar ideas indeed do the job in our context. To avoid repetitions, we sometimes tend to sketch the main ideas and refer the reader to [Sin16], [Sin12] or [Nee09] for more details. The proof of V[R]⊨TP(δ), at least as conceived in [Sin16], uses a family of intermediate forcings between R and Rˉ (see Section 4). These forcings Rp˙ have the particularity that its generics Rp˙ resemble R. For the record of the section let us recall that G, S and R are, respectively, the generic filters for Aλ+, Sλ+ and R considered at Section 4.
Convention 6.1**.**
For each Aλ+-name q˙ for a condition in Sλ+, we shall denote by q its interpretation by G. Also, set q^:=⟨(\mathds1,q˙),(\mathds1,\mathds1˙,\mathds1)⟩ and q∗:=(\mathds1,q˙,\mathds1).
Definition 6.2**.**
Let q˙ be a Aλ+-name for a condition in Sλ+. Let Rq˙ be the set of (p,q˙′,r)∈R endowed with the order
(p1,q˙1,r1)≤Rp˙(p2,q˙2,r2) if and only if (p1,q˙1)≤Aλ+∗S˙λ+(p2,q˙2), dom(r2)⊆dom(r1) and for each γ∈dom(r2),
\sigma^{\lambda^{+}}_{\gamma}(p_{1},\dot{q})\Vdash_{\mathbb{A}_{\mathrm{Even}(\gamma)}\ast\dot{\mathbb{S}}^{\pi}_{\gamma}}\text{``\dot{r}{1}(\gamma)\leq{\dot{\mathrm{Add}}(\delta,1)}\dot{r}_{2}(\gamma)''}.
The next proposition shows that there is a system of projections between the forcings Rˉ, R and Rq˙ (see [Sin16, §2] for details).
Proposition 6.3**.**
Let q˙ be a Aλ+-name for a condition in Sλ+.
- (1)
The map ⟨(p,t˙),(\mathds1,\mathds1,r)⟩↦(p,t˙,r) defines a projection between Rˉ and Rq˙ and also between Rˉ↓q^ and Rq˙↓q∗.
2. (2)
The identity entails a projection between Rq˙↓q∗ and R↓q∗.
Let q,t be conditions in Sλ+ such that t≤Sλ+q. Then the identity establishes a projection between Rq and Rt.
Definition 6.4**.**
Work in V[G]. For each q∈S define the forcing Uq whose conditions are all r∈U such that r1≤Upr2 if and only if dom(r2)⊆dom(r1) and there is p∈G such that for each γ∈dom(r2),
[TABLE]
The next lemma corresponds with [Sin16, Lemma 2.7].
Lemma 6.5**.**
Let q˙ be a Aλ+-name for a condition in Sλ+. Then Rq˙ and Aλ+∗(S˙λ+×U˙q) are isomorphic. In particular, in V[G], there is a projection between Rq and Uq.
Proposition 6.6**.**
Work in V[G]. For each condition q∈S, the identity yields a projection between U and Uq. Moreover, for each t≤Sλ+q the same holds between Uq and Ut.
Let Rˉ⊆Rˉ a generic filter whose respective projections onto R, Aλ+ and Sλ+ induce R, G and S.111111Recall that these are the generic filters of Section 4 Let U⊆U be the generic filter induced by Rˉ. We also need generics for the family ⟨Rp,Up∣p∈S⟩. For this, we will use the following standard lemma. For a proof see, for instance, [Ung13, Proposition 4.7].
Lemma 6.7**.**
Let P,Q,C be posets and π:P→Q and σ:Q→C be projections. For any generic filter H⊆C, the restriction π↾P/H is a projection between P/H and Q/H in V[H].
For q∈S, q∗∈R, hence R↓q∗ is a generic filter for R↓q∗. Since there are projections πq between Rˉ↓q^ and Rq˙↓q∗ and πq between Rq˙↓q∗ and R↓q∗, the previous lemma ensures that πq↾Rˉ/R is a projection between Rˉ/R and Rq˙/R. For each q∈S, let Rq⊆Rq˙↓q∗ be the generic filter over V[R] induced by Rˉ and πq. Analogously, let Uq⊆Uq be the generic filter over V[G] induced by Rq and the corresponding projection.
Remark 6.8**.**
- (1)
By Proposition 6.3, Rq⊆Rq′⊆R, for each q′≤Sλ+q in S. Moreover, for each s∈Rˉ/R, there is p∈S such that s∈Rp (see [Sin08, Lemma 3.8]).
2. (2)
By Proposition 6.6, U⊆Uq⊆Uq′, each q′≤Sλ+q in S.
Aiming for a contradiction, assume that V[R]⊨¬TP(δ) and let a δ-tree (T,<T)∈V[R] be witnessing this. For each α<δ, set Tα:={u∈T∣level(u)=α}. Modulo isomorphism, we may assume Tα={α}×κ, for each α<δ. Let τ∈V[G] be a R/G-name for T and assume that \mathds{1}_{\mathbb{R}/G}\Vdash_{\mathbb{R}/G}\text{``\tauisa\delta-tree''}. Analogously, let T˙∈V[G][U] and, for each q∈Sλ+, T˙q∈V[G][Uq] be, respectively, the Sλ+-name for the tree T induced by τ. Notice that the interpretation of the names τ, T˙ and T˙q by the corresponding generic filters gives the same set; i.e. T. Thus, the only formal difference between these names is the ground model where they are regarded.
Definition 6.9**.**
For a condition p∈Sλ+, write mp:=max(dom(gp)).
Denote by S the set of pairs (g,H∗) for which there is p∈Sλ+ with p↾mp+1=(g,H∗) (c.f. Definition 2.8).
We will consider S endowed with ≤S, the induced order by ≤Sλ+: i.e. (g,H∗)≤S(i,I∗) iff there are p,q∈Sλ+ witnessings that (g,H∗),(i,I∗)∈S and p≤Sλ+q.
The following property is implicitly considered in [Sin12].
Definition 6.10** (Dagger property).**
Work in V[G][U].
For a pair (g,H∗)∈S, we will say that †(g,H∗) holds if there is J⊆δ unbounded, ⟨pα∣α∈J⟩ a sequence of conditions in Sλ+ and ξ<κ such that for each α∈J setting uα:=⟨α,ξ⟩, the following are true:
- (1)
For each α∈J, pα witnesses that (g,H∗)∈S.
2. (2)
*For each α<β in J, pα∧pβ⊩SV[G][U]uα<T˙uβ.
*
Since U is δ-directed closed (in V), V[U] thinks that κ is supercompact and the same holds for the sequence ⟨κξ+1∣ξ<μ⟩. By appealing to the arguments of [Sin12, §3] one has the following:
Lemma 6.11**.**
In V[G][U] the set \{p\in\mathbb{S}_{\lambda^{+}}\mid\text{\dagger_{p_{\upharpoonright\mathfrak{m}^{p}+1}} holds}\} is dense.
An immediate consequence of the previous lemma is the existence of a cofinal branch of T in V[Rˉ] (see [Sin12, Proposition 21] and the subsequent discussion).
Proposition 6.12**.**
There is a cofinal branch b∈V[Rˉ] through T.
Now we are left to prove that b induces a cofinal branch for T in V[R]. Let b˙ be a Rˉ/G-name for b. Moreover, let us assume that
(\mathds{1}_{\mathbb{S}},\mathds{1}_{\mathbb{U}})\Vdash_{\mathbb{S}\times\mathbb{U}}^{V[G]}\text{``\dot{b}cofinalbranchin\tau''}. We will need to consider a minor variation of the property †h of [Sin16, Definition 3.3].
Notation 6.13**.**
Work in V[G]. For a pair (g,H∗)∈S, denote by E(g,H∗) the set of u∈T for which there are (q,r)∈S×U such that q witnesses (g,H∗)∈S, r∈U and (q,r)⊩S×UV[G]u∈b˙.
Definition 6.14**.**
Work in V[G]. For a pair (g,H∗)∈S and α<δ, we say that there is a (g,H∗)-splitting at u∈Tα∩E(g,H∗) if, provided that (q,r) witnesses u∈E(g,H∗), there are β≥α, v1,v2∈Tβ and r1,r2≤Ur in Uq be such that
(q,rk)⊩S×UV[G]vk∈b˙, k∈{0,1},
q⊩SV[G][U]v1⊥T˙v2.
Remark 6.15**.**
If there is a (g,H∗)-splitting at u and (g,I∗)∈S then there is (g,F∗)≤S(g,I∗),(g,H∗) and a (g,F∗)-splitting at u. Indeed, let q,r,v1,v2,r1 and r2 witnessing the existence of a (g,H∗)-splitting at u. Now set q∗:=(g,F), where
[TABLE]
Set F∗:=F↾mp+1. Clearly q∗≤Sλ+q. By Remark 6.8, r1,r2∈Uq∗. Evidently, q∗,r,v1,v2,r1 and r2 witness a (g,F∗)-splitting at u and (g,F∗)≤S(g,I∗),(g,H∗). The same is true for (g,F∗)=(g,I∗) if (g,I∗)≤S(g,H∗).
This remark suggest the following definition:
Definition 6.16**.**
Work in V[G]. For a stem g, we will say that there is a g-splitting at u if there is some (g,H∗)-splitting at u, for some (g,H∗)∈S.
Definition 6.17**.**
Work in V[G][U]. For a pair (g,H∗)∈S we will say that †(g,H∗)b holds if there is J⊆δ unbounded, ⟨pα∣α∈J⟩ a sequence of conditions in Sλ+ and ξ<κ such that for each α∈J setting uα:=⟨α,ξ⟩, the following are true:
- (1)
For each α∈J, pα witnesses that (g,H∗)∈S.
2. (2)
For each α∈J, pα⊩Sλ+V[G][U]uα∈b˙.
3. (3)
For each α<β in J, pα∧pβ⊩Sλ+V[G][U]uα<T˙uβ.
A straightforward modification of the arguments involved in the proof of Lemma 6.11 yields that \{p\in\mathbb{S}_{\lambda^{+}}\mid\text{\dagger^{b}{p{\upharpoonright\mathfrak{m}^{p}+1}} holds}\} is dense.
Remark 6.18**.**
If (g,I∗)∈S and †(g,H∗)b holds then there is (g,F∗)≤S(g,I∗),(g,H∗) for which †(g,F∗)b holds. Indeed, let J⊆δ, ⟨pα∣α∈J⟩ and ξ<κ witnessing †(g,H∗)b. For each α∈J, define qα:=(g,Fα), where Fα is defined as in Remark 6.15 but with respect to Hpα∖mpα+1 rather than Hp∖mp+1. It is obvious that J, ⟨qα∣α∈J⟩ and ξ<κ are witness for †(g,F∗)b. The same is true for (g,F∗)=(g,I∗) if (g,I∗)≤S(g,H∗).
Definition 6.19**.**
Work in V[G][U]. For a stem g, we will say that †gb holds if †(g,H∗)b holds, for some (g,H∗)∈S. Define
[TABLE]
and set αg:=sup{α(g,H∗)∣∃H∗(g,H∗)∈S}.
By a very similar argument to Remark 6.15 if (g,I∗)≤S(g,H∗), then every (g,H∗)-splitting at some u yields a (g,I∗)-splitting at u, and thus α(g,H∗)≤α(g,I∗).
Lemma 6.20**.**
If there is a g-splitting at u then there is some stem i⊇g for which there is a i-splitting at u and †ib holds.
Proof.
Let u be some node where a (g,H∗)-splitting occurs, for some H∗. Say (q,r)⊩S×UV[G]u∈b˙, (q,rk)⊩S×UV[G]vk∈b˙, rk≤Ur and rk∈Uq, for k∈{0,1}. By previous comments, find q~≤Sλ+q for which †q~↾mq~+1b holds. Set (i,I∗):=q~↾mq~+1. Hence, †ib holds. By Remark 6.8, r0,r1∈Uq~. Clearly, q~,r,v1,v2,r1 and r2 witness the existence of a (i,I∗)-splitting at u.
∎
Now we need to show that if †gb holds then αg<δ. This is essentially what is proved in [Sin16, Proposition 3.4] for Gitik-Sharon forcing. We will give some details just to convince the reader that the same arguments also work for Sinapova forcing.
Lemma 6.21**.**
In V[G][U], for each stem g, if †gb holds then αg<δ.
Proof.
Assume otherwise and let rˉ be a condition in U such that \bar{r}\Vdash^{V[G]}_{\mathbb{U}}\text{\dagger^{b}_{g}$ holds and $\dot{\alpha}_{g}=\check{\delta}$''}$. Since $\mathds{1}_{\mathbb{U}}\Vdash^{V[G]}_{\mathbb{U}}\text{$\delta is regular''} and ∣{H∗∣(g,H∗)∈S}∣V[G]<δ, it follows that
[TABLE]
By extending rˉ if necessary, we may assume that there is (g,H∗)∈S be such that \bar{r}\Vdash^{V[G]}_{\mathbb{U}}\text{``\dagger^{b}{(\check{g},\check{H}^{*})}holdsand\dot{\alpha}{(\check{g},\check{H}^{*})}=\check{\delta}''}.
Claim 6.22**.**
Let r≤Qrˉ and r∈Uq, for some q∈S witnessing (g,I∗)∈S and (g,I∗)≤S(g,H∗). Then in V[G] there are ⟨vi∗∣i<ε⟩ nodes and ⟨⟨pi∗,ri∗⟩∣i<ε⟩ conditions in Sλ+×U be such that:
- (1)
For each i<ε, pi∗≤Sλ+q , ri∗≤Ur, ri∈Upi∗;
2. (2)
for each i<ε, pi∗ has stem g,
3. (3)
for each i<ε, ⟨pi∗,ri∗⟩⊩Sλ+×Uvi∗∈b˙, and
4. (4)
for each i<j<ε, pi∗∧pj∗⊩Sλ+vi∗⊥T˙vj∗.
Proof of claim.
Let U′ be a U/Uq generic over V[G][Uq] and r∈U′. Since r≤Qrˉ, α(g,H∗)=δ and †(g,H∗)b hold in V[G][U′]. By the previous remarks we have that †(g,I∗)b and α(g,I∗) also hold in this model. Denote by E(g,I∗), J, ⟨pα∣α∈J⟩ and ξ the objects in V[G][U′] that witness †(g,I∗)b. Let us now work over V[G][U′].
Subclaim 6.23**.**
For every u∈E(g,I∗), there is p∈Sλ+ with p≤Sλ+∗q, r1,r2∈Up and nodes v1,v2 of higher levels, such that ⟨p,rk⟩⊩Sλ+×Uvk∈b˙ and p⊩Sλ+V[G][U′]v1⊥T˙v2,u<T˙v1,u<T˙v2.
Proof of subclaim.
Let u∈E(g,I∗) and (p′,t′)⊩Sλ+×UV[G]u∈b˙ with t′∈U and p′ witnessing (g,I∗)∈S. Since α(g,I∗)=δ, there is v in a higher level of the tree for which there is a (g,I∗)-splitting. Namely, there are p,r,v1,v2,r1,r2 as follows:
- (1)
p∈Sλ+ witnesses (g,I∗)∈S, r∈U, ⟨p,r⟩⊩Sλ+∗UV[G]v∈b˙,
2. (2)
vk is a node in a higher level than v and ⟨p,rk⟩⊩Sλ+×UV[G]vk∈b˙, with rk≤Ur and rk∈Up, for k∈{1,2},
3. (3)
p⊩Sλ+V[G][U′]v1⊥T˙v2.
Observe that we may further assume r1,r2≤Ut′. Also, p∗:=p∧p′ is a condition ≤Sλ+∗-below p and p′. Remark 6.8 yields r1,r2∈Up∗. Finally, notice that p∗,r1,r2,v1,v2 is a witness for our statement.
∎
By extending r if necessary, we may assume that r forces the conclusion of the above subclaim. Let C be the set of all α<δ such that for each β<α and u∈Tγ, if there is some r′≤U/Uqr with r′⊩U/UqV[G][Uq]u∈E˙(g,I∗), then there are levels β<γ1≤γ2<α and nodes v1∈Tγ1 and v2∈Tγ2 witnessing the above subclaim, for some conditions p∈Sλ+ and r1,r2∈U. Clearly, C is closed. Also, since α(g,I∗)=δ, is unbounded, hence C is a club on δ. Observe that C∈V[G][Uq].
Working in V[G][U′] define ⟨pi,γi,αi∣i<ε⟩ as follows: γi∈J, pi:=pγi and αi∈C is such that γi<αi≤γi+1. For each i<ε, set ui:=⟨γi,ξ⟩ and let si∈U′, si≤Qr, be such that s_{i}\Vdash^{V[G]}_{\mathbb{U}}\text{``\gamma_{i}\in\dot{J}andp^{i}=\dot{p}{\gamma{i}}''}. Since A is κ-cc and U is δ-directed closed, Easton’s lemma implies that A forces that U is δ-distributive, hence ⟨pi,γi,αi,si∣i<ε⟩∈V[G]. By construction,
for each i<ε, pi witnesses (g,I∗)∈S,
for each i<ε, ⟨pi,si⟩⊩Sλ+×UV[G]ui∈b˙,
i<j<ε, pi∧pj⊩Sλ+ui<T˙uj.
In particular, si⊩UV[G]ui∈E˙(g,I∗). By definition of C, for each i<ε, there is qi≤Sλ+∗q, r1i,r2i∈Uqi and v1i, v2i be such that
- (1)
for each i<ε and k∈{1,2}, ⟨qi,rki⟩⊩Sλ+×Uvki∈b˙ and rki∈Uqi,
2. (2)
for each i<ε, qi⊩Sλ+v1i⊥T˙v2i,ui<T˙v1i,ui<T˙v2i,
3. (3)
for each i<ε, γi<level(v1i),level(v2i)<γi+1.
Observe that we may further assume that qi≤Sλ+pi, as the stems are the same. Let φ(i,k) be ‘‘vki<T˙ui+1”. By (2) and the Prikry property, there is k∗∈{1,2} and pi∗≤∗qi∧pi+1 be such that pi∗⊩Sλ+¬φ(i,k∗). Set ri∗=rk∗i and vi∗:=vk∗i. By using Remark 6.8 it is immediate that ⟨pi∗,ri∗,vi∗∣i<ε⟩ is as desired. This finishes the proof of the claim.
∎
From this point on the argument is identical to [Sin16], so we decline the chance to provide more details.
∎
Lemma 6.24**.**
V[R]⊨TP(δ).
Proof skecth.
By Lemma 6.21, \alpha^{*}:=\sup_{g}\{\alpha_{g}\mid\text{``\dagger^{b}_{g} holds''}\}+1<\delta. Let u∈Tα∗ and s∗∈R be such that s∗⊩R∗/GV[G]u∈b˙. Define b∗:={v∈T∣u<Tv,(∃s∈R)s≤Rˉs∗,s⊩Rˉ/GV[G]v∈b˙}. Clearly, b∗∈V[R] and b∗ is a cofinal set in T. By our initial assumption, b∗ is not a branch through T, hence there is γ>α∗ with ∣Tγ∩b∗∣≥2. By Remark 6.8, Rˉ/R=⋃p∈SRp. We can use this to prove that there is a (g,H∗)-splitting at u, for some (g,H∗). Thus, α∗≤αg. By Lemma 6.20, we may further assume that †(g,H∗)b holds, so that α∗≤αg<α∗. This forms the desired contradiction.
∎
Acknowledgments: The author would like to thank professor M. Golshani for suggesting him to work on this problem and to
professor J. Bagaria for his friendly guidance. The said gratitude is also extensible to the anonymous referee for his/her carefully reading of the paper and for his/her timely corrections and remarks.