×

An almost strong relation. (English) Zbl 1541.03137

The paper is about polarized partition relations of the form \(\binom{\lambda}{\kappa}\to\binom{\lambda}{\kappa}_\theta\) where this means the following. For every map \(c:\lambda\times\kappa\to\theta\) there exist sets \(A\in[\lambda]^{\lambda}\) and \(B\in[\kappa]^{\kappa}\) and an ordinal \(i\in\theta\) such that the direct image \(c[A\times B]=\{i\}\). This relation is called strong, and the following \(\binom{\lambda}{\kappa}\to\binom{\tau}{\kappa}_\theta\), is almost strong, where this relation assures that for every map \(c:\lambda\times\kappa\to\theta\) and any ordinal \(\tau<\lambda\), there are sets \(A\subseteq\lambda\) and \(B\subseteq{\kappa}\) and an ordinal \(i<\theta\) such that \(c[A\times B]=\{i\}\), where \(\operatorname{otp}(A)=\tau\), \(\operatorname{otp}(B)=\kappa\). The aim of the paper is to obtain the almost strong relation for limit singular cardinals, which generalizes previous results of P. Erdős et al. [Acta Math. Acad. Sci. Hung. 16, 93–196 (1965; Zbl 0158.26603)] and S. Shelah [Fundam. Math. 155, No. 2, 153–160 (1998; Zbl 0897.03050)]. While those improvements would be enough to justify the publication of this work, the authors develop a novel and amazing method using pcf theory to construct the main tool to prove their results.
Let us first review previous achievements. Erdős, Hajnal, Rado [loc. cit.] have proved \(\binom{\mu^+}{\mu}\to\binom{\mu}{\mu}_2\) when \(\operatorname{cf}(\mu)=\omega\). In the paper under review, the authors show the same relation but they increase the order type of the first coordinate, that is, \(\operatorname{otp}(A)=\tau\) for every \(\tau<\mu^+\). On the other hand, Shelah shows that \(\binom{\mu^+}{\mu}\to\binom{\mu+1}{\mu}_{<\operatorname{cf}(\mu)}\) whenever \(\mu>\operatorname{cf}(\mu)>\omega\), \(\mu\) is a strong limit and \(2^\mu>\mu^+\). The authors reach the same result replacing \(\mu+1\) by any ordinal \(\tau<\mu^+\) for singular cardinals of cofinality \(>\omega\) and \(2^\mu>\mu^+\).
In order to prove the mentioned results, the authors introduce the notion of an pcf array of elementary submodels, which is a matrix \((M_{\alpha i}:\alpha<\lambda, i<\kappa)\). Every model is an elementary substructure of \(H_\eta\) for \(\eta\) big enough, the rows are increasing elementary chains, the columns are also increasing elementary chains but only when \(i\) does not belongs to some \(u\in J\), where \(J\) is an ideal containing the ideal of bounded subsets of \(\kappa\). There exists a sequence \(l=(\lambda_i:i<\kappa)\), with \(\mu=\bigcup_{i<\kappa}\lambda_i\) and \(\kappa=\operatorname{cf}(\mu)\). Moreover, \(|M_{\alpha i}|<\lambda_i\), where \(\mu<\lambda<\operatorname{tcf}\left(\prod_{i<\kappa}\lambda_i,J\right)\). We are not going into the details of the pcf constructions and related notions (detailed explanations can be read in the article).
Given such a matrix \(\mathcal{M}\), for every \(\alpha<\lambda\), \(i<\kappa\) let \(f_\alpha(i)=\sup(M_{\alpha i}\cap \lambda_i)\). Each \(f_\alpha\) is called the characteristic function of \(\mathcal{M}\) at stage \(\alpha\) and \((f_\alpha:\alpha<\lambda)\) is the characteristic sequence. As a consequence of pcf theory, there is a function \(h\in\prod_{i<\kappa}\lambda_i\) which bounds the sequence. Under certain hypotheses, the authors manage to construct such an array \(\mathcal{M}\), which is the key to prove the above mentioned results.
In some sense, the matrix works as some kind of morass, but outside of \(V=L\).

MSC:

03E02 Partition relations
03E04 Ordered sets and their cofinalities; pcf theory
03E10 Ordinal and cardinal numbers
03C55 Set-theoretic model theory
03E05 Other combinatorial set theory

References:

[1] Uri Abraham and Menachem Magidor. Cardinal arithmetic. In Handbook of set theory. Vols. 1, 2, 3, pages 1149-1227. Springer, Dordrecht, 2010. · Zbl 1198.03053
[2] Maxim R. Burke and Menachem Magidor. Shelah’s pcf theory and its appli-cations. Ann. Pure Appl. Logic 50 (1990), 207-254. · Zbl 0713.03024
[3] P. Erdös, A. Hajnal, and R. Rado. Partition relations for cardinal numbers. Acta Math. Acad. Sci. Hungar. 16 (1965), 93-196. · Zbl 0158.26603
[4] Shimon Garti. Unbalanced polarized relations. Proc. Amer. Math. Soc. 149 (2021), 1281-1287. · Zbl 1491.03034
[5] Shimon Garti, Menachem Magidor, and Saharon Shelah. Infinite monochro-matic paths and a theorem of Erdös-Hajnal-Rado. Electron. J. Combin. 27 (2020), Paper No. 2.8, 11 p. · Zbl 1439.05085
[6] Shimon Garti and Saharon Shelah. A strong polarized relation. J. Symbolic Logic 77 (2012), 766-776. · Zbl 1270.03076
[7] Moti Gitik and Saharon Shelah. Applications of pcf for mild large cardinals to elementary embeddings. Ann. Pure Appl. Logic 164 (2013), 855-865. · Zbl 1323.03070
[8] Shimon Garti and Saharon Shelah. Open and solved problems concerning polarized partition relations. Fund. Math. 234 (2016), 1-14. · Zbl 1522.03181
[9] András Hajnal and Jean A. Larson. Partition relations. In Handbook of set theory. Vols. 1, 2, 3, pages 129-213. Springer, Dordrecht, 2010. · Zbl 1198.03048
[10] Albin L. Jones. A polarized partition relation for cardinals of countable cofi-nality. Proc. Amer. Math. Soc. 136 (2008), 1445-1449. · Zbl 1137.03028
[11] Menachem Kojman. A proof of Shelah’s partition theorem. Arch. Math. Logic 34 (1995), 263-268. · Zbl 0839.03032
[12] Saharon Shelah. Cardinal arithmetic, volume 29 of Oxford Logic Guides. The Clarendon Press, Oxford University Press, New York, 1994. Oxford Science Publications. · Zbl 0848.03025
[13] Saharon Shelah. A polarized partition relation and failure of GCH at singu-lar strong limit. Fund. Math. 155 (1998),153-160. · Zbl 0897.03050
[14] Neil H. Williams. Combinatorial set theory, Studies in Logic and the Foundations of Mathematics 91. North-Holland Publishing Co., Amsterdam, 1977. · Zbl 0362.04008
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.