» 
Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese
Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese

definition - Semigroup

definition of Wikipedia

   Advertizing ▼

phrases

Wikipedia

Semigroup

                   

In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.

The binary operation of a semigroup is most often denoted multiplicatively: x \cdot y, or simply xy, denotes the result of applying the semigroup operation to the ordered pair (x,y). The operation is required to be associative so that (x \cdot y) \cdot z = x \cdot (y \cdot z) for all x, y and z, but need not be commutative so that x \cdot y does not have to equal y \cdot x (contrast to the standard multiplication operator on real numbers, where xy = yx).

By definition, a semigroup is an associative magma. A semigroup with an identity element is called a monoid. A group is then a monoid in which every element has an inverse element. Semigroups must not be confused with quasigroups which are sets with a not necessarily associative binary operation such that division is always possible.

The formal study of semigroups began in the early 20th century. Semigroups are important in many areas of mathematics because they are the abstract algebraic underpinning of "memoryless" systems: time-dependent systems that start from scratch at each iteration. In applied mathematics, semigroups are fundamental models for linear time-invariant systems. In partial differential equations, a semigroup is associated to any equation whose spatial evolution is independent of time. The theory of finite semigroups has been of particular importance in theoretical computer science since the 1950s because of the natural link between finite semigroups and finite automata. In probability theory, semigroups are associated with Markov processes (Feller 1971).

Contents

  Definition

A semigroup is a set S together with a binary operation "\cdot" (that is, a function \cdot:S\times S\rightarrow S) that satisfies the associative property:

For all a,b,c\in S, the equation (a\cdot b)\cdot c = a\cdot(b\cdot c) holds.

More succinctly, a semigroup is an associative magma.

  Examples of semigroups

  Basic concepts

  Identity and zero

Every semigroup, in fact every magma, has at most one identity element. A semigroup with identity is called a monoid. A semigroup without identity may be embedded into a monoid simply by adjoining an element e \notin S to S\ and defining e \cdot s = s \cdot e = s for all s \in S \cup \{e\}.[1][2] The notation S1 denotes a monoid obtained from S by adjoining an identity if necessary (S1 = S for a monoid).[2] Thus, every commutative semigroup can be embedded in a group via the Grothendieck group construction.

Similarly, every magma has at most one absorbing element, which in semigroup theory is called a zero. Analogous to the above construction, for every semigroup S, one defines S0, a semigroup with 0 that embeds S.

  Subsemigroups and ideals

The semigroup operation induces an operation on the collection of its subsets: given subsets A and B of a semigroup, A*B, written commonly as AB, is the set { ab | a in A and b in B }. In terms of this operations, a subset A is called

  • a subsemigroup if AA is a subset of A,
  • 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).

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.

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, a set of five equivalence relations that characterise the elements in terms of the principal ideals they generate, are important tools for analysing the ideals of a semigroup and related notions of structure.

  Homomorphisms and congruences

A semigroup homomorphism is a function that preserves semigroup structure. A function f: ST between two semigroups is a homomorphism if the equation

f(ab) = f(a)f(b).

holds for all elements a, b in S, i.e. the result is the same when performing the semigroup operation after or before applying the map f.

A semigroup homomorphism between monoids preserves identity if it is a monoid homomorphism. But there are semigroup homomorphisms which are not monoid homomorphisms, e.g. the canonical embedding of a semigroup S without identity into S^1. Conditions characterizing monoid homomorphisms are discussed further. Let f:S_0\to S_1 be a semigroup homomorphism. The image of f is also a semigroup. If S_0 is a monoid with an identity element e_0, then f(e_0) is the identity element in the image of f. If S_1 is also a monoid with an identity element e_1 and e_1 belongs to the image of f, then f(e_0)=e_1, i.e. f is a monoid homomorphism. Particularly, if f is surjective, then it is a monoid homomorphism.

Two semigroups S and T are said to be isomorphic if there is a bijection f : ST with the property that, for any elements a, b in S, f(ab) = f(a)f(b). Isomorphic semigroups have the same structure.

A semigroup congruence \sim is an equivalence relation that is compatible with the semigroup operation. That is, a subset \sim\;\subseteq S\times S that is an equivalence relation and x\sim y\, and u\sim v\, implies xu\sim yv\, for every x,y,u,v in S. Like any equivalence relation, a semigroup congruence \sim induces congruence classes

[a]_\sim = \{x\in S\vert\; x\sim a\}

and the semigroup operation induces a binary operation \circ on the congruence classes:

[u]_\sim\circ [v]_\sim = [uv]_\sim

Because \sim is a congruence, the set of all congruence classes of \sim forms a semigroup with \circ, called the quotient semigroup or factor semigroup, and denoted S/\sim. The mapping x \mapsto [x]_\sim is a semigroup homomorphism, called the quotient map, canonical surjection or projection; if S is a monoid then quotient semigroup is a monoid with identity [1]_\sim. Conversely, the kernel of any semigroup homomorphism is a semigroup congruence. These results are nothing more than a particularization of the first isomorphism theorem in universal algebra. Congruence classes and factor monoids are the objects of study in string rewriting systems.

Every ideal I of a semigroup induces a subsemigroup, the Rees factor semigroup via the congruence x ρ y   ⇔   either x = y or both x and y are in I.

  Structure of semigroups

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 { xn | 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.

  Special classes of semigroups

  • A monoid is a semigroup with identity.
  • A subsemigroup is a subset of a semigroup that is closed under the semigroup operation.
  • A band is a semigroup the operation of which is idempotent.
  • A cancellative semigroup is one having the cancellation property:[3] a · b = a · c implies b = c and similarly for b · a = c · a.
  • A semilattice is a semigroup whose operation is idempotent and commutative.
  • 0-simple semigroups.
  • Transformation semigroups: 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: QQ 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 is in fact a monoid, which can be described as the free semigroup on two generators p and q, under the relation p q = 1.
  • C0-semigroups.
  • Regular semigroups. Every element x has at least one inverse y satisfying xyx=x and yxy=y; the elements x and y are sometimes called "mutually inverse".
  • Inverse semigroups are regular semigroups where every element has exactly one inverse. Alternatively, a regular semigroup is inverse if and only if any two idempotents commute.
  • Affine semigroup: a semigroup that is isomorphic to a finitely-generated subsemigroup of Zd. These semigroups have applications to commutative algebra.

  Group of fractions

The group of fractions of a semigroup S is the group G = G(S) generated by the elements of S as generators and all equations xy=z which hold true in S as relations.[4] This has a universal property for morphisms from S to a group.[5] There is an obvious map from S to G(S) by sending each element of S to the corresponding generator.

An important question is to characterize those semigroups for which this map is an embedding. This need not always be the case: for example, take S to be the semigroup of subsets of some set X with set-theoretic intersection as the binary operation (this is an example of a semilattice). Since A.A = A holds for all elements of S, this must be true for all generators of G(S) as well: which is therefore the trivial group. It is clearly necessary for embeddability that S have the cancellation property. When S is commutative this condition is also sufficient[6] and the Grothendieck group of the semigroup provides a construction of the group of fractions. The problem for non-commutative semigroups can be traced to the first substantial paper on semigroups, (Suschkewitsch 1928).[7] Anatoly Maltsev gave necessary and conditions for embeddability in 1937.[8]

  Semigroup methods in partial differential equations

Semigroup theory can be used to study some problems in the field of partial differential equations. Roughly speaking, the semigroup approach is to regard a time-dependent partial differential equation as an ordinary differential equation on a function space. For example, consider the following initial/boundary value problem for the heat equation on the spatial interval (0, 1) ⊂ R and times t ≥ 0:

\begin{cases} \partial_{t} u(t, x) = \partial_{x}^{2} u(t, x), & x \in (0, 1), t > 0; \\ u(t, x) = 0, & x \in \{ 0, 1 \}, t > 0; \\ u(t, x) = u_{0} (x), & x \in (0, 1), t = 0. \end{cases}

Let X be the Lp space L2((0, 1); R) and let A be the second-derivative operator with domain

D(A) = \big\{ u \in H^{2} ((0, 1); \mathbf{R}) \big| u(0) = u(1) = 0 \big\}.

Then the above initial/boundary value problem can be interpreted as an initial value problem for an ordinary differential equation on the space X:

\begin{cases} \dot{u}(t) = A u (t); \\ u(0) = u_{0}. \end{cases}

On an heuristic level, the solution to this problem "ought" to be u(t) = exp(tA)u0. However, for a rigorous treatment, a meaning must be given to the exponential of tA. As a function of t, exp(tA) is a semigroup of operators from X to itself, taking the initial state u0 at time t = 0 to the state u(t) = exp(tA)u0 at time t. The operator A is said to be the infinitesimal generator of the semigroup.

  History

The study of semigroups trailed behind that of other algebraic structures with more complex axioms such as groups or rings. A number of sources[9][10] attribute 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.

Anton Suschkewitsch obtained the first non-trivial results about semigroups. His 1928 paper Über die endlichen Gruppen ohne das Gesetz der eindeutigen Umkehrbarkeit (On finite groups without the rule of unique invertibility) 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.[10] 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 two-volume monograph on semigroup theory in 1961 and 1967 respectively. In 1970, a new periodical called Semigroup Forum (currently edited by Springer Verlag) became one of the few mathematical journals devoted entirely to semigroup theory.

In recent years researchers in the field have became more specialized with dedicated monographs appearing on important classes of semigroups, like inverse semigroups, as well as monographs focusing on applications in algebraic automata theory, particularly for finite automata, and also in functional analysis.

  Generalizations

Group-like structures
Totality Associativity Identity Inverses Commutativity
Magma Required not required not required not required not required
Quasigroup Required not required not required Required not required
Unital Required not required Required not required not required
Loop Required not required Required Required not required
Semigroup Required Required not required not required not required
Monoid Required Required Required not required not required
Group Required Required Required Required not required
Abelian Group Required Required Required Required Required
Groupoid not required Required Required Required not required
Category not required Required Required not required not required
Semicategory not required Required not required not required not required
Note: A quasigroup with associativity (equivalently, a semigroup with inverses)
already has an identity element, and is therefore a group.

If the associativity axiom of a semigroup is dropped, the result is a magma, which is nothing more than a set M equipped with a binary operation M × M → M.

Generalizing in a different direction, an n-ary semigroup (also n-semigroup, polyadic semigroup or multiary semigroup) is a generalization of a semigroup to a set G with a n-ary operation instead of a binary operation.[11] The associative law is generalized as follows: ternary associativity is (abc)de = a(bcd)e = ab(cde), i.e. the string abcde with any three adjacent elements bracketed. N-ary associativity is a string of length n + (n1) with any n adjacent elements bracketed. A 2-ary semigroup is just a semigroup. Further axioms lead to an n-ary group.

A third generalization is the semigroupoid, in which the requirement that the binary relation be total is lifted. As categories generalize monoids in the same way, a semigroupoid behaves much like a category but lacks identities.

  See also

  Notes

  1. ^ Jacobson (2009), p. 30, ex. 5
  2. ^ a b Lawson (1998), p. 20
  3. ^ (Clifford & Preston 1967, p. 3)
  4. ^ B. Farb, Problems on mapping class groups and related topics (Amer. Math. Soc., 2006) page 357. ISBN 0-8218-3838-5
  5. ^ M. Auslander and D.A. Buchsbaum, Groups, rings, modules (Harper&Row, 1974) page 50. ISBN 0-06-040378-X
  6. ^ (Clifford & Preston 1961, p. 34)
  7. ^ G. B. Preston (1990). "Personal reminiscences of the early history of semigroups". http://www.gap-system.org/~history/Extras/Preston_semigroups.html. Retrieved 2009-05-12. 
  8. ^ Maltsev, A. (1937), "On the immersion of an algebraic ring into a field", Math. Annalen 113: 686–691, DOI:10.1007/BF01571659. 
  9. ^ Earliest Known Uses of Some of the Words of Mathematics
  10. ^ a b An account of Suschkewitsch's paper by Christopher Hollings
  11. ^ Dudek, W.A. (2001), "On some old problems in n-ary groups", Quasigroups and Related Systems 8: 15–36, http://www.quasigroups.eu/contents/contents8.php?m=trzeci 

  References

General references
Specific references
   
               

   Advertizing ▼

 

All translations of Semigroup


sensagent's content

  • definitions
  • synonyms
  • antonyms
  • encyclopedia

Dictionary and translator for handheld

⇨ New : sensagent is now available on your handheld

   Advertising ▼

sensagent's office

Shortkey or widget. Free.

Windows Shortkey: sensagent. Free.

Vista Widget : sensagent. Free.

Webmaster Solution

Alexandria

A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !

Try here  or   get the code

SensagentBox

With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.

Business solution

Improve your site content

Add new content to your site from Sensagent by XML.

Crawl products or adds

Get XML access to reach the best products.

Index images and define metadata

Get XML access to fix the meaning of your metadata.


Please, email us to describe your idea.

WordGame

The English word games are:
○   Anagrams
○   Wildcard, crossword
○   Lettris
○   Boggle.

Lettris

Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.

boggle

Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !

English dictionary
Main references

Most English definitions are provided by WordNet .
English thesaurus is mainly derived from The Integral Dictionary (TID).
English Encyclopedia is licensed by Wikipedia (GNU).

Copyrights

The wordgames anagrams, crossword, Lettris and Boggle are provided by Memodata.
The web service Alexandria is granted from Memodata for the Ebay search.
The SensagentBox are offered by sensAgent.

Translation

Change the target language to find translations.
Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.

last searches on the dictionary :

6288 online visitors

computed in 0.094s

   Advertising ▼

I would like to report:
section :
a spelling or a grammatical mistake
an offensive content(racist, pornographic, injurious, etc.)
a copyright violation
an error
a missing statement
other
please precise:

Advertize

Partnership

Company informations

My account

login

registration

   Advertising ▼