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.
This topic is connected with the theory of exact completions, and the question of when the exact completion of a category is a topos. For the connection, one should consult the work of Menni, for example here just to give one point of entry, which gives a lot of relevant references.
If denotes the embedding of a topos into its exact completion, then it's been mentioned by Carboni that the lattice of subobjects of is isomorphic to the poset reflection of , and even for some simple presheaf toposes , this need not be small. He mentions that the topos of quivers is an example where this happens: its posetal reflection is not small.
Deep, deep within the bowels of the nLab, there is a footnote in the article on regular and exact completions, which explains further. It reads:
"For example, let be the topos of directed graphs. For each ordinal , let be the directed graph whose nodes are elements of and with a directed edge from to if in . Then in the poset reflection , we have a class of proper monomorphisms, e.g., whenever . Thus is a large poset. This example also shows that need not be a total category even if is."
Thanks, the connection with exact completions is very useful to know. I suppose the observation about quivers tells us not to expect a very nice solution?
If a category as simple as the parallel pair gives a proper class (note that the same construction of an irreflexive quiver from a poset means we get at least the poset reflection of the category of posets and injective monotone functions) then I suspect that there is little chance of realising your original conjecture @Andrej Bauer . That said, you may at least be able to prove that this reflection has the properties you would expect, like small joins.
(By the way, #learning: questions or #theory: category theory would probably be a better place for this thread.)
This topic was moved here from #community: general > Characterizing the poset reflection of presheaves by Morgan Rogers (he/him).
I think the original conjecture holds for locally connected toposes. In a locally connected topos , every object is the (free) coproduct of a collection of indecomposable/connected objects. So you can write
where is the full subcategory of connected objects, and denotes freely adding coproducts. The idea is now that the posetal reflection of depends only on the posetal reflection of .
To compute the posetal reflection of , we use that there exists a map
if and only if for each there exists a and a map .
This already depends only on the images of the 's and the 's in the posetal reflection.
Also, if two objects and have the same image in the posetal reflection, then you can just drop one of them, without changing whether the map does or does not exist.
To make it more precise, let be the posetal reflection of . Then the posetal reflection of is
Here we can interpret the elements on the right hand side as subsets of , and for two subsets and we have the formula
(I'm sending separate messages because I got an error when trying to send them in one go.)
My guess is that the conjecture does not hold for arbitrary Grothendieck toposes. Finding a counterexample might be difficult. For elementary toposes, the topos of finite sets with a -action might be a counterexample.
Many toposes in practice are locally connected: presheaf toposes (including the category of directed graphs), as well as toposes of sheaves for nice topological spaces or nice schemes.
Jens Hemelaer said:
To make it more precise, let be the posetal reflection of . Then the posetal reflection of is
Taking , while it is technically true that is "a poset derived from ", the example that Todd gave shows that computing it can be unfeasible. How do you feel about this result @Andrej Bauer ? :wink:
Morgan Rogers (he/him) said:
(I may continue tomorrow, but in case anyone wants to join in and figure out what the poset reflection is for , do go ahead!)
The poset reflection of is large. We can prove this fact as follows:
Let me call an object of E a well-founded tree, if
Then we can recursively define weight ordinal of an element of well-founded tree , as the minimum ordinal that is larger than all weight ordinals of . We define a weight-ordinal of a well-founded tree to be the sup of the all weight ordinals of its element.
Now we can prove that
@Ryuya Hora picturing a well-founded tree of weight and above was an interesting exercise; you have to make some very "wide" actions. I really did not expect this result.