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.
nLab says that in a locally Cartesian closed category "pullbacks preserve all colimits". Does this mean , for all pullbacks and pushouts? There's some detail missing about the morphisms here, but it seems like the correspondence between morphisms might be an "obvious" one that can be explained by a few commutative diagrams.
Or am I misunderstanding :innocent:?
Yes, but you have to apply the functor to as well, so you get:
.
In the notation of the nLab article, would be the map , and then is the functor defined as .
Does this help?
Oh wow! Yes that helps. That equivalence looks so fun :stuck_out_tongue:, I wonder if there’s an intuitive explanation of what it “means” in term of sets and functions in Set...
Well it just means that inverse images preserve sums and quotients.
If you interpret pullback as base change (i.e. shifting from one over category regarded as a relative universe of discourse to another over category) then the stability of a property under pullback tells you something very strong about it - namely that it's 'absolute' or 'universal' (i.e. it doesn't depend on the base space over which you're working).
I meant something intuitive like how David Spivak explains pullbacks and pushouts in terms of his “ologs”. An explanation in terms of everyday concepts, rather than more math :smile:.
The “base change” perspective sounds interesting though. I need to read more into it. Is this discussed in simple terms in any books?
Hmm, I'm not sure about any simple books. I think the first step is convincing yourself that for a set , you have an equivalence of categories between the functor category and the slice category . This idea that you can parametrise in two different ways (forwards via indexing and backwards via preimages) is a pretty important one.
Its a pretty inocuous idea at first sight but leads to all kinds of interesting mathematics (like the Grothendieck construction on presheaves, fibred categories, stacks, etc...)
I suppose a good book for this kind of thing is 'Generic Figures and Their Glueings' which deals with simple examples of presheaf categories.
Ooh I haven’t heard of that book. I’ll check it out!
Interestingly I can’t find a single review or discussion of “Generic Figures and their Glueings” online. Seems to be open access though. Has anyone else read it? Is it a well-written book? 😇
I just finished a reading group on this book. We got to chapter 11 before deciding to stop because of summer and the following review (most opinions were shared):
The content of this book is nice to see as a first intro to topos theory because it has lots of examples and pictures that can convey intuition about presheaf toposes. However, it is presented in a very different way from the rest of the literature and no effort is made to make connections between their way and the standard way. While their way was relatively helpful for understanding the presheaf examples, I found it lost its edge when we arrived at more abstract stuff (adjoints and internal logic). Here are other issues that make the presentation so poor that I would not recommend reading it.
All in all, if you want to get comfortable working with presheaf categories, I could suggest to read the first 6 chapters and do the exercises and complete the proofs to do actual computations. If you are more interested in toposes in general, do not bother.
Oh wow! Thank you for that detailed review! I’ll treat the book with caution then. I’ll probably explore the first few chapters as you suggest.
Nick Smith said:
nLab says that in a locally Cartesian closed category "pullbacks preserve all colimits". Does this mean , for all pullbacks and pushouts?
That's not what it means, but it does imply some sort of isomorphism like that. (Jens fixed it.)
If you're trying to check this in the category of sets, it's easier to check that pullbacks preserve coproducts and coequalizers.... since you can build pushouts from coproducts and coequalizers.
I think a good way to understand this is via the equivalence : a set over is equivalent to a -indexed family of sets. Under this equivalence, the pullback functor is just reindexing, replacing a -indexed family of sets by an -indexed one . Now the fact that it preserves colimits follows from the fact that colimits in are pointwise.