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.
I think this might be a cool thing to write somewhere, also to check whether I'm making sense or not.
Any category with pullbacks admits a fibration of subobjects . When has a subobject classifier, however, we can say more. In that case we know there is a 'generic subobject' such that every subobject is given by pullback of along a map .
This means, that the fibration is 'freely generated by' the data of the functor picking out the subobject classifier . You can see this functor as specifying generators for all the fibers of . In this case it gives us no generator whatsoever in any fiber, except for one in the fiber over . When we 'freely generate' a fibration starting from this data, we start populating the fibers with the objects that ought to be there because are reindexings of the generators we specified. In our case, we only have one generator (I hope notation here is clear: is the functor picking out , while is the only object of the terminal category ), so the only stuff we have to add are all the reindexings of along every possible morphism into . But by definition every subobject in is so generated. So we established:
Theorem Let be finitely complete and have a subobject classifier . Then its fibration of subobject is freely generated by its subobject classifier, i.e.
(Indeed, for the record, the free fibration over a functor is given by the projection , where denotes the comma category)
Is this folklore? I've never seen it anywhere. Looking at it again, it's basically a restatement of the definition of subobject classifier, that says naturally in : this is roughly what the above isomorphism of fibrations entails, since and are the set of objects of the fibers of those fibrations. Indeed, the above theorem simply makes this an isomorphism of categories instead of just sets. In other words, it's a representability statement but for fibrations instead of presheaves (i.e. discrete fibrations).
(1) is not necessarily a topos, we need cartesian closure for that.
Nice! I've never seen someone talk about "freely generated" here, but as you note the isomorphism you give is essentially the definition of a subobject classifier, so it's more a matter of a new attitude than a "result", right? But maybe you could find interesting situations where a fibration is freely generated by more complicated data, thus seeing this as a special case of a pattern.
I don't think this is quite true: the fibers of are posets, while the fibers of are discrete sets.
You can view it as an internal poset and that would recover the structure on the fibers, right?
Yep. But then I don't know what "freely generated" means any more.
Well, you could generalize this to fibrations with posetal fibers, and this would give you the result I assume. Also note that the "free generation" part is really the idea behind Yoneda.
ie. any internal poset in gives you a fibration with posetal fibers
Mike Shulman said:
I don't think this is quite true: the fibers of are posets, while the fibers of are discrete sets.
Uhm, right... where did I go wrong then?
I'd expect the same to be true for any Lawvere theory or even essentially algebraic theories
Josselin Poiret said:
I'd expect the same to be true for any Lawvere theory or even essentially algebraic theories
Yeah
It seems one needs to have the fiber over be much larger than I say above... In particular has discrete fibers because there are no morphisms in the only non-empty fiber of . I'd suspect one would need the entire subobject poset of to appear in this generating fiber. In other words, replace with the diagonal filling this pullback square:
image.png
Though I wonder if the inclusion , where is the walking arrow and picks out the whole subobject classifier (i.e., the arrow ), would suffice... it's appealing but prima facie it doesn't seem to work
Matteo Capucci (he/him) said:
It seems one needs to have the fiber over be much larger than I say above... In particular has discrete fibers because there are no morphisms in the only non-empty fiber of . I'd suspect one would need the entire subobject poset of to appear in this generating fiber. [...]
image.png
If you have a subobject of , then transporting the generator along its characteristic morphism should give you the corresponding subobject, no?
Yeah the objects are fine but one doest get the inclusions
It's not the subobjects of that you need, but the ordering relation on morphisms into induced by its internal poset structure, as Morgan said.
Josselin Poiret said:
Well, you could generalize this to fibrations with posetal fibers, and this would give you the result I assume. Also note that the "free generation" part is really the idea behind Yoneda.
Exactly, but once you're talking about incorporating a specified order relation on an object, there isn't a Yoneda lemma any more, which is why I'm unsure of what the statement would be.
Mike Shulman said:
Exactly, but once you're talking about incorporating a specified order relation on an object, there isn't a Yoneda lemma any more, which is why I'm unsure of what the statement would be.
Oh, you're right, let me add some emphasis for other readers: a Yoneda-like lemma would work if you freely generated both the presheaf and poset parts of the posetal fibration, which isn't the case here since we only generate the presheaf part, the preorder part is fixed ahead of time!
I guess we don't want to be too freely generated, only its presheaf part.
Mike Shulman said:
I don't think this is quite true: the fibers of are posets, while the fibers of are discrete sets.
instead of the bare , you probably want the externalisation of the internal category , as described in Categorical Logic and Type Theory's 7.3, and that should all work out.
it might just be the right way to talk about subobject classifiers in a category with chosen pullbacks, since otherwise you sweep all the 2-details under the rug
(and very importantly, we have an equivalence and not just an isomorphism)
additionally, for any object , you can form the internal discrete category with both , and externalizing it recovers .