Semigroup

From Wikipedia, the free encyclopedia

In mathematics, a semigroup is an algebraic structure consisting of a set S closed under an associative binary operation. In other words, a semigroup is an associative magma. The terminology is derived from the anterior notion of a group.

The operation of a semigroup is most often denoted multiplicatively, that is, $x\cdot y$ or simply xy denotes the result of applying the semigroup operation to the ordered pair (x, y).

The formal study of semigroups began in the early 20th century. Since the 1950s, the theory of finite semigroups has been of particular importance in theoretical computer science because of the natural link between finite semigroups and finite automata.

1 Formal definition
2 Examples of semigroups
3 Structure of semigroups
4 History
5 References
6 Notes

[edit] Formal definition

A semigroup formally consists of a pair $(S,\cdot_S)$ where S is a set and a binary function $\cdot_S: S \times S \rightarrow S$ called the operation of the semigroup. For convenience, the application of the function $\cdot_S$ to the pair $(x, y)$ is simply denoted as $x \cdot_S y$ or $x \cdot y$ . The operation is required to be associative, i.e. to satisfy $(x \cdot y) \cdot z = x \cdot (y \cdot z)$ for any $x,y,z \in S$ . As is common practice in abstract algebra, one usually refers to the pair $(S,\cdot_S)$ as S when the operation used is clear from the context.

Some authors require semigroups to be non-empty. Others use the term semigroup synonymously with monoid, that is, they assume that a semigroup has an identity element. In the remainder of this article, the term semigroup will be used in the widest sense, that is, a semigroup may be empty, and even if non-empty it need not include an identity element.

As noted above, a monoid is a semigroup with an identity element. Any semigroup S may be embedded into a monoid (generally denoted as $S 1$ ) simply by adjoining an element e not in S and defining es = s = se for all s ∈ S ∪ {e}.

[edit] Examples of semigroups

Any monoid, and therefore any group.
The positive integers with addition.
Any subset of a semigroup closed under the semigroup operation. Such a subset is known as a subsemigroup.
A semigroup whose operation is idempotent is a band.
A semigroup whose operation is idempotent and commutative is a semilattice.
Any ideal of a ring, given multiplication. Thus any ring including the integers, rational, real, complex or quaternionic numbers, functions with values in a ring (including sequences), polynomials and matrices.
- Matrix units form a 0-simple semigroup.
- Square nonnegative matrices with matrix multiplication.
The set of all finite strings over some fixed alphabet Σ, with string concatenation as operation. If the empty string is included, then this is actually a monoid, called the "free monoid over Σ"; if it is excluded, then we have a semigroup, called the "free semigroup over Σ".
A transformation semigroup : any finite semigroup S can be represented by transformations of a (state-) set Q of at most |S|+1 states. Each element x of S then maps Q into itself x: Q → Q and sequence xy is defined by q(xy) = (qx)y for each q in Q. Sequencing clearly is an associative operation, here equivalent to function composition. This representation is basic for any automaton or finite state machine (FSM).
The bicyclic semigroup.
C₀-semigroups.
Regular semigroups.
Inverse semigroups.

[edit] Structure of semigroups

This section sets out concepts useful for understanding the structure of semigroups. Two semigroups S and T are said to be isomorphic if there is a bijection f : S ↔ T with the property that, for any elements a, b in S, f(ab) = f(a)f(b). In this case, T and S are also isomorphic, and for the purposes of semigroup theory, the two semigroups are identical.

If A and B are subsets of some semigroup, then AB denotes the set { ab | a in A and b in B }. A subset A of a semigroup S is called a subsemigroup if it is closed under the semigroup operation, that is, AA is a subset of A. If A is nonempty then A is called a right ideal if AS is a subset of A, and a left ideal if SA is a subset of A. If A is both a left ideal and a right ideal then it is called an ideal (or a two-sided ideal). The intersection of two ideals is also an ideal, so a semigroup can have at most one minimal ideal. An example of semigroup with no minimal ideal is the set of positive integers under addition. The minimal ideal of a commutative semigroup, when it exists, is a group.

Green's relations are important tools for analysing the ideals of a semigroup, and related notions of structure.

If S is a semigroup, then the intersection of any collection of subsemigroups of S is also a subsemigroup of S. So the subsemigroups of S form a complete lattice. For any subset A of S there is a smallest subsemigroup T of S which contains A, and we say that A generates T. A single element x of S generates the subsemigroup { xⁿ | n is a positive integer }. If this is finite, then x is said to be of finite order, otherwise it is of infinite order. A semigroup is said to be periodic if all of its elements are of finite order. A semigroup generated by a single element is said to be monogenic (or cyclic). If a monogenic semigroup is infinite then it is isomorphic to the semigroup of positive integers with the operation of addition. If it is finite and nonempty, then it must contain at least one idempotent. It follows that every nonempty periodic semigroup has at least one idempotent.

A subsemigroup which is also a group is called a subgroup. There is a close relationship between the subgroups of a semigroup and its idempotents. Each subgroup contains exactly one idempotent, namely the identity element of the subgroup. For each idempotent e of the semigroup there is a unique maximal subgroup containing e. Each maximal subgroup arises in this way, so there is a one-to-one correspondence between idempotents and maximal subgroups. Here the term maximal subgroup differs from its standard use in group theory.

More can often be said when the order is finite. For example, every nonempty finite semigroup is periodic, and has a minimal ideal and at least one idempotent. For more on the structure of finite semigroups, see Krohn-Rhodes theory.

[edit] History

The formal study of semigroups came somewhat later than that of other algebraic structures such as groups or rings in the mid 19th century. A number of sources^[1]^[2] attributes the first-use of the term (in French) to J.-A. de Séguier in Élements de la Théorie des Groupes Abstraits (Elements of the Theory of Abstract Groups) in 1904. The term is used in English in 1908 in Harold Hinton's Theory of Groups of Finite Order. In 1970, a new periodical called Semigroup Forum (currently edited by Springer Verlag) became one of the rare mathematical journals devoted entirely to semigroup theory.

Anton Suschkewitsch is often credited with obtaining the first non-trivial results about semigroups. His 1928 paper Über die endlichen Gruppen ohne das Gesetz der eindeutigen Uhmkehrbarkeit (On finite groups without the rule of uniform reversibility) determined the structure of finite simple semigroups and showed that the minimal ideal (or Green's relations J-class) of a finite semigroup is simple^[2]. From that point on the foundations of semigroup theory were further laid by David Rees, James Alexander Green, Evgenii Sergeevich Lyapin, Alfred H. Clifford and Gordon Preston. The latter two published a monograph on semigroup theory in 1961.

The theory of finite semigroups is arguably more developed than its infinite counterpart. This stems particularly from the notion of syntactic semigroup and the ensuing links between pseudo-varieties of semigroups and so-called varieties of formal languages which have proved particularly fruitful in finite automata theory^[3].

[edit] References

John M. Howie is the author of two books, published twenty years apart, which are often cited as a basic reference in the mathematical community.
- Howie, John M. (1995). Fundamentals of Semigroup Theory. Clarendon Press. ISBN 0198511949.
- Howie, John M. (1976). Introduction to Semigroup Theory. Academic Press. ISBN 0127546332.
Two volumes of Samuel Eilenberg have also been a common reference for the applications of semigroup theory in theoretical computer science.
- Eilenberg, Samuel (1973). Automata, Languages, and Machines (Vol.A). Academic Press. ISBN 0122340019.
- Eilenberg, Samuel (1976). Automata, Languages, and Machines (Vol.B). Academic Press. ISBN 0122340027.
The algebraic theory of semigroups, A. H. Clifford and G. B. Preston. American Mathematical Society, 1961 (volume 1), 1967 (volume 2).
Semigroups: an introduction to the structure theory, Pierre Antoine Grillet. Marcel Dekker, Inc., 1995.
Semigroup Forum is the best-known periodical devoted specifically to the subject of semigroups.

[edit] Notes

^ http://members.aol.com/jeff570/s.html Earliest Known Uses of Some of the Words of Mathematics
^ ^a ^b http://www-users.york.ac.uk/~cdh500/suschkewitsch3.pdf An account of Suschkewitsch's paper by Christopher Hollings
^ Varieties of Formal Languages, J.É. Pin, Plenum Press, 1986.