English

Covering properties and square principles

Logic 2016-05-05 v2

Abstract

Covering matrices were introduced by Viale in his proof that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. In the course of his work and in subsequent work with Sharon, he isolated two reflection principles, CP\mathrm{CP} and S\mathrm{S}, which may hold of covering matrices. In this paper, we continue previous work of the author investigating connections between failures of CP\mathrm{CP} and S\mathrm{S} and variations on Jensen's square principle. We prove that, for a regular cardinal λ>ω1\lambda > \omega_1, assuming large cardinals, (λ,2)\square(\lambda, 2) is consistent with CP(λ,θ)\mathrm{CP}(\lambda, \theta) for all θ\theta with θ+<λ\theta^+ < \lambda. We demonstrate how to force nice θ\theta-covering matrices for λ\lambda which fail to satisfy CP\mathrm{CP} and S\mathrm{S}. We investigate normal covering matrices, showing that, for a regular uncountable κ\kappa, κ\square_\kappa implies the existence of a normal ω\omega-covering matrix for κ+\kappa^+ but that cardinal arithmetic imposes limits on the existence of a normal θ\theta-covering matrix for κ+\kappa^+ when θ\theta is uncountable. We also investigate certain increasing sequences of functions which arise from covering matrices and from PCF-theoretic considerations and show that a stationary reflection hypothesis places limits on the behavior of these sequences.

Keywords

Cite

@article{arxiv.1510.05386,
  title  = {Covering properties and square principles},
  author = {Chris Lambie-Hanson},
  journal= {arXiv preprint arXiv:1510.05386},
  year   = {2016}
}

Comments

22 pages

R2 v1 2026-06-22T11:23:24.348Z