A set equipped with an associative binary operation; a semigroup need not have an identity element or inverses for its elements.

Principle

The organizing rule is associativity: for all a,b,c, (a·b)·c = a·(b·c). Lack of identity and inverses is allowed, and structure theory studies ideals, Green's relations, and idempotents under this minimal axiom set.

Demonstration

The positive integers greater than zero under addition (excluding 0) form a semigroup because addition is associative but there is no additive identity within the set; similarly, nonempty strings over an alphabet under concatenation form a semigroup if the empty string is excluded.

Misapplication

Assuming the existence of an identity, inverses, cancellativity, or group-like decomposition without verifying axioms; this leads to incorrect algebraic manipulations or the false conclusion that inverses can be adjoined without changing properties.

Consequence

Semigroups provide the minimal algebraic context for studying iterative composition and are foundational in automata theory, combinatorics on words, and the construction of monoids by adjoining identities; they capture noninvertible dynamics.

Reversal

Adding the requirement of an identity element yields a monoid; further requiring inverses for every element yields a group. Reversing associativity (dropping it) produces a magma, which lacks the structural regularity semigroups provide.

Boundary

Semigroups exclude partial operations and typically assume a single total binary operation; they do not require commutativity, topology, or additive notation, and specific subclasses (inverse semigroups, bands) impose extra conditions.

Semantic Tension

Tension arises between semigroup and monoid terminology (some texts treat semigroup as possibly having an identity) and between magma, semigroup, and category-theoretic compositions; context clarifies which axioms hold.

Synthesis

A semigroup is the associative core of algebraic composition: with only an associative binary operation it models repeated combination without presuming identities or inverses, serving as the base object for richer algebraic structures.