Welcome to MathOverflow

Question

1

It is a theorem that every commutative monoid is inversible, i.e. is isomorphic with a submonoid of a(commutative) group. It is also clear that a group contains all submonoids generated by any subset of its underlying set. but it is also known that non every monoid is inversible, i.e. cannot be isomorphically imbedded inside some group. Question:Are there simple examples of non-inversible monoids ? Gérard Lang

flag	asked Jan 9 2011 at 19:11 Gérard Lang 719●2●5

2

An obvious obstruction is that $ab = ac$ implies $b = c$ and similarly $ba = ca$ must imply $b = c$. This is not true for the $2 \times 2$-matrices, for example. – Theo Buehler Jan 9 2011 at 19:23

7

Cher Gérard, believe it or not, in English they write inver*t*ible. I think we should generously let them indulge their idiosyncrasy :-) – Georges Elencwajg Jan 9 2011 at 19:32

6

I don't follow. The free monoid on an element a satisfying a^2 = a is not a submonoid of any commutative group. – Qiaochu Yuan Jan 9 2011 at 19:39

1

I agree with Qiaochu. Are you assuming the monoids are cancellative, but forgot to insert the hypothesis? – S. Carnahan♦ Jan 9 2011 at 19:45

1

Scott/Qiaochu: Cancellative would make sense. From Wikipedia "A commutative monoid with the cancellation property can always be embedded in a group via the Grothendieck construction." and "However, a non-commutative cancellative monoid need not be embeddable in a group.". (en.wikipedia.org/wiki/Monoid#Properties) – George Lowther Jan 9 2011 at 19:50

show 4 more comments

Mark Sapir · Accepted Answer · 2011-01-10 00:31:31Z UTC

A complete description of monoids embeddable into groups was given by Malcev more than 70 years ago. The description is in a form of infinitely many quasi-identities, the easiest of those are the two cancelative laws. See Chapter 12 of Clifford, A. H.; Preston, G. B. The algebraic theory of semigroups. Vol. II. Mathematical Surveys, No. 7 American Mathematical Society, Providence, R.I. 1967 xv+350 pp.

Harry Altman · Answer 2 · 2011-01-09 20:12:49Z UTC

5

An example is given here: http://mathoverflow.net/questions/29006/counterexamples-in-algebra/29076#29076

To write it out here, take the monoid $\langle a,b,c,d,x,y,u,v : ax=by, cx=dy, au=bv \rangle$.

answered Jan 9 2011 at 20:12

Harry Altman
980●1●10●16

Thank you very much for this interesting answer to my (very) question. Gérard Lang. – Gérard Lang Jan 10 2011 at 10:22

Guillaume Brunerie · Answer 3 · 2011-01-09 19:44:54Z UTC

Let $M$ be a totally ordered set of cardinal $\ge3$ with a least element $\bot$, and we define a binary operation $x\cdot{}y=\max(x,y)$.

This is obviously a commutative monoid with $\bot$ as the identity element, but it is not invertible because if $c\lt{}b\lt{}a$ you have $a\cdot{}b=a\cdot{}c$ but $b\neq{}c$.

Non-inversible monoids

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

3 Answers

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.