Regular semigroup: Difference between revisions

From Groupprops
No edit summary
Line 1: Line 1:
{{variation of|group}}
{{variation of|group}}
{{semigroup property}}
{{semigroup property}}
 
{{quick phrase|[[quick phrase::semigroup with all elements regular, regular being a weak version of invertible}}
==Definition==
==Definition==



Revision as of 22:16, 24 June 2012

This is a variation of group|Find other variations of group | Read a survey article on varying group

This article defines a semigroup property: a property that can be evaluated to true/false for any given semigroup
View a complete list of semigroup properties

{{quick phrase|[[quick phrase::semigroup with all elements regular, regular being a weak version of invertible}}

Definition

Symbol-free definition

A regular semigroup is a semigroup (i.e., a set with associative binary operation) in which every element is regular.

Definition with symbols

A semigroup (S,*) is termed a regular semigroup if every aS is regular, i.e.:

  • For every aS, there exists a bS such that aba=a
  • Equivalently, for every aS, there exists a cS such that aca=a and cac=c.

Relation with other properties

Stronger properties

External links