A set equipped with an associative binary operation but not necessarily possessing an identity element or inverses.

Principle

Semigroups require only associativity and closure; by weakening identity and invertibility requirements they capture concatenation and iterative composition without presuming neutrality or reversibility.

Demonstration

The set of nonempty finite strings under concatenation is a semigroup: concatenation is associative, but there is no neutral element inside the set of nonempty strings; similarly, positive integers under multiplication (excluding 1) form a semigroup.

Misapplication

Assuming an identity exists inside a semigroup when it does not can produce incorrect factorings; likewise presuming inverses leads to invalid equation solving and structural errors.

Consequence

Associativity alone ensures unambiguous product of any finite sequence of elements and permits study of powers, idempotents and Green's relations; one may adjoin an identity to form a monoid when helpful.

Reversal

Adjoining a two-sided identity yields a monoid; requiring inverses for all elements yields a group; removing associativity leads to magmas and other nonassociative systems.

Boundary

Applies to associative single-operation structures without demanding identity or inverses; excludes multi-operation algebraic systems, nonassociative magmas, and structures where composition is only partially defined.

Semantic Tension

Semigroup vs Monoid: a semigroup may lack an identity whereas a monoid includes one; semigroup vs category: semigroups abstract composition but lack object-structure present in categories; semigroup vs monoid object in a monoidal category introduces higher-level variants.

Synthesis

A semigroup is the minimal associative algebraic framework capturing the idea of sequential composition and repeated application, serving as a basis for building monoids and groups by adjoining identity or inverses.