Timeline for Grouplike and idempotent monoids
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2023 at 18:00 | comment | added | LSpice |
Re, my pleasure, and I hope you've been enjoying the experience here! Just so you know, while it's always good to be semantically correct, $R$ vs. $\mathbin R$ $R$ vs. $\mathbin R$ makes no difference in rendering; the only difference comes when a binary op. is surrounded by things on which to operate: $A R B$ vs. $A \mathbin R B$ $A R B$ vs. $A \mathbin R B$. Lots of things TeX already knows are binary operators, like A + B, but you have to tell it about $R$ specifically. You can also suppress the built-in behaviour: $A{+}B$ A{+}B.
|
|
| Jul 21, 2023 at 17:18 | history | edited | Jean-Armand Moroni | CC BY-SA 4.0 |
Added the equivalence relation for functions, to answer a comment.
|
| Jul 21, 2023 at 15:19 | comment | added | Jean-Armand Moroni | @LSpice Thanks for your edits. This was one of my first posts (in MO or MSE), so I was not fully aware of typographic rules. As for your question, the equivalence relation I had in mind is the "Big O" one. I shall state that in the text. | |
| Jul 21, 2023 at 3:21 | comment | added | LSpice | What does "with their equivalence relation on $+\infty$" mean? Does it mean that the difference of the functions tends to $0$, that their quotient is well defined near $+\infty$ and that its limit is $1$, or something else? | |
| Jul 21, 2023 at 3:20 | history | edited | LSpice | CC BY-SA 4.0 |
Tidying, while this is on the front page
|
| Jun 25, 2022 at 22:19 | comment | added | Benjamin Steinberg | Free monoid are cancellative so all monoids are quotients of cancellative monoids. Also every monoid has a universal quotient that is idempotent | |
| Jun 25, 2022 at 22:07 | history | answered | Jean-Armand Moroni | CC BY-SA 4.0 |