Special classes of semigroups


In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists of all those semigroups in which the binary operation satisfies the commutativity property that ab = ba for all elements a and b in the semigroup.
The class of finite semigroups consists of those semigroups for which the underlying set has finite cardinality. Members of the class of Brandt semigroups are required to satisfy not just one condition but a set of additional properties. A large collection of special classes of semigroups have been defined though not all of them have been studied equally intensively.
In the algebraic theory of semigroups, in constructing special classes, attention is focused only on those properties, restrictions and conditions which can be expressed in terms of the binary operations in the semigroups and occasionally on the cardinality and similar properties of subsets of the underlying set. The underlying sets are not assumed to carry any other mathematical structures like order or topology.
As in any algebraic theory, one of the main problems of the theory of semigroups is the classification of all semigroups and a complete description of their structure. In the case of semigroups, since the binary operation is required to satisfy only the associativity property the problem of classification is considered extremely difficult. Descriptions of structures have been obtained for certain special classes of semigroups. For example, the structure of the sets of idempotents of regular semigroups is completely known. Structure descriptions are presented in terms of better known types of semigroups. The best known type of semigroup is the group.
A list of various special classes of semigroups is presented below. To the extent possible the defining properties are formulated in terms of the binary operations in the semigroups. The references point to the locations from where the defining properties are sourced.

Notations

In describing the defining properties of the various special classes of semigroups, the following notational conventions are adopted.

NotationMeaning
SArbitrary semigroup
ESet of idempotents in S
GGroup of units in S
IMinimal ideal of S
VRegular elements of S
XArbitrary set
a, b, cArbitrary elements of S
x, y, zSpecific elements of S
e, f, gArbitrary elements of E
hSpecific element of E
l, m, nArbitrary positive integers
j, kSpecific positive integers
v, wArbitrary elements of V
0Zero element of S
1Identity element of S
S1S if 1 ∈ S; S ∪ if 1 ∉ S
aL b
aR b
aH b
aJ b
S1aS1b
aS1bS1
S1aS1b and aS1bS1
S1aS1S1bS1
L, R, H, D, JGreen's relations
La, Ra, Ha, Da, JaGreen classes containing a
The only power of x which is idempotent. This element exists, assuming the semigroup is finite. See variety of finite semigroups for more information about this notation.
The cardinality of X, assuming X is finite.


For example, the definition xab = xba should be read as:
The third column states whether this set of semigroups forms a variety. And whether the set of finite semigroups of this special class forms a variety of finite semigroups. Note that if this set is a variety, its set of finite elements is automatically a variety of finite semigroups.

TerminologyDefining propertyVariety of finite semigroupReference
Finite semigroup
  • Not infinite
  • Finite
  • Empty semigroup
  • S =
  • No
    Trivial semigroup
  • Cardinality of S is 1.
  • Infinite
  • Finite
  • Monoid
  • 1 ∈ S
  • No[|Gril] p. 3
    Band
    • a2 = a
  • Infinite
  • Finite
  • C&P p. 4
    Rectangular band
  • A band such that abca = acba
  • Infinite
  • Finite
  • Fennemore
    SemilatticeA commutative band, that is:
  • a2 = a
  • ab = ba
  • Infinite
  • Finite
  • C&P p. 24
  • Fennemore
  • Commutative semigroup
  • ab = ba
  • Infinite
  • Finite
  • C&P p. 3
    Archimedean commutative semigroup
  • ab = ba
  • There exists x and k such that ak = xb.
  • C&P p. 131
    Nowhere commutative semigroup
  • ab = baa = b
  • C&P p. 26
    Left weakly commutative
  • There exist x and k such that k = bx.
  • [|Nagy] p. 59
    Right weakly commutative
  • There exist x and k such that k = xa.
  • Nagy p. 59
    Weakly commutativeLeft and right weakly commutative. That is:
  • There exist x and j such that j = bx.
  • There exist y and k such that k = ya.
  • Nagy p. 59
    Conditionally commutative semigroup
  • If ab = ba then axb = bxa for all x.
  • Nagy p. 77
    R-commutative semigroup
  • ab R ba
  • Nagy p. 69–71
    RC-commutative semigroup
  • R-commutative and conditionally commutative
  • Nagy p. 93–107
    L-commutative semigroup
  • ab L ba
  • Nagy p. 69–71
    LC-commutative semigroup
  • L-commutative and conditionally commutative
  • Nagy p. 93–107
    H-commutative semigroup
  • ab H ba
  • Nagy p. 69–71
    Quasi-commutative semigroup
  • ab = k for some k.
  • Nagy p. 109
    Right commutative semigroup
  • xab = xba
  • Nagy p. 137
    Left commutative semigroup
  • abx = bax
  • Nagy p. 137
    Externally commutative semigroup
  • axb = bxa
  • Nagy p. 175
    Medial semigroup
  • xaby = xbay
  • Nagy p. 119
    E-k semigroup
  • k = akbk
  • Infinite
  • Finite
  • Nagy p. 183
    Exponential semigroup
  • m = ambm for all m
  • Infinite
  • Finite
  • Nagy p. 183
    WE-k semigroup
  • There is a positive integer j depending on the couple such that k+j = akbk j = jakbk
  • Nagy p. 199
    Weakly exponential semigroup
  • WE-m for all m
  • Nagy p. 215
    Right cancellative semigroup
  • ba = ca b = c
  • C&P p. 3
    Left cancellative semigroup
  • ab = ac b = c
  • C&P p. 3
    Cancellative semigroupLeft and right cancellative semigroup, that is
  • ab = ac b = c
  • ba = ca b = c
  • C&P p. 3
    E-inversive semigroup
  • There exists x such that axE.
  • C&P p. 98
    Regular semigroup
  • There exists x such that axa =a.
  • C&P p. 26
    Regular band
  • A band such that abaca = 'abca
  • Infinite
  • Finite
  • Fennemore
    Intra-regular semigroup
  • There exist x and y such that xa2y = a.
  • C&P p. 121
    Left regular semigroup
  • There exists x such that xa2 = a.
  • C&P p. 121
    Left-regular band
  • A band such that aba = 'ab
  • Infinite
  • Finite
  • Fennemore
    Right regular semigroup
  • There exists x such that a2x = a.
  • C&P p. 121
    Right-regular band
  • A band such that aba = 'ba
  • Infinite
  • Finite
  • Fennemore
    Completely regular semigroup
  • Ha is a group.
  • Gril p. 75
    Clifford semigroup
  • A regular semigroup in which all idempotents are central.
  • Equivalently, for finite semigroup:
  • Finite
  • [|Petrich] p. 65
    k-regular semigroup
  • There exists x such that akxak = ak.
  • Hari
    Eventually regular semigroup
    • There exists k and x such that akxak = ak.
    Edwa
    Shum
    [|Higg] p. 49
    Quasi-periodic semigroup, epigroup, group-bound semigroup, completely
  • There exists k such that ak belongs to a subgroup of S
  • Kela
    Gril p. 110Higg p. 4
    Primitive semigroup
    • If 0e and f = ef = fe then e = f.
    C&P p. 26
    Unit regular semigroup
  • There exists u in G such that aua = a.
  • Tvm
    Strongly unit regular semigroup
  • There exists u in G such that aua = a.
  • e D ff = v−1ev for some v in G.
  • Tvm
    Orthodox semigroup
  • There exists x such that axa = a.
  • E is a subsemigroup of S.
  • Gril p. 57
    [|Howi] p. 226
    Inverse semigroup
  • There exists unique x such that axa = a and xax = x.
  • C&P p. 28
    Left inverse semigroup
    • Ra contains a unique h.
    Gril p. 382
    Right inverse semigroup
    • La contains a unique h.
    Gril p. 382
    Locally inverse semigroup
    • There exists x such that axa = a.
    • E is a pseudosemilattice.
    Gril p. 352
    M-inversive semigroup
  • There exist x and y such that baxc = bc and byac = bc.
  • C&P p. 98
    Pseudoinverse semigroup
    • There exists x such that axa = a.
    • E is a pseudosemilattice.
    Gril p. 352
    Abundant semigroup
  • The classes L*a and R*a, where a L* b if ac = adbc = bd and a R* b if ca = dacb = db, contain idempotents.
  • Chen
    Rpp-semigroup
    • The class L*a, where a L* b if ac = adbc = bd, contains at least one idempotent.
    Shum
    Lpp-semigroup
    • The class R*a, where a R* b if ca = dacb = db, contains at least one idempotent.
    Shum
    Null semigroup
    • 0 ∈ S
    • ab = 0
    • Equivalently ab = cd
  • Infinite
  • Finite
  • C&P p. 4
    Left zero semigroup
  • ab = a
  • Infinite
  • Finite
  • C&P p. 4
    Left zero bandA left zero semigroup which is a band. That is:
  • ab = a
  • aa = a
  • Infinite
  • Finite
  • Fennemore
  • Right zero semigroup
  • ab = b
  • Infinite
  • Finite
  • C&P p. 4
    Right zero bandA right zero semigroup which is a band. That is:
  • ab = b
  • aa = a
  • Infinite
  • Finite
  • Fennemore
    Unipotent semigroup
  • E is singleton.
  • Infinite
  • Finite
  • C&P p. 21
    Left reductive semigroup
  • If xa = xb for all x then a = b.
  • C&P p. 9
    Right reductive semigroup
  • If ax = bx for all x then a = b.
  • C&P p. 4
    Reductive semigroup
  • If xa = xb for all x then a = b.
  • If ax = bx for all x then a = b.
  • C&P p. 4
    Separative semigroup
  • ab = a2 = b2a = b
  • C&P p. 130–131
    Reversible semigroup
  • SaSb ≠ Ø
  • aSbS ≠ Ø
  • C&P p. 34
    Right reversible semigroup
  • SaSb ≠ Ø
  • C&P p. 34
    Left reversible semigroup
  • aSbS ≠ Ø
  • C&P p. 34
    Aperiodic semigroup
    • There exists k such that ak = ak+1
    • Equivalently, for finite semigroup: for each a,.
  • KKM p. 29
  • Pin p. 158
  • ω-semigroup
  • E is countable descending chain under the order aH b
  • Gril p. 233–238
    Left Clifford semigroup
    • aSSa
    Shum
    Right Clifford semigroup
    • SaaS
    Shum
    Orthogroup
  • Ha is a group.
  • E is a subsemigroup of S
  • Shum
    Complete commutative semigroup
  • ab = ba
  • ak is in a subgroup of S for some k.
  • Every nonempty subset of E has an infimum.
  • Gril p. 110
    Nilsemigroup
  • 0 ∈ S
  • ak = 0 for some integer k which depends on a.
  • Equivalently, for finite semigroup: for each element x and y, .
  • Finite
  • Gril p. 99
  • Pin p. 148
  • Elementary semigroup
  • ab = ba
  • S is of the form GN where
  • G is a group, and 1 ∈ G
  • N is an ideal, a nilsemigroup, and 0 ∈ N
  • Gril p. 111
    E-unitary semigroup
  • There exists unique x such that axa = a and xax = x.
  • ea = eaE
  • Gril p. 245
    Finitely presented semigroup
  • S has a presentation in which X and R are finite.
  • Gril p. 134
    Fundamental semigroup
  • Equality on S is the only congruence contained in H.
  • Gril p. 88
    Idempotent generated semigroup
  • S is equal to the semigroup generated by E.
  • Gril p. 328
    Locally finite semigroup
  • Every finitely generated subsemigroup of S is finite.
  • Not infinite
  • Finite
  • Gril p. 161
    N-semigroup
  • ab = ba
  • There exists x and a positive integer n such that a = xbn.
  • ax = ay x = y
  • xa = ya x = y
  • E = Ø
  • Gril p. 100
    L-unipotent semigroup
    • La contains a unique e.
    Gril p. 362
    R-unipotent semigroup
    • Ra contains a unique e.
    Gril p. 362
    Left simple semigroup
  • La = S
  • Gril p. 57
    Right simple semigroup
  • Ra = S
  • Gril p. 57
    Subelementary semigroup
  • ab = ba
  • S = CN where C is a cancellative semigroup, N is a nilsemigroup or a one-element semigroup.
  • N is ideal of S.
  • Zero of N is 0 of S.
  • For x, y in S and c in C, cx = cy implies that x = y.
  • Gril p. 134
    Symmetric semigroup
    C&P p. 2
    Weakly reductive semigroup
  • If xz = yz and zx = zy for all z in S then x = y.
  • C&P p. 11
    Right unambiguous semigroup
  • If x, yR z then xR y or yR x.
  • Gril p. 170
    Left unambiguous semigroup
  • If x, yL z then xL y or yL x.
  • Gril p. 170
    Unambiguous semigroup
  • If x, yR z then xR y or yR x.
  • If x, yL z then xL y or yL x.
  • Gril p. 170
    Left 0-unambiguous
  • 0∈ S
  • 0 ≠ xL y, zyL z or zL y
  • Gril p. 178
    Right 0-unambiguous
  • 0∈ S
  • 0 ≠ xR y, zyL z or zR y
  • Gril p. 178
    0-unambiguous semigroup
  • 0∈ S
  • 0 ≠ xL y, zyL z or zL y
  • 0 ≠ xR y, zyL z or zR y
  • Gril p. 178
    Left Putcha semigroup
  • abS1anb2S1 for some n.
  • Nagy p. 35
    Right Putcha semigroup
  • aS1banS1b2 for some n.
  • Nagy p. 35
    Putcha semigroup
  • aS1b S1anS1b2S1 for some positive integer n
  • Nagy p. 35
    Bisimple semigroup
    • Da = S
    C&P p. 49
    0-bisimple semigroup
  • 0 ∈ S
  • S - is a D-class of S.
  • C&P p. 76
    Completely simple semigroup
  • There exists no AS, AS such that SAA and ASA.
  • There exists h in E such that whenever hf = f and fh = f we have h = f.
  • C&P p. 76
    Completely 0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that ASA and SAA then A = 0 or A = S.
  • There exists non-zero h in E such that whenever hf = f, fh = f and f ≠ 0 we have h = f.
  • C&P p. 76
    D-simple semigroup
    • Da = S
    C&P p. 49
    Semisimple semigroup
  • Let J = S1aS1, I = JJa. Each Rees factor semigroup J/I is 0-simple or simple.
  • C&P p. 71–75
    : Simple semigroup
  • Ja = S.,
  • equivalently, for finite semigroup: and.
  • Finite
  • C&P p. 5
  • Higg p. 16
  • Pin pp. 151, 158
  • 0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that ASA and SAA then A = 0.
  • C&P p. 67
    Left 0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that SAA then A = 0.
  • C&P p. 67
    Right 0-simple semigroup
  • 0 ∈ S
  • S2 ≠ 0
  • If AS is such that ASA then A = 0.
  • C&P p. 67
    Cyclic semigroup
    • S = for some w in S
  • Not infinite
  • Not finite
  • C&P p. 19
    Periodic semigroup
  • is a finite set.
  • Not infinite
  • Finite
  • C&P p. 20
    Bicyclic semigroup
  • 1 ∈ S
  • S admits the presentation.
  • C&P p. 43–46
    Full transformation semigroup TX
    • Set of all mappings of X into itself with composition of mappings as binary operation.
    C&P p. 2
    Rectangular band
  • A band such that aba = a
  • Equivalently abc = ac
  • Infinite
  • Finite
  • Fennemore
    Rectangular semigroup
  • Whenever three of ax, ay, bx, by are equal, all four are equal.
  • C&P p. 97
    Symmetric inverse semigroup IX
  • The semigroup of one-to-one partial transformations of X.
  • C&P p. 29
    Brandt semigroup
  • 0 ∈ S
  • a = b
  • abc ≠ 0
  • If a ≠ 0 there exist unique x, y, z, such that xa = a, ay = a, za = y.
  • eSf ≠ 0.
  • C&P p. 101
    Free semigroup FX
  • Set of finite sequences of elements of X with the operation
  • =
    Gril p. 18
    Rees matrix semigroup
    • G0 a group G with 0 adjoined.
    • P : Λ × IG0 a map.
    • Define an operation in I × G0 × Λ by =.
    • / is the Rees matrix semigroup M0.
    C&P p.88
    Semigroup of linear transformations
  • Semigroup of linear transformations of a vector space V over a field F under composition of functions.
  • C&P p.57
    Semigroup of binary relations BX
  • Set of all binary relations on X under composition
  • C&P p.13
    Numerical semigroup
  • 0 ∈ SN = under +.
  • N - S is finite
  • Delg
    Semigroup with involution
    • There exists a unary operation aa* in S such that a** = a and * = b*a*.
    Howi
    Baer–Levi semigroup
  • Semigroup of one-to-one transformations f of X such that Xf is infinite.
  • C&P II Ch.8
    U-semigroup
  • There exists a unary operation aa’ in S such that ’ = a.
  • Howi p.102
    I-semigroup
  • There exists a unary operation aa’ in S such that ’ = a and aaa = a.
  • Howi p.102
    Semiband
  • A regular semigroup generated by its idempotents.
  • Howi p.230
    Group
  • There exists h such that for all a, ah = ha = a.
  • There exists x such that ax = xa = h.
  • Not infinite
  • Finite
  • Topological semigroup
  • A semigroup which is also a topological space. Such that the semigroup product is continuous.
  • Not applicable
  • [|Pin] p. 130
    Syntactic semigroup
  • The smallest finite monoid which can recognize a subset of another semigroup.
  • Pin p. 14
    : the R-trivial monoids
  • R-trivial. That is, each R-equivalence class is trivial.
  • Equivalently, for finite semigroup:.
  • Finite
  • Pin p. 158
    : the L-trivial monoids
  • L-trivial. That is, each L-equivalence class is trivial.
  • Equivalently, for finite monoids,.
  • Finite
  • Pin p. 158
    : the J-trivial monoids
  • Monoids which are J-trivial. That is, each J-equivalence class is trivial.
  • Equivalently, the monoids which are L-trivial and R-trivia.
  • Finite
  • Pin p. 158
    : idempotent and R-trivial monoids
  • R-trivial. That is, each R-equivalence class is trivial.
  • Equivalently, for finite monoids: aba = ab.
  • Finite
  • Pin p. 158
    : idempotent and L-trivial monoids
  • L-trivial. That is, each L-equivalence class is trivial.
  • Equivalently, for finite monoids: aba = ba.
  • Finite
  • Pin p. 158
    : Semigroup whose regular D are semigroup
  • Equivalently, for finite monoids:.
  • Equivalently, regular H-classes are groups,
  • Equivalently, vJa implies v R va and v L av
  • Equivalently, for each idempotent e, the set of a such that eJa is closed under product
  • Equivalently, there exists no idempotent e and f such that e J f but not ef J e
  • Equivalently, the monoid does not divide
  • Finite
  • Pin pp. 154, 155, 158
    : Semigroup whose regular D are aperiodic semigroup
  • Each regular D-class is an aperiodic semigroup
  • Equivalently, every regular D-class is a rectangular band
  • Equivalently, regular D-class are semigroup, and furthermore S is aperiodic
  • Equivalently, for finite monoid: regular D-class are semigroup, and furthermore
  • Equivalently, eJa implies eae = e
  • Equivalently, eJf implies efe = e.
  • Finite
  • Pin p. 156, 158
    /: Lefty trivial semigroup
  • e: eS = e,
  • Equivalently, I is a left zero semigroup equal to E,
  • Equivalently, for finite semigroup: I is a left zero semigroup equals,
  • Equivalently, for finite semigroup:,
  • Equivalently, for finite semigroup:.
  • Finite
  • Pin pp. 149, 158
    /: Right trivial semigroup
  • e: Se = e,
  • Equivalently, I is a right zero semigroup equal to E,
  • Equivalently, for finite semigroup: I is a right zero semigroup equals,
  • Equivalently, for finite semigroup:,
  • Equivalently, for finite semigroup:.
  • Finite
  • Pin pp. 149, 158
    : Locally trivial semigroup
  • eSe = e,
  • Equivalently, I is equal to E,
  • Equivalently, eaf = ef,
  • Equivalently, for finite semigroup:,
  • Equivalently, for finite semigroup:,
  • Equivalently, for finite semigroup:.
  • Finite
  • Pin pp. 150, 158
    : Locally groups
  • eSe is a group,
  • Equivalently, EI,
  • Equivalently, for finite semigroup:.
  • Finite
  • Pin pp. 151, 158
    ---
    TerminologyDefining propertyVarietyReference
    Ordered semigroup
    • A semigroup with a partial order relation ≤, such that ab'' implies c•a ≤ c•b and a•c ≤ b•c
  • Finite
  • Pin p. 14
  • Nilpotent finite semigroups, with
  • Finite
  • Pin pp. 157, 158
  • Nilpotent finite semigroups, with
  • Finite
  • Pin pp. 157, 158
  • Semilattices with
  • Finite
  • Pin pp. 157, 158
  • Semilattices with
  • Finite
  • Pin pp. 157, 158
    locally positive J-trivial semigroup
  • Finite semigroups satisfying
  • Finite
  • Pin pp. 157, 158