In mathematics, a null semigroup (also called a zero semigroup) is a semigroup with an absorbing element, called zero, in which the product of any two elements is zero.[1] If every element of a semigroup is a left zero then the semigroup is called a left zero semigroup; a right zero semigroup is defined analogously.[2]

According to A. H. Clifford and G. B. Preston, "In spite of their triviality, these semigroups arise naturally in a number of investigations."[1]

Null semigroup

edit

Let S be a semigroup with zero element 0. Then S is called a null semigroup if xy = 0 for all x and y in S.

Cayley table for a null semigroup

edit

Let S = {0, a, b, c} be (the underlying set of) a null semigroup. Then the Cayley table for S is as given below:

Cayley table for a null semigroup
0 a b c
0 0 0 0 0
a 0 0 0 0
b 0 0 0 0
c 0 0 0 0

Left zero semigroup

edit

A semigroup in which every element is a left zero element is called a left zero semigroup. Thus a semigroup S is a left zero semigroup if xy = x for all x and y in S.

Cayley table for a left zero semigroup

edit

Let S = {a, b, c} be a left zero semigroup. Then the Cayley table for S is as given below:

Cayley table for a left zero semigroup
a b c
a a a a
b b b b
c c c c

Right zero semigroup

edit

A semigroup in which every element is a right zero element is called a right zero semigroup. Thus a semigroup S is a right zero semigroup if xy = y for all x and y in S.

Cayley table for a right zero semigroup

edit

Let S = {a, b, c} be a right zero semigroup. Then the Cayley table for S is as given below:

Cayley table for a right zero semigroup
a b c
a a b c
b a b c
c a b c

Properties

edit

A non-trivial null (left/right zero) semigroup does not contain an identity element. It follows that the only null (left/right zero) monoid is the trivial monoid. On the other hand, a null (left/right zero) semigroup with an identity adjoined is called a find-unique (find-first/find-last) monoid.

The class of null semigroups is:

It follows that the class of null (left/right zero) semigroups is a variety of universal algebra, and thus a variety of finite semigroups. The variety of finite null semigroups is defined by the identity ab = cd.

See also

edit

References

edit
  1. ^ a b A H Clifford; G B Preston (1964). The Algebraic Theory of Semigroups, volume I. mathematical Surveys. Vol. 1 (2 ed.). American Mathematical Society. pp. 3–4. ISBN 978-0-8218-0272-4. {{cite book}}: ISBN / Date incompatibility (help)
  2. ^ M. Kilp, U. Knauer, A.V. Mikhalev, Monoids, Acts and Categories with Applications to Wreath Products and Graphs, De Gruyter Expositions in Mathematics vol. 29, Walter de Gruyter, 2000, ISBN 3-11-015248-7, p. 19

📚 Artikel Terkait di Wikipedia

Semigroup

appears in the theory of one-parameter operator semigroups: see C0-semigroup. The binary operation of a semigroup is most often denoted multiplicatively: x

Special classes of semigroups

mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying

Semigroup with three elements

In abstract algebra, a semigroup with three elements is an object consisting of three elements and an associative operation defined on them. The basic

Cancellative semigroup

In mathematics, a cancellative semigroup (also called a cancellation semigroup) is a semigroup having the cancellation property. In intuitive terms, the

Semigroup with two elements

two elements: O2, the null semigroup of order two. LO2, the left zero semigroup of order two. RO2, the right zero semigroup of order two. ({0,1}, ∧) (where

Band (algebra)

In mathematics, a band (also called idempotent semigroup) is a semigroup in which every element is idempotent (in other words equal to its own square)

Monoid

element e to the left zero semigroup over a set S. The opposite monoid (sometimes called find-last) is formed from the right zero semigroup over S. Adjoin an

Free monoid

and semigroups. It follows that every monoid (or semigroup) arises as a homomorphic image of a free monoid (or semigroup). The study of semigroups as images