Searcharxiv⌕ Search

arXiv subjects

J. Rosický

Publications and source records attributed to J. Rosický.

5 recordsLinked to original sources

Colimit-Dense Subcategories

Among cocomplete categories, the locally presentable ones can be defined as those with a strong generator consisting of presentable objects. Assuming Vop{ě}nka's Principle, we prove that a cocomplete category is locally presentable iff it has a colimit dense subcategory and a generator consisting of presentable objects. We further show that a $3$-element set is colimit-dense in $\Set^{\op}$, and spaces of countable dimension are colimit-dense in $\Vec^{op}$.

math.CT↗

Small presentations of model categories and Vopěnka's principle

We prove existence results for small presentations of model categories generalizing a theorem of D. Dugger from combinatorial model categories to more general model categories. Some of these results are shown under the assumption of Vopěnka's principle. Our main theorem applies in particular to cofibrantly generated model categories where the domains of the generating cofibrations satisfy a slightly stronger smallness condition. As a consequence, assuming Vopěnka's principle, such a cofibrantly generated model category is Quillen equivalent to a combinatorial model category. Moreover, if there are generating sets which consist of presentable objects, then the same conclusion holds without the assumption of Vopěnka's principle. We also correct a mistake from previous work that made similar claims.

math.AT↗

Limits of abstract elementary classes

We show that the category of abstract elementary classes (AECs) and concrete functors is closed under constructions of "limit type," which generalizes the approach of Mariano, Zambrano and Villaveces away from the syntactically oriented framework of institutions. Moreover, we provide a broader view of this closure phenomenon, considering a variety of categories of accessible categories with additional structure, and relaxing the assumption that the morphisms be concrete functors.

math.LO↗

The accessibility rank of weak equivalences

We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak equivalences between simplicial sets is finitely accessible.

math.AT↗

Cellular categories

We study locally presentable categories equipped with a cofibrantly generated weak factorization system. Our main result is that these categories are closed under 2-limits, in particular under pseudopullbacks. We give applications to deconstructible classes in Grothendieck categories. We discuss pseudopullbacks of combinatorial model categories.

math.CT↗