The Idempotent Regular Elements of Semigroups

Similar documents
Congruences on Inverse Semigroups using Kernel Normal System

arxiv: v1 [math.ra] 25 May 2013

A GENERALIZATION OF BI IDEALS IN SEMIRINGS

INTRODUCTION TO THE GROUP THEORY

Abel-Grassmann s bands. 1. Introduction

Tightness and Inverse Semigroups

CHARACTERIZATION OF IDEAL SEMIGROUPS OF INVERSE SEMIGROUPS. K.V.R.Srinivas

Permutation Groups and Transformation Semigroups Lecture 2: Semigroups

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

Ana Rita Garcia Alves. Semigroup Operators and Applications. Universidade do Minho Escola de Ciências. outubro de 2015

Lecture 7.3: Ring homomorphisms

Completeness of Star-Continuity

SANDWICH SETS AND CONGRUENCES IN COMPLETELY INVERSE AG -GROUPOIDS

Adequate and Ehresmann semigroups

Conjugacy in epigroups

On Extensions of Green s Relations in Semi groups

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

ON LALLEMENT S LEMMA 1

DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY

On the lattice of congruences on a fruitful semigroup

The kernel of a monoid morphism. Part I Kernels and extensions. Outline. Basic definitions. The kernel of a group morphism

Some of Douglas Munn s Contributions to Representation Theory of Semigroups

Primitive Ideals of Semigroup Graded Rings

Strongly Regular Congruences on E-inversive Semigroups

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

1 + 1 = 2: applications to direct products of semigroups

Compact Primitive Semigroups Having (CEP)

IDEALS AND THEIR FUZZIFICATIONS IN IMPLICATIVE SEMIGROUPS

Mappings of the Direct Product of B-algebras

arxiv: v1 [math.gr] 21 Feb 2014

CATEGORICAL SEMIGROUPS

Completely regular semigroups and (Completely) (E, H E )-abundant semigroups (a.k.a. U-superabundant semigroups): Similarities and Contrasts

Prime Hyperideal in Multiplicative Ternary Hyperrings

Linear Algebra. Chapter 5

12 16 = (12)(16) = 0.

Ring Theory Problems. A σ

arxiv: v1 [math.gr] 20 Mar 2014

MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA

Joseph Muscat Universal Algebras. 1 March 2013

Some Properties of Class of p-supremum. Bounded Variation Sequences

Left almost semigroups dened by a free algebra. 1. Introduction

Direct Product of BF-Algebras

CONSTRUCTION A CORING FROM TENSOR PRODUCT OF BIALGEBRA

1.5 The Nil and Jacobson Radicals

Lecture 7. Logic III. Axiomatic description of properties of relations.

ON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES

Complete and Fuzzy Complete d s -Filter

Research Article Morita Equivalence of Brandt Semigroup Algebras

A graph theoretic approach to combinatorial problems in semigroup theory

Characterizations of Intra-Regular Left Almost Semigroups by Their Fuzzy Ideals

Vector Bundles and Projective Modules. Mariano Echeverria

Rohit Garg Roll no Dr. Deepak Gumber

5 Group theory. 5.1 Binary operations

1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by

SOME STRUCTURAL PROPERTIES OF HYPER KS-SEMIGROUPS

Monoids. Definition: A binary operation on a set M is a function : M M M. Examples:

3.2 Modules of Fractions

RINGS: SUMMARY OF MATERIAL

On KS-Semigroup Homomorphism

PRIMER ON INVERSE SEMIGROUPS

Strong - Bi Near Subtraction Semigroups

TIGHT RESIDUATED MAPPINGS. by Erik A. Schreiner. 1. Introduction In this note we examine the connection

arxiv: v1 [math.ra] 28 Jan 2016

A Study of Green s Relations on Fuzzy Semigroup

Formal power series rings, inverse limits, and I-adic completions of rings

Congruences in Hypersemilattices

Finiteness conditions and index in semigroup theory

MA 252 notes: Commutative algebra

BASIC GROUP THEORY : G G G,

Math 222A W03 D. Congruence relations

1. Groups Definitions

Chapter 2 Subspaces of R n and Their Dimensions


TROPICAL SCHEME THEORY

Groups and Symmetries

On the game-theoretic value of a linear transformation on a symmetric cone

On Pseudo-P-Injectivity

MATH 205B NOTES 2010 COMMUTATIVE ALGEBRA 53

Unions of Dominant Chains of Pairwise Disjoint, Completely Isolated Subsemigroups

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.

Introduction to Information Security

EQUATIONS OF TOURNAMENTS ARE NOT FINITELY BASED

Universal Algebra for Logics

On (m,n)-ideals in LA-Semigroups

ON THE STAR-HEIGHT OF SUBWORD COUNTING LANGUAGES AND THEIR RELATIONSHIP TO REES ZERO-MATRIX SEMIGROUPS

Generalization of Schur s Lemma in Ring Representations on Modules over a Commutative Ring

Solutions to Assignment 4

ON STRUCTURE OF KS-SEMIGROUPS

MATH RING ISOMORPHISM THEOREMS

Skew Boolean algebras

1.1 Definition. A monoid is a set M together with a map. 1.3 Definition. A monoid is commutative if x y = y x for all x, y M.

A Primer on Homological Algebra

ON THE RESIDUALITY A FINITE p-group OF HN N-EXTENSIONS

ERRATA: MODES, ROMANOWSKA & SMITH

Equalizers and kernels in categories of monoids

FUZZY HOMOMORPHISM AND FUZZY ISOMORPHISM

Characterizations of nondecreasing semilattice operations on chains

Lecture 4. Algebra. Section 1:. Signature, algebra in a signature. Isomorphisms, homomorphisms, congruences and quotient algebras.

A Little Beyond: Linear Algebra

9. Integral Ring Extensions

Transcription:

The Idempotent Regular Elements of Semigroups Karyati Mathematics Education Department Faculty of Mathematics and Natural Sciences State University of Yogyakarta E-mail : yatiuny@yahoo.com Abstract In this paper, we will generalize the characteristics of the idempotent elements of a regular semigroup and the idempotent elements of its quotient semigroup. Based on the Characteristics of the idempotent elements of an arbitrary semigroup, we obtain that : For an arbitrary semigroup S and a congruence on S, then for every (a) E(S/) there is ee(s) such that (a) = (e). Let : S T, be homomorphism, so we obtain : for every fe(r()) there is an element ee(s) such that (e)=f. The result of the generalization : for every idempotent regular element (a) S/, with S is an arbitrary semigroup ( must not be a regular semigroup ), there is ee(s), such that (a) = (e). As a corollary, we have : Let S, T be arbitrary semigroups, if : S T is a homomorphism, then for every idempotent regular element fe(r()) there is an element ee(s) such that (e)=f. Key words : regular element, idempotent element, idempotent regular element. 1. Introduction In the previous paper [3] has been proved the Characteristics of an idempotent element in e 0Se0; I, ; P /, i.e.: M e 0Se0; I, ; P, i.e. a Rees Matrix semigroup over a M Theorem 1. Let be a congruence on Bilinear Form semigroup S. If there is an idempotent element (, e, f ) u is an idempotent element in M e Se I, ; P 0; 0 (, e, f ) M e 0Se0; I, ; P, such that : ( u, e, f ) = ( t, e, f ). t /, then This result can be generalized as follow [4]: Theorem 2. For every ae(s), with S is a Bilinear Form Semigroup, there is (t,e,f ) E ( M e Se I, ; P/ ), such that (t,e,f) = a, with is a congruency on e Se I, ; P 0; 0 M 0 0;. 1

We can prove that S and e Se I, ; P M 0 0; are regular semigroups [2]. Hence, every element of these semigroups is a regular element. Based on the theory of the semigroup homomorphism, there is an injective homomorphism from the quotient semigroup to the image of the homomorphism. From these conditions, in this paper, we will study about the generalization of the previous theorems, i.e. for the idempotent element of a regular semigroup and the homomorphism from a regular semigroup, the idempotent regular of a semigroup (must not be a regular semigroup ) and the semigroup homomorphism. 2. Theoretical review : These definitions are referred from [1]. Let S be a semigroup, an element e S is called an idempotent if and only if ( next, be denoted by Iff ) is called regular iff there is iff every element of S is regular. An element a' aa' a'. Let 2 e e. An element a, in a semigroup S, x S such that axa a. A semigroup S is called regular semigroup a' S is called an inverse of a iff aa' a a and S,., T,. be semigroups. A map : S T is called a semigroup homomorphism iff : x, y S xy ( x) ( y). Next, R ( s) : ss T kernel of, denoted by is called the range of. The ker, is defined by : ker ( a, b) S S ( a) ( b). Let a relation be an equivalency relation on a set X, the notation or y(mod ) x. A set ( ) y X ( x, y) ( x, y) is written as x y x is a equivalency class. A relation on a semigroup S is called compatible iff, b, c, d S( a, b) and ( c, d) ( ac, bd) a and a compatible equivalency relation is called a congruence. If is a congruence on a semigroup S, then S is a semigroup with respect to a binary operation i.e. ( x).( y) ( xy), for all I x, y S. A map : S S which is defined by ( x) ( x) is a homomorphism. A set ( ker a, b) S S ( a) ( b) is a congruence on S. A semigroup homomorphism : S T has several characteristics as follow: a. A semigroup homomorphism S ker T I : is a monomorphism, such that R R. 2

b. If a set ker is a congruence on semigroup S, then there is a unique homomorphism : S T such that R R. 3. Results: Based on the previous researches and based on the characteristics of semigroup homomorphism, we obtain a result as follow : Theorem 3. If ker be a congruence on a regular S, then for every (a) E(S/) there is ee(s) such that (a) = (e). If as is an idempotent, since S is a regular semigroup, then a is regular. But a=a 2, so there is a S such that a 2 a a 2 =a 2. Suppose x=a a 2 a S, so x is an inverse of a 2, i.e.: xa 2 x = a a 2 a a 2 a a 2 a = a a 2 a a 2 a = a a 2 a = x and a 2 xa 2 = a 2 a a 2 a a 2 = a 2 a a 2 = a 2. If e=axa, then e 2 = axaaxa= axa 2 xa=axa=e. So the element e is idempotent in S. Next, we will proof that a (a) = (e) or a= e (mod ): e=axa a 2 xa 2 ( mod ) =a 2 a( mod ) We conclude that ( a) = (e). The second property is given as follow : Theorem 4. Let S be a regular semigroup and T be a semigroup ( not need regular ). If a map is a homomorphism from S into T, then for every fe(r()) there is ee(s) such that (e)=f. Before proving this theorem, we illustrate a commutative diagram as follow: S R() T I S/ 3

The maps,, I are semigroup homomorphism, which are defined as follow : as (a) R() T as (a) I =(a) (a) S/ ( (a))=(a) The homomorphism is injective with R() = R(). If fe(r()) is idempotent, then f is regular, since S is a regular semigroup. We have is injective, so there is a unique (e) S/ such that ( (e))=f. The element (e) is idempotent, since: If fe(r()), then there is a unique (e) S/ such that ( (e))=f. So, we obtain ( (e)) = f = f 2 =( (e)). ( (e)) =( (e).(e))., such that (e) = (e) (e). By the definition, then ( (e))=(e). We conclude that (e)=f. We will generalize Theorem 3 and Theorem 4 i.e. we will substitute the semigroup by an arbitrary semigroup. We can do it since the commutative diagram on the proof of the previous theorem is true for an arbitrary semigroup. The sufficient condition is given in the theorem as below : Theorem 5. If ker is a congruence on a semigroup S, then for every idempotent regular element (a) S/ there is ee(s) such that (a) = (e). If as is an idempotent regular element, then (a) is an idempoten regular, since: There is a S such that aa a=a, so (a) =(aa a) = (a) (a ) (a). Hence there is (a )S/ such that (a) =(aa a) = (a) (a ) (a). So that (a) is regular and idempotent in S/, since: (a) =(a 2 ) = (a) (a). The next, a 2 is in S and a 2 =a, since a is idempotent. Is a 2 regular? We have a 2s a a 2 =aa a=a=a 2. Hence, a 2 is idempotent in S. Suppose x=a a 2 a S, so x is an inverse of a 2,since : xa 2 x = a a 2 a a 2 a a 2 a = a a 2 a a 2 a = a a 2 a = x dan a 2 xa 2 = a 2 a a 2 a a 2 = a 2 a a 2 = a 2. Again, soppose e=axa and we obtain e 2 = axaaxa= axa 2 xa=axa=e. So that e is idempotent in S. The next, proved that (a) = (e). To prove it is equivalent to prove that a= e (mod ): 4

e=axa a 2 xa 2 ( mod ) =a 2 a( mod ) So, (a) = (e). As a corollary, we have the following result as a side effect of Theorem 5 and the property of semigroup homomorphism : Corollary 6. Let S, T be semigroups. If a map : S T is a homomorphism, then for every idempotent regular semigroup fe(r()) there is ee(s) such that (e)=f. See the commutative diagram as below : S R() = R() T I S/ If fe(r()) is regular, then there is a unique (e)(s/) such that ((e)) = f. We know f is regular, so there is f (R()) such that ff f=f. On the other hand f (R()), so there is a unique (e )(S/) such that ((e )) = f. But, we have ((e)(e )(e)) =((e).) ((e)) ((e)) =ff f=f=((e)), so that (e) is regular. We know that f 2 =f, so ((e) (e)).= ((e)) or ((e 2 )) = ((e)) and we obtain (e 2 )= (e) or e 2 =e. Hence e is idempotent. By the definition ((e)) =(e)=f 4. Conclusion We obtain the generalization of the result of the previous research, i.e.: The idempotent elements of Bilinear form Semigrups have the same characteristics with the idempotent elements of regular semigrups and regular idempotent elements of semigroups. 5

References [1] Howie, J. M, An Introduction to Semigroup Theory. Academic Press, Ltd. London, 1976. [2] Karyati, Semigrup yang Dikonstruksikan dari Bentuk Bilinear. Thesis Post Graduate Program: Gadjah Mada University, Yogyakarta, 2003. [3] Karyati, Sifat Homomorphisma Semigrup Matriks Rees Atas Semigrup Bentuk Bilinear. An Article of The Regional Conference of Indonesian Mathematics Society IX Central Java and Special District of Yogyakarta, Mathematics Department, Faculty of Mathematics and Natural Sciences, Sebelas Maret University, Surakarta. 2003. [4] Karyati, Sifat Elemen Idempoten Semigrup Bentuk Bilinear. An Article of National Seminar, Faculty of Mathematics and Natural Sciences, State University of Yogyakarta. 2003. Note: This paper will be submit to Southeast Asian Bulletin 6