Boolean Near Rings and Weak Commutativity

CHAPTER III
BOOLEAN NEAR RINGS AND WEAK COMMUTATIVITY

3.1 Boolean Near-Rings
Definition: 3.1.1
A Near Ring R in which every element is an
idempotent is called Boolean Near Ring.
(i.e.) x2 = x , for each x N
Weak Commutativity
Lemma 1. If N is a boolean near-ring , then xy = xyx , for each x,y N.
Proof:
(since, x N)
xy = x2y
=x x y
(since, N is commutative)
=x y x
(since, Every Boolean Right Near

Ring R is weakly Commutative)
Therefore, xy = xyx , for each x, y N

Theorem 1. If N is a boolean near-ring, then abc = acb for each a,b,c N.
Proof. Let a,b,c N.
Then b(a - ac)c = b(ac ac2)
= b(ac ac)
= b(0).
Thus, [(a-ac)b(a-ac)]c = (a-ac)b(0)
Next,
=> (a-ac)bc = (a-ac)b(0)
(by Lemma 1)
=> abc-acb = ab(0) acb(0)
(Since cbc = cb)Eqn.1
c(a - ac)c = c(ac - ac)

= c(0)
=> c(a - ac) = c(0)
( by Lemma 1 )
=> bc(a - ac) = bc(0)

Again, by Lemma 1, bc(a - ac) = bc(a - ac)bc
we get bc(a - ac)bc = bc(0).
Now pre-multiplying both sides by a - ac

We obtain
[(a - ac)bc(a - ac)bc] = (a - ac)bc(0)
And this gives, by idempotency, that
(a - ac)bc = (a- ac)bc(0).
Again, using cbc = cb, we get,
abc - acb = abc(0) acb(0)..Eqn.2
From Eqn.1 & Eqn.2 we get
Abc(0) acb(0) = ab(0) acb(0)
=>abc(0) = ab(0)
for each a, b,c N
Hence, by using the result just obtained,

We have that ab(0) = aab(0)
= aa(0)
= a2(0)
= a(0)
Again from Eqn.1 we get
abc - acb = ab(0)-acb(0)
= a(0)-a(0)
=0
Therefore abc = acb for each a,b,c N.
for each a,b N
Theorem 2. Let N denote a boolean near-ring such that, if each of x,y N,

then there exists an e N such that ex = x and ey = y. Then N is a Boolean
Ring.
Proof: Let x
N.
Consider x and x + x .
By assumption, there exists an idempotent e
N such that
e x = x and e ( x + x ) = x + x.
Thus, x + x = e x + e x
= (e + e)x
= (e + e)2x
= [e(e + e) + e(e + e)]x
= e(e + e)x + e(e+e)x
= e(ex+ex)+e(ex+ex)
= e(x+x)+e(x+x)
= (x+x)+(x+x)
Hence, it follows that x + x = 0.
Therefore ( N , +) is an abelian group.
Now, let x , y N .
Then according to our assumption, there exists an idempotent f N
Such that f x = x and f y = y.
By Theorem 1, x y = ( f x ) y
= fxy
= fyx
= (fy)x
= yx.
(i.e.) xy= y x .
With the multiplication being commutative , it follows that N is a boolean ring.
Theorem 3. Every d.g. boolean near-ring N is a boolean ring.

Proof. Let N denote a d.g. boolean near-ring.
Suppose S is a multiplicative semigroup whose elements S generate ( N , + )
Satisfy s ( x + y ) = s x + s y for each x , y N .
It is easy to see that, for each s , s 1 , s 2 S and x N , s0 = 0, x0 = 0,
s + s = 0, and s1 s 2 = s2s1.
Hence s(x + x) = s x + s x
= ( s + s)x
= 0x
= 0.
Next, for x , y N ,
let y = s1 + s2 ++sn , where each s i S .
Then y(x + x) = (s1 + s2 ++sn)(x + x)
= s1(x + x)+s2(x+x,)+.+sn(x+x)
= 0.
Thus, by Lemma 1,
x + x = ( x + x)x
= ( x + x ) x ( x + x)
= (x + x)0
=0
That is, each non-zero element in ( N , +) is of order 2.
Hence ( N , +) is an abelian group.
Consequently, N is a ring since ( N , +) being abelian implies by an elementary
result that N is left distributive.
Therefore N is a boolean ring.
A special class of Boolean Near-Rings
Let R denote a boolean ring. Let each of A and B denote a subring of R

such that AB - {0} and suppose a b = 0 for each a A and b B . Take
N to be the set of all mappings: f : R > R such that, for each x R ,
f { x ) = a x+ b , where a e A and b e B . Then (N , , ) is a Boolean
near-ring where and denote, respectively, ordinary addition and composition
of mappings. Finally, (N, , ) is boolean since, for each x R, (//)(*) = /[/
(*)] = a{ax+b)+b = ax+ab+b - ax+Q+b = ax+b = /(*). It is this class of
boolean near-rings which we will characterize in the following manner.
Let A denote a boolean ring and let B denote an additive abelian group.
Consider the group direct sum A B of A and B. Define a multiplication in
A B by (a\ , b \ ) (02, >2) = (1 2 1 ) It can be verified directly
that A B forms a boolean right near-ring with commutative addition and
satisfies the identity (*-.k)0 = xy-yx. We will denote this boolean near-ring
by N(A, B).
Theorem 4.
Let N denote a boolean near-ring in which the addition is
commutative and suppose, for each x , yN , that

(*)
(jc - y)0 xy - yx.
Then there exist a boolean ring A and an abelian group B such that N =
N ( A , B).
Proof, let
A = {a N|<z0 = 0} and let B = {b e N|60 = b). Clearly, A and B are
additive subgroups of N . For each a\yaz A, we have by (*) that ai02~a2ai

= (ai-fl2)0 = ajO-^O = 0-0 = 0 and thus a\ai = aia\. Also, A is closed with
respect to multiplication since (01*22)0 = Zi(22O) = ajO = 0 for each
fl|,fl2 A and thus 2^2 A. Hence A is a boolean ring. Furthermore, A n
B = {0} and, from the definitions of A and B along with Theorem 1, ab =
abO = aOb = aO = 0, for each a A and b B.
Let ( f > : N N (A , b ) denote a mapping defined by <f>{jc) = (jc x0,jc0) for each x N. It is easy to see that <f> is additive. To see that <f> is
also multiplicative, let x\, X2 N. Using the identity (*), we obtain x\ (X2X2O) - (*2-*20)Xi = [ATi (JC2 JC20)]0 = ^10-(AT2-JC20)0 = X|0- JC20 + JC2O = JC|0.
Thus X \{ X 2 - JC2O) - X2X \ + JC2O = jciO and rearranging we obtain *1
{ x 2 - X2O) = X2X y + (x\ ~ *2)0 = *2*1 + *i*2 ~ *2*1 = *i*2- Also, by
Theorem 1, X1X2O = X1OX2 = *i0. Thus, <f>{x\)(f>{x2) = (x\ - XiO,XiO)
(a:2 - *20,*20) = ((X \ - Xi0)(*2 - *20),X \0 ) = (x i (x 2 - *20) - XiO(x2 *20),*i0) = (*i*2 - A"i0, jcjO) = { x \x z - *|JC20,*i*20) = <f>(xix2). Hence,
^ is a homomorphism. That <f> is injective is trivial.
Now, for each (a, b) e N (A , B ), let c = a + b . Then c O = { a + 6)0 = a0 +60
= 0 + 6 = 6 and c - c 0 = a + b - b = a. Thus 4>{c) = (c - cO, cO) = (a, b). This
shows that <f> is suijective. Therefore <f> is an isomorphism and
consequently N = N (A , B).

Boolean Near Rings and Weak Commutativity

Uploaded by

Copyright:

Available Formats

Boolean Near Rings and Weak Commutativity

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Boolean Near Rings and Weak Commutativity

Uploaded by

Copyright:

Available Formats

CHAPTER III

BOOLEAN NEAR RINGS AND WEAK COMMUTATIVITY

(since, Every Boolean Right Near

Therefore, xy = xyx , for each x, y N

=> (a-ac)bc = (a-ac)b(0)

=> abc-acb = ab(0) acb(0)

(Since cbc = cb)Eqn.1

c(a - ac)c = c(ac - ac)

=> bc(a - ac) = bc(0)

Now pre-multiplying both sides by a - ac

for each a, b,c N

Hence, by using the result just obtained,

for each a,b N

Theorem 2. Let N denote a boolean near-ring such that, if each of x,y N,

Theorem 3. Every d.g. boolean near-ring N is a boolean ring.

A special class of Boolean Near-Rings

Let R denote a boolean ring. Let each of A and B denote a subring of R

Let N denote a boolean near-ring in which the addition is

commutative and suppose, for each x , yN , that

(jc - y)0 xy - yx.

A = {a N|<z0 = 0} and let B = {b e N|60 = b). Clearly, A and B are

additive subgroups of N . For each a\yaz A, we have by (*) that ai02~a2ai

You might also like