Covering numbers and pcf theory
We develop a general technique for deriving covering theorems from pcf-theoretic information by refining sequences of partitions. The method gives a direct proof of Shelah's cov vs. pp theorem and analogous results for diagonal coverings associated with normal ideals and covering modulo arbitrary $σ$-complete ideals, where $σ$ is regular and uncountable. In each setting, we characterize the covering invariant through pseudopowers, true cofinalities of reduced products of progressive sets, and appropriate notions of cofinality in (possible non-progressive) intervals of regular cardinals.
Authors
- Todd Eisworth (ORCID: https://orcid.org/0000-0003-4433-9463)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.17157
- Primary Topic
- Advanced Topology and Set Theory
- Type
- preprint