International Journal of Humanities and Social Science Invention ISSN (Online): 2319 7722, ISSN (Print): 2319 7714

14 www.ijhssi.org Volume 2 Issue 12 December. 2013 PP. 01-06

Equivalence of Boolean Algebras and Pre A*-Algebras

1
1

K.Suguna Rao, 2P.Koteswara Rao

Dept.Of Mathematics, Acharya Nagarjuna University, Nagarjuna Nagar522510,A.P. 2 Dept .Of Commerce, Acharya Nagarjuna University, Nagarjuna Nagar-522510, A.P.

ABSTRACT:In this paper we present definition of Boolean algebra and Boolean sub algebra, examples,
theorems on Boolean algebras. Definition of pre A*algebras, examples and we show that Boolean algebras generates Pre-A*algebras, correspondence between Boolean algebras and Pre-A*algebras.

KEY WORDS: Boolean algebra, Pre -A*algebra. I. INTRODUCTION:

E. G. MANES introduced an Ada based on C-Algebras introduced by Fernando Guzman and Craig C. Squir . P. Koteswara Rao introduced the concept of A *-Algebras analogous to the E. G. Manes ,Adas. J. Venkateswara Rao introduced the concept of Pre A*-Algebra analogous to the C-Algebra , as a reduct of A*Algebra. He studied Pre A*-Algebras and their sub directly irreducible representations. It was established that 2 = {0; 1}and 3 = {0; 1; 2 }are the only sub directly irreducible Pre A*-Algebras and that every Pre A*-Algebra can be embedded in 3x, for some set x. Also proved that a Pre A*-Algebra can be made into an A*-Algebra by imposing one binary operation and one unary operation and he obtained a sufficient condition for a Pre A*Algebra to become an A*-Algebra. In this paper we studied Boolean Algebras generates Pre A*-Algebras and One one correspondence between Boolean algebras and Pre A*-Algebras

II.

BOOLEAN ALGEBRA:

2.1.Definition: An algebra (B, , , ( )~, 0, 1 ) is called a Boolean algebra if it satisfies: for every a, b, c B i) ii) iii) iv) v) vi) a 0 = a, a 1= a vii) a a1 = 0, a a1 = 1 2.1.Example: 2 = {0, 1} with , , ( )~ defined by 0 1 0 0 1 1 1 1 0 1 0 0 0 1 0 1 0 1 1 1 0

2.2.Example: Suppose X is a set, P(X) is a Boolean Algebra under the operation of set intersection , union ~ and complementation as ( )~, , X as , 0 and 1. 2.3. Example: The class of all logical statements form Boolean algebra under the operations and (), or (), not (~), fallacy f and tautology t as , , ( )~, 0 and 1. 2.4.Theorem : Suppose (B, , , ( )1, 0, 1) is a Boolean Algebra, then

www.ijhssi.org

1|Pa ge

Equivalence Of Boolean Algebras...

i) a b = 1, a b = 0 b = a1 ii) a = a iii) (a b) | = a| b|, (a b)| = a| b| iv) a b| = 0 v) 0| = 1, 1| = 0 vi) a (a| b) = a b Proof: i) b = b 0 = b (a a|) = (b a) (b a|) = 1 (b a|) = (b a|) | | a = a 0 = a| (a b) = (a| a) (a| b) = 1 (a| b) = (a| b) = b a| = b a| = b | a a = 0, a| a = 0 | a a = 0, a a| = 0 a, a are inverses of a| a = a (a b) (a| b|) = 0 (a b) (a| b|) = 1 (a| b|)| = a| b| (a b)| = a| b| Suppose a b| = 0 a = a 1 = a (b b|) = (a b) (a b|) = (a b) 0 = (a b) a b Suppose a b = a a b| = 0 (a b|) = (a a|) (a b|) = a (a| b|) = a (a b) | = a a| = 0 a b| = 0 1=0

ii)

iii)

iv)

0 1 = 1, 0

v)

1| = 0 and 0| = 1 a (a| b) = (a a|) (a b) = 0 (a b) =a b a (a| b) = a b Similarly a (a| b) = a b

www.ijhssi.org

2|Pa ge

Equivalence Of Boolean Algebras...

III. Pre A*- Algebras:

3.1 Definition: An algebra (A, , , () ) satisfying (a) x = x ,for all x A ,

(b) x x = x , for all xA, (c) x y = y x , for all x, y A, (d) (x y) = x y , for all x, y A, (e) x (y z) = (x y) z , for all x,y,zA (f) x (y z) = (x y) (x z) ,for all x,y,zA, (g) x y = x (x y) , for all x,y,zA, is called a Pre A*-algebra. 3.2 Example: 3 = {0, 1, 2} with operations A, , , () defined below is a Pre A*-algebra

^ 0 1 2

0 0 0 2

1 0 1 2

2 2 2 2

0 1 2

0 0 1 2

1 1 1 2

2 2 2 2

x 0 1 2

x~ 1 0 2

3.3 Note : (2, , , () ) is a Boolean algebra. So every Boolean algebra is a Pre A* -Algebra 3.4 Lemma: Let A be a pre A*-Algebra and a A be an identity for , then a is an identity for , a unique i f it exists, and is denoted by 1 and a by 0.i.e (i) a x = x for all x A (ii) a x = x for all x A 3.5 Lemma: Let A be a pre A*- Algebra with 1 and 0 and let x, y A (i)If x y = 0, implies x = 0. (ii) If x y =1, implies x x = 1. 3.6. Theorem: Let (B, , , ( )~ , 0, 1) be a Boolean algebra, then A(B) = {(a,b)/a,b B, a b=0} becomes a Pre-A*algebra, where , , ( )~ are defined as follows. For a = (a1, a2), b = (b1, b2) A(B) i) a = (a1b1, a1b2 + a2b1 + a2b2) ii) a = (a1b1 + a1b2 + a2b1, a2b2) iii) a~ = (a2, a1) iv) I = (1,0), 0 = (0,1), 2 = (0,0) Proof: Clearly (a~ b~)~ = a ~ ~ (i) (a ) = (a2, a1) ~ = (a1, a2) = a (a~)~ = a (ii) a =a Now a = (a1, a2) (a1, a2) = (a1a1, a1a2 + a2a1 + a2a2) = (a1, 2a1a2 + a2) = (a1, a2) = a a =a

www.ijhssi.org

3|Pa ge

Equivalence Of Boolean Algebras...

(iii)

(iv)

=b , for all a, b A(B) = (a1, a2) (b1, b2) = (a1b1, a1b2 + a2b1 + a2b2) b = (b1, b2) (a1, a2) = (b1a1, b2a1 + b1a2 + b2a2) = (a1b1, a1b2 + a2b1 + a2b2) a =b ~ (a = a~ b~ Now a = (a1, a2) (b1, b2) = (a1b1, a1b2 + a2b1 + a2b2) ~ (a = (a1b2, a2b1 + a2b2 + a1b1) ~ ~ a b = (a1, a2)~ (b1, b2) ~ = (a2, a1) (b2, b1) = (a2b2+ a2b1 + a1b2, a1b1) = (a1b2+ a2b1 + a2b2, a1b1) ~ (a = a~ b~ a = (a is clear = (a (a is clear = a (a~ ) a, b, c B(A) = (a1, a2) (b1, b2) = (a1b1, a1b2 + a2b1 + a2b2) a = (a1, a2) (b1, b2) = (a1b1, a1b2 + a2b1 + a2b2) (a~ b ) = (a2, a1) (b2, b1) = (a2b1+ a2b2 + a1b1, a1b2) a (a~ b) = (a1, a2) (a2b1+ a2b2 + a1b1, a1b2) A(B) is a Pre-A*algebra. a a a (a

(v) (vi) (vii)

3.7 Theorem: If A is Pre-A*algebra and B is a Boolean algebra then (i) B(A(B)) B (ii) A(B(A)) A Proof: (i) is clear To prove (ii) define : A A(B(A)) by (a) = ( ) a=b ( )=( ) (a) = (b) is well defined. Let A(B(A)) =( ), where B(A) =0 Let a(x) = ~ (a) = (( ), ) ~ =( ) =( )= (a) = is onto (a ) = ((a ), a ) =( ) =( ) = (a) (b) (a b) = (a) (b)

www.ijhssi.org

4|Pa ge

Equivalence Of Boolean Algebras...

= (( ) = ( =( ) = (b) (a b) = (b) ~ (a ) = ( ) = =( )~ ~ = (a ) (a~) = (a)~ A A(B(A))

3.8 Theorem: Let A1, A2 be Pre-A*algebra, B1, B2 be Boolean algebra, Then (i) A1 A2 iff B (A1) B (A2) (ii)B1 B2 iff A (B1) A (B2) Proof: First we prove the following. (a) A1 A2 B (A1) B (A2) (b) B1 B2 A (B1) A (B2) (a) A1 A2 Let: : A1 A2 be a Pre-A*algebra isomorphism Let a B (A1) x A1 a = (a) = ( ) = f( ) B(A2) Let b B (A2) y A2 b = : A1 A2 is isomorphism and y A2 x A1 (x) = y ( ) = (f( = =b a B(A1) (a) B(A2) f: B(A1) B(A2) is a Boolean isomorphism B (A1) B (A2) (b) SupposeB1 B2 Let: : B1 B2 be a Boolean isomorphism Let a, b B1, a b = 0 (a) (b) = 0 Define : A (B1) A (B2) as follows Let (a, b) A (B1) (a, b) B1, a b = 0 (a, b) = (a), (b) A (B2) is well defined and is bisection = = [f (ax), f (ay+bx+by) = [f(a) f(x), f(a) f(y) + f(b) f(x) + f(b) f(y)] = (f(a), f(b)) ( ) = (x, y)] = ~ ]= = , = ( f(a), f(b)) ~ = ( )~ ~ ~ ]=( ) (x, y)] = = [f (ax + ay + bx), f (by)] = [f(a) f(x) + f(a) f(y) + f(b) f(x), f(b) f(y)] = (f(a), f(b)) ( ) = (x, y)] =

www.ijhssi.org

5|Pa ge

Equivalence Of Boolean Algebras...

A (B1) A (B2) From (a) A1 A2 B (A1) B (A2) Suppose B (A1) B (A2) A (B(A1)) A (B (A2)) by (b) But A (B (A1)) A1 by 2.2 by (ii) A (B (A2)) A2 A1 A2 From (b) B1 B2 A (B1) A(B2) Suppose A (B1) A (B2) B (A (B1)) B (A (B2)) But B (A ( B1 ) ) B1 B (A (B2)) B2 B1 B2.

(i)

(ii)

REFERENCES:
[1] [2] [3] [4] [5] [6] [7] [8] Atiyah and IG Macdonald: Introduction to Commutative Algebra. Addisonnelsley Publishing Company Inc. 1969. Birkoff G: Lattice theory, American Mathematical Society, Colloquium Publications,Vol.25, New York, 1948. Elliott Mendel son: Theory and Problems of Boolean Algebras and Switching Circuits Schaums out line series. Mc Graw Hill Singapore. Fernando Guzman and Craig C.Squir: The Algebra of Conditional logic, Algebra Universals 27(1990), 88-110. Manes E.G. The Equational Theory of Disjoint Alternatives , personal communication to Prof. N.V.Subrahmanyam (1989). Manes E.G. Ada and the Equational Theory of If-Then-Else, Algebra Universalis 30 (1993), 373-394. P.Koteswara Rao.A*-Algebras and If-Then-Else structures (Phd Thesis),1994,Acharya Nagarjuna University,A.P,India. P.KoteswaraRao and Venkateswara Rao .J Boolean Algebras and A*-Algebras ,Journal of Pure Math ,Vol.20 (2003) pp.33-38. Srinivasa Rao .T and Koteswara Rao.P On Pre A*-Algebras,International Journal of Computational Cognition,Vol.8,No.1 . March 2010.

[9]

www.ijhssi.org

6|Pa ge