What Are Groupification and Perfection of a Commutative Monoid?
At a glance
- 1. Form the groupification
Add formal additive inverses to the monoid, keeping only the relations forced by its original addition.
- 2. Check cancellation
The map into the groupification is injective exactly when the monoid is cancellative.
- 3. Specify the perfection
In characteristic p, perfection means adjoining compatible p-th roots by taking a direct limit under Frobenius.
- 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 , it commonly means adjoining compatible -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; -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 additively, with identity . Its groupification, often written , consists of formal differences , where . The difference is intended to act like , even if itself has no negatives.
One construction starts with pairs . Declare
The groupification is the set of equivalence classes, with addition . The monoid map is . The extra in the equivalence relation matters when is not cancellative: it avoids assuming that equal terms can be cancelled.
The defining property is universal. For any abelian group and monoid homomorphism , there is a unique group homomorphism such that . Thus every monoid map from to a group factors uniquely through its groupification.
Example: the natural numbers
Take under addition. Formal differences produce every integer, so
For example, represents . The map is injective because addition on is cancellative.
In general, the map need not be injective. Two elements have the same image exactly when there is some with . Cancellation, the condition that always implies , therefore guarantees injectivity. If cancellation fails, groupification identifies elements that become equal after adding the same element.
-perfection: adjoining roots
For a fixed prime , the -folding endomorphism on an additive commutative monoid is
In this additive-monoid setting, this map is also called the -power or Frobenius endomorphism. Its direct limit under repeated applications of is called the -perfection in settings that use this terminology:
In this limit, Frobenius becomes invertible, so elements have compatible -th roots. The analogous multiplicative notation uses . For a ring of characteristic , the usual Frobenius is , not multiplication by in its additive monoid; ring perfection is formed using that ring endomorphism. This construction is especially familiar for rings and schemes in characteristic ; a monoid version uses the same direct-limit idea.
For example, begin with under addition and use . Its -perfection can be represented by nonnegative rational numbers whose denominators are powers of :
The element acquires a compatible -th root represented by , then a further root , and so on. Groupifying this perfected monoid gives .
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 -perfection. Consequently, there is a natural isomorphism
So for this meaning of perfection, you can first adjoin -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 and when for some 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 -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.