Skip to content

Semigroup

Version
v2 · 2026-08-30 · History
Prime #
1453
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.

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 — is part ofAssociativityPRIMEPrime abstraction: Closure — is part ofClosurePRIMEPrime 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: Catholic Semigroup — is a kind ofCatholicSemigroupDOMAINDomain-specific abstraction: Compact semigroup — is a kind ofCompactsemigroupDOMAINDomain-specific abstraction: Nilsemigroup — is a kind ofNilsemigroupDOMAINDomain-specific abstraction: Orthodox Semigroup — is a kind ofOrthodoxSemigroupDOMAINPrime abstraction: Monoid — is a kind ofMonoidPRIME

Current abstraction Semigroup Prime

Parents (3) — more general patterns this builds on

  • Semigroup is a kind of Set and Membership Prime

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

  • Semigroup is part of Associativity Prime

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

  • Semigroup is part of Closure Prime

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

Children (8) — more specific cases that build on this

  • Analytic semigroup Domain-specific is a kind of Semigroup

    The proposed strict upward parent is prime:semigroup.

  • 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.

  • Catholic Semigroup Domain-specific is a kind of Semigroup

    Semigroup is the proposed immediate parent.

  • Compact semigroup Domain-specific is a kind of Semigroup

    The proposed strict upward parent is prime:semigroup.

  • Nilsemigroup Domain-specific is a kind of Semigroup

    The proposed strict upward parent is prime:semigroup.

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.