Nowhere commutative semigroup

Last updated

In mathematics, a nowhere commutative semigroup is a semigroup S such that, for all a and b in S, if ab = ba then a = b. [1] A semigroup S is nowhere commutative if and only if any two elements of S are inverses of each other. [1]

Contents

Characterization of nowhere commutative semigroups

Nowhere commutative semigroups can be characterized in several different ways. If S is a semigroup then the following statements are equivalent: [2]

Even though, by definition, the rectangular bands are concrete semigroups, they have the defect that their definition is formulated not in terms of the basic binary operation in the semigroup. The approach via the definition of nowhere commutative semigroups rectifies this defect. [2]

To see that a nowhere commutative semigroup is a rectangular band, let S be a nowhere commutative semigroup. Using the defining properties of a nowhere commutative semigroup, one can see that for every a in S the intersection of the Green classes Ra and La contains the unique element a. Let S/L be the family of L-classes in S and S/R be the family of R-classes in S. The mapping

ψ : S → (S/R) × (S/L)

defined by

aψ = (Ra, La)

is a bijection. If the Cartesian product (S/R) × (S/L) is made into a semigroup by furnishing it with the rectangular band multiplication, the map ψ becomes an isomorphism. So S is isomorphic to a rectangular band.

Other claims of equivalences follow directly from the relevant definitions.

See also

Special classes of semigroups

Related Research Articles

Monoid Algebraic structure with an associative operation and an identity element

In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element.

Semigroup

In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation.

In abstract algebra, the idea of an inverse element generalises the concepts of negation and reciprocation. The intuition is of an element that can 'undo' the effect of combination with another given element. While the precise definition of an inverse element varies depending on the algebraic structure involved, these definitions coincide in a group.

In abstract algebra, a medial magma or medial groupoid is a magma or groupoid which satisfies the identity

In mathematics, Green's relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of 1951. John Mackintosh Howie, a prominent semigroup theorist, described this work as "so all-pervading that, on encountering a new semigroup, almost the first question one asks is 'What are the Green relations like?'". The relations are useful for understanding the nature of divisibility in a semigroup; they are also valid for groups, but in this case tell us nothing useful, because groups always have divisibility.

In mathematics, the bicyclic semigroup is an algebraic object important for the structure theory of semigroups. Although it is in fact a monoid, it is usually referred to as simply a semigroup. It is perhaps most easily understood as the syntactic monoid describing the Dyck language of balanced pairs of parentheses. Thus, it finds common applications in combinatorics, such as describing binary trees and associative algebras.

In group theory, an inverse semigroupS is a semigroup in which every element x in S has a unique inversey in S in the sense that x = xyx and y = yxy, i.e. a regular semigroup in which every element has a unique inverse. Inverse semigroups appear in a range of contexts; for example, they can be employed in the study of partial symmetries.

In mathematics, a band is a semigroup in which every element is idempotent. Bands were first studied and named by A. H. Clifford (1954); the lattice of varieties of bands was described independently in the early 1970s by Biryukov, Fennemore and Gerhard. Semilattices, left-zero bands, right-zero bands, rectangular bands, normal bands, left-regular bands, right-regular bands and regular bands, specific subclasses of bands that lie near the bottom of this lattice, are of particular interest and are briefly described below.

In mathematics, a regular semigroup is a semigroup S in which every element is regular, i.e., for each element a in S there exists an element x in S such that axa = a. Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations.

In abstract algebra, a skew lattice is an algebraic structure that is a non-commutative generalization of a lattice. While the term skew lattice can be used to refer to any non-commutative generalization of a lattice, since 1989 it has been used primarily as follows.

In operator theory, a bounded operator T: XY between normed vector spaces X and Y is said to be a contraction if its operator norm ||T|| ≤ 1. Every bounded operator becomes a contraction after suitable scaling. The analysis of contractions provides insight into the structure of operators, or a family of operators. The theory of contractions on Hilbert space is largely due to Béla Szőkefalvi-Nagy and Ciprian Foias.

In mathematics, an approximately finite-dimensional (AF) C*-algebra is a C*-algebra that is the inductive limit of a sequence of finite-dimensional C*-algebras. Approximate finite-dimensionality was first defined and described combinatorially by Ola Bratteli. Later, George A. Elliott gave a complete classification of AF algebras using the K0 functor whose range consists of ordered abelian groups with sufficiently nice order structure.

Monogenic semigroup

In mathematics, a monogenic semigroup is a semigroup generated by a single element. Monogenic semigroups are also called cyclic semigroups.

In mathematics, particularly in abstract algebra, a semigroup with involution or a *-semigroup is a semigroup equipped with an involutive anti-automorphism, which—roughly speaking—brings it closer to a group because this involution, considered as unary operator, exhibits certain fundamental properties of the operation of taking the inverse in a group: uniqueness, double application "cancelling itself out", and the same interaction law with the binary operation as in the case of the group inverse. It is thus not a surprise that any group is a semigroup with involution. However, there are significant natural examples of semigroups with involution that are not groups.

In mathematics, a trivial semigroup is a semigroup for which the cardinality of the underlying set is one. The number of distinct nonisomorphic semigroups with one element is one. If S = { a } is a semigroup with one element, then the Cayley table of S is

In mathematics, a cancellative semigroup is a semigroup having the cancellation property. In intuitive terms, the cancellation property asserts that from an equality of the form a · b = a · c, where · is a binary operation, one can cancel the element a and deduce the equality b = c. In this case the element being cancelled out is appearing as the left factors of a · b and a · c and hence it is a case of the left cancellation property. The right cancellation property can be defined analogously. Prototypical examples of cancellative semigroups are the positive integers under addition or multiplication. Cancellative semigroups are considered to be very close to being groups because cancellability is one of the necessary conditions for a semigroup to be embeddable in a group. Moreover, every finite cancellative semigroup is a group. One of the main problems associated with the study of cancellative semigroups is to determine the necessary and sufficient conditions for embedding a cancellative semigroup in a group.

In mathematics, in semigroup theory, a Rees factor semigroup, named after David Rees, is a certain semigroup constructed using a semigroup and an ideal of the semigroup.

In mathematics, a semigroup with no elements is a semigroup in which the underlying set is the empty set. Many authors do not admit the existence of such a semigroup. For them a semigroup is by definition a non-empty set together with an associative binary operation. However not all authors insist on the underlying set of a semigroup being non-empty. One can logically define a semigroup in which the underlying set S is empty. The binary operation in the semigroup is the empty function from S × S to S. This operation vacuously satisfies the closure and associativity axioms of a semigroup. Not excluding the empty semigroup simplifies certain results on semigroups. For example, the result that the intersection of two subsemigroups of a semigroup T is a subsemigroup of T becomes valid even when the intersection is empty.

In abstract algebra, the idealizer of a subsemigroup T of a semigroup S is the largest subsemigroup of S in which T is an ideal. Such an idealizer is given by

In mathematics, an orthodox semigroup is a regular semigroup whose set of idempotents forms a subsemigroup. In more recent terminology, an orthodox semigroup is a regular E-semigroup. The term orthodox semigroup was coined by T. E. Hall and presented in a paper published in 1969. Certain special classes of orthodox semigroups had been studied earlier. For example, semigroups that are also unions of groups, in which the sets of idempotents form subsemigroups were studied by P. H. H. Fantham in 1960.

References

  1. 1 2 A. H. Clifford, G. B. Preston (1964). The Algebraic Theory of Semigroups Vol. I (Second Edition). American Mathematical Society (p.26). ISBN   978-0-8218-0272-4
  2. 1 2 J. M. Howie (1976). An Introduction to Semigroup Theory. LMS monographs. 7. Academic Press. p. 96.
  3. J. M. Howie (1976). An Introduction to Semigroup Theory. LMS monographs. 7. Academic Press. p. 3.