Added redirects for Smith recognition theorem.

]]>Proof of Smith’s theorem: simplify last argument, avoiding the need of functorial factorizations.

Gábor Braun

]]>Proof of Smith’s theorem: correct the argument for the solution set condition. 1. Adjust choice of J such that it contains the P->R constructed through factorization. 2. Clarify that only morphisms I->W are claimed to factor through W_0. Adjust W_0 to ensure this. 3. Factor P->Q instead of L+P->Q.

Gábor Braun

]]>The paragraph about Dugger’s Theorem under Characterization Theorems just said that all combinatorial *simplicial* model categories have presentations. Looking at Dugger’s paper, he actually shows that *all* combinatorial model categories have presentations. He gives a separate, easier proof in the simplicial case, though. I edited to reflect this.

In combinatorial model category the line

This are corollaries 2.7 and 2..8 in Bar.

has a dead link. The reference to Barwick further down the page does not seem to correspond and Barwick’s homepage does not seem to have an article of that name. Does anyone have a live link for this?

]]>I have added to *combinatorial model category*, right after the proof of *Smith’s theorem*, two basic statemens useful for applying the theorem in the first place (that accessible full preimages of accessible full subcategories are accessible, and that the weak equivalences in a combinatorial model category form an accessibly included accessible full subcategory of the arrow category).

Also I have tried to stream-line the typesetting of the pointers to the references a bit more.

]]>I started adding details on the proof of Dugger’s theorem

]]>edited the list of basic examples slightly. Added the model structure for Cartesian fibrations as the $sSet_{Quillen}$-enriched replacement of the Joyal model structure

]]>am pleased to be able to say that I typed into the entry combinatorial model category now the complete and detailed proof of Smith's theorem.

Well, there is one point that might need attention: in the first part of the proof, where one shows that these diagrams may be factored, somehow the argument the way I present it looks (while being close) a bit simpler than what I see in the literature. I expect, however, that this is only because I am missing some subtlety. But I leave it the way it is for the moment.

]]>added

an Idea-section

added to combinatorial model category the statement and detailed proof (here) that in a combinatorial model cat a kappa-filtered colimit over a sufficiently large kappa is already a homotopy colimit.

]]>polished a bit and then created a separate section for Jeff Smith's theorem.

wanted to spell out the full proof there, but not yet

]]>added to combinatorial model category a reference (here) discussing that using a funny set-theoretic assumption about large cardinals, every cofibrantly generated mod cat is Quillen equivalent to a combinatorial one.

Weird that set-theory...

]]>