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.
Hi, I have a question on Proposition VI.1.8 of SGL; I cannot follow the proof.
The proposition says that if is an (elementary) topos such that all subterminal objects in it form a generating/separating family, and such that each subobject lattice is a complete Boolean algebra, then satisfies the axiom of choice (i.e., every epimorphism in splits).
The proof in SGL first takes an arbitrary epimorphism , and tries to find its section. To do so, the authors consider the poset of all subobjects of such that there exists a “partial section” on it, i.e., such that . Then they claim that has a maximal element, using completeness of and (meta) Zorn’s lemma... But is it clear that every chain has an upper bound in ? 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 consisting of all such that is a monomorphism. Now consider a chain in . We can certainly take its union in . Then the question is: is it true that is mono, provided that each is?
The rest of the proof looks fine to me.
Soichiro Fujii said:
The poset of partial sections amounts to consisting of all such that is a monomorphism. Now consider a chain in . We can certainly take its union in . Then the question is: is it true that is mono, provided that each is?
Yes. The union of a chain is a filtered colimit, and since filtered colimits preserve monomorphisms, is also the colimit of in . Now, composing with preserves all colimits (it is left adjoint to pullback), hence is the colimit of in , and so it is a monomorphism.
However, I find it slightly more intuitive to just take the union of the chain directly. Then by the same argument this is a colimit in as well, which means you can lift it to a map such that .
Seeing non-constructive results in a text about topos theory is a little bit painful...
@Paolo Capriotti
Thank you very much! Your explanation clarified the situation greatly.
However, if I understand correctly, your argument presupposes that has filtered colimits...? Of course the union of a chain in is a filtered colimit in , and (as you pointed out) it is necessarily given by a filtered colimit in if has that filtered colimit, but does it still hold even without the a priori assumption that the filtered colimit exists in ?
Anyway, at least the immediate application of the proposition seems to be one in a Grothendieck topos, so I am satisfied for now!
@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...
Oof... And what a silly definition of well-pointedness too :grimacing:
@Morgan Rogers
Oh, is there any problem with the definition of well-pointedness in SGL?
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.
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:
Soichiro Fujii said:
Paolo Capriotti
However, if I understand correctly, your argument presupposes that has filtered colimits...? Of course the union of a chain in is a filtered colimit in , and (as you pointed out) it is necessarily given by a filtered colimit in if has that filtered colimit, but does it still hold even without the a priori assumption that the filtered colimit exists in ?
Anyway, getting back to your question, Proposition 8 explicitly assumes completeness of Sub(E), circumventing the worry about whether E has filtered colimits.
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 are necessarily given by the filtered colimits in . Because I think the argument is like:
And to prove the third step, we use that in .
(*) 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?
Since here the targets of your monos are all the same (), I think it follows from the fact that is cartesian closed.
Reid Barton said:
Since here the targets of your monos are all the same (), I think it follows from the fact that is cartesian closed.
Sorry, what does “it” refer to?
That the colimit of a filtered diagram of monos is again a mono.
Reid Barton said:
That the colimit of a filtered diagram of monos 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?
Soichiro Fujii said:
However, if I understand correctly, your argument presupposes that has filtered colimits...? Of course the union of a chain in is a filtered colimit in , and (as you pointed out) it is necessarily given by a filtered colimit in if has that filtered colimit, but does it still hold even without the a priori assumption that the filtered colimit exists in ?
Good point, I did assume that had filtered colimits. The missing part is that filtered colimits in are also colimits in . Here is a direct proof, although I suspect there are more elegant ways. Let be the filtered colimit of in . It is enough to prove that is the colimit of in . So let be a cocone. Our goal is to find an extension (uniqueness will follow easily by taking an equaliser). Let be the "graph" of , i.e. the subobject of corresponding to the morphism through the power object adjunction. Since is mono, can be regarded as a suboject of . Take the union of those subobjects. The key fact, which uses filteredness, is that the pullback of to is . Therefore, if is the morphism corresponding to , we get that restricts to for all . Define by pulling back along . Now is a monomorphism, so we get a map , and composing with gives the sought extension.
The argument I had in mind is the following. Suppose is the filtered colimit of subterminal objects ; we want to show that is subterminal. It suffices to show that the projections are isomorphisms. Now because the category is cartesian closed, we can express as the colimit over of . Because is filtered, we can replace with the cofinal diagonal subcategory , so is the colimit of . Since each was subterminal, this is just the colimit of , which is indeed .
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 is constant.
@Paolo Capriotti
Cool! I like how you use graphs to construct the mediating morphism. This technique seems to be worth knowing.
@Reid Barton
Okay, I got it. Thank you very much for explaining it in detail! It is also a nice result to know.
@Reid Barton nice argument! This works more generally for sifted colimits with the same proof, right?