Category Theory
Zulip Server
Archive

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.


Stream: theory: category theory

Topic: Characterizing the poset reflection of presheaves


view this post on Zulip Todd Trimble (Dec 10 2023 at 04:45):

This topic is connected with the theory of exact completions, and the question of when the exact completion EexE_{ex} of a category EE 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.

view this post on Zulip Todd Trimble (Dec 10 2023 at 04:45):

If y:EEexy: E \to E_{ex} denotes the embedding of a topos into its exact completion, then it's been mentioned by Carboni that the lattice of subobjects of y(X)y(X) is isomorphic to the poset reflection of E/XE/X, and even for some simple presheaf toposes EE, this need not be small. He mentions that E=E = the topos of quivers Set\mathsf{Set}^{\rightrightarrows} is an example where this happens: its posetal reflection is not small.

view this post on Zulip Todd Trimble (Dec 10 2023 at 04:45):

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:

view this post on Zulip Todd Trimble (Dec 10 2023 at 04:45):

"For example, let C=SetC = Set^{\bullet \rightrightarrows \bullet} be the topos of directed graphs. For each ordinal α\alpha, let GαG_\alpha be the directed graph whose nodes are elements of α\alpha and with a directed edge from β\beta to γ\gamma if β<γ\beta \lt \gamma in α\alpha. Then in the poset reflection Pos(C)Pos(C), we have a class of proper monomorphisms, e.g., [Gα]<[Gα][G_\alpha] < [G_{\alpha'}] whenever α<α\alpha < \alpha'. Thus Pos(C)Pos(C) is a large poset. This example also shows that Pos(C)Pos(C) need not be a total category even if CC is."

view this post on Zulip Andrej Bauer (Dec 10 2023 at 10:38):

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?

view this post on Zulip Morgan Rogers (he/him) (Dec 10 2023 at 11:50):

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.

view this post on Zulip Nathanael Arkor (Dec 10 2023 at 12:30):

(By the way, #learning: questions or #theory: category theory would probably be a better place for this thread.)

view this post on Zulip Notification Bot (Dec 10 2023 at 13:38):

This topic was moved here from #community: general > Characterizing the poset reflection of presheaves by Morgan Rogers (he/him).

view this post on Zulip Jens Hemelaer (Dec 10 2023 at 16:43):

I think the original conjecture holds for locally connected toposes. In a locally connected topos E\mathcal{E}, every object is the (free) coproduct of a collection of indecomposable/connected objects. So you can write
E=ΣEc\mathcal{E} = \Sigma \mathcal{E}_c
where Ec\mathcal{E}_c is the full subcategory of connected objects, and Σ\Sigma denotes freely adding coproducts. The idea is now that the posetal reflection of ΣEc\Sigma \mathcal{E}_c depends only on the posetal reflection of Ec\mathcal{E}_c​.

view this post on Zulip Jens Hemelaer (Dec 10 2023 at 16:44):

To compute the posetal reflection of ΣEc\Sigma \mathcal{E}_c, we use that there exists a map
f:iIXijJYjf : \coprod_{i \in I} X_i \longrightarrow \coprod_{j \in J} Y_j
if and only if for each iIi \in I there exists a jJj \in J and a map XiYjX_i \to Y_j.
This already depends only on the images of the XiX_i's and the YjY_j's in the posetal reflection.
Also, if two objects XiX_i and XjX_j have the same image in the posetal reflection, then you can just drop one of them, without changing whether the map ff does or does not exist.

view this post on Zulip Jens Hemelaer (Dec 10 2023 at 16:44):

To make it more precise, let p(Ec)p(\mathcal{E}_c) be the posetal reflection of Ec\mathcal{E}_c. Then the posetal reflection of E\mathcal{E} is
p(E)=[p(Ec),2].p(\mathcal{E}) = [ p(\mathcal{E}_c), 2].

Here we can interpret the elements on the right hand side as subsets of p(Ec)p(\mathcal{E}_c), and for two subsets SS and TT we have the formula
STsS, tT, st.S \leq T \quad \Leftrightarrow \quad \forall s\in S,~ \exists t \in T,~ s \leq t.

view this post on Zulip Jens Hemelaer (Dec 10 2023 at 16:45):

(I'm sending separate messages because I got an error when trying to send them in one go.)

view this post on Zulip Jens Hemelaer (Dec 10 2023 at 16:53):

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 Z\mathbb{Z}-action might be a counterexample.

view this post on Zulip Jens Hemelaer (Dec 10 2023 at 17:04):

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.

view this post on Zulip Morgan Rogers (he/him) (Dec 10 2023 at 19:34):

Jens Hemelaer said:

To make it more precise, let p(Ec)p(\mathcal{E}_c) be the posetal reflection of Ec\mathcal{E}_c. Then the posetal reflection of E\mathcal{E} is
p(E)=[p(Ec),2].p(\mathcal{E}) = [ p(\mathcal{E}_c), 2].

Taking E=[C,Set]\mathcal{E} = [C,\mathrm{Set}], while it is technically true that p(Ec)p(\mathcal{E}_c) is "a poset derived from CC", the example that Todd gave shows that computing it can be unfeasible. How do you feel about this result @Andrej Bauer ? :wink:

view this post on Zulip Ryuya Hora (Dec 17 2023 at 10:30):

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 [N,Set][\N,\mathrm{Set}], do go ahead!)

The poset reflection of E=[N,Set]E=[\N, \mathrm{Set}] is large. We can prove this fact as follows:
Let me call an object X=(X,f ⁣:XX)\mathbf{X}=(X,f\colon X\to X) of E a well-founded tree, if

view this post on Zulip Ryuya Hora (Dec 17 2023 at 10:31):

Then we can recursively define weight ordinal w(x)w(x) of an element xx of well-founded tree X\mathbf{X}, as the minimum ordinal that is larger than all weight ordinals of f1(x)f^{-1}(x). We define a weight-ordinal W(X)W(\mathbf{X}) of a well-founded tree X\mathbf{X} to be the sup of the all weight ordinals of its element.

Now we can prove that

view this post on Zulip Morgan Rogers (he/him) (Dec 17 2023 at 20:13):

@Ryuya Hora picturing a well-founded tree of weight ω\omega and above was an interesting exercise; you have to make some very "wide" actions. I really did not expect this result.