Green's Relations and Their Congruences

  • Thread starter brydustin
  • Start date
  • #1
205
0

Main Question or Discussion Point

I don't understand how a left (right) Green relation is a right (left) congruence.

xLy <=> Sx = Sy (Green's Left Relation): where we join 1 to S if it doesn't have identity.
Left Congruence: aPb ==> caPcb for some c in the semigroup S.

Take this example table:

* a|b|c
a|a|b|c
b|b|a|c
c|c|b|c

aS = {a,b,c} = bS, so aRb (Green's Right Relation).
But IF it were a left congruence then any element,x, of the Semigroup S, would satisfy the following equation:

aRb ==> xaRxb; then let x=c. Notice ca=c, cb=b, then:

caS = cS = {b,c} </> {a,b,c} = bS = cbS. Therefore there is not a Right Green Relation
(cRb does not exists because cS <> bS, therefore the Right Green relation isn't a left congruence).

Clearly, there is a flaw in my logic, but I don't know where.

Thanks
 

Answers and Replies

  • #2
205
0
aLb iff Sa = Sb. Also acLbc iff Sac = Sbc. But if Sa=Sb then (Sa)c=(Sb)c trivially so. But this shows its a right congruence, by definition.... Funny, no one answered this post, but me.....
 

Related Threads on Green's Relations and Their Congruences

  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
23
Views
4K
  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
13
Views
2K
Top