Ma · Mathematics

What Are Groupification and Perfection of a Commutative Monoid?

Published By the 9to5Science editorial team

At a glance

  1. 1. Form the groupification

    Add formal additive inverses to the monoid, keeping only the relations forced by its original addition.

  2. 2. Check cancellation

    The map into the groupification is injective exactly when the monoid is cancellative.

  3. 3. Specify the perfection

    In characteristic p, perfection means adjoining compatible p-th roots by taking a direct limit under Frobenius.

  4. 4. Compare the constructions

    For p-perfection, groupification commutes with the direct limit; the two constructions can be performed in either order.

For a commutative monoid, groupification has a standard meaning: it is the universal abelian group receiving a monoid homomorphism from the monoid. Perfection is less unambiguous. In characteristic pp, it commonly means adjoining compatible pp-th roots by iterating the Frobenius map. If a text uses “perfection” without naming a prime or defining the term, check its convention before assuming which construction it means.

The two constructions do different things. Groupification adds inverses; pp-perfection adds roots. Neither should be confused with taking a quotient to make a monoid cancellative or with saturating a monoid.

Groupification: adjoining inverses

Write the operation of a commutative monoid MM additively, with identity 00. Its groupification, often written MgpM^{\mathrm{gp}}, consists of formal differences a−ba-b, where a,b∈Ma,b\in M. The difference a−ba-b is intended to act like a+(−b)a+(-b), even if MM itself has no negatives.

One construction starts with pairs (a,b)∈M×M(a,b)\in M\times M. Declare

(a,b)∼(c,d)if there is some e∈M such that a+d+e=c+b+e.(a,b)\sim(c,d)\quad\text{if there is some }e\in M\text{ such that }a+d+e=c+b+e.

The groupification is the set of equivalence classes, with addition [(a,b)]+[(c,d)]=[(a+c,b+d)][(a,b)]+[(c,d)]=[(a+c,b+d)]. The monoid map is a↦[(a,0)]a\mapsto[(a,0)]. The extra ee in the equivalence relation matters when MM is not cancellative: it avoids assuming that equal terms can be cancelled.

The defining property is universal. For any abelian group GG and monoid homomorphism f:M→Gf:M\to G, there is a unique group homomorphism f~:Mgp→G\widetilde f:M^{\mathrm{gp}}\to G such that f~(a−b)=f(a)−f(b)\widetilde f(a-b)=f(a)-f(b). Thus every monoid map from MM to a group factors uniquely through its groupification.

Example: the natural numbers

Take M=N={0,1,2,…}M=\mathbb N=\{0,1,2,\ldots\} under addition. Formal differences a−ba-b produce every integer, so

Ngp≅Z.\mathbb N^{\mathrm{gp}}\cong\mathbb Z.

For example, [(0,3)][(0,3)] represents −3-3. The map N→Z\mathbb N\to\mathbb Z is injective because addition on N\mathbb N is cancellative.

In general, the map M→MgpM\to M^{\mathrm{gp}} need not be injective. Two elements a,b∈Ma,b\in M have the same image exactly when there is some c∈Mc\in M with a+c=b+ca+c=b+c. Cancellation, the condition that a+c=b+ca+c=b+c always implies a=ba=b, therefore guarantees injectivity. If cancellation fails, groupification identifies elements that become equal after adding the same element.

pp-perfection: adjoining roots

For a fixed prime pp, the pp-folding endomorphism on an additive commutative monoid is

F:M⟶M,F(m)=pm.F:M\longrightarrow M,\qquad F(m)=pm.

In this additive-monoid setting, this map is also called the pp-power or Frobenius endomorphism. Its direct limit under repeated applications of FF is called the pp-perfection in settings that use this terminology:

Mperf=lim→⁡(M→FM→FM→F⋯ ).M^{\mathrm{perf}}=\varinjlim\bigl(M\xrightarrow{F}M\xrightarrow{F}M\xrightarrow{F}\cdots\bigr).

In this limit, Frobenius becomes invertible, so elements have compatible pp-th roots. The analogous multiplicative notation uses F(m)=mpF(m)=m^p. For a ring of characteristic pp, the usual Frobenius is x↦xpx\mapsto x^p, not multiplication by pp in its additive monoid; ring perfection is formed using that ring endomorphism. This construction is especially familiar for rings and schemes in characteristic pp; a monoid version uses the same direct-limit idea.

For example, begin with N\mathbb N under addition and use F(n)=pnF(n)=pn. Its pp-perfection can be represented by nonnegative rational numbers whose denominators are powers of pp:

Nperf≅Z[1/p]≥0.\mathbb N^{\mathrm{perf}}\cong\mathbb Z[1/p]_{\ge 0}.

The element 11 acquires a compatible pp-th root represented by 1/p1/p, then a further root 1/p21/p^2, and so on. Groupifying this perfected monoid gives Z[1/p]\mathbb Z[1/p].

How the constructions relate

Groupification is a left adjoint: it turns a commutative monoid into a group in the universal way. Left adjoints preserve colimits, including the direct limit used for pp-perfection. Consequently, there is a natural isomorphism

(Mperf)gp≅(Mgp)perf.(M^{\mathrm{perf}})^{\mathrm{gp}}\cong(M^{\mathrm{gp}})^{\mathrm{perf}}.

So for this meaning of perfection, you can first adjoin pp-th roots and then groupify, or groupify and then adjoin roots; the result is the same up to natural isomorphism.

Common terminology traps

  • Cancellative quotient: Identifying aa and bb when a+c=b+ca+c=b+c for some cc produces a cancellative version of the monoid. This is sometimes called cancellativization; it is not the same as adding inverses.
  • Saturation: For a monoid embedded in a group, saturation typically adds elements whose positive integer multiples already lie in the monoid. That is different from pp-perfection, which repeatedly adjoins roots for one fixed prime.
  • Unspecified perfection: Without a prime, a characteristic, or an explicit definition, “perfection” alone may not determine a unique construction. State the convention being used, especially when comparing results from different sources.

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.