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.
I have a 2-limit i want to compute—but id also be interested in resources that explain how to compute things of this sort in general:
suppose we have a functor F : BG → C for a group G and category C, so G is acting on the object F(*) ∈ C. then we can compose with C's self-indexing C^op → Cat to get F' : BG^op → Cat (even if C doesnt have pullbacks in general, it will at least have these ones since we are pulling back along isomorphisms). we can make this a strict functor even, by defining pullback along F(g) as composition with F(g⁻¹).
now i want to know: what's the 2-limit of F' like? (i think the ordinary 1-limit is gonna be something like the slice over the limit of F)
i want to guess the objects are gonna be something like families of objects over F(*) coherently connected by isomorphisms between pullbacks—some kind of cocycley thing
ooh i just realized this has something to do with galois shit, found some relevant-looking stuff googling
Did you work it out? My guess is the category of "equivariant -objects over the -object ", i.e., the slice category .
did you mean something like ? and no i havent worked it out yet exactly
No, I mean an object of with a -action and a map which is equivariant for the -actions.
But I didn't work it out exactly either
The construction of the 2-limit of a pseudofunctor F : I -> Cat is pretty simple: an object consists of
You can read this off from the definition of a limit by considering what it means to give a cone with vertex the "walking object" category .
okay, ive glanced at this but im gonna need to think it thru properly later
ty!
wait, this is the weak 2-limit and not the strict 2-limit, right?
Yes, otherwise you would have equalities instead of isomorphisms (and then no equations at the next stage)
Reid Barton said:
Did you work it out? My guess is the category of "equivariant -objects over the -object ", i.e., the slice category .
wait omg, i dont know how i misparsed this :face_palm:
of course F is an object of [BG, C]
i need to stop trying to do category theory on an empty stomach
riiiight okay
so ive chewed thru the fact that a 2-limit in Cat is gonna be given by the category of [weighted] 2-cones
and that this is like a weak version of image.png
and ive fiddled with what that looks like in this particular case & more or less confirmed that it should be what you described
thanks :)
neat, if C is a grothendieck topos then this 2-limit should be as well then, right?
Some related simpler stuff:
Let be the category with one object and the group as endomorphisms.
A functor is called a -set since it's a set with an action of as permutations of this set.
The limit of is the set of fixed points, . A more fancy name for it is , the zeroth cohomology of the group with the -set as coefficients. In group cohomology we can define for any integer and any abelian group on which acts, but for we don't need to be an abelian group and for it can just be a set.
Next we can boost this up a bit and consider a pseudofunctor , and look at the pseudolimit of .
galois descent time
actually, what source do i read if i want the coherence law to become obvious
i bet i could work out what it would have to be just ad-hoc, but how do i learn what the pattern is
You just draw some diagrams and you see what you need - that's much better.
hmm.
Anyway, let me just keep talking. Maybe I should write a huge block of text and post it all at once.
Now let's consider a pseudofunctor . This is a category on which has a 'weak' action: we don't demand , all we need is natural isomorphisms obeying the obvious coherence law that makes the two isomorphisms from to equal.
Also, we don't demand ; all we need is a natural isomorphism obeying some obvious coherence law. If is the identity we say is normalized, and I think it's pretty innocuous to impose this restriction.
Now we want to look at the pseudolimit or 'weak limit' of . This could be called the category of weak fixed points of , or homotopy fixed points.
Instead of objects such that equals , this category of weak fixed points will have, as objects, equipped with isomorphisms , obeying the obvious coherence law. This coherence law makes the two isomorphisms from to agree.
There will also be morphisms in the category of weak fixed points. One can again guess what these must be like, but the good news is that the pseudolimit of automatically spits out the answer.
To make contact with group cohomology, we can suppose is a one-object category. Since only isomorphisms matter in this game, there's no further loss of generality in assuming is a one-object groupoid, say for some group ... not necessarily abelian: I'm just using the letter since it's standard in group cohomology.
In this case will be just an action of on the group , as automorphisms.
Then we can look at the category of weak fixed points. The objects in here have a name: they are called 1-cocycles on , valued in . It's good to work out what they are explicitly. Two objects will be isomorphic if they are cohomologous: again one can work out what this means explicitly.
So, the set of isomorphism classes of weak fixed points, i.e. the decategorification of the pseudolimit of , is called the set of cohomology classes of 1-cocycles on , valued in , or for short.
It may seem sort of pathetic to limit our category to being for some group , but it's actually not, if all we care about is understanding the groupoid of weak fixed points of a pseudofunctor . We can reduce the case of a general groupoid to the case of (a bunch of) groupoids of the form . So, the traditional approach to this stuff, using group cohomology, is not as pathetic as it may seem... especially since people have gotten really good at actually computing things like .
But, the more modern approach in terms of pseudolimits is more conceptual: it explains what you're 'really doing'.
I'm done with my rant, @sarahzrf. There's nothing mystical about the coherence laws in this context: you just start drawing diagrams using your isomorphisms (like the or the above) and decree that you want them all to commute. You could just say they all commute! But if you look at a bunch, you'll see that a few simple diagrams imply all the rest.
hmmm, i dunno
if you take that naïve of an approach, you'd assume that all braided monoidal categories should be symmetric, wouldn't you?
but entirely aside from that, i guess like—i suppose, to draw an analogy...
A: where does associativity and unitality come from, in monoids? it's exactly what you need to make any word be unambiguous to parenthesize, right? what's up with that?
B: well, there's nothing mystical about them—try writing down some equations in a monoid and seeing which ones ought to be true, and you should be able to work out that you just need associativity and unitality.
...and indeed, A would be well-served by getting hands on like that—but also, eventually, the real answer is going to have to be about how monoids are algebras of the list monad.
it's true that i should probably spend some time drawing a ton of diagrams, but i would very much also like to hear something about why the diagrams i'm drawing are the ones they are
Yes, in that sense the coherences 'come from' presenting arbitrary length lists in terms of an empty list, singleton inclusion, and binary concatenation.
sarahzrf said:
if you take that naïve of an approach, you'd assume that all braided monoidal categories should be symmetric, wouldn't you?
Yes, you'd even assume they were better than symmetric: you'd assume the braiding of any object and itself,
is the identity!
So these coherence laws - the coherence laws for -tuply monoidal -categories - cannot be guessed simply by saying "all diagrams should commute".
But there are a certain bunch of coherence laws which secretly say some simplicial set is contractible, and when applied to 1-categories they amount to saying "every diagram commutes".
this might deserve to be its own thread, but i'm asking it here since it involves the same constructions as in this thread:
if F : BG → C has a colimit, is that colimit generally van Kampen?
im considering just working this out explicitly, cuz im having trouble finding much reference to this notion that i could check
im just procrastinating on it since it seems like a pain <.<
Based on the examples on that nLab page, colimits being van Kampen seems to be more a property of the category in which they're being taken than a property of the colimit's shape?
well, i think it's both
but true—i should give more context
first: im particularly interested in the case of topoi, or even just grothendieck topoi
second: im particularly interested in the case where the colimit "injection", the quotient map to the orbit space, is a split epi
...actually, does that situation have nice properties? i dont suppose thats an absolute colimit or anything?
like how split coequalizers are
ohhh hold on.... i was thinking about this presentation of the orbit space (EDIT: oh wait that's actually not quite the orbit space >_< but it's something quite closely related) as a reflexive coequalizer: image.png
and it now occurs to me that umm
maybe you can make an argument like... if the category is lextensive up to the cardinality of the group, then the coproduct there gets turned into a product of slices, and then if the coequalizer is split, you can use that to go the rest of the way on the same grounds as why split coequalizers are absolute
nice