International Refereed Journal of Engineering and Science (IRJES) ISSN (Online) 2319-183X, (Print) 2319-1821 Volume 3, Issue 2 (January

2014), PP.65-74

Intuitionistic fuzzy g - closed sets

M. Thirumalaiswamy
Department of Mathematics, NGM College, Pollachi - 642 001, Tamil Nadu, India. Abstract:- In this paper, we introduce and study the notions of intuitionistic fuzzy g -closed sets and intuitionistic fuzzy g -open sets and study some of its properties in Intuitionistic fuzzy topological spaces.
0

Keywords and Phrases:- Intuitionistic fuzzy topology, Intuitionistic fuzzy g - closed sets and Intuitionistic fuzzy g-open sets.02010 Mathematics Subject Classi cation: 54A40, 03F55.

I.

INTRODUCTION

In 1965, Zadeh [12] introduced fuzzy sets and in 1968, Chang [2] introduced fuzzy topology. After the introduction of fuzzy set and fuzzy topology, several authors were conducted on the generalization of this notions. The notion of intuitionistic fuzzy sets was introduced by Atanassov [1] as a generalization of fuzzy sets. In 1997, Coker [3] introduced the concept of intuitionistic fuzzy topological spaces. In this paper, we introduce the notions of intuitionistic fuzzy g -closed sets and intuitionistic fuzzy g -open sets and study some of its properties in intuitionistic fuzzy topological spaces.

II.

PRELIMINARIES

Throughout this paper, (X; ) or X denotes the intuitionistic fuzzy topological spaces (brie y IFTS). For a subset A of X, the closure, the interior and the complement of A are denoted by cl(A), int(A) and Ac respectively. We recall some basic de nitions that are used in the sequel.

III.

M. THIRUMALAISWAMY

De nition 2.1. [1] Let X be a non-empty xed set. An intuitionistic fuzzy set A in X is an object having the form A = fhx; A(x); A(x)i : x 2 Xg ; where the functions A : X ! [0; 1] and A : X ! [0; 1] denote the degree of membership A(x) and the degree of non-membership A(x) of each element x 2 X

to the set A respectively and De nition 2.2. [1] Let A = fhx; A(x); A(x)i : x 2

0A(x) + A(x) 1 for each x 2 X: A and B be IFS's of the form Xg and B = fhx; B(x); B(x)i : x 2 Xg : Then

1. A B if and only if A(x) B(x) and A(x) B(x) for all x 2 X: 2. A = B if and only if A B and B A: 3. Ac = fhx; A(x); A(x)i : x 2 Xg : 4. A \ B = fhx; A(x) ^ B(x); A(x) _ B(x)i : x 2 Xg : 5. A [ B = fhx; A(x) _ B(x); A(x) ^ B(x)i : x 2 Xg : 6. 0~ = fhx; 0; 1i : x 2 Xg and 1~ = fhx; 1; 0i : x 2 Xg : 7. 1~c = 0~ and 0~c = 1~: Denition 2.3. [3] An intuitionistic fuzzy topology (IFT) on X is a family of IFS's in X satisfying the following axioms. 1. 0~; 1~ 2 ; 2. G1 \ G2 2 for any G1; G2 2 ;
S

Gi 2 for any family

fGi : i 2 Jg : space 65 | Page

In this case the pair

(X; ) is called an intuitionistic fuzzy topological www.ijres.org

Intuitionistic fuzzy g - closed sets (IFTS) and any IFS in is known as an intuitionistic fuzzy open set (IFOS) in X. fuzzy

The complement Ac of an IFOS A in IFTS (X; ) is called an intuitionistic closed set (IFCS) in X.

We simply write A = hx; A; Ai instead of in case there is no chance for confusion.

A = fhx; A(x); A(x)i : x 2 Xg

De nition 2.4. [3] Let (X; ) be an IFTS and A = hx; A; Ai Then the intuitionistic fuzzy interior and intuitionistic fuzzy closure are de ned by S int(A) = fG : G is an IFOS in X and G Ag ; cl(A) = T fK : K is an IFCS in X and A Kg : Denition 2.5. [5] An IFS A = hx; A(x); A(x)i in an IFTS (X; ) is said to an 1. 2. 3. 4. 5. intuitionistic fuzzy semi-open set (IFSOS) if A cl(int(A)); intuitionistic fuzzy pre open set (IFPOS) if A int(cl(A)); intuitionistic fuzzy -open set (IF OS) if A int(cl(int(A))); intuitionistic fuzzy regular open set (IFROS) if A = int(cl(A)); intuitionistic fuzzy -open set (IF OS) if A cl(int(cl(A))):

be an IFS in X.

An IFS A is said to be an intuitionistic fuzzy semi-closed set (IFSCS), intuitionistic fuzzy pre closed set (IFPCS), intuitionistic fuzzy -closed set (IF CS), intuitionistic fuzzy regular closed set (IFRCS) and intuitionistic fuzzy -closed set (IF CS) if the complement of A is an IFSOS, IFPOS, IF OS, IFROS and IF OS respectively. Denition 2.6. An IFS A = hx; A(x); A(x)i in an IFTS (X; ) is said to an 1. intuitionistic fuzzy generalized closed set (IFGCS) [10] if cl(A) U whenever A U and U is an IFOS in X, 2. intuitionistic fuzzy regular generalized closed set (IFRGCS) [9] if cl(A) U whenever A U and U is an IFROS in X, 3. intuitionistic fuzzy generalized semi-closed set (IFGSCS) [7] if scl(A) U whenever A U and U is an IFOS in X, 4. intuitionistic fuzzy -generalized closed set (IF GCS) [6] if cl(A) U whenever A U and U is an IFOS in X, 5. intuitionistic fuzzy generalized -closed set (IFG CS) [8] if cl(A) U whenever A U and U is an IF OS in X, 6. intuitionistic fuzzy generalized semipre closed set (IFGSPCS) [4] if spcl(A) U whenever A U and U is an IFOS in X.

IV.

M. THIRUMALAISWAMY

An IFS A is said to be an intuitionistic fuzzy generalized open set (IFGOS), intuitionistic fuzzy regular generalized open set (IFRGOS), intuitionistic fuzzy generalized semi-open set (IFGSOS), intuitionistic fuzzy -generalized open set (IF GOS), intuitionistic fuzzy generalized -open set (IFG OS) and intuitionistic fuzzy generalized semipre open set (IFGSPOS) if the complement of A is an IFGCS, IFRGCS, IFGSCS, IF GCS, IFG CS and IFGSPCS respectively. De nition 2.7. [11] Let ; 2 [0; 1] with + 1: An intuitionistic fuzzy point (brie y IFP), written as p ( ; ); is de ned to be an IFS of X given by p( ; )(x) = ( ; ) if x = p, = (0; 1) otherwise. We observe that an IFP p( ; ) is said to belong to an IFS A = hx; A(x); A(x)i ; denoted by p( ; ) 2 A if A(x)

www.ijres.org

65 | Page

Intuitionistic fuzzy g - closed sets

and A(x): De nition 2.8. [5] Two IFS's A and B are said to be q-coincident (brie y A q B) if and onlf if there exists an element x 2 X such that A(x) > B(x) or A(x) < B(x) De nition 2.9. [5] Two IFS's A and B are said to be not q-coincident (brie y e (A q B)) if and onlf if A B c:

De nition 3.1. An IFS A of an IFTS g -closed set (brie y IFG CS) if

(X; ) cl(A)

is said to be an intuitionistic fuzzy int(cl(U)) whenever A U and

U is an IF OS in (X; ): Example 3.2. Let X = fa; bg and = f0 ~; G; 1~g be an IFTS on X, where G = hx; (0:5; 0:6); (0:5; 0:4)i : Then the IFS A = hx; (0:4; 0:5); (0:6; 0:5)i is an IFG CS in (X; ): Theorem 3.3. Every IFCS is an IFG CS but not conversely. Proof. Let A U; where U is an IFROS. Then cl(A) cl(A) = A U: Hence A is an IFG CS. Example 3.4. Let X = fa; bg and = f0 ~; G; 1~g be an IFTS on X, where G = hx; (0:5; 0:6); (0:5; 0:4)i : Then the IFS A = hx; (0:4; 0:5); (0:6; 0:5)i is an IFG CS but not an IFCS in (X; ): Theorem 3.5. Every IFRCS is an IFG CS but not conversely. Proof. Since every IFRCS is an IFCS, the proof follows from Theorem 3.4. Example 3.6. Let X = fa; bg and = f0~; G; 1~g be an IFTS on X, where G = hx; (0:5; 0:6); (0:5; 0:4)i : Then the IFS A = hx; (0:4; 0:5); (0:6; 0:5)i is an IFG CS but not an IFRCS in (X; ):

M. Thirumalaiswamy

Theorem 3.7. Every IF CS is an IFG CS but not conversely. Proof . cl(A) Let A be an IF CS and U be an IFROS such that AU: Then

U: Since cl(A) = A and hence A is an IFG CS.

Example 3.8. Let X = fa; bg and = f0 ~; G; 1~g be an IFTS on X, where G = hx; (0:5; 0:6); (0:5; 0:4)i : Then the IFS A = hx; (0:4; 0:5); (0:6; 0:5)i is an IFG CS but not an IF CS in (X; ): Theorem 3.9. Every IFGCS is an IFG CS but not conversely. Proof. Let A be an IFGCS and U be an IFROS such that A U: Since every IFROS is an IFOS and cl(A) cl(A); we have by hypothesis, cl(A) cl(A) U and hence A is an IFG CS. Example 3.10. Let X = fa; bg and = f0 ~; G; 1~g be an IFTS on X, where G = hx; (0:5; 0:6); (0:5; 0:4)i : Then the IFS A = hx; (0:4; 0:5); (0:6; 0:5)i is an IFG CS but not an IFGCS in (X; ): Theorem 3.11. Every IFRGCS is an IFG CS but not conversely. Proof. Let A be an IFRGCS and U be an IFROS such that A U: Sincecl (A) cl(A) and cl(A) U; by hypothesis, A is an IFG CS. Example 3.12. Let X = fa; b; cg and = f0 ~; G1; G2; 1~g be an IFTS on X, where

www.ijres.org

65 | Page

Intuitionistic fuzzy g - closed sets G1 = hx; (0:4; 0:4; 0:5); (0:4; 0:4; 0:4)i and G 2 = Then the IFS A = h x; (0:4; 0:3; 0:2); (0:5; 0:4; 0:5) hx; (0:2; 0:3; 0:5); (0:5; 0:5; 0:5)i : i is an IFG CS but not an

IFRGCS in (X; ): Theorem 3.13. Every IF GCS is an IFG CS but not conversely. Proof. Let A be an IF GCS and U be an IFROS such that A U: Since every IFROS is an IFOS and A is an IF GCS, we have cl(A) U: Hence A is an IFG CS.

Intuitionistic fuzzy g

-closed sets

7 be an IFTS on X, where

Example 3.14. Let X = fa; bg and = f0~; G; 1~g

G = hx; (0:5; 0:6); (0:5; 0:4)i : Then the IFS A = hx; (0:4; 0:5); (0:6; 0:5)i is an IFG CS but not an IF GCS in (X; ): Theorem 3.15. Every IFG CS is an IFG CS but not conversely. Proof. Let A be an IFG CS and U be an IFROS such that A U: Since every IFROS is an IF OS and by hypothesis, we have cl(A) U: Hence A is an IFG CS. Example 3.16. Let X = fa; bg and = f0 ~; G; 1~g be an IFTS on X, where G = hx; (0:8; 0:8); (0:2; 0:1)i : Then the IFS A = hx; (0:9; 0:7); (0:1; 0:3)i is an IFG CS but not an IFG CS in (X; ): Remark 3.17. Summing up the above theorems, we have the following diagram. None of the implications are reversible. IFCS % IFRCS & IF CS ! IFG CS ! IF GCS ! IFGCS ! IFRGCS & IFG CS %

Remark 3.18. The following examples show that IFG CS is idependent of IFPCS, IFSCS, IF CS, IFGSCS and IFGSPCS. Example 3.19. Let X = fa; bg and = f0 ~; G1; G2; 1~g be an IFTS on X, where G1 = A= hx; (0:7; 0:8); (0:3; 0:2)i and G2 = hx; (0:6; 0:7); (0:4; 0:3)i : Then the IFS x; (0:6; 0:8); (0:4; 0:2) is an IFG CS but not an IFPCS, IFSCS, IF CS, i

h IFGSCS and IFGSPCS in (X; ): Example 3.20. Let X = fa; bg and = f0 ~; G; 1~g be an IFTS on X, where

G = hx; (0:5; 0:4); (0:5; 0:6)i : Then the IFS A = hx; (0:4; 0:2); (0:6; 0:7)i is an IFPCS, IF CS, IFGSCS

www.ijres.org

65 | Page

Intuitionistic fuzzy g - closed sets

and IFGSPCS but not an IFG CS in (X; ): Example 3.21. Let X = fa; bg and = f0 ~; G; 1~g be an IFTS on X, where G = hx; (0:5; 0:4); (0:5; 0:6)i : Then the IFS A = hx; (0:5; 0:5); (0:5; 0:6)i is an IFSCS but not an IFG CS in (X; ): Theorem 3.22. The union of two IFG C sets is an IFG CS in (X; ):

Proof. Let U be an IFROS in (X; ) such that A[B U: Then A U and B U: So, cl(A) U and cl(B) U: Therefore cl(A) [ cl(B) cl(A [B) U: Hence A [ B is an IFG CS. Remark 3.23. Intersection of two IFG C sets need not be an IFG CS.

Example 3.24. Let b e G

2

X = fa; b; cg and X where , G1 =

= f0~; G1; G2; G1 [ G2; G1 \ G2; 1~g hx; (0:0; 0:6; 0:1); (0:1; 0:25; 0:0)i and

an IFTS on

= hx; (0:1; 0:25; 0:0); (0:0; 0:6; 0:1)i :

Then

the IFS A

hx; (0:3; 0:7; 0:1); (0:2; 0:25; 0:3)i

and the IFS B

= hx; (0:0; 0:6; 0:3); (0:1; 0:3; 0:0)i

are IFG C sets but A \ B is not an IFG CS. Theorem 3.25. If an IFS A is an IFG CS such that B is an IFS in an IFTS (X; ); then B is an IFG CS in (X; ): A Bcl(A); where

Proof. Let U be an IFROS in (X; ) such that B U: Then A U: Since A is an IFG CS, we have cl(A) U: Now, cl(B) Hence B is an IFG CS in (X; ): Theorem 3.26. If an IFS A is an IFRGCS such that A B cl(A); where B is an IFS in an IFTS (X; ); then B is an IFG CS in (X; ): cl( cl(A)) = cl(A) U:

Proof.

Let U be an IFROS in (X; ) such that B U: Then cl(A) cl(A) cl(A); we have cl(A) U: Hence B is an IFG CS in (X; ):

A U: Since cl(A) U: Now,

A is an IFRGCS and cl(B) cl(B)

Theorem 3.27. An IFS A is an IFG CS in an IFTS e(AqF ) implies e( cl(A)qF ) for every IFRCS F of (X; ):

(X; )

if and only if

www.ijres.org

65 | Page

Intuitionistic fuzzy g - closed sets

Proof. Necessity. Assume that A is an IFG CS in (X; ): Let F be an IFRCS and e(AqF ): Then A F c; where F c is an IFROS in (X; ): Then by assumption, cl(A) F c: Hence e( cl(A)qF ): Su ciency. Let F be an IFROS in (X; ) such that F U: Then F c is an

IFRCS in (X; ) and F (Uc)c: By assumption, e(FqUc) implies e( cl(A)qUc): Therefore, cl(A) (Uc)c = U: Hence A is an IFG CS in (X; ): Theorem 3.28. If A is an IFROS and an IFG CS in (X; ); then A is an IF CS in (X; ): Proof. Let A be an IFROS. Since A A; cl(A) A: But A cl(A) always. Therefore cl(A) = A: Hence A is an IF CS in (X; ): Theorem 3.29. Every IFS in an (X; ) is an IFG CS if and only if IF OS and IF CS coincide. Proof. Necessity. Suppose that every IFS in (X; ) is an IFG CS. Let U be an IFROS in (X; ): Then U is an IFOS and an IF OS and by hypothesis cl(U) U cl(U): That is cl(U) = U: Thus U is an IF CS in (X; ):

Hence IF O(X) IF C(X): Let A be an IF CS. Then Ac is an IF OS in (X; ): But IF O(X) IF C(X): Therefore A is an IF OS in (X; ); we have IF C(X) IF O(X): Thus IF O(X) = IF C(X): Su ciency. Suppose that IF O(X) = IF C(X): Let A U and U be an IFROS in (X; ): Since every IFROS is IF OS, U is an IF OS in (X; ) and therefore cl(A) cl(U) = U; by hypothesis. Hence A is an IFG CS in (X; ):

Theorem 3.30. An IFS A of an IFTS (X; ) is an IFROS and an IFG CS, then A is an IFRCS in (X; ):

Proof. Let A be an IFROS and an IFG CS in (X; ): Then

cl(A)

A :

Since cl(A) is an IF CS, we have cl(int(cl(A))) A: Therefore

since A is an IFROS. Then cl(int(A)) cl(A) A: Therefore cl(int(A)) A:

cl(A) A;

www.ijres.org

65 | Page

Intuitionistic fuzzy g - closed sets

Since every IFROS is an IFSOS, A is an IFSOS and we have A cl(int(A)): Thus A = cl(int(A)): Hence A is an IFRCS in (X; ): Theorem 3.31. Let A be an IFG CS in (X; ) and p ( ; ) be an IFP in X such that cl(A) q cl(p( ; )): Then A q cl(p( ; )): Proof. Assume that A is an IFG CS in (X; ) and cl(A) q cl(p( ; )): Suppose that e (A q cl(p( ; ))); then A ( cl(p( ; )))c where ( cl(p( ; )))c is an IF OS in (X; ): Then by De nition 3.1, cl(A) int(cl( cl(p ( ; )))c) cl((p( ; )

De nition 4.1. An IFS A of an IFTS (X; )

is called an IFG OS if and only

Therefore e ( cl(A) q cl(p( ; ))); which is a contradiction to the hypothesis. Hence A q cl(p( ; )):

if Ac is an IFG CS. Theorem 4.2. Every IFOS, IFROS, IFG OS is an IFG OS in (X; ): Proof. Obvious. Example 4.3. Let X = fa; bg and G = hx; (0:5; 0:6); (0:5; 0:4)i : Then the IFS = f0~; G; 1~g be an IFTS on X, where A = hx; (0:6; 0:5); (0:4; 0:5)i is an IF OS, IFGOS, IFRGOS, IF GOS,

IFG OS but not an IFOS, IFROS, IF OS, IFGOS, IF GOS in (X; ): Example 4.4. Let X = fa; bg and G = hx; (0:8; 0:8); (0:2; 0:1)i : Then the IFS IFG OS but not an IFG OS in (X; ): = f0~; G; 1~g be an IFTS on X, where A = hx; (0:1; 0:3); (0:9; 0:7)i is an

Example 4.5. Let G1 = hx; (0:4; 0:4; Then the IFS A = IFRGCS in (X; ):

X = fa; b; cg and = f0~; G1; G2; 1~g be an IFTS on X, where 0:5); (0:4; 0:4; 0:4)i and G2 = x; (0:5; 0:4; 0:5); (0:4; 0:3; 0:2) h hx; (0:2; 0:3; 0:5); (0:5; 0:5; 0:5)i : is an IFG CS but not an i

www.ijres.org

65 | Page

Intuitionistic fuzzy g - closed sets

Theorem 4.6. An IFS A of an IFTS (X; ) is an IFG OS if and only if U int(A) whenever U A and U is an IFRCS.

Proof. Necessity. Assume that A is an IFG OS in (X; ): Let U be an IFRCS such that U A: Then U c is an IFROS and Ac Uc: Then by assumption Ac is an IFG CS in (X; ): Therefore, we have cl(Ac) Uc: Hence U int(A): Ac U: Then Uc

Su ciency. Let U be an IFROS in and Uc is an IFRCS. Therefore Uc ( int(A))c U that is cl(Ac) U . Thus

(X; )

such that int(A): Since

Ucint(A); we have

Ac is an IFG CS. Hence A is an

IFG OS in (X; ): Remark 4.7. Intersection of two IFG O sets is an IFG OS in (X; ): But the union of two IFG O sets need not be an IFG OS.

Example 4.8. Let be G2 an IFTSon

X X,

= fa; b; cg and where G1 =

= f0~; G1; G2; G1

[ G2; G1

\ G2; 1~g and A =

hx; (0:0; 0:6; 0:1); (0:1; 0:25; 0:0)i Then the IFS

=hx; (0:1; 0:25; 0:0); (0:0; 0:6; 0:1)i : and the IFS B B is not an IFG OS. \

hx; (0:2; 0:25; 0:3); (0:3; 0:7; 0:1)i are IFG O sets but A

= hx; (0:1; 0:3; 0:0); (0:0; 0:6; 0:3)i

Theorem 4.9. Let A Be an IFS in (X; ): If B is an IFSOS such that B A int(cl(B)); then A is an IFG OS in (X; ): Proof. Since B is an IFSOS, we have B cl(int(B)): Thus, A int(cl(B)) int(cl(cl(int(B)))) = int(cl(int(B))) int(cl(int(A))): This implies A is an IF OS: By Theorem 4.2, A is an IFG OS in (X; ): Theorem 4.10. If an IFS A is an IFG OS in (X; ) such that int(A) B

A; where B is an IFS in (X; ); then B is an IFG OS in (X; ): Proof. Suppose that A is an IFG OS in (X; ) and int(A) Ac is an IFG CS and Ac Bc ( int(A))c; this implies Ac Then Bc is an IFG CS in (X; ); by Theorem 3.26. Hence B is an IFG OS in (X; ): B A: Then Bccl(Ac):

www.ijres.org

65 | Page

Intuitionistic fuzzy g - closed sets

Theorem 4.11. If an IFS A is an IFRGOS in (X; ) such that int(A) B A; where B is an IFS in (X; ); then B is an IFG OS in (X; ): Proof. Let A be an IFRGOS and int(A) B A: Then Ac is an IFRGCS and Ac Bc cl(Ac): Then Bc is an IFG CS in (X; ); by Theorem 3.27. Hence B is an IFG OS in (X; ):

REFERENCES
[1]. [2]. [3]. K. T. Atanassov, Intuitionistic fuzzy sets, Fuzzy sets and systems, 20(1986), 87-96. C. L. Chang, Fuzzy topological spaces, J. Math. Anal. Appl., 24(1986), 182-190. D. Coker, An introduction to Intuitionistic fuzzy topological spaces, Fuzzy sets and systems, 88(1997), 81-89. [4]. D. Jayanthi, On generalized semipre closed sets in intuitionistic fuzzy topological spaces, Ph. D thesis, Bharathiar University (2011). [5]. H. Gurcay, D. Coker and Es. A. Haydar, On fuzzy continuity in intuitionistic fuzzy topological spaces, The Journal of Fuzzy Mathematics, 5(1997), 365-378. [6]. D. Kalamani, K. Sakthivel and C. S. Gowri, Generalized alpha closed sets in intuitionistic fuzzy topological spaces, Applied Mathematical Sciences, 6(94)(2012), 4691-4700. [7]. R. Santhi and K. Sakthivel, Intuitionistic fuzzy generalized semicontinuous mappings, Advances in Theoretical and Applied Mathematics, 5(2009), 73-82. [8]. [8] R. Santhi and K. Sakthivel, Intuitionistic fuzzy alpha generalized closed sets(Accepted in Mathematics Education). [9]. S. S. Thakur and Rekha Chaturvedi, Regular generalized closed set in intuitionistic fuzzy topological spaces, Universitatea Din Bacau, Studii Si Cercetari Stiinti ce, Seria: Matematica, 16(2006), 257-272. [10]. S. S. Thakur and Rekha Chaturvedi, Generalized closed set in intuitionistic fuzzy topology, The Journal of Fuzzy Mathematics, 16(3)(2008), 559-572. [11]. Young Bae Jun and Seok-Zun Song, Intuitionistic fuzzy semipre open sets and Intuitionistic fuzzy semipre continuous mappings, Jour. of Appl. Math. and Computing, 19(2005), 467-474. [12]. L.A. Zadeh, Fuzzy sets, Information and control, 8(1965), 338-353.

www.ijres.org

74 | Page