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 all :wave:, I've officially fallen in love with topos theory and I have a vague question (maybe more of a reference request) about the construction of subobject classifiers. Please bear with me as I wave my hands. Here's the question:
as it is stated, the question admits "yes" as answer, but I think it's not what you wanted to ask
Maybe you want to ask: there's a particularly elegant way to prove that categories of the form have a subobject classifier. Is there a similar way to prove that elementary toposes [of the form...?] have a subobject classifier?
hmm, probably, I guess I'm asking if there's something like a formula for subobject classifiers in the same way as there's a formula for Kan extensions :man_shrugging:
ah, I understand (probably) what you want. Say you have a category and you know it has a subobject classifier; is there a way to compute it?
If yes, I've never seen one besides the one for Grothendieck toposes. For elementary toposes.. maybe the keyword is something something Lawvere-Tierney topologies?
At a very naive level, a subobject classifier is a representing object for the subobject functor, which means a terminal object in its category of elements
so whatever recipe you have to find the terminal object of gives a subobject classifier
Am I hallucinating, or is the terminal object of a category the colimit of the 'full diagram': the diagram consisting of all objects and morphisms in the category?
For example, this is true for a poset.
fosco said:
ah, I understand (probably) what you want. Say you have a category and you know it has a subobject classifier; is there a way to compute it?
Yes, this is exactly it! :thank_you:
John Baez said:
Am I hallucinating, or is the terminal object of a category the colimit of the 'full diagram': the diagram consisting of all objects and morphisms in the category?
this sounds correct to me!
Thanks a lot for the answers, I'll ponder it a bit!
Okay, thanks. So then I guess you can get get the subobject classifier of , if it exists, using the philosophy that is the 'walking subobject' or 'mother of all subobjects': any subobject of any object is obtained via pullback from some morphism .
So, this makes me want to build it as a colimit of a diagram whose objects are all possible object/subobject pairs in , and whose arrows are all maps between these. Or something like that.
Even if I'm right this is a thoroughly impractical method, but when the colimit exists it should be a terminal object in some category of object-subobject pairs, and this should match Fosco's description.
I'm a bit fuzzy about a lot of the details here, but to the extent I understand them, all I'm doing it dramatizing what Fosco said, using the philosophy that the subobject classifier is the "walking subobject" (i.e. it's an object, and a subobject of that, which is universal among such object-subobject pairs).
It's late evening for me, but I think these two descriptions we gave are equivalent and equally tautological; a terminal object of exists iff the identity functor has a colimit; this poses the problem of non-existence of a general formula to compute a colimit of a diagram that " recognizes as large"
it's a nice observation anyway, that one can just reduce to (woah, that's a lot of nested notation)
let's wait for the true topos theorists (=not me)
Is it possible to "present" an elementary topos as a presheaf topos?
Not always! For example: the category of finite sets is an elementary topos, but not a presheaf topos.
Any presheaf topos (or more generally any [[Grothendieck topos]]) has all small colimits and limits, while an elementary topos need only have finite ones.
[Forgive the late night blasphemy]: I would then say it's not true that every elementary topos arises as a left exact localization of ?
(for a small C)
morally, C should be the subcategory of compact objects, and I don't see why the elementary topos axioms make it a generator.
also true or false that every category of the form is a fairly canonical example of an elementary topos? I must admit I have never thought about this banality and I feel ashamed!
I can't answer your sophisticated question but what I call is indeed an elementary topos. (I seem to use more letters than you.)
I guess is an elementary topos whenever is the category of all sets whose cardinality is less than some [[inaccessible cardinal]]. The countably infinite cardinal would count as an inaccessible cardinal except some jerk stuck a clause into the definition explicitly excluding it.
An elementary topos need not have any generator, so you definitely can’t restrict to small, and you definitely can’t restrict to presheaves valued only in finite sets. A locally small cocomplete topos is pretty close to the same as a lex total category, ie a left exact localization of the category of presheaves of small sets on some locally small category (ie itself) though.
As to your original question, @Benjamin Merlin Bumpus (he/him), I think the answer is mostly no; this construction is so nice because -presheaves have as a dense small generator. If is a site you get something worse but still something, but in general with no generator I see little hope of anything that feels nontrivially analogous. I’m not super confident in this claim except insofar as arbitrary toposes are pretty weird so I have priors on things being weird.
So in an elementary topos there is no way to compute , so to speak.
I’m saying I guess there’s no general nontrivial way to do so, yeah.
Benjamin Merlin Bumpus (he/him) said:
Hi all :wave:, I've officially fallen in love with topos theory
Welcome!
John Baez said:
I can't answer your sophisticated question but what I call is indeed an elementary topos. (I seem to use more letters than you.)
Are you sure? Think about what happens for a poset of infinite depth, or more specifically a poset in which some element has infinitely many elements below it, such as the terminal object in the ordinal . We have a Yoneda embedding , since is locally finite (beware that this is not necessarily the free finite cocompletion of , as Kevin pointed out in another topic). Moreover, the [[Yoneda lemma]] holds: elements of are in bijection with natural transformations (you can inspect the proof and see that it applies as soon as the representable presheaf exists, since it only relies on the naturality condition), and hence the preservation of limits by the Yoneda embedding holds, whence has infinitely many subobjects -- in a poset, all morphisms are monomorphisms.
So if the subobject functor were represented by some object , we would have being infinite (corresponding to having infinitely many subobjects), which is not allowed since our presheaves have to take values in finite sets!
In summary, for to be a topos when has finite homsets, it is necessary for to also be 'finitely powered'. I am a little curious if:
Are you sure?
Rapidly getting less so.... :sweat_smile:
Thanks for disabusing me of that notion, and then going the extra mile to find extra conditions to fix my guess.
I guess this generalization for larger cardinalities also needs to be fixed, at least when has more than objects (or morphisms):
John Baez said:
I guess is an elementary topos whenever is the category of all sets whose cardinality is less than some [[inaccessible cardinal]] .
Yeah I think this is basically because is a "large category" from the perspective of , and that for similar reasons isn't in general a topos when is large ... so the same should happen for various inaccessible cardinals.
If anyone has access to Sketches of an Elephant, check out Example A2.1.5: if is a category all of whose slice categories are essentially small, then is an elementary topos.
Ah, so is kind of a "scaled down" version of that, and fails because it has a terminal object and the slice over that is as large as the original category.
Having read Elephant A2.1.5, plus the above, it seems like the "if" can be strengthened to "iff" ... am I dreaming?
So you'd need to argue that if every representable presheaf has only a small number of subobjects, then all slice categories are essentially small. That's not obvious to me; a priori it seems like there could be other "accidental" ways for representables to have small subobject lattices. Is there an argument for it contained somewhere in this thread?
It seems more obvious to me when you look at the exponential objects than the subobject classifier. Or at least it did--I'm no longer sure I understand the argument for why exponentials turn out as small presheaves in the first place! (for the A2.1.5 case, not the small case.)
Maybe it's easier to understand why power objects turn out small.
Thanks everyone for the comments; I’ve learned a lot from reading all of this!
btw, old fql can compute sub-object classifiers for the category of copresheaves on certain finitely presented categories. Here's a picture of the subobject classifier for the category of copreshaves on the category with a single generating arrow f:a->b.
Screenshot-2024-09-02-at-12.42.57PM.png
Ryan Wisnesky said:
btw, old fql can compute sub-object classifiers for the category of copresheaves on certain finitely presented categories. Here's a picture of the subobject classifier for the category of copreshaves on the category with a single generating arrow f:a->b.
Screenshot-2024-09-02-at-12.42.57PM.png
that seems very cool but i wouldn't know how to interpret this screenshot. would you mind adding an explanation for how to read it?
The copresheaf is described in the two tables and .
Table represents the set lying over . Similarly for table .
You see a column in table , containing ids of rows from table (aka a foreign key if you are familiar with relational database). This column encodes the function .
Explicitly, and . The function is
(However, I have to think about it a bit more to see why this is the subobject classifier)
I'm expecting and though
Edit: Oops, forgot the empty cosieves, my bad. that matches up then!