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: questions about "Carrés exacts et carrés déductifs"


view this post on Zulip fosco (Jun 30 2021 at 10:12):

So, reading the paper

"Carrés exacts et carrés déductifs." Diagrammes 6 (1981): G1-G17. <http://eudml.org/doc/192983>

I encountered a notion I can't really make sense of. Let me translate in a more modern language the situation Guitart works in.

Definition. An extensor (extenseur) or an extension structure on a category C\mathcal C is a function E:Span(X,Y)C(X,Y)E : \textsf{Span}(X,Y) \to \mathcal C(X,Y) sending a span (XpA,AfY)(X \xleftarrow{p} A, A \xrightarrow{f} Y) to an arrow Ep(f):XYE_p(f) : X \to Y,

The correspondence EE subject to the following axioms:

  1. For every pair of composable arrows p,qp,q we have Eqp(f)=Eq(Ep(f))E_{q\circ p}(f)=E_q(E_p(f))
  2. Given a pullback square ApBhhCpD\begin{array}{ccc}A &\overset{p'}\to& B \\_{h'}\downarrow && \downarrow_h\\C &\underset{p}\to& D \end{array} then Ep(f)h=Ep(fh)E_p(f)\circ h = E_{p'}(f\circ h')
  3. If we have a diagram phhq\xleftarrow{p} \underset{h}{\overset{h'}\leftrightarrows} \xrightarrow{q} such that phh=pph'h=p and qhh=qqhh'=q, then Eq(fph)=Eq(Eh(fp))E_q(fph')=E_q(E_h(fp)).

Obscure as these properties may seem, they serve to abstract the properties enjoyed by the left or right extension bifunctor in a 2-category that admits enough structure.

Now, in his "Carrés exacts et carrés déductifs." Guitart claims that whenever P\boldsymbol P is a KZ-monad on a 2-category K\mathcal K, then for every span f:IE,h:IJf : I \to E, h : I \to J, and every P\boldsymbol P-algebra EE, the arrow

Exh(f):=JPJhPIfPEE\text{Ex}_h(f) := J \to \boldsymbol P J \xrightarrow{h^*} \boldsymbol P I \xrightarrow{f_*} \boldsymbol P E \to E

defines an extension structure (page 7 of the paper), and this sets up a deduction structure (previous page).

I haven't the faintest idea how this can be, for two reasons:

Now, however, the deductive structure induced by an extension structure is defined as follows:

image.png

Not only I don't have the faintest idea about how to extend this definition to make sense for a tuple of morphisms to the left of the entailment relation, but I also haven't got any idea of how to prove that {f}Exf\{f\}\vdash_{\text{Ex}} f and that if {f}Exg\{f\}\vdash_{\text{Ex}} g and {g}Exf\{g\}\vdash_{\text{Ex}} f, then f=gf=g. For the first, does it follows that Ex1f=f\text{Ex}_1 f=f? And for the second... I'm even more clueless.

Any help?

view this post on Zulip fosco (Jun 30 2021 at 16:45):

Let me clarify: does it follow from the axioms of an extenseur that E1(f)=fE_1(f)=f? The only thing I'm able to prove at first sight is that E1=E1E1E_1 = E_1\circ E_1.

view this post on Zulip Morgan Rogers (he/him) (Jul 01 2021 at 08:28):

Given any morphism hh, you can form a pullback square whose vertical morphisms are hh and whose horizontal morphisms are identities. Applying 2, we have E1(f)h=E1(fh)E_1(f) \circ h = E_1(f \circ h). Taking ff to be the identity, we have E1(1)h=E1(h)E_1(1) \circ h = E_1(h), so it suffices to show that E1(1)=1E_1(1) = 1 for every identity morphism 1.

view this post on Zulip Amar Hadzihasanovic (Jul 01 2021 at 08:40):

E1(1)E_1(1) is also idempotent: by (2) with h:=E1(1)h := E_1(1) we have E1(1)E1(1)=E1(E1(1))E_1(1) \circ E_1(1) = E_1(E_1(1)), and the latter is equal to E1(1)E_1(1) by (1).

view this post on Zulip Amar Hadzihasanovic (Jul 01 2021 at 08:42):

So you just need it to be cancellable, or equivalently you need E1()E_1(-) to be injective...

view this post on Zulip Morgan Rogers (he/him) (Jul 01 2021 at 08:50):

If C\mathcal{C} isn't required to have all pullbacks, I suspect you could construct a monoid counterexample?

view this post on Zulip Amar Hadzihasanovic (Jul 01 2021 at 09:17):

I think the minimal counterexample may be the monoid with a single idempotent generator, and the E()E_{-}(-) are all constantly the idempotent element.

view this post on Zulip Amar Hadzihasanovic (Jul 01 2021 at 09:28):

The fact is that all the equations involve at least one morphism in the image of EE, and the only one where one of the two sides is not necessarily in the image of EE is still of the form Ex(y)h=Ex(y)E_x(y) \circ h = E_{x'}(y')... so if we can let every Ex(y)E_x(y) be some chosen “left-absorbing” morphism of the correct type, then the equations will hold 'trivially'...

view this post on Zulip Amar Hadzihasanovic (Jul 01 2021 at 09:30):

More precisely, if C\mathcal{C} is such that for all objects XX, we can fix a cocone cXc_X under IdC\mathrm{Id}_\mathcal{C} with tip XX, then for any span (p,f)(p,f) from YY to XX we can let Ep(f)E_p(f) be the component cX(Y):YXc_X(Y): Y \to X of this cocone, and all the equations will hold for trivial reasons.

view this post on Zulip Amar Hadzihasanovic (Jul 01 2021 at 09:32):

Special case: any monoid with a left absorbing element (a “left zero”).

view this post on Zulip Notification Bot (Jul 01 2021 at 10:02):

This topic was moved here from #general: co/appreciation > René Guitart by Matteo Capucci (he/him)

view this post on Zulip fosco (Jul 01 2021 at 19:55):

I agree, yes

view this post on Zulip fosco (Jul 01 2021 at 19:55):

whoops

view this post on Zulip fosco (Jul 01 2021 at 19:56):

Amar Hadzihasanovic said:

E1(1)E_1(1) is also idempotent: by (2) with h:=E1(1)h := E_1(1) we have E1(1)E1(1)=E1(E1(1))E_1(1) \circ E_1(1) = E_1(E_1(1)), and the latter is equal to E1(1)E_1(1) by (1).

I wanted to reply to this