Combinatorial model categories have presentations
代数拓扑
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0007068,
title = {Combinatorial model categories have presentations},
author = {Daniel Dugger},
journal= {arXiv preprint arXiv:math/0007068},
year = {2007}
}