Rees factor semigroup

Last updated

In mathematics, in semigroup theory, a Rees factor semigroup (also called Rees quotient semigroup or just Rees factor), named after David Rees, is a certain semigroup constructed using a semigroup and an ideal of the semigroup.

Contents

Let S be a semigroup and I be an ideal of S. Using S and I one can construct a new semigroup by collapsing I into a single element while the elements of S outside of I retain their identity. The new semigroup obtained in this way is called the Rees factor semigroup of S modulo I and is denoted by S/I.

The concept of Rees factor semigroup was introduced by David Rees in 1940. [1] [2]

Formal definition

A subset of a semigroup is called an ideal of if both and are subsets of (where , and similarly for ). Let be an ideal of a semigroup . The relation in defined by

xρy   either x = y or both x and y are in I

is an equivalence relation in . The equivalence classes under are the singleton sets with not in and the set . Since is an ideal of , the relation is a congruence on . [3] The quotient semigroup is, by definition, the Rees factor semigroup of modulo . For notational convenience the semigroup is also denoted as . The Rees factor semigroup [4] has underlying set , where is a new element and the product (here denoted by ) is defined by

The congruence on as defined above is called the Rees congruence on modulo .

Example

Consider the semigroup S = { a, b, c, d, e } with the binary operation defined by the following Cayley table:

·abcde
 a a a a d d
 b a b c d d
 c a c b d d
 d d d d a a
 e d e e a a

Let I = { a, d } which is a subset of S. Since

SI = { aa, ba, ca, da, ea, ad, bd, cd, dd, ed } = { a, d } I
IS = { aa, da, ab, db, ac, dc, ad, dd, ae, de } = { a, d } I

the set I is an ideal of S. The Rees factor semigroup of S modulo I is the set S/I = { b, c, e, I } with the binary operation defined by the following Cayley table:

·bceI
 b b c I I
 c c b I I
 e e e I I
 I I I I I

Ideal extension

A semigroup S is called an ideal extension of a semigroup A by a semigroup B if A is an ideal of S and the Rees factor semigroup S/A is isomorphic to B. [5]

Some of the cases that have been studied extensively include: ideal extensions of completely simple semigroups, of a group by a completely 0-simple semigroup, of a commutative semigroup with cancellation by a group with added zero. In general, the problem of describing all ideal extensions of a semigroup is still open. [6]

Related Research Articles

Equivalence relation Reflexive, symmetric and transitive relation

In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The relation "is equal to" is the canonical example of an equivalence relation.

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.

Modular arithmetic Computation modulo a fixed integer

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

Ideal (ring theory)

In ring theory, a branch of abstract algebra, an ideal is a special subset of a ring. Ideals generalize certain subsets of the integers, such as the even numbers or the multiples of 3. Addition and subtraction of even numbers preserves evenness, and multiplying an even number by any other integer results in another even number; these closure and absorption properties are the defining properties of an ideal. An ideal can be used to construct a quotient ring similarly to the way that, in group theory, a normal subgroup can be used to construct a quotient group.

Semigroup

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

In algebra, the kernel of a homomorphism is generally the inverse image of 0. An important special case is the kernel of a linear map. The kernel of a matrix, also called the null space, is the kernel of the linear map defined by the matrix.

In abstract algebra, a congruence relation is an equivalence relation on an algebraic structure that is compatible with the structure in the sense that algebraic operations done with equivalent elements will yield equivalent elements. Every congruence relation has a corresponding quotient structure, whose elements are the equivalence classes for the relation.

Gaussian integer Complex number whose real and imaginary parts are both integers

In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as Z[i]. This integral domain is a particular case of a commutative ring of quadratic integers. It does not have a total ordering that respects arithmetic.

Quaternion group

In group theory, the quaternion group Q8 (sometimes just denoted by Q) is a non-abelian group of order eight, isomorphic to the eight-element subset of the quaternions under multiplication. It is given by the group presentation

Quotient ring

In ring theory, a branch of abstract algebra, a quotient ring, also known as factor ring, difference ring or residue class ring, is a construction quite similar to the quotient groups of group theory and the quotient spaces of linear algebra. It is a specific example of a quotient, as viewed from the general setting of universal algebra. One starts with a ring R and a two-sided ideal I in R, and constructs a new ring, the quotient ring R / I, whose elements are the cosets of I in R subject to special + and operations.

In mathematics, a quotient algebra is the result of partitioning the elements of an algebraic structure using a congruence relation. Quotient algebras are also called factor algebras. Here, the congruence relation must be an equivalence relation that is additionally compatible with all the operations of the algebra, in the formal sense described below. Its equivalence classes partition the elements of the given algebraic structure. The quotient algebra has these classes as its elements, and the compatibility conditions are used to give the classes an algebraic structure.

Lie algebra representation

In the mathematical field of representation theory, a Lie algebra representation or representation of a Lie algebra is a way of writing a Lie algebra as a set of matrices in such a way that the Lie bracket is given by the commutator. In the language of physics, one looks for a vector space together with a collection of operators on satisfying some fixed set of commutation relations, such as the relations satisfied by the angular momentum operators.

Chebotarev's density theorem in algebraic number theory describes statistically the splitting of primes in a given Galois extension K of the field of rational numbers. Generally speaking, a prime integer will factor into several ideal primes in the ring of algebraic integers of K. There are only finitely many patterns of splitting that may occur. Although the full description of the splitting of every prime p in a general Galois extension is a major unsolved problem, the Chebotarev density theorem says that the frequency of the occurrence of a given pattern, for all primes p less than a large integer N, tends to a certain limit as N goes to infinity. It was proved by Nikolai Chebotaryov in his thesis in 1922, published in.

In mathematics and computer science, the syntactic monoidM(L) of a formal language L is the smallest monoid that recognizes the language L.

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.

Inverse semigroup

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.

Abstract analytic number theory is a branch of mathematics which takes the ideas and techniques of classical analytic number theory and applies them to a variety of different mathematical fields. The classical prime number theorem serves as a prototypical example, and the emphasis is on abstract asymptotic distribution results. The theory was invented and developed by mathematicians such as John Knopfmacher and Arne Beurling in the twentieth century.

In algebra, a presentation of a monoid is a description of a monoid in terms of a set Σ of generators and a set of relations on the free monoid Σ generated by Σ. The monoid is then presented as the quotient of the free monoid by these relations. This is an analogue of a group presentation in group theory.

The Hurwitz quaternion order is a specific order in a quaternion algebra over a suitable number field. The order is of particular importance in Riemann surface theory, in connection with surfaces with maximal symmetry, namely the Hurwitz surfaces. The Hurwitz quaternion order was studied in 1967 by Goro Shimura, but first explicitly described by Noam Elkies in 1998. For an alternative use of the term, see Hurwitz quaternion.

Short integer solution (SIS) and ring-SIS problems are two average-case problems that are used in lattice-based cryptography constructions. Lattice-based cryptography began in 1996 from a seminal work by Ajtai who presented a family of one-way functions based on SIS problem. He showed that it is secure in an average case if the shortest vector problem is hard in a worst-case scenario.

References

  1. D. Rees (1940). "On semigroups". Proc. Camb. Phil. Soc. 36: 387–400. MR 2, 127
  2. Clifford, Alfred Hoblitzelle; Preston, Gordon Bamford (1961). The algebraic theory of semigroups. Vol. I. Mathematical Surveys, No. 7. Providence, R.I.: American Mathematical Society. ISBN   978-0-8218-0272-4. MR   0132791.
  3. Lawson (1998) Inverse Semigroups: the theory of partial symmetries, page 60, World Scientific with Google Books link
  4. Howie, John M. (1995), Fundamentals of Semigroup Theory, Clarendon Press, ISBN   0-19-851194-9
  5. Mikhalev, Aleksandr Vasilʹevich; Pilz, Günter (2002). The concise handbook of algebra. Springer. ISBN   978-0-7923-7072-7.(pp. 13)
  6. Gluskin, L.M. (2001) [1994], "Extension of a semi-group", Encyclopedia of Mathematics , EMS Press

This article incorporates material from Rees factor on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.