Skip to content

Semigroup

Version
v3 · 2026-09-28 · History
Prime #
1453
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Abstract Algebra → Mathematics
Also from
Computer Science & Software Engineering
Related primes
Associativity, Closure, Set and Membership, Monoid, Group

Core Idea

A semigroup is a set with one binary operation that is closed and associative. No identity, inverse, or commutativity is required. Associativity makes any finite product independent of parenthesization while preserving element order, so sequential combinations can be split and regrouped safely.

How would you explain it like I'm…

Bead-String Joining

When you put beads on a string, you can join the first two beads first, or the last two first — you still get the same necklace, as long as you keep the beads in the same order. And joining beads always makes a string of beads. A semigroup is any kind of joining that works like that.

Grouping Doesn't Matter

A Semigroup is a set of things plus one way of combining two of them into another thing in the same set. The rule is that grouping doesn't matter: combining A and B first and then C gives the same result as combining B and C first and then adding A in front. Order still matters, though. Gluing words together is a good example: 'sun' + 'shine' + 'y' gives 'sunshiny' either way you group it, but 'shine' + 'sun' is different. That's all a semigroup needs—no special 'do-nothing' item and no 'undo' required.

Associative Combining (Semigroup)

A Semigroup is a set S with one operation that combines any two elements into another element of S (closure) and obeys associativity: (a · b) · c = a · (b · c). That's the whole definition: it needn't have an identity element, inverses, or commutativity. Add an identity and you get a monoid; give every element an inverse and you get a group. Associativity means a long chain like a · b · c · d has one value no matter where you put parentheses, as long as the order of the pieces stays the same. This is why you can split a big list into chunks, combine each chunk, and then combine the results, which is how parallel computing tools like MapReduce work. A classic example is nonempty strings under concatenation.

 

A Semigroup is a set S equipped with a closed, associative binary operation: a · b ∈ S and (a · b) · c = a · (b · c) for all a, b, c ∈ S. Nothing else is required—no identity, inverses, or commutativity—making it the minimal algebraic structure committed only to associative composition; a monoid adds an identity, and a group adds inverses. Associativity guarantees that any finite product a₁ · ⋯ · aₙ is well-defined independent of parenthesization, provided the order of factors is preserved; this is the reason fold/reduce operations and parallel-prefix or MapReduce computations are correct when the combining operation forms a semigroup. The free semigroup is the set of nonempty strings over an alphabet under concatenation; adding the empty string gives the free monoid. Transformation semigroups—sets of functions on a set closed under composition—play the role that permutation groups play for groups, and every semigroup embeds in one (Cayley's theorem for semigroups). The Krohn–Rhodes theorem decomposes every finite semigroup in terms of simple groups and three-element aperiodic semigroups. In automata theory, the transition monoid of a finite automaton and the syntactic monoid of a regular language classify languages by algebraic complexity.

Broad Use

Nonempty strings under concatenation, endofunctions under composition, path fragments under concatenation, automata transitions, and associative distributed reductions are literal Semigroups. The same carrier-operation axioms and reassociation guarantee hold in every case.

Clarity

Semigroup is the minimal algebraic tier for closed associative composition. Adding a two-sided identity produces a Monoid; adding inverses to a Monoid produces a Group. Associativity permits regrouping, not reordering.

Manages Complexity

One small axiom set replaces separate accounts of string, function, path, and aggregate composition. The tier also prevents a reasoner from assuming a neutral element, inverse, or commutativity that the operation has not earned.

Abstract Reasoning

Test closure first, then associativity. Passing both tests licenses arbitrary parenthesization of a fixed sequence. Failing associativity—subtraction is the standard counterexample—makes a partitioned reduction depend on its grouping.

Knowledge Transfer

The concept transfers as an executable interface rather than a metaphor. Recognizing a Semigroup in one substrate immediately carries the fold, homomorphism, substructure, and reassociation questions to another.

Relationships to Other Abstractions

Local relationship map for SemigroupParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.SemigroupPRIMEPrime abstraction: Associativity — includesAssociativityPRIMEPrime abstraction: Closure — includesClosurePRIMEPrime abstraction: Set and Membership — is a kind ofSet andMembershipPRIMEPrime abstraction: Subadditivity — presupposesSubadditivityPRIMEDomain-specific abstraction: Analytic semigroup — is a kind ofAnalyticsemigroupDOMAINDomain-specific abstraction: Bicyclic semigroup — is a kind ofBicyclicsemigroupDOMAINDomain-specific abstraction: C0-Semigroup — is a kind ofC0-SemigroupDOMAINDomain-specific abstraction: Catholic Semigroup — is a kind ofCatholicSemigroupDOMAINDomain-specific abstraction: Compact semigroup — is a kind ofCompactsemigroupDOMAINDomain-specific abstraction: Idealizer — is a kind ofIdealizerDOMAINDomain-specific abstraction: Inverse Semigroup — is a kind ofInverseSemigroupDOMAINDomain-specific abstraction: Nilsemigroup — is a kind ofNilsemigroupDOMAINDomain-specific abstraction: Orthodox Semigroup — is a kind ofOrthodoxSemigroupDOMAINDomain-specific abstraction: Semigroup with Involution — is a kind ofSemigroup withInvolutionDOMAINPrime abstraction: Monoid — is a kind ofMonoidPRIME+1 more

Current abstraction Semigroup Prime

Parents (3) — outgoing typed relations

  • Semigroup is a kind of Set and Membership Prime

    A Semigroup is a Set equipped with one closed associative binary operation.

  • Semigroup includes Associativity Prime

    A Semigroup strictly contains Associativity as the axiom certifying that every finite product is independent of parenthesization.

  • Semigroup includes Closure Prime

    A Semigroup strictly contains Closure because combining any two carrier elements must return another element of that same carrier.

Children (13) — abstractions linked here by typed relations

  • Analytic semigroup Domain-specific is a kind of Semigroup

    Operator composition with T(z+w)=T(z)T(w) literally instantiates Semigroup; the time, topology, and holomorphic-sector constraints form the residual.

  • Aperiodic Semigroup Domain-specific is a kind of Semigroup

    An aperiodic semigroup is a semigroup whose every element's positive powers eventually stabilize.

  • Bicyclic semigroup Domain-specific is a kind of Semigroup

    Bicyclic Semigroup instantiates Semigroup because its closed associative multiplication is the carrier structure, specialized by a unit and one-sided-inverse presentation.

  • C0-Semigroup Domain-specific is a kind of Semigroup

    Its operators form an associative family under composition, with Banach-space, time-index and strong-continuity constraints.

  • Catholic Semigroup Domain-specific is a kind of Semigroup

    Semigroup is the broader abstraction this entry instantiates.

Hierarchy paths (4) — routes to 4 parentless roots

Not to Be Confused With

  • Associativity is one constitutive property; Semigroup bundles it with a closed operation on a carrier.
  • Monoid adds a two-sided identity.
  • Group further requires an inverse for every element.
  • Commutativity permits reordering; Semigroup alone permits only regrouping.