Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-08T06:57:13.530Z Has data issue: false hasContentIssue false

KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS

Part of: Set theory

Published online by Cambridge University Press:  30 June 2022

CHRIS LAMBIE-HANSON
Affiliation:
INSTITUTE OF MATHEMATICS OF THE CZECH ACADEMY OF SCIENCES ŽITNÁ 25, 110 00 PRAGUE 1, CZECH REPUBLIC E-mail: lambiehanson@math.cas.cz URL: http://math.cas.cz/lambiehanson
ASSAF RINOT*
Affiliation:
DEPARTMENT OF MATHEMATICS BAR-ILAN UNIVERSITY RAMAT-GAN 5290002, ISRAEL URL: http://www.assafrinot.com
Rights & Permissions [Opens in a new window]

Abstract

We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta < \kappa $, the existence of a strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is a theorem of $\textsf{ZFC}$. Adding the requirement of subadditivity to a strongly unbounded coloring is a significant strengthening, though, and here we see that in many cases the existence of a subadditive strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is independent of $\textsf{ZFC}$. We connect the existence of subadditive strongly unbounded colorings with a number of other infinitary combinatorial principles, including the narrow system property, the existence of $\kappa $-Aronszajn trees with ascent paths, and square principles. In particular, we show that the existence of a closed, subadditive, strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is equivalent to a certain weak indexed square principle $\boxminus ^{\operatorname {\mathrm {ind}}}(\kappa , \theta )$. We conclude the paper with an application to the failure of the infinite productivity of $\kappa $-stationarily layered posets, answering a question of Cox.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic