Advertisement

Algebra universalis

, 79:90 | Cite as

Knaster and friends I: closed colorings and precalibers

  • Chris Lambie-Hanson
  • Assaf Rinot
Article

Abstract

The productivity of the \(\kappa \)-chain condition, where \(\kappa \) is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of \(\kappa \)-cc posets whose squares are not \(\kappa \)-cc were constructed by Laver, Galvin, Roitman and Fleissner. Later, \(\textsf {ZFC}\) examples were constructed by Todorcevic, Shelah, and others. The most difficult case, that in which \(\kappa = \aleph _2\), was resolved by Shelah in 1997. In this work, we obtain analogous results regarding the infinite productivity of strong chain conditions, such as the Knaster property. Among other results, for any successor cardinal \(\kappa \), we produce a \(\textsf {ZFC}\) example of a poset with precaliber \(\kappa \) whose \(\omega ^{\mathrm {th}}\) power is not \(\kappa \)-cc. To do so, we carry out a systematic study of colorings satisfying a strong unboundedness condition. We prove a number of results indicating circumstances under which such colorings exist, in particular focusing on cases in which these colorings are moreover closed.

Keywords

Knaster Precaliber Closed coloring Unbounded function Stationary reflection Square 

Mathematics Subject Classification

03E35 03E05 03E75 06E10 

Notes

Acknowledgements

The results of this paper were presented by the first author at the Set Theory, Model Theory and Applications conference in Eilat, April 2018, and at the SETTOP 2018 conference in Novi Sad, July 2018, and by the second author at the \(11^{\text {th}}\) Young Set Theory workshop in Lausanne, June 2018. We thank the organizers for the warm hospitality.

References

  1. 1.
    Brodsky, A.M., Rinot, A.: Distributive Aronszajn trees. Fund. Math. (2019). http://www.assafrinot.com/paper/29. Accepted March 2018
  2. 2.
    Cox, S., Lücke, P.: Characterizing large cardinals in terms of layered posets. Ann. Pure Appl. Logic 168, 1112–1131 (2017)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Eisworth, T.: Club-guessing, stationary reflection, and coloring theorems. Ann. Pure Appl. Logic 161, 1216–1243 (2010)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Eisworth, T., Shelah, S.: Successors of singular cardinals and coloring theorems II. J. Symb. Log. 74, 1287–1309 (2009)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Erdős, P., Hajnal, A., Rado, R.: Partition relations for cardinal numbers. Acta Math. Acad. Sci. Hung. 16, 93–196 (1965)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Fernandez-Breton, D., Rinot, A.: Strong failures of higher analogs of Hindman’s theorem. Trans. Am. Math. Soc. 369, 8939–8966 (2017)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Galvin, F.: Chain conditions and products. Fund. Math. 108, 33–48 (1980)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hoffman, D.J.: A Coloring Theorem for Inaccessible Cardinals. ProQuest LLC, Ann Arbor, MI (2013) [Thesis (Ph.D.)–Ohio University]Google Scholar
  9. 9.
    Inamdar, T.: An example of a non-existent forcing axiom (2017) (Unpublished note)Google Scholar
  10. 10.
    Lambie-Hanson, C., Lücke, P.: Squares, ascent paths, and chain conditions. J. Symb. Log. (2019). arXiv:1709.04537. Accepted August 2018
  11. 11.
    Laver, R., Shelah, S.: The \(\aleph _{2}\)-Souslin hypothesis. Trans. Am. Math. Soc. 264, 411–417 (1981)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Rinot, A.: A relative of the approachability ideal, diamond and non-saturation. J. Symb. Log. 75, 1035–1065 (2010)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Rinot, A.: Jensen’s diamond principle and its relatives. In: Set Theory and Its Applications, Contemp. Math., vol. 533, pp. 125–156. American Mathematics Society, Providence (2011)Google Scholar
  14. 14.
    Rinot, A.: Transforming rectangles into squares, with applications to strong colorings. Adv. Math. 231, 1085–1099 (2012)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Rinot, A.: Chain conditions of products, and weakly compact cardinals. Bull. Symb. Log. 20, 293–314 (2014)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Rinot, A., Schindler, R.: Square with built-in diamond-plus. J. Symb. Log. 82, 809–833 (2017)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Shelah, S.: A weak generalization of MA to higher cardinals. Isr. J. Math. 30, 297–306 (1978)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Shelah, S.: Successors of singulars, cofinalities of reduced products of cardinals and productivity of chain conditions. Isr. J. Math. 62, 213–256 (1988)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Shelah, S.: There are Jonsson algebras in many inaccessible cardinals. In: Cardinal Arithmetic. Oxford Logic Guides, vol. 29. Oxford University Press, Oxford (1994)Google Scholar
  20. 20.
    Shelah, S.: Colouring and non-productivity of \(\aleph _2\)-cc. Ann. Pure Appl. Logic 84, 153–174 (1997)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Shelah, S.: Diamonds. Proc. Am. Math. Soc. 138, 2151–2161 (2010)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Shelah, S., Stanley, L.: Generalized Martin’s axiom and Souslin’s hypothesis for higher cardinals. Isr. J. Math. 43, 225–236 (1982)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Tall, F.D.: Some applications of a generalized Martin’s axiom. Topol. Appl. 57, 215–248 (1994)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Todorcevic, S.: Partitioning pairs of countable ordinals. Acta Math. 159, 261–294 (1987)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Todorcevic, S.: Walks on Ordinals and Their Characteristics, Progress in Mathematics, vol. 263. Birkhäuser, Basel (2007)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of MathematicsBar-Ilan UniversityRamat GanIsrael
  2. 2.Department of Mathematics and Applied MathematicsVirginia Commonwealth UniversityRichmondUSA

Personalised recommendations