×

Some higher-gap examples in combinatorial set theory. (English) Zbl 0646.03046

The authors prove the consistency of several combinatorial statements, by forcing arguments using standard cardinal collapsing. Let \(\neg SC(\kappa\) \(+)\) be the statement: there exists a sequence of functions \(<\phi_{\xi};\xi <\kappa\) \(+>\) with \(\phi_{\xi}: \xi \to | \xi |\), one-to-one, such that for all \(X\in [\kappa\) \(+]^{\omega_ 1}\) and \(\alpha <\omega_ 1\) there is \(\xi\in X\) with \(tp \phi_{\xi ''}(X\cap \xi)\geq \alpha.\) Let \(H_ n(\kappa)\) be the statement: there exists a function F: [\(\kappa\) ] \(n\to [[\kappa]^{\aleph_ 0}]^{\leq \aleph_ 0}\) such that \(\forall A\in dom(F)(\cup F(A)\subseteq \cap A)\) and \[ \forall \alpha <\omega_ 1\quad \forall X\in [\kappa]^{\omega_ 1}\quad \exists A\in [X]\quad n\quad \exists Y\subseteq X\quad (Y\in F(A)\wedge tp Y\geq \alpha). \] Amongst the consistency results obtained are the following. Theorem 1: If the existence of a Mahlo cardinal is consistent, then \(ZFC+GCH\) is consistent with \(\neg SC(\kappa\) \(+)\) for every \(\kappa\). Theorem 3: If the existence of an \(\omega\)-Mahlo cardinal is consistent, then \(ZFC+GCH\) is consistent with \(\forall n<\omega H_{n+1}(\omega_{n+1})\). Theorem 7: If the existence of an \(\omega\)-Mahlo cardinal is consistent, then \(ZFC+GCH\) is consistent with the negative partition relation \(\omega_{n+1}\nrightarrow [\omega +n+2,(\omega_ 1)_{\aleph_ 1}]^{n+2}\) \((n<\omega)\). These results are applied to prove the consistency of several old conjectures, for instance the existence of a set mapping of type \(n+2\) on \(\omega_{n+1}\) without a free set of size \(\omega_ 1\), and a conjecture on Ramsey games of A. Hajnal and Zs. Nagy [Trans. Am. Math. Soc. 284, 815-827 (1984; Zbl 0551.03034)].
Reviewer: N.H.Williams

MSC:

03E35 Consistency and independence results
03E05 Other combinatorial set theory

Citations:

Zbl 0551.03034
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Baumgartner, J.; Galvin, F.; McKenzie, R.; Laver, R., Game theoretic versions of partition relations, (Hajnal, A.; etal., Infinite and Finite Sets. Infinite and Finite Sets, Coll. Math. Soc. János Bolyai, 10 (1973), North-Holland: North-Holland Amsterdam), 131-135 · Zbl 0307.90097
[2] Burgess, J. P., On a set-mapping problem of Hajnal and Máté, Acta Sci. Math. Szeged, 41, 283-288 (1979) · Zbl 0377.04009
[3] Devlin, K. J.; Paris, J. B., More on the free subset problem, Ann. Math. Logic, 5, 327-336 (1973) · Zbl 0279.02052
[4] Erdös, P.; Fodor, G.; Hajnal, A., On the structure of inner set-mappings, Acta Sci. Math. Szeged, 20, 81-90 (1959) · Zbl 0094.03204
[5] Erdös, P.; Hajnal, A., On the structure of set-mappings, Acta Math. Acad. Sci. Hung., 9, 111-131 (1958) · Zbl 0102.28401
[6] Erdös, P.; Hajnal, A., Unsolved problems in set theory, (Proc. Symposia in Pure Math., 13 (1971), AMS: AMS Providence, RI), 17-48
[7] Erdöis, P.; Hajnal, A.; Máté, A.; Rado, R., Combinatorial Set Theory, (Studies in Logic, 106 (1984), North-Holland: North-Holland Amsterdam)
[8] Hajnal, A., Some results and problems in set theory, Acta Math. Acad. Sci. Hung., 11, 277-298 (1960) · Zbl 0106.00901
[9] Hajnal, A.; Máté, A., Set mappings, partitions, and chromatic numbers, (Rose, H. E.; Shepherdson, J. C., Logic Colloquium ’73 (1975), North-Holland: North-Holland Amsterdam), 347-379
[10] Hajnal, A.; Nagy, Zs., Ramsey games, Trans Amer. Math. Soc., 284, 815-827 (1984) · Zbl 0551.03034
[11] Todorčević, S., Trees, subtrees and order types, Ann. Math. Logic, 20, 233-268 (1981) · Zbl 0469.03036
[12] Todorčević, S., Aronszajn trees and partitions, Israel J. Math., 52, 53-58 (1985) · Zbl 0592.03036
[13] S. Todorčević, Partitioning pairs of countable ordinals, to appear.; S. Todorčević, Partitioning pairs of countable ordinals, to appear.
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.