Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: theory: category theory

Topic: explicit factorizations in 2Cat


view this post on Zulip Daniel Teixeira (Mar 27 2024 at 17:30):

In the canonical model category Cat we can get a very explicit description of the factorization systems (CofW,Fib(\text{Cof}\cap W,\text{Fib} and Cof,FibW\text{Cof},\text{Fib}\cap W (in e.g. Rezk's note on the model structure). Is there anything like this for the Lack model structure in 2Cat?

view this post on Zulip Kevin Carlson (aka Arlin) (Mar 27 2024 at 18:01):

Lack does most of this in the original paper. Fibrations are equiv-fibrations, equivalences are bi-equivalences, cofibrant objects are exactly those with free underlying category. Cofibrations don't get quite as an explicit characterization as isocofibrations do in the case of Cat; they're maps whose underlying functor lifts against full+surjective-on-objects functors, though, which is at least better than what you get straight from the construction of the model structure.

view this post on Zulip Daniel Teixeira (Mar 27 2024 at 19:40):

I mean given a 2-functor FF between 2-categories, an explicit description of the factorization as e.g. a trivial cofibration followed by a fibration

view this post on Zulip Daniel Teixeira (Mar 27 2024 at 19:41):

Lack's papers don't do that because, as with most model categories, his argument factors through some stronger result

view this post on Zulip Daniel Teixeira (Mar 27 2024 at 19:45):

But for instance, given any functor F:CDF:C\to D between categories, an explicit factorization is given as follows. Let C^\hat C be the categories whose objects are tuples (c,d,f:Fcd(c,d,f:Fc\to d, where ff is an isomorphism, the hom-set between (c,d,f)(c,d,f) and (c,d,f)(c',d',f') is homC(c,c)\hom_C(c,c'). Define G:CC^G:C\to \hat C by sending cc to (c,Fc,idFc(c,Fc,\text{id}_{Fc}, and H:C^DH:\hat C\to D by sending (c,d,f)(c,d,f) to dd. Then you can check that F=HGF = H\circ G, that GG is a trivial cofibration (equivalence surjective on objects)< and that HH is an isofibration.

view this post on Zulip Daniel Teixeira (Mar 27 2024 at 19:48):

I was wondering if we have something similar for 2Cat, but calculations with my colleague are suggesting that the obvious generalization doesn't work.

(The obvious generalization starts with a 2-functor F:CDF:C\to D and C^\hat C is defined as the 2-category which has (c,d,(f,g,ε,η))(c,d, (f,g,\varepsilon,\eta)) as objects, where (f,g,ε,η) (f,g,\varepsilon,\eta) is adjoint equivalence data between FcFc and dd)