a characterization of groups


\PMlinkescapephrase

idempotent element

Theorem.

A non-empty semigroupPlanetmathPlanetmath S is a group if and only if for every x∈S there is a unique y∈S such that x⁢y⁢x=x.

Proof.

Suppose that S is a non-empty semigroup, and for every x∈S there is a unique y∈S such that x⁢y⁢x=x. For each x∈S, let x′ denote the unique element of S such that x⁢x′⁢x=x. Note that x⁢(x′⁢x⁢x′)⁢x=(x⁢x′⁢x)⁢x′⁢x=x⁢x′⁢x=x, so, by uniqueness, x′⁢x⁢x′=x′, and therefore x′′=x.

For any x∈S, the element x⁢x′ is idempotentMathworldPlanetmath (http://planetmath.org/Idempotency), because (x⁢x′)2=(x⁢x′⁢x)⁢x′=x⁢x′. As S is nonempty, this means that S has at least one idempotent element. If i∈S is idempotent, then i⁢x=i⁢x⁢(i⁢x)′⁢i⁢x=i⁢x⁢(i⁢x)′⁢i⁢i⁢x, and so (i⁢x)′⁢i=(i⁢x)′, and therefore (i⁢x)′=(i⁢x)′⁢(i⁢x)′′⁢(i⁢x)′=(i⁢x)′⁢i⁢x⁢(i⁢x)′=(i⁢x)′⁢x⁢(i⁢x)′, which means that i⁢x=(i⁢x)′′=x. So every idempotent is a left identityPlanetmathPlanetmath, and, by a symmetricPlanetmathPlanetmath argument, a right identity. Therefore, S has at most one idempotent element. Combined with the previous result, this means that S has exactly one idempotent element, which we will denote by e. We have shown that e is an identityPlanetmathPlanetmathPlanetmath, and that x⁢x′=e for each x∈S, so S is a group.

Conversely, if S is a group then x⁢y⁢x=x clearly has a unique solution, namely y=x-1. ∎

Note. Note that inverse semigroups do not in general satisfy the hypothesisMathworldPlanetmath of this theorem: in an inverse semigroup there is for each x a unique y such that x⁢y⁢x=x and y⁢x⁢y=y, but this y need not be unique as a solution of x⁢y⁢x=x alone.

Title a characterization of groups
Canonical name ACharacterizationOfGroups
Date of creation 2013-03-22 14:45:08
Last modified on 2013-03-22 14:45:08
Owner yark (2760)
Last modified by yark (2760)
Numerical id 10
Author yark (2760)
Entry type Theorem
Classification msc 20A05
Related topic Group
Related topic RegularSemigroup
Related topic AlternativeDefinitionOfGroup