Paperlane

no. 14 · Friday 13 November 2026

Covering numbers and pcf theory

Todd Eisworth

math.LO

Abstract

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.

comments
First public version
fields
Logic
pdf ↗ page arXiv:2611.17157 ↗