Four-spiral semigroup

Last updated

In mathematics, the four-spiral semigroup is a special semigroup generated by four idempotent elements. This special semigroup was first studied by Karl Byleen in a doctoral dissertation submitted to the University of Nebraska in 1977. [1] [2] It has several interesting properties: it is one of the most important examples of bi-simple but not completely-simple semigroups; [3] it is also an important example of a fundamental regular semigroup; [2] it is an indispensable building block of bisimple, idempotent-generated regular semigroups. [2] A certain semigroup, called double four-spiral semigroup, generated by five idempotent elements has also been studied along with the four-spiral semigroup. [4] [2]

Contents

Definition

The four-spiral semigroup, denoted by Sp4, is the free semigroup generated by four elements a, b, c, and d satisfying the following eleven conditions: [2]

  • a2 = a, b2 = b, c2 = c, d2 = d.
  • ab = b, ba = a, bc = b, cb = c, cd = d, dc = c.
  • da = d.

The first set of conditions imply that the elements a, b, c, d are idempotents. The second set of conditions imply that a R b L c R d where R and L are the Green's relations in a semigroup. The lone condition in the third set can be written as d ωla, where ωl is a biorder relation defined by Nambooripad. The diagram below summarises the various relations among a, b, c, d:

Elements of the four-spiral semigroup

The spiral structure of idempotents in the four-spiral semigroup Sp4. In this diagram, elements in the same row are R-related, elements in the same column are L-related, and the order proceeds down the four diagonals (away from the center). Spiral Structure of idempotents in Sp4.png
The spiral structure of idempotents in the four-spiral semigroup Sp4. In this diagram, elements in the same row are R-related, elements in the same column are L-related, and the order proceeds down the four diagonals (away from the center).
The structure of the four-spiral semigroup Sp4. The set of idempotents (red coloured points) and the subsemigroups A, B, C, D, E are shown. Four Spiral Semigroup 02.png
The structure of the four-spiral semigroup Sp4. The set of idempotents (red coloured points) and the subsemigroups A, B, C, D, E are shown.

General elements

Every element of Sp4 can be written uniquely in one of the following forms: [2]

[c] (ac)m [a]
[d] (bd)n [b]
[c] (ac)mad (bd)n [b]

where m and n are non-negative integers and terms in square brackets may be omitted as long as the remaining product is not empty. The forms of these elements imply that Sp4 has a partition Sp4 = A∪B∪C∪D∪E where

A = { a(ca)n, (bd)n+1, a(ca)md(bd)n : m, n non-negative integers }
B = { (ac)n+1, b(db)n, a(ca)m(db) n+1 : m, n non-negative integers }
C = { c(ac)m, (db)n+1, (ca)m+1(db)n+1 : m, n non-negative integers }
D = { d(bd)n, (ca)m+1(db)n+1d : m, n non-negative integers }
E = { (ca)m : m positive integer }

The sets A, B, C, D are bicyclic semigroups, E is an infinite cyclic semigroup and the subsemigroup D∪E is a nonregular semigroup.

Idempotent elements

The set of idempotents of Sp4, [5] is {an, bn, cn, dn : n = 0, 1, 2, ...} where, a0 = a, b0 = b, c0 = c, d0 = d, and for n = 0, 1, 2, ....,

an+1 = a(ca)n(db)nd
bn+1 = a(ca)n(db)n+1
cn+1 = (ca)n+1(db)n+1
dn+1 = (ca)n+1(db)n+ld

The sets of idempotents in the subsemigroups A, B, C, D (there are no idempotents in the subsemigoup E) are respectively:

EA = { an : n = 0,1,2, ... }
EB = { bn : n = 0,1,2, ... }
EC = { cn : n = 0,1,2, ... }
ED = { dn : n = 0,1,2, ... }

Four-spiral semigroup as a Rees-matrix semigroup

Let S be the set of all quadruples (r, x, y, s) where r, s, ∈ { 0, 1 } and x and y are nonnegative integers and define a binary operation in S by

The set S with this operation is a Rees matrix semigroup over the bicyclic semigroup, and the four-spiral semigroup Sp4 is isomorphic to S. [2]

Properties

Double four-spiral semigroup

The fundamental double four-spiral semigroup, denoted by DSp4, is the semigroup generated by five elements a, b, c, d, e satisfying the following conditions: [2] [4]

  • a2 = a, b2 = b, c2 = c, d2 = d, e2 = e
  • ab = b, ba = a, bc = b, cb = c, cd = d, dc = c, de = d, ed = e
  • ae = e, ea = e

The first set of conditions imply that the elements a, b, c, d, e are idempotents. The second set of conditions state the Green's relations among these idempotents, namely, a R b L c R d L e. The two conditions in the third set imply that e ω a where ω is the biorder relation defined as ω = ωl∩ ωr.

Related Research Articles

Monoid Algebraic structure with an associative operation and an identity element

In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a single associative binary operation and an identity element.

In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that "division" is always possible. Quasigroups differ from groups mainly in that they are not necessarily associative.

Semigroup algebraic structure with an associative binary operation

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.

Ring (mathematics) Algebraic structure with addition and multiplication

In mathematics, a ring is one of the fundamental algebraic structures used in abstract algebra. It consists of a set equipped with two binary operations that generalize the arithmetic operations of addition and multiplication. Through this generalization, theorems from arithmetic are extended to non-numerical objects such as polynomials, series, matrices and functions.

Generating set of a group Subset of a group such that all group elements can be expressed by finitely many group operations on its elements

In abstract algebra, a generating set of a group is a subset such that every element of the group can be expressed as a combination of finitely many elements of the subset and their inverses.

In abstract algebra and formal logic, the distributive property of binary operations generalizes the distributive law from Boolean algebra and elementary algebra. In propositional logic, distribution refers to two valid rules of replacement. The rules allow one to reformulate conjunctions and disjunctions within logical proofs.

Magma (algebra) algebraic structure with a binary operation

In abstract algebra, a magma is a basic kind of algebraic structure. Specifically, a magma consists of a set equipped with a single binary operation. The binary operation must be closed by definition but no other properties are imposed.

In ring theory an idempotent element, or simply an idempotent, of a ring is an element a such that a2 = a. That is, the element is idempotent under the ring's multiplication. Inductively then, one can also conclude that a = a2 = a3 = a4 = ... = an for any positive integer n. For example, an idempotent element of a matrix ring is precisely an idempotent matrix.

Semiring algebraic ring that need not have additive negative elements

In abstract algebra, a semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse.

In abstract algebra, the free monoid on a set is the monoid whose elements are all the finite sequences of zero or more elements from that set, with string concatenation as the monoid operation and with the unique sequence of zero elements, often called the empty string and denoted by ε or λ, as the identity element. The free monoid on a set A is usually denoted A∗. The free semigroup on A is the subsemigroup of A∗ containing all elements except the empty string. It is usually denoted A+.

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.

Inverse semigroup regular semigroup in which every element has a unique inverse

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 abstract algebra, a semiheap is an algebraic structure consisting of a non-empty set H with a ternary operation denoted that satisfies a modified associativity property:

In mathematics, a regular semigroup is a semigroup S in which every element is regular, i.e., for each element a, there exists an element x 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 mathematics, a Riesz space, lattice-ordered vector space or vector lattice is a partially ordered vector space where the order structure is a lattice.

A biordered set ("boset") is a mathematical object that occurs in the description of the structure of the set of idempotents in a semigroup. The concept and the terminology were developed by K S S Nambooripad in the early 1970s. The defining properties of a biordered set are expressed in terms of two quasiorders defined on the set and hence the name biordered set. Patrick Jordan, while a master's student at University of Sydney, introduced in 2002 the term boset as an abbreviation of biordered set.

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 algebra, the 3x + 1 semigroup is a special subsemigroup of the multiplicative semigroup of all positive rational numbers. The elements of a generating set of this semigroup are related to the sequence of numbers involved in the still open Collatz conjecture or the "3x + 1 problem". The 3x + 1 semigroup has been used to prove a weaker form of the Collatz conjecture. In fact, it was in such context the concept of the 3x + 1 semigroup was introduced by H. Farkas in 2005. Various generalizations of the 3x + 1 semigroup have been constructed and their properties have been investigated.

References

  1. ↑ Byleen, K. (1977). The Structure of Regular and Inverse Semigroups, Doctoral Dissertation. University of Nebraska.
  2. 1 2 3 4 5 6 7 8 Pierre Antoine Grillet (1996). "On the fundamental double four-spiral semigroup". Bulletin of the Belgian Mathematical Society . 3: 201 &minus, 208.
  3. ↑ L.N. Shevrin (originator). "Simple semi-group". Encyclopedia of Mathematics. Retrieved 25 January 2014.
  4. 1 2 3 Meakin, John; K. Byleen; F. Pastijn (1980). "The double four-spiral semigroup". Simon Stevin. 54: 75 & minus 105.
  5. ↑ Karl Byleen; John Meakin; Francis Pastjin (1978). "The Fundamental Four-Spiral Semigroup". Journal of Algebra. 54: 6 &minus, 26. doi: 10.1016/0021-8693(78)90018-2 .
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.