Question about monoid (Grothendieck's) group-completion

  • Context: Graduate 
  • Thread starter Thread starter mnb96
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around the concept of Grothendieck's group-completion of cancellative abelian monoids. Participants explore the properties of the groups formed through this construction, particularly focusing on the cardinality of the resulting group and its relationship to the original monoid.

Discussion Character

  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants note that Grothendieck's group is formed by adding inverses to elements of a cancellative abelian monoid, suggesting that for finite sets, the group will contain roughly double the number of elements.
  • Others argue that for finite abelian cancellation semigroups, the construction results in an isomorphic copy of the original group, maintaining the same number of elements.
  • It is proposed that the construction works for nonempty abelian cancellation semigroups, yielding a group with minimal cardinality equivalent to the original semigroup or monoid.
  • One participant points out that there are no finite cancellative examples of "non-group abelian monoids," questioning the relevance of the original question in finite cases.
  • Another participant raises concerns about the implications of the construction for infinite abelian cancellation semigroups, questioning whether their group-completion retains the same cardinality.
  • Some participants express uncertainty regarding the relationship between the cardinality of a monoid and its group-completion, particularly in the context of infinite sets.
  • There is a discussion about the axiom of choice and its implications for the cardinality of groups formed from monoids.

Areas of Agreement / Disagreement

Participants express differing views on the cardinality of the Grothendieck group in relation to the original monoid, particularly in finite versus infinite cases. There is no consensus on whether all finite or infinite cancellative abelian semigroups are groups, and the discussion remains unresolved regarding the implications of the group-completion for certain types of monoids.

Contextual Notes

Limitations include assumptions about the nature of the monoids discussed, particularly regarding the cancellation property and the implications of the axiom of choice. The discussion also highlights the complexity of dealing with infinite sets and their properties.

mnb96
Messages
711
Reaction score
5
Hello,
in these pages (http://en.wikipedia.org/wiki/Grothendieck_group" ) I found the description of a particular construction that makes a Group from a cancellative-abelian-monoid.
The group embeds the original monoid, and it is called Grothendieck's group.

I can't find more sources about this topic and I would like to know if the group constructed with this method has minimal cardinality.

Thanks in advance.
 
Last edited by a moderator:
Physics news on Phys.org
mnb96 said:
Hello,
in these pages (http://en.wikipedia.org/wiki/Grothendieck_group" ) I found the description of a particular construction that makes a Group from a cancellative-abelian-monoid.
The group embeds the original monoid, and it is called Grothendieck's group.

I can't find more sources about this topic and I would like to know if the group constructed with this method has minimal cardinality.

Thanks in advance.

First, note that a monoid fails to be a group precisely because the set lacks an inverse for each of its elements.
The construction above basically adds an inverse for each element.
So for a finite set, the group will contain roughly double the number of elements in the monoid. For a monoid on a transfinite but countable set, the group will also be countable.
In this sense, the group does have minimal cardinality because it will contain precisely the elements necessary to form a group.
 
Last edited by a moderator:
ohubrismine said:
First, note that a monoid fails to be a group precisely because the set lacks an inverse for each of its elements.
The construction above basically adds an inverse for each element.
So for a finite set, the group will contain roughly double the number of elements in the monoid. For a monoid on a transfinite but countable set, the group will also be countable.
In this sense, the group does have minimal cardinality because it will contain precisely the elements necessary to form a group.

A finite abelian cancellation semigroup (a fortiori monoid) is already a group. The construction will produce an isomorphic copy of the same group in this case, giving exactly single the number of elements (so only roughly double with a rather free interpretation of the phrase).

The construction works equally well for a (nonempty) abelian cancellation semigroup and gives a group with minimal cardinality in either case. This cardinality is always the same as the semigroup or monoid you start with (assuming of course these are abelian cancellation versions).
 
Martin Rattigan said:
A finite abelian cancellation semigroup (a fortiori monoid) is already a group. The construction will produce an isomorphic copy of the same group in this case, giving exactly single the number of elements (so only roughly double with a rather free interpretation of the phrase).

The construction works equally well for a (nonempty) abelian cancellation semigroup and gives a group with minimal cardinality in either case. This cardinality is always the same as the semigroup or monoid you start with (assuming of course these are abelian cancellation versions).

I was really addressing the non-group abelian monoid (the second of the sources given above).
By the way, did you know Alexandre Grothendieck won the Field's medal?
 
There are no finite cancellative examples of "non group abelian monoids", so there would seem to be nothing to address in terms of the original question in the finite case.

If you meant to address finite "non group abelian monoids" that don't satisfy the cancellation law then the Grothendieck construction will indeed give a group, but the original monoid will, of course, never embed in it. The number of elements in the group would generally be even further adrift from "roughly double" in this case.

See e.g. last example in https://www.physicsforums.com/showthread.php?t=405363&highlight=Grothendieck".
 
Last edited by a moderator:
I think I read that Grothendieck won a Fields medal, but probably not for this construction (which I think any average algebra student would probably invent without too much difficulty). I believe the construction had in any case been in use well before Grothendieck, so it's not too clear why it's got his name attached in the first place.
 
Last edited:
Wait a minute.
So you are basically saying that if an abelian semigroup S is cancellative, then S is a group? Then what are the inverse elements?
 
No, I'm saying a nonempty finite cancellation semigroup is a group. Obviously [itex]\mathbb{N}[/itex] is a cancellation semigroup under [itex]+[/itex] but not a group.

If [itex]S[/itex] is a finite cancellation semigroup and [itex]s\in S[/itex], then by the pigeonhole principle [itex]Ss=sS=S[/itex].

Then [itex](\exists x\in S)sx=s[/itex] and if [itex]t\in S[/itex], [itex](\exists y\in S)ys=t[/itex]. Then [itex]ysx=ys[/itex], so [itex]tx=t[/itex]. That is [itex]x[/itex] is a right identity. Since [itex]sS=S[/itex], each element [itex]s\in S[/itex] also has a right inverse, thus [itex]S[/itex] is a group.

This holds for any nonempty finite cancellation semigroup [itex]S[/itex] and in particular in the abelian case we are interested in for the Grothendieck construction.

For finite abelian cancellation semigroups (or monoids) the Grothendieck construction will result in a copy of the semigroup (which is actually a group). For infinite abelian cancellation semigroups or monoids the semigroup or monoid may embed as a proper subsemigroup, but since [itex]\mathfrak{m}^2=\mathfrak{m}[/itex] for any infinite cardinal [itex]\mathfrak{m}[/itex], the cardinality of the Grothendieck group will still be the same as the original semigroup or monoid - hence minimal.
 
Last edited:
I see!
That's very clear. thanks a lot!
I might ask you something more for the infinite case...
 
  • #10
Martin Rattigan said:
...For infinite abelian cancellation semigroups or monoids the semigroup or monoid may embed as a proper subsemigroup, but since [itex]\mathfrak{m}^2=\mathfrak{m}[/itex] for any infinite cardinal [itex]\mathfrak{m}[/itex], the cardinality of the Grothendieck group will still be the same as the original semigroup or monoid - hence minimal.

Two questions about this:

1) Is this true also when the original semigroup (or monoid) is "continuous"? For example, consider the monoid [itex](\mathbb{R}^{+} \cup \{ 0 \} , +)[/itex], does its group-completion have the same cardinality?

2) If the cardinality is always the same, does this all mean that any finite or infinite cancellative abelian semigroup is a group?
 
  • #11
1) Yes.
2) No. (The example you gave is obviously not a group.)

I assumed the axiom of choice - some people might like to add that as a proviso.
 
Last edited:
  • #12
Martin Rattigan said:
2) No. (The example you gave is obviously not a group.)
I assumed the axiom of choice - some people might like to add that as a proviso.

This sounds counter-intuitive to me.
The positive reals (together with 0) is a monoid and not a group.
On the other hand, its group-completion has the same cardinality...?

If there is a bijection between the monoid and its group completion, why shouldn´t they be the same thing?
Perhaps when one start to deal with infinities, common sense and intuition just do harm.
 
Last edited:
  • #13
mnb96 said:
Perhaps when one start to deal with infinities, common sense and intuition just do harm.

Perhaps.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 12 ·
Replies
12
Views
1K
  • · Replies 2 ·
Replies
2
Views
6K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 0 ·
Replies
0
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K