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.
Hello all! This is the topic for Joe Moeller's talk, "The monoidal Grothendieck construction".
Zoom meeting:
https://mit.zoom.us/j/280120646
Meeting ID: 280 120 646
Youtube live stream:
https://youtu.be/aznXYbEmWo8
One thing: we would like to test breakout rooms after the talk. If you are on Zoom and would like to take part, stay online after the talk is over. Otherwise, of course feel free to leave.
Date and time: Thursday April 23rd, 12 noon EDT (Boston time).
Hi! We start in 2 minutes.
30 seconds
It's not obvious to me that the output of the grothendiek construction is small in general
I assume the used to represent this construction is some kind of end or coend? I don't have great intuition for ends, but this seems like a nice example
I don't think it is an end or coend...just a coincidence of notation.
I think I remember reading that it's not quite (but it does look kinda like an end)
Brian Pinsky said:
It's not obvious to me that the output of the grothendiek construction is small in general
You can use the fact that a locally small category with a small set of objects is small.
If you have a functor C^op -> Cat, where C is small and Cat is the category of small categories, then the Grothendieck construction is still locally small (can you see why?). It is also small, because its set of objects is a disjoint union of small sets indexed over a small set (the objects of C).
Brian Pinsky said:
I assume the used to represent this construction is some kind of end or coend? I don't have great intuition for ends, but this seems like a nice example
Both the Grothendieck construction and coends are written as integrals because they both look like an "area under the curve", but they are not an example of one another, as far as I've seen. Yeah, this is unfortunate.
okay thanks
Brian Pinsky said:
I assume the used to represent this construction is some kind of end or coend? I don't have great intuition for ends, but this seems like a nice example
In fact, the Grothendieck construction is a kind of coend using the coslice (or slice) construction. Given F:C-->Cat, the Grothendieck category of F is equivalent to the coend
Oh wow, cool!
DARPA... search+rescue is search+destroy in the opposite category?
I usually join over youtube live not zoom (it works better on my TV). Are these breakout rooms going to be a common feature in afterwards? I can connect over zoom instead.
The category of elements is described as a coend in The Coend Calculus https://arxiv.org/pdf/1501.02503.pdf, 4.2.2. Then after some generalizations, in 7.3.4 they jump all the way to the case...
I haven't read the lax coend stuff, but I assume that for the Grothendieck construction you just need a slight weakening to pseudo-coends. Luckily it's still the same formula, and you can get the intuition from the category of elements.
Brian Pinsky said:
I usually join over youtube live not zoom (it works better on my TV). Are these breakout rooms going to be a common feature in afterwards? I can connect over zoom instead.
It depends - let's see how the testing goes :)
That's also nice because it's a case of nerve and realization -- you could call the Grothendieck construction the "slice realization". This means it has an adjoint, the "slice nerve", that turns a category into an indexed category .
what unfortunate constructions of morphisms. there's rescue without search, and search without destroy (miss is frequent irl).
Jules Hedges said:
DARPA... search+rescue is search+destroy in the opposite category?
Unfortunately I found out later they snuck in an when I wasn't looking -__-
But that's why I ended up quitting the project.
Here are my slides: https://joemathjoe.files.wordpress.com/2020/04/mit_seminar_talk.pdf
In the spirit of "why don't they build the whole airplane out of the black box" given the equivalence between fibrations and indexed categories, and given that indexed categories are easier to present (in terms of having fewer conditions), why don't we always just do that?
That is my preference, and I think that's what is done much of the time. Dependent function types I think are basically the same as indexed categories, right?
But fibrations are sometimes the more natural thing to consider, eg graphs over sets.
Another thing, you can compose fibrations in an obvious way, I don't think it's at all easy to see how you would compose indexed categories, or even when they're composable.
Hi all! Here's the video. https://youtu.be/DDECeQaGwYs
Gershom said:
In the spirit of "why don't they build the whole airplane out of the black box" given the equivalence between fibrations and indexed categories, and given that indexed categories are easier to present (in terms of having fewer conditions), why don't we always just do that?
This is a fun question, so it's good to think about a decategorified version of this function. Given the equivalence between isomorphism classes of monos into and characteristic functions , and given that characteristic functions are easier to present (in terms of having fewer conditions), why don't we always just do that?
Of course in material set theory we describe an isomorphism class of monos into as a "subset" of , which simplifies things, but even without this trick I think both approaches would be useful.
Gershom said:
In the spirit of "why don't they build the whole airplane out of the black box" given the equivalence between fibrations and indexed categories, and given that indexed categories are easier to present (in terms of having fewer conditions), why don't we always just do that?
I agree, I find them easier to present that way, but anyone who wants to opine about these things had better be aware of Bénabou's notorious essay on the subject. He does make some interesting points. For example, it's easy to prove that a composite of fibrations is a fibration. He says: now try proving that using indexed categories! He also has some worthwhile remarks on the notion of definability.
As John said, I don't think it should be regarded as a choice to make between the two, but rather that the flexibility of having two presentations of the same thing is a useful tool. In between monos and fibrations we have the notion of an I-indexed family of sets that can be described as a function or as a function , and both versions are useful.
Joe Moeller said:
But that's why I ended up quitting the project.
I'd be interested to hear your thoughts on this in detail (but possibly not right here)