# Difference between revisions of "Regular element"

(Importing text file) |
(TeX) |
||

Line 1: | Line 1: | ||

+ | {{TEX|done}} | ||

''of a semi-group'' | ''of a semi-group'' | ||

− | An element | + | An element $a$ such that $a=axa$ for some element $x$ of the given semi-group; if in addition (for the same $x$) $ax=xa$, then $a$ is called completely regular. If $a$ is a regular element of a semi-group $S$, then the principal right (left) ideal in $S$ generated by $a$ is generated by some idempotent; conversely, each of these symmetrical properties implies the regularity of $a$. If $aba=a$ and $bab=b$, the elements $a$ and $b$ are called mutually inverse (also known as generalized inverse or regularly conjugate). Every regular element has an element inverse to it; generally speaking, it is not unique (see [[Inversion semi-group|Inversion semi-group]]). Semi-groups in which any two elements are mutually inverse are in fact rectangular semi-groups (see [[Idempotents, semi-group of|Idempotents, semi-group of]]). Each completely-regular element $a$ has an element inverse to it that commutes with $a$. An element is completely regular if and only if it belongs to some subgroup of a semi-group (cf. [[Clifford semi-group|Clifford semi-group]]). For regular $\mathcal D$-classes, see [[Green equivalence relations|Green equivalence relations]]. |

====References==== | ====References==== |

## Latest revision as of 08:24, 12 April 2014

*of a semi-group*

An element $a$ such that $a=axa$ for some element $x$ of the given semi-group; if in addition (for the same $x$) $ax=xa$, then $a$ is called completely regular. If $a$ is a regular element of a semi-group $S$, then the principal right (left) ideal in $S$ generated by $a$ is generated by some idempotent; conversely, each of these symmetrical properties implies the regularity of $a$. If $aba=a$ and $bab=b$, the elements $a$ and $b$ are called mutually inverse (also known as generalized inverse or regularly conjugate). Every regular element has an element inverse to it; generally speaking, it is not unique (see Inversion semi-group). Semi-groups in which any two elements are mutually inverse are in fact rectangular semi-groups (see Idempotents, semi-group of). Each completely-regular element $a$ has an element inverse to it that commutes with $a$. An element is completely regular if and only if it belongs to some subgroup of a semi-group (cf. Clifford semi-group). For regular $\mathcal D$-classes, see Green equivalence relations.

#### References

[1] | A.H. Clifford, G.B. Preston, "Algebraic theory of semi-groups" , 1–2 , Amer. Math. Soc. (1961–1967) |

[2] | E.S. Lyapin, "Semigroups" , Amer. Math. Soc. (1974) (Translated from Russian) |

#### Comments

A semi-group consisting completely of regular elements is a regular semi-group.

**How to Cite This Entry:**

Regular element.

*Encyclopedia of Mathematics.*URL: http://encyclopediaofmath.org/index.php?title=Regular_element&oldid=13546