Fibrantly generated weak factorization systems
Sean Cox
Virginia Commonwealth University, Richmond, USAJiří Rosický
Masaryk University, Brno, Czechia
![Fibrantly generated weak factorization systems cover](/_next/image?url=https%3A%2F%2Fcontent.ems.press%2Fassets%2Fpublic%2Fimages%2Fserials%2Fcover-rsmup.png&w=3840&q=90)
Abstract
We prove that, assuming Vopěnka’s principle, every small projectivity class in an accessible category is accessible. This conclusion is not provable in ZFC alone, and in fact carries large cardinal strength.
Cite this article
Sean Cox, Jiří Rosický, Fibrantly generated weak factorization systems. Rend. Sem. Mat. Univ. Padova (2023), published online first
DOI 10.4171/RSMUP/135