Compactness for small cardinals in mathematics: principles, consequences, and limitations
Radek Honzik

TL;DR
This paper explores compactness principles for uncountable structures at small regular cardinals, analyzing their consistency, preservation under forcing, and implications for set-theoretic conjectures and axioms.
Contribution
It provides a detailed analysis of the consistency and indestructibility of various compactness principles at small regular cardinals and their implications for major set-theoretic conjectures.
Findings
Many classical problems are independent from strong forms of compactness at 2.
Rado's Conjecture plus 2 is consistent with negative solutions of some conjectures.
Compactness principles may serve as potential axioms with significant consequences.
Abstract
We discuss some well-known compactness principles for uncountable structures of small regular sizes ( for , , , etc.), consistent from weakly compact (the size-restricted versions) or strongly compact or supercompact cardinals (the unrestricted versions). We divide the principles into logical principles (various tree properties) and mathematical principles, which directly postulate compactness for structures like groups, graphs, or topological spaces (for instance, countable chromatic and color compactness of graphs, compactness of abelian groups, -reflection, Fodor-type reflection principle, and Rado's Conjecture). We focus on indestructibility, or preservation, of these principles in forcing extensions. Using the existing preservation results we observe that many traditional problems such as Suslin Hypothesis,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
