Group theory and generalizations Definition
Regular semigroup
Builds on SemigroupIdempotent elementTransformation semigroupGreen's relations
Definition
Let be a semigroup. An element is regular if there is with . The semigroup is regular if every element of is regular.
Remarks
If , then satisfies and ; such a is called an inverse of . So is regular if and only if every element has at least one inverse in this sense. If , then and are idempotents. A semigroup is regular if and only if every -class, or equivalently every -class, of Green's relations contains an idempotent.
Example: the monoid of all maps under composition, . Given , choose such that is a preimage of under for each in the image of , and is arbitrary otherwise. Then for all , so .
Non-example: the positive integers under addition. For , the equation has no positive solution , so is not regular.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Green's relations concept
- Idempotent element concept
- Semigroup concept
- Transformation semigroup concept
- Regular semigroup definition
Further reading
About this page
| Tag | 4C3RRDA4WZ |
|---|---|
| URI | m2://4C3RRDA4WZ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 20M17 |
| Defines | Regular semigroup |
| Uses | Semigroup, Idempotent element, Transformation semigroup, Green's relations |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.