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

Abstract

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($ω_n$ for $2 \le n<ω$, $\aleph_{ω+1}$, $\aleph_{ω^2+1}$, 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&#39;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, Whitehead&#39;s Conjecture, Kaplansky&#39;s Conjecture, and Baumagartner&#39;s Axiom, are independent from some of the strongest forms of compactness at $ω_2$. Additionally, we observe that Rado&#39;s Conjecture plus $2^ω= ω_2$ is consistent with the negative solutions of some of these conjectures (as they hold in $V = L$), verifying that they hold in suitable Mitchell models. Finally, we comment on whether the compactness principles under discussion are good candidates for axioms. We consider their consequences and the existence or non-existence of convincing unifications (such as Martin&#39;s Maximum or Rado&#39;s Conjecture). This part is a modest follow-up to the articles by Foreman ``Generic large cardinals: new axioms for mathematics?&#39;&#39; (1998) and Feferman et al. ``Does mathematics need new axioms?&#39;&#39; (2000).