Combinatorial model categories have presentations
Daniel Dugger (Purdue University)

TL;DR
This paper proves that all combinatorial model categories can be constructed from diagram categories of simplicial sets through localization, establishing that they have a presentation akin to generators and relations.
Contribution
It demonstrates that every combinatorial model category admits a presentation via localization of diagram categories, unifying their structure.
Findings
Every combinatorial model category can be obtained by localizing a diagram category of simplicial sets.
This provides a systematic way to understand and construct combinatorial model categories.
The result links combinatorial model categories to presentations similar to algebraic generators and relations.
Abstract
We show that every combinatorial model category can be obtained, up to Quillen equivalence, by localizing a model category of diagrams of simplicial sets. This says that any combinatorial model category can be built up from a category of `generators' and a set of `relations'---that is, any combinatorial model category has a presentation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Advanced Topics in Algebra · Algebraic structures and combinatorial models
