Algebraically-Free Commutative Monoid

• Algebraically-free commutative monoid is a universal construction that generates a commutative structure from a set by forming finite, unordered products with the empty product as the neutral element.
• The topic includes diverse presentations such as set-based models, species theory, and homotopy type theory, each demonstrating unique constructions and applications.
• Insights extend to recursive definitions, free differential modalities, and ideal extensions, impacting areas from algebraic logic to hypergraph rewriting.

An algebraically-free commutative monoid is a universal commutative monoid generated by specified data, with the defining feature that finite products of generators are formed without ordering constraints and that the empty product is the neutral element. In the set-based case, the standard model is the commutative multiset monoid of finite support $$M(X)=\{\,m:X\to\mathbb N \mid \operatorname{supp}(m)\text{ is finite}\,\}$$; in species it appears as $S(\mathbf q)=\mathbf E\circ \mathbf q$; in Homotopy Type Theory it is presented by higher inductive types of finite multisets; and in symmetric monoidal categories it can denote a stronger structure in which modules over the free commutative monoid on $X$ correspond exactly to self-commuting $X$-actions (Andrade et al., 26 Mar 2026, Manchon et al., 2023, Choudhury et al., 2021, Garner et al., 20 Aug 2025).

1. Set-based construction and universal property

Let $X$ be a set. The free commutative monoid on $X$ is modeled by the commutative multiset monoid of finite support

$$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$

Its monoid law is pointwise addition of multiplicities,

$(m\ast n)(x)\;:=\;m(x)+n(x),$

and its unit is the zero function $1:=0_X$, the everywhere-$0$ function. The insertion of generators is the map

$S(\mathbf q)=\mathbf E\circ \mathbf q$0

where $S(\mathbf q)=\mathbf E\circ \mathbf q$1 is the singleton multiset with $S(\mathbf q)=\mathbf E\circ \mathbf q$2 and $S(\mathbf q)=\mathbf E\circ \mathbf q$3 for $S(\mathbf q)=\mathbf E\circ \mathbf q$4. Elements of $S(\mathbf q)=\mathbf E\circ \mathbf q$5 may be identified with formal commutative monomials: if $S(\mathbf q)=\mathbf E\circ \mathbf q$6 has finite support $S(\mathbf q)=\mathbf E\circ \mathbf q$7 with exponents $S(\mathbf q)=\mathbf E\circ \mathbf q$8, then

$S(\mathbf q)=\mathbf E\circ \mathbf q$9

Under this identification, multiplication corresponds to addition of exponents (Andrade et al., 26 Mar 2026).

The universal property states that for every commutative monoid $X$0 and every map $X$1, there exists a unique monoid homomorphism

$X$2

such that $X$3 for all $X$4, and

$X$5

This yields the adjunction $X$6 between sets and commutative monoids, with unit $X$7. In this ordinary commutative-monoid setting, “algebraically free” coincides with the categorical notion: for any commutative monoid $X$8 and any map $X$9, there is a unique monoid homomorphism extending $X$0 (Andrade et al., 26 Mar 2026, Cisto et al., 2023).

For a finite index set $X$1, $X$2 is the free commutative monoid on $X$3, and for a finite set $X$4 this is canonically identified with $X$5. The paper on ideal extensions uses the ambient free commutative monoid $X$6 of finitely-supported sequences and treats it as free on the set $X$7 (Cisto et al., 2023).

2. Finite products, recursion on finite subsets, and the empty product

For a commutative monoid $X$8, an index set $X$9, and a function $X$0, finite products over subsets $X$1 are constructed by choosing an enumeration $X$2 and setting

$X$3

In a commutative monoid, finite products are invariant under permutation: $X$4 for every permutation $X$5. Hence for finite $X$6 one obtains a well-defined product

$X$7

independent of the chosen enumeration (Andrade et al., 26 Mar 2026).

The central structural statement is a recursion/uniqueness theorem on $X$8. If $X$9 satisfies

$X$0

then $X$1 for all finite $X$2. In particular,

$X$3

The same principle gives the additive analogue: for a commutative additive monoid $X$4, the finite-sum recursion with base $X$5 and insertion $X$6 forces

$X$7

(Andrade et al., 26 Mar 2026).

The note records two independent justifications of the identity “empty product $X$8”. The first passes through the list-free monoid $X$9: any monoid homomorphism out of the free monoid must send the empty word $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$0 to the identity, and quotienting by commutations preserves that identity. The second uses distributive identities in a commutative semiring, for instance

$$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$1

which with $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$2 forces $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$3, and the expansion

$$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$4

whose constant term must be $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$5 (Andrade et al., 26 Mar 2026).

A related disjoint-union characterization states that if $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$6 satisfies $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$7 and $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$8 for disjoint finite sets, then $$M(X)\;:=\;\bigl\{\,m:X\to\mathbb{N}\;\bigm|\; \operatorname{supp}(m):=\{x\in X:m(x)\neq 0\}\text{ is finite}\,\bigr\}.$$9 is determined by its singleton values $(m\ast n)(x)\;:=\;m(x)+n(x),$0 and

$(m\ast n)(x)\;:=\;m(x)+n(x),$1

This makes the neutral role of the empty set a formal consequence of the multiplicative structure rather than a standalone convention (Andrade et al., 26 Mar 2026).

3. Species, operads, and monoid objects in monoidal categories

In the framework of vector species, the free commutative monoid on a positive species $(m\ast n)(x)\;:=\;m(x)+n(x),$2 is

$(m\ast n)(x)\;:=\;m(x)+n(x),$3

where $(m\ast n)(x)\;:=\;m(x)+n(x),$4 is the exponential species. For a finite set $(m\ast n)(x)\;:=\;m(x)+n(x),$5,

$(m\ast n)(x)\;:=\;m(x)+n(x),$6

with $(m\ast n)(x)\;:=\;m(x)+n(x),$7 ranging over partitions of $(m\ast n)(x)\;:=\;m(x)+n(x),$8. Multiplication is defined componentwise by union of partitions: for disjoint $(m\ast n)(x)\;:=\;m(x)+n(x),$9, the map

$1:=0_X$0

is induced by the canonical identifications $1:=0_X$1, and the unit is the identification $1:=0_X$2 (Manchon et al., 2023).

Its universal property is the adjunction

$1:=0_X$3

Equivalently, for any commutative monoid $1:=0_X$4 in $1:=0_X$5 and any morphism of species $1:=0_X$6, there is a unique morphism of commutative monoids $1:=0_X$7 extending $1:=0_X$8. In this paper, “algebraically-free” emphasizes that $1:=0_X$9 is free as a monoid object in the monoidal category $0$0, not free as an operad (Manchon et al., 2023).

The same construction supports additional structure. If $0$1 is a positive comonoid, $0$2 becomes a connected commutative Hopf monoid. If $0$3 is a positive operad, then $0$4 carries a canonical NPL-operad structure, where nested associativity is replaced by the nested pre-Lie identity

$0$5

With an additional compatible commutative monoid structure $0$6 on $0$7, the same construction yields a genuine operad structure on $0$8 (Manchon et al., 2023).

This species-theoretic formulation generalizes the multiset picture: partitions play the role of unordered finite collections of blocks, and the free commutative monoid is built by assembling blockwise $0$9-structures and multiplying them without an ordering of blocks.

4. Constructive and homotopy-type-theoretic presentations

In Homotopy Type Theory, free commutative monoids are developed constructively as finite multisets on a set $S(\mathbf q)=\mathbf E\circ \mathbf q$00. The paper gives two equivalent $S(\mathbf q)=\mathbf E\circ \mathbf q$01-HIT presentations. The universal-algebraic presentation $S(\mathbf q)=\mathbf E\circ \mathbf q$02 has point constructors

$S(\mathbf q)=\mathbf E\circ \mathbf q$03

together with path constructors for associativity, left and right unit, commutativity, and set-truncation. The swapped-list presentation $S(\mathbf q)=\mathbf E\circ \mathbf q$04 has

$S(\mathbf q)=\mathbf E\circ \mathbf q$05

with adjacent-swap and truncation constructors. In $S(\mathbf q)=\mathbf E\circ \mathbf q$06, concatenation $S(\mathbf q)=\mathbf E\circ \mathbf q$07 defines the commutative monoid operation, and commutativity is proved by a repeated “bubble-to-end” argument using swaps (Choudhury et al., 2021).

Both presentations satisfy the same algebraic universal property: for every commutative monoid $S(\mathbf q)=\mathbf E\circ \mathbf q$08,

$S(\mathbf q)=\mathbf E\circ \mathbf q$09

is an equivalence. Thus every $S(\mathbf q)=\mathbf E\circ \mathbf q$10 extends uniquely to a monoid homomorphism $S(\mathbf q)=\mathbf E\circ \mathbf q$11, and $S(\mathbf q)=\mathbf E\circ \mathbf q$12 and $S(\mathbf q)=\mathbf E\circ \mathbf q$13 are equivalent as commutative monoids. The paper also presents a quotient-of-lists construction $S(\mathbf q)=\mathbf E\circ \mathbf q$14 and proves that it yields the same free commutative monoid (Choudhury et al., 2021).

A major constructive contribution is that these results do not assume decidable equality on $S(\mathbf q)=\mathbf E\circ \mathbf q$15. The free commutative monoid is shown to be conical and to satisfy the refinement property. The path space of finite multisets is characterized by a truncated inductive commutation relation: $S(\mathbf q)=\mathbf E\circ \mathbf q$16 This characterization is used to formalize the relational model of classical linear logic and its differential structure, with the free commutative-monoid construction interpreted as a combinatorial Fock space (Choudhury et al., 2021).

5. The strengthened categorical notion: modules versus self-commuting actions

In a symmetric monoidal category $S(\mathbf q)=\mathbf E\circ \mathbf q$17, the paper on free differential modalities uses “algebraically-free commutative monoid” in a stronger sense. A right $S(\mathbf q)=\mathbf E\circ \mathbf q$18-action on $S(\mathbf q)=\mathbf E\circ \mathbf q$19 is a morphism $S(\mathbf q)=\mathbf E\circ \mathbf q$20. It is commuting when

$S(\mathbf q)=\mathbf E\circ \mathbf q$21

Writing $S(\mathbf q)=\mathbf E\circ \mathbf q$22 for the category of commuting $S(\mathbf q)=\mathbf E\circ \mathbf q$23-actions, a commutative monoid $S(\mathbf q)=\mathbf E\circ \mathbf q$24 with unit map $S(\mathbf q)=\mathbf E\circ \mathbf q$25 is algebraically-free on $S(\mathbf q)=\mathbf E\circ \mathbf q$26 if restriction along $S(\mathbf q)=\mathbf E\circ \mathbf q$27 induces an isomorphism of categories

$S(\mathbf q)=\mathbf E\circ \mathbf q$28

Thus actions by the monoid $S(\mathbf q)=\mathbf E\circ \mathbf q$29 correspond precisely to self-commuting actions by the mere object $S(\mathbf q)=\mathbf E\circ \mathbf q$30 (Garner et al., 20 Aug 2025).

The existence result is formulated via the symmetric algebra construction. If the colimit of the functor $S(\mathbf q)=\mathbf E\circ \mathbf q$31 exists and is preserved by $S(\mathbf q)=\mathbf E\circ \mathbf q$32 in each variable, then $S(\mathbf q)=\mathbf E\circ \mathbf q$33 exists as the symmetric algebra on $S(\mathbf q)=\mathbf E\circ \mathbf q$34. Sufficient conditions include: $S(\mathbf q)=\mathbf E\circ \mathbf q$35 is cocomplete and monoidal closed, or $S(\mathbf q)=\mathbf E\circ \mathbf q$36 is the Kleisli category of a symmetric monoidal monad on a base category admitting the construction. The paper also stresses that free commutative monoids need not be algebraically-free in this stronger sense: in $S(\mathbf q)=\mathbf E\circ \mathbf q$37, cofree cocommutative coalgebras exist but the corresponding algebraic-freeness fails (Garner et al., 20 Aug 2025).

This strengthened notion is the key mechanism for freely completing coalgebra modalities to differential modalities. If $S(\mathbf q)=\mathbf E\circ \mathbf q$38 is a coalgebra modality, then under the stated hypotheses the free differential modality is

$S(\mathbf q)=\mathbf E\circ \mathbf q$39

with deriving transformation

$S(\mathbf q)=\mathbf E\circ \mathbf q$40

If $S(\mathbf q)=\mathbf E\circ \mathbf q$41 is a monoidal coalgebra modality, then $S(\mathbf q)=\mathbf E\circ \mathbf q$42 is a monoidal differential modality; under additional hypotheses there is an initial monoidal differential modality. The paper gives explicit examples in $S(\mathbf q)=\mathbf E\circ \mathbf q$43, in $S(\mathbf q)=\mathbf E\circ \mathbf q$44 where $S(\mathbf q)=\mathbf E\circ \mathbf q$45, in super vector spaces, and in linear species (Garner et al., 20 Aug 2025).

6. Extensions, surrounding theories, and applications

The finite-product perspective admits partially commutative generalizations. For an alphabet $S(\mathbf q)=\mathbf E\circ \mathbf q$46 with independence relation $S(\mathbf q)=\mathbf E\circ \mathbf q$47, the trace monoid

$S(\mathbf q)=\mathbf E\circ \mathbf q$48

is obtained by quotienting the free monoid by the congruence that swaps adjacent independent letters. If $S(\mathbf q)=\mathbf E\circ \mathbf q$49 satisfies $S(\mathbf q)=\mathbf E\circ \mathbf q$50 for all $S(\mathbf q)=\mathbf E\circ \mathbf q$51, there is a unique monoid homomorphism $S(\mathbf q)=\mathbf E\circ \mathbf q$52, and necessarily the empty trace maps to $S(\mathbf q)=\mathbf E\circ \mathbf q$53. The heap model gives an analogous recursion by removing a maximal element,

$S(\mathbf q)=\mathbf E\circ \mathbf q$54

which is the partially commutative analogue of the insertion rule on finite subsets (Andrade et al., 26 Mar 2026).

A different line of work studies monoids that sit inside a free commutative monoid. In $S(\mathbf q)=\mathbf E\circ \mathbf q$55, an ideal extension of the free commutative monoid is a submonoid $S(\mathbf q)=\mathbf E\circ \mathbf q$56 for an ideal $S(\mathbf q)=\mathbf E\circ \mathbf q$57. For gap absorbing monoids, the paper proves that every such monoid is an ideal extension of a free commutative monoid, every Betti element lies in $S(\mathbf q)=\mathbf E\circ \mathbf q$58, the catenary degree satisfies $S(\mathbf q)=\mathbf E\circ \mathbf q$59, the set of lengths $S(\mathbf q)=\mathbf E\circ \mathbf q$60 is an interval for every $S(\mathbf q)=\mathbf E\circ \mathbf q$61, and for every atom $S(\mathbf q)=\mathbf E\circ \mathbf q$62,

$S(\mathbf q)=\mathbf E\circ \mathbf q$63

For ideal extensions of $S(\mathbf q)=\mathbf E\circ \mathbf q$64, $S(\mathbf q)=\mathbf E\circ \mathbf q$65 if and only if $S(\mathbf q)=\mathbf E\circ \mathbf q$66 has finitely many gaps (Cisto et al., 2023).

The PROP-theoretic formulation of commutative monoids yields a further categorical interpretation. The PROP $S(\mathbf q)=\mathbf E\circ \mathbf q$67 is freely generated by $S(\mathbf q)=\mathbf E\circ \mathbf q$68 and $S(\mathbf q)=\mathbf E\circ \mathbf q$69 subject to the commutative monoid equations, and it is recalled that

$S(\mathbf q)=\mathbf E\circ \mathbf q$70

where $S(\mathbf q)=\mathbf E\circ \mathbf q$71 is the PROP of set-theoretic functions. For a signature $S(\mathbf q)=\mathbf E\circ \mathbf q$72, the coproduct PROP $S(\mathbf q)=\mathbf E\circ \mathbf q$73 is the algebraically-free addition of commutative monoid structure to $S(\mathbf q)=\mathbf E\circ \mathbf q$74-string diagrams. The paper identifies this PROP with right-monogamous acyclic hypergraph cospans and proves that string-diagram rewriting modulo commutative monoid equations is sound and complete with respect to weakly convex double-pushout rewriting of hypergraphs (Milosavljevic et al., 2022).

The applications recorded in the finite-product note all depend on the same structural principle. For diagonal matrices, $S(\mathbf q)=\mathbf E\circ \mathbf q$75 uses the base $S(\mathbf q)=\mathbf E\circ \mathbf q$76 at $S(\mathbf q)=\mathbf E\circ \mathbf q$77. For the Kaplan–Meier estimator, $S(\mathbf q)=\mathbf E\circ \mathbf q$78 has base value $S(\mathbf q)=\mathbf E\circ \mathbf q$79 before the first event time and updates by insertion. In category theory, the product of an empty family is terminal, mirroring “empty product $S(\mathbf q)=\mathbf E\circ \mathbf q$80”. In analysis, normalizing partial products by $S(\mathbf q)=\mathbf E\circ \mathbf q$81 aligns degenerate cases with finite-product decomposition over finite blocks (Andrade et al., 26 Mar 2026).