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: Sheaves in Geometry and Logic


view this post on Zulip Soichiro Fujii (May 28 2020 at 08:54):

Hi, I have a question on Proposition VI.1.8 of SGL; I cannot follow the proof.

The proposition says that if E\mathcal{E} is an (elementary) topos such that all subterminal objects in it form a generating/separating family, and such that each subobject lattice SubE(E)\mathrm{Sub}_\mathcal{E}(E) is a complete Boolean algebra, then E\mathcal{E} satisfies the axiom of choice (i.e., every epimorphism in E\mathcal{E} splits).

The proof in SGL first takes an arbitrary epimorphism p ⁣:XIp\colon X\twoheadrightarrow I, and tries to find its section. To do so, the authors consider the poset SSubE(I)\mathcal{S}\subseteq \mathrm{Sub}_\mathcal{E}(I) of all subobjects m ⁣:MIm\colon M\rightarrowtail I of II such that there exists a “partial section” on it, i.e., s ⁣:MXs\colon M\rightarrowtail X such that ps=mps=m. Then they claim that S\mathcal{S} has a maximal element, using completeness of SubE(I)\mathrm{Sub}_\mathcal{E}(I) and (meta) Zorn’s lemma... But is it clear that every chain has an upper bound in S\mathcal{S}? I think to do so one should consider the poset of partial sections, rather than the poset of domains of partial sections.

The poset of partial sections amounts to TSubE(X)\mathcal{T}\subseteq \mathrm{Sub}_\mathcal{E}(X) consisting of all s ⁣:MXs\colon M\rightarrowtail X such that ps ⁣:MIps\colon M\to I is a monomorphism. Now consider a chain (sj ⁣:MjX)jJ(s_j\colon M_j\rightarrowtail X)_{j\in J} in T\mathcal{T}. We can certainly take its union s ⁣:MXs\colon M\rightarrowtail X in SubE(X)\mathrm{Sub}_\mathcal{E}(X). Then the question is: is it true that psps is mono, provided that each psjps_j is?

The rest of the proof looks fine to me.

view this post on Zulip Paolo Capriotti (May 28 2020 at 10:19):

Soichiro Fujii said:

The poset of partial sections amounts to TSubE(X)\mathcal{T}\subseteq \mathrm{Sub}_\mathcal{E}(X) consisting of all s ⁣:MXs\colon M\rightarrowtail X such that ps ⁣:MIps\colon M\to I is a monomorphism. Now consider a chain (sj ⁣:MjX)jJ(s_j\colon M_j\rightarrowtail X)_{j\in J} in T\mathcal{T}. We can certainly take its union s ⁣:MXs\colon M\rightarrowtail X in SubE(X)\mathrm{Sub}_\mathcal{E}(X). Then the question is: is it true that psps is mono, provided that each psjps_j is?

Yes. The union of a chain is a filtered colimit, and since filtered colimits preserve monomorphisms, ss is also the colimit of sjs_j in E/X\mathcal{E}/X. Now, composing with pp preserves all colimits (it is left adjoint to pullback), hence psps is the colimit of psjp s_j in E/I\mathcal{E}/I, and so it is a monomorphism.

However, I find it slightly more intuitive to just take the union t:MIt: M \to I of the chain psjp s_j directly. Then by the same argument this is a colimit in E/I\mathcal{E}/I as well, which means you can lift it to a map s:MXs: M \to X such that ps=tps = t.

view this post on Zulip Morgan Rogers (he/him) (May 28 2020 at 10:57):

Seeing non-constructive results in a text about topos theory is a little bit painful...

view this post on Zulip Soichiro Fujii (May 28 2020 at 11:07):

@Paolo Capriotti
Thank you very much! Your explanation clarified the situation greatly.

However, if I understand correctly, your argument presupposes that E\mathcal{E} has filtered colimits...? Of course the union of a chain in SubE(X)\mathrm{Sub}_\mathcal{E}(X) is a filtered colimit in SubE(X)\mathrm{Sub}_\mathcal{E}(X), and (as you pointed out) it is necessarily given by a filtered colimit in E\mathcal{E} if E\mathcal{E} has that filtered colimit, but does it still hold even without the a priori assumption that the filtered colimit exists in E\mathcal{E}?

Anyway, at least the immediate application of the proposition seems to be one in a Grothendieck topos, so I am satisfied for now!

view this post on Zulip Soichiro Fujii (May 28 2020 at 11:16):

@Morgan Rogers
Incidentally, the previous Proposition VI.1.7 of SGL says that a well-pointed topos is two-valued and Boolean, and is shown by a proof by contradiction...

view this post on Zulip Morgan Rogers (he/him) (May 28 2020 at 11:29):

Oof... And what a silly definition of well-pointedness too :grimacing:

view this post on Zulip Soichiro Fujii (May 28 2020 at 11:47):

@Morgan Rogers
Oh, is there any problem with the definition of well-pointedness in SGL?

view this post on Zulip Morgan Rogers (he/him) (May 28 2020 at 13:12):

Turns out I was confusing it with some other concepts (eg inhabitedness); it does match the definition of well-pointed category. But I still resent its inclusion, for the simple lack of examples; the only ones that present themselves are "inclusions of smaller universes of sets into larger ones"; that's certainly the closest thing to an example that one could get out of SGL.

view this post on Zulip Morgan Rogers (he/him) (May 28 2020 at 13:15):

What really bugs me is the fact that this result comes in a section about the axiom of choice, which is presented in both external and internal versions, but the internal version of well-pointedness isn't mentioned. :shrug:

view this post on Zulip Morgan Rogers (he/him) (May 28 2020 at 13:16):

Soichiro Fujii said:

Paolo Capriotti
However, if I understand correctly, your argument presupposes that E\mathcal{E} has filtered colimits...? Of course the union of a chain in SubE(X)\mathrm{Sub}_\mathcal{E}(X) is a filtered colimit in SubE(X)\mathrm{Sub}_\mathcal{E}(X), and (as you pointed out) it is necessarily given by a filtered colimit in E\mathcal{E} if E\mathcal{E} has that filtered colimit, but does it still hold even without the a priori assumption that the filtered colimit exists in E\mathcal{E}?

Anyway, getting back to your question, Proposition 8 explicitly assumes completeness of Sub(E), circumventing the worry about whether E has filtered colimits.

view this post on Zulip Soichiro Fujii (May 28 2020 at 13:49):

Morgan Rogers said:

Anyway, getting back to your question, Proposition 8 explicitly assumes completeness of Sub(E), circumventing the worry about whether E has filtered colimits.

Yes, but my concern was whether the filtered colimits of chains in SubE(X)\mathrm{Sub}_\mathcal{E}(X) are necessarily given by the filtered colimits in E\mathcal{E}. Because I think the argument is like:

And to prove the third step, we use that M=colimjJMjM=\mathrm{colim}_{j\in J}M_j in E\mathcal{E}.

(*) To be honest, I am not completely sure if (existing) filtered colimits preserve monos in any topos. I know that in a Grothendieck topos, filtered colimits exist and commute with finite limits, and hence preserve monos. Does the argument extend so that in any (elementary) topos, (existing) filtered colimits commute with finite limits?

view this post on Zulip Reid Barton (May 28 2020 at 14:19):

Since here the targets of your monos are all the same (XX), I think it follows from the fact that E/X\mathcal{E}/X is cartesian closed.

view this post on Zulip Soichiro Fujii (May 28 2020 at 23:44):

Reid Barton said:

Since here the targets of your monos are all the same (XX), I think it follows from the fact that E/X\mathcal{E}/X is cartesian closed.

Sorry, what does “it” refer to?

view this post on Zulip Reid Barton (May 29 2020 at 00:03):

That the colimit MXM \to X of a filtered diagram of monos MjXM_j \to X is again a mono.

view this post on Zulip Soichiro Fujii (May 29 2020 at 00:31):

Reid Barton said:

That the colimit MXM \to X of a filtered diagram of monos MjXM_j \to X is again a mono.

Hmm, maybe it is an easy thing, but I still cannot see why... Do you mean filtered colimits of subterminal objects in a cartesian closed category are always subterminal?

view this post on Zulip Paolo Capriotti (May 29 2020 at 09:16):

Soichiro Fujii said:

However, if I understand correctly, your argument presupposes that E\mathcal{E} has filtered colimits...? Of course the union of a chain in SubE(X)\mathrm{Sub}_\mathcal{E}(X) is a filtered colimit in SubE(X)\mathrm{Sub}_\mathcal{E}(X), and (as you pointed out) it is necessarily given by a filtered colimit in E\mathcal{E} if E\mathcal{E} has that filtered colimit, but does it still hold even without the a priori assumption that the filtered colimit exists in E\mathcal{E}?

Good point, I did assume that E\mathcal E had filtered colimits. The missing part is that filtered colimits in Sub(X)\mathrm{Sub}(X) are also colimits in E/X\mathcal{E}/X. Here is a direct proof, although I suspect there are more elegant ways. Let MM be the filtered colimit of MiM_i in Sub(X)\mathrm{Sub}(X). It is enough to prove that MM is the colimit of MiM_i in E\mathcal E. So let gi:MiYg_i: M_i \to Y be a cocone. Our goal is to find an extension MYM \to Y (uniqueness will follow easily by taking an equaliser). Let SiS_i be the "graph" of gig_i, i.e. the subobject of Mi×YM_i \times Y corresponding to the morphism gi:MiYPYg_i': M_i \to Y \to PY through the power object adjunction. Since Mi×YX×YM_i \times Y \to X \times Y is mono, SiS_i can be regarded as a suboject of X×YX \times Y. Take the union SS of those subobjects. The key fact, which uses filteredness, is that the pullback of SS to Mi×YM_i \times Y is SiS_i. Therefore, if g:XPYg': X \to PY is the morphism corresponding to SS, we get that gg' restricts to gig_i' for all ii. Define g:X1Yg: X_1 \to Y by pulling back gg' along YPYY \to PY. Now X1XX_1 \to X is a monomorphism, so we get a map MX1M \to X_1, and composing with gg gives the sought extension.

view this post on Zulip Reid Barton (May 29 2020 at 10:53):

The argument I had in mind is the following. Suppose MM is the filtered colimit of subterminal objects (Mj)jJ(M_j)_{j \in J}; we want to show that MM is subterminal. It suffices to show that the projections M×MMM \times M \to M are isomorphisms. Now because the category is cartesian closed, we can express M×MM \times M as the colimit over (j,j)J×J(j, j') \in J \times J of Mj×MjM_j \times M_{j'}. Because JJ is filtered, we can replace J×JJ \times J with the cofinal diagonal subcategory JJ, so M×MM \times M is the colimit of Mj×MjM_j \times M_j. Since each MjM_j was subterminal, this is just the colimit of MjM_j, which is indeed MM.

view this post on Zulip Reid Barton (May 29 2020 at 10:55):

It's the usual argument that a functor that preserves pullbacks preserves monomorphisms (test a map for being a monomorphism by pulling it back along itself), but with weaker hypotheses because, in the original formulation, the target object XX is constant.

view this post on Zulip Soichiro Fujii (May 29 2020 at 11:08):

@Paolo Capriotti
Cool! I like how you use graphs to construct the mediating morphism. This technique seems to be worth knowing.

view this post on Zulip Soichiro Fujii (May 29 2020 at 11:09):

@Reid Barton
Okay, I got it. Thank you very much for explaining it in detail! It is also a nice result to know.

view this post on Zulip Paolo Capriotti (May 29 2020 at 11:56):

@Reid Barton nice argument! This works more generally for sifted colimits with the same proof, right?