Group theory and generalizations Definition
Inverse semigroup
Definition
Let be a semigroup. The semigroup is an inverse semigroup if for every there is exactly one with This is written .
Remarks
Equivalently, is regular and any two idempotents of commute. In an inverse semigroup, and .
Example: the symmetric inverse monoid on a set , the set of all bijections between subsets . The product is the composite , defined on the points with in the domain of and in the domain of . For , the inverse bijection satisfies and , and it is the only element that does. Every group is also an inverse semigroup.
Non-example: the left zero semigroup with for all . Here and for both and , so has two such partners and uniqueness fails. Accordingly, the idempotents and do not commute: but .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Idempotent element concept
- Regular semigroup concept
- Semigroup concept
- Inverse semigroup definition
Further reading
About this page
| Tag | 657D5Q37J1 |
|---|---|
| URI | m2://657D5Q37J1 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 20M18 |
| Defines | Inverse semigroup |
| Uses | Semigroup, Regular semigroup, Idempotent element |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.