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: Splitting an idempotent to quotient a monad


view this post on Zulip Ralph Sarkis (Jun 18 2021 at 18:06):

I posted some kind of preface here.

Let (M,η,μ)(M,\eta,\mu) be a monad on a category where idempotents split. I have shown that a natural family of idempotent homomorphisms of free MM--algebras MXMXMX \rightarrow MX yields a quotient monad by splitting each component. You can specify this family in three different ways:

  1. An idempotent natural transformation K:idCMidCMK: \mathrm{id}_{\mathbf{C}_M} \Rightarrow \mathrm{id}_{\mathbf{C}_M}, where CM\mathbf{C}_M is the Kleisli category of MM.
  2. An idempotent natural transformation K:MM\overline{K}: M \Rightarrow M such that each KX\overline{K}_X is a homomorphism between the free algebras. (EDIT: I changed this condition because I am not sure what I wrote before is equivalent)
  3. A natural transformation K:idCMK:\mathrm{id}_{\mathbf{C}} \Rightarrow M such that μMK\mu \circ MK is idempotent.

I really like this result (mostly because the proof feels like a classic category theoretical argument where you find the right way to state what you have in a categorical way and everything goes smoothly), but unfortunately, I found only one application and a few settings where I thought I could apply it and ended up proving I can't.

I wanted to know if you found the result interesting or if you think it follows easily from some known results or if you have an idea where it can be applied.

Here is a small paper with lots more details: QuotientIdempotent.pdf

view this post on Zulip Mike Shulman (Jun 18 2021 at 19:59):

Is this different from just having an idempotent on MM in the category of monads?

view this post on Zulip Ralph Sarkis (Jun 18 2021 at 20:29):

In all 3 cases you end up with a natural transformation K:MM\overline{K}:M\Rightarrow M, but it is not necessarily a monad map. In particular, in my worked out example, it is not a monad map.

view this post on Zulip Mike Shulman (Jun 18 2021 at 21:40):

Interesting! Doesn't ring any bells for me yet, though.

view this post on Zulip John Baez (Jun 19 2021 at 00:15):

I really like this result (mostly because the proof feels like a classic category theoretical argument where you find the right way to state what you have in a categorical way and everything goes smoothly), but unfortunately, I found only one application and a few settings where I thought I could apply it and ended up proving I can't.

If it's a nice result with a nice proof you should be able to publish a short paper on it. Not every paper needs to be long and not every paper needs to have applications.

view this post on Zulip Ralph Sarkis (Jun 19 2021 at 04:07):

Hmm... Any conference/journal suggestions? (I am a CS student so I am not sure where this fits in the mathematics community)

I'll try to look up the ones listed on nlab tomorrow.

view this post on Zulip John Baez (Jun 19 2021 at 04:17):

Well, the only "pure" category theory journal I publish in is Theory and Applications of Categories, since Journal of Pure and Applied Algebra is published by Elsevier.

view this post on Zulip John Baez (Jun 19 2021 at 04:19):

(Well, Cahiers is great but I think of that as being more about category theory connected to topology and geometry.)

view this post on Zulip Mike Shulman (Jun 19 2021 at 05:36):

The full name Cahiers de topologie et géométrie différentielle catégoriques certainly suggests that, but it seems to me that they actually publish plenty of pure category theory.

view this post on Zulip dusko (Jun 19 2021 at 09:22):

Ralph Sarkis said:

I posted some kind of preface here.

Let (M,η,μ)(M,\eta,\mu) be a monad on a category where idempotents split. I have shown that a natural family of idempotent homomorphisms of free MM--algebras MXMXMX \rightarrow MX yields a quotient monad by splitting each component. You can specify this family in three different ways:

  1. An idempotent natural transformation K:idCMidCMK: \mathrm{id}_{\mathbf{C}_M} \Rightarrow \mathrm{id}_{\mathbf{C}_M}, where CM\mathbf{C}_M is the Kleisli category of MM.
  2. An idempotent natural transformation K:MM\overline{K}: M \Rightarrow M such that each KX\overline{K}_X is a homomorphism between the free algebras. (EDIT: I changed this condition because I am not sure what I wrote before is equivalent)
  3. A natural transformation K:idCMK:\mathrm{id}_{\mathbf{C}} \Rightarrow M such that μMK\mu \circ MK is idempotent.

I really like this result (mostly because the proof feels like a classic category theoretical argument where you find the right way to state what you have in a categorical way and everything goes smoothly), but unfortunately, I found only one application and a few settings where I thought I could apply it and ended up proving I can't.

I wanted to know if you found the result interesting or if you think it follows easily from some known results or if you have an idea where it can be applied.

Here is a small paper with lots more details: QuotientIdempotent.pdf

nice construction, and nice that you ask about it.

since the idempotents split in C\mathbf{C}, each of the idempotents MXMXMX\rightarrow MX splits in C\mathbf{C}. consider those whose splitting is XX. let MC^M\mathbf{C} be the category where such idempotents are the objects, and the morphisms are the morphisms XYX\rightarrow Y in C\mathbf{C} whose MM-images commute with the idempotents on MXMX and MYMY. then MC^M\mathbf{C} is equivalent to the category of coalgebras on CM\mathbf{C}_M for the comonad obtained by composing the forgetful functor to C\mathbf{C} with the free functor back. this is a consequence of "Quotients in monadic programming" in LICS17 or 18 or better https://arxiv.org/abs/1701.07601.

i am somehow not finding an explicit construction of the components $$KX$ of your natural transformation for an arbitrary monad, which is probably a consequence of a very thick long day on my side. so i am not sure how your construction is related with this. but we seem to be moving around the same set of pebbles.

you ask about applications. the application which drove us to the "Quotients" paper (also called "the coalgebras for a monad") was for programming a family of ciphers functioonaly, and it is sketched in the paper. a slight change of angle opens up a HUGE field of applications: basically the spectral decomposition of adjunctions. that is in
https://arxiv.org/abs/2004.07353
it begins with lots of examples and applications, and it was implemented before it was properly written up. it is an example of a general math result derived from an application. (ross street presented the result in his seminar, which is a math seminar.)

in terms of the above idempotents, the adjunction between MC^M\mathbf{C} and CM\mathbf{C}_M also gives a monad on MC^M\mathbf{C}. the category of algebras for this monad is equivalent with the (Eilenberg-Moore) category of algebras CM\mathbf{C}^M of all MM-algebras. moreover, the category of coalgebras for the induced monad on CM\mathbf{C}^M is again equivalent to MC^M\mathbf{C}. the monad on MC^M\mathbf{C} is the nucleus of the monad MM. there is also a dual category of idempotents carrying the nucleus of the comonad. the quotient monad that you are getting must be related. applegate and tierney insisted on making the quotient (co)monad idempotent, which then sent them yp transfinite towers...

let me know if you figure out how these things are related.

view this post on Zulip John Baez (Jun 19 2021 at 20:21):

Mike Shulman said:

The full name Cahiers de topologie et géométrie différentielle catégoriques certainly suggests that, but it seems to me that they actually publish plenty of pure category theory.

Yeah, I don't quite get it. @Joe Moeller was thinking of trying to publish our paper on Schur functors there, but somehow that paper seems too much like representation theory to belong in something called Cahiers de Topologie et Géométrie Différentielle Catégoriques. I think we may try Higher Structures.

view this post on Zulip John Baez (Jun 19 2021 at 20:23):

There's also a good-looking journal of category I only recently heard about from @David Michael Roberts. It's either Iranian or Iraqi... sorry, I forget.

view this post on Zulip David Michael Roberts (Jun 19 2021 at 21:30):

Iranian. Here it is https://cgasa.sbu.ac.ir/ It's got a bit more of an algebraic focus

view this post on Zulip Mike Shulman (Jun 19 2021 at 23:54):

Names often don't get changed, even when the thing being named has changed so that the name doesn't really apply any more.

view this post on Zulip Ralph Sarkis (May 20 2023 at 21:01):

With @Jean-Baptiste Vienney , we figured out my result above is an instance of the following more abstract result he proved:
image.png

That result seems very natural, so maybe it is already well-known or a consequence of a well-known result. Do you know any reference or examples where this result applies?

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:12):

It sounds like it is not something that people or the literature is familiar with. So let me explain how it is very natural, why it can be useful and give examples. I guess that if people find it interesting it will mean that it is worth try to publish this stuff

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:13):

As @Ralph Sarkis explained in his preprint, computers struggle with working with quotients.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:13):

That's not very surprising when you see how they are defined.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:16):

Given an instance of some kind of algebraic structure, eg. monoids, groups etc... with underlying set XX, you take an equivalence relation RR on this set, which is compatible in a precise way with this algebraic structure. And then the magic happens when you try to define your operations on X/RX/R

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:18):

Let say that you are looking at monoids. Suppose that c,dX/Rc,d \in X/R.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:19):

Then what happens is really difficult to explain, there is a lot of magic

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:21):

You somehow define a function on the couple of equivalence classes of elements of X/RX/R, but in reality when it's written on an example you see that it is not defined on the couples of elements of X/RX/R but on the couple of elements of XX

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:22):

And you say that "the result doesn't depend on the choice of the representatives of these equivalence classes"

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:23):

And you say that "Ok, so I have defined my function from X/R×X/RX/R \times X/R to X/RX/R "

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:24):

It's really funny that you say the the result doesn't depend on the choice of representatives because I'm wondering if you don't use the axiom of choice at some point and then say that your operation doesn't depend on this choices of representatives

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:26):

At the end, what I know is that because of this fuzziness, which can be made clear I'm sure so let's say because of this non-constructivity, you can't program a computer to make computations on some generic quotient.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:27):

Hopefully, some quotients are much better behaved and you can give an algorithm to make the computations on these quotients!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:28):

In the case of quotients of monoids in some monoidal category this is what explains the above proposition.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:29):

Let's see how it works on this example of some group Z/nZ\mathbb{Z}/n\mathbb{Z}

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:29):

We know that (Z,+)(\mathbb{Z},+) is a group and we have algorithms to compute in this group

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:31):

We can look at the function modn:ZZmod_{n}:\mathbb{Z} \rightarrow \mathbb{Z} which takes in an entry some number xZx \in \mathbb{Z} and gives in output the reduction modulo nn of xx which is a number 0modn(x)n10 \le mod_{n} (x) \le n -1

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:32):

It is an idempotent function ie. modn(modn(x))=xmod_{n}(mod_{n}(x)) = x.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:33):

Now let's consider the set [0,n1]={0,...,n1}[0,n-1] = \{0,...,n-1\}.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:35):

modnmod_{n} can be splitted in modn=r;smod_{n}=r;s where r:Z[0,n1]r:\mathbb{Z} \rightarrow [0,n-1] and s:[0,n1]Zs:[0,n-1] \rightarrow \mathbb{Z}

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:35):

and it verifies that s;r=id[0,n1]s;r = id_{[0,n-1]}

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:36):

s:[0,n1]Zs:[0,n-1] \rightarrow \mathbb{Z} is simply the inclusion.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:37):

and r:Z[0,n1]r:\mathbb{Z} \rightarrow [0,n-1] is nothing more than modnmod_{n} but when we have co-restricted the codomain to the image which is [0,n1][0,n-1].

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:38):

You see that what is going to play the role of Z/nZ\mathbb{Z}/n\mathbb{Z} is really that [0,n1][0,n-1]

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:38):

Now I want to define my addition [0,n1]×[0,n1][0,n1][0,n-1] \times [0,n-1] \rightarrow [0,n-1]

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:39):

I already know how to do the addition Z×ZZ\mathbb{Z} \times \mathbb{Z} \rightarrow \mathbb{Z}, abstractly and also on a computer

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:40):

It means that I have a program :Z×ZZ\nabla:\mathbb{Z} \times \mathbb{Z} \rightarrow \mathbb{Z} which perform this addition

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:40):

And I have also a program which give me the unit 00 that I denote η:Z\eta:\ast \rightarrow \mathbb{Z}

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:41):

ie. η()=0\eta(\ast) = 0. This is a constant program

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:42):

My programs \nabla and η\eta verify the axioms of a monoid in a monoidal category ie. the diagrams in this definition commute.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:43):

Now how to use my other programs r,sr,s to define the monoid structure on [0,n1][0,n-1]?

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:43):

This is explained in the last two diagrams of the proposition.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:44):

That's really the obvious way you compose your programs in the only way you can do it.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:46):

I don't really want to write in phrases because it's going to be too long. Do it yourself on this example if you want to understand completely and you will see this is what we must do

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:46):

ie. this exercise 11

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:47):

Now, these operations on [0,n1][0,n-1] really gives a monoid for some reason, it doesn't work magically!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:48):

This is because the idempotent verifies some conditions!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:49):

These conditions are given by the diagrams 33 to 55 in the proposition and they are the obvious conditions to say that "the operations can pass to the quotient", nothing fancy. Check it yourself on this example as exercise 2 if you want to understand it completely

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:50):

I think this is enough written, I don't want to write a paper here.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:50):

But I can tell you that there are much more examples

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:51):

For instance to define the algebra structure on the symmetric algebra from the symmetrization on the tensor algebra when you are in characteristic 00

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:51):

Same thing for the exterior algebra

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:51):

You can also obtain the monad version of the theorem

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:52):

And use is to define the monad structure on the symmetric algebra from the one on the tensor algebra in the same conditions

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:52):

Finally, it explains how to make a quotient in any situation when you can do it constructively

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:52):

I believe that the monad version of the proposition can explain it for all kind of algebras

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:53):

I also believe that you can obtain an idempotent like in the hypotheses from any situation where you can do a quotient if you use the axiom of choice

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:54):

But what is interesting is of course the situation when you can do it without it in order to have a "constructive quotient"

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 16:55):

That's enough. Tell me if you find this story interesting and we will write a paper!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 17:09):

Thank you @Ralph Sarkis . I feel like I don't know anything to how to speak to people and I don't know what think the other guys of this

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 17:10):

Like when nobody says anything you never know if they are bored, they find it absurd or very interesting etc...

view this post on Zulip Ralph Sarkis (May 21 2023 at 17:48):

I think your explanation is great :smiley:

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:07):

Yeah thanks, but I would want to know what think the other guys!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:08):

Because you know, we don't know if people find this valuable, or trivial etc...

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:10):

That's tricky also to explain stuff but not make it too long because if it's too long nobody read it

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:11):

So, if nobody says anything we can try to write the paper and we will see when we submit it :sweat_smile:

view this post on Zulip John Baez (May 21 2023 at 18:22):

My feeling, when looking at those diagrams, is that they express the concept of lifting an idempotent on some object to some monoid with that underlying object.

view this post on Zulip John Baez (May 21 2023 at 18:23):

I.e., that the idempotent and its splitting are monoid homomorphisms.

But I didn't look too hard at the diagrams so I didn't think my guess was worth reporting.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:23):

the idempotent is not a monoid homorphism

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:23):

I give you an example

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:27):

Oh, no I'm not sure, it all depends of what monoid structure you are talking about

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:27):

Because maybe in these conditions, AA is equipped with two monoid structures

view this post on Zulip John Baez (May 21 2023 at 18:27):

All your comments came after I looked at that diagram. I'm just explaining why I didn't say anything, since you guys seemed curious about the silence that you encountered here.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:33):

John Baez said:

I.e., that the idempotent and its splitting are monoid homomorphisms.

But I didn't look too hard at the diagrams so I didn't think my guess was worth reporting.

Yes I think it's true

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:34):

I think rr and ee are monoid morphisms, not sure about ss

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:46):

No, ee is not a monoid morphism, just rr

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:47):

Example:

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:47):

if e:ZZe:\mathbb{Z} \rightarrow \mathbb{Z} is the function which send xx to its representative modulo nn in {0,...,n1}\{0,...,n-1\}

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:48):

then you don't have e(x+y)=e(x)+e(y)e(x+y)=e(x)+e(y)

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:50):

for instance if n=5n=5, then e(4+4)=e(8)=3e(4)+e(4)=4+4=8e(4+4)=e(8)=3 \neq e(4)+e(4)=4+4=8

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:53):

s:{0,...,n1}Zs:\{0,...,n-1\} \rightarrow \mathbb{Z} is neither a monoid morphism

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:53):

Example:

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 18:54):

if n=5n=5, then s(4+4)=s(3)=3s(4)+s(4)=4+4=8s(4+4)=s(3)=3 \neq s(4)+s(4)=4+4=8

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:09):

I'm still trying to prove that rr is a monoid morphism, it should the case

view this post on Zulip David Egolf (May 21 2023 at 19:10):

In the example you gave, if I understand correctly, you set the idempotent e:AAe: A \to A as modn:ZZmod_n: \mathbb{Z} \to \mathbb{Z}. The image of modnmod_n is contained in {0,,n1}\{0, \dots, n-1\}, which I believe is playing the role of BB here.
Do the conditions given on ee, rr and ss always force the image of ee to be contained in BB, so that ee is a sort of "projection" down to BB from AA?

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:13):

Good question, I think I need to know what means "the image of ee is contained in B" to answer

view this post on Zulip David Egolf (May 21 2023 at 19:14):

Yeah, I was just realizing that BB is not necessarily a subset of AA (I'm thinking of the category of sets together with the cartesian product here, as monoidal categories still scare me!)
Heh, I'm not sure to rephrase my question so it makes sense in a more general setting, just yet.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:15):

You could take B=Z/nZB = \mathbb{Z}/n \mathbb{Z} instead but it would give two isomorphic groups.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:21):

(that's what math guys would do but I believe computers would prefer B={0,...,n1}B=\{0,...,n-1\})

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:28):

Actually, people in computational number theory prefer to use the second option I believe

view this post on Zulip David Egolf (May 21 2023 at 19:38):

This seems cool! If I understand, this describes how to make a new monoid from an old monoid and an idempotent that satisfies certain conditions.

I'm curious how varied the resulting produced monoids can be. Continuing the earlier example, what might be a second example of a splitting idempotent e:ZZe: \mathbb{Z} \to \mathbb{Z} with e=sre = s \circ r and rs=idBr \circ s = id_B? Is the resulting induced monoid on BB always isomorphic to Z/nZ\mathbb{Z}/n\mathbb{Z} for some nn?

I guess I'm wondering if the induced structure associated with BB is always a sort of "quotient" of that associated with AA.

At any rate, thanks for taking the time and energy to share your work!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:49):

David Egolf said:

This seems cool! If I understand, this describes how to make a new monoid from an old monoid and an idempotent that satisfies certain conditions.

I'm curious how varied the resulting produced monoids can be. Continuing the earlier example, what might be a second example of a splitting idempotent e:ZZe: \mathbb{Z} \to \mathbb{Z} with e=sre = s \circ r and rs=idBr \circ s = id_B? Is the resulting induced monoid on BB always isomorphic to Z/nZ\mathbb{Z}/n\mathbb{Z} for some nn?

I believe it should be the case! But I'm not sure how to prove it now.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:50):

BB must be a quotient of AA by some subgroup but I don't know how to make this subgroup appear.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:51):

What I already know is that r:ABr:A \rightarrow B is a monoid morphism and moreover an epimorphism

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:53):

Oh no, I think BB is not necessarily isomorphic to a Z/nZ\mathbb{Z}/ n \mathbb{Z}!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:54):

Because we are talking of monoids not necessarily groups.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:54):

So I could quotient Z\mathbb{Z} to obtain B={0,1}\mathbb{B}=\{0,1\} the monoid such that 1+1=11+1=1

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 19:56):

I'm not sure what is the idempotent e:ZZe:\mathbb{Z} \rightarrow \mathbb{Z} that we should take to obtain B\mathbb{B} and not Z/2Z\mathbb{Z}/2\mathbb{Z}.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:00):

I'm not sure about that, I don't know if every quotient monoid of Z\mathbb{Z} is a quotient group of Z\mathbb{Z}

view this post on Zulip David Egolf (May 21 2023 at 20:03):

Hmm, that's interesting.
To get 1+1=1 in BB, would that mean that r(s(1)+s(1))=1r(s(1)+s(1)) = 1? I'm not very comfortable with the monoidal category notation, yet.
If so, I was wondering if this would narrow down what rr and ss can be (and hopefully that would be helpful for figuring out ee, if it exists for this case).

And I think we already know that r(s(1))=1r(s(1)) = 1.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:08):

I did some progress. We know that r:ZBr:\mathbb{Z} \rightarrow B is a monoid morphism from the group (Z,+)(\mathbb{Z},+) and it allows to prove that BB is necessarily a group

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:09):

For every bBb\in B, we have that r(s(b))+b=r(s(b))+r(s(b))=r(s(b)+s(b))=r(0)=0r(-s(b)) + b = r(-s(b))+r(s(b))=r(-s(b)+s(b))=r(0)=0 so that r(s(b))r(-s(b)) is the inverse of bb.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:09):

(second step because rs=Idr \circ s = Id)

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:10):

I also use the fact that rr is always a monoid morphism which is a consequence of the hypotheses

view this post on Zulip David Egolf (May 21 2023 at 20:11):

Very cool! That makes sense!

view this post on Zulip David Egolf (May 21 2023 at 20:12):

I would guess that means in general if AA is a group then BB is a group too.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:12):

Exactly!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:15):

I find it much simpler to work with split idempotents like this than with the usual notions of quotient of a monoid by a congruence that I don't even know!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:17):

So know, that we have two groups, we can look at the kernel of the map r:ZBr:\mathbb{Z} \rightarrow B

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:18):

which is a subgroup ker(r)Zker(r) \subseteq \mathbb{Z}

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:18):

And subgroups of Z\mathbb{Z} are always of the form nZn\mathbb{Z} for some n0n \ge 0

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:19):

So let chose this (unique) nn and write ker(r)=nZZ\ker(r) = n\mathbb{Z} \subseteq \mathbb{Z}

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:23):

Jean-Baptiste Vienney said:

So know, that we have two groups, we can look at the kernel of the map r:ZBr:\mathbb{Z} \rightarrow B

which should be a group morphism I believe ie. r(x)=xr(-x)=-x...

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:30):

By the first isomorphism theorem, we get a morphism of groups u:ZZ/nZu:\mathbb{Z} \rightarrow \mathbb{Z}/n\mathbb{Z} and a morphism of groups v:Z/nZBv:\mathbb{Z}/n\mathbb{Z} \rightarrow B such that r=vur=v\circ u

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:31):

Now, we want to prove that vv is an isomorphism.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:32):

We already know that it is a surjection by the theorem of isomorphism

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:35):

Oh, the first theorem of isomorphism also say that this vv is an isomorphism if rr is a surjection which is the case, so we are done.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 20:37):

To sum up: BZ/nZB \cong \mathbb{Z}/ n\mathbb{Z} where nZ=ker(r)n\mathbb{Z} = ker(r) knowing BB is a group and r:ZBr:\mathbb{Z} \rightarrow B a surjective morphism of group, thanks to the hypotheses on r,sr,s and the fact that Z\mathbb{Z} is a group.

view this post on Zulip David Egolf (May 21 2023 at 20:42):

Very cool!

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 21:03):

I was thinking to a more funky application that @John Baez could like. There is a notion of Schur functor which are functors VeckVeckVec_{k} \rightarrow Vec_{k} for kk a field of characteristic 00. They are defined like this: for every n0n \ge 0 and partition λn\lambda \vdash n, ie. a finite list of numbers n1,...,npn_{1},...,n_{p} such that n1+...+np=nn_{1}+...+n_{p}=n, you have some natural transformation pλ:AnAnp_{\lambda}:A^{\otimes n} \rightarrow A^{\otimes n} which is an idempotent and the Schur functor Sλ:VeckVeckS^{\lambda}:Vec_{k} \rightarrow Vec_{k} is defined exactly as the intermediate functor in a splitting pλ=rλ;sλp_{\lambda}=r_{\lambda};s_{\lambda} of pλp_{\lambda} by two natural transformations. Now this is not exactly the same setting, because we now have families of pλ,rλ,sλp_{\lambda},r_{\lambda},s_{\lambda}, one for every integer partition λn\lambda \vdash n of some integer n0n \ge 0. But we still have that the the (An)n0(A^{\otimes n})_{n \ge 0} form a "graded algebra" ie. we have a family of multiplications n,p:AnApA(n+p)\nabla_{n,p}:A^{\otimes n} \otimes A^{\otimes p} \rightarrow A^{\otimes (n+p)} and a unit η:IA0\eta:I \rightarrow A^{\otimes 0} which verify the same diagrams than for a monoid, modulo the grading. There is a definition here. Well, I think I can adapt this proposition to graded monoids and lift the structure of graded algebra on the (An)n0(A^{\otimes n})_{n \ge 0} to a structure of graded algebra on (Sλ(A))λ(S^{\lambda}(A))_{\lambda} which is not a graded algebra that have been explored so far in the litterature as I know.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 21:05):

knowing that you can define an addition of partitions λ+μn+p\lambda + \mu \vdash n + p in the obvious way if λn\lambda \vdash n and μp\mu \vdash p

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 21:07):

Actually, I think that there is a more complex structure of something like a graded bialgebra which is something I plan to explore during my phd but that would be a first step to know that we have a graded algebra.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 21:12):

There is a well-known open problem about something named Plethysm which is basically to understand what happens when you compose these functors SλSμS^{\lambda}\circ S^{\mu} and I believe that this theorem now in a version "graded monad" could be interesting at least to me to see that you can't apply it to this situation.

view this post on Zulip Jean-Baptiste Vienney (May 21 2023 at 21:14):

Or maybe, you can, I don't know if the Schur functors give a "graded monad".

view this post on Zulip Tom Hirschowitz (May 25 2023 at 07:35):

Sorry I'm late to the party and didn't take the time to read in depth, but is your result related to Lemma 6.22 here?
lemma6-22.png

view this post on Zulip Ralph Sarkis (May 25 2023 at 13:06):

I want to say yes it is related to the original result on quotienting a monad (preprint here). I am in the special case where XX and ZZ are the free TT-algebra on some XX, and mm is a section of ee. I do get the same TT-algebra structure that you define on the splitting which I call TKXT^KX, but it is not really explicit there because I only derive that there is a monad structure on TKT^K (when I have that splitting for every XX). The free TKT^K algebra does factor through that TT-algebra you define, so your lemma could be another starting point to get my result.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 11:16):

Ralph Sarkis said:

With Jean-Baptiste Vienney , we figured out my result above is an instance of the following more abstract result he proved:
image.png

That result seems very natural, so maybe it is already well-known or a consequence of a well-known result. Do you know any reference or examples where this result applies?

I recently came across a situation in which one has a retraction of a monoid satisfying some axioms that imply that the retract is also a monoid, and I remembered this thread. However, the situation I have is slightly different. Rather than the two axioms involving ee and rr, I have a single axiom involving ss and ee.
image.png

As far as I can tell, neither set of assumptions implies the other. In my situation, ss becomes a monoid morphism (whereas rr is not); whereas later in the discussion Jean-Baptiste mentions that in your situation rr becomes a monoid morphism (whereas ss is not). So perhaps these two results are complementary, in giving natural sufficient conditions for each of ss and rr to be monoid morphisms.

view this post on Zulip Ralph Sarkis (Aug 17 2023 at 12:28):

That's great! We have been thinking about this recently with Jean-Baptiste, and we streamlined our thoughts a bit, I'll try to summarize my understanding at this moment.

We work in categories of "algebras" in some category C\mathbf{C} (our worked out examples are monoids in C\mathbf{C} or MM-algebras for some monad MM, and we are not sure if either is more general than the other).

Suppose AA is an object of C\mathbf{C} underlying an algebra A\mathbb{A} and BB is a retract of AA, i.e. there is a split idempotent AeA=ArBsAA \stackrel{e}{\rightarrow} A = A \stackrel{r}{\rightarrow} B \stackrel{s}{\rightarrow} A. Intuitively, there is a natural way one could see BB as an algebra by embedding it in AA with ss and going back to BB with rr whenever necessary. More formally (in our worked out cases), we can define the monoid on BB and the MM-algebra on BB respecitively as follows (the second one is exactly like in Tom's result):
image.png
image.png

Now our results state that:

It is weird because we are checking the conditions of a homomorphism without knowing that the (co)domain BB is an algebra, and once we know they are true, we conclude that in fact BB is an algebra.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 12:35):

Right, the assumption I gave is exactly what is necessary for ss to be a "tentative homomorphism" in this sense. So it seems like you've already covered my observation! I'll happily cite your paper when it's ready :)

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 12:36):

(I actually need something that is slightly more general, namely the result for monoids in a multicategory rather than a monoidal category. But it's no more difficult to prove.)

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 12:43):

Ralph Sarkis said:

Now our results state that:

In fact (as I'm sure you observed), something slightly stronger is also true: the algebra structure on BB is unique such that ss (and presumably alternatively rr) is a homomorphism.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 13:58):

Nathanael Arkor said:

Ralph Sarkis said:

With Jean-Baptiste Vienney , we figured out my result above is an instance of the following more abstract result he proved:
image.png

That result seems very natural, so maybe it is already well-known or a consequence of a well-known result. Do you know any reference or examples where this result applies?

I recently came across a situation in which one has a retraction of a monoid satisfying some axioms that imply that the retract is also a monoid, and I remembered this thread. However, the situation I have is slightly different. Rather than the two axioms involving ee and rr, I have a single axiom involving ss and ee.
image.png

As far as I can tell, neither set of assumptions implies the other. In my situation, ss becomes a monoid morphism (whereas rr is not); whereas later in the discussion Jean-Baptiste mentions that in your situation rr becomes a monoid morphism (whereas ss is not). So perhaps these two results are complementary, in giving natural sufficient conditions for each of ss and rr to be monoid morphisms.

We have reduced the axioms to a single diagram since last time:
Screenshot-2023-08-17-at-9.56.31-AM.png
And yes it's not the same than yours. That's really interesting...

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 14:03):

Our result can be adapted to three settings: monoids in a monoidal category, monads and algebras over a monad. That's great if it also works for monoids in a multicategory!

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 14:05):

I don't think we have covered your observation. Personally, I have never thought to what you say @Nathanael Arkor . Maybe @Ralph Sarkis has, I don't know :upside_down:

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 14:18):

I don't know what kind of mysterious duality would permit to go from one result to the other one...

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 14:20):

Ralph Sarkis said:

Now our results state that:

It is weird because we are checking the conditions of a homomorphism without knowing that the (co)domain BB is an algebra, and once we know they are true, we conclude that in fact BB is an algebra.

I completely agree with that, this is the story, but to be precise the first thing is from us, and the second one from Nathanael.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 14:26):

I think we're going to write the paper very quickly with what we have understood. Maybe in one week or two, it will be one the ArXiv and I'm very glad if you're going to cite it and complete the story!

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 19:44):

I completely agree with that, this is the story, but to be precise the first thing is from us, and the second one from Nathanael.

Ah, I see :)

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 19:44):

Jean-Baptiste Vienney said:

I think we're going to write the paper very quickly with what we have understood. Maybe in one week or two, it will be one the ArXiv and I'm very glad if you're going to cite it and complete the story!

I'll be very interested to read it!

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 19:46):

Jean-Baptiste Vienney said:

We have reduced the axioms to a single diagram since last time:
Screenshot-2023-08-17-at-9.56.31-AM.png

Ah, this looks much more "symmetric" with respect to the axiom I mentioned, which is satisfying.

view this post on Zulip James Deikun (Aug 17 2023 at 19:51):

Doesn't it still work if you use ee instead of rr in that axiom? Because ss is going to be a mono.

view this post on Zulip James Deikun (Aug 17 2023 at 19:52):

That seems a bit more satisfying because the axiom doesn't have to mention the splitting.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 19:54):

James Deikun said:

Doesn't it still work if you use ee instead of rr in that axiom? Because ss is going to be a mono.

Yes, it works if you use ee instead of rr (the two diagrams are equivalent), but you still need the splitting in order to define the structure of monoid on BB

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 19:54):

which uses rr and ss but not ee

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 20:33):

Nathanael Arkor said:

Ralph Sarkis said:

With Jean-Baptiste Vienney , we figured out my result above is an instance of the following more abstract result he proved:
image.png

That result seems very natural, so maybe it is already well-known or a consequence of a well-known result. Do you know any reference or examples where this result applies?

I recently came across a situation in which one has a retraction of a monoid satisfying some axioms that imply that the retract is also a monoid, and I remembered this thread. However, the situation I have is slightly different. Rather than the two axioms involving ee and rr, I have a single axiom involving ss and ee.
image.png

As far as I can tell, neither set of assumptions implies the other. In my situation, ss becomes a monoid morphism (whereas rr is not); whereas later in the discussion Jean-Baptiste mentions that in your situation rr becomes a monoid morphism (whereas ss is not). So perhaps these two results are complementary, in giving natural sufficient conditions for each of ss and rr to be monoid morphisms.

I'm not sure I understand that: I agree that if BB is a monoid, with the "tentative structure of monoid", then ss is going to be a morphism of monoids. However, I don't see how to prove that BB is a monoid?

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 20:36):

Maybe what you can prove is instead that if you start with a monoid BB, and given some axiom, if you define the "tentative structure of monoid" on AA, you obtain that AA is a monoid and ss a monoid morphism?

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 20:47):

Jean-Baptiste Vienney said:

I'm not sure I understand that: I agree that if BB is a monoid, with the "tentative structure of monoid", then ss is going to be a morphism of monoids. However, I don't see how to prove that BB is a monoid?

I haven't checked too carefully yet, so I could have made a mistake. But the unit laws should follow for the same reason as in the case that rr is a homomorphism, because the unit laws in both cases are the same. I believe the associativity law should then follow by commutativity of the following diagram (if you interpret the comma as tensor, and elide the structural transformations).
image.png

view this post on Zulip James Deikun (Aug 17 2023 at 20:49):

It's (a little) clearer in the monad algebra version:

b=raTsbTb=raTsTb=raT(sb)=raT(aTs)=r(aTa)TTs=ra(μTTs)=(raTs)μ=bμ\begin{align*} b &= r \circ a \circ Ts \\ \\ b \circ Tb &= r \circ a \circ Ts \circ Tb = r \circ a \circ T (s \circ b) \\ &= r \circ a \circ T (a \circ Ts) = r \circ (a \circ Ta) \circ TTs \\ &= r \circ a \circ (\mu \circ TTs) = (r \circ a \circ Ts) \circ \mu \\ &= b \circ \mu \end{align*}

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:01):

I agree with the fact that the associativity is verified. But I didn't suceed to prove the unitality.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:02):

Nathanael Arkor said:

Jean-Baptiste Vienney said:

I'm not sure I understand that: I agree that if BB is a monoid, with the "tentative structure of monoid", then ss is going to be a morphism of monoids. However, I don't see how to prove that BB is a monoid?

But the unit laws should follow for the same reason as in the case that rr is a homomorphism, because the unit laws in both cases are the same.
image.png

This is maybe the problem, I tried to prove it in the same way, but it wasn't the same.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:07):

Note that with our axiom, this axiom is crucial to prove the unitality, even if it seems weird as this axiom seems to have nothing to do with the units.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:08):

Jean-Baptiste Vienney said:

Note that with our axiom, this axiom is crucial to prove the unitality, even if it seems weird as this axiom seems to have nothing to do with the units.

Oh, interesting. This is what I had sketched out for left unitality:
image.png

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:09):

Observing that the bottom-left path is equal to the identity.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:21):

Hmm, how do you get the commutativity of this triangle?
Screenshot-2023-08-17-at-5.19.14-PM.png

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:22):

Maybe you need to assume it as an axiom. It was in the list of three axioms that I gave the other time, which is equivalent to the single axiom we gave today.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:23):

Jean-Baptiste Vienney said:

Maybe you need to assume it as an axiom. It was in the list of three axioms that I gave the other time, which is equivalent to the single axiom we gave today.

Oh, yes, I'm assuming that as an axiom.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:23):

I overlooked that you had eliminated that axiom.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:23):

image.png
These are the axioms I'm assuming.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:25):

Oh, ok, I see, this is why I was confused. With these two axioms, everything looks good!

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:26):

The asymmetry between the section and retraction cases is curious. But they're still not too dissimilar.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:26):

Jean-Baptiste Vienney said:

Oh, ok, I see, this is why I was confused. With these two axioms, everything looks good!

Sorry, that was my fault for not checking your screenshot more carefully :sweat_smile:

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:33):

Oh, but we understood better the differences between the two cases thanks to that. So that was not a too bad mistake ahah

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:34):

Nathanael Arkor said:

The asymmetry between the section and retraction cases is curious. But they're still not too dissimilar.

I agree that it is curious. The asymmetry comes maybe from the fact that the definition of the unit uses only rr and not ss contrary to the one of the multiplication.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:37):

In our case, you don't need ηA;e=ηA\eta_A;e=\eta_A to prove the proposition, although I maybe used it the first time. And it doesn't seem to be a consequence of our axioms. Nevertheless, I didn't find any example where it is not verified for the moment.

view this post on Zulip Nathanael Arkor (Aug 17 2023 at 21:38):

Jean-Baptiste Vienney said:

In our case, you don't need ηA;e=ηA\eta_A;e=\eta_A to prove the proposition, although I maybe used it the first time. And it doesn't seem to be a consequence of our axioms. Nevertheless, I didn't find any example where it is not verified for the moment.

Curiously, in the ss homomorphism case, you also get that rr preserves the unit (though not the multiplication). But I'm not sure it's a useful fact.

view this post on Zulip Jean-Baptiste Vienney (Aug 17 2023 at 21:40):

Oh, this is because the definition of the unit of BB is exactly the equation of the preservation of the unit by rr!

view this post on Zulip Tomáš Jakl (Aug 23 2023 at 17:12):

This discussion resembles so much what is in

view this post on Zulip Tomáš Jakl (Aug 23 2023 at 17:15):

in fact, one can make a little more concrete situation than that of Definition 2.2.4 therein. For a given monad MM we can assume that every object M(A)M(A) has a an idempotent split M(A)N(A)M(A)M(A) \to N(A) \to M(A). If this split satisfies conditions similar to those above we obtain that N()N(-) carries a structure of a monad and that the section part of the splitting is natural and, in fact, forms a monad morphism.

view this post on Zulip Ralph Sarkis (Aug 23 2023 at 17:50):

I discovered (or maybe invented :laughing:) this paper some time ago but after I stopped intensely working on distributive laws, so maybe I should take the opportunity to read it this time.

view this post on Zulip Ralph Sarkis (Aug 23 2023 at 17:53):

I guess us and that paper talk about quotient and submonads, so there will be bridges, but there is no direct mention of an idempotent or a splitting there.

Tomáš Jakl said:

in fact, one can make a little more concrete situation than that of Definition 2.2.4 therein. For a given monad MM we can assume that every object M(A)M(A) has a an idempotent split M(A)N(A)M(A)M(A) \to N(A) \to M(A). If this split satisfies conditions similar to those above we obtain that N()N(-) carries a structure of a monad and that the section part of the splitting is natural and, in fact, forms a monad morphism.

Where did you get that result from? It was the one that started this whole discussion a couple of years ago.

view this post on Zulip Jean-Baptiste Vienney (Aug 23 2023 at 20:57):

Jean-Baptiste Vienney said:

It's really funny that you say the the result doesn't depend on the choice of representatives because I'm wondering if you don't use the axiom of choice at some point and then say that your operation doesn't depend on this choices of representatives

This is only know that I have understood what I wrote here. Defining the notion of quotient of any algebraic structure in mathematics requires to use the axiom of the choice. Let EE be a set and \sim be an equivalence relation on EE. Supose that (E,η,)(E,\eta,\nabla) is a monoid. Let r:EE/r:E \rightarrow E/\sim be the canonical projection. I'm almost sure that the phrase "the result of the multiplication doesn't depend on the choice of representatives" is true if and only if for every choice of a section s:E/Es:E/\sim \rightarrow E of rr, this diagram commutes :
Screenshot-2023-08-23-at-5.04.10-PM.png
By using the axiom of choice, we can then define a structure of monoid on E/E/\sim by chosing a section ss of rr and defining:
Screenshot-2023-08-23-at-4.53.08-PM.png
We can then show that η~\tilde{\eta} and ~\tilde{\nabla} don't depend on the choice of the section ss.

This is what textbooks do, when they define quotients. Therefore, if you assume the axiom of choice, our paper will actually talk about all kind of quotients in mathematics, not only the especially well-behaved ones. But you don't need the axiom of choice to define the algebraic structures on Z,Z/nZ,Q\mathbb{Z},\mathbb{Z}/n\mathbb{Z},\mathbb{Q} and even R\mathbb{R} from the structure of semi-ring of N\mathbb{N} because in each of these cases, there is a natural choice of section ss. We will explain this in the paper.

view this post on Zulip Jean-Baptiste Vienney (Aug 23 2023 at 21:42):

Apparently, you don't need the axiom of choice to define quotients, but I don't understand how for the moment...

view this post on Zulip Patrick Nicodemus (Aug 24 2023 at 00:18):

Do you want like, a set theory explanation or a type theory explanation or what? What are your foundations? What is a quotient?

view this post on Zulip Patrick Nicodemus (Aug 24 2023 at 00:20):

In ZFC set theory, a function is, by definition, a functional relation. So if XX and YY are sets, a function from XX to YY is defined to be a subset RR of X×YX\times Y that satisfies the law xX,!yY,R(x,y)\forall x\in X,\exists ! y \in Y, R(x,y).

view this post on Zulip Patrick Nicodemus (Aug 24 2023 at 00:23):

If XX is a set and \sim is an equivalence relation on XX, then X/X/\sim is defined to be the set of all equivalence classes of XX. If f:XYf : X\to Y is a function, then we can define a relation R(X/)×YR\subset (X/\sim)\times Y by R(A,y)    xA,f(x)=yR(A,y)\iff \exists x\in A, f(x)=y. This relation can always be defined. If the relation happens to be a functional relation, i.e., it is total and single valued, then we say that "ff induces a function f~\tilde{f} from X/X/\sim to YY" but all that is happening is that we are proving this relationship is total and single-valued.

view this post on Zulip Patrick Nicodemus (Aug 24 2023 at 00:26):

Using the existential quantifier doesn't depend on the axiom of choice. If you know that x.A(x)\exists x. A(x), you can say "Let xx be an element satisfying property AA". Do you have to "choose" such an xx? Yes. But this is fundamentally not what the axiom of choice is concerned with.

view this post on Zulip Jean-Baptiste Vienney (Aug 24 2023 at 00:30):

I want a set theory explanation. The question is how to define the new multiplication on the set of equivalence classes of a monoid by a congruence.

view this post on Zulip Jean-Baptiste Vienney (Aug 24 2023 at 00:34):

Ok, so you define a relation R((X/)×(X/))×(X/)R \subset ((X/\sim) \times (X/\sim)) \times (X/\sim) by R((c,d),e)x,y,zX, x=c,y=d,z=e, x.y=z}R((c,d),e) \Leftrightarrow \exists x,y,z \in X, ~\overline{x}=c, \overline{y}=d, \overline{z}=e,~x.y=z \} I guess. And then it is a function, and it is your new multiplication.

view this post on Zulip Patrick Nicodemus (Aug 24 2023 at 00:36):

Yes, that should be correct, I hope this makes sense. It is not necessarily a function, but checking that it is a function is equivalent to what people usually mean when they talk about "well-definedness".

view this post on Zulip Jean-Baptiste Vienney (Aug 24 2023 at 00:37):

Yes, it makes sense, thanks!

view this post on Zulip Jean-Baptiste Vienney (Aug 24 2023 at 00:50):

I had never thought that you could start by defining a relation and then prove that it is a function.

view this post on Zulip Mike Shulman (Aug 24 2023 at 01:12):

More generally, the same proof shows that the quotient of any equivalence relation has the universal property of a [[coequalizer]] in the category of ZFC-sets. And once one has that, the fact that multiplication can be defined on a quotient monoid follows from abstract categorical arguments.

view this post on Zulip Jean-Baptiste Vienney (Aug 24 2023 at 01:15):

It is the coequalizer of which morphisms?

view this post on Zulip Mike Shulman (Aug 24 2023 at 01:22):

If EE is an equivalence relation on XX, then EX×XE\subseteq X\times X, so regarding EE as a set in its own right there are two projection maps EXE \rightrightarrows X. The quotient is the coequalizer of those two functions.

view this post on Zulip Tomáš Jakl (Aug 24 2023 at 08:48):

Ralph Sarkis said:

I guess us and that paper talk about quotient and submonads, so there will be bridges, but there is no direct mention of an idempotent or a splitting there.
...
Where did you get that result from? It was the one that started this whole discussion a couple of years ago.

I invented a version of this for myself in my thesis (Section 4.1.2) some time ago. More recently in the game comonad programme we needed to create new comonads from old and I came up with different idempotent split conditions to those that are in my thesis that also make this work. If you're interested I can try to extract it from my notes.

view this post on Zulip Ralph Sarkis (Aug 24 2023 at 09:40):

This looks so close :grimacing:. We did not consider going to a subcategory as you did, and for some reason, your section ss is not even a natural transformation, but it is in our case. To avoid going back to the start of this topic, here are the three conditions (the first is stronger than the second and third which are equivalent) I had when dealing with monads only:
image.png

view this post on Zulip Tomáš Jakl (Aug 24 2023 at 11:49):

Interestingly, in my game comonad use case ss is a monad morphism.

view this post on Zulip Tomáš Jakl (Aug 24 2023 at 11:51):

My situation (stated for comonads, so the retract rr becomes the comonad morphism):
image.png

view this post on Zulip Tomáš Jakl (Aug 24 2023 at 11:52):

(it's all stated in terms of Kleisli representations where ε\varepsilon is the counit of the comonad and ()\overline{(-)} is the coextension operation)

view this post on Zulip Graham Manuell (Aug 25 2023 at 18:31):

Nathanael Arkor said:

I recently came across a situation in which one has a retraction of a monoid satisfying some axioms that imply that the retract is also a monoid, and I remembered this thread. However, the situation I have is slightly different. Rather than the two axioms involving ee and rr, I have a single axiom involving ss and ee.
image.png

In case anyone is interested, I have also seen this version come up: I use what is essentially an instance of this in my paper on quotient locales. See the (rather terse) first paragraph on page 7. I am in the category of dcpos and there are two monoid structures (given joins and meets). My version of the condition is stated with inequalities, but the reverse inequality is automatic.

view this post on Zulip Ralph Sarkis (Aug 25 2023 at 19:19):

Awesome :sunglasses: Are dcpos monadic over Set ?

view this post on Zulip Graham Manuell (Aug 25 2023 at 19:39):

They are not. I think they are monadic over the category of posets.

view this post on Zulip Jean-Baptiste Vienney (Aug 25 2023 at 20:43):

Does anyone of you @Nathanael Arkor , @Tomáš Jakl , @Graham Manuell have some intuition on why ss is a morphism of algebras and not rr? In classical algebra, rr is the projection to the quotient and preserves the algebraic structure. Why is it ss which preserves the structure in these situations and not rr and how should I interpret it? It looks like your contexts are more on the topological/geometrical side of mathematics than on the algebraic side. It has maybe something to do with that.

view this post on Zulip Nathanael Arkor (Aug 25 2023 at 21:02):

I can share what my example is. I don't have an intuition for why it happens to be an example of this phenomenon.

Let AA be a category. Then there is a multicategory of endo-distributors (a.k.a. endo-profunctors) A↛AA \not\to A and natural transformations. Let t ⁣:AEt \colon A \to E be a functor. This functor induces a monoid E(t,t) ⁣:A↛AE(t, t) \colon A \not\to A in the aforementioned multicategory (a.k.a. promonad). A [[relative monad]] with carrier tt is precisely a section of this monoid whose underlying distributor is "tt-corepresentable" (i.e. of the form E(j,t)E(j, t) for some functor j ⁣:AEj \colon A \to E).

view this post on Zulip Nathanael Arkor (Aug 25 2023 at 21:03):

It was quite surprising to me that the axioms for a relative monad turned out to be exactly the axioms for a monoid section.

view this post on Zulip Jean-Baptiste Vienney (Aug 26 2023 at 01:36):

That's a beautiful example and it was very satisfying to unpack it to see that it gives something that really looks like a relative monad. It's maybe even a better formulation because you replace three axioms by an only one, and you get the morphism of promonads.

view this post on Zulip Jean-Baptiste Vienney (Aug 26 2023 at 02:14):

I found a simple algebraic example of this situation: In the category of R\mathbb{R}-vector spaces, consider the two vector spaces R\mathbb{R} and C\mathbb{C}. Consider (s:= ):RC(s :=~ \subseteq) :\mathbb{R} \rightarrow \mathbb{C} the inclusion and (r:=R):CR(r := \mathfrak{R}):\mathbb{C} \rightarrow \mathbb{R} the real part map. Then, ss and rr are R\mathbb{R}-linear maps. Moreover s;r=1Rs;r=1_{\mathbb{R}} (but r;s1Cr;s \neq 1_{\mathbb{C}}). Both R\mathbb{R} and C\mathbb{C} are R\mathbb{R}-algebras and ss is a morphism of R\mathbb{R}-algebras, but not rr because R(ab)R(a)R(b)\mathfrak{R}(ab) \neq \mathfrak{R}(a)\mathfrak{R}(b).

view this post on Zulip Jean-Baptiste Vienney (Aug 26 2023 at 02:15):

In this example, the intution is that ss is the inclusion of a sub-object which preserves the algebraic structure. But not necessarily rr, which is not the projection on a quotient.

view this post on Zulip Jean-Baptiste Vienney (Aug 26 2023 at 17:11):

In fact, it works with any field extension.

If you have two fields K,LK,L such that LL is an extension of KK, ie. you have a morphism of rings (s:=ρ):KL(s := \rho):K \rightarrow L, then by restriction of scalars, LL is a KK vector-space, and ρ\rho is a KK-linear map. Moreover, both KK and LL are KK-algebras and ρ\rho is a morphism of KK-algebras.

In addition to that, consider a decomposition L=Im(ρ)EL=Im(\rho) \oplus E of KK-vector spaces.
You can define r:LKr:L \rightarrow K to be the projection LIm(ρ)L \rightarrow Im(\rho) followed by the isomorphism Im(ρ)KIm(\rho) \cong K (recall that any homomorphism of rings with domain a field is injective). They are both KK-linear maps and rr is thus a KK-linear map. Moreover s;r=1Ks;r=1_{K}. But rr is not necessarily a morphism of KK-algebras as shown in the previous example.

view this post on Zulip Nathanael Arkor (Apr 11 2024 at 22:52):

Nathanael Arkor said:

It was quite surprising to me that the axioms for a relative monad turned out to be exactly the axioms for a monoid section.

(By the way, this now appears as §3 of The pullback theorem for relative monads.)

view this post on Zulip Jean-Baptiste Vienney (Apr 14 2024 at 00:30):

@Ralph Sarkis, I think it would be useful that we finally write our paper now that Nathanael cited us in a preprint. :smile: