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.
I posted some kind of preface here.
Let be a monad on a category where idempotents split. I have shown that a natural family of idempotent homomorphisms of free --algebras yields a quotient monad by splitting each component. You can specify this family in three different ways:
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
Is this different from just having an idempotent on in the category of monads?
In all 3 cases you end up with a natural transformation , but it is not necessarily a monad map. In particular, in my worked out example, it is not a monad map.
Interesting! Doesn't ring any bells for me yet, though.
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.
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.
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.
(Well, Cahiers is great but I think of that as being more about category theory connected to topology and geometry.)
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.
Ralph Sarkis said:
I posted some kind of preface here.
Let be a monad on a category where idempotents split. I have shown that a natural family of idempotent homomorphisms of free --algebras yields a quotient monad by splitting each component. You can specify this family in three different ways:
- An idempotent natural transformation , where is the Kleisli category of .
- An idempotent natural transformation such that each is a homomorphism between the free algebras. (EDIT: I changed this condition because I am not sure what I wrote before is equivalent)
- A natural transformation such that 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 , each of the idempotents splits in . consider those whose splitting is . let be the category where such idempotents are the objects, and the morphisms are the morphisms in whose -images commute with the idempotents on and . then is equivalent to the category of coalgebras on for the comonad obtained by composing the forgetful functor to 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 and also gives a monad on . the category of algebras for this monad is equivalent with the (Eilenberg-Moore) category of algebras of all -algebras. moreover, the category of coalgebras for the induced monad on is again equivalent to . the monad on is the nucleus of the monad . 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.
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.
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.
Iranian. Here it is https://cgasa.sbu.ac.ir/ It's got a bit more of an algebraic focus
Names often don't get changed, even when the thing being named has changed so that the name doesn't really apply any more.
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?
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
As @Ralph Sarkis explained in his preprint, computers struggle with working with quotients.
That's not very surprising when you see how they are defined.
Given an instance of some kind of algebraic structure, eg. monoids, groups etc... with underlying set , you take an equivalence relation 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
Let say that you are looking at monoids. Suppose that .
Then what happens is really difficult to explain, there is a lot of magic
You somehow define a function on the couple of equivalence classes of elements of , but in reality when it's written on an example you see that it is not defined on the couples of elements of but on the couple of elements of
And you say that "the result doesn't depend on the choice of the representatives of these equivalence classes"
And you say that "Ok, so I have defined my function from to "
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
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.
Hopefully, some quotients are much better behaved and you can give an algorithm to make the computations on these quotients!
In the case of quotients of monoids in some monoidal category this is what explains the above proposition.
Let's see how it works on this example of some group
We know that is a group and we have algorithms to compute in this group
We can look at the function which takes in an entry some number and gives in output the reduction modulo of which is a number
It is an idempotent function ie. .
Now let's consider the set .
can be splitted in where and
and it verifies that
is simply the inclusion.
and is nothing more than but when we have co-restricted the codomain to the image which is .
You see that what is going to play the role of is really that
Now I want to define my addition
I already know how to do the addition , abstractly and also on a computer
It means that I have a program which perform this addition
And I have also a program which give me the unit that I denote
ie. . This is a constant program
My programs and verify the axioms of a monoid in a monoidal category ie. the diagrams in this definition commute.
Now how to use my other programs to define the monoid structure on ?
This is explained in the last two diagrams of the proposition.
That's really the obvious way you compose your programs in the only way you can do it.
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
ie. this exercise
Now, these operations on really gives a monoid for some reason, it doesn't work magically!
This is because the idempotent verifies some conditions!
These conditions are given by the diagrams to 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
I think this is enough written, I don't want to write a paper here.
But I can tell you that there are much more examples
For instance to define the algebra structure on the symmetric algebra from the symmetrization on the tensor algebra when you are in characteristic
Same thing for the exterior algebra
You can also obtain the monad version of the theorem
And use is to define the monad structure on the symmetric algebra from the one on the tensor algebra in the same conditions
Finally, it explains how to make a quotient in any situation when you can do it constructively
I believe that the monad version of the proposition can explain it for all kind of algebras
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
But what is interesting is of course the situation when you can do it without it in order to have a "constructive quotient"
That's enough. Tell me if you find this story interesting and we will write a paper!
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
Like when nobody says anything you never know if they are bored, they find it absurd or very interesting etc...
I think your explanation is great :smiley:
Yeah thanks, but I would want to know what think the other guys!
Because you know, we don't know if people find this valuable, or trivial etc...
That's tricky also to explain stuff but not make it too long because if it's too long nobody read it
So, if nobody says anything we can try to write the paper and we will see when we submit it :sweat_smile:
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.
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.
the idempotent is not a monoid homorphism
I give you an example
Oh, no I'm not sure, it all depends of what monoid structure you are talking about
Because maybe in these conditions, is equipped with two monoid structures
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.
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
I think and are monoid morphisms, not sure about
No, is not a monoid morphism, just
Example:
if is the function which send to its representative modulo in
then you don't have
for instance if , then
is neither a monoid morphism
Example:
if , then
I'm still trying to prove that is a monoid morphism, it should the case
In the example you gave, if I understand correctly, you set the idempotent as . The image of is contained in , which I believe is playing the role of here.
Do the conditions given on , and always force the image of to be contained in , so that is a sort of "projection" down to from ?
Good question, I think I need to know what means "the image of is contained in B" to answer
Yeah, I was just realizing that is not necessarily a subset of (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.
You could take instead but it would give two isomorphic groups.
(that's what math guys would do but I believe computers would prefer )
Actually, people in computational number theory prefer to use the second option I believe
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 with and ? Is the resulting induced monoid on always isomorphic to for some ?
I guess I'm wondering if the induced structure associated with is always a sort of "quotient" of that associated with .
At any rate, thanks for taking the time and energy to share your work!
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 with and ? Is the resulting induced monoid on always isomorphic to for some ?
I believe it should be the case! But I'm not sure how to prove it now.
must be a quotient of by some subgroup but I don't know how to make this subgroup appear.
What I already know is that is a monoid morphism and moreover an epimorphism
Oh no, I think is not necessarily isomorphic to a !
Because we are talking of monoids not necessarily groups.
So I could quotient to obtain the monoid such that
I'm not sure what is the idempotent that we should take to obtain and not .
I'm not sure about that, I don't know if every quotient monoid of is a quotient group of
Hmm, that's interesting.
To get 1+1=1 in , would that mean that ? I'm not very comfortable with the monoidal category notation, yet.
If so, I was wondering if this would narrow down what and can be (and hopefully that would be helpful for figuring out , if it exists for this case).
And I think we already know that .
I did some progress. We know that is a monoid morphism from the group and it allows to prove that is necessarily a group
For every , we have that so that is the inverse of .
(second step because )
I also use the fact that is always a monoid morphism which is a consequence of the hypotheses
Very cool! That makes sense!
I would guess that means in general if is a group then is a group too.
Exactly!
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!
So know, that we have two groups, we can look at the kernel of the map
which is a subgroup
And subgroups of are always of the form for some
So let chose this (unique) and write
Jean-Baptiste Vienney said:
So know, that we have two groups, we can look at the kernel of the map
which should be a group morphism I believe ie. ...
By the first isomorphism theorem, we get a morphism of groups and a morphism of groups such that
Now, we want to prove that is an isomorphism.
We already know that it is a surjection by the theorem of isomorphism
Oh, the first theorem of isomorphism also say that this is an isomorphism if is a surjection which is the case, so we are done.
To sum up: where knowing is a group and a surjective morphism of group, thanks to the hypotheses on and the fact that is a group.
Very cool!
I was thinking to a more funky application that @John Baez could like. There is a notion of Schur functor which are functors for a field of characteristic . They are defined like this: for every and partition , ie. a finite list of numbers such that , you have some natural transformation which is an idempotent and the Schur functor is defined exactly as the intermediate functor in a splitting of by two natural transformations. Now this is not exactly the same setting, because we now have families of , one for every integer partition of some integer . But we still have that the the form a "graded algebra" ie. we have a family of multiplications and a unit 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 to a structure of graded algebra on which is not a graded algebra that have been explored so far in the litterature as I know.
knowing that you can define an addition of partitions in the obvious way if and
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.
There is a well-known open problem about something named Plethysm which is basically to understand what happens when you compose these functors 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.
Or maybe, you can, I don't know if the Schur functors give a "graded monad".
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
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 and are the free -algebra on some , and is a section of . I do get the same -algebra structure that you define on the splitting which I call , but it is not really explicit there because I only derive that there is a monad structure on (when I have that splitting for every ). The free algebra does factor through that -algebra you define, so your lemma could be another starting point to get my result.
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.pngThat 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 and , I have a single axiom involving and .
image.png
As far as I can tell, neither set of assumptions implies the other. In my situation, becomes a monoid morphism (whereas is not); whereas later in the discussion Jean-Baptiste mentions that in your situation becomes a monoid morphism (whereas is not). So perhaps these two results are complementary, in giving natural sufficient conditions for each of and to be monoid morphisms.
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 (our worked out examples are monoids in or -algebras for some monad , and we are not sure if either is more general than the other).
Suppose is an object of underlying an algebra and is a retract of , i.e. there is a split idempotent . Intuitively, there is a natural way one could see as an algebra by embedding it in with and going back to with whenever necessary. More formally (in our worked out cases), we can define the monoid on and the -algebra on 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 is an algebra, and once we know they are true, we conclude that in fact is an algebra.
Right, the assumption I gave is exactly what is necessary for 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 :)
(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.)
Ralph Sarkis said:
Now our results state that:
- if is a homomorphism, then with this structure defined above is an algebra.
- if is a homomorphism, then with this structure defined above is an algebra.
In fact (as I'm sure you observed), something slightly stronger is also true: the algebra structure on is unique such that (and presumably alternatively ) is a homomorphism.
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.pngThat 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 and , I have a single axiom involving and .
image.pngAs far as I can tell, neither set of assumptions implies the other. In my situation, becomes a monoid morphism (whereas is not); whereas later in the discussion Jean-Baptiste mentions that in your situation becomes a monoid morphism (whereas is not). So perhaps these two results are complementary, in giving natural sufficient conditions for each of and 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...
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!
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:
I don't know what kind of mysterious duality would permit to go from one result to the other one...
Ralph Sarkis said:
Now our results state that:
- if is a homomorphism, then with this structure defined above is an algebra.
- if is a homomorphism, then with this structure defined above is an algebra.
It is weird because we are checking the conditions of a homomorphism without knowing that the (co)domain is an algebra, and once we know they are true, we conclude that in fact 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.
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 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 :)
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!
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.
Doesn't it still work if you use instead of in that axiom? Because is going to be a mono.
That seems a bit more satisfying because the axiom doesn't have to mention the splitting.
James Deikun said:
Doesn't it still work if you use instead of in that axiom? Because is going to be a mono.
Yes, it works if you use instead of (the two diagrams are equivalent), but you still need the splitting in order to define the structure of monoid on
which uses and but not
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.pngThat 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 and , I have a single axiom involving and .
image.pngAs far as I can tell, neither set of assumptions implies the other. In my situation, becomes a monoid morphism (whereas is not); whereas later in the discussion Jean-Baptiste mentions that in your situation becomes a monoid morphism (whereas is not). So perhaps these two results are complementary, in giving natural sufficient conditions for each of and to be monoid morphisms.
I'm not sure I understand that: I agree that if is a monoid, with the "tentative structure of monoid", then is going to be a morphism of monoids. However, I don't see how to prove that is a monoid?
Maybe what you can prove is instead that if you start with a monoid , and given some axiom, if you define the "tentative structure of monoid" on , you obtain that is a monoid and a monoid morphism?
Jean-Baptiste Vienney said:
I'm not sure I understand that: I agree that if is a monoid, with the "tentative structure of monoid", then is going to be a morphism of monoids. However, I don't see how to prove that 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 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
It's (a little) clearer in the monad algebra version:
I agree with the fact that the associativity is verified. But I didn't suceed to prove the unitality.
Nathanael Arkor said:
Jean-Baptiste Vienney said:
I'm not sure I understand that: I agree that if is a monoid, with the "tentative structure of monoid", then is going to be a morphism of monoids. However, I don't see how to prove that is a monoid?
But the unit laws should follow for the same reason as in the case that 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.
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.
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
Observing that the bottom-left path is equal to the identity.
Hmm, how do you get the commutativity of this triangle?
Screenshot-2023-08-17-at-5.19.14-PM.png
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.
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.
I overlooked that you had eliminated that axiom.
image.png
These are the axioms I'm assuming.
Oh, ok, I see, this is why I was confused. With these two axioms, everything looks good!
The asymmetry between the section and retraction cases is curious. But they're still not too dissimilar.
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:
Oh, but we understood better the differences between the two cases thanks to that. So that was not a too bad mistake ahah
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 and not contrary to the one of the multiplication.
In our case, you don't need 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.
Jean-Baptiste Vienney said:
In our case, you don't need 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 homomorphism case, you also get that preserves the unit (though not the multiplication). But I'm not sure it's a useful fact.
Oh, this is because the definition of the unit of is exactly the equation of the preservation of the unit by !
This discussion resembles so much what is in
in fact, one can make a little more concrete situation than that of Definition 2.2.4 therein. For a given monad we can assume that every object has a an idempotent split . If this split satisfies conditions similar to those above we obtain that carries a structure of a monad and that the section part of the splitting is natural and, in fact, forms a monad morphism.
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.
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 we can assume that every object has a an idempotent split . If this split satisfies conditions similar to those above we obtain that 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.
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 be a set and be an equivalence relation on . Supose that is a monoid. Let 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 of , 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 by chosing a section of and defining:
Screenshot-2023-08-23-at-4.53.08-PM.png
We can then show that and don't depend on the choice of the section .
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 and even from the structure of semi-ring of because in each of these cases, there is a natural choice of section . We will explain this in the paper.
Apparently, you don't need the axiom of choice to define quotients, but I don't understand how for the moment...
Do you want like, a set theory explanation or a type theory explanation or what? What are your foundations? What is a quotient?
In ZFC set theory, a function is, by definition, a functional relation. So if and are sets, a function from to is defined to be a subset of that satisfies the law .
If is a set and is an equivalence relation on , then is defined to be the set of all equivalence classes of . If is a function, then we can define a relation by . 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 " induces a function from to " but all that is happening is that we are proving this relationship is total and single-valued.
Using the existential quantifier doesn't depend on the axiom of choice. If you know that , you can say "Let be an element satisfying property ". Do you have to "choose" such an ? Yes. But this is fundamentally not what the axiom of choice is concerned with.
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.
Ok, so you define a relation by I guess. And then it is a function, and it is your new multiplication.
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".
Yes, it makes sense, thanks!
I had never thought that you could start by defining a relation and then prove that it is a function.
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.
It is the coequalizer of which morphisms?
If is an equivalence relation on , then , so regarding as a set in its own right there are two projection maps . The quotient is the coequalizer of those two functions.
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.
This looks so close :grimacing:. We did not consider going to a subcategory as you did, and for some reason, your section 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
Interestingly, in my game comonad use case is a monad morphism.
My situation (stated for comonads, so the retract becomes the comonad morphism):
image.png
(it's all stated in terms of Kleisli representations where is the counit of the comonad and is the coextension operation)
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 and , I have a single axiom involving and .
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.
Awesome :sunglasses: Are dcpos monadic over Set ?
They are not. I think they are monadic over the category of posets.
Does anyone of you @Nathanael Arkor , @Tomáš Jakl , @Graham Manuell have some intuition on why is a morphism of algebras and not ? In classical algebra, is the projection to the quotient and preserves the algebraic structure. Why is it which preserves the structure in these situations and not 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.
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 be a category. Then there is a multicategory of endo-distributors (a.k.a. endo-profunctors) and natural transformations. Let be a functor. This functor induces a monoid in the aforementioned multicategory (a.k.a. promonad). A [[relative monad]] with carrier is precisely a section of this monoid whose underlying distributor is "-corepresentable" (i.e. of the form for some functor ).
It was quite surprising to me that the axioms for a relative monad turned out to be exactly the axioms for a monoid section.
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.
I found a simple algebraic example of this situation: In the category of -vector spaces, consider the two vector spaces and . Consider the inclusion and the real part map. Then, and are -linear maps. Moreover (but ). Both and are -algebras and is a morphism of -algebras, but not because .
In this example, the intution is that is the inclusion of a sub-object which preserves the algebraic structure. But not necessarily , which is not the projection on a quotient.
In fact, it works with any field extension.
If you have two fields such that is an extension of , ie. you have a morphism of rings , then by restriction of scalars, is a vector-space, and is a -linear map. Moreover, both and are -algebras and is a morphism of -algebras.
In addition to that, consider a decomposition of -vector spaces.
You can define to be the projection followed by the isomorphism (recall that any homomorphism of rings with domain a field is injective). They are both -linear maps and is thus a -linear map. Moreover . But is not necessarily a morphism of -algebras as shown in the previous example.
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.)
@Ralph Sarkis, I think it would be useful that we finally write our paper now that Nathanael cited us in a preprint. :smile: