Free idempotent generated semigroups over bands Dandan Yang joint - - PowerPoint PPT Presentation

free idempotent generated semigroups over bands
SMART_READER_LITE
LIVE PREVIEW

Free idempotent generated semigroups over bands Dandan Yang joint - - PowerPoint PPT Presentation

Free idempotent generated semigroups over bands Dandan Yang joint work with Vicky Gould Novi Sad, June 2013 (Dandan Yang ) IG(E) over bands June 3, 2013 1 / 17 String rewriting systems Let be a finite alphabet and the set of all


slide-1
SLIDE 1

Free idempotent generated semigroups over bands

Dandan Yang joint work with Vicky Gould Novi Sad, June 2013

(Dandan Yang ) IG(E) over bands June 3, 2013 1 / 17

slide-2
SLIDE 2

String rewriting systems

Let Σ be a finite alphabet and Σ∗ the set of all words on Σ. A string-rewriting system R on Σ is a subset of Σ∗ × Σ∗.

(Dandan Yang ) IG(E) over bands June 3, 2013 2 / 17

slide-3
SLIDE 3

String rewriting systems

Let Σ be a finite alphabet and Σ∗ the set of all words on Σ. A string-rewriting system R on Σ is a subset of Σ∗ × Σ∗. A single-step reduction relation on Σ∗ is defined by u − → v ⇐ ⇒ (∃(l, r) ∈ R) (∃ x, y ∈ Σ∗) u = xly and v = xry.

(Dandan Yang ) IG(E) over bands June 3, 2013 2 / 17

slide-4
SLIDE 4

String rewriting systems

Let Σ be a finite alphabet and Σ∗ the set of all words on Σ. A string-rewriting system R on Σ is a subset of Σ∗ × Σ∗. A single-step reduction relation on Σ∗ is defined by u − → v ⇐ ⇒ (∃(l, r) ∈ R) (∃ x, y ∈ Σ∗) u = xly and v = xry. The reduction relation on Σ∗ induced by R is the reflexive, transitive closure of − → and is denoted by

− → .

(Dandan Yang ) IG(E) over bands June 3, 2013 2 / 17

slide-5
SLIDE 5

String rewriting systems

Let Σ be a finite alphabet and Σ∗ the set of all words on Σ. A string-rewriting system R on Σ is a subset of Σ∗ × Σ∗. A single-step reduction relation on Σ∗ is defined by u − → v ⇐ ⇒ (∃(l, r) ∈ R) (∃ x, y ∈ Σ∗) u = xly and v = xry. The reduction relation on Σ∗ induced by R is the reflexive, transitive closure of − → and is denoted by

− → . The structure S = (Σ∗, R) is called a reduction system.

(Dandan Yang ) IG(E) over bands June 3, 2013 2 / 17

slide-6
SLIDE 6

String rewriting systems

A word in Σ∗ is in normal form if we cannot apply a relation in R.

(Dandan Yang ) IG(E) over bands June 3, 2013 3 / 17

slide-7
SLIDE 7

String rewriting systems

A word in Σ∗ is in normal form if we cannot apply a relation in R. S is noetherian if ∃ w = w0 − → w1 − → w2 − → · · ·

(Dandan Yang ) IG(E) over bands June 3, 2013 3 / 17

slide-8
SLIDE 8

String rewriting systems

A word in Σ∗ is in normal form if we cannot apply a relation in R. S is noetherian if ∃ w = w0 − → w1 − → w2 − → · · · S is confluent S is locally confluent w x y z w x y z

∗ ∗ ∗ ∗ ∗ ∗

(Dandan Yang ) IG(E) over bands June 3, 2013 3 / 17

slide-9
SLIDE 9

String rewriting systems

A word in Σ∗ is in normal form if we cannot apply a relation in R. S is noetherian if ∃ w = w0 − → w1 − → w2 − → · · · S is confluent S is locally confluent w x y z w x y z

∗ ∗ ∗ ∗ ∗ ∗

Facts:

(Dandan Yang ) IG(E) over bands June 3, 2013 3 / 17

slide-10
SLIDE 10

String rewriting systems

A word in Σ∗ is in normal form if we cannot apply a relation in R. S is noetherian if ∃ w = w0 − → w1 − → w2 − → · · · S is confluent S is locally confluent w x y z w x y z

∗ ∗ ∗ ∗ ∗ ∗

Facts:

1 let ρ be the congruence generated by R. Then S is noetherian and

confluent implies every ρ-class contains a unique normal form.

(Dandan Yang ) IG(E) over bands June 3, 2013 3 / 17

slide-11
SLIDE 11

String rewriting systems

A word in Σ∗ is in normal form if we cannot apply a relation in R. S is noetherian if ∃ w = w0 − → w1 − → w2 − → · · · S is confluent S is locally confluent w x y z w x y z

∗ ∗ ∗ ∗ ∗ ∗

Facts:

1 let ρ be the congruence generated by R. Then S is noetherian and

confluent implies every ρ-class contains a unique normal form.

(Dandan Yang ) IG(E) over bands June 3, 2013 3 / 17

slide-12
SLIDE 12

String rewriting systems

A word in Σ∗ is in normal form if we cannot apply a relation in R. S is noetherian if ∃ w = w0 − → w1 − → w2 − → · · · S is confluent S is locally confluent w x y z w x y z

∗ ∗ ∗ ∗ ∗ ∗

Facts:

1 let ρ be the congruence generated by R. Then S is noetherian and

confluent implies every ρ-class contains a unique normal form.

2 If S is noetherian, then

confluent ⇐ ⇒ locally confluent.

(Dandan Yang ) IG(E) over bands June 3, 2013 3 / 17

slide-13
SLIDE 13

Free idempotent generated semigroups

Let S be a semigroup with E a set of all idempotents of S. For any e, f ∈ E, define e ≤R f ⇔ fe = e and e ≤L f ⇔ ef = e.

(Dandan Yang ) IG(E) over bands June 3, 2013 4 / 17

slide-14
SLIDE 14

Free idempotent generated semigroups

Let S be a semigroup with E a set of all idempotents of S. For any e, f ∈ E, define e ≤R f ⇔ fe = e and e ≤L f ⇔ ef = e. Note e ≤R f (e ≤L f ) implies both ef and fe are idempotents.

(Dandan Yang ) IG(E) over bands June 3, 2013 4 / 17

slide-15
SLIDE 15

Free idempotent generated semigroups

Let S be a semigroup with E a set of all idempotents of S. For any e, f ∈ E, define e ≤R f ⇔ fe = e and e ≤L f ⇔ ef = e. Note e ≤R f (e ≤L f ) implies both ef and fe are idempotents. We say that (e, f ) is a basic pair if e ≤R f , f ≤R e, e ≤L f or f ≤L e i.e. {e, f } ∩ {ef , fe} = ∅; then ef , fe are said to be basic products.

(Dandan Yang ) IG(E) over bands June 3, 2013 4 / 17

slide-16
SLIDE 16

Free idempotent generated semigroups

Let S be a semigroup with E a set of all idempotents of S. For any e, f ∈ E, define e ≤R f ⇔ fe = e and e ≤L f ⇔ ef = e. Note e ≤R f (e ≤L f ) implies both ef and fe are idempotents. We say that (e, f ) is a basic pair if e ≤R f , f ≤R e, e ≤L f or f ≤L e i.e. {e, f } ∩ {ef , fe} = ∅; then ef , fe are said to be basic products. Under basic products, E satisfies a number of axioms.

(Dandan Yang ) IG(E) over bands June 3, 2013 4 / 17

slide-17
SLIDE 17

Free idempotent generated semigroups

Let S be a semigroup with E a set of all idempotents of S. For any e, f ∈ E, define e ≤R f ⇔ fe = e and e ≤L f ⇔ ef = e. Note e ≤R f (e ≤L f ) implies both ef and fe are idempotents. We say that (e, f ) is a basic pair if e ≤R f , f ≤R e, e ≤L f or f ≤L e i.e. {e, f } ∩ {ef , fe} = ∅; then ef , fe are said to be basic products. Under basic products, E satisfies a number of axioms. A biordered set is a partial algebra satisfying these axioms.

(Dandan Yang ) IG(E) over bands June 3, 2013 4 / 17

slide-18
SLIDE 18

Free idempotent generated semigroups

Let S be a semigroup with biordered set E.

(Dandan Yang ) IG(E) over bands June 3, 2013 5 / 17

slide-19
SLIDE 19

Free idempotent generated semigroups

Let S be a semigroup with biordered set E. The free idempotent generated semigroup IG(E) is defined by IG(E) = E : ¯ e¯ f = ef , e, f ∈ E, {e, f } ∩ {ef , fe} = ∅. where E = {¯ e : e ∈ E}.

(Dandan Yang ) IG(E) over bands June 3, 2013 5 / 17

slide-20
SLIDE 20

Free idempotent generated semigroups

Let S be a semigroup with biordered set E. The free idempotent generated semigroup IG(E) is defined by IG(E) = E : ¯ e¯ f = ef , e, f ∈ E, {e, f } ∩ {ef , fe} = ∅. where E = {¯ e : e ∈ E}. Facts:

(Dandan Yang ) IG(E) over bands June 3, 2013 5 / 17

slide-21
SLIDE 21

Free idempotent generated semigroups

Let S be a semigroup with biordered set E. The free idempotent generated semigroup IG(E) is defined by IG(E) = E : ¯ e¯ f = ef , e, f ∈ E, {e, f } ∩ {ef , fe} = ∅. where E = {¯ e : e ∈ E}. Facts:

1 φ : IG(E) → E, given by ¯

eφ = e is an epimorphism.

(Dandan Yang ) IG(E) over bands June 3, 2013 5 / 17

slide-22
SLIDE 22

Free idempotent generated semigroups

Let S be a semigroup with biordered set E. The free idempotent generated semigroup IG(E) is defined by IG(E) = E : ¯ e¯ f = ef , e, f ∈ E, {e, f } ∩ {ef , fe} = ∅. where E = {¯ e : e ∈ E}. Facts:

1 φ : IG(E) → E, given by ¯

eφ = e is an epimorphism.

2 E ∼

= E(IG(E))

(Dandan Yang ) IG(E) over bands June 3, 2013 5 / 17

slide-23
SLIDE 23

Free idempotent generated semigroups

Let S be a semigroup with biordered set E. The free idempotent generated semigroup IG(E) is defined by IG(E) = E : ¯ e¯ f = ef , e, f ∈ E, {e, f } ∩ {ef , fe} = ∅. where E = {¯ e : e ∈ E}. Facts:

1 φ : IG(E) → E, given by ¯

eφ = e is an epimorphism.

2 E ∼

= E(IG(E)) Note IG(E) naturally gives us a reduction system (E

∗, R), where

R = {(¯ e¯ f , ef ) : (e, f ) is a basic pair}.

(Dandan Yang ) IG(E) over bands June 3, 2013 5 / 17

slide-24
SLIDE 24

Free idempotent generated semigroups

Let S be a semigroup with biordered set E. The free idempotent generated semigroup IG(E) is defined by IG(E) = E : ¯ e¯ f = ef , e, f ∈ E, {e, f } ∩ {ef , fe} = ∅. where E = {¯ e : e ∈ E}. Facts:

1 φ : IG(E) → E, given by ¯

eφ = e is an epimorphism.

2 E ∼

= E(IG(E)) Note IG(E) naturally gives us a reduction system (E

∗, R), where

R = {(¯ e¯ f , ef ) : (e, f ) is a basic pair}. Aim Today: To study the general structure of IG(E), for some bands.

(Dandan Yang ) IG(E) over bands June 3, 2013 5 / 17

slide-25
SLIDE 25

IG(E) over semilattices

IG(E) is not necessarily regular.

(Dandan Yang ) IG(E) over bands June 3, 2013 6 / 17

slide-26
SLIDE 26

IG(E) over semilattices

IG(E) is not necessarily regular. Consider a semilattice e f g Then e f ∈ IG(E) is not regular.

(Dandan Yang ) IG(E) over bands June 3, 2013 6 / 17

slide-27
SLIDE 27

IG(E) over semilattices

IG(E) is not necessarily regular. Consider a semilattice e f g Then e f ∈ IG(E) is not regular. What other structures does IG(E) might have?

(Dandan Yang ) IG(E) over bands June 3, 2013 6 / 17

slide-28
SLIDE 28

IG(E) over semilattices

Green’s star equivalences For any a, b ∈ S, a L∗ b ⇐ ⇒ (∀x, y ∈ S1) (ax = ay ⇔ bx = by).

(Dandan Yang ) IG(E) over bands June 3, 2013 7 / 17

slide-29
SLIDE 29

IG(E) over semilattices

Green’s star equivalences For any a, b ∈ S, a L∗ b ⇐ ⇒ (∀x, y ∈ S1) (ax = ay ⇔ bx = by). Dually, the relation R∗ is defined on S.

(Dandan Yang ) IG(E) over bands June 3, 2013 7 / 17

slide-30
SLIDE 30

IG(E) over semilattices

Green’s star equivalences For any a, b ∈ S, a L∗ b ⇐ ⇒ (∀x, y ∈ S1) (ax = ay ⇔ bx = by). Dually, the relation R∗ is defined on S. Note L ⊆ L∗, R ⊆ R∗.

(Dandan Yang ) IG(E) over bands June 3, 2013 7 / 17

slide-31
SLIDE 31

IG(E) over semilattices

Green’s star equivalences For any a, b ∈ S, a L∗ b ⇐ ⇒ (∀x, y ∈ S1) (ax = ay ⇔ bx = by). Dually, the relation R∗ is defined on S. Note L ⊆ L∗, R ⊆ R∗. Definition A semigroup S is called abundant if each L∗-class and each R∗-class contains an idempotent of S.

(Dandan Yang ) IG(E) over bands June 3, 2013 7 / 17

slide-32
SLIDE 32

IG(E) over semilattices

Lemma (E

∗, R) is locally confluent.

(Dandan Yang ) IG(E) over bands June 3, 2013 8 / 17

slide-33
SLIDE 33

IG(E) over semilattices

Lemma (E

∗, R) is locally confluent.

(i) e ≤ f , f ≤ g (ii) e ≤ f , f ≥ g e f g e g e f e e f g e g e g e g (iii) e ≥ f , f ≥ g (iv) e ≥ f , f ≤ g e f g f g e g g e f g f g e f f

(Dandan Yang ) IG(E) over bands June 3, 2013 8 / 17

slide-34
SLIDE 34

IG(E) over semilattices

Lemma (E

∗, R) is noetherian.

(Dandan Yang ) IG(E) over bands June 3, 2013 9 / 17

slide-35
SLIDE 35

IG(E) over semilattices

Lemma (E

∗, R) is noetherian.

Corollary Every element x1 · · · xn ∈ IG(E) has a unique normal form.

(Dandan Yang ) IG(E) over bands June 3, 2013 9 / 17

slide-36
SLIDE 36

IG(E) over semilattices

Lemma (E

∗, R) is noetherian.

Corollary Every element x1 · · · xn ∈ IG(E) has a unique normal form. Theorem IG(E) is abundant, and so adequate.

(Dandan Yang ) IG(E) over bands June 3, 2013 9 / 17

slide-37
SLIDE 37

IG(E) over semilattices

Lemma (E

∗, R) is noetherian.

Corollary Every element x1 · · · xn ∈ IG(E) has a unique normal form. Theorem IG(E) is abundant, and so adequate. Note Adequate semigroups belong to a quasivariety of algebras introduced in York by Fountain over 30 years ago, for which the free objects have recently been described.

(Dandan Yang ) IG(E) over bands June 3, 2013 9 / 17

slide-38
SLIDE 38

IG(E) over simple bands

Recall that a band E is a semilattice Y of rectangular bands Eα, where α ∈ Y .

(Dandan Yang ) IG(E) over bands June 3, 2013 10 / 17

slide-39
SLIDE 39

IG(E) over simple bands

Recall that a band E is a semilattice Y of rectangular bands Eα, where α ∈ Y . Definition A band E is called a simple band if each Eα is either a left zero band or a right zero band, for all α ∈ Y .

(Dandan Yang ) IG(E) over bands June 3, 2013 10 / 17

slide-40
SLIDE 40

IG(E) over simple bands

Recall that a band E is a semilattice Y of rectangular bands Eα, where α ∈ Y . Definition A band E is called a simple band if each Eα is either a left zero band or a right zero band, for all α ∈ Y . Note We lose the uniqueness of normal form here!

(Dandan Yang ) IG(E) over bands June 3, 2013 10 / 17

slide-41
SLIDE 41

IG(E) over simple bands

Recall that a band E is a semilattice Y of rectangular bands Eα, where α ∈ Y . Definition A band E is called a simple band if each Eα is either a left zero band or a right zero band, for all α ∈ Y . Note We lose the uniqueness of normal form here! Consider the following simple band a b c d e a b c d e a a b c d e b b b c e e c b b c e e d d e e d e e e e e e e

(Dandan Yang ) IG(E) over bands June 3, 2013 10 / 17

slide-42
SLIDE 42

IG(E) over simple bands

Recall that a band E is a semilattice Y of rectangular bands Eα, where α ∈ Y . Definition A band E is called a simple band if each Eα is either a left zero band or a right zero band, for all α ∈ Y . Note We lose the uniqueness of normal form here! Consider the following simple band a b c d e a b c d e a a b c d e b b b c e e c b b c e e d d e e d e e e e e e e Clearly, c d = c ad = c a d = ca d = b d

(Dandan Yang ) IG(E) over bands June 3, 2013 10 / 17

slide-43
SLIDE 43

IG(E) over simple bands

Note IG(E) does not have to be abundant.

(Dandan Yang ) IG(E) over bands June 3, 2013 11 / 17

slide-44
SLIDE 44

IG(E) over simple bands

Note IG(E) does not have to be abundant. Let E = {a, b, x, y} be a simple band with a b x y a b x y a a y x y b y b x y x x y x y y y y x y

(Dandan Yang ) IG(E) over bands June 3, 2013 11 / 17

slide-45
SLIDE 45

IG(E) over simple bands

Note IG(E) does not have to be abundant. Let E = {a, b, x, y} be a simple band with a b x y a b x y a a y x y b y b x y x x y x y y y y x y Note a b does not R∗-related to any element in E.

(Dandan Yang ) IG(E) over bands June 3, 2013 11 / 17

slide-46
SLIDE 46

IG(E) over simple bands

Let U ⊆ E(S). For any a, b ∈ S, a LU b ⇐ ⇒ (∀e ∈ U) (ae = a ⇔ be = b). a RU b ⇐ ⇒ (∀e ∈ U) (ea = a ⇔ eb = b).

(Dandan Yang ) IG(E) over bands June 3, 2013 12 / 17

slide-47
SLIDE 47

IG(E) over simple bands

Let U ⊆ E(S). For any a, b ∈ S, a LU b ⇐ ⇒ (∀e ∈ U) (ae = a ⇔ be = b). a RU b ⇐ ⇒ (∀e ∈ U) (ea = a ⇔ eb = b). Note L ⊆ L∗ ⊆ LU, R ⊆ R∗ ⊆ RU.

(Dandan Yang ) IG(E) over bands June 3, 2013 12 / 17

slide-48
SLIDE 48

IG(E) over simple bands

Let U ⊆ E(S). For any a, b ∈ S, a LU b ⇐ ⇒ (∀e ∈ U) (ae = a ⇔ be = b). a RU b ⇐ ⇒ (∀e ∈ U) (ea = a ⇔ eb = b). Note L ⊆ L∗ ⊆ LU, R ⊆ R∗ ⊆ RU. Definition A semigroup S with U ⊆ E(S) is called weakly U-abundant if each LU-class and each RU-class contains an idempotent in U, and U is called the distinguished set of S.

(Dandan Yang ) IG(E) over bands June 3, 2013 12 / 17

slide-49
SLIDE 49

IG(E) over simple bands

Let U ⊆ E(S). For any a, b ∈ S, a LU b ⇐ ⇒ (∀e ∈ U) (ae = a ⇔ be = b). a RU b ⇐ ⇒ (∀e ∈ U) (ea = a ⇔ eb = b). Note L ⊆ L∗ ⊆ LU, R ⊆ R∗ ⊆ RU. Definition A semigroup S with U ⊆ E(S) is called weakly U-abundant if each LU-class and each RU-class contains an idempotent in U, and U is called the distinguished set of S. Definition A weakly U-abundant semigroup semigroup S satisfies the congruence condition if LU is a right congruence and RU is a left congruence.

(Dandan Yang ) IG(E) over bands June 3, 2013 12 / 17

slide-50
SLIDE 50

IG(E) over simple bands

Lemma For any e ∈ Eα, f ∈ Eβ, (e, f ) is basic pair in E if and only if (α, β) is a basic pair in Y .

(Dandan Yang ) IG(E) over bands June 3, 2013 13 / 17

slide-51
SLIDE 51

IG(E) over simple bands

Lemma For any e ∈ Eα, f ∈ Eβ, (e, f ) is basic pair in E if and only if (α, β) is a basic pair in Y . Lemma Let θ : S − → T be an onto homomorphism of semigroups S and

  • T. Then a map

θ : IG(U) − → IG(V ) defined by e θ = eθ for all e ∈ U, is a well defined homomorphism, where U and V are the biordered sets of S and T, respectively.

(Dandan Yang ) IG(E) over bands June 3, 2013 13 / 17

slide-52
SLIDE 52

IG(E) over simple bands

Let α = w1 · · · wk with wi ∈ Eγi, for 1 ≤ i ≤ k. Then (w1 · · · wk) θ = γ1 · · · γk.

(Dandan Yang ) IG(E) over bands June 3, 2013 14 / 17

slide-53
SLIDE 53

IG(E) over simple bands

Let α = w1 · · · wk with wi ∈ Eγi, for 1 ≤ i ≤ k. Then (w1 · · · wk) θ = γ1 · · · γk. We choose i1, j1, i2, j2, · · · , ir ∈ {1, · · · , k} in the following way:

(Dandan Yang ) IG(E) over bands June 3, 2013 14 / 17

slide-54
SLIDE 54

IG(E) over simple bands

Let α = w1 · · · wk with wi ∈ Eγi, for 1 ≤ i ≤ k. Then (w1 · · · wk) θ = γ1 · · · γk. We choose i1, j1, i2, j2, · · · , ir ∈ {1, · · · , k} in the following way: γ1 · · · γi1−1 γi1 γi1+1 · · ·γj1 γj1+1 · · · γi2−1 γi2 · · · γir · · · γir+1 · · · γik

× ×

(Dandan Yang ) IG(E) over bands June 3, 2013 14 / 17

slide-55
SLIDE 55

IG(E) over simple bands

Let α = w1 · · · wk with wi ∈ Eγi, for 1 ≤ i ≤ k. Then (w1 · · · wk) θ = γ1 · · · γk. We choose i1, j1, i2, j2, · · · , ir ∈ {1, · · · , k} in the following way: γ1 · · · γi1−1 γi1 γi1+1 · · ·γj1 γj1+1 · · · γi2−1 γi2 · · · γir · · · γir+1 · · · γik

× ×

We call i1, · · · , ir are the significant indices of α.

(Dandan Yang ) IG(E) over bands June 3, 2013 14 / 17

slide-56
SLIDE 56

IG(E) over simple bands

Let α = w1 · · · wk with wi ∈ Eγi, for 1 ≤ i ≤ k. Then (w1 · · · wk) θ = γ1 · · · γk. We choose i1, j1, i2, j2, · · · , ir ∈ {1, · · · , k} in the following way: γ1 · · · γi1−1 γi1 γi1+1 · · ·γj1 γj1+1 · · · γi2−1 γi2 · · · γir · · · γir+1 · · · γik

× ×

We call i1, · · · , ir are the significant indices of α. Lemma r and γi1, · · · , γir are fixed for the equivalence class of α.

(Dandan Yang ) IG(E) over bands June 3, 2013 14 / 17

slide-57
SLIDE 57

IG(E) over simple bands

Lemma Suppose α = w1 · · · wk and β = x1 · · · xl with α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then w1 · · · wi1 R x1 · · · xz1.

(Dandan Yang ) IG(E) over bands June 3, 2013 15 / 17

slide-58
SLIDE 58

IG(E) over simple bands

Lemma Suppose α = w1 · · · wk and β = x1 · · · xl with α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then w1 · · · wi1 R x1 · · · xz1. Lemma Let E be a simple band and x1 · · · xn ∈ IG(E) with normal forms u1 · · · um = v1 · · · vs. Then s = m and ui D vi, for all i ∈ [1, m].

(Dandan Yang ) IG(E) over bands June 3, 2013 15 / 17

slide-59
SLIDE 59

IG(E) over simple bands

Lemma Suppose α = w1 · · · wk and β = x1 · · · xl with α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then w1 · · · wi1 R x1 · · · xz1. Lemma Let E be a simple band and x1 · · · xn ∈ IG(E) with normal forms u1 · · · um = v1 · · · vs. Then s = m and ui D vi, for all i ∈ [1, m]. In particular, we have u1 R v1 and um L vm.

(Dandan Yang ) IG(E) over bands June 3, 2013 15 / 17

slide-60
SLIDE 60

IG(E) over simple bands

Lemma Suppose α = w1 · · · wk and β = x1 · · · xl with α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then w1 · · · wi1 R x1 · · · xz1. Lemma Let E be a simple band and x1 · · · xn ∈ IG(E) with normal forms u1 · · · um = v1 · · · vs. Then s = m and ui D vi, for all i ∈ [1, m]. In particular, we have u1 R v1 and um L vm. Theorem IG(E) over a simple band is a weakly abundant semigroup with the congruence condition.

(Dandan Yang ) IG(E) over bands June 3, 2013 15 / 17

slide-61
SLIDE 61

IG(E) over simple bands

Lemma Suppose α = w1 · · · wk and β = x1 · · · xl with α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then w1 · · · wi1 R x1 · · · xz1. Lemma Let E be a simple band and x1 · · · xn ∈ IG(E) with normal forms u1 · · · um = v1 · · · vs. Then s = m and ui D vi, for all i ∈ [1, m]. In particular, we have u1 R v1 and um L vm. Theorem IG(E) over a simple band is a weakly abundant semigroup with the congruence condition.

(Dandan Yang ) IG(E) over bands June 3, 2013 15 / 17

slide-62
SLIDE 62

IG(E) over strong simple bands

Definition A band E is a strong simple band if it is a strong semilattice

  • f right/zero bands.

(Dandan Yang ) IG(E) over bands June 3, 2013 16 / 17

slide-63
SLIDE 63

IG(E) over strong simple bands

Definition A band E is a strong simple band if it is a strong semilattice

  • f right/zero bands.

Lemma Let α = w1 · · · wk and β = x1 · · · xl such that α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then x1 · · · xzl = w1 · · · wilu where l ∈ [1, r] and u ∈ E.

(Dandan Yang ) IG(E) over bands June 3, 2013 16 / 17

slide-64
SLIDE 64

IG(E) over strong simple bands

Definition A band E is a strong simple band if it is a strong semilattice

  • f right/zero bands.

Lemma Let α = w1 · · · wk and β = x1 · · · xl such that α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then x1 · · · xzl = w1 · · · wilu where l ∈ [1, r] and u ∈ E. Lemma Let u1 · · · um = v1 · · · vm ∈ IG(E) be in normal form. Then (i) ui L vi implies u1 · · · ui = v1 · · · vi; (ii) ui R vi implies ui · · · um = vi · · · vm.

(Dandan Yang ) IG(E) over bands June 3, 2013 16 / 17

slide-65
SLIDE 65

IG(E) over strong simple bands

Definition A band E is a strong simple band if it is a strong semilattice

  • f right/zero bands.

Lemma Let α = w1 · · · wk and β = x1 · · · xl such that α ∼ β via single

  • reduction. Suppose that the significant indices of α and β are i1, · · · , ir

and z1, · · · , zr, respectively. Then x1 · · · xzl = w1 · · · wilu where l ∈ [1, r] and u ∈ E. Lemma Let u1 · · · um = v1 · · · vm ∈ IG(E) be in normal form. Then (i) ui L vi implies u1 · · · ui = v1 · · · vi; (ii) ui R vi implies ui · · · um = vi · · · vm. Theorem IG(E) over a strong simple band is abundant.

(Dandan Yang ) IG(E) over bands June 3, 2013 16 / 17

slide-66
SLIDE 66

A key message

Thank you!

(Dandan Yang ) IG(E) over bands June 3, 2013 17 / 17