Math 2.0

Group theory and generalizations Definition

Green's relations

Builds on SemigroupMonoidEquivalence relationIdempotent elementTransformation semigroup

Definition

Let SS be a semigroup. Let S1=SS^1 = S if SS is a monoid, and otherwise let S1S^1 be SS with an identity element 11 adjoined. For a,b∈Sa, b \in S, Green's relations are:

  1. aℒba \mathrel{\mathcal{L}} b if S1a=S1bS^1 a = S^1 b.
  2. aℛba \mathrel{\mathcal{R}} b if aS1=bS1a S^1 = b S^1.
  3. a𝒥ba \mathrel{\mathcal{J}} b if S1aS1=S1bS1S^1 a S^1 = S^1 b S^1.
  4. aℋba \mathrel{\mathcal{H}} b if aℒba \mathrel{\mathcal{L}} b and aℛba \mathrel{\mathcal{R}} b.
  5. a𝒟ba \mathrel{\mathcal{D}} b if there is c∈Sc \in S with aℒca \mathrel{\mathcal{L}} c and cℛbc \mathrel{\mathcal{R}} b.

Remarks

All five are equivalence relations; for 𝒟\mathcal{D} this uses the fact that ℒ\mathcal{L} and ℛ\mathcal{R} commute as relations. Equivalently, aℒba \mathrel{\mathcal{L}} b if and only if a=xba = xb and b=yab = ya for some x,y∈S1x, y \in S^1. Always ℋ⊆ℒ,ℛ⊆𝒟⊆𝒥\mathcal{H} \subseteq \mathcal{L}, \mathcal{R} \subseteq \mathcal{D} \subseteq \mathcal{J}, and 𝒟=𝒥\mathcal{D} = \mathcal{J} when SS is finite.

Example: let TXT_X be the monoid of all maps of a finite set XX to itself, with (fg)(x)=f(g(x))(fg)(x) = f(g(x)). If f=ghf = gh, then the image of ff is contained in the image of gg. Conversely, if the images are equal, choose h(x)h(x) to be a preimage of f(x)f(x) under gg; then f=ghf = gh. So fℛgf \mathrel{\mathcal{R}} g if and only if ff and gg have the same image. Similarly, fℒgf \mathrel{\mathcal{L}} g if and only if ff and gg have the same fibres, and f𝒟gf \mathrel{\mathcal{D}} g if and only if their images have the same size.

Non-example: in the monoid (ℕ,+)(\N, +), the left ideal generated by aa is a+ℕa + \N, so aℒba \mathrel{\mathcal{L}} b only when a=ba = b. Unlike in a group, the identity 00 and the element 11 are not ℒ\mathcal{L}-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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Equivalence relation concept
  2. Idempotent element concept
  3. Monoid concept
  4. Semigroup concept
  5. Transformation semigroup concept
  6. Green's relations definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Green's_relations
About this page
TagRFKHKD4KXY
URIm2://RFKHKD4KXY
Kinddefinition
WritingW0 stub
MSC20M10
DefinesGreen's relations
UsesSemigroup, Monoid, Equivalence relation, Idempotent element, Transformation semigroup
Changed2 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.