You are on page 1of 10

1

ON Some Characterization of Smarandache Lattice with Pseudo complement


Dr. N. Kannappa
1
, Mr. K. Suresh
2
1
Associate professor, PG&Reasearch Department of Mathematics, T.B.M.L, College, Porayar.
sivaguru91@yahoo.com
2
Assistant Professor, Department of Mathematics, Mailam Engineering college, Mailam.
sureshphd2009@gmail.com

Abstract:
In this paper we have introduced smarandache - 2 - Algebraic structure of lattice namely
smarandache lattice. A smarandache 2- algebraic structure on a set N means a weak algebraic structure
A
o
on N such that there exists a proper subset M of N which is embedded with a stronger algebraic
structure A
1
, Stronger algebraic structure means that it is satisfying more axioms, by proper subset one
understands a subset different from the empty set, from the unit element if any, and from the whole set.
we define smarandache lattice and obtain some of its characterization through Pseudo complemented.For
basic concept we refer to PadilaRaul[4].
Keywords: Lattice, Boolean Algebra, Smarandache lattice, Pseudo complemented lattice.
1. Introduction:
In order that New notions are introduced in algebra to better study the congruence in number
theory by Florentin smarandache [1] .By <proper subset>of a set A we consider a set P included in A, and
different from A, different from the empty set, and from the unit element in A if any they rank the
algebraic structures using an order relationship:
They say that the algebraic structures S
1
S
2
if :both are defined on the same set;: all S
1
laws
are also S
2
laws ; all axioms of an S
1
law are accomplished by the corresponding S
2
law;S
2
law
accomplish strictly more axioms than S
1
laws, or S
2
laws has more laws than S
1.
For example : Semi group monoid group ring field, or Semi group commutative semi
group, ring unitary ring, etc.they define a General special structure to be a structure SM on a set A,
different from a structure SN, such that a proper subset of A is an SN structure, where SM SN.

2

2. Preliminaries
Definition 2.1: Let S be a lattice with 0. Let xeS x*is a Pseudo complementet of x
iff x*eSand x . x* =0 and for every yeS: if x. y =0 then y s x*.
Definition 2.2: S is pseudo complemented iff every element of S has a pseudo complement.
Let S be a pseudo complemented lattice .N
S
={x
*
:xeS},the set of pseudo complements in S
N
S
={N
S s N
, N, , 0
N
,

1
N , .N , v
N

} where:
(i). s
N,
is defined by :for every x , y e Ns : x
s N
y iff x s
S
b
(ii). N is defined by :
for every xe N
S
: N (x) =x*
(iii). .
N
is defined by:
for every x
,
ye N
S
x.
N
y =x .
S
y
(iv).v
N
is defined by :
for every x
,
y e N
S
: xv
N
y=(x * .
S
y* ) *
(vi). 1
N
=0
S
*, 0
N
=0
S
Definition 2.3: If S is a distributive lattice with 0,I
S
is a complete Pseudo Complemented lattice.
Let S be a lattice with 0. NI
S ,
the set of normal ideals in S, is given NI
S
={I*eI
S
:IeI
S
}.
Definition 2.4: A pseudo complemented distributive lattice S is called a stone lattice if, for all
a e S, it satisfies the property av a** =1.
Definition 2.5: Let S be a pseudo complemented distributive lattice. Then for any filter F of S,
define the set (F) as follows (F) = {a* eS / a* eF}.
Definition 2.6: Let S be a pseudo complemented distributive lattice, An ideal I of S is called a
-ideal if I = (F) for some filter F of S.
3
Now we have introduced a definition by [4]:
Definition:
A lattice Sis said to be a Smarandache lattice. If there exist a proper subset L of S,
which is a Boolean Algebra with respect to thesame induced operationsof S.
3. Characterizations
Theorem 3.1: Let (S, ., v ,
) be a lattice. If there exist a proper subset N
S
of S, where N
S
={x
*
:
xeS}is the set of all Pseudo complemented lattice in S .Then S is a smarandache lattice.
Proof: By hypothesis, let (S, ., v ,
) bea lattice and whose proper subset N
S
={x
*
: xeS}the
set of all pseudo complemented lattice in S.
It is enough to prove that N
S
is a Boolean Algebra.
For ,
(i) for every x, y e N
S,
x.
N
y e N
S
and .
N
is meet under s
N.
if x, y e N
S
, then x=x** and y=y**.
Since x.
S
y s
S
x,by result xs
N
y then y*s
N
x*,
x* s
S
(x.
S
y)*, and, withby result xs
N
y then y*s
N
x*
,
(x.
S
y)** s
S
x. Similarly, (x.
S
y)** s
S
y.
Hence (x.
S
y)** s
S
(x.
S
y).
By result, xs
N
x** , (x.
S
y) s
S
(x.
S
y)** ,
Hence (x.
S
y) eN
S,
(x.
N
y) e N
S
.
If a e N
S
and a s
N
x and a s
N
y,
Then a s
S
x and a s
S
y, a s
S
(x.
S
y),
Hencea s
N
(x.
N
y).So indeed .
N
is meet in s
N.
4
(ii) For every x,y e N
S
: x
v N
yeN
S
and
v N
is join under s
N.
Let x,y e N
S.
Thenx*, y* e N
S .
Then by (i) , (x* .
S
y*) eN
S.
Hence (x* .
S
y*)*e N
S
and hence (xv
N
y) e N
S.
(x*
.
S
y*)
s
S
x*, hence, by result x
s
N
x**
X **s
S
(x* .
S
y*)*,
By result N
S
={xeS; x =x**}, x s
S
(x* .
S
y*)*.
Similarly, y s
S
(x* .
S
y*)*.
If aeN
S
and x s
N
a and y s
N
a, then x s
S
a and y s
S
a ,then by result if x s
N
y
Theny*s
N
x*, a*s
S
x* and a*s
S
y*, hence a*s
S
(x* .
S
y*)
Hence,byresult if xs
N
y then y* s
N
x*,
(x* .
S
y*)s
S
a** hence, byresult N
S
={xeS; x =x**},
(x* .
S
y*)*s
S
a, hence x
v N
y s
N
a so, indeed
v N
is join in s
N.
(iii) 0
N
, 1
N e
N
S
and 0
N
and 1
N are
the bounds of N
S .
Obviously 1
N e
N
S,
since 1
N
=0
S
* since for every ae N
S,
a.
S
0
S =
0
S,
For every a e N
S,
a s
S
0
S
* ,hence as
N
1
N.
0
S
*, 0
S
**eN
S.
Hence 0
S
* .
S
0
S
**eN
S.
But of course, 0
S
* .
S
0
S
**=0
S.
Hence 0
S
e N
S
, 0
Ne
N
S ,
Obviously, for every a e N
S
; 0
S
s
S
a.
Hence for every a e N
S
: 0
N
s
N
a .So N
S
is bounded lattice.
(iv) For every a e N
S
:
N
(a) e N
S
and for every a e N
S :
a .
N

N
(a) =0
N
and
For every ae N
S
: a
v
N

N
(a) =1
N .
Let ae N
S
, Obviously
N
(a) eN
S.
a
v
N

N
(a) =a
v
N
a* =((a*
.
S
b**))* =(a*
.
S
a)* =0
S
* =1
N
a .
N

N
(a) =a .
S
a*=0
S
=0
N .
5
So N
S
is a bounded complemented lattice.
(v) Distributive.
Let x,y,z
e
NS
. Since x
s N (
x
v
N
(y
.
N
z)),
( x
.
N
z )
s
N
x
v
N
(y
.
N
z)
Also (y
.
N
z)
s
N
x
v
N
(y
.
N
z)
Obviously, if a
s
N
b, then a .
N
b* =0
N
,Since b
.
b* =0
N ,

Hence, (x
.
N
z )
.
N
(x
v
N
(y
.
N
z))* =0
N
and
(y
.
N
z )
.
N
(x
v
N
(y
.
N
z))* =0
N
,
x
.
N
(z
.
N
(x
v
N
(y
.
N
z))*) =0
N
,
y
.
N
(z
.
N
(x
v
N
(y
.
N
z))*) =0
N
.
By definition of Pseudocomplement:
z .
N
(x v
N
(y.
N
z))* s
N
x*,
z .
N
(x v
N
(y.
N
z))* s
N
y*
Hence z .
N
(x v
N
(y.
N
z))* s
N
x*.
N
y*
Once again, If a s
N
b, then a.
N
b* =0
N
,
Hence, z .
N
(x v
N
(y.
N
z))* . (x*.
N
y*)* =0
N
z .
N
(x*.
N
y*)*s
N
(xv
N
(y.
N
z))**Now, by definition of v
N
:
z .
N
(x*v
N
y*)* =z .
N
(xv
N
y) And by N
s
={ x e s, : x =x**}:
( x v
N
(y.
N
z))** =x v
N
(y.
N
z), Hence : z .
N
(xv
N
y) s
N
xv
N
(y.
N
z) .
Hence, indeed N
s
is a Boolean Algebra.
Therefore by definition, Sis a smarandache lattice.
6
Theorem 3.2: Let S be a distributive lattice with 0. If there exist a proper subset I
S
of S , where
I
S
is the set of all ideals in S. Then S is a Smarandache lattice.
Proof: By hypothesis ,let S be a distributive lattice with 0 andwhose proper subset
I
S
is the set of all ideals in S.
We claim that I
S
is a Boolean algebra.
Let IeI
S
.Take I
*
={yeS:for every ieI:y.i=0},I
*
eI
S
Namelyif aeI
*
then for every ieI:a.i=0,
Let bs a, Then, obviously, for everyieI:b.i=0hence beI*.
If a,beI
*
then for every ieI:a.i=0,and for every ieI:b.i=0,
Hence for every ieI:(a.i)v(b.i)=0.
With distributive, for every ieI: i .(avb)=0,hence avbeI
*
.
Hence I
*
e I
S,
.I I
*
=I {yeS:for every ieI:y.i=0}={0}.
Let I J ={0},let jeJ Suppose that for some ieI:i .j = 0.
Then i .jeI J , Since I and j are ideals, henceI J = {0} .
Hence foreveryieI:j .i=0.,and hence j _I
*
.
Consequently, I
*
is a pseudo complement of I and I
S
is a pseudo complemented .
InTheorem 3.1we have provedthat pseudo complementedform a Boolean algebra.
Therefore I
S
is a Boolean algebra .
Then by definition, S is a Smarandache lattice.
Theorem 3.3: Let S be a distributive lattice with 0. If there exist a proper subset NI
s
of S , where
NI
s
={I*eI
s
, I eI
s
}is the set of normal ideals in S. Then S is a smarandache lattice.
Proof: By hypothesis ,let S be a distributive lattice with 0 andwhose proper subset NI
s
={I*eI
s
,
IeI
s
}is the set of normal ideals in S.
Weclaim that NI
S
is Boolean Algebra.
7
Since NI
s
={I*eI
s
:IeI
s
}is the set of normal ideals in S.
Alternatively NI
s
={IeI
s
:I=I**}.
Thus NI
s
is the set of all Pseudo complemented lattice in I
s.
In Theorem 3.1we have provedthat pseudo complementedform a Boolean algebra .
Therefore NI
S
is a Boolean algebra .
Hence by definition, Sis a smarandache lattice.
Theorem 3.4: Let S be a lattice. If there exist a Pseudo complemented distributive lattice L,
X*(L) is a sub lattice of thelattice I

(L) of all ideals of L,which is theproper subset of S .


Then Sis a Smarandache lattice.
Proof: By hypothesis,let S be a lattice and there exist a Pseudocomplemented distributive
lattice L, X*(L) is a sub lattice of the lattice I

(L) of all ideals of L,which is theproper subset


of S .
Let (a*],(b*] eX*(L),f or some a,be
L.
Then clearly (a*](b*]eX*(L).
Again, (a*] (b*] = ([a)) ([b))= [(a)([b))= ([ab))=((ab )*] eX*(L).
Hence X*(L) is a sub lattice of I

(L) and hence a distributive lattice.


Clearly (0**] and (0*] are the least and greatest elements of X*(L).
Now for any a e
L
, (a*] (a**] =(0] and
(a*] (b**] = ([a)) ([a*)) = ([a)) ([a*)) = ([aa*))= ([0)) = (L) =L.
Hence (a**] is the complement of (a*] in X*(L). Therefore {X*(L),
,
}is a bounded
distributive lattice in which every element is complemented.
Thus X*(L) is a Boolean Algebra.
By definition, Sis a Smarandache lattice.
8
Theorem 3.5 Let S be a lattice, L be a pseudo complemented distributive lattice.
If Sis a Smarandache lattice.Then thefollowing conditionsare equivalent:
(a). L is a Boolean algebra.
(b). every element of L is closed,
(c). every principal ideal is a -ideal,
(d). for any ideal I, a eI implies a**e I,
(e). for any proper ideal I, I D(L) =
,
(f). for any prime ideal P, PD(L) =
,
(g). everyprime ideal is a minimal prime ideal,
(h). every prime ideal is a ideal,
(i). for any a,b eS, a* =b* implies a =b,
(j). D (L) is a singleton set.
Proof: Since S is a Smarandache lattice. Thenby definition, there exist aproper subset L of S
such that whichis aBoolean algebra.
ThereforeL is a Boolean algebra.
Now to prove
(a) (b): Then clearly L has a unique dense element, precisely the greatest element.
Let ae S. Then a*.a=0 =a*.a**. Also a*v a , a
*
va** e D (L).
Hence a* v a =a*v a**. By the cancellationproperty of S, we get a =a**.
Therefore every element of L is closed.
9
(b) (c): Let I be a principal ideal of L. Then I =(a] for some a e L .Then by condition (b),
a =a**. Now, (a] =(a**] = ([a*)). Therefore (a)] is a -ideal.
(c) (d): I be a proper ideal of L. Let a e I. Then (a] = (F) for some filter F of L. Hence
Weget a***=a* e F. Therefore a**e (F) =(a]_I.
(d) (e): Let I be a proper ideal of L. Suppose a eI D (S). Then a** e S and a*=0.
Therefore 1=0* =a** e L, which is a contradiction.
(e) (f): Let I be a proper ideal of S,I D(L) = ,then P be a prime ideal of L ,PD(L) = .
(f) (g): Let P be a prime ideal of S such that PD (L) = . Let ae P. Then clearly a. a*=0
and a va* eD (L). Hence a va* ep Thus a*ep Therefore P is a minimal prime ideal of L.
(g) (h): Let P be a minimal prime ideal of L. Then clearly L-P is a filter of L. Let a eP.
Since P is minimal, there exists b e P such that a . b =0. Hence a*. b =b.
a* e P. Thus a
*
e ( S-P) which yields ae (L-P). Conversely, let a e (L-P). Then we get
a* e P. Hence we have a eP. Thus P= (L-P). Andtherefore P is - ideal of L.
(h) (i): Assume that every prime ideal of L is a ideal. Let a, b e L be such that a*=b*.
Suppose a= b. Then there exists a prime ideal P of S such that aeP and be P. By
Hypothesis, P is a - ideal of L. Hence P = (F) for some filter F of L. Since a eP = (F),
Weget b* =a*e F. Hence be (F) =P, which is a contradiction. Therefore a=b.
(i) (j): Suppose x, y be two elements of D (L). Then x * =0 =y *. Hence x =y.
Therefore D (L) is a singleton set.
(j) (a): Assume that D (L) ={d} is singleton set. Let ae L. We have always av a* D (L).
Therefore a . a* =0 and a v a*=d. This true for all ae L. Also 0s as ava*=d.
Hence the above conditions are equivalent.

10
References
[1]. Florentin Smarandache,Special Algebraic structures, University of New Mexico .1991
SC:06A99
[2]. Gratzer,G., General lattice Theory,Acodemic Press, NewYork,sanfrancisco,1978
[3]. Monk,J .Donald,bonnet,Robert,eds(1989),Hand book of Boolean Algebras,
Amstrerdom,NorthHolland.publishing co.
[4]. Padilla,Raul, Smarandache Algebraic Structure <International Conference on Semi
groups>, Universidaddo minho, Bra go, Portugal, 18-23 J une 1999.
[5]. Padilla, Raul, Smarandache Algebraic Structure<Smarandache Notions journal>
USA,Vol 1.9,No36-38
[6]. Padilla,Raul ,Smarandache Algebraic Structures<Bulletin of Pure and Applied
Science>,Delhi,india,Vol 17.E,NO.1,119-121,1998
[7]. Samba SivaRAO , Ideals in Pseudo complemented Distributive Lattices, No 48,97-
05,2012
[8]. Sabine Koppel berg, General theory Boolean algebra, North Holland, Amsterdam, 1989,
Volume of Monk [8], MR90K; 06002.

You might also like