alphaFeedback

You’re reading v1 — jump to latest

WorksMathematics

On a problem of Erdos and Hajnal

AI contributions
Not recorded for this paper
View details

Abstract

We address a question of Erdős and Hajnal about the ordinary partition relation ℵω+1↛(ℵω+1,(3)ℵ0)2\aleph_{ω+1}\nrightarrow(\aleph_{ω+1},(3)_{\aleph_0})^2. For θ=cf(λ)<λθ=\mathrm{cf}(λ)<λ, assuming 2λ=λ+2^λ=λ^+ they proved the negative relation λ+↛(λ+,(3)θ)2λ^+\nrightarrow(λ^+,(3)_θ)^2 and asked whether the (local instance of) GCH is indispensable. We show that this negative relation is consistent with λλ being a strong limit and 2λ>λ+2^λ>λ^+. The result can be pushed down to ℵω\aleph_ω.

2010 Mathematics Subject Classification. 03E02, 03E04, 03E55.

Key words and phrases. Infinite combinatorics, GCH, stick, tiltan, singular cardinals hypothesis, pcf theory.

The research was supported by Israel Science Foundation Grant no. 1838/19 and Grant no. 2320/23. This is publication 1249 (the 204th prime number) of the third author, publication 47 (the 15th prime number) of the first author and publication 37 (the 12th prime number) of the second author.

Introduction

Let G=(V,E)G=(V,E) be a graph of size λ\lambda. One may wonder whether there must be a monochromatic triangle under any edge coloring c:E→θc:E\to\theta. The answer is trivially no, since the graph can be a set of isolated vertices with no edges at all, or a triangle-free graph. Thus in order to make the above question interesting, one should assume that there are many edges (and, in particular, many triangles) in the graph. One possible way to do it uses the following concept. A set of vertices W⊆VW\subseteq V is called independent if [W]2∩E=∅[W]^2\cap E=\varnothing. If GG is of size λ\lambda and there are no independent subsets of size λ\lambda in GG, then there are many edges in the graph and the question makes more sense.

The above discussion can be formulated in the language of partition calculus, without mentioning graphs at all. The ordinary partition relation λ→(κ,(3)θ)2\lambda\to(\kappa,(3)_\theta)^2 says that for every coloring c:[λ]2→θc:[\lambda]^2\to\theta there is either A∈[λ]κA\in[\lambda]^\kappa so that c′′[A]2={0}c''[A]^2=\{0\}, or B∈[λ]3B\in[\lambda]^3 and γ∈(0,θ)\gamma\in(0,\theta) so that c′′[B]2={γ}c''[B]^2=\{\gamma\}. A particular interesting case is when κ=λ\kappa=\lambda. In terms of graph theory, one can interpret the coloring as assigning zero to pairs of vertices with no edge, and some color γ∈(0,θ)\gamma\in(0,\theta) to edges of a given graph. The positive relation λ→(λ,(3)θ)2\lambda\to(\lambda,(3)_\theta)^2 means that either there is an independent set of size λ\lambda, or a monochromatic triangle.

Erdős, Hajnal and Rado investigated this relation in [8]. They established several results, and focused in particular on graphs whose size is a successor of a singular cardinal. A good account appears in the monograph [7], in which the following is phrased and proved:

Theorem 0.1. Assume that λ\lambda is a singular cardinal and 2λ=λ+2^\lambda=\lambda^+. Then λ+↛(λ+,(3)cf⁡(λ))2\lambda^+\nrightarrow(\lambda^+,(3)_{\operatorname{cf}(\lambda)})^2.

Actually, they proved something a bit stronger, see [7], Theorem 20.2. A natural question is whether the assumption 2λ=λ+2^\lambda=\lambda^+ is removable. Let us indicate that if one forces 2cf⁡(λ)≥λ+2^{\operatorname{cf}(\lambda)}\geq\lambda^+ then a negative result obtains, as mentioned in [7]. Thus we shall assume from now on that 2cf⁡(λ)<λ2^{\operatorname{cf}(\lambda)}<\lambda, and in fact we shall force the negative relation while λ\lambda is a strong limit singular cardinal. The first case, in this context, is λ=ℵω\lambda=\aleph_\omega. In a collection of unsolved problems [6], Problem 5, the pertinent question appears as follows:

Question 0.2. Can one prove without assuming GCH that the relation ℵω+1↛(ℵω+1,(3)ℵ0)2\aleph_{\omega+1}\nrightarrow(\aleph_{\omega+1},(3)_{\aleph_0})^2 holds?

It appeared, again, in [7], Problem 20.1.1 Despite the fact that powerful methods for dealing with successors of singular cardinals are available today, the problem is still open. A recent survey by Komjáth, [15], describes the progress in every problem from the list of Erdős and Hajnal, and according to this survey no progress has been made with regard to this problem. In this paper we intend to show that λ+↛(λ+,(3)cf⁡(λ))2\lambda^+ \nrightarrow(\lambda^+,(3)_{\operatorname{cf}(\lambda)})^2 is consistent with 2λ>λ+2^\lambda> \lambda^+, where λ\lambda is singular and strong limit.

Our strategy is to replace the hypothesis 2λ=λ+2^\lambda=\lambda^+ by pcf arguments. More specifically, we obtain unbounded sequences of regular cardinals below λ\lambda that satisfy some relevant negative arrow relation, and we make sure that the true cofinality of these sequences is λ+\lambda^+. These assumptions enable us to lift the negative relations below λ\lambda to λ+\lambda^+, even if 2λ>λ+2^\lambda>\lambda^+.

This approach is rendered here twice. Firstly, we get the negative arrow relation λi+↛(λi+,(3)cf⁡(λi))2\lambda_i^+ \nrightarrow(\lambda_i^+,(3)_{\operatorname{cf}(\lambda_i)})^2 where each λi\lambda_i is a successor of a singular cardinal, simply by assuming GCH below λ\lambda, and then we lift this relation to λ+\lambda^+. The drawback here is that λ\lambda must be a limit of singular cardinals with the same cofinality. Thus ℵω\aleph_\omega cannot be handled in this way. Secondly, we modify the negative arrow relation over each λi\lambda_i in such a way that it applies to regular cardinals even though these cardinals are not successors of singular cardinals. This strategy applies to small cardinals like the ℵn\aleph_ns, and consequently the negative arrow relation can be forced over ℵω\aleph_\omega.

There is another possible approach towards the same negative arrow relation. This approach is based on prediction principles from the tiltan family. Suppose that diamond holds at λ+\lambda^+, in which case 2λ=λ+2^\lambda=\lambda^+. In many cases, diamond can be replaced by weaker prediction principles like tiltan or stick. Usually, these principles at λ+\lambda^+ are consistent with 2λ>λ+2^\lambda>\lambda^+. We shall prove that ♣(λ)\clubsuit(\lambda) yields the negative arrow relation λ+↛(λ+,(3)cf⁡(λ))2\lambda^+ \nrightarrow(\lambda^+,(3)_{\operatorname{cf}(\lambda)})^2. However, we do not know whether ♣(λ)\clubsuit(\lambda) is consistent with 2λ>λ+2^\lambda>\lambda^+ when λ\lambda is a strong limit singular cardinal. Recall that in ♣(λ)\clubsuit(\lambda) the size of the guessing sets is λ\lambda, and this is the main problematic issue in our context. This point will be discussed in the relevant section.

The rest of the paper contains three additional sections. In the first section we solve the general problem using simple arguments of pcf theory. As mentioned above, this solution does not cover the case of ℵω\aleph_\omega. In the second section we modify the pcf arguments and show how to push down the result to ℵω\aleph_\omega. Finally, in the third section we show that a special version of stick at λ+\lambda^+ yields the desired negative arrow relation.

Our notation is coherent with [7]. We shall use the Jerusalem forcing notation, namely we force upwards. A function f:E→P(E)f:E\to\mathcal{P}(E) is a set mapping if x∉f(x)x\notin f(x) whenever x∈Ex\in E. A subset X⊆EX\subseteq E is free for ff iff f(y)∩X=∅f(y)\cap X=\varnothing whenever y∈Xy\in X. If κ=cf⁡(κ)<λ\kappa=\operatorname{cf}(\kappa)<\lambda then we let Sλκ={δ∈λ∣cf⁡(δ)=κ}S^\kappa_\lambda=\{\delta\in\lambda\mid\operatorname{cf}(\delta)=\kappa\}. If ℵ0<cf⁡(λ)\aleph_0<\operatorname{cf}(\lambda) then SλκS^{\kappa}_\lambda is a stationary subset of λ\lambda.

We shall use the idea of indestructibility (at supercompact cardinals) as appeared in the seminal work of Laver, [16]. It is shown there that a supercompact cardinal κ\kappa can be made indestructible under any generic extension by κ\kappa-directed-closed forcing notions. In our context, we need a modification of Laver’s proof, applicable to strategically-closed forcing notions. This version will be phrased and proved below. For basic background concerning Prikry type forcings we refer to [11], and to the papers of Magidor [17] and [18] in which the basic method of Prikry forcing with interleaved collapses was introduced. We also refer to [13] in this context. For background in pcf theory we suggest [1], [4] and [21].

A negative relation from simple pcf arguments

In this section we suggest our first approach for proving the negative relation λ+↛(λ+,(3)cf⁡(λ))2\lambda^{+} \nrightarrow(\lambda^{+},(3)_{\operatorname{cf}(\lambda)})^{2} where λ\lambda is a strong limit singular cardinal and 2λ>λ+2^{\lambda} > \lambda^{+}. The idea is to assume the negative relation at an unbounded sequence of cardinals below λ\lambda (by assuming GCH at these cardinals) and to obtain the negative relation at λ+\lambda^{+} by means of pcf theory. Recall that tcf⁡(∏i∈θλi,J)=κ\operatorname{tcf}(\prod_{i\in\theta}\lambda_i,J)=\kappa iff there is a JJ-cofinal and increasing sequence in the product ∏i∈θλi\prod_{i\in\theta}\lambda_i, and κ\kappa is the minimal length of such a sequence. We commence with the combinatorial theorem, followed by a description of the ways to force the assumptions in this theorem.

Theorem 1.1. Assume that:

(a) μ>cf⁡(μ)=θ\mu> \operatorname{cf}(\mu)=\theta.

(b) μ\mu is a strong limit cardinal.

(c) 2μ>μ+2^{\mu} > \mu^{+}.

(d) (μi∣i∈θ)(\mu_i\mid i\in\theta) is increasing and μ=⋃i∈θμi\mu=\bigcup_{i\in\theta}\mu_i.

(e) μi>cf⁡(μi)=θ\mu_i > \operatorname{cf}(\mu_i)=\theta for every i∈θi\in\theta.

(f) μi\mu_i is a strong limit cardinal for every i∈θi\in\theta.

(g) 2μi=μi+2^{\mu_i}=\mu_i^{+} for every i∈θi\in\theta.

(h) tcf⁡(∏i∈θμi+,Jθbd⁡)=μ+\operatorname{tcf}(\prod_{i\in\theta}\mu_i^{+},J_{\theta}^{\operatorname{bd}})=\mu^{+}.

Then μ+↛(μ+,(3)cf⁡(μ))2\mu^{+}\nrightarrow(\mu^{+},(3)_{\operatorname{cf}(\mu)})^{2}.

Proof.

For every i∈θi\in\theta let ci:[μi+]2→θc_i:[\mu_i^{+}]^{2}\to\theta be a witness to the negative relation μi+↛(μi+,(3)θ)2\mu_i^{+}\nrightarrow(\mu_i^{+},(3)_{\theta})^{2}. This negative relation follows from assumption (g). Our goal is to define a coloring c:[μ+]2→θc:[\mu^{+}]^{2}\to\theta by combining the cic_is together in such a way that the corresponding negative relation at μ+\mu^{+} will follow.

We need two mathematical objects to define our coloring. The first is a scale (fα∣α∈μ+)(f_{\alpha}\mid\alpha\in\mu^{+}) in the product (∏i∈θμi+,Jθbd⁡)(\prod_{i\in\theta}\mu_i^{+},J_{\theta}^{\operatorname{bd}}). The second is a system of functions (hi∣i∈θ)(h_i\mid i\in\theta) where hi∈θθh_i\in{}^{\theta}\theta is injective and hi(0)=0h_i(0)=0 for each i∈θi\in\theta. Also, if i<j<θi<j<\theta then rang⁡(hi)∩rang⁡(hj)={0}\operatorname{rang}(h_i)\cap\operatorname{rang}(h_j)=\{0\}. Suppose that α<β<μ+\alpha<\beta<\mu^{+}. Let i=i(α,β)i=i(\alpha,\beta) be the minimal j∈θj\in\theta so that fα(j)≠fβ(j)f_{\alpha}(j)\ne f_{\beta}(j). Such an ordinal always exists since fα<Jθbd⁡fβf_{\alpha}<_{J_{\theta}^{\operatorname{bd}}}f_{\beta}. We define the coloring c:[μ+]2→θc:[\mu^{+}]^{2}\to\theta as follows. Given α<β<μ+\alpha<\beta<\mu^{+} let i=i(α,β)i=i(\alpha,\beta) and let c(α,β)=hi(ci({fα(i),fβ(i)}))c(\alpha,\beta)=h_i(c_i(\{f_{\alpha}(i),f_{\beta}(i)\})).2 Let us show that cc exemplifies the negative relation μ+↛(μ+,(3)cf⁡(μ))2\mu^{+}\nrightarrow(\mu^{+},(3)_{\operatorname{cf}(\mu)})^{2}.

(ℵ) Assume that A∈[μ+]μ+A\in[\mu^{+}]^{\mu^{+}}. For every i∈θi\in\theta let Ai={fα(i)∣α∈A}A_i=\{f_{\alpha}(i)\mid\alpha\in A\}. Set X={i∈θ∣μi+=⋃Ai}X=\{i\in\theta\mid\mu_i^{+}=\bigcup A_i\}, and notice that X=θ mod Jθbd⁡X=\theta\bmod J_{\theta}^{\operatorname{bd}}. Fix i∈Xi\in X. For every ε∈μi+\varepsilon\in\mu_i^{+} we choose αε∈A\alpha_{\varepsilon}\in A such that fαε(i)≥εf_{\alpha_{\varepsilon}}(i)\ge\varepsilon. Since ∣∏j∈iμj+∣<μi+\left|\prod_{j\in i}\mu_j^{+}\right|<\mu_i^{+} (this inequality follows from (f)), there are a set Bi∈[μi+]μi+B_i\in[\mu_i^{+}]^{\mu_i^{+}} and a fixed element g∈∏j∈iμj+g\in\prod_{j\in i}\mu_j^{+} such that if ε<ζ\varepsilon<\zeta are taken from BiB_i then αε<αζ\alpha_{\varepsilon}<\alpha_{\zeta} and fαε↾i=gf_{\alpha_{\varepsilon}}\mathbin{\upharpoonright}i=g for every ε∈Bi\varepsilon\in B_i. Since cic_i witnesses the negative relation μi+↛(μi+,(3)θ)2\mu_i^+ \nrightarrow(\mu_i^+,(3)^\theta)^2, one can choose ε,ζ∈Bi\varepsilon,\zeta\in B_i such that ε<ζ\varepsilon< \zeta and ci(ε,ζ)≠0c_i(\varepsilon,\zeta) \ne0. But then c(αε,αζ)≠0c(\alpha_\varepsilon,\alpha_\zeta) \ne0, so the proof of the first case is accomplished.

(□) Assume that α<β<γ<μ+\alpha< \beta< \gamma< \mu^+. If i(α,β)≠i(α,γ)i(\alpha,\beta) \ne i(\alpha,\gamma) or i(α,β)≠i(β,γ)i(\alpha,\beta) \ne i(\beta,\gamma) or i(α,γ)≠i(β,γ)i(\alpha,\gamma) \ne i(\beta,\gamma) then {α,β,γ}\{\alpha,\beta,\gamma\} cannot be cc-monochromatic with any color ξ>0\xi> 0 since for i≠ji \ne j one has rang⁡(hi)∩rang⁡(hj)={0}\operatorname{rang}(h_i) \cap\operatorname{rang}(h_j) = \{0\} and by the definition of cc. If i(α,β)=i(α,γ)=i(β,γ)=ii(\alpha,\beta) = i(\alpha,\gamma) = i(\beta,\gamma) = i then c↾[{α,β,γ}]2={ξ}c \mathbin{\upharpoonright} [\{\alpha,\beta,\gamma\}]^2 = \{\xi\} with ξ>0\xi> 0 implies ci↾[{fα(i),fβ(i),fγ(i)}]2={ξ}c_i \mathbin{\upharpoonright} [\{f_\alpha(i),f_\beta(i),f_\gamma(i)\}]^2 = \{\xi\}, since hih_i is injective. But this is impossible by the choice of cic_i, so we are done.

A corollary to the above theorem gives an answer to the question of Erdős and Hajnal. Within the proof of this corollary we force with Qμˉ\mathbb{Q}_{\bar{\mu}} from [12] Definition 2.3. For being self-contained, we unfold the definition of this forcing notion.

Let μ\mu be supercompact, and let μˉ=(μi∣i∈μ)\bar{\mu} = (\mu_i \mid i \in\mu) be an increasing sequence of regular cardinals so that 2∣i∣<μi2^{|i|} < \mu_i for every i∈μi \in\mu. A condition p∈Qμˉp \in\mathbb{Q}_{\bar{\mu}} is a pair (η,f)=(ηp,fp)(\eta,f) = (\eta^p,f^p) such that lg⁡(η)∈μ\operatorname{lg}(\eta) \in\mu and η∈∏i∈lg⁡(η)μi\eta\in\prod_{i \in\operatorname{lg}(\eta)} \mu_i. We refer to η\eta as the stem of pp. Also, f∈∏i∈μμif \in\prod_{i \in\mu} \mu_i and η◃f\eta\triangleleft f. If p,q∈Qμˉp,q \in\mathbb{Q}_{\bar{\mu}} then p≤qp \leq q iff ηp⊇ηq\eta^p \mathbin{\supseteq} \eta^q and fp(j)≤fq(j)f^p(j) \leq f^q(j) for every j∈μj \in\mu.

Intuitively, Qμˉ\mathbb{Q}_{\bar{\mu}} adds a function h∈∏i∈μμih \in\prod_{i \in\mu}\mu_i which dominates every old function in this product. If 2μ=μ+2^\mu= \mu^+ in the ground model then Qμˉ\mathbb{Q}_{\bar{\mu}} is μ+\mu^+-cc. Also, Qμˉ\mathbb{Q}_{\bar{\mu}} is (<μ)(<\mu)-strategically-closed. Hence one can iterate Qμˉ\mathbb{Q}_{\bar{\mu}} and preserve cardinals. If θ=cf⁡(θ)>μ\theta= \operatorname{cf}(\theta) > \mu is the length of the iteration then the generic functions added at each step form a scale. Moreover, upon singularizing μ\mu either by Prikry or by Magidor forcing one preserves the properties of this scale, thus forcing tcf⁡(∏i∈cf⁡(μ)μi,Jcf⁡(μ)bd)=θ\operatorname{tcf}(\prod_{i \in\operatorname{cf}(\mu)}\mu_i,J^{\mathrm{bd}}_{\operatorname{cf}(\mu)}) = \theta in the generic extension.

Corollary 1.2. Assuming the existence of large cardinals in the ground model, one can force μ+↛(μ+,(3)cf⁡(μ))2\mu^+ \nrightarrow(\mu^+,(3)_{\operatorname{cf}(\mu)})^2 with 2μ>μ+2^\mu> \mu^+ and μ\mu is a strong limit cardinal.

Proof. Our goal is to force the assumptions of Theorem 1.1. Let μ\mu be a supercompact cardinal and fix a regular cardinal ℵ0≤θ∈μ\aleph_0 \leq\theta\in\mu. We may assume that μ\mu is Laver-indestructible, and GCH holds above μ\mu. Let (μi∣i∈μ)(\mu_i \mid i \in\mu) be an increasing sequence of singular cardinals so that cf⁡(μi)=θ\operatorname{cf}(\mu_i) = \theta for every i∈μi \in\mu and μ=⋃i∈μμi\mu= \bigcup_{i \in\mu}\mu_i. We may assume that 2μi=μi+<μi+12^{\mu_i} = \mu_i^+ < \mu_{i+1} for every i∈μi \in\mu.

We force with Qμˉ\mathbb{Q}_{\bar{\mu}} followed by Magidor forcing to make θ=cf⁡(μ)\theta= \operatorname{cf}(\mu) to obtain the assumption tcf⁡(∏i∈θμi+,Jθbd)=μ+\operatorname{tcf}(\prod_{i \in\theta}\mu_i^+,J^{\mathrm{bd}}_\theta) = \mu^+. If θ=ℵ0\theta= \aleph_0 then one can simply use Prikry forcing. Thus, the length of the iteration should be an ordinal of cofinality μ+\mu^+. We increase 2μ2^\mu to any desired point (this can be done by choosing the length of the iteration to be in the desired cardinality). Notice that 2μi=μi+2^{\mu_i} = \mu_i^+ remains true, as Qμˉ\mathbb{Q}_{\bar{\mu}} is χ\chi-strategically-closed for every χ∈μ\chi\in\mu and the component of Prikry or Magidor forcing also preserves this fact. Thus the assumptions of Theorem 1.1 hold in the generic extension, and the corollary follows.

It seems that the above method cannot be applied to ℵω\aleph_\omega. The main point is that our singular cardinal μ\mu of cofinality θ\theta should be a limit of singular cardinals with the same cofinality. Thus, the negative colorings along the way are always with the same number of colors (namely, θ\theta) and hence one can produce a coloring over the cardinal μ+\mu^+ with θ\theta-many colors. Since there are no singular cardinals below ℵω\aleph_\omega at all, the above proof is inapplicable as it is to this case. However, ℵω2\aleph_{\omega_2} seems suitable for this pattern of proof. Indeed, the cofinality of ℵω2\aleph_{\omega_2} is ω\omega and it is a limit of singular cardinals of countable cofinality.

Theorem 1.3. Assuming the existence of large cardinals in the ground model, one can force μ+→(μ+,(3)cf⁡(μ))2\mu^+ \to(\mu^+,(3)_{\operatorname{cf}(\mu)})^2 with 2μ>μ+2^\mu> \mu^+ and μ\mu is a strong limit cardinal, where μ=ℵω2\mu=\aleph_{\omega_2}.

Proof. Let μ\mu be a strong cardinal and let λ≥μ++\lambda\ge\mu^{++} be a regular cardinal. Let EE be a (μ,λ)(\mu,\lambda)-extender and let j:V→M≅Ult⁡(V,E)j:V\to M\cong\operatorname{Ult}(V,E) be the canonical embedding, where M⊇Vμ++M\supseteq V_{\mu^{++}}. We assume GCH in the ground model. In order to force the above statement at μ\mu we use the Extender-based Prikry forcing, and in order to obtain the negative relation at μ=ℵω2\mu=\aleph_{\omega_2} we use the same forcing with interleaved collapses.

Let GG be VV-generic for this forcing notion. Notice that μ\mu is a strong limit cardinal in V[G]V[G], and 2μ=μ++2^\mu=\mu^{++}. Likewise, μ\mu is a singular cardinal of countable cofinality in the generic extension, and GCH still holds below μ\mu in V[G]V[G]. We can add the collapses to make μ=ℵω2\mu=\aleph_{\omega_2} in V[G]V[G].

Let (ρn∣n∈ω)(\rho_n\mid n\in\omega) be the Prikry forcing added through the (unique) normal ultrafilter of EE. It is known that tcf⁡(∏n∈ωμn+,Jωbd)=μ++\operatorname{tcf}(\prod_{n\in\omega}\mu_n^+,J_\omega^{\mathrm{bd}})=\mu^{++} in the generic extension. Moreover, up to a modification of a proper initial segment, this is the only sequence with true cofinality μ++\mu^{++} in this product. Hence, if (μn∣n∈ω)(\mu_n\mid n\in\omega) is an increasing sequence of singular cardinals with countable cofinality such that μ=⋃n∈ωμn\mu=\bigcup_{n\in\omega}\mu_n then tcf⁡(∏n∈ωμn+,Jωbd)=μ+\operatorname{tcf}(\prod_{n\in\omega}\mu_n^+,J_\omega^{\mathrm{bd}})=\mu^+ in V[G]V[G]. For these facts we refer to [13]. We see that all the assumptions of Theorem 1.1 hold, and therefore μ+→(μ+,(3)cf⁡(μ))2\mu^+\to(\mu^+,(3)_{\operatorname{cf}(\mu)})^2. In the setting of the Extender-based Prikry forcing with interleaved collapses we can make μ=ℵω2\mu=\aleph_{\omega_2} in V[G]V[G]. This is the first infinite cardinal which can be represented as a limit of a sequence (μn∣n∈ω)(\mu_n\mid n\in\omega) as above, so the proof is accomplished.

We conclude with a couple of open problems. Maybe the most interesting problem which issues from our study is whether the negative relation holds in ZFC. We believe that the positive relation λ+→(λ+,(3)cf⁡(λ))2\lambda^+\to(\lambda^+,(3)_{\operatorname{cf}(\lambda)})^2 is consistent, but we do not know how to prove this:

Question 1.4. Is it consistent that λ\lambda is a strong limit singular cardinal and λ+→(λ+,(3)cf⁡(λ))2\lambda^+\to(\lambda^+,(3)_{\operatorname{cf}(\lambda)})^2? Is it forceable at λ=ℵω\lambda=\aleph_\omega?

It follows from the proofs in this section that a positive answer to the above question must be forced by adding a lot of bounded subsets to λ\lambda. In any attempt to force a positive relation one has to eliminate GCH at every unbounded sequence of cardinals in λ\lambda whose true cofinality is λ+\lambda^{+}.

More pcf and the case of ℵω\aleph_{\omega}

In this section we prove that the negative relation λ+↛(λ+,(3)cf⁡(λ))2\lambda^{+} \nrightarrow(\lambda^{+},(3)_{\operatorname{cf}(\lambda)})^{2} is consistent with λ\lambda being a strong limit singular cardinal and 2λ>λ+2^{\lambda} > \lambda^{+} even if λ\lambda is not a limit of singular cardinals. In particular, this setting is forceable at λ=ℵω\lambda= \aleph_{\omega}.

The basic idea is similar to that of the proof of Theorem 1.1 in the previous section. Namely, from negative arrow relations on a sequence of cardinals below λ\lambda one obtains the negative arrow relation at λ+\lambda^{+}, provided that the true cofinality of the sequence is λ+\lambda^{+}. Thus, pcf theory enables us to lift combinatorial properties below λ\lambda to λ+\lambda^{+}. However, in order to incorporate ℵω\aleph_{\omega} into this framework one has to prove relevant statements about regular cardinals (e.g., the ℵn\aleph_ns). For those cardinals we refine the negative partition relation to a weaker negative partition relation, relative to certain filters. Using an appropriate pcf structure that respects those filters, we will obtain the parallel of Theorem 1.1.

So, first we deal with obtaining those weaker instances of the negative partition relation from local instances of the generalized continuum hypothesis. This is the content of the first proposition of this section.

Claim 2.1. Assume that κ<λ\kappa< \lambda are regular cardinals and λ=λ<κ\lambda= \lambda^{<\kappa}. Then there exists a pair (c,D)(c,\mathcal{D}) such that:

(a) c:[λ]2→{0,1}c : [\lambda]^2 \to\{0,1\}.

(b) D\mathcal{D} is a κ\kappa-complete (proper) filter over λ\lambda.

(c) If A⊆λA \subseteq\lambda and c↾[A]2c \restriction[A]^2 is constantly zero then A=∅ mod DA = \varnothing\bmod\mathcal{D}.

(d) If B={α,β,γ}∈[λ]3B = \{\alpha,\beta,\gamma\} \in[\lambda]^3 then 0∈c′′[B]20 \in c^{\prime\prime}[B]^2.

Proof. Enumerate the elements of [λ]<κ[\lambda]^{<\kappa} by (uξ∣ξ∈λ)(u_{\xi} \mid\xi\in\lambda), where u0=∅u_0 = \varnothing and each u∈[λ]<κu \in[\lambda]^{<\kappa} appears λ\lambda-many times in the enumeration. We shall define cc as ⋃α∈λcα\bigcup_{\alpha\in\lambda} c_{\alpha}, so we define cαc_{\alpha} and an ordinal ξα\xi_{\alpha} by induction on α∈λ\alpha\in\lambda as follows. For α=0\alpha= 0 let cα=∅c_{\alpha} = \varnothing and if 0<α0 < \alpha is a limit ordinal then cα=⋃{cβ:β∈α}c_{\alpha} = \bigcup\{c_{\beta} : \beta\in\alpha\}.

If α=β+1\alpha= \beta+ 1 then we define cαc_{\alpha} and ξβ\xi_{\beta} (so ξβ\xi_{\beta} is picked at the (β+1)(\beta+ 1)th stage). Let ξβ\xi_{\beta} be the minimal ξ∈λ\xi\in\lambda so that ξ∉{ξγ∣γ∈β}∪{0}\xi\notin\{\xi_{\gamma} \mid\gamma\in\beta\} \cup\{0\} and cβ↾[uξ]2c_{\beta} \restriction[u_{\xi}]^2 is constantly zero, if there is such an ordinal. If not, let ξβ=0\xi_{\beta} = 0. Now if η<ζ<β\eta< \zeta< \beta then let cα({η,ζ})=cβ({η,ζ})c_{\alpha}(\{\eta,\zeta\}) = c_{\beta}(\{\eta,\zeta\}). For every γ∈β\gamma\in\beta let cα({γ,β})=1c_{\alpha}(\{\gamma,\beta\}) = 1 if γ∈uξβ\gamma\in u_{\xi_{\beta}} and let cα({γ,β})=0c_{\alpha}(\{\gamma,\beta\}) = 0 if γ∉uξβ\gamma\notin u_{\xi_{\beta}}. Thus cαc_{\alpha} extends cβc_{\beta}, and the new values are determined according to the membership in uξβu_{\xi_{\beta}}. Let c=⋃α∈λcαc = \bigcup_{\alpha\in\lambda} c_{\alpha}.

Let I\mathcal{I} be the ideal that is κ\kappa-generated by the 0-monochromatic subsets of λ\lambda under cc, and the bounded subsets of λ\lambda. Formally, for every A⊆λA \subseteq\lambda let A∈IA \in\mathcal{I} iff there are ζ∈κ\zeta\in\kappa and Aϵ⊆λA_{\epsilon} \subseteq\lambda for every ϵ∈ζ\epsilon\in\zeta so that c′′[Aϵ]2={0}c^{\prime\prime}[A_{\epsilon}]^2 = \{0\} for each ϵ∈ζ\epsilon\in\zeta and A−⋃{Aϵ∣ϵ∈ζ}∈[λ]<κA - \bigcup\{A_{\epsilon} \mid\epsilon\in\zeta\} \in[\lambda]^{<\kappa}. Let D\mathcal{D} be the dual filter, namely {λ−A∣A∈I}\{\lambda- A \mid A \in\mathcal{I}\}. Clearly, D\mathcal{D} is a κ\kappa-complete filter over λ\lambda. We must prove, however, that D\mathcal{D} is a proper filter (or, in other words, that λ∉I\lambda\notin\mathcal{I}). Assume towards contradiction that λ∈I\lambda\in\mathcal{I}. Fix ζ∈κ\zeta\in\kappa and Aϵ⊆λA_\epsilon\subseteq\lambda for every ϵ∈ζ\epsilon\in\zeta such that c↾[Aϵ]2c \restriction[A_\epsilon]^2 is constantly zero for each ϵ∈ζ\epsilon\in\zeta and B=λ∖⋃ϵ∈ζAϵ∈[λ]<λB = \lambda\setminus\bigcup_{\epsilon\in\zeta} A_\epsilon\in[\lambda]^{<\lambda}. Since λ\lambda is regular, BB is bounded in λ\lambda. We may assume, without loss of generality, that ∣Aϵ∣=λ|A_\epsilon| = \lambda for every ϵ∈ζ\epsilon\in\zeta, since BB can be augmented by adding every AϵA_\epsilon of size less than λ\lambda to BB.

We choose a sequence of ordinals (βαϵ∣α∈λ,ϵ∈ζ)(\beta_{\alpha\epsilon} \mid\alpha\in\lambda, \epsilon\in\zeta) with no repetitions such that βαϵ∈Aϵ\beta_{\alpha\epsilon} \in A_\epsilon for every α∈λ,ϵ∈ζ\alpha\in\lambda,\epsilon\in\zeta. The choice is possible since ∣Aϵ∣=λ|A_\epsilon| = \lambda for every ϵ∈ζ\epsilon\in\zeta. For every α∈λ\alpha\in\lambda let Vα=⋃{uξβαϵ∣ϵ∈ζ}V_\alpha= \bigcup\{u_{\xi_{\beta_{\alpha\epsilon}}} \mid\epsilon\in\zeta\} and let Wα={γ∈λ∣∃ϵ∈ζ, βγϵ∈Vα}W_\alpha= \{\gamma\in\lambda\mid\exists\epsilon\in\zeta,\ \beta_{\gamma\epsilon} \in V_\alpha\}. Notice that Vα∈[λ]<κV_\alpha\in[\lambda]^{<\kappa} since κ\kappa is regular, and hence Wα∈[λ]<κW_\alpha\in[\lambda]^{<\kappa} as well. Apply Hajnal’s free subset theorem to the collection {Wα∣α∈λ}\{W_\alpha\mid\alpha\in\lambda\} and let Y∈[λ]λY \in[\lambda]^\lambda be free. That is, if {α,β}⊆Y\{\alpha,\beta\} \subseteq Y then α∉Wβ\alpha\notin W_\beta.

Let f:ζ→Yf:\zeta\to Y be an increasing function satisfying B∩rang⁡(f)=∅B \cap\operatorname{rang}(f) = \varnothing. Let u={βf(ϵ)ϵ∣ϵ∈ζ}u = \{\beta_{f(\epsilon)\epsilon} \mid\epsilon\in\zeta\}. Observe that u∈[λ]<κu \in[\lambda]^{<\kappa} and c↾[u]2c \restriction[u]^2 is constantly zero. Indeed, if ϵ′<ϵ<ζ\epsilon' < \epsilon< \zeta and c(βf(ϵ′)ϵ′,βf(ϵ)ϵ)=1c(\beta_{f(\epsilon')\epsilon'},\beta_{f(\epsilon)\epsilon}) = 1 then βf(ϵ′)ϵ′∈uξβf(ϵ)ϵ⊆Vf(ϵ)\beta_{f(\epsilon')\epsilon'} \in u_{\xi_{\beta_{f(\epsilon)\epsilon}}} \subseteq V_{f(\epsilon)}. But then f(ϵ′)∈Wf(ϵ)f(\epsilon') \in W_{f(\epsilon)} by definition, and we know that f(ϵ′)∉Wf(ϵ)f(\epsilon') \notin W_{f(\epsilon)} as both f(ϵ′)f(\epsilon') and f(ϵ)f(\epsilon) belong to YY.

Recall that uu appears λ\lambda many times in our enumeration of the elements of [λ]<κ[\lambda]^{<\kappa}. At some point there will be an ordinal ξα\xi_\alpha so that u=uξαu = u_{\xi_\alpha} and ξα\xi_\alpha is the first ordinal for which c↾uξα={0}c \restriction u_{\xi_\alpha} = \{0\}, since the previous ξγ\xi_\gamma’s will be exhausted. From this argument it follows that ξα\xi_\alpha can be arbitrarily large, so we choose ξα\xi_\alpha so that α>⋃B\alpha> \bigcup B. Since α∉B\alpha\notin B, there is some ϵ∈ζ\epsilon\in\zeta such that α∈Aϵ\alpha\in A_\epsilon. By definition, βf(ϵ)ϵ∈Aϵ\beta_{f(\epsilon)\epsilon} \in A_\epsilon as well, thus c({α,βf(ϵ)ϵ})=0c(\{\alpha,\beta_{f(\epsilon)\epsilon}\}) = 0 as c↾[Aϵ]2c \restriction[A_\epsilon]^2 is constantly zero. However, βf(ϵ)ϵ∈u=uξα\beta_{f(\epsilon)\epsilon} \in u = u_{\xi_\alpha}, so c({α,βf(ϵ)ϵ})=1c(\{\alpha,\beta_{f(\epsilon)\epsilon}\}) = 1, a contradiction.

The above claim is exactly what we need in order to lift negative partition relations to the negative arrow relation over a successor of a singular cardinal. We emphasize that the coloring cc may possess a 0-monochromatic set AA of size λ\lambda. Only the weaker statement A=∅ mod DA = \varnothing\bmod\mathcal{D} is guaranteed. But this will be sufficient as shown in the following.

Theorem 2.2. Suppose that:

(A)λ>cf⁡(λ)=θ.λ=⋃i∈θκi=⋃i∈θλi.κi=cf⁡(κi)<λi=cf⁡(λi) and λi<κi=λi for every i∈θ.∏i<jλi<κj for every j∈θ.(B)Di is a κi-complete proper filter over λi for every i∈θ.ci:[λi]2→{0,1} for every i∈θ.If A⊆λi and ci↾[A]2={0} then A=∅ mod Di.If α<β<γ<λi and ϵ=ci({α,β})=ci({α,γ})=ci({β,γ})then ϵ=0.(C)ηˉ=(ηα∣α∈λ+)⊆∏i∈θλi.If α<β<λ+ then ηα≠ηβ.\begin{aligned} \text{(A)}\quad&\lambda> \operatorname{cf}(\lambda) = \theta.\\ &\lambda= \bigcup_{i \in\theta} \kappa_i = \bigcup_{i \in\theta} \lambda_i.\\ &\kappa_i = \operatorname{cf}(\kappa_i) < \lambda_i = \operatorname{cf}(\lambda_i)\text{ and }\lambda_i^{<\kappa_i} = \lambda_i\text{ for every }i \in\theta.\\ &\prod_{i<j}\lambda_i < \kappa_j\text{ for every }j \in\theta.\\ \text{(B)}\quad&\mathcal{D}_i\text{ is a }\kappa_i\text{-complete proper filter over }\lambda_i\text{ for every }i \in\theta.\\ &c_i:[\lambda_i]^2 \to\{0,1\}\text{ for every }i \in\theta.\\ &\text{If }A \subseteq\lambda_i\text{ and }c_i\restriction[A]^2=\{0\}\text{ then }A=\varnothing\bmod\mathcal{D}_i.\\ &\text{If }\alpha<\beta<\gamma<\lambda_i\text{ and }\epsilon=c_i(\{\alpha,\beta\})=c_i(\{\alpha,\gamma\})=c_i(\{\beta,\gamma\})\\ &\qquad\text{then }\epsilon=0.\\ \text{(C)}\quad&\bar{\eta}=(\eta_\alpha\mid\alpha\in\lambda^+)\subseteq\prod_{i\in\theta}\lambda_i.\\ &\text{If }\alpha<\beta<\lambda^+\text{ then }\eta_\alpha\ne\eta_\beta. \end{aligned}

(ג) If Ai∈DiA_i \in\mathcal{D}_i for every i∈θi \in\theta then there is α0∈λ+\alpha_0 \in\lambda^+ such that for every α0≤α∈λ+\alpha_0 \leq\alpha\in\lambda^+ one can find iα∈θi_\alpha\in\theta so that ηα(i)∈Ai\eta_\alpha(i) \in A_i whenever iα≤i∈θi_\alpha\leq i \in\theta.

Then λ+↛(λ+,(3)θ)2\lambda^+ \nrightarrow(\lambda^+,(3)_\theta)^2.

Proof. We define c:[λ+]2→θ×{0,1}c:[\lambda^+]^2 \to\theta\times\{0,1\} as follows. For every α<β<λ+\alpha<\beta<\lambda^+ we let iαβ=ℓg(ηα∩ηβ)∈θi_{\alpha\beta}=\ell g(\eta_\alpha\cap\eta_\beta)\in\theta, and εαβ=ciαβ({ηα(i),ηβ(i)})\varepsilon_{\alpha\beta}=c_{i_{\alpha\beta}}(\{\eta_\alpha(i),\eta_\beta(i)\}). Now if 0<εαβ0<\varepsilon_{\alpha\beta} then we define c({α,β})=(iαβ,εαβ)c(\{\alpha,\beta\})=(i_{\alpha\beta},\varepsilon_{\alpha\beta}). Otherwise, we set c({α,β})=(0,0)c(\{\alpha,\beta\})=(0,0).

We claim that cc witnesses the negative arrow relation λ+↛(λ+,(3)θ)2\lambda^+\nrightarrow(\lambda^+,(3)_\theta)^2. To show this, we must prove two propositions. Firstly, let us show that if ε>0\varepsilon>0 then the graph (λ,{{α,β}∣c({α,β})=(i,ε)})(\lambda,\{\{\alpha,\beta\}\mid c(\{\alpha,\beta\})=(i,\varepsilon)\}) has no triples. Indeed, if c({α,β})=c({α,γ})=c({β,γ})=(i,ε)c(\{\alpha,\beta\})=c(\{\alpha,\gamma\})=c(\{\beta,\gamma\})=(i,\varepsilon) then the triple {ηα(i),ηβ(i),ηγ(i)}\{\eta_\alpha(i),\eta_\beta(i),\eta_\gamma(i)\} is ε\varepsilon-monochromatic under cic_i, contradicting (B)(ג) as ε>0\varepsilon>0. Secondly, we argue that if A∈[λ]λA\in[\lambda]^\lambda then c↾[A]2c\mathbin{\upharpoonright}[A]^2 is not constantly (0,0)(0,0).

To see this, assume towards contradiction that A∈[λ]λA\in[\lambda]^\lambda is a counterexample. For every i∈θi\in\theta let Ai={ηα(i)∣α∈A}⊆λiA_i=\{\eta_\alpha(i)\mid\alpha\in A\}\subseteq\lambda_i. We distinguish two cases. In the first case, Ai∈Di+A_i\in\mathcal{D}_i^+ for some i∈θi\in\theta. Fix such ii and choose αβ∈A\alpha_\beta\in A for every β∈Ai\beta\in A_i so that ηαβ(i)=β\eta_{\alpha_\beta}(i)=\beta. For every ν∈∏j<iλj\nu\in\prod_{j<i}\lambda_j let Aiν={β∈Ai∣ηαβ↾i=ν}A_{i\nu}=\{\beta\in A_i\mid\eta_{\alpha_\beta}\mathbin{\upharpoonright}i=\nu\}. Thus Ai=⋃{Aiν∣ν∈∏j<iλj}A_i=\bigcup\{A_{i\nu}\mid\nu\in\prod_{j<i}\lambda_j\}. Since Di\mathcal{D}_i is κi\kappa_i-complete and ∏j<iλj<κi\prod_{j<i}\lambda_j<\kappa_i, for some ν∈∏j<iλj\nu\in\prod_{j<i}\lambda_j one has Aiν∈Di+A_{i\nu}\in\mathcal{D}_i^+. By assumption (B)(ג), there are β,β′∈Aiν\beta,\beta'\in A_{i\nu} so that β≠β′\beta\ne\beta' and ci({β,β′})=ε>0c_i(\{\beta,\beta'\})=\varepsilon>0. By definition, c({αβ,αβ′})=(i,ε)≠(0,0)c(\{\alpha_\beta,\alpha_{\beta'}\})=(i,\varepsilon)\ne(0,0). But αβ,αβ′∈A\alpha_\beta,\alpha_{\beta'}\in A, so c({αβ,αβ′})=(0,0)c(\{\alpha_\beta,\alpha_{\beta'}\})=(0,0), a contradiction.

In the second case, Ai=∅ mod DiA_i=\varnothing\bmod\mathcal{D}_i for every i∈θi\in\theta. Define B={α∈λ∣(∀∗i<θ)(ηα(i)∈Ai)}B=\{\alpha\in\lambda\mid(\forall^*i<\theta)(\eta_\alpha(i)\in A_i)\}. From (C)(ג) we see that B∈[λ]<λB\in[\lambda]^{<\lambda}, as λi−Ai∈Di\lambda_i-A_i\in\mathcal{D}_i for every i∈θaccordingtothesecondcase.Nowifi\in\theta according to the second case. Now if\alpha\in Athen,bydefinition,then, by definition,\eta_\alpha(i)\in A_iforeveryfor everyi\in\theta.Hence. HenceA\subseteq Bandconsequentlyand consequently|A|<\lambda$, a contradiction.

□\square2.2

In order to utilize the above theorem one has to show that the assumptions there hold (or can be forced) under the relevant circumstances. The assumptions of (A) are easily satisfied for an appropriate choice of cardinals when λ\lambda is a strong limit singular cardinal. The assumptions of (B) follow from Claim 2.1. Thus the only challenge is (C), and this is our next goal.

Lemma 2.3. Let λ\lambda be a strongly inaccessible cardinal. Let R⊆λR\subseteq\lambda be an unbounded set of regular cardinals. For every ζ∈R\zeta\in R let Dζ\mathcal{D}_\zeta be a ζ\zeta-complete filter over ζ+\zeta^+. There is a (<λ)({<}\lambda)-strategically-closed λ+\lambda^+-cc forcing notion D\mathbb{D}, for which the following hold in the generic extension by D\mathbb{D}:

(ℵ) (fα∣α∈λ+)(f_\alpha\mid\alpha\in\lambda^+) is a scale in ∏ζ∈RDζ\prod_{\zeta\in R}\mathcal{D}_\zeta.

(ג) For every (Aζ∣ζ∈R)∈∏ζ∈RDζ(A_\zeta\mid\zeta\in R)\in\prod_{\zeta\in R}\mathcal{D}_\zeta there is α0∈λ+\alpha_0\in\lambda^+ such that for each α0≤α∈λ+\alpha_0\leq\alpha\in\lambda^+ there exists iα∈λi_\alpha\in\lambda such that if iα≤ζ∈λi_\alpha\leq\zeta\in\lambda then fα(ζ)∈Aζf_\alpha(\zeta)\in A_\zeta. Proof. Let (Dα,Hβ∣β∈λ+,α≤λ+)(\mathbb{D}_{\alpha},\mathbb{H}_{\beta} \mid\beta\in\lambda^{+}, \alpha\le\lambda^{+}) be a (<λ)(<\lambda)-support iteration of length λ+\lambda^{+}, where Hβ\mathbb{H}_{\beta} is (a name of) a forcing notion defined in the generic extension by Dβ\mathbb{D}_{\beta} as follows. A condition p∈Hβp \in\mathbb{H}_{\beta} is a pair (s,Aˉ)=(sp,Aˉp)(s,\bar{A})=(s_{p},\bar{A}_{p}), where ss is a function with dom⁡(s)=R∩ξs\operatorname{dom}(s)=R\cap\xi_{s} for some ξs∈λ\xi_{s}\in\lambda and Aˉ\bar{A} is a sequence of sets (Aζ∣ζ∈R−dom⁡(s))(A_{\zeta}\mid\zeta\in R-\operatorname{dom}(s)). For every ζ∈dom⁡(s)\zeta\in\operatorname{dom}(s) one has s(ζ)∈ζ+s(\zeta)\in\zeta^{+} and for every ζ∈R−dom⁡(s)\zeta\in R-\operatorname{dom}(s) one has Aζ∈DζA_{\zeta}\in\mathcal{D}_{\zeta}. If p,q∈Hβp,q\in\mathbb{H}_{\beta} then p≤qp\le q iff sp⊆sqs_{p}\subseteq s_{q}, Aζq⊆AζpA_{\zeta}^{q}\subseteq A_{\zeta}^{p} whenever ζ∈R−dom⁡(sq)\zeta\in R-\operatorname{dom}(s_{q}) and if ζ∈dom⁡(sq)−dom⁡(sp)\zeta\in\operatorname{dom}(s_{q})-\operatorname{dom}(s_{p}) then sq(ζ)∈Aζps_{q}(\zeta)\in A_{\zeta}^{p}. Thus Hβ\mathbb{H}_{\beta} approximates a function in ∏R\prod R in a Hechlerish style. We shall say that sps_{p} is the stem of pp and Aˉp\bar{A}_{p} is the pure part of pp.

Observe that Hβ\mathbb{H}_{\beta} is (forced to be) (<λ)(<\lambda)-strategically-closed. In fact, if γ∈λ\gamma\in\lambda then there exists a γ+\gamma^{+}-directed-closed dense open set of conditions, that is, Tγ={p∈Hβ∣∣dom⁡(sp)∣>γ}T_{\gamma}=\{p\in\mathbb{H}_{\beta}\mid\lvert\operatorname{dom}(s_{p})\rvert>\gamma\}. To see this, suppose that {pi∣i<γ}\{p_{i}\mid i<\gamma\} is directed. Define sp=⋃i<γspis_{p}=\bigcup_{i<\gamma}s_{p_{i}} and for every ζ∈R−dom⁡(sp)\zeta\in R-\operatorname{dom}(s_{p}) let Aζp=⋂i<γAζpiA_{\zeta}^{p}=\bigcap_{i<\gamma}A_{\zeta}^{p_{i}}. Notice that Aζp∈DζA_{\zeta}^{p}\in\mathcal{D}_{\zeta} since ζ>γ\zeta>\gamma and Dζ\mathcal{D}_{\zeta} is ζ\zeta-complete. Now p=(sp,Aˉp)p=(s_{p},\bar{A}_{p}) is an upper bound for {pi∣i<γ}\{p_{i}\mid i<\gamma\}. It is easy to see that Hβ\mathbb{H}_{\beta} is λ\lambda-centered. Indeed, if p,q∈Hβp,q\in\mathbb{H}_{\beta} and sp=sqs_{p}=s_{q} then p∥qp\mathbin{\|}q. Since the number of stems is λ\lambda (recall that λ\lambda is strongly inaccessible) we conclude that Hβ\mathbb{H}_{\beta} is λ\lambda-centered.

Let H⊆HβH\subseteq\mathbb{H}_{\beta} be generic. Define fβ=⋃{s∣(s,Aˉ)∈H}f_{\beta}=\bigcup\{s\mid(s,\bar{A})\in H\}. By the directness of HH and simple density arguments, fβf_{\beta} is a function, dom⁡(fβ)=R\operatorname{dom}(f_{\beta})=R and fβ(ζ)∈ζ+f_{\beta}(\zeta)\in\zeta^{+} for every ζ∈R\zeta\in R. Let D=Dλ+\mathbb{D}=\mathbb{D}_{\lambda^{+}}. Observe that D\mathbb{D} is (<λ)(<\lambda)-strategically-closed and λ+\lambda^{+}-cc. Indeed, D\mathbb{D} is a (<λ)(<\lambda)-support iteration and each component in the iteration is (<λ)(<\lambda)-strategically-closed and λ\lambda-centered. Fix a VV-generic set G⊆DG\subseteq\mathbb{D}. Let us show that the statement of the lemma holds in V[G]V[G].

As noted above, (fα∣α∈λ+)⊆∏R(f_{\alpha}\mid\alpha\in\lambda^{+})\subseteq\prod R. Since D\mathbb{D} is (<λ)(<\lambda)-strategically-closed, no new bounded subsets of λ\lambda are introduced in V[G]V[G]. However, new sequences of measure-one sets (of length λ\lambda) are introduced. Fix such a sequence Aˉ=(Aζ∣ζ∈R)∈∏ζ∈RDζ∩V[G]\bar{A}=(A_{\zeta}\mid\zeta\in R)\in\prod_{\zeta\in R}\mathcal{D}_{\zeta}\cap V[G]. Since D\mathbb{D} is λ+\lambda^{+}-cc, there must be some γ∈λ+\gamma\in\lambda^{+} so that Aˉ∈VDγ\bar{A}\in V^{\mathbb{D}_{\gamma}}. We claim that if γ+≤β∈λ+\gamma^{+}\le\beta\in\lambda^{+} then there exists iβ∈λi_{\beta}\in\lambda such that fβ(ζ)∈Aζf_{\beta}(\zeta)\in A_{\zeta} whenever iβ≤ζ∈λi_{\beta}\le\zeta\in\lambda. If we prove this statement then the proof of the lemma will be accomplished.

To see this, let pp be an arbitrary condition that forces Aˉ\bar{A} to be a sequence of measure-one sets. Fix β∈[γ+,λ+)\beta\in[\gamma^{+},\lambda^{+}). Define q∈Dq\in\mathbb{D} so that p≤qp\le q, β∈dom⁡(q)\beta\in\operatorname{dom}(q) and let q(β)=(tq,Bˉq)q(\beta)=(t_{q},\bar{B}_{q}). We require that q↾β⊩B˙ξq⊆A˙ξq\mathbin{\upharpoonright}\beta\Vdash\dot{B}_{\xi}^{q}\subseteq\dot{A}_{\xi} for every ξ∈dom⁡(Bˉq)\xi\in\operatorname{dom}(\bar{B}_{q}). This is possible as A˙ξ\dot{A}_{\xi} is a Dγ\mathbb{D}_{\gamma}-name and hence also a Dβ\mathbb{D}_{\beta}-name. Finally, let iβ=⋃dom⁡(tq)i_{\beta}=\bigcup\operatorname{dom}(t_{q}). If iβ≤ζ∈λi_{\beta}\le\zeta\in\lambda then q⊩fβ(ζ)∈Bζq⊆Aζq\Vdash f_{\beta}(\zeta)\in B_{\zeta}^{q}\subseteq A_{\zeta}, so as pp was arbitrary we are done.

□\square2.3

Remark that for densely many conditions p∈Dp\in\mathbb{D}, for every α∈dom⁡(p)\alpha\in\operatorname{dom}(p), the stem of the condition p(α)p(\alpha) is a canonical name of a ground model function. Hence we may assume, without loss of generality, that this is true for every condition in D\mathbb{D}.

By the previous lemma, we can force our pcf assumption using a (<λ)({<}\lambda)-strategically-closed forcing notion. We would like, therefore, to prove that a supercompact cardinal λ\lambda will remain supercompact after such a forcing. This will be instrumental since we will singularize this cardinal with various kinds of Prikry-type forcings. Thus we have to show that a supercompact cardinal λ\lambda can be indestructible under such forcings. We shall follow the ideas of Laver, with slight little changes, in order to force this property over a supercompact cardinal in the ground model.

As our forcing is not sufficiently directed closed, we need a weaker property that would imply the existence of a master condition for lifting certain supercompact embeddings.

Lemma 2.4. Let R\mathbb{R} and D\mathbb{D} be as above, and let ζ∈R\zeta\in\mathbb{R}. Suppose that F⊆DF \subseteq\mathbb{D} is a directed set of conditions, ∣F∣<ζ|F| < \zeta, and for every α∈⋃{dom⁡(p)∣p∈F}\alpha\in\bigcup\{\operatorname{dom}(p) \mid p \in F\} one has ⋃{dom⁡(sp(α))∣p∈F}≥ζ\bigcup\{\operatorname{dom}(s_{p(\alpha)}) \mid p \in F\} \geq\zeta. Then there exists a master condition m∈Dm \in\mathbb{D} so that p≤mp \leq m for every p∈Fp \in F.

Proof. We commence with letting dom⁡(m)=⋃{dom⁡(p)∣p∈F}\operatorname{dom}(m) = \bigcup\{\operatorname{dom}(p) \mid p \in F\}. For every α∈dom⁡(m)\alpha\in\operatorname{dom}(m) let sm(α)=⋃{sp(α)∣α∈F}s_{m(\alpha)} = \bigcup\{s_{p(\alpha)} \mid\alpha\in F\} and let Aˉξm(α)=⋂{Aˉξp(α)∣p∈F}\bar{A}^{m(\alpha)}_{\xi} = \bigcap\{\bar{A}^{p(\alpha)}_{\xi} \mid p \in F\}, for every ξ∈R−⋃dom⁡(sm(α))\xi\in\mathbb{R} - \bigcup\operatorname{dom}(s_{m(\alpha)}). We prove by induction on δ∈λ+\delta\in\lambda^{+} that m↾δm \mathbin{\upharpoonright} \delta is a condition and p↾δ≤m↾δp \mathbin{\upharpoonright} \delta\leq m \mathbin{\upharpoonright} \delta for every p∈Fp \in F.

For δ=0\delta= 0 this is trivial, and for a limit ordinal δ\delta it follows from the fact that ∣dom⁡(m)∣<λ|\operatorname{dom}(m)| < \lambda. We are left with the successor steps, so fix δ=α+1∈λ+\delta= \alpha+ 1 \in\lambda^{+}. By the induction hypothesis, m↾αm \mathbin{\upharpoonright} \alpha forces Aˉξp(α)\bar{A}^{p(\alpha)}_{\xi} to be a sequence of measure-one sets for every p∈Fp \in F. Hence m↾δm \mathbin{\upharpoonright} \delta is a condition. It remains to show that p↾δ≤m↾δp \mathbin{\upharpoonright} \delta\leq m \mathbin{\upharpoonright} \delta for every p∈Fp \in F.

Fix p∈Fp \in F. From the definition it follows that sp(α)⊆sm(α)s_{p(\alpha)} \subseteq s_{m(\alpha)} and Aˉξm(α)⊆Aˉξp(α)\bar{A}^{m(\alpha)}_{\xi} \subseteq\bar{A}^{p(\alpha)}_{\xi} for every relevant ξ\xi. Suppose that ξ∈dom⁡(sm(α))−dom⁡(sp(α))\xi\in\operatorname{dom}(s_{m(\alpha)}) - \operatorname{dom}(s_{p(\alpha)}). Since sm(α)s_{m(\alpha)} is the union of sp(α)s_{p(\alpha)}s, there exists r∈Fr \in F for which ξ∈dom⁡(sr(α))\xi\in\operatorname{dom}(s_{r(\alpha)}) and sm(α)(ξ)=sr(α)(ξ)s_{m(\alpha)}(\xi) = s_{r(\alpha)}(\xi). Since FF is directed, there exists t∈Ft \in F such that r,p≤tr,p \leq t. It follows that st(α)(ξ)=sr(α)(ξ)s_{t(\alpha)}(\xi) = s_{r(\alpha)}(\xi), and hence t↾α⊩m(α)(ξ)=st(α)(ξ)∈Aˉξp(α)t \mathbin{\upharpoonright} \alpha\Vdash m(\alpha)(\xi) = s_{t(\alpha)}(\xi) \in\bar{A}^{p(\alpha)}_{\xi}, so we are done.

As mentioned before, we need the above lemma in order to prove a version of Laver’s indestructibility. In the work of Laver, a supercompact cardinal λ\lambda is forced to be indestructible under any λ\lambda-directed-closed forcing notion. One cannot expect λ\lambda to be indestructible under every λ\lambda-strategically-closed forcing, since one can force a non-reflecting stationary set with such a forcing notion. However, if the set RR is sufficiently sparse then one can prepare the universe so that the corresponding forcing notion D\mathbb{D} will preserve the supercompactness of λ\lambda. This is the content of our next lemma, and the main idea is that we define the Laver iteration only with respect to some strategically closed forcing notions.

Lemma 2.5. Let λ\lambda be supercompact and assume GCH. There is a forcing notion L\mathbb{L} such that the following holds in the generic extension by L\mathbb{L}. If R⊆λR \subseteq\lambda is a set of double-double successors of strongly inaccessible cardinals and Dζ\mathcal{D}_{\zeta} is a ζ\zeta-complete filter over ζ+\zeta^{+} for every ζ∈R\zeta\in R then the associated forcing D\mathbb{D} preserves the supercompactness of λ\lambda as well as GCH.

Proof. Let ℓ:λ→Vλ\ell:\lambda\to V_{\lambda} be a Laver function. Let L\mathbb{L} be the Easton support iteration (Lα,Q˙β∣β<λ,α≤λ)(\mathbb{L}_{\alpha},\dot{\mathbb{Q}}_{\beta}\mid\beta<\lambda,\alpha\leq\lambda) where Q˙β\dot{\mathbb{Q}}_{\beta} is an Lβ\mathbb{L}_{\beta}-name of the trivial forcing unless β\beta is strongly inaccessible, ℓ(α)∈Vβ\ell(\alpha)\in V_{\beta} for each α∈β\alpha\in\beta and ℓ(β)\ell(\beta) is a pair of the form (γ,τ)(\gamma,\tau) and τ\tau is an Lβ\mathbb{L}_{\beta}-name of some (<β)({<}\beta)-strategically-closed forcing notion that preserves GCH.

One can verify that L\mathbb{L} is λ\lambda-cc and if β\beta is an inaccessible closure point of ℓ\ell then β\beta is preserved by L\mathbb{L}. It follows from the choice of the Q˙β\dot{\mathbb{Q}}_{\beta}s and standard arguments that GCH holds in the generic extension by L\mathbb{L}. Choose a VV-generic set G⊆LG\subseteq\mathbb{L}, and in V[G]V[G] choose a V[G]V[G]-generic set g⊆Dg\subseteq\mathbb{D}. We claim that λ\lambda is supercompact in V[G][g]V[G][g].

To see this, suppose that μ\mu is an arbitrary ordinal and j:V→Mj:V\to M is a μ\mu-supercompact elementary embedding, with j(ℓ)(λ)=(μ,D)j(\ell)(\lambda)=(\mu,\mathbb{D}). By increasing μ\mu if needed we may assume that μ=cf⁡(μ)≥λ+\mu=\operatorname{cf}(\mu)\geq\lambda^{+}. We may also assume that jj is an ultrapower embedding derived from some fine and normal measure over PλμP_{\lambda}\mu.

By elementarity, j(L)=L∗D∗Ltailj(\mathbb{L})=\mathbb{L}*\mathbb{D}*\mathbb{L}_{\mathrm{tail}}, where Ltail\mathbb{L}_{\mathrm{tail}} is μ+\mu^{+}-closed in V[G][g]V[G][g].

Let F={j(q)∣q∈g}F=\{j(q)\mid q\in g\}. By the closure of MM and the fact that j↾D∈Mj\mathbin{\upharpoonright}\mathbb{D}\in M we see that F∈M[G][g]F\in M[G][g]. Moreover, FF satisfies the assumptions of Lemma 2.4. Indeed, by the choice of RR we know that min⁡(R−λ)>λ+\min(R-\lambda)>\lambda^{+} and ∣F∣=λ+|F|=\lambda^{+}. Hence Lemma 2.4 applies and there is a master condition mm for FF.

By GCH, which holds in V[G][g]V[G][g], the number of dense subsets of Ltail\mathbb{L}_{\mathrm{tail}} is ∣j(2λ+)∣V=∣Pλμ(λ+)∣V=μ+|j(2^{\lambda^{+}})|^{V}=|P_{\lambda}\mu(\lambda^{+})|^{V}=\mu^{+}. Using the fact that Ltail\mathbb{L}_{\mathrm{tail}} is μ+\mu^{+}-closed, one can construct an M[G][g]M[G][g]-generic set hh containing mm. By the nature of mm, j′′gj''g is contained in hh. Hence Silver’s criterion applies and j:V→Mj:V\to M lifts to j+:V[G][g]→M[H][h]j^{+}:V[G][g]\to M[H][h]. Thus λ\lambda is μ\mu-supercompact in V[G][g]V[G][g]. But μ\mu was arbitrary, hence one concludes that λ\lambda is supercompact in V[G][g]V[G][g] and the proof is accomplished.

The above setting is rendered in a universe satisfying GCH. Our goal, however, is to force the negative arrow relation when 2λ>λ+2^{\lambda}>\lambda^{+}. Furthermore, we wish to force this relation at λ=ℵω\lambda=\aleph_{\omega}. We shall use the extender-based Prikry forcing in order to increase 2λ2^{\lambda}, and the corresponding version with interleaved collapses in order to push down the result to ℵω\aleph_{\omega}. The presentation of these forcing notions is inspired from the work of Merimovich, see e.g. [19].

Let WW be the universe obtained by the preparatory forcing L\mathbb{L}. Fix R⊆λR\subseteq\lambda such that every element of RR is of the form ρ+4\rho^{+4}, where ρ\rho is a strongly inaccessible cardinal, and RR is unbounded in λ\lambda. For every ρ+4∈R\rho^{+4}\in R let cρ:[ρ+4]2→{0,1}c_{\rho} : [\rho^{+4}]^2 \to\{0,1\} be as guaranteed in Claim 2.1. Namely, cρc_{\rho} has no 1-monochromatic triangle and if A⊆ρ+4A \subseteq\rho^{+4} is 0-monochromatic under cρc_{\rho} then A=∅ mod DρA = \varnothing\bmod D_{\rho}, where DρD_{\rho} is a ρ+3\rho^{+3}-complete proper filter over ρ+4\rho^{+4}. We denote the dual (proper) ideal by IρI_{\rho}, so IρI_{\rho} is <ρ+3<\rho^{+3}-generated from the bounded subsets of ρ+4\rho^{+4} and the 0-monochromatic sets of the coloring cρc_{\rho}.

Let D\mathbb{D} be the forcing notion associated with RR, and let VV be the extension of WW by D\mathbb{D}. Let (fα∣α∈λ+)(f_{\alpha} \mid\alpha\in\lambda^{+}) be the generic scale. Fix a (λ,λ++)(\lambda,\lambda^{++})-extender EE in VV and let j:V→Mj : V \to M be the extender ultrapower map. Let U0U_{0} be the (unique) normal measure of EE, and let i:V→Ult⁡(V,U0)≅Ni : V \to\operatorname{Ult}(V,U_{0}) \cong N be the corresponding ultrapower embedding. Let K0K_{0} be NN-generic for the forcing Col⁡N((λ+5)N,<i(λ))\operatorname{Col}^{N}((\lambda^{+5})^{N},<i(\lambda)). Let k:N→Mk : N \to M be the quotient map, and let KK be the generic set generated by k[K0]k[K_{0}].

V→jMi↓↑kUlt⁡(V,U0)≅N\begin{CD} V @>{j}>> M \\ @V{i}VV @AA{k}A \\ \operatorname{Ult}(V,U_{0}) \cong N \end{CD}

Claim 2.6. KK is MM-generic for the forcing Col⁡M((λ+5)M,<j(λ))\operatorname{Col}^{M}((\lambda^{+5})^{M},<j(\lambda)).

Proof. Let DD be a dense subset of Col⁡M((λ+5)M,<j(λ))\operatorname{Col}^{M}((\lambda^{+5})^{M},<j(\lambda)), and assume that D∈MD \in M. We must show that D∩K≠∅D \cap K \ne\varnothing. By the nature of jj, there are a∈[λ++]na \in[\lambda^{++}]^{n} for some n∈ωn \in\omega and f:[λ]n→Vf : [\lambda]^{n} \to V so that jf(a)=Dj f(a) = D. Define D′={if(z)∣z∈[(λ++)N]n, if(z) is a dense open subset of Col⁡N((λ+5)N,<i(λ))}D' = \{if(z) \mid z \in[(\lambda^{++})^{N}]^{n},\ if(z)\text{ is a dense open subset of }\operatorname{Col}^{N}((\lambda^{+5})^{N},<i(\lambda))\}. Clearly D′∈ND' \in N, and since Col⁡N((λ+5)N,<i(λ))\operatorname{Col}^{N}((\lambda^{+5})^{N},<i(\lambda)) is (λ+5)N(\lambda^{+5})^{N}-distributive and D′D' is the intersection of less than (λ+)N(\lambda^{+})^{N} dense open sets, we see that D′D' is dense and open. Thus D′∩K≠∅D' \cap K \ne\varnothing and hence k(D′)∩K≠∅k(D') \cap K \ne\varnothing. Notice that D=k(if)(a)D = k(if)(a) for a∈k([(λ++)N]n)a \in k([(\lambda^{++})^{N}]^{n}), hence D⊇k(D′)D \supseteq k(D'). In particular, D∩K≠∅D \cap K \ne\varnothing as sought. □\square2.6

Working in VV, let P\mathbb{P} be the extender-based Prikry forcing with interleaved collapses, using the extender EE and the set KK as a guiding generic. Following [19], for every d∈[λ++]≤λd \in[\lambda^{++}]^{\leq\lambda} let E(d)={x∈Vλ∣(j↾d)−1∈j(x)}E(d) = \{x \in V_{\lambda} \mid(j \mathbin{\upharpoonright} d)^{-1} \in j(x)\}. Thus E(d)E(d) is a λ\lambda-complete ultrafilter over VλV_{\lambda}, and (j↾d)−1(j \mathbin{\upharpoonright} d)^{-1} is a partial increasing function from j(d)j(d) to dd. Since E(d)E(d) concentrates on such objects we may assume, without loss of generality, that if A∈E(d)A \in E(d) then AA is a set of partial increasing functions with domain contained in dd.

We define our forcing notion P\mathbb{P} as follows. A condition p∈Pp \in\mathbb{P} is a quadruple of the form (cˉp,fp,Ap,Fp)(\bar{c}^{p},f^{p},A^{p},F^{p}), where:

  • (a) fpf^{p} is a partial function from λ++−λ\lambda^{++}-\lambda to λ<ω\lambda^{<\omega}.

  • (b) dp=dom⁡(fp)d^{p}=\operatorname{dom}(f^{p}) satisfies ∣dp∣≤λ\lvert d^{p}\rvert\leq\lambda.

  • (c) λ∈dp\lambda\in d^{p} for every pp and we let fp(λ)=(ρip∣i∈n)f^{p}(\lambda)=(\rho^{p}_{i}\mid i\in n).

(d) cˉp∈∏i≤nCol⁡((ρi−1p)+5,<ρip)\bar{c}^{p} \in\prod_{i \le n}\operatorname{Col}((\rho_{i-1}^{p})^{+5}, < \rho_{i}^{p}), where ρ−1p=ω\rho_{-1}^{p} = \omega and ρnp=λ\rho_{n}^{p} = \lambda.

(e) Ap∈E(dp)A^{p} \in E(d^{p}).

(f) If η∈Ap\eta\in A^{p} then η(λ)>⋃dom⁡(cnp)\eta(\lambda) > \bigcup\operatorname{dom}(c_{n}^{p}), and η(λ)>ρn−1p\eta(\lambda) > \rho_{n-1}^{p}.

(g) FpF^{p} is a function from ApA^{p} to VλV_{\lambda}.

(h) For every η∈Ap\eta\in A^{p}, Fp(η)∈Col⁡(η(λ)+5,<λ)F^{p}(\eta) \in\operatorname{Col}(\eta(\lambda)^{+5}, < \lambda).

(i) j(Fp)((j↾dp)−1)∈Kj(F^{p})((j \mathbin{\upharpoonright} d^{p})^{-1}) \in K.

We have to define the forcing order. To this end, we define the direct order ≤∗\leq^{*} and one point extensions. Then we let the forcing order be a finite sequence of these two extensions.

Assume, therefore, that p,q∈Pp,q \in\mathbb{P}. We shall say that qq is a direct extension of pp (denoted by p≤∗qp \leq^{*} q) iff the following hold:

(α\alpha) fp⊆fqf^{p} \subseteq f^{q}. In particular, ℓg(fp(λ))=ℓg(fq(λ))\ell g(f^{p}(\lambda)) = \ell g(f^{q}(\lambda)).

(β\beta) Aq⊆{η∣η∈dp∈Ap}A^{q} \subseteq\{\eta\mid\eta\in d^{p} \in A^{p}\}.

(γ\gamma) ciqc_{i}^{q} extends cipc_{i}^{p} for every i≤ni \leq n.3

(δ\delta) Fq(η)≥Fp(η)F^{q}(\eta) \geq F^{p}(\eta) for every η∈Ap\eta\in A^{p} (here ≥\geq is the order of the collapse).

Assume now that p∈Pp \in\mathbb{P} and η∈Ap\eta\in A^{p}. We define the one-point extension (or Prikry extension) p⌢ηp^{\frown}\eta as a condition rr satisfying the following requirements:

(α\alpha) fr(α)=fp(α)f^{r}(\alpha) = f^{p}(\alpha) if α∉dom⁡(η)\alpha\notin\operatorname{dom}(\eta), and fr(α)=fp(α)⌢η(α)f^{r}(\alpha) = f^{p}(\alpha)^{\frown}\eta(\alpha) if α∈dom⁡(η)\alpha\in\operatorname{dom}(\eta).

(β\beta) cˉr=cˉp⌢Fp(η)\bar{c}^{r} = \bar{c}^{p}{}^{\frown} F^{p}(\eta).

(γ\gamma) Ar=Ap−{ρ∈Ap∣ρ(λ)≤max⁡{η(λ),⋃dom⁡(Fp(η))}}A^{r} = A^{p} - \{\rho\in A^{p} \mid\rho(\lambda) \leq\max\{\eta(\lambda), \bigcup\operatorname{dom}(F^{p}(\eta))\}\}.

(δ\delta) Fr=Fp↾ArF^{r} = F^{p} \mathbin{\upharpoonright} A^{r}.

Finally, qq extends pp iff qq can be obtained from pp by a finite sequence of direct extensions and one-point extensions. Clearly, if p≤Pqp \leq_{\mathbb{P}} q then the process of deriving qq from pp can be introduced as one single direct extension followed by a finite sequence of one-point extensions.

Notice that (P,≤∗)(\mathbb{P}, \leq^{*}) is σ\sigma-closed since E(d)E(d) is λ\lambda-complete and the collapses are ℵ1\aleph_{1}-complete. It is known that P\mathbb{P} satisfies the strong Prikry property, preserves cardinals above λ\lambda (including λ\lambda itself), forces λ=ℵω\lambda= \aleph_{\omega}, preserves GCH below λ\lambda and forces 2ℵω=ℵω+22^{\aleph_{\omega}} = \aleph_{\omega+2}.

Claim 2.7. Let ρˉ=(ρn∣n∈ω)\bar{\rho} = (\rho_{n} \mid n \in\omega) be a name for the normal Prikry sequence. Suppose that p∈Pp \in\mathbb{P} and τ\tau is a P\mathbb{P}-name of an ordinal in ρn+5\rho_{n}^{+5}. There exists a condition q∈Pq \in\mathbb{P} so that p≤∗qp \leq^{*} q and a function gg with dom⁡(g)=λ\operatorname{dom}(g) = \lambda, such that g(α)∈[α+5]≤α++g(\alpha) \in[\alpha^{+5}]^{\leq\alpha^{++}} for every α∈λ\alpha\in\lambda and q⊩τ∈g(ρn)q \Vdash\tau\in g(\rho_{n}).

Proof. Let DD be a dense open sets deciding the value of τ\tau. By the strong Prikry property there are a natural number nn and a condition qq such that p≤∗qp \leq^{*} q and every extension of qq by nn-many one-point extensions belongs to DD. Recall that dpd^{p} is the domain of fpf^{p}. Let η0,…,ηn−1\eta_{0},\ldots,\eta_{n-1} be a sequence of nn-many one-point extensions of qq such that the value of τ\tau is decided by qq and these η\etas. Since dp∈[λ++]≤λd^p \in[\lambda^{++}]^{\leq\lambda} and ((J↾dp)−1)∈J(Aq)((\mathcal{J}\mathbin{\upharpoonright}d^p)^{-1}) \in\mathcal{J}(A^q) we may assume (by shrinking AqA^q if needed) that for every η∈Aq\eta\in A^q and every α∈dom⁡(η)⊆dp\alpha\in\operatorname{dom}(\eta) \subseteq d^p it is true that η(α)≤η(λ)++\eta(\alpha) \leq\eta(\lambda)^{++}. Moreover, by fixing a bijection h:λ→dph:\lambda\to d^p and shrinking AqA^q further we may assume that dom⁡(η)=h′′η(λ)\operatorname{dom}(\eta)=h''\eta(\lambda). Consequently, ∣{η∈Aq∣α=η(λ)}∣≤∣[α++]α∣=α++|\{\eta\in A^q\mid\alpha=\eta(\lambda)\}| \leq|[\alpha^{++}]^\alpha|=\alpha^{++} for every α∈λ\alpha\in\lambda. Hence we can define g(α)g(\alpha) as the set of all possible values for τ\tau using η0,…,ηn−1\eta_0,\ldots,\eta_{n-1} with ηn−1(λ)=α\eta_{n-1}(\lambda)=\alpha, and get q⊩τ∈g(ρn)q\Vdash\tau\in g(\rho_n) as required.

□ 2.7

For every n∈ωn\in\omega let Dn\mathcal{D}_n be the ρn+3\rho_n^{+3}-complete filter over ρn+4\rho_n^{+4} derived from Claim 2.1. The forcing P\mathbb{P} certainly introduces new bounded subsets of λ\lambda, so we must show that the relevant assumptions of Theorem 2.2 remain true in the generic extension by P\mathbb{P}. We commence with the following:

Claim 2.8. Let c:[ρn+4]2→{0,1}c:[\rho_n^{+4}]^2\to\{0,1\} be the coloring described in Claim 2.1. Let I˙\dot{I} be a name of a 0-monochromatic set under cc. Then I˙\dot{I} is (forced to be) contained in the union of less than ρn+3\rho_n^{+3} many 0-monochromatic sets from the ground model.

Proof. Fix an enumeration of P(ρn+4)\mathcal{P}(\rho_n^{+4}), for every n∈ωn\in\omega, in the ground model. We are assuming GCH in the ground model, hence the size of the enumeration is ρn+5\rho_n^{+5}. Let pp be an arbitrary condition that forces I˙\dot{I} to be 0-monochromatic. By extending fp(λ)f^p(\lambda) if needed we may assume that lg⁡(fp(λ))>n\operatorname{lg}(f^p(\lambda))>n. In other words, ρn\rho_n is decided by pp.

Let C=∏i≤nCol⁡(ρi+4,<ρi)\mathbb{C}=\prod_{i\leq n}\operatorname{Col}(\rho_i^{+4},<\rho_i), that is, C\mathbb{C} is the product of the first n+1n+1 collapses mentioned in the condition pp. Note that ∣C∣=ρn|\mathbb{C}|=\rho_n and the next collapses are at least ρn+5\rho_n^{+5}-closed. Let ⟨(sα,ξα)∣α∈ρn+4⟩\langle(s_\alpha,\xi_\alpha)\mid\alpha\in\rho_n^{+4}\rangle enumerate C×ρn+4\mathbb{C}\times\rho_n^{+4}. By induction on α∈ρn+4\alpha\in\rho_n^{+4} we define a condition pαp_\alpha such that:

(ℵ) (pα∣α∈ρn+4)(p_\alpha\mid\alpha\in\rho_n^{+4}) is ≤∗\leq^*-increasing.

(ב) cˉpα↾(n+1)\bar{c}^{p_\alpha}\mathbin{\upharpoonright}(n+1) is constant.

(ג) If there is a direct extension rr of pαp_\alpha which is the same as pαp_\alpha except that cˉpα=sα⌢cˉn+1pα\bar{c}^{p_\alpha}=s_\alpha^\frown\bar{c}^{p_\alpha}_{n+1} and rr decides the truth value of the statement ξˇα∈I˙\check{\xi}_\alpha\in\dot{I} then pαp_\alpha already decides this statement.

Let qq be an upper bound of (pα∣α∈ρn+4)(p_\alpha\mid\alpha\in\rho_n^{+4}). Such an upper bound exists since all the relevant components are sufficiently closed. Let q[s]q[s] denote the condition obtained from qq upon replacing cˉq\bar{c}^q by s⌢(cˉq↾[n,lg⁡(cˉq)))s^\frown(\bar{c}^q\mathbin{\upharpoonright}[n,\operatorname{lg}(\bar{c}^q))).

Let r0=cˉq↾(n+1)r_0=\bar{c}^q\mathbin{\upharpoonright}(n+1). For every s∈Cs\in\mathbb{C} let Is={α∈ρn+4∣q[s]⊩αˇ∈I˙}I_s=\{\alpha\in\rho_n^{+4}\mid q[s]\Vdash\check{\alpha}\in\dot{I}\}, so Is∈VI_s\in V and ⊩PI˙⊆⋃{Is∣r0≤Cs}\Vdash_{\mathbb{P}}\dot{I}\subseteq\bigcup\{I_s\mid r_0\leq_{\mathbb{C}}s\}. Furthermore, IsI_s is 0-monochromatic under cc for every ss such that r0≤Csr_0\leq_{\mathbb{C}}s, hence Is∈DnI_s\in\mathcal{D}_n. We conclude, therefore, that I˙\dot{I} is (forced to be) covered by a ground model set in In\mathcal{I}_n, as required.

□ 2.8

Let R={ρn+4∣n∈ω}R=\{\rho_n^{+4}\mid n\in\omega\}. We claim that (fα↾R∣α∈λ+)(f_\alpha\mathbin{\upharpoonright}R\mid\alpha\in\lambda^+) is a scale satisfying the required assumption of Theorem 2.2. Specifically, we must show that for every sequence of sets (An∣n∈ω)(A_n\mid n\in\omega) where An∈DnA_n\in\mathcal{D}_n for each n∈ωn \in\omega, there exists γ∈λ+\gamma\in\lambda^{+} such that if γ≤β∈λ+\gamma\le\beta\in\lambda^{+} then for some nβ∈ωn_{\beta} \in\omega one has fβ(n)∈Anf_{\beta}(n) \in A_{n} whenever nβ≤n∈ωn_{\beta} \le n \in\omega.

By Claim 2.8 we may assume that An∈VA_{n} \in V for every n∈ωn \in\omega. Notice, however, that the whole sequence (An∣n∈ω)(A_{n} \mid n \in\omega) need not be in VV. Let pp be an arbitrary condition in P\mathbb{P}. Applying Claim 2.7 repeatedly and using the enumeration of the ground model sets, we construct a ≤∗\leq^{*}-increasing sequence (qn∣n∈ω)(q_{n} \mid n \in\omega) such that q0≥pq_{0} \geq p and qn⊩An∈An(ρn)q_{n} \Vdash A_{n} \in\mathcal{A}_{n}(\rho_{n}), where ∣An(γ)∣≤γ++\lvert\mathcal{A}_{n}(\gamma)\rvert\leq\gamma^{++} for every γ∈λ\gamma\in\lambda.

Since (P,≤∗)(\mathbb{P}, \leq^{*}) is σ\sigma-closed, there exists a single condition qq such that qn≤qq_{n} \leq q for each n∈ωn \in\omega. For every ζ∈R\zeta\in R let Bζ=⋂{An∣n∈ω,An∈An(ζ)}B_{\zeta} = \bigcap\{A_{n} \mid n \in\omega, A_{n} \in\mathcal{A}_{n}(\zeta)\}. By the closure of Dζ\mathcal{D}_{\zeta} we see that Bζ∈DζB_{\zeta} \in\mathcal{D}_{\zeta}. By the construction, (Bζ∣ζ∈R)(B_{\zeta} \mid\zeta\in R) belongs to the ground model and hence there is an ordinal γ∈λ+\gamma\in\lambda^{+} such that for every γ≤β∈λ+\gamma\leq\beta\in\lambda^{+} there exists ζβ∈λ\zeta_{\beta} \in\lambda so that fβ(ζ)∈Bζf_{\beta}(\zeta) \in B_{\zeta} whenever ζβ≤ζ∈R\zeta_{\beta} \leq\zeta\in R. This completes the proof, as Bρn+3⊆AnB_{\rho_{n}}^{+3} \subseteq A_{n} for every n∈ωn \in\omega.

In order to force the failure of SCH at λ\lambda, as done in our results, one has to assume the existence of a measurable cardinal κ\kappa with o(κ)=κ++o(\kappa) = \kappa^{++} in the ground model. This fundamental result was proved by Gitik in [9] and in [10]. In our constructions we started from a supercompact cardinal in the ground model. The gap between these large cardinals invites the following:

Question 2.9. Let λ\lambda be a strong limit singular cardinal.

(א) What is the consistency strength of the negative arrow relation λ+↛(λ+,(3)cf⁡(λ))2\lambda^{+} \nrightarrow(\lambda^{+},(3)_{\operatorname{cf}(\lambda)})^{2} with 2λ>λ+2^{\lambda} > \lambda^{+}?

(ב) What is the consistency strength of the same negative relation with 2λ>λ+2^{\lambda} > \lambda^{+} where λ=ℵω\lambda= \aleph_{\omega}?

(ג) What is the consistency strength of the negative relation at every strong limit singular cardinal λ\lambda, in a universe in which 2λ>λ+2^{\lambda} > \lambda^{+} at every such λ\lambda?

A negative relation from stick

In the previous sections we used pcf assumptions in order to cope with the problem of Erdős and Hajnal. We move now to the second approach in which prediction principles play an important role. The prediction principle that we need for the combinatorial proof is called stick. The idea of stick as a prediction principle is well-articulated in [2], Chapter 4(12): “It consults its stick, its rod directs it”. Here we need the mathematical incarnation of this idea. We commence with the following definition.

Definition 3.1. Suppose that κ≤λ\kappa\le\lambda.

(ℵ) s(κ,λ)=min⁡{∣F∣∣F⊆[λ]κ∧∀y∈[λ]λ∃x∈F,x⊆y}\mathfrak{s}(\kappa,\lambda)=\min\{| \mathcal{F}| \mid\mathcal{F}\subseteq[\lambda]^\kappa\land\forall y\in[\lambda]^\lambda\exists x\in\mathcal{F},x\subseteq y\}.

(♢) Denote s(λ,λ+)\mathfrak{s}(\lambda,\lambda^+) by s(λ)\mathfrak{s}(\lambda).

The stick principle is closely related to the club principle, but no stationary sets are involved in the prediction. This fact makes s(λ)\mathfrak{s}(\lambda) very useful when λ\lambda is a singular cardinal. Let us recall the definition of the club principle (or tiltan), which appeared for the first time in [20]. If κ=cf⁡(κ)>ℵ0\kappa=\operatorname{cf}(\kappa)>\aleph_0 and S⊆κS\subseteq\kappa is stationary, then a tiltan sequence (Tδ∣δ∈S)(T_\delta\mid\delta\in S) is a sequence of sets, where TδT_\delta is a cofinal subset of δ\delta for each δ∈S\delta\in S,4 and if A∈[κ+]κ+A\in[\kappa^+]^{\kappa^+} then SA={δ∈S∣Tδ⊆A}S_A=\{\delta\in S\mid T_\delta\subseteq A\} is stationary. One says that ♣S\clubsuit_S holds if there exists such a sequence.

We proceed to the combinatorial result. Our goal is to prove the relation λ+↛(λ+,(3)cf⁡(λ))2\lambda^+\nrightarrow(\lambda^+,(3)_{\operatorname{cf}(\lambda)})^2 from the stick principle s(λ)\mathfrak{s}(\lambda). Negative partition relations at successors of a regular cardinal κ\kappa follow from s(κ)\mathfrak{s}(\kappa) as shown in [5]. Here we apply a similar idea to successors of singular cardinals. We need the following lemma about free sets from [14]. The lemma and its proof also appear in [7], Lemma 20.3.

Lemma 3.2. Let κ\kappa be a regular cardinal. Suppose that E=⋃α∈κEαE=\bigcup_{\alpha\in\kappa}E_\alpha, and ∣Eα∣>κ|E_\alpha|>\kappa for every α∈κ\alpha\in\kappa. Assume further that f:E→P(E)f:E\to\mathcal{P}(E) is a set mapping, and ∣f(x)∩Eα∣<κ|f(x)\cap E_\alpha|<\kappa for every x∈E,α∈κx\in E,\alpha\in\kappa. Then there exists a free set XX for ff so that X∩Eα≠∅X\cap E_\alpha\ne\varnothing for every α∈κ\alpha\in\kappa.

We can state now the following:

Theorem 3.3. suppose that θ=cf⁡(λ)<λ\theta=\operatorname{cf}(\lambda)<\lambda and assume that s(λ)\mathfrak{s}(\lambda) holds. Then λ+↛(λ+,(3)cf⁡(λ))2\lambda^+\nrightarrow(\lambda^+,(3)_{\operatorname{cf}(\lambda)})^2.

Proof. Let (κi∣1≤i∈θ)(\kappa_i\mid1\le i\in\theta) be an increasing sequence of infinite cardinals such that λ=⋃i∈θκi\lambda=\bigcup_{i\in\theta}\kappa_i. Notice that the enumeration of these cardinals begins with κ1\kappa_1 since we wish to save the first color to the full-sized independent subsets of the graph. We shall define a partition P=(Pi∣i∈θ)\mathcal{P}=(P_i\mid i\in\theta) of [λ+]2[\lambda^+]^2.5 Then, essentially, for α<β<λ+\alpha< \beta< \lambda^{+} we will set c(α,β)=ic(\alpha,\beta)=i iff {α,β}∈Pi\{\alpha,\beta\}\in\mathcal{P}_i.6 The partition P\mathcal{P} will be based on a sequence of set-mappings in the following way. For every i∈(0,θ)i\in(0,\theta) we shall define fi:λ+→[λ+]≤κif_i:\lambda^{+}\to[\lambda^{+}]^{\leq\kappa_i} such that fi(α)⊆αf_i(\alpha)\subseteq\alpha for every i∈θ,α∈λ+i\in\theta,\alpha\in\lambda^{+}. We let Pi={{α,β}∣α<β<λ+,α∈fi(β)}\mathcal{P}_i=\{\{\alpha,\beta\}\mid\alpha<\beta<\lambda^{+},\alpha\in f_i(\beta)\}. This procedure defines Pi\mathcal{P}_i for i>0i>0, and we let P0=[λ+]2−⋃{Pi∣1≤i<θ}\mathcal{P}_0=[\lambda^{+}]^2-\bigcup\{\mathcal{P}_i\mid1\leq i<\theta\}.

The construction of each fif_i is by induction on α∈λ+\alpha\in\lambda^{+}, where at the α\alphath stage, fi(α)f_i(\alpha) is defined simultaneously for each i∈(0,θ)i\in(0,\theta). Fix α∈λ+\alpha\in\lambda^{+} and suppose that fi(γ)f_i(\gamma) is already defined for every γ∈α\gamma\in\alpha and every i∈θi\in\theta. Let (Tη∣η∈λ+)(T_\eta\mid\eta\in\lambda^{+}) be a ♣(λ)\clubsuit(\lambda) sequence, so Tη∈[λ+]λT_\eta\in[\lambda^{+}]^\lambda for every η∈λ+\eta\in\lambda^{+}. Let Sα={Tη∣η∈α,Tη⊆α}S_\alpha=\{T_\eta\mid\eta\in\alpha,T_\eta\subseteq\alpha\}. Notice that ∣Sα∣≤∣α∣≤λ|S_\alpha|\leq|\alpha|\leq\lambda and hence there exists a decomposition of the form Sα=⋃{Sαi∣1≤i∈θ}S_\alpha=\bigcup\{S_\alpha^i\mid1\leq i\in\theta\}, where i<j⇒Sαi∩Sαj=∅i<j\Rightarrow S_\alpha^i\cap S_\alpha^j=\varnothing and ∣Sαi∣≤κi|S_\alpha^i|\leq\kappa_i for every i∈(0,θ)i\in(0,\theta).

In order to define fi(α)f_i(\alpha) for each i∈(0,θ)i\in(0,\theta), fix an ordinal ii and apply Lemma 3.2, where κi+\kappa_i^{+} here stands for κ\kappa there, and fi↾αf_i\mathbin{\upharpoonright}\alpha here stands for ff there. Notice that ∣fi(γ)∣≤κi|f_i(\gamma)|\leq\kappa_i for each γ∈α\gamma\in\alpha by the induction hypothesis, so the assumptions of the lemma hold. By the conclusion of the lemma, there exists a free set X=XαiX=X_\alpha^i for fi↾αf_i\mathbin{\upharpoonright}\alpha which satisfies X∩T≠∅X\cap T\neq\varnothing for every T∈SαiT\in S_\alpha^i. By removing elements from XX if needed, we may assume that ∣X∣≤∣Sαi∣≤κi|X|\leq|S_\alpha^i|\leq\kappa_i, so we can define fi(α)=X=Xαif_i(\alpha)=X=X_\alpha^i. This completes the definition of our set mappings, and consequently the definition of P\mathcal{P}, the partition of [λ+]2[\lambda^{+}]^2.

We define, at this stage, the coloring c:[λ+]2→θc:[\lambda^{+}]^2\to\theta by letting c(α,β)=ic(\alpha,\beta)=i iff i∈θi\in\theta is the first ordinal so that {α,β}∈Pi\{\alpha,\beta\}\in\mathcal{P}_i. We claim that cc witnesses the negative relation to be proved. To see this, let us show firstly that there are no α<β<δ<λ+\alpha<\beta<\delta<\lambda^{+} and i∈θi\in\theta such that c(α,β)=c(α,δ)=c(β,δ)=ic(\alpha,\beta)=c(\alpha,\delta)=c(\beta,\delta)=i where i>0i>0. Indeed, if α<β<δ<λ+\alpha<\beta<\delta<\lambda^{+} and c(α,δ)=c(β,δ)=ic(\alpha,\delta)=c(\beta,\delta)=i then {α,δ},{β,δ}∈Pi\{\alpha,\delta\},\{\beta,\delta\}\in\mathcal{P}_i. This means that α,β∈fi(δ)=X\alpha,\beta\in f_i(\delta)=X. But XX is a free set with respect to fi↾δf_i\mathbin{\upharpoonright}\delta, and β∈X\beta\in X, hence fi(β)∩X=∅f_i(\beta)\cap X=\varnothing. Since α∈X\alpha\in X one concludes that α∉fi(β)\alpha\notin f_i(\beta). Therefore, c(α,β)≠ic(\alpha,\beta)\neq i.

Secondly, we argue that there is no 00-monochromatic subset of λ+\lambda^{+} of size λ+\lambda^{+}. To see this, fix A∈[λ+]λ+A\in[\lambda^{+}]^{\lambda^{+}}. Choose an ordinal η∈λ+\eta\in\lambda^{+} such that Tη⊆AT_\eta\subseteq A. If ξ>η\xi>\eta and ξ>sup⁡(Tη)\xi>\sup(T_\eta) then, by definition, Tη∈SξT_\eta\in S_\xi. Since AA is unbounded in λ+\lambda^{+}, one can choose ξ>η,sup⁡(Tη)\xi>\eta,\sup(T_\eta) such that ξ∈A\xi\in A. Recall that we had a partition Sξ=⋃{Sξi∣1≤i∈θ}S_\xi=\bigcup\{S_\xi^i\mid1\leq i\in\theta\}, hence Tη∈SξiT_\eta\in S_\xi^i for some i∈(0,θ)i\in(0,\theta). By the choice of fi(ξ)f_i(\xi) we know that Tη∩fi(ξ)≠∅T_\eta\cap f_i(\xi)\neq\varnothing, so one can choose α∈Tη∩fi(ξ)\alpha\in T_\eta\cap f_i(\xi). The fact that α∈fi(ξ)\alpha\in f_i(\xi) implies that {α,ξ}∈Pi\{\alpha,\xi\}\in\mathcal{P}_i. Hence c(α,ξ)≠0c(\alpha,\xi)\neq0. Since α∈Tη⊆A\alpha\in T_\eta\subseteq A and ξ∈A\xi\in A, one concludes that c‘‘[A]2≠{0}c``[A]^2\neq\{0\}, so we are done.

We would like to emphasize an important aspect of the proof. The size of each TηT_\eta is λ\lambda, as our guessing principle is ♣(λ)=♣(λ,λ+)\clubsuit(\lambda)=\clubsuit(\lambda,\lambda^{+}). simpler if we could replace ∙ ⁣∣(λ)\mathord{\bullet\!\mid}(\lambda) by ∙ ⁣∣(κ,λ+)\mathord{\bullet\!\mid}(\kappa,\lambda^{+}) or by ♣κSλ+\clubsuit_{\kappa}^{S_{\lambda^{+}}} for some κ<λ\kappa<\lambda. One should ask, therefore, whether ∙ ⁣∣(λ)\mathord{\bullet\!\mid}(\lambda) is essential for the combinatorial proof above. To wit, one should ask why do we insist on guessing sets of size λ\lambda. The point lies in Lemma 3.2. In order to find a free set XX that meets every EαE_{\alpha}, one must verify that EαE_{\alpha} is sufficiently large. In the context of our proof, one needs ∣Tη∣>κi\lvert T_{\eta}\rvert>\kappa_i for some relevant κi<λ\kappa_i<\lambda, where TηT_{\eta} plays the role of EαE_{\alpha} within the proof of the theorem. However, we do not know in advance the identity of κi\kappa_i, and it might appear as any κi\kappa_i in the sequence (κi∣i∈θ)(\kappa_i\mid i\in\theta). It seems that the only way to cope with this problem is by taking the TηT_{\eta}s to be of cardinality λ\lambda.

Though we do not know how to force ∙ ⁣∣(λ)\mathord{\bullet\!\mid}(\lambda) with the failure of SCH at λ\lambda, we can describe a possible strategy towards this goal. Let λ\lambda be a supercompact cardinal and let U\mathcal{U} be a normal ultrafilter over λ\lambda. One says that Gal⁡(U,λ+,λ+)\operatorname{Gal}(\mathcal{U},\lambda^{+},\lambda^{+}) holds every family {Aα∣α∈λ}⊆U\{A_{\alpha}\mid\alpha\in\lambda\}\subseteq\mathcal{U} contains a subfamily {Aαi∣i∈λ+}\{A_{\alpha_i}\mid i\in\lambda^{+}\} so that ⋂i∈λ+Aαi∈U\bigcap_{i\in\lambda^{+}}A_{\alpha_i}\in\mathcal{U}. One can force such an ultrafilter over a supercompact cardinal λ\lambda, see e.g. [3]. If one forces Prikry through such an ultrafilter then every new set of size λ+\lambda^{+} in the Prikry generic extension contains an old set of size λ+\lambda^{+}. Thus if stick or tiltan hold at λ+\lambda^{+} in the ground model, this will be preserved in the generic extension. Moreover, this is true for a variety of Prikry-type forcing notions, including Prikry forcing with interleaved collapses. There are also several ways to force stick or tiltan at a supercompact cardinal λ\lambda while increasing 2λ2^{\lambda} above λ+\lambda^{+}. We do not know, however, to force these two things together:

Question 3.4. Is it consistent that λ\lambda is supercompact, U\mathcal{U} is a normal ultrafilter over λ\lambda satisfying Gal⁡(U,λ+,λ+)\operatorname{Gal}(\mathcal{U},\lambda^{+},\lambda^{+}), ∙ ⁣∣(λ)\mathord{\bullet\!\mid}(\lambda) holds and 2λ>λ+2^{\lambda}>\lambda^{+}?

References

Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem 91904, Israel

Email address: [email protected]

Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem 91904, Israel

Email address: [email protected]

Institute of Mathematics The Hebrew University of Jerusalem, Jerusalem 91904, Israel and Department of Mathematics Rutgers University New Brunswick, NJ 08854, USA

Email address: [email protected]

URL: http://www.math.rutgers.edu/~shelah

References

  1. [1]Uri Abraham and Menachem Magidor. Cardinal arithmetic. In Handbook of set theory. Vols. 1, 2, 3, pages 1149–1227. Springer, Dordrecht, 2010.DOI
  2. [2]Hosea Ben Be’eri. The book of Hosea. In Prophets. 727 B.C.E.
  3. [3]Tom Benhamou, Shimon Garti, and Alejandro Poveda. Negating the Galvin property. J. Lond. Math. Soc. (2), 108(1):190–237, 2023.
  4. [4]Maxim R. Burke and Menachem Magidor. Shelah’s pcf theory and its applications. Ann. Pure Appl. Logic, 50(3):207–254, 1990.
  5. [5]William Chen, Shimon Garti, and Thilo Weinert. Cardinal characteristics of the continuum and partitions. Israel J. Math., 235(1):13–38, 2020.DOI
  6. [6]P. Erdős and A. Hajnal. Unsolved problems in set theory. In Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967), pages 17–48. Amer. Math. Soc., Providence, R.I., 1971.DOI
  7. [7]Paul Erdős, András Hajnal, Attila Máté, and Richard Rado. Combinatorial set theory: partition relations for cardinals, volume 106 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 1984.
  8. [8]P. Erdős, A. Hajnal, and R. Rado. Partition relations for cardinal numbers. Acta Math. Acad. Sci. Hungar., 16:93–196, 1965.DOI
  9. [9]Moti Gitik. The negation of the singular cardinal hypothesis from o(κ) = κ⁺⁺. Ann. Pure Appl. Logic, 43(3):209–231, 1989.
  10. [10]Moti Gitik. The strength of the failure of the singular cardinal hypothesis. Ann. Pure Appl. Logic, 51(3):215–240, 1991.
  11. [11]Moti Gitik. Prikry-type forcings. In Handbook of set theory. Vols. 1, 2, 3, pages 1351–1447. Springer, Dordrecht, 2010.DOI
  12. [12]Shimon Garti and Saharon Shelah. A strong polarized relation. J. Symbolic Logic, 77(3):766–776, 2012.DOI
  13. [13]Yair Hayut. Prikry type forcings and the Bukovský-Dehornoy phenomena. preprint, 2023.
  14. [14]András Hajnal and Attila Máté. Set mappings, partitions, and chromatic numbers. In Logic Colloquium ’73 (Bristol, 1973), volume Vol. 80 of Stud. Logic Found. Math., pages 347–379. North-Holland, Amsterdam-Oxford, 1975.DOI
  15. [15]Péter Komjáth. The Erdos-Hajnal problem list. Bull. Symbolic Logic, page To appear, 2025.DOI
  16. [16]Richard Laver. Making the supercompactness of κ indestructible under κ-directed closed forcing. Israel J. Math., 29(4):385–388, 1978.
  17. [17]Menachem Magidor. On the singular cardinals problem. I. Israel J. Math., 28(1-2):1–31, 1977.DOI
  18. [18]Menachem Magidor. On the singular cardinals problem. II. Ann. of Math. (2), 106(3):517–547, 1977.DOI
  19. [19]Carmi Merimovich. Mathias like criterion for the extender based Prikry forcing. Ann. Pure Appl. Logic, 172(9):Paper No. 102994, 6, 2021.
  20. [20]A. J. J. Ostaszewski. On countably compact, perfectly normal spaces. J. London Math. Soc. (2), 14(3):505–516, 1976.
  21. [21]Saharon Shelah. Cardinal arithmetic, volume 29 of Oxford Logic Guides. The Clarendon Press, Oxford University Press, New York, 1994. Oxford Science Publications.

Paper details

vlnc:W_vqt2a6hu

published ·

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents