.

CHAPTER 1
1.1INTRODUCTION

The origin of soft set theory could be traced to the work of pawlak
[14] in 1993titled Hard and soft set in the proceedings of the international
EWorkshop on rough set and knowledge discover art Banff. The notion of
soft set is a unified view of classical, rough and fuzzy sets. This motivated
the first results of soft set theory by D.Molodstov’s[1] in 1999. Therein,
the basic notions of the theory of soft set and some of its possible
applications were presented. For positive motivation, the work discusses
some problem of the future with regards to the theory.

The theory of soft set, P.K. Maji al., [2] in 2002, defined some basic
terms of the theory such as equality of soft sets, subset and super set of a
soft set, complement of a soft set, null set. And absolute soft set with
examples. Binary operations like AND, OR, union and intersection were
also denified. De morgan’s law and a number of results are verified in soft
set theory. A.sezgin and A.O. Atagun[6] proved that certain De Morgan’s
laws hold in soft set theory with respect to different operations on soft sets.
Alie al.,[13] in 2009, introduced some new notions such as the restricted
intersection, the restricted union, the restricted difference and the extended
intersection of two soft sets. They improve the notion of complementation
in soft set and also proved thart certain De Morgan’s laws hold In soft set
theory.

W.K.MIN,[5] IN 2012, to investigate the theoretical relation

between two soft sets using the concepts of similarity. The first concept is
similarity between soft sets, which is an extension of the equality for soft
set theory, and second concept is conjunction parameter, disjunction
parameter of ordered pair arameter for soft set theory, and show that the

1
.

De Morgan’s laws hold in soft set theory for the modified operations and
the complement defined by Maji et al.

In this dissertation I deal with a soft set theory and related theorems.

2
.

CHAPTER 2

2.1. PRELIMINARIES

In this chapter we prepared some of the definition which are essential

for the study of rest of the chapter.

Definition 2.1.1

Let U be the universal set and E be the set of parameters.

A pair (F,A) is called a soft set over U if AB and F:A → P(U), where P(U)
is a set of all subset of U.

Example.2.1.2:
Let U be the set of houses and E be the set of parameters.

Let U = {
h1 , h 2 , h 3 , h 4 , h 5 } and E= { e1 ,e 2 ,e3 ,e 4 ,e5 ,e6 ,e 7 ,e8 }

Where
h1 , h 2 , h 3 , h 4 , h 5 are houses and E = {expensive, beautiful,
wooden, cheep, In the green surrounding, Modern, in good repair, bad
repair}. The soft set (F,E) describes the “attractiveness of the houses”.

E= {
e2 ,e3 ,e4 ,e5 ,e7 };

e h 2 , h 3 , h5 }; e3 ) = { h 2 , h4 }; F( e4 ) ={ h1 };
F( 2 ) = { F(

e
F( 5 ) = U; F(
e7 ) = { h 3 , h 5 }.

The soft set (F,E) is a parameterized family

e
{F( i ), i=1,2,3,4,5,6,7,8} of subset of the set U and give us a collection of
approximate descriptions of an object.

3
.

Definition. 2.1.3
Let U be an initial universe set and E be a universe set of
parameters. Let (F,A) and (G,B) be soft sets over a common universe set U
and A,B  E. Then

 (F,A) is a subset of (G,B), denoted by (F,A) 

 (G,B) , if
(i) A  B; (ii) for all e  A ,F(e) and G(e) are identical
approximations;
 (A,B) equals (G,B), denoted by (F,A) = (G,B).

If (F,A) 
 (G,B) and (G,B)  (F,A).

Definition: 2.1.4
Let (F,A) and (G,B) be two soft sets over U. the union of (F,A) and
(G,B), denoted by (F,A)∪ (G,B), is defined as (F∪G, C) where C = A ∪B,
for all e ∈C,

F(e), if e ∈ A \ B

(F ∪G)(e)= G(e), if e ∈ b \ A  e C

F(e) ∪ G(e), otherwise.

Example: 2.1.5

Let U = {
h1 , h 2 , h 3 , h 4 , h 5 } and

A= {
e2 ,e3 ,e 4 ,e5 ,e7 };

e h 2 , h 3 , h5 }; e3 ) = { h 2 , h4 }; F( e4 ) = { h1 };
F( 2 ) = { F(

4
.

e
F( 5 ) = U; F(
e7 ) = { h 3 , h 5 }.

B= {
e1 ,e2 ,e3 ,e 4 ,e5 ,e6 ,e7 };

G(
e1
) ={
h3 , h5
},
e
G( 2 ) = {
h4
},
e
G( 3 ) = {
h 2 , h4
},

e
G( 4 ) = {
h1 }, e
G( 5 ) = {
h 2 , h 3 , h 4 , h 5 }, G( e6 ) = G( e7 ) = { h 3 }.

∪
(F,A) (G,B) = ( F
∪
G, {
e1 ,e 2 ,e3 ,e 4 ,e5 ,e6 ,e7 }),

Where (F ∪ G ) (
e1 ) = { h 3 , h 5 }

(F ∪ G ) ( 2 ) = {
e h 2 , h3 , h 4 , h5 }

(F ∪ G ) ( 3 ) = {
e h 2 , h4
}

(F ∪ G ) ( 4 ) = {
e h1 }

(F ∪ G ) ( 5 ) =
e U

(F ∪ G ) ( 6 ) = {
e h3 }

e h3 , h5
(F ∪ G ) ( 7 ) = { }.

Definition 2.1.6
Let (F,A) and (G,B) be two soft sets over U. The intersection of (F,A)
and (G,B), denoted by (F,A) ∩(G,B), is defined as (F ∩G, C ), where C={e ∈

‫׀‬
A ∩ B} F(e) ∩ G (e) ≠ ∅ },  e ∈ C, (F ∩G)(e)=F(e)∩G(e).

Example: 2.1.7

Let U = {
h1 , h 2 , h 3 , h 4 , h 5 } and A={
e2 ,e3 ,e 4 ,e5 ,e7 };

5
.

e
F( 2 ) = {
h 2 , h 3 , h5
},
e
F( 3 ) = {
h 2 , h4 },

e h1 }, e e h 3 , h 5 }.
F( 4 ) = { F( 5 ) = U, F( 7 ) = {

B={
e1 ,e 2 ,e3 ,e 4 ,e5 ,e6 ,e7 };

G(
e1
)= {
h3 , h5
},
e
G( 2 ) = {
h4
},
e
G( 3 ) = {
h 2 , h4
},
e h1 e h2 , h3, h4 , h5 e e h3
G( 4 ) = { }, G( 5 ) = { }, G( 6 ) = G( 7 ) = { }.
e3 ,e 4 ,e5 ,e7
(F,A) ∩(G,B) = ( F ∩ G, { }),

Where (F ∩ G) ( 3 ) = {
e h 2 , h4 },

(F ∩G) ( 4 ) = {
e h1 },

(F ∩ G) ( 5 ) = {
e h 2 , h 3 , h 4 , h 5 },

(F ∩ G) ( 7 ) = {
e h 3 }.

Definition ;2.1.8
Let (F, A) and (G, B) be two soft sets over U. The difference of
(F,A) AND (G,B), Denoted by (F,A) \ (G,B) is defined as (F \ G,C) ,

where ‫׀‬
C= A\{ e ∈ A ∩ B} F(e)  G(e) },  e ∈ C,

F(e) \ G(e), if e ∈ A ∩ B

(F \ G)(e) = F(e), otherwise.

Example: 2.1.9

Let U = {
h1 , h 2 , h 3 , h 4 , h 5 } and

A={
e2 ,e3 ,e 4 ,e5 ,e7 };

6
.

e
F( 2 ) = {
h 2 , h 3 , h5
},
e
F( 3 ) = {
h 2 , h4 }, e
F( 4 ) = {
h1 },

e e h 3 , h 5 }.
F( 5 ) = U, F( 7 ) = {
e ,e ,e ,e ,e ,e ,e
B = h 5 { 1 2 3 4 5 6 7 };

G(
e1 ) = { h 3 , h 5 }, G( e2 ) = { h 4 }, e
G( 3 ) = {
h 2 , h4 },

e h1 }, e h2 , h3, h4 , h5 e e h 3 }.
G( 4 ) = { G( 5 ) = { }, G( 6 ) = G( 7 ) = {

e3 ,e 4 ,e5 ,e7
(F,A) ¿(G,B) = ( F ¿ G, { }),
e h 2 , h 3 , h5
Where (F ¿G) ( 2 )={ }
e h1
(F ¿G) ( 5 ) = { }
e
(F ¿G) ( 7 ) = {
h 5 }.

Definition: 2.1.10

Two soft sets (f,A) and (G,B) over a common universe set U are said
to be soft equal if (F,A) is a soft subset of (G,B) is a soft subset of (F,A) is
called equality of two soft sets.

Example: 2.1.11

Let A = {
e1 ,e3 ,e5 }  E, and B ={ e1 ,e3 ,e4 ,e5 }  E.

Clearly, A  B.

Let (F,A) and (G,B) be two soft sets over a common universe set

U={
h1 , h 2 , h 3 , h 4 , h 5 , h 6 } such that

G(
e1
)={
h 2 , h4 }; G ( e2 ) = { h1 , h 3 }; G ( e3 ) = { h 3 , h 4 ,h 5 };

e
G ( 5) = {
h1 }

7
.

F(
e1 ) = { h 2 , h4 }; F( e3 ) = { h 3 , h 4 ,h 5 }; e
F ( 5) = {
h1 }

Therefore, (F,A) 
 (G, B).

Definition: 2.1.12

A soft set (F,A) over U is said to be a null soft set denoted by ∅ , if

for all ε ∈ A, F(ε ) =   (null- set).

Example: 2.1.13

Let U be the set of houses. And

A is the set of parameters.

Let there are five houses in the universe U given by

U={
h1 , h 2 , h 3 , h 4 , h 5 } and

A = {brick; muddy; steel; stone}.

The soft set (F, A) describes the “five of the houses”. The soft sets (F,A) is
defined as

F (brick) means the brick built houses,

F (muddy) means the muddy houses,

F (steel) means the built houses,

F (stone) means the stone built houses.

The soft set (F, A) is the collection of approximations:

(F, A) = {brick built houses =  , muddy houses =  , Steel built houses =  ,

stone built houses =  }.

Hear, (F, A) is null soft set.

Definition: 2.1.14
8
.

A soft set (F, A) over U is said to be absolute soft set denoted by Ã

, if for all ε ∈ A,

F(ε ) =U. Clearly, Ã =  and  = Ã .

Example: 2.1.15

Let U be the set of houses.

B is the set of parameters.

Let there be five houses in the universe U given by

U={
h1 , h 2 , h 3 , h 4 , h 5 } and

B = { not brick; not muddy; not steel; not stone}.

The soft set (G, B) describes the “construction of the houses”. The soft (G,
B) is defined as

G (not brick) means the houses not built by brick

G (not muddy) means the not muddy houses,

G (not steel) means the houses not built by steel,

G (not stone) means the houses not built by stone.

The soft set (G, B) is the collection of approximation;

(G, B) = not brick built houses ={

h1 , h 2 , h 3 , h 4 , h 5 },

not muddy houses ={

h1 , h 2 , h 3 , h 4 , h 5 },

not steel built houses ={

h1 , h 2 , h 3 , h 4 , h 5 },

not stone built house ={

h1 , h 2 , h 3 , h 4 , h 5 }.

The soft set (G, B) is the absolute soft set.

9
.

CHAPTER 3
SOME NEW OPERATIONS IN SOFT SET THEORY

Definition: 3.1.1
Two soft set (F, A) and (G, B) over a common universe set U are
said to be soft equal if (F, A) is a soft subset of (G, B) and (G, B) is a soft
subset of (F, A) is called equality of two soft sets.

Example 3.1.2

Let A = {
e1 ,e3 ,e5 }  E, and B ={
e1 ,e3 ,e 4 ,e5 }  E.
clearly A  B,
Let (F, A) and (G, B) be two soft set over a common universe set

U= {
h1 , h 2 , h 3 , h 4 , h 5 , h 6 } such that

G(
e1 )={ h 2 , h4 }; G ( e2 ) ={ h1 , h 3 }; G ( e3 ) ={ h 3 , h 4 ,h 5 }; G ( e5 ) = { h1 }

F(
e1 ) = { h 2 , h4 }; F( e3 ) = { h 3 , h 4 ,h 5 }; e
F ( 5) = {
h1 }

10
.

Therefore, (F,A) 
 (G, B).

Definition:3.1.3
Let (F, A) and (G, B) be two soft set over a common universe set U.
Then (F, A)  (G, B) is a soft set defined by (F, A)  (G, B) = (H,A×B),
where H(¿ α , β >¿) = f(α ) ∩g( β ) for any α ∈A and β ∈B, where ∩is the
intersection operation of sets.

Example: 3.1.4
Let (F, A) and (G, B) be two soft set over U. And let A and B be two
parameters.
e 2 ,e3 ,e4 ,e5 ,e7 e1 ,e 2 , e3 ,e 4 ,e5 , e 6 ,e 7
A={ }; B ={ }
e
F( 2 ) = {
h 2 , h 3 , h5 }, F( e3 ) = { h 2 , h4 }, F( e4 ) = { h1 }, F( e5 ) = U,
e
F( 7 ) = {
h3 , h5
}. `

G(
e1
)={
h3 , h5 e
}; G ( 2 ) ={
h4 e
}; G ( 3 ) ={
h 2 , h4
}; G ( 4 )={
e h1
}

e h 2 , h3 , h4 , h5 e6 e h3
G( 5 ) = { }; G( ) = G( 7 ) = { };

e3 ,e 4 ,e5 ,e7
(F,A) ∩(G, B) = (F ∩ G, { })

Where
e
(F ∩G) ( 3 ) = {
h 3 , h 5 },

e
(F ∩G) ( 4 ) = {
h1 },
e
(F ∩G) ( 5 ) = U,
e h 3 }.
(F ∩G) ( 7 ) = {

Definition:3.1.5
The intersection of two soft sets (F,A) and (G, B) over a common
universe set U is the soft set (H, C), where C =A ∩ B and ∀e ∈C,
H(e)= F(e) or g(e). we write, (F, A) ∩(G, B) = (H, C)

11
.

Definition :3.1.6
Let (F,A) and (G, B) be soft set over a common universe set U. (F,
A)  (G,B) is a soft set defined by (F, A)  (G,B) = (K,A×B), where k (
¿ α , β >¿) = f(α ) ∪g( β ) for any αϵ A, βϵ B, where ∪ is a union operation of

sets.

Example: 3.1.7
Let (F,A) and (G, B) be soft set over U. And let A and B be two
parameters.

e 2 ,e3 ,e4 ,e5 ,e7 e1 ,e 2 ,e3 ,e4 , e5 ,e 6 , e7

A={ }; B ={ }
e
F( 2 ) = {
h 2 , h 3 , h5 }, F( e3 ) = { h 2 , h4 }, F( e4 ) = { h1 }, F( e5 ) = U,
e h ,h
F( 7 ) = { 3 5 }. `

G(
e1
)={
h3 , h5 e
}; G ( 2 ) ={
h 4 }; G ( e3 ) ={ h 2 , h4 }; G ( e4 )={ h1 }

e
G( 5 ) = {
h 2 , h3 , h4 , h5
}; G(
e6 ) = G( e7 ) = { h 3 };

(F,A) ∪(G, B) = (F ∪ G, {
e3 ,e4 ,e5 ,e7 })

Where
e
(F ∪G) ( 3 ) = {
h 2 , h4 },

e h1 },
(F ∪G) ( 4 ) = {
e
(F ∪G) ( 5 ) = { h1 , h 2 , h 3 , h 4 , h 5 },
e
(F ∪G) ( 7 ) = {
h 3 , h 5 }.

Theorem: 3.1.8
1.  (  A) = A
2.  (A∪B) = (  A ∪  B)
3.  (A∩B) = ( (  A∩  B)

Proof:

12
.

1.  (  A) = A
Let U is the houses and E is the set of parameter.

U={
h1 , h 2 , h 3 , h 4 , h 5 , h 6 }

E={
e1 , e 2 , e3 ,e 4 , e5 }

A= {
e1 , e3 , e5 }; B={
e1 ,e 2 , e3 , e5 }

(  A) = { 
e1  e3  e5
, , }

 (  A) = {   e1   e3   e5 }
, ,
e ,e ,e
={ 1 3 5}
 (  A) = A

2.  (A∪B) = (  A∪B)

L.H.S
A= {
e1 , e3 , e5 }; B={
e1 ,e 2 , e3 , e5 }

(A∪B) = ({
e1 , e3 , e5 }∪{ e1 , e 2 ,e3 , e5 })

={
e1 ,e 2 ,e3 ,e 4 ,e5 }

 (A∪B) = {  e1  e2  e3  e4  e5 }
, , , ,

R.H,S

e1  e3  e5
(  A) = {  , , }

e1  e2  e3  e5
(  B) = {  , , , }

13
.

(  A∪B) = ({ 
e1  e3  e5 }∪{  e1  e2  e3  e5 })
, , , , ,

 e1  e2  e3  e4  e5 }
={ , , , ,

Therefore,  (A∪B) = (  A∪B)

L.H.S

3.  (A∩B) = (  A∩B)
L.H.S
A= {
e1 , e3 , e5 }; B={
e1 ,e 2 , e3 , e5 }

(A∩B) = ({
e1 , e3 , e5 }∩{ e1 ,e 2 ,e3 , e5 })

={
e1 , e3 ,e5 }

 (A∩B) = {  e1  e3  e5 }
, ,

R.H,S

(  A) = { 
e1  e3  e5 }
, ,

(  B) = { 
e1  e2  e3  e5 }
, , ,

(  A∩B) = ({ 
e1  e3  e5 }∩{  e1  e2  e3  e5 })
, , , , ,

 e1  e3  e5 }
={ , ,

Therefore  (A∩B) = (  A∩B)

Theorem 3.1.9
14
.

For any soft sets (F, A), (G, B) and (H, C) Over U , We have that

1. ((F, A)∩ (G, B)) ∩ (H, B) = (F, A)∩ ((G, B) ∩ (H, B))
2. ((F, A)∪ (G, B)) ∪ (H, B) = (F, A)∪ ((G, B) ∪ (H, B))

Proof:

1. ((F, A)∩ (G, B)) ∩ (H, B) = (F, A)∩ ((G, B) ∩ (H, B))

L.H.S

((F, A)∩ (G, B)) ∩ (H, B) = A'

A1 ∩ A1
A' = {e∈ C ‫( ׀‬F ∩ G)(e)∩H (e) ≠ ∅ },where = F∩G

A1
={ e∈ ‫(׀‬F ∩ G)(e)e)≠ ∅ }∩{ e∈C‫(׀‬F∩G)(e)∩H(e)≠ ∅ }

={ e∈A∩B)‫(׀‬F ∩ G)(e)≠ ∅ },(F∩G)(e) ∩ H(e)≠ ∅ }

={ e∈A∩B)‫( ׀‬F ∩ G)(e)∩H(e)≠ ∅ }∩{ e∈C ‫( ׀‬F∩G)(e)∩H(e)≠ ∅ }

={ e∈A∩B∩C ‫( ׀‬F∩G)(e)∩H(e)≠ ∅ }

A'={ e∈A∩B∩C ‫( ׀‬F(e)∩G(e) ∩H(e)≠ ∅ }

R.H.S:

(F,A)∩ ((G,B) ∩ (H,B)) = B' he

B' = {e∈A∩B∩C ‫( ׀‬F(e)∩G(e) ∩H(e)≠ ∅ }

Therefore, A'= B' for any e∈ A' we have that

L (e) = (F ∩G)(e) ∩ H (e)

=F (e) ∩ G (e) ∩ H (e)

= F (e) ∩ (G (e) ∩ H (e))

15
.

= F (e) ∩ (G∩H) (e)

=R (e)

Therefore L (e)= R (e)

2. ((F,A)∪ (G,B)∪ (H,B) = (F,A)∪ (G,B)∪ (H,B))

L.H.S:

(F,A)∪ (G,B)∪ (H,B = A'

A'= {e∈∪C ‫( ׀‬F ∪ G)(e)∪H(e)≠ ∅ }, where =F∪G

={e∈ ‫(׀‬F∪G)(e)∪H(e)≠ ∅ }∪{e∈C‫(׀‬F∪G)(e)∪H(e)≠ ∅ }

= { e∈A∪B ‫(׀‬F∪G)(e)≠ ∅ },(F∪G)(e) ∪ H(e)≠ ∅ }

={ e∈A∪B)‫( ׀‬F ∪ G)(e)∪H(e)≠ ∅ }∪{ e∈C ‫(׀‬F∪G)(e)∪H(e)≠ ∅ }

={ e∈A∪B∪C ‫( ׀‬F∪G)(e) ∪H(e)≠ ∅ }

A' ={ e∈A∪B∪C ‫( ׀‬F(e)∪G(e) ∪H(e)≠ ∅ }

R.H.S:

(F,A)∪ ((G, B) ∪ (H, B)) = B'

B' = {e∈A∪B∪C ‫( ׀‬F (e)∪G(e) ∪H(e)≠ ∅ }

Therefore, A'= B' for any e∈ A' we have that

L (e) = (F∪G) (e) ∪ H(e)

=F (e) ∪ G (e) ∪ H (e)

= F (e) ∪ (G (e) ∪ H (e))

= F (e) ∪ (G∪H) (e)

=R (e)

16
.

Therefore L (e) = R (e)

Theorem: 3.1.10

For any soft sets (F, A), (G, B) and (H, C) Over U , We have that

1. ((F, A)∩ (G, B)) ∪ (H,C) = (F,A)∩((G, B)∪ ((F,A)∩ (H,C))

2. ((F, A)∪ (G, B)) ∩ (H, C)= (F,A)∪(G, B)∩ ((F,A)∪ (H,C))

Proof:

1. ((F, A)∩ (G, B)) ∪ (H,C) = (F,A)∩((G, B)∪((F,A)∩(H,C))

L.H.S

((F, A)∩ (G,B)) ∪ (H,C)= A'

A' = {e∈A∩(B∪H) ‫( ׀‬F(e)∩(G∪H) (e)≠ ∅ },

={ e∈(A∩B)∪ (A∩C) ‫(׀‬F(e)∩(G∪ H )(e)≠ ∅ }

={e∈( A∩B)‫ ׀‬F(e)∩(G∪ H )(e) ≠ ∅ }∪{e∈( A∩B∩C)‫ ׀‬F(e)

∩G( e)∪ H (e)≠ ∅ }∪

C
={e∈( A∩B∩ C )‫ ׀‬F(e)∩¿{e∈( A∩B∩C)‫ ׀‬F(e)
C
∪ G(e )∪ H (e )≠ ∅ }∪ {e∈( A∩ B ∩C)‫ ׀‬F(e)∩ H (e)≠ ∅

C
={e∈( A∩B∩ C )‫ ׀‬F(e)∩¿{e∈( A∩B∩C)‫ ׀‬F(e)∩G( e)≠ ∅ }∪ {e
C
∈( A∩ B ∩C)‫ ׀‬F(e)∩G(e)≠ ∅ ∪ {e∈( A∩B∩C)‫ ׀‬F(e)
∩ H (e)≠ ∅

=={e∈( A∩B)‫ ׀‬F(e)∩G( e)≠ ∅ }∪{e∈( A∩C)‫ ׀‬F(e)∩ H ( e ) ≠ ∅

A'= B'

R.H.S:

(F,A)∩(G, B)∪ ((F,A)∩ (H,C)) = B'

B' ={ e∈A∩B ‫(׀‬F(e)∩G( e)≠ ∅ } ¿ ∪{e∈ A∩C ‫ ׀‬F(e)∩ H (e)≠ ∅ }

Therefore A'= B' for any e∈ A' we have that

L (e) = F (e)∩ (G∪H)(e)

17
.

= ((F∩G)∪(F∪H))(e)

L (e) =R (e)

Theorem: 3.1.11

Let (F, A) and (G,B) be two soft sets over U. Then (G,B) = (F,A) C
if and only if (F,A) ∩(G,B) = (∅ , ∅ ) and (F,A)∪(G,B)=(U,E).

Proof:

To prove that (F,A) ¿ (G,B)   (F,A) ∩(G,B) = (∅ , ∅ )

If (G,B)= (F,A) C

By definition,

(F,A) ∩(G,B) = (∅ , ∅ ) and

(F,A)∪ (F C ,{ e∈A‫(׀‬F(e) = U}) = (U,E)

Conversly,

Assume that (F,A) ∩(G,B) = (∅ , ∅ ) and

(F,A)∪(G,B)= (U,E) where A∪B = U.

 F(e) = U For all e∈A\B and G(e) = U for all e∈B\A. ∀ e∈A∩B

Since, (F,A) ∩(G,B) = (∅ , ∅ ) and

(F,A)∪(G,B) = (U,E)

Therefore F(e)∪ G(e) = U and

F(e)∩ G(e) =∅

As neither F(e) nor G(e) is empty.

B= { e∈A ‫(׀‬F(e)¿U
}C , for any e∈B If e∈A.

C C
)
Then G(e) = (F(e) =
F (e), e∈B\A , then

18
.

C
G(e)=U =
F (e).
C C
 (F,A ) =( F ,{ e∈A ‫(׀‬F(e)¿U } ) = (G,B).
C

3.2 ALGEBRIC PROPERTIES OF SOFT SET OPERATIONS:

Property: 3.2.1 (Identity law)

For any soft set (F,A) Over U, we have that

1.(F,A) ∩(U,E) = ( F,A)

2.(F,A)∪(∅ , ∅ ) = (F,A).

Property: 3.2.2 (Domination law)

For any soft set (F,A) Over U, we have that

1.(F,A) ∩(∅ , ∅ ) = (∅ , ∅ )

2.(F,A)∪(U,E) = (U,E).

Property: 3.2.3 (Idempotent law)

For any soft set (F,A) Over U, we have that

1.(F,A) ∩(F,A) = (F,A)

2.(F,A)∪( F,A) = (F,A).

Property: 3.2.4 (commutative law)

For any soft set (F,A) and (G,B)Over U, we have that

1.(F,A) ∩(G,B) = (G,B) ∩(F,A)

2.(F,A)∪( G,B)= (G,B)∪(F,A).

Theorem:3.2.5

1.(F,A)∪ (F,A) = (F,A)

2.(F,A∪(F,A) = (F,A)

3. (F,A∪  = 

19
.

4. (F,A)∩  =
5. (F,A)∩ Ã= Ã, Where à is the absolute soft set

6. (F,A)∩ Ã = (F,A).

Example:3.2.6
Suppose that there are five wooden houses in the universe U given
by

U={
h1 , h 2 , h 3 , h 4 , h 5 }

Let A = {Brick, muddy, steel, stone} be the set of parameters

showing the building materials of the houses.}

Let B Not the set of parameters set. That is

B=  A = {not brick; not muddy; not steel; not stone}.

Let (F,A) and (G, B) be two soft set over the same universe, which
describes the “construction of the houses”.

The soft sets (F,A) and (G,B) can be regarded as collections of

approximations.

That is

(F,A)={ brick houses =  ,muddy houses=  ,steel houses =  ,

stone houses=  } and (G,B) = not the brick houses =U, not the muddy
houses= U, not the steel houses = U, not the stone houses= U },
By definitions,

A soft set (F,A) Over U is said to be a null soft set denoted by ,

if for all ε ∈A, F(ε ) =  , (null set).

20
.

A soft set (F,A) Over U is said to be a absolute soft set denoted by Ã,

if for all
ε∈ ε c
A, F( ) =U, . Ã =  and c = Ã.

Therefore (F,A) and (G,B) are null soft set and absolute soft set.

(F,A)∪ (G,B) = {brick houses=  , muddy houses=  , steel houses

=  , stone houses=  , not the brick houses =U, not the muddy houses=
U, not the steel houses = U, not the stone houses=U},
Clearly, (F,A)∪ (G,B) ≠ (G,B) which indicates that the assertion (5) is not
true in general.

Since A∩B=  , (F,A)∩ (G,B) is neither the null soft set (F,A) , not
the absolute soft set (G,B).

Theorem 3.2.7:
c c c
1.((F,A) ∪¿ )
G,B) =(F,A
) ∪
(G,B
)

c c c
2.( F,A) ¿∩ ¿ ) ) ∩
G,B) =(F,A ) (G,B
)

Proof:

Let (F,A) and (G,B) be the two soft sets over U

c c c
(i) ((F,A) ∪¿ )
G,B) = (F,A
) ∪
(G,B
)

L.H.S:

((F,A) ∪ ¿G,B) = (F ∪G),(A∪B))

= (H, A∪B)
= (H,C) where A ∪ B = C

F(e), if e ∈ A – B

H(e) = G(e), if e ∈ B – A , , ∀ e ∈ C,

21
.

F(e) ∪G(e), if e ∈ A∩ B

Therefore (F,A)∪ (G,B)c = ((F   G), A   B)c

= (H, A   B)c

= (Hc, (A   B)c)

= (Hc,  A    B)  (1)

(since (A   B)c =  A    B)

Now, Hc = U-H(e),  e   A    B)

Fe(  e), if  e   A -  B

He (  e) = Ge(  e), if  e   B -  A ,  e C

Fe(  e)   Gc (  e),if  e   A   B

R.H.S

(F,A)c ∪ (G, B)c = (Fc,Ac) ∪(Gc, Bc)

= (Fc,  A) ∪(Gc,  B)

= (K, (  A   B)),where K =(Fc  Gc)  (2)

Fe(  e), if  e   A -  B

K (  e) = Ge(  e), if  e   B -  A ,  e C

Fe(  e)   Gc (  e),if  e   A   B

From (1) and (2)

Hc and K are same.

22
.

Therefore ((F,A) ∪(G,B))c = (F,A)c∪ (G,B)c

(ii) (F,A) ∪(G,B))c = (F,A)c ∪(G,B)c

Let (F,A) and (G,B) be two soft sets over U.

L.H.S

(F,A)  (G,B) = (F  G, A  B)

= (H, A  B)

((F,A) ∪ (G,B))c = (H,A  B)c

= Hc, (A  B)c)

= (Gc,  A   B)  (3)

R.H.S

(F,A)c  (G,B)c = (Fc  A,)  (Gc,  B)

= ((Fc  Gc),  A   B)

= (K,  A  B)  (4)

From (3) and (4)

(F,A)  (G,B)c = (F,A)c  (G,B)c

Example:3.2.8

Suppose that there five houses in the universe U given by U = {h 1,

h2, h3, h4, h5} let A = {cheap. Beautiful} and B = {comfortable, beautiful}.

The soft sets (F, A) and (G, B) over the common universe U
describe the attractiveness of the houses.

23
.

The soft sets (F, A) and (G, B) as the following collections of

approximations:

(F,A) = {cheap houses = (h1, h2, h5}, beautiful houses = {h1, h2, h4}} and

(G,B) = { comfortable house = {h2, h5}, beautiful house = {h2,h4}.

Then

(F,A)  (G, B) = {cheap houses = {h1, h2, h3}, comfortable houses = {h2,
h5}, beautiful houses = {h1, h2, h4}

By definition,

The complement of a soft set (F,A) is denoted by (F, A) c and is

defined by (F,A)c = (Fc,  A),where Fc:  A  P(U) is mapping given by
Fc(  α) = the complement of F(α), for any α € A.

(F,A)c ∪ (G, B)c = (not cheap houses = {h2, h4}, not comfortable houses =
{h1, h3, h5}, not beautiful houses ={h3, h4}}.

We have,

(F,A)c = {not cheap houses = {h2, h4}, not beautiful houses = {h3, h5}}and

(G, B)c = {not comfortable houses = {h1, h3, h4}, not beautiful houses
= { h1, h3, h5}}.

Hence (F,A)c ∪ (G, B)c = {not cheap houses = {h2, h4}, not comfortable
houses = {h1, h 3, h4}, Not beautiful houses = {h1, h3, h5}}.

Therefore (F,A) ∪ (G,B) ≠(F,A)c ∪ (G,B)c.

Example: 3.2.9

24
.

Let E be the universe set of parameters and A = {e 1, e2, e3}, B = {e3,

e4, e5} be subsets of E. Let (F, A) and (G, B) be two soft sets over the same
universe U = {h1, h2, h3, h4, h5,h6}such that

F(e1) = {h1, h2}

F(e2) = {h3, h4}

F(e3) = {h2, h3,h6}

G(e4) = {h5}

G(e5) = {h6}

G(e3) = {h3, h4, h5, h6}

(F, A)  (G, B) = (H, A  B),

Where

F(e), if e  A – B

H(e) = G(e), ife  B – A ,  e  C,

F(e)  G(e), ife  A  B

Then

H(e1) = F(e1) = {h1, h2}

H(e4) = G(e4) = {h3}

H(e5) = G(e5) = {h5}

H(e3) = F(e)  G(e) = { h1,h3, h4, h5, h6}

Thus  e3   A   B

By definition,

25
.

The complement of a soft set (F, A) is denoted by (F,A) c and is

defined by (F,A)c = (Fc,  A), where Fc :  A  P(U) is mapping given by
Fc(  α) = the complement of F(α), for any α € A.

Hc(  e3) = U – H (e3) = {h1}

Let (Fc,  A) ∪ (Gc,  B) = K,  A   B), where

Fc(  e), if  e   A –  B

H(e) = Gc(  e), if  e   B –  A,  e  C,

Fc(  e)  Gc(  e), if  e   A   B

Then K(  e3)   A   B,

K(  E3) = Fc(  e3)  Gc(  e3)

= (U-F(e3))  (U-G(e3))

= {h1, h4,h5}  {h1, h2}

= {h1, h2,h4, h4, h5}.

Clearly, we have

K(  e3) ≠ Hc(  e3) for  e3   A   B.

Consequently, we deduce that

(F,A)  (G,B) ≠ (F,A)c  (G,B)c.

Theorem: 3.2.10

(i) (F,A)˅((G,B) ˅(H,C)) = ((F,A) ˅ (G,B)) ˅ (H,C)

(ii) (F,A)˄((G,B) ˄ (H,C)) = ((F,A) ˄ (G,B)) ˄ (H,C)

26
.

Proof:

Claim: (i) (F,A)˅((G,B) ˅(H,C)) = ((F,A) ˅ (G,B)) ˅ (H,C)

L.H.S:

(F,A)˅((G,B) ˅(H,C)) = ((F,A) ˅ (G˅H, B˅C)

= (F,A) ˅ (K, B×C)

(since (F,A) ˅(G,B) = (K,A×B))

= (F ˅K, A×B×C)

= (K', A×(B×C))

R.H.S: ((F,A)˅(G,B)) ˅(H,C) = (F˅G,A˅B) ˅ (H,C)

= (M, A×B) ˅(H,C)

= (M˅H, (A×B) ×C)

= (M',(A×B) ×C)

Since K and M' are same.

L.H.S = R.H.S

Therefore, (F,A)˅((G,B) ˅(H,C)) = ((F˅A,(G˅B)) ˅ (H,C)

(i) (F,A)˄((G,B) ˄ (H,C)) = ((F,A) ˄ (G,B)) ˄ (H,C)

L.H.S:

(F,A)˄((G,B) ˄ (H,C)) = (F,A) ˄ (G˄H, B˄C)

= (F,A) ˄ (K, B×C)

= F˄K, A ×(B×C))

27
.

= (K', A×(B×C))

((F,A)˄(G,B)) ˄ (H,C) = (F˄G, A˄ B) ˄ (H,C)

= (M, A×B) ˄ (H,C)

= (M˄H, (A×B) ×C)
Since K' and M' are same.
L.H.S = R.H.S
Therefore, (F,A)˄((G,B) ˄ (H,C)) = ((F,A) ˄ (G,B)) ˄ (H,C)

3.3 NEW OPERATIONS IN SOFT SET THEORY

Definition:3.3.1

The extended intersection of two soft sets (F, A) and (G, B) over a
common universe U is the soft set (H, C), where C = A  B, and for all e 
C,

F(e), if e  A – B,

H(e) = G(E), ife  B – A ,  e  C,

F(e)  G(e), ife  A  B

We write (F, A)  e (G,B) = (H,C).

Definition: 3.3.2

Let (F, A) and (G, B) be two soft sets over a common universe U
such that A  B ≠  . The restricted intersection of (F,A) and (G, B) is
denoted by (F,A) Ó (G,B), and is defined as (F, A)(G,B) = (G,C), where C =
A  B and for all c  C,

H(c) = F( c)  G(c)

Definition: 3.3.3

28
.

Let (F,A) and (G,B) be two soft sets over the same universe U such
that A  B≠  . the restricted difference of (F, A) and (G, B) is denoted by

(F,A)   (G,B), and is defined as (F,A)   (G,B) = (H,C), where C = A  B

and for all c  C, H(c) = F(c), the difference of the sets F(c) and G(c).

Definition: 3.3.4

Let U be an initial universe set, E be the universe set of parameters,

and A  E.

(a) (F,A) is called a relative null soft set (with respect to the parameter
set A), denoted by  A, if F(e) =  for all e  A.
(b) (G,B) is called relative whole set (with respect to the parameter set
B), denoted by UA, if F(e) = U for all e  A.

Definition: 3.3.5

The relative complement of a soft set (F,A) is denoted by (F, A) r =

(Fr,A) where Fr:A  P(U) is a mapping given by Fr(α) = U – F(α) for all
α  A.

Definition:3.3.6

Let (F, A) and (G, B) be two soft sets over a common universe U
such that A  B≠  . the restricted union of (F, A) and (G, B) is denoted by
(F, A)   (G, B), and is defined as (F, A)   (G, B) = (H,C) where cA 
B and for all c  C, H(c) = F(c)  G(c).

3.4 DE MORGAN’S LAWS IN SOFT SET THEORY

Theorem: 3.4.1

(i) ((F,A)   (G,B))r =(F,A)r Ó (G,B)r

(j) ((F,A) Ó (G,B)r = ((F,A)r   (G,B))

29
.

Proof:

(i) ((F,A)   (G,B))r =(F,A)r Ó (G,B)r

Let (F, A) and (G,B) be two soft sets over U such that A  B≠  .the
restricted union of two soft set (F,A) and (G, B) is defined as

(F,A)   (G,B) = (H,C) where C = A  B

 H(c) = F(c)  G(c),  c  C

Since ((F, A)   (G, B)r = (H,C)r

= (Hr,C)

By definition,

Hr (c) = U- (F(c)  G(c))

= (U-F(c))  (U-G(c)),  c  C

Now,

(F,A)r Ó (G,B)r = (Fr,A) Ó (Gr,B)

= (K,C), where C = A  B

By definition,

K(c) = Fr(c)  Gr(c)

= (U – F(c)  (U – G(c))

= Hr(c),  c  C

Hence ((F,A)   (G,B))r = (F, A)r Ó (G,B)r

(iii) ((F,A) Ó (G,B))r = (F, A)r   (G,B)r

30
.

Let (F,A) and (G,B) be two soft sets over U. such that A  B≠
.

The restricted union of two soft sets (F,A) and (G,B) is

defined as

 H(c) = F(c)  G(c),  c  C

Since ((F, A) Ó (G,B))r = (H,C)r

= (Hr, C)

Hr(c) = U – (F(c)  G(c)

= (U-F(c))  (U-G(c)),  c  C

Now ((F,A)r   (G,B))r = (Fr, A)   (Gr,B)

= (K,C) where C = A  B

By definition,

K(c) = Fr(c)  Gr(c)

=(U – F(c))  (U – G(c))

= Hr(c),  c  C

Hence ((F,A) Ó (G,B)r = (F,A)r   (G,B)r

Theorem:3.4.2

Let (F, A) and (G,B) be two soft sets over a common universe
U. then we have

31
.

(i) ((F, A) ∪ (G, B))c = (F,A)c  e (G,B)c

(ii) ((F,A)  e (G,B))c = (F,A)c  (G,B)c

Proof:

(i) ((F, A) ∪ (G,B)c = (F,A)c  e (G,B)c

Let (F, A) and (G, B) be two soft sets over a common universe U.

Suppose that,

(F,A) ∪ (G, B) = (H,A  B)

= (H,C), where C = A  B

F(e), if e  A – B

H(e) = G(e), ife  B – A ,  e  C,

F(e)  G(e), ife  A  B

Therefore (F, A) ∪ (G,B)c = (H, A  B)c

=
(Hc,  A   B)

(since (A  B)c =  A   B)

Now,

Hc = U-H(e),  e   A   B)

Fc(  e), if  e   A –  B

Hc(  e) = Gc(  e), if  e   B –  A ,  e  C,

32
.

Fc(  e)  G(  e), if  e   A   B

Since (F, A)c  e (G,B)c = (Fc, Ac)  e (Gc, Bc)

= Fc,  A)  e (Gc,  B)

= K,  A   B), where K = (Fc  Gc)  (2)

Fc(  e), if  e   A –  B

H(  e) = Gc(  e), if  e   B –  A ,  e  C,

Fc(  e)  G(  e), if  e   A   B

From (1) and (2)

Hc and K are same.

Hence ((F,A) ∪ (G,B))c = (F,A)c  e (G, B)c

(ii) ((F,A)  e (G,B))c = (F,A)c  (G, B)c

Let (F,A) and (G, B) be two soft sets over a common
universe U.

Suppose that,

That extended intersection of two soft sets (F,A) and (G,B) is

defined as (F,A)  e (G,B) = (G, A  B)

= (G,C), where C = A  B

F(e), if e  A – B

33
.

H(e) = G(E), ife  B – A ,  e  C,

F(e)  G(e), ife  A  B

Since ((F,A)  e (G,B))c = (H, A  B)c

= (Hc,  A   B)

= (Hc,C) where C=  A   B  (1)

Now

Fc(  e), if  e   A –  B

H(  e) = Gc(  e), if  e   B –  A ,  e  C,

Fc(  e)  Gc(  e), if  e   A   B

And (F,A)c  (G,B)c = (Fc, Ac)  (Gc, Bc)

= (Fc,  A)  (Gc,  B)

= (K,  A   B), where K = Fc  Gc)  (2)

Fc(  e), if  e   A –  B

H(  e) = Gc(  e), if  e   B –  A ,  e  C,

Fc(  e)  Gc(  e), if  e   A   B

From (1) and (2)

Hc and K are same.

Hence ((F,A)  e (G,B))c = (F,A)c  (G, B)c

34
.

CHAPTER 4

SIMILARITY IN SOFT SET THEORY

4.1 SIMILARITY IF SOFT SET THEORY

Definition: 4.1.1

Let (F, A) and (G, B) be soft sets over a common universe set U.

then (F,A) is similar to (G, B) if there exists a bijective function  :A  B

such that F(α) = (Go  )(α) for every α € A,where (Go  )(α) =G(  (α)).

Example: 4.1.2

Let U = (d1, d2, d3, d4, d5, d6) be the set of dressed under consideration.

And E = {e1,e2, e3, e4, e5} be the set of five parameters,

Where e1 stands for expensie,

e2 stands for cheap,

e3 stands for beautiful,

e3 stand for elegant,

e5 stand for classical.

Let A = {e1, e2, e3} and B ={e1, e4 e5}.

For A  E, F(e1) = {d2}; F(e2) = {d3, d4,d5};F(e3) = {d1,d3}.

B  E, G(e1) = {d2}; G(e2) = {d1, d3}; G(e3) = {d3,d4,d5}.

Then the soft set (F, A) and (G,A) are not equal because of A≠B.

consider a function  : A  B defined by  (e1) = e1,  (e2) = e5,  (e5) =e4;

35
.

Then  is bijective and F(ei ) = (Go  )(ei) for every ei €A.

So (F,A)  (G,B)

Definition: 4.4.3

The relative complement of (F, A) is denoted by (F,A) r and is

defined by (F, A)r = (Fr,A), where Fr: A  P(U) is a mapping given by Fr(α)
= U – F(α) for all α € A.

Example: 4.1.4

Let (F, A) be a soft set over U.

U is the set of houses.

E is the set of parameters.

E = {expensive; beautiful; woodern; cheap; in the green surrounding;

modern; in good repair; in bad repair}.

The soft set (F,E) describes the “ attractiveness of the houses”

Let U = {h1, h2, h3, h4, h5}

A = {e2, e3, e4, e5, e7}

F(e2) = {h2,h3, h5}

F(e3) = {h2,h4}

F(e4) = {h1}

F(e5) = U

F(e7) = {h3, h5}

(F, A)r = (Fr, {e1, e2, e3, e4, e6, e7, e8}

36
.

Fr(e1) = U

Fr(e3) = {h1, h3, h5}

Fr(e4) = {h2, h3, h4,h5}

Fr(e6) = U

Fr(e7) = {h1, h2, h4}

Fr(e8) = U

Remark: 4.1.5

For a soft set (F, A) since  A≠A in general, the complements (F, A)c and
(F, A)r are not always equal.

Theorem: 4.1.6

Let (F,A) be a soft set over a common universe U. then (F,A)r  (F,A)c.

Proof:

Let (F, A) be a soft set over a common universe U. we show that (F,A)r  (F,A)c

(F,A)r  (Fc,  A)

Let us consider a function  : A   A and defined as  (α) = (  α)for α  A.

Then obviously  is bijective.

From α =   α

=  (  (α)) and  (α) =  α   A.

By definition,

Fr(α) = U – F(α)

= U – F(   α)
37
.

= U – F(   (α))

= Fc (  (α))

Fr(α) = (Fc ο  )(α)

Fr = (Fc o  )for α  A.

Hence (F, A)r  (F,A)c

Remark: 4.1.7

Let (F, A) and (G, B) be soft sets over a common universe set U. if
A≠B, generally A×B≠B×A. then (F,A) ˅(G, B) ≠ (G, B) ˅ (F,A) and

(F,A) ˄(G, B) ≠ (G, B) ˄ (F,A).

Theorem:4.1.8

Let (F,A), (G,B) and (G,C) be soft over a common universe set U.

If (F,A)  (G, B) and (G,B)  (H,C) then (F,A)  (H,C).

Proof:

Let (F, A),(G, B) and (H,C) be soft sets over a common universe set U.

Since (F, A)  (G, B)

By definition,

There exist a bijective function  :A  B such that F(α) Go  ) (α) for

every α  A.

Similarly,

(G,B)  (G,C)

38
.

There exist a bijective function  : B  C such that F(β) = (Go  )( β) for

every β  B.

Then (F, A)  (H, C).

Theorem: 4.1.9

Let (F, A) and (G, B) be soft sets over a common universe set U and A,B  E.

Then

(a) (F,A) ˅(G,B)  (G,B) ˅(F,A)

(b) (F,A) ˄(G,B)  (G,B) ˄(F,A)

Proof:

Let (F, A) and (G, B) be soft sets over a common universe set U and
A,B  E.

a) (F,A) ˅(G,B)  (G,B)˅(F,A)

(F,A)˅(G,B) = N(K,A×B) and
(G,B) ˅(F,A) = (K', B×A).

Let a function  : A×B  B×A be defined as  (‹α,β›) = (α,β); then  is

bijective.

For every ‹α,β›  A×B, K‹α,β› = F(α)  G(β) = G(β)  F(α)

= K'(β,α)

= K' (  (‹α,β›))

= (Go  )(‹α,β›)

And consequently, (F,A) ˅(G,B)  (G,B) ˅(F,A)

(F,A) ˄(G,B)  (G,B) ,(F,A)

39
.

(F,A) ˄(G,B) = (K,A×B) and

(G,B) ˄(F,A) = (K', B×A).

Let a function  : A×B  B×A be defined as  (‹α,β›) = (α,β); then  is

bijective.

For every ‹α,β›  A×B, , K‹α,β› = F(α)  G(β) = G(β)  F(α)

= K' (β,α)

= K' (  (‹α,β›))

= (Go  ) (‹α,β›)

(c) And consequently, (F,A) ˄(G,B)  (G,B) ˄(F,A)

4.2 MODIFIED OPERATIONS AND SIMILARITY

Definition: 4.2.1

Let E be a set of parameters and A,B  E.for ‹α,⛀ A×B, is called

the conjunction parameter of ordered pair parameter ‹α,β› and (α or β) is
called the disjunction parameter of ordered pair parameter ‹α,β›. The
conjuction parameter (α or β)of ordered pair parameter ‹α,β› is denoted by
(α ˄ β) and the disjunction parameter (α or β) of ordered pair parameter
‹α,β› is denoted by (α ˅ β). For every ‹α,⛀ A×B, we will denote the set of
all (α ˄ β) ((α ˅ β)) as the following:

A  B = {( α ˄ β) |  α, β  € A ×B};

A  B = {( α ˅ β) |  α, β  € A ×B};

40
.

Remark: 4.2.2

Let E be a set of parameters and A,B  E. then A  B, A  B  E and

in general, (α ˄ β) ≠ (β˅α) and (α ˅ β) ≠ (β˅α) for  α, β  € A ×B. the cases

(α ˄ α) and (α ˅ α) will be denoted simply by (α) for α € E.

Definition: 4.2.3

Let E be a set of parameters and A, B  E.

 For ( α ˅ β) € A  B,  (α ˄ β) = (  α ˄  β) €  A   B.
 For ( α ˄ β) € A  B,  (α ˄ β) = (  α ˄˅  β) €  A   B.
  (A  B) = {  ( α ˄ β) | ( α ˄ β) € A  B}.
  (A  B) = {  ( α ˅ β) | ( α ˅ β) € A  B}.

Example: 4.2.4

Let A = {expensive; cheap; beautiful} and B = {modern; beautiful}.

Then

A  B = {(expensive and modern); (expensive and beautiful); (cheap

and beautiful); (beautiful and modern); (beautiful and beautiful)}.

A  B = {(expensive or modern); (expensive or beautiful); (cheap or

beautiful); (beautiful or modern); (beautiful or beautiful)}.

 (A  B) = {(not expensive or not modern); (not expensive or not

beautiful);(not cheap or not beautiful); (not beautiful or not modern);

(not beautiful or not beautiful)}.

41
.

LEMMA: 4.2.5

Let E be a set of parameters and A, B  E. then

(a) ( α ˄ β)  (A  B) iff   α ˅  β    A   B
(b) ( α ˅ β)  (A  B) iff   α ˄  β    A   B

Proof:

Let E be a set of parameters and A, B  E.

a) ( α ˄ β)  (A  B) iff (  α ˅  β)   A   B

Let us assume that ( α ˄ β)  (A  B)

To prove that

(  α ˅  β)   A   B

We know that,

( α ˄ β)  (A  B),  (α ˄ β) (  α ˅  β)   A   B

Therefore, (  α ˅  β)   A   B

 ( α ˄ β)  (A  B) => (  α ˅  β)   A   B

Conversely, (  α ˅  β)   A   B

We know that,

Let ( α ˅ β)  (A  B) ,   α ˅ β  = (  α ˄  β)   A   B

Therefore,   α ˅ β  = (  α ˄  β)   A   B

   α ˅ β  = (   α ˄   β)    A    B

42
.

By known theorem,

 (  A) = A and  (  B) = B

 (   α˄   β)    A    B

(α ˄ β)  A  B

 (  α ˅  β)   A   B => ( α ˄ β)  (A  B)

 (α ˄ β)  (A  B) <=>   α ˄  β    A   B

b) ( α ˅ β)  (A  B) iff   α ˄  β    A   B

Let us assume that ( α ˅ β)  (A  B)

To prove that

(  α ˄  β )  A   B

We know that,

For ( α ˅ β)  (A  B) ,   α ˅ β  = (  α ˄  β)   A   B

Therefore (  α ˄  β)   A   B

 ( α ˅ β)  (A  B) => (  α ˄  β)   A   B

Conversely,

  α ˄ β  A B

We know that,

For ( α ˄ β)  (A  B) ,   α ˄ β  = (  α ˅  β)   A   B

Therefore,   α ˄ β  = (  α ˅  β)   A   B

43
.

   α ˄  β  = (   α ˅   β)    A    B

By known theorem,

 (  A) = A and  (  B) = B

 (   α ˅   β)    A    B

 ( α ˅ β)  (A  B)

 (  α ˅  β)   A    B => ( α ˅ β)  (A  B)

 ( α ˅ β)  (A  B)  (  α ˅  β)   A    B

Theorem: 4.2.6

Let E be a set of parameters and A, B  E. then

a)  (A  B) =  A   B
b)  (A  B) =  A   B

Proof:

a)  (A  B) =  A   B
Let E be a set of parameters and A, B  E.

By definition,

  (A  B) = {  ( α ˄ β) | ( α ˄ β) € A  B}.
 For ( α ˅ β)  (A  B) ,  (α ˄ β) = (  α ˅  β)   A   B.
Therefore,  (A  B) =  (α ˄ β) = (  α ˅  β)   A   B.
  (A  B) = (  α ˅  β)   A   B.

Therefore,  (A  B) =>  A   B

44
.

Conversely,

(  α ˅  β) €  A   B.

Now  ( α ˅ β)   (A  B)

By definition,

( α ˅ β)€ (A  B) ,  (α ˅ β) = (  α ˄  β) €  A   B.

 (α ˅ β) = (  α ˄  β) €  A   B.

(  α ˅  β) = (  α ˄  β) €  A   B.

(  α ˅  β) =  A   B €(  A   B)

Therefore,  A   B €(  A   B)

 A   B => (  A   B)

Hence  (A  B)   A   B

 (A  B)   A   B

a)  (A  B)   A   B
Let E be a set of parameters and A, B  E.

By definition,

  (A  B) = {  ( α ˅ β) | ( α ˅ β) € A  B}.
 For ( α ˅ β)€ (A  B) ,  (α ˅ β) = (  α ˄  β) €  A   B.
Therefore,  (A  B) = {  ( α ˅ β) | ( α ˄ β) € A  B}.
  (A  B) = (  α ˄  β)   A   B

Therefore,  (A  B) =>  A   B

45
.

Conversely,

(  α ˄  β) €  A   B.

Now  ( α ˅ β)   (A  B)

By definition,

( α ˅ β) € (A  B),  (α ˄β) = (  α ˅  β) €  A   B.

 (α ˄β) = (  α ˅  β) €  A   B.

(  α ˄  β) = (  α ˅  β) €  A   B.

(  α ˄  β) =  A   B €(  A   B)

Therefore, = (  α ˄  β) €(  A   B)

 A   B => (  A   B)

Hence  (A  B)   A   B.

 (A  B) =  A   B.

Hence proved.

Definition: 4.2.7

Let (F,A) and (G, B) be soft sets over a common universe set U.

(a) (F, A)  (G, B) is a soft set defined by (F, A)  (G, B) = (K, A  B),
Where K: A  B  P(U) is a mapping given by K((α ˄ β)) = F(α)  G(β)
for any (α ˄ β) € A  B, where  is the intersection operation of sets.
(b) (F, A)  (G, B) is a soft set defined by (F, A)  (G, B) = (H, A  B),
Where H: A  B  P(U) is a mapping given by H((α ˅ β)) = F(α)  G(β)

46
.

For any (α ˅ β) € A  B, where  is the union operation of sets.

Example: 4.2.8

Let U = {d1, d2, d3, d4, d5, d6}be the set of dresses under
consideration. And E = {e1, e2, e3, e4, e5} be the set of five parameters.

Where e1 stands for expensive.

e2 stands for cheap,

e3 stands for beautiful,

e4 stands for elegant,

e5 stands for classical.

Let C = {e2, e3}  E and D = {e1,e2, e3}  E; then

C  D = {(e1), (e3), (e1 ˄ e3),(e1˄ e5), (e3˄e1), (e3,e5)}.

Consider soft sets (L,C) and (M,D) defined as

L(e1) {d2, d4}, L(e4) {d3, d4,d5};

M(e1) {d1,d2, d4}, M(e2) {d1, d5};

M(e3) {d2,d3,d4,d5}, M(e5) {d1, d2}.

(L,C)  (M,D) = (K, C  D), where K: C  D  P(U) is a mapping defined

by

K((α ˄ β)) = L(α)  M(β) for any (α,β) € C  D.

K((e1)) = L(e1)  M(e1) = {d2, d4}.

K((e3)) = L(e3)  M(e3) = {d3, d4,d5}.

47
.

K((e1 ˄ e3)) = L(e1)  M(e3) = {d2, d4}.

K((e1 ˄ e5)) = L(e1)  M(e5) = {d2}.

K((e3 ˄ e1)) = L(e1=3)  M(e1) = {d4}.

K((e3 ˄ e5)) = L(e3)  M(e5) =  .

Remark: 4.2.9

Let (F,A) and (G, B) be soft sets over a common universe set U, A,

B  E and A ≠ B. for ( α ˅ β) € A  B, the conjunction parameter ( α ˅ β)

of the ordered pair parameter ( α, β)could not be an element of A  B. so

(F,A) ˄(G,B) ≠ (F,A)  (G,B) and (F, A) ˅ (G, B) ) ≠ (F,A)  (G,B).

Theorem: 4.2.10

Let (F, A) and (G, B) be soft sets over common universe set U. then

(a) (F,A) ˄(G,B)  (F,A)  (G,B)

(b) (F,A) ˅(G,B)  (F,A)  (G,B)

Proof:

Let (F,A) and (G,B) be soft over a common universe set U.

(a) (F,A) ˄(G,B)  (F,A)  (G,B)

Let (F, A) ˄(G,B) = (F˄G, A˄B)

= (H, A×B) where H = F˄G

And (F, A)  (G,B) = (F  B, A  B)

= (K, A  B)

48
.

By definition,

Consider a function  :A×B  A  B defined by  ( α, β) = ( α ˄ β).

Then  is bijective.

We know that, (F, A) ˄(G,B) = (H, A×B), where H(α, β) = F(α)  G(β) for
any α  A,β  B.

Therefore H(α, β) = F(α)  G(β).

= K( α ˄ β)

= K(  (α ˄ β))

H(α, β) = (Ko  )(α, β)

Hence (F,A) ˄(G,B)  (F,A)  (G,B).

b) (F,A) ˅(G,B) = (F,A)  (G,B)

Let (F, A) ˅ (G,B) = (F˅G, A˅B)

= (H, A×B) where H=F˅G

And

(F, A)  (G,B) = (F  G, A  B)

= (K, A  B)

By definition,

Consider a function  :A×B  A  B defined by  ( α, β) = ( α ˄ β).

Then  is bijective.

We know that,

(F, A) ˅(G,B) = (H, A×B), where H(α, β) = F(α)  G(β) for any α  A,β  B.
49
.

Therefore K(α, β) = F(α)˅ G(β).

= K( α ˅ β)

= K(  (α ˅ β))

H(α, β) = (Ho  )(α, β)

Hence (F,A) ˅(G,B)  (F,A)  (G,B).

Theorem: 4.2.11

let (F,A) and (G, B) be soft over a common universe set U. then

a) (F,A)  (G,B)  (F,A)  (G,B)

b) (F,A)  (G,B)  (F,A)  (G,B)

Proof:

Let (F,A) and (G, B) be soft sets over a common universe set U.

a) (F,A)  (G,B)  (G,B)  (F,A)

b) (F,A)  (G,B) = (K, A  B)

By definition,

Let us define a function  A  B  B  A, and  (α, β) =(α ˄ β) for

any for any α  A,β  B.

(G,B)  (F,A) = (H, B  A)

Therefore  (α˄ β) =(α ˄ β). Then  is injective.

K(α ˄ β) = F(α)  G(β).

= G(β)  F(α)

50
.

= H(β˄ α)

= H(  (α˄ β))

K(α ˄ β) = (Ho  (α,β)

And consequently,

a) (F,A)  (G,B)  (G,B)  (F,A)

b) (F,A)  (G,B)  (G,B)  (F,A)
(F,A)  (G,B) = (K, A  B)

By definition,

Let us define a function Let us define a function  A  B  B  A,

and  (α, β) =(α ˅ β) for any for any α  A,β  B.

(G,B)  (F,A) = (H, B  A)

Therefore  (α˅ β) =(α ˅ β). Then  is injective.

H(α ˄ β) = F(α)  G(β).

= G(β)  F(α)

= K(β˄ α)

= K(  (α, β))

K(α ˄ β) = (Ko  (α, β)

51
.

And consequently,

(F,A)  (G,B)  (G,B)  (F,A)

Theorem: 4.2.12

Let (F,A) and (G,B) be soft sets over a common universe set U. then

a) ((F,A)  (G,B))c  (F,A)c  (G,B)c

b) ((F,A)  (G,B))c  (F,A)c  (G,B)c

Proof:

Let (F,A) and (G,B) be soft sets over a common universe set U.
then

a) ((F,A)  (G,B))c  (F,A)c  (G,B)c

By definition,

(F,A)c = (Fc,  A) where Fc:  A  P(U) is a mapping given by Fc( 

α) = Fc(α) for all α €A.

(F,A)c = (Fc,  A)and

(G,B)c = (Gc,  B)

Therefore ((F,A)  (G,B))c = (Fc, A)  (Gc, B)

= (K,  A   B)

= (K,  A   B)

And (F,A)  (G,B) = (H, A  B)

((F,A)  (G,B))c = (H, A  B)c

52
.

= (Hc,  A   B)

= (K,  A   B)

So we have,

(K,  A   B) = (Hc,  A   B)

By definition,

α ˅ β€ A  B =>  (α˅β)€  (A  B)

we know that,

α ˄ β€ (A  B)  (  α˅  β)   A   B

 K(  A   B) = Fc  α)  Gc(  β) for (  α˅  β)   A   B)

=(U – F(   α))  (U – G(   β))

For (  α˅  β)   A   B

= (U – F(α))  (U – G(β))for (  α˅  β)   A   B

= U – F(α)  G(β))for (  α˅  β)   A   B

= U – H(α˄β)fo (α˄β)  ( A  B)

= U – H (   (α˄β)) for (α˄β)  ( A  B)

= U – H (  (  α˅  β)) for (  α˄  β)   A   B

= Hc (  α˅  β) for (  α˅  β)   A   B

 (K,  A   B) = (Hc,  A   B)
Let (F, A) and (G,B) be soft sets over a common universe set U.

to prove that,

53
.

(b) ((F,A)  (G,B))c  (F,A)c  (G,B)c

By definition,

(F, A,)c = (Fc,  A) where Fc:  A  P(U) is a mapping given by

Fc(  α) = Fc(α) fo all α€A.

(F, A,)c = (Fc,  A)and

(G, B,)c = (Gc,  B)

Therefore ((F,A)  (G,B))c = (Fc,A)  (Gc,B)

= (K,  A   B)

= (K,  A   B)

And (F,A)  (G,B) = (H,A  B)

((F,A)  (G,B))c = (H,A  B)c

= (Hc,  A   B)

= (K,  A   B)

So we have,

(K,  A   B) =(Hc,  A   B)

By definition,

α ˄ β€ A  B =>  (α˄β)€  (A  B)

we know that,

54
.

(α ˅ β) € (A  B)  (  α˅  β)   A   B

 K(  α˄  β) = Fc (  α)  Gc(  β) for (  α˅  β)   A   B)

=(U – F(   α))  (U – G(   β))

For (  α˄  β)   A   B

= (U – F(α))  (U – G(β))for (  α˄  β)   A   B

= U – F(α)  G(β))for (  α˄  β)   A   B

= U – H(α˅β)fo (α˅β)  ( A  B)

= U – H (   (α˅β)) for (α˅β)  ( A  B)

= U – H (  (  α˄  β)) for (  α˄  β)   A   B

= Hc (  α˄  β) for (  α˄  β)   A   B

 (K,  A   B) = (Hc,  A   B)

Hence proved.

Theorem: 4.2.12

Let (F,A) and (G,B) be soft sets over a common universe set U. then

a) ((F,A)  (G,B))r  (F,A)r  (G,B)r

b) ((F,A)  (G,B))r  (F,A)r  (G,B)r

proof:

let (F, A) and (G, B) be soft sets over a common universe setU.

To prove that,

a) ((F,A)  (G,B))r  (F,A)r  (G,B)r

55
.

(F,A)  (G,B) = (K, A  B)

((F,A)  (G,B))r = (K, A  B)r

=(Kr, A  B)

By definition,

The relative complement of (F, A) is denoted by (F, A) r and is

defined by (F,A)r = (Fr A), where Fr: A  P(U) is a mapping given by Fr(α)
= U –F(α) for all α  A.

Since (F,A)r  (G,B)r  (Fr,A)  (Gr,B)

=(H, A  B)

From A  B ≠ A  B

Therefore ((F,A)  (G,B))r ≠ (F,A)r  (G,B)r

Now we show that,

(Kr, A  B)  (H, A  B)  : A  B  A  B defined by  (α˅β) =

(α˄β) for every (α˅β)  A  B = U – K (α˅β)

= U – F (α)  G(β)

= (U – F (α))  (U - G(β))

= Fr(α)  Gr(β) for (  (α˅β) = (α˄β)  A  B

= H (α˄β) for  (α˅β) = (α˄β)  A  B

= H(  (α˅β)for (α˅β)  A  B,(  (α˅β) = (α˄β)  A  B

Kr(α˅β) = (Ho  )(α˅β) for (α˅β)  A  B

56
.

((F,A)  (G,B))r ≠ (F,A)r  (G,B)r

To prove that,

b) ((F,A)  (G,B))r  (F,A)r  (G,B)r

(F,A)  (G,B) = (K, A  B)

((F,A)  (G,B))r = (K, A  B)r

=(Kr, A  B)

By definition,

r
The relative complement of (F,A) is denoted by (F, A) and is
defined by (F,A)r = (Fr,A), where Fr: A  P(U) is mapping given by Fr(α) =
U –F(α) for all α  A.

Since (F,A)r  (G,B))r = (Fr,A)  (Gr,B),

=(H, A  B)

From A  B ≠ A  B

Therefore ((F,A)  (G,B))r ≠ (F,A)r  (G,B)r

Now we show that,

(Kr, A  B)  (H, A  B)

Let us consider a function  : A  B  A  B defined by  (α˄β) = (α˅β)

for every (α˄β)  A  B. then  is bijective. For any(α˄β)  A  B

Therefore Kr, (α˄β) = U – K (α˄β)

= U – F (α)  G(β)

= (U – F (α))  (U - G(β))
57
.

= Fr(α)  Gr(β) for (  (α˄β) = (α˄β)  A  B

= H (α˄β) for  (α˅β) = (α˄β)  A  B

= H(  (α˄β)for (α˄β)  A  B,(  (α˅β) = (α˄β)  A  B

Kr(α˄β) = (Ho  )(α˄β) for (α˄β)  A  B

Thus ((F,A)  (G,B))r ≠ (F,A)r  (G,B)r

Hence proved.

4.3 APPLICATION OF SOFT SET:

Soft set theory has potential applications in many different fields

which include the smoothness of function, game theory, operations
research, Riemann integration, perron integration, probability theory, and
measurement theory.

In [1] application of soft set to stability and regularization, game

theory and operational research are di and operational research are
discussed in details. Extension of soft set theory to real analysis set theory
to real analysis and its application were also presented. Also, applications
of soft set theory to the problems of soft set theory to the problems of
medical diagnosis in medical expert systems of medical diagnosis in
medical expert system was discussed in [1].

Application of soft set theory in other disciplines and real problems

are now catching momentum, maji et at.[2], in 2002, gave first pratical
58
.

application of soft sets in decision making problems. It is based on the

notion of knowledge of reduction in rough set theory. Soft set theoretic
approach for dimensionality for dimensionality reduction and fuzzy
parameterized fuzzy soft set theory and for were discussed. Soft set theory
is applied to commutative ideals in BCK-algebras. The notion of
commutative soft ideals and commutative idealistic and soft BCK-algebras
are introduced. Example to show that there is no relations between positive
implicative idealistic soft BCK-algebras and commutative idealistic soft
BCK-algebras is provided.

The concept of soft set relations and fuzzy soft relations were
discussed and applied in decision making problem applied in a decision
making problem. Soft set theory based classification algorithm was
proposed in which can be applied to texture classification. This proposed
algorithm has very low computational complexity when compared with
Bayes used to initiate the study of semi rings.

The notions of soft semi rings, soft sub rings, soft ideals, idealistic
soft semi rings and soft semi ring homomorphism’s are introduced and
several related properties are investigated. On the other hand, semi rings
have been found useful for dealing with problems in different areas of
applied mathematics and information science, as the semi ring structure
provides an algebraic framework for modeling and investigating the key
factors in these problems. The application of semi rings to area such as
optimizing theory, graph application of semi rings to area such as
optimizing theory, graph theory of discrete event dynamical theory formal
language theory, coding theory and analysis of computer programs have
been extensively studied in the literature.

59
.

CHAPTER 5
CONCLUSION

This dissertation is the study of soft sets, soft subset, the

complement of a soft set, null soft set and some new operations on soft set,
similarity in soft sets in soft set theory. It contains some substantial
results and hence further research can be undertaken based on these results.

60
.

REFERENCES:
[1] D.Molodtsov ,”Soft set theory-first results”, Computer and
Mathematics With Applications.37(1999)19-31.

[2] P.K.Maji, R.Biswas, A.R.Roy, On Soft set theory, Computer

Mathematics with Applications.45(2003)555-562.

[3] H.Aktas and N.Cagman, “Soft sets and Soft group”,

Information Sciences.3329-3332(2007).

[4] C.F.Yang, A note on soft set theory, computer Mathematics

With Applications.56(2008)1899-1900.

61
.

[5] M.I.Ali, F.Feng, X.Liu, W.KMin, M.Shabir, On Some new

operations in soft set theory, computer and mathematics with
applications.57(2009)1547-1553.

[6] M.I.Ali, ”a note on soft sets ,rough soft sets and fuzzy soft
sets”, Applied Soft Computing Journal.3329-3332(2011).

[7] S.Alkhazalah and A.R.Salleh, “SOFT EXPERT SETS “ ,

advances in decision science. (2011)

[8] M.I.Ali, “ Another view on reduction of parameters in soft sets”

Applied Soft Computing. 1814-1821 (2012)

[9] Y.B.Jun and C.H PARK, “Applications of soft set in ideal

theory of BCK\BCI – algebras”, information science .
2466-2475(2008).

[10] P.K.Maji, R.Biswas, and A.R.Roy, Soft set theory”, computer

and mathematics with applications.555-562 (2003).

[11] W.K. Min, “ Similarity in Soft set theory”, Applied Mathematics

letters. 310-314(2012).

[12] Z.Kong, L.Gao, L.Wang, and S.Li, “The Normal parameter

Reduction of soft set and its algorithm”, computer Mathematics
with applications. 3029-3037(2008).

62
.

[13] A.Sezgin and A.O.Atagun. on operation of soft sets, computer

and mathematic with applications. 1457-1467 (2011).

[14] Z.Pawlak, Hard And Soft sets , proceddings of the International

EWorkshop on Rough Sets And knowledge Discovery,
Banff,1993.

63