This paper demonstrates how to force a $oxdot( ext{weakly compact})$-like principle at a weakly compact cardinal while preserving its weak compactness, and explores the implications for the structure of weakly compact sets.
Contribution
It introduces a forcing method to establish a $oxdot( ext{weakly compact})$-like principle at a weakly compact cardinal, extending the understanding of combinatorial principles in large cardinal contexts.
Findings
01
Existence of a cofinality-preserving extension where $oxdot_1( ext{weakly compact})$ holds
02
In such extensions, every weakly compact subset has a weakly compact initial segment
03
Consistency of two weakly compact sets with no common weakly compact initial segment
Abstract
Hellsten \cite{MR2026390} proved that when κ is Πn1-indescribable, the \emph{n-club} subsets of κ provide a filter base for the Πn1-indescribability ideal, and hence can also be used to give a characterization of Πn1-indescribable sets which resembles the definition of stationarity: a set S⊆κ is Πn1-indescribable if and only if S∩C=∅ for every n-club C⊆κ. By replacing clubs with n-clubs in the definition of □(κ), one obtains a □(κ)-like principle □n(κ), a version of which was first considered by Brickhill and Welch \cite{BrickhillWelch}. The principle □n(κ) is consistent with the Πn1-indescribability of κ but inconsistent with the Πn+11-indescribability of κ. By generalizing the standard forcing to add a □(κ)-sequence,…
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 · Computability, Logic, AI Algorithms
Full text
Forcing a □(κ)-like principle to hold at a weakly compact cardinal
Brent Cody
Virginia Commonwealth University,
Department of Mathematics and Applied Mathematics,
1015 Floyd Avenue, PO Box 842014, Richmond, Virginia 23284, United States
Virginia Commonwealth University,
Department of Mathematics and Applied Mathematics,
1015 Floyd Avenue, PO Box 842014, Richmond, Virginia 23284, United States
Hellsten [Hel03a] proved that when κ is Πn1-indescribable, the n-club subsets of κ provide a filter base for the Πn1-indescribability ideal, and hence can also be used to give a characterization of Πn1-indescribable sets which resembles the definition of stationarity: a set S⊆κ is Πn1-indescribable if and only if S∩C=∅ for every n-club C⊆κ. By replacing clubs with n-clubs in the definition of □(κ), one obtains a □(κ)-like principle □n(κ), a version of which was first considered by Brickhill and Welch [BW]. The principle □n(κ) is consistent with the Πn1-indescribability of κ but inconsistent with the Πn+11-indescribability of κ. By generalizing the standard forcing to add a □(κ)-sequence, we show that if κ is κ+-weakly compact and GCH holds then there is a cofinality-preserving forcing extension in which κ remains κ+-weakly compact and □1(κ) holds. If κ is Π21-indescribable and GCH holds then there is a cofinality-preserving forcing extension in which κ is κ+-weakly compact, □1(κ) holds and every weakly compact subset of κ has a weakly compact proper initial segment. As an application, we prove that, relative to a Π21-indescribable cardinal, it is consistent that κ is κ+-weakly compact, every weakly compact subset of κ has a weakly compact proper initial segment, and there exist two weakly compact subsets S0 and S1 of κ such that there is no β<κ for which both S0∩β and S1∩β are weakly compact.
Key words and phrases:
indescribable, weakly compact, square, reflection
2000 Mathematics Subject Classification:
03E35, 03E55
2010 Mathematics Subject Classification:
Primary 03E35; Secondary 03E55
1. Introduction
In this paper, we investigate an incompactness principle □1(κ), which is closely related to □(κ) but is consistent with weak compactness. Let us begin by recalling the basic facts about □(κ).
The principle □(κ) asserts that there is a κ-length coherent sequence of clubs C=⟨Cα:α∈lim(κ)⟩ that cannot be threaded. For an uncountable cardinal κ, a sequence C=⟨Cα:α∈lim(κ)⟩ of clubs Cα⊆α is called coherent if whenever β is a limit point of Cα we have Cβ=Cα∩β. Given a coherent sequence C, we say that C is a thread through C if C is a club subset of κ and C∩α=Cα for every limit point α of C. A coherent sequence C is called a □(κ)-sequence if it cannot be threaded, and □(κ) holds if there is a □(κ)-sequence. It is easy to see that □(κ) implies that κ is not weakly compact, and thus □(κ) can be viewed as asserting that κ exhibits a certain amount of incompactness. The principle □(κ) was isolated by Todorčević [Tod87], building on work of Jensen [Jen72], who showed that, if V=L, then □(κ) holds for every regular uncountable κ that is not weakly compact.
The natural ≤κ-strategically closed forcing to add a □(κ)-sequence [LH14, Lemma 35] preserves the inaccessibility as well as the Mahloness of κ, but kills the weak compactness of κ and indeed adds a non-reflecting stationary set. However, if κ is weakly compact, there is a forcing [HLH17] which adds a □(κ)-sequence and also preserves the fact that every stationary subset of κ reflects. Thus, relative to the existence of a weakly compact cardinal, □(κ) is consistent with Refl(κ), the principle that every stationary set reflects. However, □(κ) implies the failure of the simultaneous stationary reflection principle Refl(κ,2) which states that if S and T are any two stationary subsets of κ, then there is some α<κ with cf(α)>ω such that S∩α and T∩α are both stationary in α. In fact, □(κ) implies that every stationary subset of κ can be partitioned into two stationary sets that do not simultaneously reflect [HLH17, Theorem 2.1].
If κ is a weakly compact cardinal, then the collection of non–Π11-indescribable subsets of κ forms a natural normal ideal called the Π11-indescribability ideal:
[TABLE]
A set S⊆κ is Π11-indescribable if for every A⊆Vκ and every Π11-sentence φ, whenever (Vκ,∈,A)⊨φ there is an α∈S such that (Vα,∈,A∩Vα)⊨φ. More generally, a Πn1-indescribable cardinal κ carries the analogously defined Πn1-indescribability ideal. It is natural to ask the question: which results concerning the nonstationary ideal can be generalized to the various ideals associated to large cardinals, such as the Πn1-indescribability ideals? It follows from the work of Sun [Sun93] and Hellsten [Hel03a] that when κ is Πn1-indescribable the collection of n-club subsets of κ (see the next section for definitions) is a filter-base for the filter Πn1(κ)∗ dual to the Πn1-indescribability ideal, yielding a characterization of Πn1-indescribable sets that resembles the definition of stationarity: when κ is Πn1-indescribable, a set S⊆κ is Πn1-indescribable if and only if S∩C=∅ for every n-club C⊆κ. Several recent results have used this characterization ([Hel06], [Hel10], [Cod19] and [CS20]) to generalize theorems concerning the nonstationary ideal to the Π11-indescribability ideal. For technical reasons discussed below in Section 8, there has been less success with the Πn1-indescribability ideals for n>1. In this article we continue this line of research: by replacing “clubs” with “1-clubs” we obtain a □(κ)-like principle □1(κ) (see Definition 2.1) that is consistent with weak compactness but not with Π21-indescribability. Brickhill and Welch [BW] showed that a slightly different version of □1(κ), which they call □1(κ), can hold at a weakly compact cardinal in L. See Remark 2.3 for a discussion of the relationship between □1(κ) and □1(κ). In this article we consider the extent to which principles such as □1(κ) can be forced to hold at large cardinals.
We will see that the principle □1(κ) holds trivially at weakly compact cardinals κ below which stationary reflection fails. (This is analogous to the fact that □(κ) holds trivially for every κ of cofinality ω1.) Thus, the task at hand is not just to force □1(κ) to hold at a weakly compact cardinal, but to show that one can force □1(κ) to hold at a weakly compact cardinal κ even when stationary reflection holds at many cardinals below κ, so that nontrivial coherence of the sequence is obtained. Recall that when κ is κ+-weakly compact, the set of weakly compact cardinals below κ is weakly compact and much more, so, in particular, the set of inaccessible α<κ at which stationary reflection holds is weakly compact. By [BW, Theorem 3.24], assuming V=L, if κ is κ+-weakly compact and κ is not Π21-indescribable then □1(κ) holds. We show that the same can be forced.
Theorem 1.1**.**
If κ is κ+-weakly compact and the GCH holds, then there is a cofinality-preserving forcing extension in which
(1)
κ* remains κ+-weakly compact and*
2. (2)
□1(κ)* holds.*
We will also investigate the relationship between □1(κ) and weakly compact reflection principles. The weakly compact reflection principleRefl1(κ) states that κ is weakly compact and for every weakly compact S⊆κ there is an α<κ such that S∩α is weakly compact. It is straightforward to see that if κ is Π21-indescribable, then Refl1(κ) holds, and if Refl1(κ) holds, then κ is ω-weakly compact (see [Cod19, Section 2]). However, the following results show that neither of these implications can be reversed. The first author [Cod19] showed that if Refl1(κ) holds then there is a forcing which adds a non-reflecting weakly compact subset of κ and preserves the ω-weak compactness of κ, hence the ω-weak compactness of κ does not imply Refl1(κ). The first author and Hiroshi Sakai [CS20] showed that Refl1(κ) can hold at the least ω-weakly compact cardinal, and hence Refl1(κ) does not imply the Π21-indescribability of κ. Just as □(κ) and Refl(κ) can hold simultaneously relative to a weakly compact cardinal, we will prove that □1(κ) and Refl1(κ) can hold simultaneously relative to a Π21-indescribable cardinal; this provides a new consistency result which does not follow from the results in [BW] due to the fact that,
if V=L, then Refl1(κ) holds at a weakly compact cardinal if and only if
κ is Π21-indescribable.
Theorem 1.2**.**
Suppose that κ is Π21-indescribable and the GCH holds. Then there is a cofinality-preserving forcing extension in which
(1)
□1(κ)* holds,*
2. (2)
Refl1(κ)* holds and*
3. (3)
κ* is κ+-weakly compact.*
In Section 2, using n-club subsets of κ, we formulate a generalization of □1(κ) to higher degrees of indescribability. It is easily seen that □n(κ) implies that κ is not Πn+11-indescribable (see Proposition 2.9 below). However, for technical reasons outlined in Section 8, our methods do not seem to show that □n(κ) can hold nontrivially (see Definition 2.10) when κ is Πn1-indescribable. Our methods do allow for a generalization of Hellsten’s 1-club shooting forcing to n-club shooting, and we also show that, if S is a Πn1-indescribable set, a 1-club can be shot through
S while preserving the Πn1-indescribability of all Πn1-indescribable subsets of S.
Finally, we consider the influence of □n(κ) on simultaneous reflection of
Πn1-indescribable sets. We let Refln(κ,μ) denote the following simultaneous reflection principle: κ is Πn1-indescribable and whenever {Sα:α<μ} is a collection of Πn1-indescribable sets, there is a β<κ such that Sα∩β is Πn1-indescribable for all α<μ. In Section 7, we show that for n≥1, if □n(κ) holds at a Πn1-indescribable cardinal, then the simultaneous reflection principle Refln(κ,2) fails (see Theorem 7.1). As a consequence, we show that relative to a Π21-indescribable cardinal, it is consistent that Refl1(κ) holds and Refl1(κ,2) fails (see Corollary 7.4).
2. The principles □n(κ)
Suppose that κ is a cardinal. A set S⊆κ is Πn1-indescribable if for every A⊆Vκ and every Πn1-sentence φ, whenever (Vκ,∈,A)⊨φ there is an α∈S such that (Vα,∈,A∩Vα)⊨φ. The cardinal κ is said to be Πn1-indescribable if κ is a Πn1-indescribable subset of κ. The Π01-indescribable cardinals are precisely the inaccessible cardinals, and, if κ is inaccessible, then S⊆κ is
Π01-indescribable if and only if it is stationary. The Π11-indescribable cardinals are precisely the weakly compact cardinals.
The Πn1-indescribability ideal on κ is
[TABLE]
the corresponding collection of positive sets is
[TABLE]
and the dual filter is
[TABLE]
Clearly, if κ is not Πn1-indescribable, then Πn1(κ)=P(κ).
Lévy proved [L7́1] that if κ is Πn1-indescribable, then Πn1(κ) is a nontrivial normal ideal on κ.
A set C⊆κ is called [math]-club if it is a club. A set X⊆κ is said to be n-closed if it contains all of its Πn−11-indescribable reflection points: whenever α<κ and X∩α is Πn−11-indescribable, then α∈X (note that such α must be Πn−11-indescribable). If a set C⊆κ is both n-closed and Πn−11-indescribable, then C is said to be an n-club subset of κ. For example, C⊆κ is 1-club if and only if it is stationary and contains all of its inaccessible stationary reflection points, and C⊆κ is 2-club if and only if it is weakly compact and contains all of its weakly compact reflection points. Building on work of Sun [Sun93], Hellsten showed [Hel03b] that when κ is a Πn1-indescribable cardinal, a set S⊆κ is Πn1-indescribable if and only if S∩C=∅ for every n-club C⊆κ. Thus, when κ is Πn1-indescribable, the collection of n-club subsets of κ generates the filter Πn1(κ)∗. In particular, this implies that n-club sets are themselves Πn1-indescribable.
For n<ω and X⊆κ, we define the n-trace of X to be
[TABLE]
Notice that when X=κ, Trn(κ) is the set of Πn1-indescribable cardinals below κ, and in particular Tr0(κ) is the set of inaccessible cardinals less than κ.
For uniformity of notation, let us say that an ordinal α is Π−11-indescribable if it is a limit ordinal, and if α is a limit ordinal, S⊆α is
Π−11-indescribable if it is unbounded in α. Thus, if X⊆κ, then Tr−1(X)={α<κ:sup(X∩α)=α}.
Definition 2.1**.**
Suppose n<ω and Trn−1(κ) is cofinal in κ. A sequence C=⟨Cα:α∈Trn−1(κ)⟩ is called a coherent sequence of n-clubs if
(1)
for all α∈Trn−1(κ), Cα is an n-club subset of α and
2. (2)
for all α<β in Trn−1(κ), Cβ∩α∈Πn−11(α)+ implies Cα=Cβ∩α.
We say that a set C⊆κ is a thread through a coherent sequence of n-clubs
[TABLE]
if C is n-club and for all α∈Trn−1(κ), C∩α∈Πn−11(α)+ implies Cα=C∩α.
A coherent sequence of n-clubs C=⟨Cα:α∈Trn−1(κ)⟩ is called a □n(κ)-sequence if there is no thread through C. We say that □n(κ) holds if there is a □n(κ)-sequence C=⟨Cα:α∈Trn−1(κ)⟩.
Remark 2.2**.**
Note that □0(κ) is simply □(κ). For n=1, the principle □1(κ) states that there is a coherent sequence of 1-clubs
[TABLE]
that cannot be threaded.
Remark 2.3**.**
Before we prove some basic results about □n(κ), let us consider a similar principle due to Brickhill and Welch [BW]. We will consider the case n=1 in detail. We will refer to the notion of 1-club defined in [BW] as strong 1-club in order to avoid confusion. A set C⊆κ is a strong 1-club if it is stationary in κ and whenever C∩α is stationary in α then α∈C. This notion of strong 1-club is precisely the same notion considered in [Sun93]. Thus, it follows from the results of [Sun93] that when κ is weakly Π11-indescribable111Recall that a set S⊆κ is weakly Π11-indescribable if for all A⊆κ and all Π11 sentences φ, (κ,∈,A)⊨φ implies that there is and α∈S such that (α,∈,A∩α)⊨φ. the collection of strong 1-clubs generates the weak Π11-indescribable filter. Moreover, when κ is weakly compact, the collection of strong 1-club subsets of κ generates the weakly compact filter Π11(κ). For S⊆κ, Brickhill and Welch [BW] define □1(κ) to be the principle asserting the existence of a sequence ⟨Cα:cf(α)>ω⟩ such that
(1)
Cα is a strong 1-club in α,
2. (2)
whenever Cα∩β is stationary in β we have Cβ=Cα∩β and
3. (3)
there is no C⊆κ that is strong 1-club in κ such that whenever C∩α is stationary in α we have Cα=C∩α.
Such a sequence is called a □1(κ)-sequence. Let us show that when κ is weakly compact, the Brickhill-Welch principle □1(κ) implies our principle □1(κ). Suppose ⟨Cα:cf(α)>ω⟩ is a □1(κ)-sequence. Clearly, ⟨Cα:α∈Tr0(κ)⟩ is a coherent sequence of 1-clubs. For the sake of contradiction, suppose C⊆κ is a 1-club thread through ⟨Cα:α∈Tr0(κ)⟩. Using the coherence of ⟨Cα:cf(α)>ω⟩ it is straightforward to check that C is a strong 1-club and whenever C∩α is stationary in α we have Cα=C∩α. This contradicts □1(κ). Thus □1(κ) implies □1(κ). It is not known whether □1(κ) implies □1(κ).
Brickhill and Welch also generalized their definition to obtain the principles □n(κ), and again it is not difficult to see that □n(κ) implies our principle □n(κ).
Generalizing the fact that □(κ) implies κ is not weakly compact, let us show that □n(κ) implies κ is not Πn+11-indescribable. To do this, we first recall the Hauser characterization of Πn1-indescribability.
We say that a transitive model ⟨M,∈⟩ is a κ-model if ∣M∣=κ, κ∈M, M^{{\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa}\subseteq M, and M⊨ZFC− (ZFC without the power set axiom). It is not difficult to see that if κ is inaccessible, then Vκ is an element of every κ-model M.
Definition 2.4** (Hauser).**
Suppose κ is inaccessible. For n≥0, a κ-model N is Πn1-correct at κ if and only if
[TABLE]
for all Πn1-formulas φ whose parameters are contained in N∩Vκ+1.
Remark 2.5**.**
Notice that every κ-model is Π01-correct at κ.
Theorem 2.6** (Hauser).**
The following statements are equivalent for every inaccessible cardinal κ, every subset S⊆κ, and all 0<n<ω.
(1)
S is Πn1-indescribable.
2. (2)
For every κ-model M with S∈M, there is a Πn−11-correct κ-model N and an elementary embedding j:M→N with crit(j)=κ such that κ∈j(S).
3. (3)
For every A⊆κ there is a κ-model M with A,S∈M for which there is a Πn−11-correct κ-model N and an elementary embedding j:M→N with crit(j)=κ such that κ∈j(S).
4. (4)
For every A⊆κ there is a κ-model M with A,S∈M for which there is a Πn−11-correct κ-model N and an elementary embedding j:M→N with crit(j)=κ such that κ∈j(S) and j,M∈N.
Lemma 2.7**.**
Suppose κ is a cardinal. If S∈Πn1(κ)+ and Sα∈Πn1(α)+ for each α∈S, then ⋃α∈SSα∈Πn1(κ)+.
Proof.
Fix an n-club C in κ. The set Trn−1(C) is n-closed because if Trn−1(C)∩α∈Πn−11(α)+, then C∩α∈Πn−11(α)+ since, by n-closure of C, Trn−1(C)⊆C. Also, Trn−1(C) meets every n-club D because the intersection C∩D is an n-club. Thus, Trn−1(C) is an n-club. It follows that there is an α∈S∩Trn−1(C). Since Sα is Πn1-indescribable in α and C∩α is an n-club in α, we have Sα∩C∩α=∅, and hence (⋃α∈SSα)∩C=∅.
∎
A simple complexity calculation shows that
for every n<ω, there is a Πn+11-formula χn(X) such that for every κ and every S⊆κ,
(Vκ,∈)⊨χn(S) if and only if S is Πn1-indescribable (see [Kan03, Corollary 6.9]). It therefore follows that there is a Πn1-formula ψn(X) such that for every κ and every C⊆κ, (Vκ,∈)⊨ψn(C) if and only if C is an n-club subset of κ. Thus, in particular, a Πn1-correct model N is going to be correct about Πn−11-indescribable sets as well as n-clubs.
Corollary 2.8**.**
Suppose κ is Πn1-indescribable. If S∈Πn1(κ)+, then
[TABLE]
is an n-club.
Proof.
Suppose S is Πn1-indescribable. First, let us argue that Trn−1(S) is Πn1-indescribable. Let M be a κ-model with S,Trn−1(S)∈M and let j:M→N be an elementary embedding with critical point κ such that N is Πn−11-correct and κ∈j(S). The Πn−11-correctness of N implies that j(S)∩κ=S is a Πn−11-indescribable subset of κ in N. Thus, κ∈j(Trn−1(S)). Hence Trn−1(S) is Πn1-indescribable.
It remains to show that Trn−1(S) is n-closed, which is equivalent to showing that if Trn−1(S)∩α∈Πn−11(α)+, then S∩α∈Πn−11(α)+. More generally, observe that if X⊆α and Trm(X) is Πm1-indescribable, then X=⋃β∈Trm(X)X∩β must be Πm1-indescribable by Lemma 2.7.
∎
Proposition 2.9**.**
For every n<ω, □n(κ) implies that κ is not Πn+11-indescribable.
Proof.
Suppose C=⟨Cα:α∈Trn(κ)⟩ is a □n(κ)-sequence and κ is Πn+11-indescribable. Let M be a κ-model with C∈M. Since κ is Πn+11-indescribable, we may let j:M→N be an elementary embedding with critical point κ and a Πn1-correct N as in Theorem 2.6 (2). By elementarity, it follows that j(C)=⟨Cˉα:α∈TrnN(j(κ))⟩ is a □n(j(κ))-sequence in N. Since N is Πn1-correct, we know that κ∈TrnN(j(κ)) and Cˉκ must also be n-club in V. Since j(C) is a □n(j(κ))-sequence in N, it follows that for every Πn1-indescribable α<κ if Cˉκ∩α∈Πn1(α)+, then Cˉκ∩α=Cα, and hence Cˉκ is a thread through C, a contradiction.
∎
Let us now describe the sense in which □n(κ) can hold trivially when κ is Πn1-indescribable and certain reflection principles fail often below κ.
Definition 2.10**.**
Suppose n<ω and Trn−1(κ) is cofinal in κ. We say that □n(κ) holds trivially if there is a □n(κ)-sequence C=⟨Cα:α∈Trn−1(κ)⟩ and a club E⊆κ such that for all α∈Trn−1(κ)∩E, Cα is trivially an n-club subset of α in the sense that Cα is a Πn−11-indescribable subset of α and has no Πn−11-indescribable proper initial segment.
Notice that □(κ) holds trivially if cf(κ)=ω1. In this case we can find a club E⊆κ
consisting of ordinals of countable cofinality, namely, let ⟨αξ:ξ<ω1⟩ be an increasing continuous cofinal sequence in κ, and let E consist of αξ for ξ a limit ordinal. For all α∈E, we can let Cα be a cofinal subset of α of order type ω. Then, for every limit ordinal β∈κ∖E, we can let αβ=max(E∩β)
and set Cβ to be the interval (αβ,β). It is easily verified that a sequence thus defined is a □(κ)-sequence.
Recall that the principle Refln(κ) holds if and only if κ is Πn1-indescribable and
for every Πn1-indescribable subset X of κ, there is an α<κ such that X∩α is Πn1-indescribable (see [Cod19] and [CS20] for more details).
Proposition 2.11**.**
Suppose 1≤n<ω and κ is Πn1-indescribable.
Then □n(κ) holds trivially if and only if there is a
club E⊆κ such that ¬Refln−1(α) holds
for every α∈Trn−1(κ)∩E.
Proof.
If □n(κ) holds trivially, then there is a □n(κ)-sequence C=⟨Cα:α∈Trn−1(κ)⟩ and a
club E⊆κ such that for α∈Trn−1(κ)∩E, Cα is a Πn−11-indescribable set with no Πn−11-indescribable initial segment, in which case Cα is a witness to the fact that Refln−1(α) fails.
Conversely, suppose that E⊆κ is a club and ¬Refln−1(α) holds for every α∈Trn−1(κ)∩E.
For each α∈Trn−1(κ)∩E, let Cα be a Πn−11-indescribable subset of α which has no Πn−11-indescribable proper initial segment. Then each Cα is trivially n-club in α. For all β∈Trn−1(κ)∖E, let
αβ=max(E∩β), and let Cβ be the interval (αβ,β). Then C=⟨Cα:α∈Trn−1(κ)⟩ is easily
seen to be a coherent sequence of n-clubs, since there are no points at which coherence needs to be checked for indices in E and
coherence is easily checked for indices outside of E because of the uniformity of the definition. We must argue that C has no thread. Suppose there is a thread C⊆κ through C. Since κ is Πn1-indescribable and C is an n-club subset of κ it follows, by Corollary 2.8, that Trn−1(C) is an n-club in κ. Thus we can choose α,β∈Trn−1(C)∩E with α<β. Since C is a thread we have Cα=Cβ∩α=C∩α, which contradicts the fact that Cβ has no Πn−11-indescribable proper initial segment. This shows that □n(κ) holds trivially.∎
Remark 2.12**.**
It seems like it might be more optimal to change Definition 2.10
to instead say that □n(κ) holds trivially if there is
a □n(κ)-sequence C and an n-clubE⊆κ such that for all
α∈Trn−1(κ)∩E, Cα is trivially an n-club subset of α.
However, we were not able to prove the analogue of Proposition 2.11
corresponding to this alternative definition, namely that □n(κ) holds trivially if and
only if there is an n-clubE⊆κ such that ¬Refln−1(α)
holds for every α∈Trn−1(κ)∩E.
Corollary 2.13**.**
In L, if κ is the least Πn1-indescribable cardinal, then □n(κ) holds trivially.
Proof.
Generalizing a result of Jensen [Jen72], Bagaria, Magidor and Sakai proved [BMS15] that in L a cardinal κ is Πn1-indescribable if and only if Refln−1(κ) holds. Suppose V=L and κ is the least Πn1-indescribable cardinal. Then Refln−1(α) fails for all α<κ. Hence by Proposition 2.11, □n(κ) holds trivially.
∎
Brickhill and Welch showed more generally that in L, if κ is Πn1-indescribable and not Πn+11-indescribable, then their principle □n(κ) holds. Since L can have Πn1-indescribable, but not Πn+11-indescribable, cardinals below which, for instance, the set of Πn−11-indescribable cardinals is Πn1-indescribable, it follows from reasonable assumptions that in L our principle □n(κ) can hold nontrivially at a Πn1-indescribable cardinal. We do not know how to force □n(κ) to hold non-trivially at a Πn1-indescribable cardinal.
Another consequence of Proposition 2.11 is that we can force □1(κ) to hold trivially at a Π11-indescribable cardinal by killing certain stationary reflection principles below κ.
Recall that a partial order P is said to be α-strategically closed, for an ordinal α, if Player II has a winning strategy in the following two-player game Gα(P) of perfect information. In a run of Gα(P), the two players take turns playing elements of
a decreasing sequence ⟨pβ:β<α⟩ of conditions from P. Player I plays at all odd ordinal stages, and Player II plays at all even ordinal stages (in particular, at limits). Player II goes first and must play \mathbbm1P. Player I wins if there is a limit ordinal γ<α
such that ⟨pβ:β<γ⟩ has no lower bound (i.e., if Player II is unable to play at stage γ).
If the game continues successfully for α-many moves, then Player II wins. Clearly, for a cardinal α, if P is α-strategically closed, then P is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\alpha-distributive, and hence adds no new α-sequences of ground model sets.
We will use the following general proposition about indestructibility of weakly compact cardinals.
Definition 2.14**.**
Suppose κ is an inaccessible cardinal. We say that a forcing iteration
[TABLE]
is good if it has Easton support and, for all
α<κ, if α is inaccessible, then Q˙α is a Pα-name for a poset such that \mathbbm1Pα⊩Q˙α∈V˙κ,
where V˙κ is a Pα-name for (Vκ)VPα and, otherwise, Q˙α is a Pα-name for trivial forcing.
If Pκ is a good iteration, then we can argue by induction on α that every Pα∈Vκ because if Pα∈Vκ and \mathbbm1Pα⊩Q˙α∈V˙κ, then Pα∗Q˙α∈Vκ. The following standard proposition about good iterations can be found, for example, in [Cum10].
Proposition 2.15**.**
Suppose κ is a Mahlo cardinal. Then a good iteration Pκ has size κ and is κ-c.c.
Lemma 2.16**.**
Suppose κ is weakly compact and ⟨Pα,Q˙β:α≤κ,β<κ⟩ is a good iteration which at non-trivial stages α has \mathbbm1Pα⊩‘‘Q˙α is α-strategically closed”, and let G be P-generic over V. Then κ remains weakly compact in V[G].
Proof.
By Proposition 2.15, we can assume without loss that P⊆Vκ. Since κ is weakly compact, there are κ-models M and N with A∈M for which there is an elementary embedding j:M→N with critical point κ. A nice-name counting argument, using the κ-c.c. and the fact that the tails of the forcing iteration are eventually α-distributive for every α<κ, shows that κ is inaccessible in V[G].
Suppose A∈P(κ)V[G] and let A˙∈H(κ+)V be a Pκ-name such that A˙G=A. Let M be a κ-model with A˙∈M for which there are a
κ-model N and an elementary embedding j:M→N with critical point κ. Since N<κ∩V⊆N, we have j(Pκ)≅Pκ∗Q˙κ∗P˙κ,j(κ), where N believes that \mathbbm1Pκ⊩‘‘Q˙κ is κ-strategically closed”, and P˙κ,j(κ) is a Pκ∗Q˙κ-name for N’s version of the tail of the iteration j(Pκ) of length j(κ). By the generic closure criterion (Lemma 3.2), since Pκ has the κ-c.c., N[G] is a κ-model in V[G]. The poset (Q˙κ∗P˙κ,j(κ))G is κ-strategically closed in N[G], so, by diagonalizing, we can build an N[G]-generic filter H∗G′∈V[G] for (Q˙κ∗P˙κ,j(κ))G. Since conditions in Pκ have supports of size less than the critical point of j we have j"G⊆G^=defG∗H∗G′. Thus j lifts to j:M[G]→N[G^]. Since A=A˙G∈M[G], this shows that κ remains weakly compact in V[G].
∎
Proposition 2.17**.**
If κ is Π11-indescribable (weakly compact), then there is a forcing extension in which □1(κ) holds trivially and κ remains Π11-indescribable.
Proof.
For regular α>ω, let Sα denote the usual forcing to add a nonreflecting stationary subset of α∩cof(ω) (see Example 6.5 in [Cum10]). Recall that conditions in Sα are bounded subsets p of α∩cof(ω) such that for every β≤sup(p) with cf(β)>ω, the set p∩β is nonstationary in β.
It is not difficult to see that the poset Sα is α-strategically closed.
Now we let ⟨Pα,Q˙β:α≤κ,β<κ⟩ be an Easton-support iteration of length κ such that if α<κ is inaccessible, then Q˙α is a Pα-name for SαVPα, and
otherwise Q˙α is a Pα-name for trivial forcing.
Suppose G is generic for Pκ over V. By Lemma 2.16, since Pκ has all the right properties, κ remains weakly compact in V[G]. Also, in V[G], for each inaccessible α<κ, by a routine genericity argument and the fact that the tail of the forcing iteration from stage α+1 to κ is α+-strategically closed, the stage α generic Hα obtained from G yields a nonreflecting stationary subset of α: Sα=⋃Hα. Thus in V[G], Refl0(α) fails for all inaccessible α<κ, and hence □1(κ) holds trivially by Proposition 2.11.
∎
In Section 5 we will show that □1(κ) can hold non-trivially at a weakly compact cardinal.
3. Preserving Πn1-indescribability by forcing
In this section, we will provide some results to be used in indestructibility arguments for Πn1-indescribable cardinals in later sections.
The following two folklore lemmas (and their variants) are widely used in indestructibility arguments for large cardinals characterized by the existence of elementary embeddings.
Lemma 3.1** (Ground closure criterion).**
Suppose κ is a cardinal, M is a κ-model, P∈M is a forcing notion, and G∈V is generic for P over M. Then M[G] is a κ-model.
Lemma 3.2** (Generic closure criterion).**
Suppose κ is a cardinal, M is a κ-model, P∈M is a forcing notion with the κ-c.c., and G is generic for P over V. Then M[G] is a κ-model in V[G].
Lemma 3.3**.**
Suppose κ is inaccessible, P is a κ-strategically closed forcing and G is generic for P over V. Then (Vκ,∈,A)⊨∀Xψ(X,A) implies ((Vκ,∈,A)⊨∀Xψ(X,A))V[G] for all A∈Vκ+1V and all first order ψ.
Proof.
First, observe that since P is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-distributive, κ remains inaccessible in V[G] and Vκ=VκV[G].
Suppose towards a contradiction that (Vκ,∈,A)⊨∀Xψ(X,A), but for some B⊆Vκ in V[G], (Vκ,∈,A)⊨¬ψ(B,A). Let B˙ be a P-name for B. Since κ is inaccessible in V[G], the set
[TABLE]
contains a club in V[G]. Let C˙ be a P-name for such a club. In V, we can use Player II’s winning strategy in Gκ(P) together with the names B˙ and C˙ to build B^ and C^ such that C^ is club in κ and for each α∈C^ we have
[TABLE]
Since (Vκ,∈,A)⊨∀Xψ(X,A), we have (Vκ,∈,A,B^)⊨ψ(B^,A), and since κ is inaccessible, the set
[TABLE]
contains a club. Thus, there is an α∈C^ such that
[TABLE]
a contradiction.
∎
Corollary 3.4**.**
Suppose κ is inaccessible, P is a κ-strategically closed forcing notion and G is generic for P over V. If N is a Π11-correct κ-model in V, then N remains a Π11-correct κ-model in V[G].
Proof.
Clearly N remains a κ-model because P is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-distributive.
Let φ be a Π11-statement, and suppose first that (Vκ⊨φ)N.
By Π11-correctness, Vκ⊨φ, and so by Lemma 3.3,
(Vκ⊨φ)V[G]. On the other hand,
if (Vκ⊨¬φ)N, then there is a B⊆Vκ in N witnessing
this failure. Since N, V, and V[G] all have the same Vκ, B witnesses the failure
of φ in both V and V[G] as well, so (Vκ⊨¬φ)V[G]
∎
Proposition 3.5**.**
Suppose κ is inaccessible, P is κ-strategically closed, and G is generic for P over V. If S∈P(κ)V is Π11-indescribable in V[G], then S is Π11-indescribable in V.
Proof.
Suppose towards a contradiction that there is S∈P(κ)V that is Π11-indescribable in V[G] but not Π11-indescribable in V. In V, find a subset A⊆Vκ and a Π11 statement φ=∀Xψ(X,A) such that (Vκ,∈,A)⊨φ and for all α∈S we have (Vα,∈,A∩Vα)⊨¬φ. Since P is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-distributive, V and V[G] have the same Vκ, so it follows that in V[G], by the Π11-indescribability of S, it must be the case that (Vκ,∈,A)⊨∃X¬ψ(X,A). Working in V[G], we fix B⊆Vκ such that (Vκ,∈,A)⊨¬ψ(B,A) and observe that the set
[TABLE]
contains a club. Let C˙ be a P-name for such a club, and let B˙ be a P-name for B. In V, we can use
Player II’s winning strategy in Gκ(P) together with B˙ and C˙ to build B^ and C^ such that C^⊆κ is club and ∀α∈C^, Vα⊨¬ψ(B^∩Vα,A∩Vα). But this implies that Vκ⊨¬ψ(B^,A), a contradiction.
∎
The converse of Proposition 3.5 is clearly false because the forcing Add(κ,1) to add a Cohen subset to κ with bounded conditions can destroy the weak compactness of κ and it is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-closed and therefore κ-strategically closed.
We will see in Section 6 (Remark 6.4) that Proposition 3.5 can fail for Π21-indescribable sets.
A good iteration Pκ of length κ is said to be progressively closed if for every α<κ, there is α≤βα<κ such that every stage after βα is forced to be α-strategically closed. In this case, it is not difficult to see that Pβα forces that the tail of the iteration is α-strategically closed.
Next, we will show that good progressively closed κ-length iterations preserve Πn1-correctness.
Let P be a forcing notion and suppose σ is a P-name. Recall that τ is a nice name for a subset of σ if
[TABLE]
where each Aπ is an antichain of P. It is well known and easy to verify that for every P-name μ, there is a nice name τ for a subset of σ such that \mathbbm1P⊩μ⊆σ→μ=τ. We call such τ the nice replacement for μ.
Lemma 3.6**.**
Suppose σ is a P-name and n≥0. Let Xσ be the set of nice names for subsets of σ, let p be a condition in P and let φ be any Πn-assertion in the forcing language of the form
[TABLE]
Then p⊩φ if and only if
[TABLE]
The analogous statement holds for Σn-assertions in the forcing language.
Proof.
We will prove the lemma simultaneously for Πn and Σn statements by induction on n. Clearly the lemma holds for n=0. Assume inductively that the lemma holds for some n, and suppose φ is an assertion in the forcing language of complexity Πn+1. Let
[TABLE]
where ψ is Δ0 and φˉ(x) is Σn. For the forward direction, clearly p⊩φ implies (∀τ1∈Xσ)(p⊩φˉ(τ1)). By the inductive hypothesis applied to p⊩φˉ(τ1), we conclude that (∀τ1∈Xσ)(∃τ2∈Xσ)⋯p⊩ψ(τ1,…,τn). For the converse, suppose (∀τ1∈Xσ)(∃τ2∈Xσ)⋯p⊩ψ(τ1,…,τn) holds. Let us argue that p⊩(∀x1⊆σ)(∃x2⊆σ)⋯ψ(x1,…,xn). If not, there is some q≤p and some P-name μ for a subset of σ such that q⊩(∀x2⊆σ)⋯¬ψ(μ,x2,…,xn). Let τ be a nice replacement for μ so that q⊩(∀x2⊆σ)⋯¬ψ(τ,x2,…,xn), or in other words, q⊩¬φˉ(τ). By assumption (∃τ2∈Xσ)⋯p⊩ψ(τ,τ2,…,τn), so applying the inductive hypothesis, we obtain p⊩(∃x2⊆σ)⋯ψ(τ,x2,…,xn) and hence p⊩φˉ(τ), a contradiction. The proof of the lemma for Σn+1 statements is similar.
∎
Theorem 3.7**.**
Suppose κ is a Mahlo cardinal, N is a Πn1-correct κ-model and P∈N is a progressively closed good Easton-support iteration of length κ. If G⊆P is generic over V, then N[G] is a Πn1-correct κ-model in V[G].
Proof.
By Proposition 2.15, P has the κ-c.c. and without loss of generality P⊆Vκ. Thus, by the generic closure criterion Lemma 3.2, N[G] remains a κ-model in V[G]. By the progressive closure of the iteration, VκV[G]=Vκ[G]. Thus, VκN[G]=VκV[G]. Let σ∈N be a P-name such that σG=VκN[G]=VκV[G] and dom(σ)⊆Vκ.
Let us argue that N[G] is Πn1-correct. Suppose (VκN[G],∈,A)⊨φ in N[G], where
[TABLE]
is Πn1 and all quantifiers appearing in ψ are first-order over VκN[G]. Let A˙ be a P-name for A such that dom(A˙)⊆Vκ. Let ψˉ(x1,…,xn,A˙) be a formula in the forcing language obtained from ψ by replacing all parameters with P-names and all first-order quantifiers “Qx” with “Qx∈σ” for Q=∀,∃. Let φˉ(σ,A˙) denote the following formula in the forcing language:
[TABLE]
Since (VκN[G],∈,A)⊨φ holds in N[G], it follows that N[G]⊨φˉ(σG,A˙G). Thus, we may choose p∈G with (p⊩φˉ(σ,A˙))N. By Lemma 3.6,
[TABLE]
holds in N. The statement p⊩ψ(τ1,…,τn,A˙) is first-order in the structure (Vκ,∈,τ1,…,τn,σ,A˙,P).222This can be proved by using the definition of the forcing relation and induction on complexity of formulas. Furthermore, since “τ∈Xσ” can be expressed by a first-order formula χ(τ,σ) over (Vκ,∈,σ,τ,P), it follows that the statement in (3.1) is Πn1 over (Vκ,∈,σ,A˙). Since N⊨ “(3.1) holds in (Vκ,∈,σ,A˙)” and N is Πn1-correct at κ, it follows that (3.1) holds in (Vκ,∈,σ,A˙). Hence by Lemma 3.6, p⊩φˉ(σ,A˙) over V, and since p∈G, we conclude that V[G]⊨φˉ(σ,A˙G), which implies (VκV[G],∈,A)⊨φ in V[G].
An analogous argument establishes the converse, verifying that if(VκV[G],∈,A)⊨φ for a Πn1-assertion φ and A∈N[G], then the same assertion holds in N[G].
∎
A similar argument yields the following result.
Corollary 3.8**.**
Suppose κ is an inaccessible cardinal, N is a Πn1-correct κ-model and P∈N is a <κ-distributive forcing notion of size κ. If G⊆P is generic over V, then N[G] remains a Πn1-correct κ-model in V[G].
Proof.
Without loss of generality we can assume that P⊆Vκ. Since P is <κ-distributive, N remains a κ-model in V[G], and, since G∈V[G], it follows that N[G] is a κ-model in V[G] by the ground closure criterion Lemma 3.1. The <κ-distributivity of P entails that VκN[G]=VκV[G]=Vκ. Since the statement “τ is a nice name for a subset of Vˇκ” is first-order over the structure (Vκ,∈,τ,P), the rest of the argument can be carried out as in the proof of Theorem 3.7.
∎
The conclusion of Corollary 3.8 need not hold if the N-generic filter G is not fully V-generic (see Remark 5.7).
4. Shooting n-clubs
Hellsten [Hel10] showed that if W⊆κ is any Π11-indescribable (i.e., weakly compact) subset of κ, then there is a forcing extension in which W contains a 1-club and all weakly compact subsets of W remain weakly compact.
We will define a generalization of Hellsten’s forcing to shoot an n-club through a Πn1-indescribable subset of a cardinal κ while preserving the Πn1-indescribability of all its subsets, so that, in particular, κ remains Πn1-indescribable in the forcing extension.
Suppose γ is an inaccessible cardinal and A⊆γ is cofinal. For n≥1, we define a poset Tn(A) consisting of all bounded n-closed c⊆A ordered by end extension: c≤d if and only if d=c∩supα∈d(α+1).
Lemma 4.1**.**
For n≥1, if γ is inaccessible and A⊆γ is cofinal, then Tn(A) is γ-strategically closed.
Proof.
We describe a winning strategy for player II in the game Gκ(Tn(A)). Player II begins the game by playing c0=∅. At an even successor stage α+2, player II chooses a condition cα+2∈Tn(A) such that cα+2⪇cα+1. At limit stages α<γ, player II records an ordinal γα=⋃β<αcβ, chooses an element ηα∈A∖(γα+1) and plays cα=(⋃β<αcβ)∪{ηα}. In order to argue that cα is a condition in Tn(A), we need to verify, letting c=⋃β<αcβ, that c is not a Πn−11-indescribable subset of γα. We can assume that
γα is Πn−11-indescribable, as otherwise c∩γα is clearly not Πn−11-indescribable. But then, by construction,
{γξ:ξ<α is a limit ordinal} is a club (and hence an (n−1)-club) in γα disjoint from c, which implies that
c is not a Πn−11-indescribable subset of γα. Thus, cα is a valid play by Player II, and we have described a winning strategy
in Gκ(Tn(A)).
∎
Remark 4.2**.**
In fact, for n≥2, Tn(A) satisfies the following strengthening of γ-strategic closure.
For X⊆γ and a poset P, let Gγ,X(P) be the modification of
Gγ(P) in which Player I plays at all stages indexed by an ordinal in X and
Player II plays elsewhere, and it is still the case that Player I wins if and only if there is a limit ordinal
β<γ such that ⟨pα:α<β⟩ has no lower bound in P.
So, Gγ(P) is precisely the game Gγ,X(P), where X is the set of
odd ordinals less than γ. A routine modification of the proof of the preceding lemma shows that Player II
has a winning strategy in the game Gγ,X(Tn(A)) if, for all β<γ,
X∩β is not Πn−11-indescribable. In particular, this is the case if X is the set
of all α<γ such that α is not Πn−21-indescribable.
Theorem 4.3**.**
Suppose that n≥1 and S⊆κ is Πn1-indescribable. Then there is a forcing extension in which S
contains a 1-club and all Πn1-indescribable subsets of S from V remain Πn1-indescribable.
Proof.
Let Pκ+1=⟨(Pα,Q˙β):α≤κ+1,β≤κ⟩ be an Easton-support iteration such that
•
if γ≤κ is inaccessible and S∩γ is cofinal in γ, then Q˙γ=(T1(S∩γ))VPγ;
•
otherwise, Q˙γ is a Pγ-name for trivial forcing.
Since κ is Πn1-indescribable, Proposition 2.15 implies that
Pκ has size κ and the κ-c.c.. Forcing with Pκ+1 therefore preserves the
inaccessibility of κ because Pκ has the κ-c.c. and is progressively closed and
Q˙κ is forced to be {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-distributive.
Suppose G∗H⊆Pκ∗Q˙κ is generic over V. Clearly, C(κ)=def⋃H is a 1-closed subset of S; to show that C(κ) is a 1-club subset of κ, it remains to show that C(κ) is a stationary subset of κ in V[G∗H].
Suppose T⊆S is Πn1-indescribable in V. We will simultaneously show that in V[G∗H], C(κ) intersects every club subset of κ and T remains Πn1-indescribable (in particular, κ remains Πn1-indescribable). Fix A,C∈P(κ)V[G∗H] such that C is a club subset of κ in V[G∗H]. Let A˙,C˙,C˙(κ)∈H(κ+) be Pκ+1-names such A˙G∗H=A, C˙G∗H=C and C˙(κ)G∗H=C(κ). In V, let M be a κ-model with A˙,C˙,C˙(κ),Pκ+1,T,S∈M. Since T is Πn1-indescribable in V, it follows by Theorem 2.6 that there is a Πn−11-correct κ-model N and an elementary embedding j:M→N with critical point κ such that κ∈j(T).
Since N<κ∩V⊆N and j(S)∩κ=S, it follows that j(Pκ)≅Pκ∗T˙1(S)∗P˙κ,j(κ), where P˙κ,j(κ) is a Pκ+1-name for the tail of the iteration j(Pκ). Since Pκ has the κ-c.c., by the generic closure criterion (Lemma 3.2), N[G] is a κ-model in V[G]. Since T1(S) is κ-strategically closed, N[G] remains a κ-model in V[G∗H], and hence by the ground closure criterion (Lemma 3.1), N[G∗H] is a κ-model in V[G∗H]. Since Pκ,j(κ)=(P˙κ,j(κ))G∗H is κ-strategically closed in N[G∗H] and N[G∗H] is a κ-model in V[G∗H], it follows that there is a filter G′∈V[G∗H] which is generic for Pκ,j(κ) over N[G∗H] and the embedding j lifts to j:M[G]→N[G^], where G^≅G∗H∗G′.
Notice that p=C(κ)∪{κ}=⋃H∪{κ}∈N[G^]. Since κ∈j(T)⊆j(S), we see that N[G^]⊨ “p is a closed subset of j(S)”. Thus, p∈j(T1(S)). Since j(T1(S)) is j(κ)-strategically closed in N[G^] and N[G^] is a κ-model in V[G∗H] by the ground closure criterion, there is a filter H^∈V[G∗H] generic for j(T1(S)) over N[G^] with p∈H^. Since p is below every condition in j"H, we have j"H⊆H^, and thus j lifts to j:M[G∗H]→N[G^∗H^], where κ∈j(C(κ)). By Theorem 3.7 and Corollary 3.8,
N[G∗H] is a Πn−11-correct κ-model in V[G∗H]. Since Pκ,j(κ) and j(T1(S)) are (κ+1)-strategically closed in N[G∗H],
it follows that N[G∗H] and N[G^∗H^] have the same subsets of Vκ, so, in particular,
N[G^∗H^] is a Πn−11-correct κ-model in V[G∗H]. Thus, by Theorem 2.6, we have verified that T remains Πn1-indescribable in V[G∗H].
It remains to show that C(κ)∩C=∅. Recall that C is a club subset of κ in V[G∗H],
so j(C) is a club subset of j(κ) in N[G^∗H^]. Since j(C)∩κ=C, it follows
that κ∈j(C), and hence κ∈j(C(κ)∩C). By elementarity, C(κ)∩C=∅, so C(κ) is a stationary and hence 1-club subset of κ in V[G∗H].
∎
Remark 4.4**.**
In the proof of Theorem 4.3, for any m≤n we can force with Tm(S∩γ) at every relevant
γ≤κ instead of T1(S∩γ). This iteration will still preserve
the Πn1-indescribability of every subset of S that is Πn1-indescribable in V, and it will
shoot an m-club through S. If m>1, then this forcing will have slightly better closure properties
then T1(S∩γ) (see Remark 4.2), which could be useful for
certain applications, though we have not found any such applications as of yet.
5. □1(κ) can hold nontrivially at a weakly compact cardinal
In this section, we will prove Theorem 1.1, which implies that if κ is κ+ weakly compact then the principle □1(κ) can be forced to hold at a weakly compact cardinal that has many weakly compact cardinals below it. Let us remind the reader that the corresponding relative consistency result was first obtained by Brickhill and Welch [BW] using L.
First, we define a forcing to add a generic coherent sequence of 1-clubs to a Mahlo cardinal κ.
Definition 5.1**.**
Suppose κ is a Mahlo cardinal. We define a forcing Q(κ) such that q is a condition in Q(κ) if and only if
•
q is a sequence with dom(q)=inacc(κ)∩(γq+1) for some γq<κ,
•
q(α)=Cαq is a 1-club subset of α for each α∈dom(q) and
•
for all α,β∈dom(q), if Cβq∩α∈Π01(α)+, then Cαq=Cβq∩α.333Equivalently, for all α,β∈dom(q), if α is inaccessible and Cβq∩α is stationary, then Cαq=Cβq∩α.
The ordering on Q(κ) is defined by letting p≤q if and only if p is an end extension of q.
Proposition 5.2**.**
Suppose κ is a Mahlo cardinal. The poset Q(κ) is κ-strategically closed.
Proof.
We describe a winning strategy for Player II in the game Gκ(Q(κ)). We will recursively arrange so that, if δ<κ
and ⟨qα:α<δ⟩ is a partial play of the game with Player II playing according
to her winning strategy, then, for all limit ordinals β<δ, we have {γqα:α<β,α\mboxeven} is a club in its supremum and,
if γqβ is inaccessible, is a subset of Cγqβqβ.
We will also arrange that, for all even successor ordinals α<β<δ, γqα and γqβ are
inaccessible cardinals, Cγqβqβ∩γqα=Cγqαqα
and {γqα:α<β,α even}⊆Cγqβqβ.
We first deal with successor ordinals. Suppose that δ<κ is an even ordinal and ⟨qα:α≤δ+1⟩ has been played. Suppose first that γqδ is an inaccessible cardinal (in particular, by our recursion hypotheses, this must be the case if δ is a successor ordinal). In this case, let γqδ+2 be the least inaccessible cardinal above γqδ+1 and let qδ+2 be the condition extending qδ+1 by setting
[TABLE]
The fact that Cγqδqδ∪{γqδ}⊆Cγqδ+2qδ+2
ensures that the recursion hypothesis is maintained. The set Cγqδ+2qδ+2 is stationary
in γqδ+2 because it contains a tail, and it has all its inaccessible stationary reflection points because
those are {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptscriptstyle\leq}}{\scriptscriptstyle\leq}}}\gamma^{q_{\delta}}. The coherence property holds because we have omitted the interval (γqδ,γqδ+1)
from Cγqδ+2qδ+2 ensuring that for no α in that interval is Cγqδ+2qδ+2∩α stationary.
It follows that qδ+2 is a condition and a valid play for Player II.
If γqδ is not inaccessible, then δ is a limit ordinal (by our recursion hypothesis). In this case, again let γqδ+2 be the least inaccessible cardinal above γqδ+1, and define qδ+2 by setting
[TABLE]
A similar argument as above verifies that qδ+2 is a valid play in the game and maintains our recursion hypotheses.
Finally, suppose that δ<κ is a limit ordinal and ⟨qα:α<δ⟩ has been played. Let γqδ=sup{γqα:α<δ}. If γqδ is not
inaccessible, then we can simply set qδ=⋃α<δqα.
If γqδ is inaccessible, then we must additionally define
Cγqδqδ. We do this by setting
[TABLE]
It is easy to verify that this is as desired. The fact that Cγqδqδ
is stationary in γqδ follows from the fact that {γqα:α<δ,α\mboxeven}⊆Cγqδqδ, so it in
fact contains a club in γqδ.
∎
It follows from Proposition 5.2 that Q(κ) is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-distributive. In particular, if G⊆Q(κ) is a generic filter,
then ⋃G is a coherent sequence of 1-clubs of length κ, since Vκ remains unchanged.
Next, we define a forcing which will be used to generically thread a coherent sequence of 1-clubs.
Definition 5.3**.**
Suppose that C(κ)=⟨Cα(κ):α∈inacc(κ)⟩ is a coherent sequence of 1-clubs. The poset T(C(κ)) consists of all conditions t such that
•
t is a 1-closed bounded subset of κ and
•
for every α<κ, if t∩α∈Π01(α)+, then Cα(κ)=t∩α.444Equivalently, for every inaccessible cardinal α<κ, if t∩α is stationary in α then Cα(κ)=t∩α.
The ordering on T(C(κ)) is defined by letting t≤s if and only if t end-extends s.
Lemma 5.4**.**
Suppose κ is a regular cardinal and C(κ) is a coherent sequence of 1-clubs. Then the poset T(C(κ)) is κ-strategically closed.555Note that the forcing to thread a □(κ)-sequence is never κ-strategically closed.
Proof.
We describe a winning strategy for player II in Gκ(T(C(κ))). Player II’s strategy at successor ordinal stages can be arbitrary provided that Player II chooses conditions properly extending Player I’s previous play.
So let δ be a limit stage and let ⟨tα:α<δ⟩ be the sequence of conditions played at previous stages of the game. Player II then plays tδ=(⋃α<δtα)∪{κδ+1}, where κδ=sup(⋃α<δtα). We will also assume recursively that Player II has played according to this strategy successfully at previous limit stages of the game, so that, if λ<δ is a limit ordinal, then κλ∈/tδ. It remains to show that tδ∈T(C(κ)).
To argue that tδ is a 1-closed subset of κ, it suffices to see that tδ∩κδ is not stationary in κδ. By our recursive assumption, {κλ:λ<δ} is a club subset of κδ disjoint from tδ, and hence tδ∩κδ is not stationary in κδ. The coherence condition follows easily.
∎
Lemma 5.5**.**
Suppose κ is a regular cardinal and C(κ)=⟨Cα(κ):α∈inacc(κ)⟩ is a coherent sequence of 1-clubs. If G⊆T(C(κ)) is generic over V, then Cκ=⋃G threads C(κ) in V[G].
Proof.
By the {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-distributivity of T(C(κ)) and the definition of its conditions, Cκ meets the coherence requirements and contains all its inaccessible stationary reflection points. So it remains to check that Cκ is stationary.
Fix a club C⊆κ in V[G] and let C˙ be a T(C(κ))-name for C. Assume towards a contradiction that C∩Cκ=∅. Fix t0∈T(C(κ)) forcing that C˙ is a club and C˙∩C˙κ=∅, where C˙κ is the canonical T(C(κ))-name for Cκ, and let β0 be the supremum of t0.
Recursively define a decreasing sequence ⟨tn:n<ω⟩ of conditions from T(C(κ)) as follows, letting βn denote sup(tn).
Given n<ω, if tn is defined, find an ordinal αn with βn<αn<κ
and a condition tn+1≤tn such that tn+1⊩αˇn∈C˙.
Let α=⋃n<ωαn=⋃n<ωβn, and let t=⋃n<ωtn∪{α}.
Clearly t is a condition in T(C(κ)) and t⊩α∈C˙∩C˙κ, which is the desired contradiction.
∎
Theorem 5.6**.**
Suppose κ is weakly compact and the GCH holds. There is a cofinality-preserving forcing extension in which
(1)
for all γ≤κ, every set W∈P(γ)V which is weakly compact in V remains weakly compact and
2. (2)
□1(κ)* holds.*
Proof.
Define an Easton-support iteration ⟨(Pα,Q˙β):α≤κ+1,β≤κ⟩ as follows.
•
If γ<κ is Mahlo, let Q˙γ=(Q(γ)∗T˙(C(γ)))VPγ, where C(γ) is the generic coherent sequence of 1-clubs of length γ added by Q(γ).
•
If γ=κ, let Q˙κ=(Q(γ))VPκ.
•
Otherwise, let Q˙γ be a Pγ-name for trivial forcing.
Let G∗H⊆Pκ∗Q˙κ be generic over V. V[G∗H] is our desired model.
Standard arguments using progressive closure of the iteration Pκ together with the GCH show that cofinalities are preserved in V[G∗H].
The argument for the preservation of weakly compact subsets of γ<κ is similar to and easier than the argument for the preservation of weakly compact subsets of κ, and we leave it to the reader.
Recall that C(κ)=⋃H is a coherent sequence of 1-clubs of length κ. Fix W∈P(κ)V which is weakly compact in V. It remains to argue that in V[G∗H], W is weakly compact and C(κ) has no thread.
Fix a set C∈P(κ)V[G∗H] which is a 1-club subset of κ in V[G∗H]. We will simultaneously show that C is not a thread through C(κ) and that W remains weakly compact in V[G∗H]. Fix A∈P(κ)V[G∗H] and let C˙,A˙,τ∈H(κ+)V be Pκ+1-names with C˙G∗H=C, A˙G∗H=A and τG∗H=C(κ). Let M be a κ-model with W,C˙,A˙,τ,Pκ+1∈M. Since W is weakly compact in V, there is a κ-model N and an elementary embedding j:M→N such that
crit(j)=κ and κ∈j(W).
Since N<κ∩V⊆N, we have, in N,
[TABLE]
where P˙κ,j(κ) is a Pκ+1∗T˙(C(κ))-name for the iteration from κ+1 to j(κ). By Lemma 5.4, T(C(κ)) is κ-strategically closed in N[G∗H], and hence, using standard arguments, we can build a filter h∈V[G∗H] for T(C(κ)) which is generic over N[G∗H]. Let Cκ=⋃h and notice that Cκ=C because C∈N[G∗H] and Cκ is generic over N[G∗H]. Similarly, we can build a filter G′∈V[G∗H] which is generic for Pκ,j(κ)=(P˙κ,j(κ))G∗H∗h over N[G∗H∗h]. Since j"G⊆G∗H∗h∗G′, the embedding can be extended to j:M[G]→N[G^], where G^=G∗H∗h∗G′.
Let Q(κ)=(Q˙(κ))G. Working in N[G^], since
[TABLE]
is a coherent sequence of 1-clubs and Cκ is a thread through C(κ) by Lemma 5.5, it follows that the function
[TABLE]
is a condition in j(Q(κ)) below every element of j"H. We may build a filter H^∈V[G∗H] which is generic for j(Q(κ)) over N[G^] with q∈H^. Since j"H⊆H^, it follows that j extends to j:M[G∗H]→N[G^∗H^]. Now A∈M[G∗H] and κ∈j(W), so W is weakly compact in V[G∗H].
It remains to show that C is not a thread through C(κ). For the sake of contradiction, assume C is a thread through C(κ). By elementarity we see that in N[G^∗H^],
[TABLE]
is a coherent sequence of 1-clubs. Since q=C(κ)⌢⟨Cκ⟩∈H^ we have Cˉκ(j(κ))=Cκ. Now since C is a thread for C(κ) in in M[G∗H], by elementarity, j(C) is a thread for j(C(κ))=⟨Cˉα(j(κ)):α∈inacc(j(κ))⟩. Since κ is inaccessible in N[G^∗H^] and κ∈Tr0(j(C)), it follows that Cκ=Cˉκ(j(κ))=j(C)∩κ=C, a contradiction.
∎
Remark 5.7**.**
Observe that in the proof of Theorem 5.6, if we assume that κ is Π21-indescribable and that the target N of the embedding j:M→N we start with is Π11-correct, then the κ-model N[G∗H] from the proof of Theorem 5.6 is Π11-correct by Theorem 3.7 and Corollary 3.8. However, the κ-model N[G∗H∗h] cannot be Π11-correct because otherwise we would have shown that, in the extension V[G∗H], κ is Π21-indescribable, contradicting Proposition 2.9. Thus, a forcing extension of a Π11-correct κ-model, even by a κ-strategically closed forcing notion, need not be Π11-correct
if the generic filter is not fully V-generic.
For the next theorem, let us recall what it means for a cardinal κ to be α-weakly compact, where α≤κ+. Suppose κ is a weakly compact cardinal. It is not difficult to see that if sets X,Y∈P(κ) are equivalent modulo the ideal Π11(κ), then their traces Tr1(X) and Tr1(Y) are equivalent as well. Thus, the trace operation Tr1:P(κ)→P(κ) leads to a well defined operation Tr1:P(κ)/Π11(κ)→P(κ)/Π11(κ) on the collection P(κ)/Π11(κ) of equivalence classes of subsets of κ modulo the ideal Π11(κ). By taking diagonal intersections at limit ordinals, we can iterate the trace operation on the equivalence classes κ+-many times.
To be more precise, fix a sequence ⟨eβ∣κ≤β<κ+,β limit⟩, where eβ:κ→β
is a bijection for all relevant β. To start, let Tr11=Tr1. Given α<κ+, if Tr1α:P(κ)/Π11(κ)→P(κ)/Π11(κ)
has been defined, let Tr1α+1=Tr1∘Tr1α. If β<κ is a limit ordinal and Tr1α has been defined for all α<β,
then define Tr1β by letting Tr1β([S])=[⋂α<βSα], where Sα is a representative
element of Tr1α([S]) for all α<β. Finally, if β is a limit ordinal and κ≤β<κ+,
then let Tr1β([S])=[△η<κSeβ(η)].
It is straightforward to verify that each of these
functions is well-defined and does not depend on our choice of eβ for limit β.
For α<κ+, the cardinal κ is then said to be α-weakly compact if Tr1α([κ])=[∅],
and κ is κ+-weakly compact if it is α-weakly compact for all α<κ+.
For more details, the reader is referred to [Cod19].
If we start with a κ+-weakly compact cardinal κ in Theorem 5.6, then it will remain κ+-weakly compact in the extension V[G∗H]. Because weakly compact subsets of all cardinals γ≤κ are preserved to V[G∗H], it is easy to show by induction on α≤κ+ that if a set X is in the equivalence class Trα([κ]) as computed in V, then the equivalence class Trα([κ]) as computed in V[G∗H] contains some Y⊇X. Thus, we get the following.
Theorem 1.1.
If κ is κ+-weakly compact and GCH holds then there is a cofinality preserving forcing extension in which
(1)
κ* remains κ+-weakly compact and*
2. (2)
□1(κ)* holds.*
Next we will show that, if κ is Mahlo, one can characterize precisely when □1(κ) holds after forcing with Q(κ).
Notice that, if there is a stationary subset of κ that does not reflect at an inaccessible cardinal (i.e., if Refl0(κ)) fails, then □1(κ)
must fail, since any such non-reflecting stationary set of κ would then be a thread through
any coherent sequence of 1-clubs of length κ. We will see in Theorem 5.9
that Refl0(κ) holding in the extension by Q(κ) is in fact sufficient for □1(κ) to hold.
First, we need the following general proposition. Recall that Refln(κ) holds if and only if κ is Πn1-indescribable and,
for every Πn1-indescribable subset S of κ, there is an α<κ such that S∩α is Πn1-indescribable.
Proposition 5.8**.**
Fix n<ω. If κ is a cardinal, Refln(κ) holds and S∈Πn1(κ)+, then the set
[TABLE]
is Πn1-indescribable.
Proof.
We proceed by induction on κ. Suppose the proposition holds for all cardinals α<κ, Refln(κ) holds and
S∈Πn1(κ)+. It suffices to show that T∩C=∅ for every n-club subset C of κ.
Fix an n-club set C and note that S∩C is Πn1-indescribable. Thus, by Refln(κ), there is some α0<κ such that S∩C∩α0∈Πn1(α0)+. It follows that α0∈Trn(S), but also α0∈C because C contains all of its Πn−11-reflection points. If α0∈T, we have shown that T∩C=∅.
So suppose that α0∈/T, so Refln(α0) holds. We can now appeal to the inductive hypothesis
at α0, applied to the Πn1-indescribable set S∩α0 and the n-club C∩α0,
to find a cardinal α1∈T∩C.
∎
Theorem 5.9**.**
Suppose κ is Mahlo and p∈Q(κ). The following are equivalent:
(1)
p⊩Q(κ)Refl0(κ)**
2. (2)
p⊩Q(κ)□1(κ)**
Proof.
The implication (2)⇒(1) follows immediately from the observation
that a stationary subset of κ that does not reflect at any inaccessible
cardinal is a thread through any putative □1(κ)-sequence.
We now show (1)⇒(2). Suppose for the sake of contradiction
that p⊩Q(κ)Refl0(κ) and there is p1≤Q(κ)p such that
p1⊩Q(κ)¬□1(κ). In particular, p1 forces
that ⋃G˙ is not a □1(κ)-sequence, so there is a
Q(κ)-name C˙ that is forced by p1 to be a thread through
⋃G˙.
Let G be Q(κ)-generic over V with p1∈G, and move to V[G].
Let C=C˙G. Since C is stationary
in κ and Refl0(κ) holds, Proposition 5.8 implies
that there are stationarily many inaccessible λ<κ such that
C reflects at λ and Refl0(λ) fails.
Next, observe that every sequence of elements of G of size less than κ has a lower bound in G.
Suppose that β<κ, and fix in V[G] a sequence p=⟨pξ:ξ<β⟩ of elements of G.
The sequence p must be in V by the {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle<}}{\raise 1.0pt\hbox{\scriptstyle<}}{\raise 0.0pt\hbox{\scriptscriptstyle<}}{\scriptscriptstyle<}}}\kappa-distributivity of Q(κ), and so there is a
condition p∈G forcing that p is contained in G. But then p is a lower bound for p.
Observe also that, for all γ<κ, the initial segment C(γ)=C∩γ of C is in V.
Now, in V[G], we build a strictly decreasing sequence of conditions ⟨qα:α<κ⟩ from G such that
(1)
q0=p1,
2. (2)
{γqα:α<κ}, the set of suprema of the domains of the conditions, is a club and
3. (3)
for all α<κ, qα+1⊩Q(κ)C˙∩γqα=Cˇ(α).
We can ensure that (2) holds as follows. At a limit stage λ<κ, given that we have already constructed ⟨qα:α<λ⟩, we know that there is some q∈G below our sequence. So we let γλ=⋃α<λγα and take qλ=q↾γλ+1.
Thus, we can find an inaccessible cardinal λ such that λ=γqλ, C reflects at λ, and Refl0(λ) fails. Since Refl0(λ) fails (in V[G] and hence also in V, since forcing with Q(κ) did not add any bounded subsets to κ), we can fix in V a stationary Cλ⊆λ that is different from C(λ)=C∩λ and that does not reflect at any inaccessible cardinal below λ.
Now form a condition qλ∗∈Q with γqλ∗=γqλ=λ by letting qλ∗↾λ=⋃α<λqα and Cλqλ∗=Cλ.
This is easily seen to be a valid condition, because everything needed to
construct it is in V and since Cλ does not reflect at any
inaccessible cardinal. Since qλ∗≤Q(κ)qα for all
α<λ, we have
[TABLE]
In particular, since C(γ)=C∩λ is stationary in
λ, and since qλ∗ extends p1 and thus forces that
C˙ is a thread through ⋃G˙, it must be the case that
qλ∗ forces that the λ-th entry in ⋃G˙
is C(λ). However, qλ∗ forces the λ-th
entry in ⋃G˙ to be Cλ, which is different from
C∩λ. This gives the desired contradiction.
∎
Remark 5.10**.**
Since the weak compactness of κ implies Refl0(κ), by Theorem 5.9 it follows that in the proof of Theorem 5.6, in order to show that □1(κ) holds in V[G∗H] it suffices to show that κ remains weakly compact.
6. Consistency of □1(κ) with Refl1(κ)
In this section, we will show that the principle □1(κ) is consistent with Refl1(κ). First, we will need a lemma showing that we can force the existence of a fast function while preserving Π21-indescribability.
The fast function forcing Fκ, introduced by Woodin, consists of conditions that are partial functions p\vbox...κ→κ such that for every γ∈dom(p),
the following conditions hold:
•
γ is inaccessible,
•
p"γ⊆γ, and
•
∣p↾γ∣<γ.
The union f\vbox...κ→κ of a generic filter for Fκ is called a fast function. Let F[γ,κ) denote the subset of Fκ consisting of conditions p with dom(p)⊆[γ,κ) and observe that F[γ,κ) is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptscriptstyle\leq}}{\scriptscriptstyle\leq}}}\gamma-closed. It is not difficult to see that for any condition p∈Fκ and γ∈dom(p), the forcing Fκ factors below p as
[TABLE]
Lemma 6.1**.**
Suppose κ is Πn1-indescribable. In a generic extension V[f] by fast function forcing, κ remains Πn1-indescribable and the fast function f has the following property. For every A∈H(κ+) and α<κ+, there are a κ-model M with f,A∈M, a Πn−11-correct κ-model N and an elementary embedding j:M→N with critical point κ such that j(f)(κ)=α and j,M∈N.
Proof.
The cardinal κ remains inaccessible in V[f] because for unboundedly many inaccessible α<κ, there is a condition p∈G with α∈domp, so
Fκ below p factors with a first factor of size α and a second factor that is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptscriptstyle\leq}}{\scriptscriptstyle\leq}}}\alpha-closed.
Fix A∈H(κ+)V[f] and α<κ+ (note that V and V[f] have the same κ+). Let A˙ be an Fκ-name for A and let B⊆κ code α. By Theorem 2.6 (4), there are a κ-model M with Fκ,A˙,B∈M, a Πn−11-correct κ-model N and an elementary embedding j:M→N with critical point κ such that j,M∈N. We will lift j to M[G]. Let p=⟨κ,α⟩ be a condition in j(Fκ). Below p, j(Fκ) factors as j(Fκ)↾p≅Fκ×F[κ,j(κ))↾p, where the second factor is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptscriptstyle\leq}}{\scriptscriptstyle\leq}}}\kappa-closed in N. In V, we can build an N-generic function f′ for F[κ,j(κ)) containing p, and so f×f′ is N-generic for j(Fκ). Thus, we can lift j to j:M[f]→N[f][f′], and clearly M[f] and j are in N[f][f′].
It remains to verify that M[f] is a κ-model and N[f][f′] is a Πn−11-correct κ-model. The argument to show that M[f] is a κ-model in V[f] will be more involved than usual because, as Fκ is not κ-c.c., we cannot apply the generic closure criterion. Fixing β<κ, we will show that M[f]β⊆M[f] in V[f]. By density, there is an inaccessible cardinal α>β and a condition p=⟨{γ,δ}⟩∈G such that γ<α<δ. Below p, Fκ factors as Fγ×F(δ,κ) and f factors as fγ×f(δ,κ). Since Fγ clearly has the α-c.c., by the generic closure criterion, M[fγ]β⊆M[fγ] in V[fγ]. Also, since F(δ,κ) is {\mathrel{\mathchoice{\raise 2.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptstyle\leq}}{\raise 1.0pt\hbox{\scriptscriptstyle\leq}}{\scriptscriptstyle\leq}}}\alpha-closed, M[fγ]β⊆M[fγ] in V[f]. Finally, by the ground closure criterion, M[fγ][f(δ,κ)]β⊆M[fγ][f(δ,κ)] in V[f]. The same argument shows that N[f] is a κ-model in V[f], and therefore, N[f][f′] is a κ-model as well. To show that N[f] is Πn−11-correct, we argue essentially as in the proof of Theorem 3.7. The arguments in that proof go through noting only that VκV[f]=VκN[f]=Vκ[f] and Fκ⊆Vκ. Finally, the model N[f][f′] must also be Πn−11-correct because the tail forcing F[κ,j(κ)) does not add any subsets to Vκ[f] by closure.
∎
It is not difficult to see that once we have a fast function, we also get a weak Laver function [Ham02].
Lemma 6.2**.**
Suppose κ is Πn1-indescribable. In the generic extension V[f] by fast function forcing, there is a function ℓ\vbox...κ→Vκ satisfying the following property. For all A,B∈H(κ+)V[f], there are a κ-model M with ℓ,A,B∈M, a Πn−11-correct κ-model N and an elementary embedding j:M→N with critical point κ such that j(ℓ)(κ)=B and j,M∈N.
Proof.
Fix any bijection b:κ→Vκ in V. In V[f], define ℓ\vbox...κ→Vκ by letting ℓ(γ)=b(f(γ))f↾γ provided that
f↾γ is Fγ-generic over V and b(f(γ)) is an Fγ-name. By adapting the proof of Lemma 6.1, we verify
that ℓ has the desired properties as follows. Working in V[f], fix A,B∈H(κ+)V[f] and let ℓ˙,A˙,B˙ be nice Fκ-names for ℓ,A and B respectively. By Theorem 2.6 (4), there are a κ-model M with ℓ˙,A˙,B˙,Fκ,b∈M, a Πn−11-correct κ-model N and an elementary embedding j:M→N with critical point κ such that j,M∈N. Since Fκ is κ+-c.c., we can assume without loss of generality that B˙∈j(Vκ). By elementarity j(b):j(κ)→j(Vκ) is a bijection, and thus there is some ordinal α<j(κ) such that j(b)(α)=B˙. As in the proof of Lemma 6.1, we may lift j to j:M[f]→N[f][f′] such that j(f)(κ)=α. Now we have j(ℓ)(κ)=j(b)(j(f)(κ))j(f)↾κ=j(b)(α)f=B˙f=B. Now one may prove that M[f] is a κ-model and N[f][f′] is a Πn−11-correct κ-model exactly as in the proof of Lemma 6.1.
∎
Theorem 1.2.
Suppose κ is Π21-indescribable and GCH holds. Then there is a cofinality-preserving forcing extension V[G] in which
(1)
□1(κ)* holds,*
2. (2)
Refl1(κ)* holds and*
3. (3)
κ* is κ+-weakly compact.*
Proof.
By passing to an extension with a fast function, we can assume without loss of generality that there is a function ℓ\vbox...κ→Vκ such that for any A,B∈H(κ+) there are a κ-model M with ℓ,A,B∈M, a Π11-correct κ-model N and an elementary embedding j:M→N with critical point κ such that j(ℓ)(κ)=B.
Let ⟨Pα,Q˙β:α≤κ,β<κ⟩ be the Easton-support iteration defined as follows.
•
If α<κ is inaccessible and ℓ(α) is a Pα-name for an α-strategically closed, α+-c.c. forcing notion, then Q˙α=ℓ(α).
•
Otherwise, Q˙α is a Pα-name for trivial forcing.
Let G be generic for Pκ over V. In V[G], we define a 2-step iteration
[TABLE]
as follows.
•
Qκ,0 is the forcing to add a □1(κ)-sequence from Definition 5.1.
•
Q˙κ,2 is a Qκ,0-name for the forcing T(C(κ)) to thread the generic □1(κ)-sequence.
•
Q˙κ,1 is a Qκ,0-name for an iteration ⟨Rη,S˙ξ:η≤κ+,ξ<κ+⟩ with supports of size <κ defined as follows. For each η<κ+, a Qκ,0∗R˙η-name S˙η is chosen for a stationary subset of κ such that
[TABLE]
and then S˙η is a Qκ,0∗R˙η-name for the forcing T1(κ∖S˙η) to shoot a 1-club through the complement of S˙η.
Notice that Pκ is κ-c.c. and preserves GCH and, in V[G], the forcing Qκ is κ-strategically closed and κ+-c.c.. By standard chain condition arguments and bookkeeping, we can ensure that in VPκ∗Q˙κ,0∗Q˙κ,1, if S⊆κ is stationary and
[TABLE]
then there is already a 1-club in κ disjoint from S.
Let H=h0∗(h1×h2) be generic for Qκ over V[G]. Our desired model will be V[G∗h0∗h1]. We must show that in V[G∗h0∗h1], κ is κ+-weakly compact, Refl1(κ) holds and □1(κ) holds.
In order to show that κ is κ+-weakly compact in V[G∗h0∗h1], we will first prove the following.
Claim 6.3**.**
κ* is Π21-indescribable in V[G∗H].*
Proof.
Fix A∈P(κ)V[G∗H]. We must find a κ-model M with A∈M, a Π11-correct κ-model N and an elementary embedding j:M→N with critical point κ.
Let A˙∈V be a Pκ∗Q˙κ-name for A. Since Pκ∗Q˙κ,0∗(Q˙κ,1×Q˙κ,2) has the κ+-c.c., we can fix η<κ+ such that A˙ is a Pκ∗Q˙κ,0∗(R˙η×Q˙κ,2)-name. Moreover, we can assume that A˙, Pκ and Q˙κ,0∗(R˙η×Q˙κ,2) are in H(κ+). For η<κ+, let h1↾η be the generic for Rη induced by h1.
By Proposition 6.2, there are a κ-model M with ℓ,Pκ,A˙,Q˙κ,0∗(R˙η×Q˙κ,2)∈M, a Π11-correct κ-model N and an elementary embedding j:M→N with critical point κ such that j(ℓ)(κ)=Q˙κ,0∗(R˙η×Q˙κ,2) and j,M∈N. Without loss of generality we may additionally assume that M⊨∣η∣=κ since a bijection witnessing this can easily be placed into such a κ-model.
Notice that j(Pκ) is an Easton-support iteration in N of length j(κ) and
[TABLE]
by our choice of j(l)(κ).
By Theorem 3.7, N[G] is Π11-correct in V[G], and by Corollary 3.8, N[G∗h0∗(h1↾η×h2)] is Π11-correct in V[G∗h0∗(h1↾η×h2)]. Hence N[G∗h0∗(h1↾η×h2)] is Π11-correct in V[G∗h0∗(h1×h2)] by Corollary 3.4.
Since (P˙κ,j(κ))G∗h0∗(h1↾η×h2)=Pκ,j(κ) is κ-strategically closed inN[G∗h0∗(h1↾η×h2)] and since N[G∗h0∗(h1↾η×h2)] is a κ-model in V[G∗H], we can build a filter Gκ,j(κ)′ which is generic for Pκ,j(κ over N[G∗h0∗(h1↾η×h2)]. Since j↾G is the identity function, it follows that j"G⊆G^=defG∗h0∗(h1↾η×h2)∗Gκ,j(κ), and thus j lifts to j:M[G]→N[G^].
Let C=⟨Cα:α∈inacc(κ)⟩ be the generic □1(κ)-sequence added by h0, and let T be the thread added by h2⊆Qκ,2=T(C(κ)). By Lemma 5.5, T is a 1-club in N[G∗h0∗(h1↾η×h2)]. Let p0=C∪{(κ,T)}. Then p0∈N[G^] and p0∈j(Qκ,0). Moreover, p0≤j(Qκ,0)j(q) for all q∈h0. By the strategic closure of j(Qκ,0) and the fact that N[G^] is a κ-model in V[G∗H], we can build a filter p0∈h^0⊆j(Qκ,0) which is generic over N[G^]. Thus, j extends to j:M[G∗h0]→N[G^∗h^0].
Similarly, in N[G^∗h^0], the set p2=T∪{κ} is a condition in j(Qκ,2) and p2≤j(Qκ,2)j(q) for all q∈h2. Again, since j(Qκ,2) is κ-strategically closed in N[G^∗h^0], which is a κ-model in V[G∗H], we can build a filter p2∈h^2⊆j(Qκ,2) which is generic for j(Qκ,2) over N[G^∗h^0], and lift j to
[TABLE]
Now we lift the embedding through h1↾η. Let Rη=(R˙η)G∗h0. By elementarity, j(Rη) is an iteration of length j(η) with supports of size less than j(κ). For each ξ<η, S˙j(ξ)=j(S˙ξ) is, in N[G^∗h^0∗h^2], a j(Rξ)=Rj(ξ)-name for the forcing to shoot a 1-club disjoint from j(S˙ξ). For all ξ<η, let
[TABLE]
and note that Dξ is a 1-club subset of κ in N[G^∗h^0∗h^2] because the forcing after Rξ+1 is κ-strategically closed and therefore cannot affect Π11-truths by Lemma 3.3. Since h1↾η,j∈N[G^∗h^0∗h^2], we can define a function p∗∈N[G^∗h^0∗h^2] such that dom(p∗)=j"η by letting p∗(j(ξ)) be a j(Rξ)-name for Dξ∪{κ} for all ξ<η. In order to verify that p∗∈j(Rη), we must show that for all ξ<η, p∗↾j(ξ)⊩j(Rξ)p∗(j(ξ))∩j(S˙ξ)=∅.
Suppose this is not the case, and let ξ<η be the minimal counterexample. It follows that p∗↾j(ξ)∈j(Rξ) and, for all p∈h1↾ξ we have p∗↾j(ξ)≤j(p). By assumption,
[TABLE]
and thus we may let p∗∗≤j(Rξ)p∗↾j(ξ) be such that
[TABLE]
Since j(Rξ) is sufficiently strategically closed, we can build a filter h^1⊆j(Rξ) in V[G∗H] which is generic over N[G^∗h^0∗h^2] with p∗∗∈h^1 and lift to
[TABLE]
It follows that in N[G^∗h^0∗h^2∗h^1] we have (Dξ∪{κ})∩j(Sξ)=∅, where Sξ=(S˙ξ)h0↾ξ. Since j(Sξ)∩κ=Sξ, we know that Dξ∩j(Sξ)=∅, so it must be the case that κ∈j(Sξ). However, in M[G∗h0∗(h1↾ξ)], we have
[TABLE]
Therefore, we can fix such a 1-club E in M[G∗h0∗h2∗(h1↾ξ)]. Note that E is actually stationary because M[G∗h0∗h2∗(h1↾ξ)] is Π11-correct by Theorem 3.7 and Corollary 3.8. But then κ∈j(E) since in N[G^∗h^0∗h^2∗h^1], j(E) is 1-club in j(κ) and j(E)∩κ=E is stationary in κ. Thus κ∈j(E)∩j(Sξ)=∅, a contradiction.
Thus, p∗∈j(Rη) and we can build a filter p∗∈h^1 in V[G∗H] which is generic over N[G^∗h^0∗h^2]. This implies that the embedding lifts to
[TABLE]
As we argued above, N[G∗h0∗h2∗(h1↾η)] is Π11-correct in V[G∗H], and since the forcing
[TABLE]
is ≤κ-distributive, it follows that N[G^∗h^0∗h^2∗h^1] is Π11-correct in V[G∗H]. Since A=A˙G∗h0∗(h1↾η×h2)∈M[G∗h0∗h2∗(h1↾η)], this shows that κ is Π21-indescribable in V[G∗H].
∎
Now let us argue that κ is κ+-weakly compact in V[G∗h0∗h1]. Fix ζ<κ+. We must argue that Tr1ζ([κ])V[G∗h0∗h1]=[∅]. Since κ is Π21-indescribable in V[G∗h0∗(h1×h2)] by Claim 6.3, and since Qκ,2 is κ-strategically closed, it follows that Tr1ζ([κ])V[G∗h0∗(h1×h2)]=[S], where S∈V[G∗h0∗h1] is Π21-indescribable in V[G∗h0∗(h1×h2)]. It follows that S is weakly compact in V[G∗h0∗h1] by Proposition 3.5, and clearly Tr1ζ([κ])V[G∗h0∗h1]=[S]. Thus, κ is κ+-weakly compact in V[G∗h0∗h1].
We next argue that Refl1(κ) holds in V[G∗h0∗h1]. Fix a weakly compact set S⊆κ in V[G∗h0∗h1]. Since S intersects every 1-club in κ, our construction of Qκ,1 implies that there is p∈Qκ,2 such that
[TABLE]
Let g2⊆Qκ,2 be generic over V[G∗h0∗h1] with p∈g2. By the proof of Claim 6.3, κ is Π21-indescribable in V[G∗h0∗h1∗g2]. Therefore, in V[G∗h0∗h1∗g2], Refl1(κ) holds and S is a weakly compact subset of κ, and thus there is some α<κ such that S∩α is a weakly compact subset of α. But V[G∗h0∗h1∗g2] and V[G∗h0∗h1] have the same Vκ, so S∩α is a weakly compact subset of α in V[G∗h0∗h1]. Thus, Refl1(κ) holds in V[G∗h0∗h1].
Finally, we argue that □1(κ) holds in V[G∗h0∗h1]. The sequence
[TABLE]
is a □1(κ)-sequence in V[G∗h0] by Theorem 5.9 because we can show that Refl0(κ) holds by essentially the same argument as for Refl1(κ) above. Suppose that C is no longer a □1(κ)-sequence in V[G∗h0∗h1]. This implies that there is a condition p∈h1 such that in V[G∗h0],
p⊩Qκ,1 “there is a 1-club E˙⊆κˇ that threads Cˇ”.
Let g1 be generic for Qκ,1 over V[G∗h0∗h1] with p∈g1. In V[G∗h0∗(h1×g1)], let E=E˙h1 and E∗=E˙g1. By mutual genericity, we may fix α∈E∖E∗. A proof almost identical to that of Claim 6.3 shows that κ is Π21-indescribable in V[G∗h0∗(h1×g1×h2)] and hence weakly compact in V[G∗h0∗(h1×g1)]. Now, in V[G∗h0∗(h1×g1)], fix any j:M→N with critical point κ and E,E∗∈M. Since both are 1-clubs, κ∈j(E)∩j(E∗), and so by elementarity there is an inaccessible β∈κ∖(α+1) such that E∩β and E∗∩β are both stationary in β. But then, as they both thread C, it must be the case that E∩β=Cβ=E^∩β. This contradicts the fact that α∈E∖E∗ and finishes the proof of the theorem.
∎
Remark 6.4**.**
Observe that κ cannot be Π21-indescribable in V[G∗h0∗h1] because □1(κ) holds there. Thus, the set S, where Tr1ζ([κ])V[G∗h0∗h1]=[S], cannot be Π21-indescribable in V[G∗h0∗h1], which shows that Proposition 3.5 can fail for Π21-indescribable sets.
7. An application to simultaneous reflection
In this section we will show that the simultaneous reflection principle Refln(κ,2) is incompatible with □n(κ).
Theorem 7.1**.**
Suppose that 1≤n<ω, κ is Πn1-indescribable and □n(κ) holds. Then
there are two Πn1-indescribable subsets S0,S1⊆κ that do not
reflect simultaneously, i.e., there is no β<κ such that
S0∩β and S1∩β are both Πn1-indescribable subsets of β.
Proof.
Suppose for the sake of contradiction that every pair of Πn1-indescribable subsets
of κ reflects simultaneously. Already, Refln(κ) implies that κ is ω-Πn1-indescribable (see [Cod19]),
so the set E={α<κ:Refln−1(α)\mboxholds} is a Πn1-indescribable subset of κ because the set of Πn1-indescribable cardinals below κ is Πn1-indescribable and (n−1)-reflection holds at each of them.
Let C=⟨Cα:α∈Trn−1(κ)⟩ be a □n(κ)-sequence. For all
α∈Trn−1(κ), let
[TABLE]
Let A={α∈Trn−1(κ):Sα0∈Πn1(κ)+}.
Claim 7.2**.**
A* is Πn1-indescribable in κ.*
Proof.
Fix an n-club C⊆κ. Since Trn−1(C) is an n-club in κ, it follows that E∩Trn−1(C) is Πn1-indescribable in κ. For each β∈E∩Trn−1(C), Refln−1(β) holds and Cβ∩C is a Πn−11-indescribable subset of β. Thus, for β∈E∩Trn−1(C), we may let αβ be the least Πn−11-indescribable cardinal such that Cβ∩C∩αβ is Πn−11-indescribable in αβ. Notice that αβ∈C for all β∈E∩Trn−1(C) because C is an n-club. Since the map β↦αβ is regressive on E∩Trn−1(C), it follows by the normality of Πn1(κ) that there is a fixed α∈C and a Πn1-indescribable set T⊆E∩Trn−1(C) such that αβ=α for all β∈T. This implies that T⊆Sα0, and thus α∈A∩C.
∎
Claim 7.3**.**
There is α∈A such that Sα1 is a Πn1-indescribable subset of κ.
Proof.
Suppose not, and let α0<α1 be elements of A. Since E is Πn1-indescribable in κ and Sα01
and Sα11 are both in the Πn1-indescribability ideal on κ, we can find
β∈E∖((α1+1)∪Sα01∪Sα11).
It follows that β∈Sα00∩Sα10, so, by the coherence
properties of the □n(κ)-sequence, we have Cβ∩α0=Cα0 and Cβ∩α1=Cα1, and hence
Cα1∩α0=Cα0. But then by Lemma 2.7 and Claim 7.2, we see that ⋃α∈ACα is a Πn1-indescribable subset of κ. Thus,
⋃α∈ACα is a thread through C, which is a contradiction.
∎
We can therefore fix α∈Trn−1(κ) such that both Sα0 and Sα1
are Πn1-indescribable subsets of κ. Let S0=Sα0 and S1=Sα1.
We claim that S0 and S1 cannot reflect simultaneously. Otherwise, there is
γ such that S0∩γ and S1∩γ are both Πn1-indescribable
subsets of γ. Consider the n-club Cγ. Since γ is Πn1-indescribable,
Trn−1(Cγ) is also an n-club in γ. We can therefore find β0<β1
in Trn−1(Cγ) such that β0∈S0 and β1∈S1.
But note that Cβ0=Cγ∩β0 and Cβ1=Cγ∩β1, so Cβ0=Cβ1∩β0, contradicting the fact
that Cβ0∩α is Πn−11-indescribable in α whereas
Cβ1∩α is not Πn−11-indescribable in α.
∎
As a direct consequence of Theorem 1.2 and Theorem 7.1 we obtain the following.
Corollary 7.4**.**
Suppose κ is Π21-indescribable. Then there is a forcing extension in which Refl1(κ) and ¬Refl1(κ,2) both hold.
8. Questions
The theorems proved in this article about the principle □1(κ) do not easily generalize to □n(κ) because several key technical results about Π11-indescribability which we used crucially in the proofs no longer hold for higher orders of indescribability. For example, given an embedding j:M→N, where N is Πn1-correct, we cannot necessarily use a generic G for a poset P∈N from the ground model to lift j because N[G] may no longer be Πn1-correct. An illustration of this is given in Remark 5.7. Also, while κ-strategically closed forcing cannot make a subset of κΠ11-indescribable if it was not so already in the ground model by Proposition 3.5, a set can become Π21-indescribable after κ-strategically closed forcing by Remark 6.4.
Question 8.1**.**
For n>1, can we force from a strong enough large cardinal that κ is Πn1-indescribable and □n(κ) holds nontrivially?
Question 8.2**.**
Relative to large cardinals, for n>1, is it consistent that Refln(κ) and □n(κ) both hold?
Question 8.3**.**
Relative to large cardinals, is it consistent that Refl1(κ,2) + ¬Refl1(κ,3)?
Question 8.4**.**
Can we force any indestructibility of Refl1(κ)?
Question 8.5**.**
For 1≤n<ω, if κ is Πn1-indescribable, does our principle □n(κ) imply the Brickhill-Welch principle □n(κ)? See Remark 2.3 for a discussion of □n(κ).
Bibliography17
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BMS 15] Joan Bagaria, Menachem Magidor, and Hiroshi Sakai. Reflection and indescribability in the constructible universe. Israel J. Math. , 208(1):1–11, 2015.
2[BW] Hazel Brickhill and Philip D. Welch. Generalisations of stationarity, closed and unboundedness and of Jensen’s □ □ \Box . ( preprint ).
3[Cod 19] Brent Cody. Adding a Nonreflecting Weakly Compact Set. Notre Dame J. Form. Log. , 60(3):503–521, 2019.
4[CS 20] Brent Cody and Hiroshi Sakai. The weakly compact reflection principle need not imply a high order of weak compactness. Arch. Math. Logic , 59(1-2):179–196, 2020.
5[Cum 10] James Cummings. Iterated forcing and elementary embeddings. In Handbook of set theory. Vols. 1, 2, 3 , pages 775–883. Springer, Dordrecht, 2010.
6[Ham 02] Joel David Hamkins. A class of strong diamond principles. Unpublished manuscript, 2002.
7[Hel 03a] Alex Hellsten. Diamonds on large cardinals. Ann. Acad. Sci. Fenn. Math. Diss. , (134):48, 2003. Dissertation, University of Helsinki, Helsinki, 2003.
8[Hel 03b] Alex Hellsten. Diamonds on large cardinals . Pro Quest LLC, Ann Arbor, MI, 2003. Thesis (Ph.D.)–Helsingin Yliopisto (Finland).