Skip to content

Inverse Semigroup

A semigroup in which every element has a unique generalized inverse, admitting partial-bijection models and commuting idempotents.

Version
v1 · 2026-10-03 · History
Domain-specific #
13346
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Semigroup Theory, Abstract Algebra → Mathematics

Core Idea

An inverse semigroup is a semigroup \(S\) in which every \(s\) has exactly one generalized inverse \(s^*\) satisfying \(ss^*s=s\) and \(s^*ss^*=s^*\). A semigroup's multiplication is total and associative; it need not have a global identity. Inverse semigroups are equivalently regular semigroups whose idempotents commute. The elements \(s^*s\) and \(ss^*\) are idempotents, not necessarily one common group identity.[ref-59020a8ff496][ref-581ae6340c59]

Partial bijections make the idea visible: a bijection from one subset of \(X\) to another can be reversed on its range, and partial identities represent its domain and range. Every abstract inverse semigroup can be faithfully represented inside an \(I(X)\) of such maps; it need not be the whole \(I(X)\). The live Symmetric Inverse Semigroup is that full all-partial-bijections monoid, a narrower identity.[ref-59020a8ff496][ref-9ee44d5da972]

Scope of Application

Kellendonk's tiling-pattern model first has an almost-groupoid of doubly pointed pattern classes: only compatible classes compose, and swapping the pointers gives inversion. Adding a zero outcome for originally noncomposable pairs makes multiplication total and yields an inverse semigroup. The paper cautions that this completion does not preserve every almost-groupoid homomorphism notion unchanged.[^ref-2a093887fa95]

Exel's operator-algebra model uses a specified Cuntz inverse semigroup with a controlled involution and idempotent semilattice. Suitable Hilbert representations connect its order data to Cuntz-algebra relations. This does not imply the entire class of Hilbert partial isometries is an inverse semigroup: products of arbitrary partial isometries can leave that class.[^ref-581ae6340c59]

Clarity

Three tests must stay separate. A regular semigroup requires an inverse for each element but may have more than one. An inverse semigroup requires exactly one such element. A Group further has one global identity/idempotent and total group-style inverses. A semigroup with a chosen star or involution is not inverse unless the sandwich equations and uniqueness hold.[^ref-59020a8ff496]

Its natural order is algebraic: \(s\leq t\) iff \(s=ts^*s\), equivalently \(s=te\) for an idempotent \(e\). In a partial-bijection representation this is map restriction. Do not assume an arbitrary abstract element is literally a function on a fixed set before a representation has been chosen.[^ref-59020a8ff496]

Manages Complexity

The two inverse equations classify diverse models with one reusable test. Once unique inverses are established, commuting idempotents, restriction order, and partial-bijection representation follow. These derived facts can organize local tiling patterns and Exel's special operator-algebra semigroup without identifying their additional geometric or analytic structures.[ref-59020a8ff496][ref-2a093887fa95][^ref-581ae6340c59]

The simplification has a price. Replacing partial tiling composition by a zero-completed total product may obscure which pairs originally failed to compose. Treating arbitrary partial isometries as though they had inverse-semigroup closure makes the opposite error: it asserts an algebraic simplification that has not been proved.[ref-2a093887fa95][ref-581ae6340c59]

Abstract Reasoning

For a proposed \(S\), verify a total associative product. For each \(s\), find an in-carrier \(s^*\) satisfying both equations and prove uniqueness; or prove regularity and pairwise commutation of idempotents. Then use the natural order and a partial-bijection model if helpful. Failure of total product, uniqueness, or closure moves the object outside this identity.[^ref-59020a8ff496]

On \(X=\{1,2\}\), let a partial map \(f\) send $1$ to $2\(. Its inverse sends \$2\) to $1$; \(f^*f\) is the identity only on \(\{1\}\) and \(ff^*\) only on \(\{2\}\). The map is a valid inverse-semigroup element even though neither product is the global identity on \(X\).[^ref-9ee44d5da972]

Knowledge Transfer

The algebraic laws transfer literally across the partial-map, zero-completed tiling and Exel Cuntz constructions, while each source retains extra structure and assumptions. That is not license to call every partially reversible process an inverse semigroup. The upward catalog relation is a proposed strict subtype of live prime Semigroup, which supplies the associative carrier. Groups and the full Symmetric Inverse Semigroup are special cases, not parent genera.[ref-59020a8ff496][ref-2a093887fa95][^ref-581ae6340c59]

The frozen Wikipedia requests Inverse category and Wagner congruence redirected to this article. They remain separate unresolved identity/scope questions, not aliases or automatically covered entries.

[^ref-59020a8ff496]: Mark V. Lawson, “Primer on Inverse Semigroups”, author-hosted 2016 notes, §§2.1–2.2, inspected 2026-10-01. [^ref-9ee44d5da972]: J. Pérez and C. Uzcátegui, “Topologies on the Symmetric Inverse Semigroup”, original author preprint, §§1–3, inspected 2026-10-01. [^ref-2a093887fa95]: Johannes Kellendonk, “The Local Structure of Tilings and their Integer Group of Coinvariants”, original author preprint, §§1.1–1.2, inspected 2026-10-01. [^ref-581ae6340c59]: Ruy Exel, “Inverse Semigroups and Combinatorial \(C^*\)-Algebras”, original author preprint, Introduction, §§2 and 4, inspected 2026-10-01.

Relationships to Other Abstractions

Local relationship map for Inverse 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.Inverse SemigroupDOMAINPrime abstraction: Semigroup — is a kind ofSemigroupPRIME

Current abstraction Inverse Semigroup Domain-specific

Parents (1) — more general patterns this builds on

  • Inverse Semigroup is a kind of Semigroup Prime

    An inverse semigroup is a semigroup with a unique generalized inverse for each element.

Hierarchy paths (4) — routes to 4 parentless roots

Neighborhood in Abstraction Space

Inverse Semigroup sits in a moderately populated region (46th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Algebraic Structures, Groups & Operators (42 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08