Regular semigroup: Difference between revisions

From Groupprops
(New page: {{variation of|group}} {{semigroup property}} ==Definition== ===Symbol-free definition=== A '''regular semigroup''' is a semigroup (i.e., a set with associative binary operation...)
 
No edit summary
Line 21: Line 21:
* [[Weaker than::Group]]
* [[Weaker than::Group]]
* [[Weaker than::Inverse semigroup]]
* [[Weaker than::Inverse semigroup]]
==External links==
* {{planetmath-defined|RegularSemigroup}}

Revision as of 21:28, 4 July 2008

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

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