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.
Zhen Lin commented in a recent post that the free completion of a category should be . In theory opposite categories are somewhat difficult to understand but a famous result of topos theory is that is monadic over I am wondering if anything has been made of this for the sake of concretely working with the free completion. Are there any papers out there that need the free completion of for concrete or computational ends and implement this as the category of monad algebras for the "double powerset" monad on ?
It seems more likely that, when needed, is treated as the opposite of a topos. That is, arguments are made in and then dualized, since copresheaves are a lot more concrete than algebras for the double powerset monad.
Famously, the double powerset monad on the category of sets can be identified with the complete atomic boolean algebras monad, so it's possible to very concrete.
So can objects in be understood as "complete atomic boolean algebra objects" in the presheaf topos , or something like that?
I guess I'm really asking if we can get a sort of concrete description of algebras of the "double powerset" monad in a general topos, as objects equipped with a bunch of operations obeying a bunch of laws.
Zhen Lin Low said:
Famously, the double powerset monad on the category of sets can be identified with the complete atomic boolean algebras monad, so it's possible to very concrete.
This is true, but if I have the choice between viewing an object as a complete atomic boolean algebra or as a set (and I'm not otherwise motivated to take the boolean algebra perspective) the set option seems simpler :upside_down:
John Baez said:
So can objects in be understood as "complete atomic boolean algebra objects" in the presheaf topos , or something like that?
They won't be any kind of internal boolean algebra because that requires excluded middle. I think it might be able to be defined in terms of arbitrary meets and arbitrary joins satisfying certain axioms, but I could not say exactly what those axioms are.
On the other hand, I'm not sure this approach is super helpful here, since the algebra is not be finitary and so the externalisation won't be as straightforward as the simply taking functors into some category of algebras instead of Set.
Right. I'm not interested in it because it could be helpful for something - I'm interested because it suggests there could be a principled way of generalizing "complete atomic boolean algebras" to other toposes. This is especially interesting in non-boolean toposes, since the generalization becomes nonobvious there.
Well, I agree that is interesting. I don't know how to view them purely algebraically, but they do have a known characterisation as the frames for which both the unique map from the initial frame and the codiagonal preserve arbitrary meets and the Heyting arrow.
I guess this might lead to an algebraic characterisation after all, though I haven't thought through the details.
Graham Manuell said:
Well, I agree that is interesting. I don't know how to view them purely algebraically, but they do have a known characterisation as the frames for which both the unique map from the initial frame and the codiagonal preserve arbitrary meets and the Heyting arrow.
If this characterization of algebras of the double powerset monad is true in Set we could hope it's true more generally, e.g. in any Grothendieck topos.
Yes, it is true in any elementary topos with natural number object.
So maybe the internal complete atomic boolean algebras in a topos are precisely the objects of the form for an object in the topos?
Yes, that's what I'm wondering. Of course you have to really stretch the concept of "internal complete atomic boolean algebra" for this to be correct in a nonboolean topos! "Boolean" is not really the best word for it anymore, since is an internal Heyting algebra that may not be boolean.
Maybe just call it a "caba".
I guess one concrete question is: given an object in an arbitrary topos, what are some ways that is better than your average internal Heyting algebra in that topos?
In some vague sense I'd expect it should be "as complete as it can be" and "as boolean as it can be".
Or maybe "as Heyting as it can be"?
How does it get to be more Heyting than your typical internal Heyting algebra?
It's 100% complete, since it's a frame. It is also 'constructively completely distributive'. It doesn't really need to be close to Boolean at all, though it is what is called an 'overlap algebra'. Of course, all its properties can be derived from the characterisation I gave above.
But I don't really know exactly what you are looking for.
I think CCD is what I was thinking of as "more Heyting". Maybe that doesn't actually make any sense.
But I don't really know exactly what you are looking for.
If I knew, I'd have asked a more precise question. Thanks! - your answers help.
I'm not even sure what 100% complete means, in a topos. Oh, I can guess: in Set a poset can have all set-indexed colimits, so in a topos we can ask for an internal poset to have all object-indexed colimits.
It's probably best to think of joins and meets as maps from the powerset of a poset to itself. Yeah, I mean it is internally complete, so not indexing by external notions of sets.
I think you can define meets as the right adjoint to the map from to downsets on (viewed as the obvious subset of the powerset) sending to the principle downset generated by . And similarly for joins.
I've just realised that the definition of meets I just gave could be thought of as coming from a decategorification of the free completion mentioned at the start of this thread.