Skip to content
Home

Monoid (algebraic structure)

A monoid is a set equipped with an associative binary operation that has an identity element. It is a fundamental concept in algebra and computer science with many concrete examples and applications.

Author: Created: Updated:

Overview

A monoid is one of the simplest algebraic structures studied in abstract algebra. It consists of a set together with a single binary operation that combines any two elements to produce another element of the same set. Two essential requirements distinguish a monoid: the operation must be associative, and there must be an identity element that leaves other elements unchanged when used in the operation. The operation need not be commutative.

Definition and basic properties

Formally, a pair (M, •) is a monoid when:

  • Associativity: for all a, b, c in M, (a • b) • c = a • (b • c).
  • Identity: there exists e in M such that for every a in M, e • a = a • e = a.
Because inverses are not required, a monoid is a more general notion than a group. A semigroup satisfies only associativity; a monoid is a semigroup with an identity element. When the operation also satisfies commutativity, the structure is called a commutative monoid (compare commutativity).

Common examples

Concrete examples help fix the idea:

  • The natural numbers under addition form a monoid with identity 0 (see addition).
  • Positive integers (or nonnegative integers) under multiplication form a monoid with identity 1 (see multiplication).
  • All finite strings over a fixed alphabet form the free monoid under concatenation; the empty string is the identity (see string concatenation).
  • Square matrices of a fixed size under matrix multiplication, and functions from a set to itself under composition, are other standard examples.
These examples illustrate how monoids capture the idea of combining elements while preserving structure and having a neutral element.

History and mathematical context

The monoid concept arises naturally when one abstracts the algebraic properties common to many operations. It is a foundational notion in algebra and category theory and appears throughout mathematics. Because it imposes minimal axioms, the monoid notion unifies many disparate systems—numerical operations, concatenation of symbols, transformations, and more—under a common language.

Uses and significance

Monoids are important in both pure and applied settings. In programming and algorithms they justify patterns such as folding, reducing and parallel aggregation: if pieces of data are processed independently into monoid elements, their combination order does not affect the final result thanks to associativity and the identity. In theoretical computer science, free monoids model sequences and languages; in category theory monoids appear as endomorphism objects. Understanding monoids also clarifies when additional structure (like inverses) is available, leading to groups or rings.

It is useful to contrast monoids with several nearby notions: semigroups (no identity), groups (identity plus inverses for every element), and monoids that are commutative versus noncommutative. Homomorphisms between monoids preserve both the operation and the identity, allowing one to compare different monoids and to construct new examples from old.

Related articles

Author

AlegsaOnline.com Monoid (algebraic structure)

URL: https://en.alegsaonline.com/art/66105

Share