Group theory and generalizations Definition
Green's relations
Builds on SemigroupMonoidEquivalence relationIdempotent elementTransformation semigroup
Definition
Let be a semigroup. Let if is a monoid, and otherwise let be with an identity element adjoined. For , Green's relations are:
- if .
- if .
- if .
- if and .
- if there is with and .
Remarks
All five are equivalence relations; for this uses the fact that and commute as relations. Equivalently, if and only if and for some . Always , and when is finite.
Example: let be the monoid of all maps of a finite set to itself, with . If , then the image of is contained in the image of . Conversely, if the images are equal, choose to be a preimage of under ; then . So if and only if and have the same image. Similarly, if and only if and have the same fibres, and if and only if their images have the same size.
Non-example: in the monoid , the left ideal generated by is , so only when . Unlike in a group, the identity and the element are not -related.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Equivalence relation concept
- Idempotent element concept
- Monoid concept
- Semigroup concept
- Transformation semigroup concept
- Green's relations definition
Further reading
About this page
| Tag | RFKHKD4KXY |
|---|---|
| URI | m2://RFKHKD4KXY |
| Kind | definition |
| Writing | W0 stub |
| MSC | 20M10 |
| Defines | Green's relations |
| Uses | Semigroup, Monoid, Equivalence relation, Idempotent element, Transformation semigroup |
| 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.