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: learning: questions

Topic: Pullback-stable coproducts: morphisms?


view this post on Zulip Joey Eremondi (Nov 28 2023 at 12:14):

One of Giraud's axioms is that a topos has coproducts stable under pullback, e.g. f(A+B) is isomorphic to fA + f*B. But does this extend to morphisms?

e.g. for f : D -> C, a : A->C and b : B -> C, can we relate (fa,fb) and f*(a,b), where (_,_) is the universal arrow from the coproduct?

What I'm really looking for is to relate f* id = f* (inj1, inj2) and (f* inj1, f* inj2), but I'm curious if the relationship holds generally.

Do any references spell this out explicitly? Everything I've seen just says f* colim = colim f* or "base change functor preserves coproducts" but I've never seen it written out explicitly, and while I'm building the intuition for the abstract descriptions it's just not quite there yet.

view this post on Zulip Damiano Mazza (Nov 28 2023 at 14:16):

I don't know of any reference spelling it out explicitly, but it is true that in any extensive category (in particular, a topos) f[a,b]f^\ast[a,b] is the same as fa+fbf^\ast a+f^\ast b, where I denote by h+hh+h' the arrow [ι1h,ι2h]:X+XY+Y[\iota_1 h,\iota_2 h']:X+X'\to Y+Y' for any h:XYh:X\to Y, h:XYh':X'\to Y'.

(It is not true that f[a,b]f^\ast[a,b] is equal to [fa,fb][f^\ast a,f^\ast b] as the latter expression is not even well-typed: faf^\ast a has codomain AA, fbf^\ast b has codomain BB).

view this post on Zulip Damiano Mazza (Nov 28 2023 at 14:23):

The key point is that, in an extensive category, any arrow h:EA+Bh:E\to A+B is necessarily of the form h1+h2h_1+h_2 with h1:E1Ah_1:E_1\to A, h2:E2Bh_2:E_2\to B and X=X1+X2X=X_1+X_2. You use this to show that the commuting square [a,b](fa+fb)=f[af,bf][a,b](f^\ast a+f^\ast b)=f[a^\ast f,b^\ast f] is in fact a pullback.

view this post on Zulip Damiano Mazza (Nov 28 2023 at 14:23):

In the proof, you have two arrows h:EA+Bh:E\to A+B and k:EDk:E\to D such that [a,b]h=fk[a,b]h=fk, you decompose hh into h1+h2h_1+h_2 as above, observe that ah1=fkι1ah_1=fk\iota_1 and bh2=fkι2bh_2=fk\iota_2, which gives you canonical arrows u1u_1 and u2u_2, and your canonical arrow for the first diagram is u1+u2u_1+u_2.

view this post on Zulip Damiano Mazza (Nov 28 2023 at 14:31):

(By the way, when you want to write math expressions, you may write LaTeX code by using double-dollar signs (rather than a single dollar sign as one would normally do in LaTeX). Zulip uses Markdown in messages, in which "asterisk" (or "star") signs have a special meaning (they are used to do italic and bold), so your original post does not render as expected: some "stars" disappear and you see italic text starting/ending instead).

view this post on Zulip Mike Shulman (Nov 28 2023 at 15:41):

More generally, when we say that some functor (like pullback) preserves a limit or colimit (like coproduct), we mean not just that there is some isomorphism, but that the canonical comparison map defined using the universal properties is an isomorphism. The definition of that comparison map then ensures that it commutes with the action on morphisms.