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: learning: questions

Topic: Pushout complements in Cat


view this post on Zulip Bryce Clarke (Apr 26 2023 at 15:43):

Suppose I have a fully faithful functor f ⁣:ABf \colon A \rightarrow B. Let iA ⁣:A0Ai_{A} \colon A_{0} \rightarrow A denote the inclusion of the discrete category of objects. Does this pair of functors always admit a [[pushout complement]]?

I think the pushout complement PP should have the same objects as BB, such that P(fa,fa)=P(fa, fa') = \emptyset if aaa \neq a', P(fa,fa)={}P(fa, fa) = \{ \ast \}, and P(x,y)=B(x,y)P(x, y) = B(x, y) otherwise. Then the functor A0PA_{0} \rightarrow P should be fully faithful (which is necessary for its pushout along iAi_{A} to be fully faithful), and the functor PBP \rightarrow B is identity-on-objects.

view this post on Zulip Bryce Clarke (Apr 26 2023 at 16:12):

Thinking more about this, I believe we also need to assume that ff is injective-on-objects. Otherwise we have a counterexample where AA is the [[walking isomorphism]] and BB is the terminal category.

view this post on Zulip Mike Shulman (Apr 26 2023 at 16:41):

I think the pushout of those functors will be the disjoint union of AA with BAB\setminus A. You're missing all the morphisms from objects in the image of AA to those not in its image, and vice versa.

view this post on Zulip Bryce Clarke (Apr 26 2023 at 16:50):

Mike Shulman said:

You're missing all the morphisms from objects in the image of AA to those not in its image, and vice versa.

Right. When I write P(x,y)=B(x,y)P(x, y) = B(x, y), I mean that at most one of x or y is in the image of AA. In particular, I mean that P(fa,y)=B(fa,y)P(fa, y) = B(fa, y) and P(x,fa)=B(x,fa)P(x, fa) = B(x, fa) for aA a \in A and x,yim(f)x, y \notin im(f).

view this post on Zulip Bryce Clarke (Apr 26 2023 at 16:51):

The otherwise was doing a lot of work in the first statement and was a bit unclear.

view this post on Zulip Mike Shulman (Apr 26 2023 at 16:53):

Oh, I see. But then you can't compose a morphism fayfa \to y with a morphism yfay \to fa'.

view this post on Zulip Bryce Clarke (Apr 26 2023 at 17:00):

Ah perfect, so that gives a counter-example. Take the functor {0<2}{0<1<2}\{ 0 < 2 \} \rightarrow \{ 0 < 1 < 2 \}. Then the ''pushout complement'' that I try to construct above doesn't work.

view this post on Zulip Bryce Clarke (Apr 26 2023 at 17:31):

I am curious now as to what (neccesary and) sufficient conditions on f ⁣:ABf \colon A \rightarrow B are such that its pushout complement with iA ⁣:A0Ai_{A} \colon A_{0} \rightarrow A exists.
It's tempting to add the condition [[Conduche functor]] to the above assumptions, but this feels more like ``plugging the hole'' in the above counter-example rather than actually getting to the bottom of the problem.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:35):

Actually that's an interesting question: what does it mean for a full subcategory to be a Conduche functor? A full subcategory is a fibration iff it's a [[sieve]], and an opfibration iff it's a cosieve, but I haven't thought about fully faithful Conduche functors before.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:37):

However, I don't think that will work either, because in that case the span PA0AP \leftarrow A_0 \to A still doesn't contain any information about the composites of the arrows in AA with the arrows not in AA, so it can't be expected to give back BB.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:39):

Take {0<1}{0<1<2}\{ 0 < 1 \} \to \{0 < 1 < 2\}: then PP has 0<20<2 and 1<21<2 but not 0<10<1, so the pushout will have two arrows 020\to 2, one coming from PP and one being the freely generated composite of the 0<10<1 in AA with the 1<21<2 in PP.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:40):

Looking at that, I'm tempted to guess the answer is that it only holds if AA is complemented, B=A(BA)B = A \sqcup (B\setminus A).

view this post on Zulip Bryce Clarke (Apr 26 2023 at 17:42):

Mike Shulman said:

Take {0<1}{0<1<2}\{ 0 < 1 \} \to \{0 < 1 < 2\}: then PP has 0<20<2 and 1<21<2 but not 0<10<1, so the pushout will have two arrows 020\to 2, one coming from PP and one being the freely generated composite of the 0<10<1 in AA with the 1<21<2 in PP.

So for that example, I think that the pushout complement PP should be the category {0}{1<2}\{0\} \sqcup \{1 < 2 \}, but that doesn't agree with the construction I attempted to describe above.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:43):

Hmm, yes, that does seem to give a pushout complement in that case.

view this post on Zulip Bryce Clarke (Apr 26 2023 at 17:47):

Mike Shulman said:

Looking at that, I'm tempted to guess the answer is that it only holds if AA is complemented, B=A(BA)B = A \sqcup (B\setminus A).

Just checking: what is the category (BA)(B \setminus A)? Is it just the full subcategory of BB determined by the objects not in the image of f ⁣:AB f \colon A \rightarrow B?

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:48):

Yes, that's what I meant.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:49):

Let's see, let f:ABf:A\hookrightarrow B be a full subcategory inclusion that is a Conduche functor, and BB' the full subcategory of BB on the complement of AA. Then Conduche-ness of ff means that no object of BB' can be both the codomain of an arrow whose domain is in AA and the domain of an arrow whose codomain is in AA. So we can partition the objects of BB' into B0B_0, which have an arrow to AA, B1B_1 which have an arrow from AA, and B2B_2 which have neither.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:51):

There can be no arrows from B1B_1 to B0B_0, from B1B_1 to B2B_2, or from B2B_2 to B0B_0. So BB admits a functor to the walking commutative square, with fibers B0B_0, AA, B2B_2, and B1B_1.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:56):

Given the categories BB' and AA, the additional data consists of two profunctors H1:B1AH_1 : B_1 ⇸ A, H2:AB0H_2:A ⇸ B_0, and a morphism α:H2H1homB\alpha : H_2 \circ H_1 \to \hom_B.

view this post on Zulip Mike Shulman (Apr 26 2023 at 17:57):

Whereas the data of PP consists of, in addition to BB', profunctors K1:B1ob(A)K_1 : B_1 ⇸ ob(A), K2:ob(A)B0K_2:ob(A) ⇸ B_0, and a morphism β:K2K1homB\beta : K_2 \circ K_1 \to \hom_B.

view this post on Zulip Mike Shulman (Apr 26 2023 at 18:00):

There's a forgetful functor (H1,H2,α)(K1,K2,β)(H_1,H_2,\alpha) \mapsto (K_1,K_2,\beta), and taking the pushout should be its left adjoint. So I figure the condition on ff -- which is admittedly not a very nice one -- is that (H1,H2,α)(H_1,H_2,\alpha) is in the image of this left adjoint.

view this post on Zulip Bryce Clarke (Apr 26 2023 at 18:52):

Thanks, I think I am following (although I think that B0B_0 and B1B_1 should be swapped in the profunctors HiH_i and KiK_i?).
So the forgetful functor is given by some pasting of α\alpha with 2-cells in ProfProf using the representable profunctors of iA ⁣:ob(A)Ai_{A} \colon ob(A) \rightarrow A? (I think this should be straightforward, I just can't "see" it when I write it down).

view this post on Zulip Bryce Clarke (Apr 26 2023 at 19:20):

I wonder if things simplify somewhat if we assume that H1H_1 or H2H_2 is the initial profunctor (or that B0B_0 or B1B_1 is empty).

view this post on Zulip Bryce Clarke (Apr 26 2023 at 20:57):

Hmmm, I guess this is obvious but if the pushout complement of (iA ⁣:A0A,f ⁣:AB)(i_{A} \colon A_{0} \rightarrow A, f \colon A \rightarrow B) exists, it must also be a pullback square.

view this post on Zulip Mike Shulman (Apr 26 2023 at 21:29):

Maybe your conventions about profunctors are the opposite of mine? (-:

view this post on Zulip Mike Shulman (Apr 26 2023 at 21:29):

For me a profunctor ABA⇸B is a functor Bop×ASetB^{\rm op}\times A \to \rm Set.

view this post on Zulip Mike Shulman (Apr 26 2023 at 21:33):

Bryce Clarke said:

So the forgetful functor is given by some pasting of α\alpha with 2-cells in ProfProf using the representable profunctors of iA ⁣:ob(A)Ai_{A} \colon ob(A) \rightarrow A?

Yes. It may be easier to see in the double category Prof than in the bicategory Prof, where instead of representable profunctors you can use vertical arrows: tikzcd.

view this post on Zulip Bryce Clarke (Apr 27 2023 at 07:02):

Mike Shulman said:

Whereas the data of PP consists of, in addition to BB', profunctors K1:B1ob(A)K_1 : B_1 ⇸ ob(A), K2:ob(A)B0K_2:ob(A) ⇸ B_0, and a morphism β:K2K1homB\beta : K_2 \circ K_1 \to \hom_B.

So the idea is that K1:B1ob(A)K_1 : B_1 ⇸ ob(A) is the subset of B(fa,b)B(fa, b) determined by the morphisms which do not arise from the composition with a non-identity arrow in the image of AA?

view this post on Zulip Bryce Clarke (Apr 27 2023 at 07:20):

Mike Shulman said:

There's a forgetful functor (H1,H2,α)(K1,K2,β)(H_1,H_2,\alpha) \mapsto (K_1,K_2,\beta), and taking the pushout should be its left adjoint. So I figure the condition on ff -- which is admittedly not a very nice one -- is that (H1,H2,α)(H_1,H_2,\alpha) is in the image of this left adjoint.

I guess I am failing to come up with an example where this condition does not hold; that is, a full subcategory inclusion f ⁣:ABf \colon A \rightarrow B which is a Conduche functor and does not admit a pushout complement with the inclusion iA ⁣:A0Ai_{A} \colon A_{0} \rightarrow A. I will keep thinking about it.

view this post on Zulip Bryce Clarke (Apr 27 2023 at 08:00):

Bryce Clarke said:

I am curious now as to what (neccesary and) sufficient conditions on f ⁣:ABf \colon A \rightarrow B are such that its pushout complement with iA ⁣:A0Ai_{A} \colon A_{0} \rightarrow A exists.
It's tempting to add the condition [[Conduche functor]] to the above assumptions, but this feels more like ``plugging the hole'' in the above counter-example rather than actually getting to the bottom of the problem.

I should mention that it is not necessary for a full subcategory inclusion f ⁣:ABf \colon A \rightarrow B to be a Conduche functor for its pushout complement along iA ⁣:A0Ai_{A} \colon A_{0} \rightarrow A to exist. For example, take AA to be the terminal category, BB to be the free standing section-retraction pair, and ff to pick out the initial object.

So I guess the question is whether it is a sufficient condition.

view this post on Zulip Mike Shulman (Apr 27 2023 at 15:39):

More generally, whenever AA is discrete, iAi_A is an isomorphism, so the pushout complement always exists.

view this post on Zulip Mike Shulman (Apr 27 2023 at 15:40):

Bryce Clarke said:

So the idea is that K1:B1ob(A)K_1 : B_1 ⇸ ob(A) is the subset of B(fa,b)B(fa, b) determined by the morphisms which do not arise from the composition with a non-identity arrow in the image of AA?

Well, it's more general than that. You would want to take (K1,K2,β)(K_1,K_2,\beta) to be some "freely generating subset" of (H1,H2,α)(H_1,H_2,\alpha).