An inverse semigroup S
is a semigroup
in which every element x
has a unique inversey
in the sense that x = xyx
and y = yxy
. Inverse semigroups appear in a range of contexts; forexample, they can be employed in the study partial symmetries.
(The convention followed in this article will be that of writing a function on the right of its argument, andcomposing functions from left to right - a convention often observed in semigroup theory.)
Inverse semigroups were introduced independently by Viktor Vladimirovich Wagner in the Soviet Union in1952
[First a short announcement in Wagner 1952, then a much more comprehensive exposition in Wagner1953.]
, and by Gordon Preston in Great Britain in 1954
. Both authorsarrived at inverse semigroups via the study of partial one-one transformations of a set: a partialfunction|partial transformation α of a set X
is a function
, where A
are subsets of X
. Let α and β be partial transformations of a setX
; α and β can be composed (from left to right) on the largest domain uponwhich it "makes sense" to compose them:
- dom αβ = α dom βα-1
denotes the preimage under α. Partial transformations had already been studiedin the context of pseudogroups
[See, for example, Golab 1939.]
It was Wagner, however, whowas the first to observe that the composition of partial transformations is a special case of the multiplication ofbinary relations.
[Schein 2002 : 152.]
He recognised also that the domain of composition of two partialtransformations may be the empty set, so he introduced an empty transformation
to take account of this.With the addition of this empty transformation, the composition of partial transformations of a set becomes aneverywhere-defined associative binary operation
. Under this composition, the collection
of all partial one-one transformations of a set X
forms an inverse semigroup, calledthe symmetric inverse semigroup
(or monoid) on X
[Howie 1995 : 149.]
This is the "archetypal"inverse semigroup, in the same way that a symmetric group is the archetypal group
. Forexample, just as every group
can be embedded in a symmetric group, every inversesemigroup can be embedded in a symmetric inverse semigroup (see below).
The inverse of an element x
of an inverse semigroup S
is usually written x-1
. Inverses in aninverse semigroup have many of the same properties as inverses in a group
, for example,(ab
. In an inverse monoid
are not (necessarily) equal to the identity, but they are both idempotent.
[Howie1995 : Proposition 5.1.2(1).]
An inverse monoid S
in which xx-1
= 1 =x-1x
, for all x
inverse monoid), is, of course, a group
There are a number of equivalent characterisations of an inverse semigroup S
[Howie 1995 : Theorem5.1.1.]
- Every element of S has a unique inverse, in the above sense.
- Every element of S has at least one inverse (S is a regular semigroup) and idempotents commute (that is, the idempotents of S form a semilattice).
- Every -class and every -class contains precisely one idempotent, where and are two of Green's relations.
The idempotent in the
-class of s
, whilst theidempotent in the
-class of s
. There is therefore a simplecharacterisation of Green's relations in an inverse semigroup:
[Howie 1995 : Proposition 5.1.2(1).]
Examples of inverse semigroups:
- Every group is an inverse semigroup.
- The bicyclic semigroup is inverse, with (a,b)-1 = (b,a).
- Every semilattice is inverse.
- The Brandt semigroup is inverse.
- The Munn semigroup is inverse.
Unless stated otherwise, E(S)
will denote the semilattice of idempotents of an inverse semigroup S
The natural partial order
An inverse semigroup S
possesses a natural partial order
relation ≤ (sometimes denoted by ω)which is defined by the following:
for some idempotent e
for some (in general, different) idempotent f
. In fact, e
can be taken to beaa-1
to be a-1a
[Howie 1995 : Proposition 5.2.1.]
The natural partial order is compatible with both multiplication and inversion, that is,
[Howie 1995 :152-3]
In a group
, this partial order simply reduces to equality, since the identity is theonly idempotent. In a symmetric inverse semigroup, the partial order reduces to restriction of mappings,i.e., α ≤ β if, and only if, the domain of α is contained in the domain of β andx
α = x
β, for all x
in the domain of α.
[Howie 1995 : 153.]
The natural partial order on an inverse semigroup interacts with Green's relations as follows: if s
, then s
. Similarly, ifst
[Lawson 1998 : Proposition 3.2.3.]
, the natural partial order becomes:
so the product of any two idempotents in S
is equal to the lesser of the two, with respect to≤. If E(S)
forms a chain (i.e., E(S)
is totally ordered by ≤), thenS
is a union
[Clifford & Preston 1967 : Theorem7.5]
Homomorphisms and representations of inverse semigroups
A homomorphism (or morphism
) of inverse semigroups is defined in exactly the same way as for any othersemigroup: for inverse semigroups S
, a function
θ from S
is a morphism if (s
θ) = (st
)θ, for all s
. The definition of amorphism of inverse semigroups could be augmented by including the condition (s
θ, however, there is no need to do so, since this property follows from the abovedefinition, via the following theorem:Theorem.
The homomorphic image of an inverse semigroup is an inverse semigroup; theinverse of an element is always mapped to the inverse of the image of thatelement.
[Clifford & Preston 1967 : Theorem 7.36.]
One of the earliest results proved about inverse semigroups was the Wagner-Preston Theorem
, which is an analogueof Cayley's Theorem for groups
is an inverse semigroup, then the function
, given by
- dom φ = Sa-1 and x(aφ) = xa
is a faithful representation
[Howie 1995 : Theorem 5.1.7. Originally, Wagner 1952 and,independently, Preston 1954c.]
Thus, any inverse semigroup can be embedded in a symmetric inverse semigroup.
Congruences on inverse semigroups
Congruences are defined on inverse semigroups in exactly the same way as for any other semigroup: acongruence
ρ is an equivalence relation which is compatible with semigroup multiplication, i.e.,
[Howie 1995 22]
Of particular interest is the relation
, defined on an inverse semigroup S
- there exists a with
[Lawson 1998 : 62]
It can be shown that σ is a congruence and that the factor semigroup S
/σ is, in fact, a group.Indeed, σ is the smallest
congruence on S
such that S
/σ is a group, that is, if τ is anyother congruence on S
/τ a group, then σ is contained in τ. The congruence σ iscalled the minimum group congruence
[Lawson 1998 : Theorem 2.4.1.]
The minimum groupcongruence can be used to give a characterisation of E
-unitary inverse semigroups (see below).
A congruence ρ on an inverse semigroup S
is called idempotent pure
[Lawson 1998 65]
E-unitary inverse semigroups
One class of inverse semigroups which has been studied extensively over the years is the class of E-unitaryinverse semigroups
: an inverse semigroup S
(with semilattice E
of idempotents) isE-unitary
if, for all e
and all s
[Howie 1995 192.]
One further characterisation of an E
-unitary inverse semigroup S
is the following: if e
is in E
, for some s
, then s
is in E
[Lawson 1998 : Proposition 2.4.3.]Theorem.
be an inverse semigroup with semilattice E
of idempotents, and minimum groupcongruence σ. Then the following are equivalent:
[Lawson 1998 : Theorem 2.4.6.]
- S is E-unitary;
- σ is idempotent pure;
- = σ,
is the compatibility relation
, defined by
- are idempotent.
Central to the study of E
-unitary inverse semigroups is the following construction.
[Howie 1995 : 193-4]
be a partially ordered set, with ordering ≤, and let
be a subset of
with the properties that
- is a lower semilattice, that is, every pair of elements A, B in has a greatest lower bound A B in (with respect to ≤);
- is an order ideal of , that is, for A, B in , if A is in and B ≤ A, then B is in .
Now let G
be a group
which acts on
(on the left), such that
- for all g in G and all A, B in , gA = gB if, and only if, A = B;
- for each g in G and each B in , there exists an A in such that gA = B;
- for all A, B in , A ≤ B if, and only if, gA ≤ gB;
- for all g, h in G and all A in , g(hA) = (gh)A.
is also assumed to have the following properties:
- for every X in , there exists a g in G and an A in such that gA = X;
- for all g in G, g and have nonempty intersection.
Such a triple
is called a McAlister triple
. A McAlister triple isused to define the following:
together with multiplication
is an inverse semigroup under this multiplication, with(A
). One of the main results in the study ofE
-unitary inverse semigroups is McAlister's P-Theorem
be a McAlister triple. Then
is an E
-unitary inverse semigroup. Conversely, every E
-unitary inversesemigroup is isomorphic to one of this type.
[Howie 1995 : Theorem 5.9.2. Originally, McAlister1974a,b.]
Connections with category theory
The above composition of partial transformations of a set gives rise to a symmetric inverse semigroup. There is ananother way of composing partial transformations, which is more restrictive than that used above: two partialtransformations α and β are composed if, and only if, the image of α is equal to the domain ofβ; otherwise, the composition αβ is undefined. Under this alternative composition, the collectionof all partial one-one transformations of a set forms not an inverse semigroup but an inductive groupoid, in thesense of category theory
. This close connection between inverse semigroups and inductive groupoids isembodied in the Ehresmann-Schein-Nambooripad Theorem
, which states that an inductive groupoid can always beconstructed from an inverse semigroup, and conversely.
[Lawson 1998 : 4.1.8.]
Generalisations of inverse semigroups
As noted above, an inverse semigroup S
can be defined by the conditions (1) S
is a regular semigroup,and (2) the idempotents in S
commute; this has led to two distinct classes of generalisations ofan inverse semigroup: semigroups in which (1) holds, but (2) does not, and vice versa.
Examples of regular generalisations of an inverse semigroup are:
[Howie 1995 : Section 2.4 & Chapter 6.]
- Regular semigroups: a semigroup S is regular if every element has at least one inverse; equivalently, for each a in S, there is an x in S such that axa = a.
- Locally inverse semigroups: a regular semigroup S is locally inverse if eSe is an inverse semigroup, for each idempotent e.
- Orthodox semigroups: a regular semigroup S is orthodox if its subset of idempotents forms a subsemigroup.
- Generalised inverse semigroups: a regular semigroup S is called a generalised inverse semigroup if its idempotents form a normal band, i.e., xyzx = xzyx, for all idempotents x, y, z.
The class of generalised inverse semigroups is the intersection
of the class oflocally inverse semigroups and the class of orthodox semigroups.
[Howie 1995 : 222.]
Amongst the non-regular generalisations of an inverse semigroup are:
- (Left, right, two-sided) adequate semigroups.
- (Left, right, two-sided) ample semigroups.
- (Left, right, two-sided) semiadequate semigroups.
- Weakly (left, right, two-sided) ample semigroups.
For a brief introduction to inverse semigroups, see either Clifford & Preston 1967 : Chapter 7 or Howie 1995 :Chapter 5. More comprehensive introductions can be found in Petrich 1984 and Lawson 1998.
- A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, Volume 2, Mathematical Surveys of the American Mathematical Society, No. 7, Providence, R.I., 1967.
- V. Gould, "(Weakly) left E-ample semigroups"
- J. M. Howie, Fundamentals of Semigroup Theory, Clarendon Press, Oxford, 1995.
- M. V. Lawson, Inverse Semigroups: The Theory of Partial Symmetries, World Scientific, 1998.
- M. Petrich, Inverse semigroups, Wiley, New York, 1984.