nLab free commutative monoid

Contents

Context

Algebra

Monoid theory

Contents

Idea

The free commutative monoid ℕ[S]\mathbb{N}[S] on a set SS is the commutative monoid whose elements are formal ℕ\mathbb{N}-linear combinations of elements of SS.

Definition

Definition

Let

U:CMon⟶Set U \colon CMon \longrightarrow Set

be the forgetful functor from the category CMon of commutative monoids, to the category Set of sets. This has a left adjoint free construction:

ℕ[−]:Set⟶CMon. \mathbb{N}[-] \colon Set \longrightarrow CMon \,.

This is the free commutative monoid functor. For S∈S \in Set, the free commutative monoid ℕ[S]∈\mathbb{N}[S] \in CMon is the free object on SS with respect to this free-forgetful adjunction.

Of course, this notion is meant to be invariant under isomorphism: it doesn’t depend on the left adjoint chosen. Thus, if a functor of the form hom Set(S,U−):CMon→Set\hom_{Set}(S, U-): CMon \to Set is representable by a commutative monoid MM, then we may say MM is a free commutative monoid on SS. A specific choice of isomorphism

hom CMon(M,−)≅hom Set(S,U−)\hom_{CMon}(M, -) \cong \hom_{Set}(S, U-)

corresponds, via the Yoneda lemma, to a function S→UMS \to U M which exhibits SS, or rather its image under this function, as a specific basis of MM. If MM is so equipped with such a universal arrow S→UMS \to U M, then it is harmless to call MM “the” free commutative monoid on SS.

Explicit descriptions of free commutative monoid are discussed below.

Properties

In terms of formal linear combinations

Definition

A formal linear combination of elements of a set SS is a function

a:S→ℕ a : S \to \mathbb{N}

such that only finitely many of the values a s∈ℕa_s \in \mathbb{N} are non-zero.

Identifying an element s∈Ss \in S with the function S→ℕS \to \mathbb{N} which sends ss to 1∈ℕ1 \in \mathbb{N} and all other elements to 0, this is written as

a=∑ s∈Sa s⋅s. a = \sum_{s \in S} a_s \cdot s \,.

In this expression one calls a s∈ℕa_s \in \mathbb{N} the coefficient of ss in the formal linear combination.

Remark

Definition of formal linear combinations makes sense with coefficients in any commutative monoid MM, not necessarily the natural numbers.

M[S]≔ℕ[S]⊗M. M[S] \coloneqq \mathbb{N}[S] \otimes M \,.
Definition

For S∈S \in Set, the monoid of formal linear combinations ℕ[S]\mathbb{N}[S] is the monoid whose underlying set is that of formal linear combinations, def. , and whose monoid operation is the pointwise addition in ℕ\mathbb{N}:

(∑ s∈Sa s⋅s)+(∑ s∈Sb s⋅s)=∑ s∈S(a s+b s)⋅s. (\sum_{s \in S} a_s \cdot s) + (\sum_{s \in S} b_s \cdot s) = \sum_{s \in S} (a_s + b_s) \cdot s \,.
Proposition

The free commutative monoid on S∈SetS \in Set is, up to isomorphism, the monoid of formal linear combinations, def. , on SS.

Proposition

For SS a set, the free commutative monoid ℕ[S]\mathbb{N}[S] is the biproduct in CMon of |S|{|S|}-copies of ℕ\mathbb{N} with itself:

ℕ[S]≃⊕ s∈Sℕ. \mathbb{N}[S] \simeq \oplus_{s \in S} \mathbb{N} \,.

Examples

Last revised on May 21, 2021 at 22:29:48. See the history of this page for a list of all contributions to it.