SlideShare a Scribd company logo
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 56
Paper Publications
Fuzzy -Separation Axioms
1
Qays Hatem Imran, 2
Hayder Kadhim Zghair
1
Department of Mathematics, College of Education for Pure Science, Al-Muthanna University, Samawah, Iraq
2
Department of Software, College of Information Technology, University of Babylon, Babylon, Iraq
Abstract: This paper will introduce a new class of fuzzy closed set (briefly F- ) called fuzzy -closed set as well
as, introduce the fuzzy -kernel set of the fuzzy topological space. The investigation will address and discuss
some of the properties of the fuzzy separation axioms such as fuzzy - -space and fuzzy - -space (note that,
the indexes and are natural numbers of the spaces and are from 0 to 3 and from 0 to 4 respectively).
Mathematics Subject Classification (2010): 54A40.
Keywords: -closed set, - -space, and - -space, .
1. INTRODUCTION
In 1965 Zadeh studied the fuzzy sets (briefly -sets) (see [6]) which plays such a role in the field of fuzzy topological
spaces (or simply fts). The fuzzy topological spaces investigated by Chang in 1968 (see [3]). A. S. Bin Shahna [1] defined
fuzzy -closed sets. In 1997, fuzzy generalized closed set (briefly - ) was introduced by G. Balasubramania and P.
Sundaram [5]. In 2014, M. Mathew and R. Parimelazhagan [7] defined -closed sets of topological spaces. The aim of
this paper is to introduce a concept of -closed sets and study their basic properties in fts. Furthermore, the
investigation will include some of the properties of the fuzzy separation axioms such fuzzy - -space and fuzzy -
-space (here the indexes and are natural numbers of the spaces and are from 0 to 3 and from 0 to 4 respectively).
2. PRELIMINARIES
Throughout this paper, or simply always mean a fts. A fuzzy point [4] with support and value (
) at will be denoted by , and for fuzzy set , iff . Two fuzzy points and are said to be
distinct iff their supports are distinct. That is, by and we mean the constant fuzzy sets taking the values and on
, respectively [2]. For a fuzzy set in a fts , , and represents the fuzzy closure of ,
the fuzzy interior of and the fuzzy complement of respectively.
Definition 2.1:[12] A fuzzy point in a set with support and membership value is called crisp point, denoted by .
For any fuzzy set in , we have iff .
Definition 2.2:[8] A fuzzy point is called quasi-coincident (briefly -coincident) with the fuzzy set is denoted
by iff . A fuzzy set in a fts is called -coincident with a fuzzy set which is denoted by
iff there exists such that . If the fuzzy sets and in a fts are not -coincident then
we write ̅ . Note that ̅ .
Definition 2.3:[8] A fuzzy set in a fts is called -neighbourhood (briefly -nhd) of a fuzzy point (resp. fuzzy
set ) if there is a - in a fts such that (resp. ).
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 57
Paper Publications
Definition 2.4:[1] A fuzzy set of a fts is called a fuzzy -open set (briefly - ) if and
a fuzzy -closed set (briefly - ) if . The fuzzy -closure of a fuzzy set of fts is the
intersection of all - that contain and is denoted by .
Definition 2.5:[5] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever
and is a - in .
Definition 2.6:[10] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if
whenever and is a - in .
Definition 2.7:[9] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever
and is a - in .
Remark 2.8:[5,11] In a fts , then the following statements are true:
(i) Every - is a - .
(ii) Every - is a - .
Remark 2.9:[9,10] In a fts , then the following statements are true:
(i) Every - is a - .
(ii) Every - is a - .
(iii) Every - is a - .
3. FUZZY -CLOSED SETS
Definition 3.1: A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if
whenever and is a - . The complement of a fuzzy -closed set in is fuzzy -open set (briefly -
) in , the family of all - (resp. - ) of a fts is denoted by - (resp. - ).
Example 3.2: Let and the fuzzy set in defined as follows: .
Let be a fts. Then the fuzzy sets and are - and - at the same time in .
Remark 3.3: In a fts , then the following statements are true:
(i) Every - is a - .
(ii) Every - is a - .
(iii) Every - is a - .
(iv) Every - is a - .
Proof: (i) This follows directly from the definition (3.1).
(ii) Let be a - in and let be a - such that . Since every - is a - and is a - ,
. Therefore, is a - in .
(iii) From the part (ii) and remark (2.9) (ii).
(iv) From the part (iii) and remark (2.9) (iii).
Theorem 3.4: A fuzzy set is - iff contains no non-empty - .
Proof: Necessity. Suppose that is a non-empty -closed subset of such that .
Then . Then . Therefore and . Since is a -
and is a - , . Thus . Therefore
. Therefore contains no non-empty - .
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 58
Paper Publications
Sufficiency. Let be a - . Suppose that is not contained in . Then is a non-
empty - and contained in which is a contradiction. Therefore, and hence is a
- .
Theorem 3.5: Let , if is a - relative to and is a - then is a - in a fts .
Proof: Let be a - in a fts such that . Given that . Therefore and . This
implies . Since is a - relative to , then . implies that
. Thus . This implies that
. Therefore
. Since is a - in . . Also implies that
. Thus . Therefore . Since is not
contained in , is a - relative to .
Theorem 3.6: If is a - and , then is a - .
Proof: Let be a - such that . Let be a - in a fts such that . Since is
a - , we have whenever . Since and , then
. Therefore, . Thus, is a - in .
Theorem 3.7: The intersection of a - and a - is a - .
Proof: Let be a - and be a - . Since is a - ( ) whenever where is a -
. To show that is a - . It is enough to show that ( ) whenever , where is a
- . Let then . Since is a - , is a - and is a - ( )
. Now, ( ) ( ) ( ) ( )
. This implies that is a - .
Theorem 3.8: If and are two - in a fts , then is a - in .
Proof: Let and be two - in a fts . Let be a - in such that .
Now, ( ) ( ) ( ) . Hence is a - .
Remark 3.9: The union of two - need not be a - .
Definition 3.10: The intersection of all - in a fts containing is called fuzzy -closure of and is
denoted by - , - : , is a - .
Definition 3.11: The union of all - in a fts contained in is called fuzzy -interior of and is denoted
by - , - is a - .
Proposition 3.12: Let be any fuzzy set in a fts . Then the following properties hold:
(i) - iff is a - .
(ii) - iff is a - .
(iii) - is the largest - contained in .
(iv) - is the smallest - containing .
Proof: (i), (ii), (iii) and (iv) are obvious.
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 59
Paper Publications
Proposition 3.13: Let be any fuzzy set in a fts . Then the following properties hold:
(i) - - ,
(ii) - - .
Proof: (i) By definition, - is a -
- is a -
is a -
is a -
-
(ii) The proof is similar to (i).
Definition 3.14: A fuzzy set in a fts is said to be a fuzzy -neighbourhood (briefly -nhd) of a fuzzy
point if there exists a - such that . A -nhd is said to be a -open-nhd (resp. -
closed-nhd) iff is a - (resp. - ). A fuzzy set in a fts is said to be a fuzzy - -neighbourhood
(briefly - -nhd) of a fuzzy point (resp. fuzzy set ) if there exists a - in a fts such that
(resp. ).
Theorem 3.15: A fuzzy set of a fts is - iff ̅ ̅ , for every - of .
Proof: Necessity. Let be a - and ̅ . Then and is a - in which implies that
as is a - . Hence, ̅ .
Sufficiency. Let be a - of a fts such that . Then ̅ and is a - in . By
hypothesis, ̅ implies . Hence, is a - in .
Theorem 3.16: Let and be a fuzzy point and a fuzzy set respectively in a fts . Then - iff every
- -nhd of is -coincident with .
Proof: Let - . Suppose there exists a - -nhd of such that ̅ . Since is a - -nhd of ,
there exists a - in such that whish gives that ̅ and hence . Then -
, as is a - . Since , we have - , a contradiction. Thus every - -nhd
of is -coincident with .
Conversely, suppose - . Then there exists a - such that and . Then we have
and ̅ , a contradiction. Hence - .
Theorem 3.17: Let and be two fuzzy sets in a fts . Then the following are true:
(i) - , - .
(ii) - is a - in .
(iii) - - when .
(iv) iff - , when is a - in .
(v) - - ( - ).
Proof: (i) and (ii) are obvious.
(iii) Let - . By theorem (3.16), there is a - -nhd of a fuzzy point such that ̅ , so there is a
- such that and ̅ . Since , then ̅ . Hence - by theorem (3.16). Thus
- - .
(iv) Let be a - in . Suppose that ̅ , then . Since is a - and by a part (iii),
- - . Hence, ̅ - .
Conversely, suppose that ̅ - . Then - . Since - , we have .
Hence ̅ .
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 60
Paper Publications
(v) Since - - ( - ). We prove that - ( - - . Suppose that - .
Then by theorem (3.16), there exists a - -nhd of a fuzzy point such that ̅ and so there is a - in
such that and ̅ . By a part (iv), ̅ - . Then by theorem (3.16), - - .
Thus - - - . Hence - - - .
Theorem 3.18: Let and be two fuzzy sets in a fts . Then the following are true:
(i) - , - .
(ii) - is a - in .
(iii) - - when .
(iv) - - ( - ).
Proof: Obvious.
Remark 3.19: The following are the implications of a - and the reverse is not true.
4. FUZZY -KERNEL AND FUZZY - -SPACES,
Definition 4.1: The intersection of all -open subset of containing is called the fuzzy -kernel of (briefly
- ), this means - - : .
Definition 4.2: In a fts , a fuzzy set is said to be weakly ultra fuzzy -separated from if there exists a -
such that or - .
By definition (4.2), we have the following: For every two distinct fuzzy points and of ,
(i) - is not weakly ultra fuzzy -separated from .
(ii) - is not weakly ultra fuzzy -separated from .
Corollary 4.3: Let be a fts, then - iff - for each .
Proof: Suppose that - . Then there exists a - containing such that . Therefore, we
have - . The converse part can be proved in a similar way.
Definition 4.4: A fts is called fuzzy - -space ( - -space, for short) if for each - and ,
then - .
Definition 4.5: A fts is called fuzzy - -space ( - -space, for short) if for each two distinct fuzzy points
and of with - - , there exist disjoint - such that - and -
.
Theorem 4.6: Let be a fts. Then is - -space iff - - , for each .
- 𝛼 𝑚
-
𝛼 -
𝛼-
𝛼--
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 61
Paper Publications
Proof: Let be a - -space. If - - , for each , then there exist another fuzzy
point such that - and - } this means there exist an - , implies
- this contradiction. Thus - - .
Conversely, let - - , for each - , then - - [by
definition (4.1)]. Hence by definition (4.4), is a - -space.
Theorem 4.7: A fts is an - -space iff for each - and , then - .
Proof: Let for each - and , then - and let be a - , then for each
implies is a - implies - [by assumption]. Therefore -
implies - [by corollary (4.3)]. So - . Thus is an - -space.
Conversely, let be a - -space and be a - and . Then for each implies is a
- , then - [since is a - -space], so - - . Thus -
.
Corollary 4.8: A fts is - -space iff for each - and , then - - .
Proof: Clearly.
Theorem 4.9: Every - -space is a - -space.
Proof: Let be a - -space and let be a - , , then for each implies is a -
and - implies - - . Hence by definition (4.5), - . Thus is a
- -space.
Theorem 4.10: A fts is - -space iff for each with - - , then there exist
- , such that - , - and - , -
and .
Proof: Let be a - -space. Then for each with - - . Since every -
-space is a - -space [by theorem (4.9)], and by theorem (4.6), - - , then there exist -
, such that - and - and [since is a - -space], then
and are F - such that . Put and . Thus and so
that - and - .
Conversely, let for each with - - , there exist - , such that -
- and - - and ,
then and are - such that . Put and . Thus, - and -
and , so that and implies - and - , then
- and - . Thus, is a - -space.
Corollary 4.11: A fts is - -space iff for each with - - there exist disjoint
- such that - - and - - .
Proof: Let be a - -space and let with - - , then there exist disjoint -
such that - and - . Also is - -space [by theorem (4.9)] implies for
each , then - - [by theorem (4.6)], but - - - -
- . Thus - - and - - .
Conversely, let for each with - - there exist disjoint - such that -
- and - - . Since - , then - - -
for each . So we get - and - . Thus, is a - -space.
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 62
Paper Publications
Definition 4.12: Let be a fts. Then is called:
(i) fuzzy -regular space ( -space, for short), if for each fuzzy point and each - such that – ,
there exist disjoint - and such that and .
(ii) fuzzy -normal space ( -space, for short) iff for each pair of disjoint - and , there exist disjoint
- and such that and .
(iii) fuzzy - -space ( - -space, for short) if it is property -space.
(iv) fuzzy - -space ( - -space, for short) iff it is - -space and -space.
Example 4.13: Consider the fts of example (3.2). Then is a -space and -space.
Remark 4.14: Every - -space is a - -space, .
Proof: Clearly.
Theorem 4.15: A fts is -space ( - -space) iff for each -closed subset of and with -
- then there exist - , such that - , - and -
, - and .
Proof: Let be a -space ( - -space) and let be a - , , then there exist disjoint -
such that and , then and are - such that .
Put and , so we get - , - and - ,
- and .
Conversely, let for each -closed subset of and with - - , then there exist -
such that - , - and - , -
and . Then and are - such that and - , -
. So that and . Thus, is a -space ( - -space).
Lemma 4.16: Let be a -space and be a - . Then - - .
Proof: Let be a -space and be a - . Then for each , there exist disjoint - such that
and . Since - , implies - , thus - - . We showing
that if implies - - , therefore - - - . As -
- [by definition (4.1)]. Thus, - - .
Theorem 4.17: A fts is -space ( - -space) iff for each -closed subset of and with -
- - - , then there exist disjoint - such that - - and
- - .
Proof: Let be a -space ( - -space) and let be a - , . Then there exist disjoint -
such that and By lemma (4.16), - - - , in the other hand is a
- -space [by theorem (4.9) and remark (4.14)]. Hence, by theorem (4.6), - - , for
each . Thus, - - and - - .
Conversely, let for each - and with - - - - , then there exist
disjoint - such that - - and - - . Then and .
Thus, is a -space ( - -space).
Theorem 4.18: A fts is -space iff for each disjoint - , with - - then there
exist - , such that - , - and - , -
and .
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 63
Paper Publications
Proof: Let be a -space and let for each disjoint - , with - - then there
exist disjoint - such that and and , then and are - such that
and - , - Put and . Thus, - , -
and - , - .
Conversely, let for each disjoint - , with - - , there exist - , such that -
, - and - , - and
implies and are - such that . Put and , thus - and -
, so that and . Thus is a -space.
Theorem 4.19: Every - -space is a -space.
Proof: Let be a - and . Then - - , then for each there exist -
such that - , - and - , -
[since is a - -space and by theorem (4.10)], let , so we have .
Hence is a -space, then there exist disjoint - such that and . Thus, is a
-space.
5. FUZZY - -SPACES,
Definition 5.1: Let be a fts. Then is called:
(i) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points in , there exists a - in
containing one and not the other.
(ii) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points and of , there exists
- containing and respectively such that and .
(iii) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points and of , there exist
disjoint - in such that and .
(iv) fuzzy - -space ( - -space, for short) iff it is - -space and r-space.
(v) fuzzy - -space ( - -space, for short) iff it is - -space and n-space.
Example 5.2: Let and be a fts on . Then is a crisp point in and is a - -
space.
Example 5.3: Let and be a fts on . Then are crisp points in and is a -
-space and - -space.
Example 5.4: The discrete fuzzy topology in is a - -space and - -space.
Remark 5.5: Every - -space is a - -space, .
Proof: Clearly.
Theorem 5.6: A fts is - -space iff either - or - , for each .
Proof: Let be a - -space then for each , there exists a - such that , or
, . Thus either , implies - or , implies - .
Conversely, let either - or - , for each . Then there exists a - such
that , or , . Thus is a - -space.
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 64
Paper Publications
Theorem 5.7: A fts is - -space iff either - is weakly ultra fuzzy -separated from or -
is weakly ultra fuzzy -separated from for each .
Proof: Let be a - -space then for each , there exists a - such that , or
, . Now if , implies - is weakly ultra fuzzy -separated from . Or if
, implies - is weakly ultra fuzzy -separated from .
Conversely, let either - be weakly ultra fuzzy -separated from or - be weakly ultra
fuzzy -separated from . Then there exists a - such that - and or -
implies , or , . Thus, is a - -space.
Theorem 5.8: A fts is - -space iff for each , - is weakly ultra fuzzy -separated
from and - is weakly ultra fuzzy -separated from .
Proof: Let be a - -space then for each there exist - such that , and
, . Implies - is weakly ultra fuzzy -separated from and - is weakly ultra
fuzzy -separated from .
Conversely, let - be weakly ultra fuzzy -separated from and - be weakly ultra fuzzy
-separated from . Then there exist - such that - and -
implies , and , . Thus, is a - -space.
Theorem 5.9: A fts is - -space iff for each , - .
Proof: Let be a - -space and let - . Then - contains another fuzzy point
distinct from say . So - implies - is not weakly ultra fuzzy -separated from .
Hence by theorem (5.8), is not a - -space this is contradiction. Thus - .
Conversely, let - , for each and let be not a - -space. Then by theorem (5.8), -
is not weakly ultra fuzzy -separated from , this means that for every - contains -
then implies - implies - , this is contradiction. Thus, is a
- -space.
Theorem 5.10: A fts is - -space iff for each , - and - } .
Proof: Let be a - -space then for each , there exists - such that , and
, . Implies - and - .
Conversely, let - and - , for each . Then there exists - such
that , and , . Thus, is a - -space.
Theorem 5.11: A fts is - -space iff for each implies - - .
Proof: Let be a - -space. Then - and - [by theorem (5.9)]. Thus,
- - .
Conversely, let for each implies - - and let be not - -space then
for each implies - or - [by theorem (5.10)], then - -
this is contradiction. Thus, is a - -space.
Theorem 5.12: A fts is - -space iff is - -space and - -space.
Proof: Let be a - -space and let be a - , then for each , - -
[by theorem (5.11)] implies - and - ) this means - ,
hence - . Thus, is a - -space.
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 65
Paper Publications
Conversely, let be a - -space and - -space, then for each there exists a - such that
, or . Say since is a - -space, then - , this
means there exists a - such that . Thus, is a - -space.
Theorem 5.13: A fts is - -space iff
(i) is - -space and - -space.
(ii) is - -space and - -space.
Proof: (i) Let be a - -space then it is a - -space. Now since is a - -space then for each
, there exist disjoint - such that and implies - and -
, therefore - and - . Thus, is a - -space.
Conversely, let be a - -space and - -space, then for each , there exists a - such that
or , implies - - , since is a - -space [by assumption],
then there exist disjoint - such that and . Thus, is a - -space.
(ii) By the same way of part (i) a - -space is - -space and - -space.
Conversely, let be a - -space and - -space, then for each , there exist - such that
and implies - - } , since is a - -space, then there exist
disjoint - such that and . Thus, is a - -space.
Corollary 5.14: A - -space is - -space iff for each with - - then there
exist - , such that - , - and - , -
and .
Proof: By theorem (4.10) and theorem (5.13).
Corollary 5.15: A - -space is - -space iff one of the following conditions holds:
(i) for each with - - , then there exist - such that - -
and - - .
(ii) for each with - - then there exist - , such that -
, - and - , - and .
Proof: (i) By corollary (4.11) and theorem (5.13).
(ii) By theorem (4.10) and theorem (5.13).
Theorem 5.16: A - -space is - -space iff one of the following conditions holds:
(i) for each , - .
(ii) for each , - - implies - - .
(iii) for each , either - or - .
(iv) for each , then - and - .
Proof: (i) Let be a - -space. Then is a - -space and - -space [by theorem (5.13)]. Hence by
theorem (5.9), - for each .
Conversely, let for each , - , then by theorem (5.9), is a - -space. Also is a
- -space by assumption. Hence by theorem (5.13), is a - -space.
(ii) Let be a - -space. Then is - -space [by remark (5.5)]. Hence by theorem (5.11), -
- for each .
Conversely, assume that for each , - - implies - -
. So by theorem (5.11), is a - -space, also is a - -space by assumption. Hence by theorem
(5.13), is a - -space.
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 66
Paper Publications
(iii) Let be a - -space. Then is a - -space [by remark (5.5)]. Hence by theorem (5.6), either
- or - for each .
Conversely, assume that for each , either - or - for each . So by
theorem (5.6), is a - -space, also is - -space by assumption. Thus is a - -space [by
theorem (5.13)].
(iv) Let be a - -space. Then is a - -space and - -space [by theorem (5.13)]. Hence by
theorem (5.10), - and - .
Conversely, let for each then - and - . Then by theorem (5.10), is a
- -space. Also is a - -space by assumption. Hence by theorem (5.13), is a - -space.
Remark 5.17: Each fuzzy separation axiom is defined as the conjunction of two weaker axioms: - -space = -
-space and - -space = - -space and - -space, .
Theorem 5.18: Let be a fts and - for each then is - -space if and only if it is
a - -space.
Proof: Let be a - -space. Then, is a - -space [By remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, -
for each , then is a - -space [by theorem (5.9)]. Hence by remark (5.17), is a - -space.
Theorem 5.19: Let be a fts and let , implies - - , then is a -
-space iff it is a - -space.
Proof: Let be a - -space. Then is a - -space [by remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, -
- , for each , then by theorem (5.11), is a - -space. Hence by remark (5.17),
is a - -space.
Theorem 5.20: Let be a fts and for each either - or - , then
is a - -space iff it is a - -space.
Proof: Let be a - -space. Then is a - -space [by remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, for each
either - or - . This means either - is weakly ultra fuzzy -separated
from or - is weakly ultra fuzzy -separated from , so by theorem (5.7), is a - -space.
Hence by remark (5.17), is a - -space.
Theorem 5.21: Let be a fts and let , then - and - , is a -
-space iff it is a - -space.
Proof: Let be a - -space. Then is a - -space [by remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, for each
then - and - . Therefore, - is weakly ultra fuzzy -separated from
and - is weakly ultra fuzzy -separated from , so by theorem (5.8), is a - -space.
Hence by remark (5.17), is a - -space.
Remark 5.22: The relation between fuzzy -separation axioms can be representing as a matrix. Therefore, the element
refers to this relation. As the following matrix representation shows:
1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 67
Paper Publications
and - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
Matrix Representation
The relation between fuzzy -separation axioms
REFERENCES
[1] S. Bin Shahna, “On fuzzy strong semi continuity and fuzzy pre continuity”, Fuzzy sets and system, 44(2), (1991),
303-308.
[2] Sikn, “On fuzzy FC - Compactness”, Comm. Korean Math. Soc., 13(1998), 137-150.
[3] L. Chang, “Fuzzy topological spaces”, J. Math. Anal. Appl., 24(1968), 182-190.
[4] K. Wong, “Fuzzy points and local properties of fuzzy topology”, J. Math. Anal. Appl., 46(1974), 316-328.
[5] G. Balasubramania and P. Sundaram, “On some generalizations of fuzzy continuous functions”, Fuzzy sets and
Systems, 86(1), (1997), 93-100.
[6] L. A. Zadeh, “Fuzzy sets”, Information and control, 8 (1965), 338-353.
[7] M. Mathew and R. Parimelazhagan, “ -Closed set in topological spaces”, International Journal of Mathematical
Analysis, Vol.8, No.47, (2014), 2325-2329.
[8] P. M. Pu and Y. M. Liu, “ Fuzzy topology I. Neighborhood structure of a fuzzy point and Moore-Smith
convergence”, J. Math. Anal. Appl., 76(1980), 571-599.
[9] R. K. Saraf and S. Mishra, “Fgα-closed sets”, J. Tripura Math. Soc., 2(2000), 27-32.
[10] R. K. Saraf, G. Navalagi and M. Khanna, “On fuzzy semi pre generalized closed sets”, Bull. Malaysian Math. Sci.
Soc., 28(1), (2005), 19-30.
[11] S. S. Thakur and S. Singh, “On fuzzy semi pre open sets and fuzzy semi pre continuous”, Fuzzy sets and system,
98(3), (1998), 383-391.
[12] S. Ganguly and S. Saha, “A note on -continuity and -connected sets in fuzzy set theory”, Simon Stevin, 62(1988).

More Related Content

What's hot

Lec18
Lec18Lec18
Topological_Vector_Spaces_FINAL_DRAFT
Topological_Vector_Spaces_FINAL_DRAFTTopological_Vector_Spaces_FINAL_DRAFT
Topological_Vector_Spaces_FINAL_DRAFT
Oliver Taylor
 
Maximal and Minimal α -Open Sets
Maximal and Minimal α -Open SetsMaximal and Minimal α -Open Sets
Maximal and Minimal α -Open Sets
IJERA Editor
 
Paper id 71201925
Paper id 71201925Paper id 71201925
Paper id 71201925
IJRAT
 
Recursion with python
Recursion with pythonRecursion with python
Recursion with python
BimaSudarsonoAdinsa
 
Recursion with Python [Rev]
Recursion with Python [Rev]Recursion with Python [Rev]
Recursion with Python [Rev]
Dennis Walangadi
 
TOP as a Grammatical Category The Case in Ngas and Hausa
TOP as a Grammatical Category The Case in Ngas and HausaTOP as a Grammatical Category The Case in Ngas and Hausa
TOP as a Grammatical Category The Case in Ngas and Hausa
Lengji Danjuma
 
Limit in Dual Space
Limit in Dual SpaceLimit in Dual Space
Limit in Dual Space
QUESTJOURNAL
 
Linear algebra notes
Linear algebra notesLinear algebra notes
Linear algebra notes
Ghulam Mehdi Sahito
 

What's hot (9)

Lec18
Lec18Lec18
Lec18
 
Topological_Vector_Spaces_FINAL_DRAFT
Topological_Vector_Spaces_FINAL_DRAFTTopological_Vector_Spaces_FINAL_DRAFT
Topological_Vector_Spaces_FINAL_DRAFT
 
Maximal and Minimal α -Open Sets
Maximal and Minimal α -Open SetsMaximal and Minimal α -Open Sets
Maximal and Minimal α -Open Sets
 
Paper id 71201925
Paper id 71201925Paper id 71201925
Paper id 71201925
 
Recursion with python
Recursion with pythonRecursion with python
Recursion with python
 
Recursion with Python [Rev]
Recursion with Python [Rev]Recursion with Python [Rev]
Recursion with Python [Rev]
 
TOP as a Grammatical Category The Case in Ngas and Hausa
TOP as a Grammatical Category The Case in Ngas and HausaTOP as a Grammatical Category The Case in Ngas and Hausa
TOP as a Grammatical Category The Case in Ngas and Hausa
 
Limit in Dual Space
Limit in Dual SpaceLimit in Dual Space
Limit in Dual Space
 
Linear algebra notes
Linear algebra notesLinear algebra notes
Linear algebra notes
 

Viewers also liked

Diabetics Online
Diabetics OnlineDiabetics Online
Diabetics Online
paperpublications3
 
Folder Security Using Graphical Password Authentication Scheme
Folder Security Using Graphical Password Authentication SchemeFolder Security Using Graphical Password Authentication Scheme
Folder Security Using Graphical Password Authentication Scheme
paperpublications3
 
Supervised Multi Attribute Gene Manipulation For Cancer
Supervised Multi Attribute Gene Manipulation For CancerSupervised Multi Attribute Gene Manipulation For Cancer
Supervised Multi Attribute Gene Manipulation For Cancer
paperpublications3
 
Analysis of Fungus in Plant Using Image Processing Techniques
Analysis of Fungus in Plant Using Image Processing TechniquesAnalysis of Fungus in Plant Using Image Processing Techniques
Analysis of Fungus in Plant Using Image Processing Techniques
paperpublications3
 
Privacy Preserving Data Leak Detection for Sensitive Data
Privacy Preserving Data Leak Detection for Sensitive DataPrivacy Preserving Data Leak Detection for Sensitive Data
Privacy Preserving Data Leak Detection for Sensitive Data
paperpublications3
 
Sign Language Recognition with Gesture Analysis
Sign Language Recognition with Gesture AnalysisSign Language Recognition with Gesture Analysis
Sign Language Recognition with Gesture Analysis
paperpublications3
 
Tree Based Proactive Source Routing Protocol for MANETs
Tree Based Proactive Source Routing Protocol for MANETsTree Based Proactive Source Routing Protocol for MANETs
Tree Based Proactive Source Routing Protocol for MANETs
paperpublications3
 
Automatic Fire Fighting Robot
Automatic Fire Fighting RobotAutomatic Fire Fighting Robot
Automatic Fire Fighting Robot
paperpublications3
 
Smart Password
Smart PasswordSmart Password
Smart Password
paperpublications3
 
Some Aspects of Abelian Categories
Some Aspects of Abelian CategoriesSome Aspects of Abelian Categories
Some Aspects of Abelian Categories
paperpublications3
 
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...
paperpublications3
 
Efficient File Sharing Scheme in Mobile Adhoc Network
Efficient File Sharing Scheme in Mobile Adhoc NetworkEfficient File Sharing Scheme in Mobile Adhoc Network
Efficient File Sharing Scheme in Mobile Adhoc Network
paperpublications3
 
Efficient and Optimal Routing Scheme for Wireless Sensor Networks
Efficient and Optimal Routing Scheme for Wireless Sensor NetworksEfficient and Optimal Routing Scheme for Wireless Sensor Networks
Efficient and Optimal Routing Scheme for Wireless Sensor Networks
paperpublications3
 
Fingerprint Feature Extraction, Identification and Authentication: A Review
Fingerprint Feature Extraction, Identification and Authentication: A ReviewFingerprint Feature Extraction, Identification and Authentication: A Review
Fingerprint Feature Extraction, Identification and Authentication: A Review
paperpublications3
 
Comparative Study of Data Mining Classification Algorithms in Heart Disease P...
Comparative Study of Data Mining Classification Algorithms in Heart Disease P...Comparative Study of Data Mining Classification Algorithms in Heart Disease P...
Comparative Study of Data Mining Classification Algorithms in Heart Disease P...
paperpublications3
 
Avoiding Anonymous Users in Multiple Social Media Networks (SMN)
Avoiding Anonymous Users in Multiple Social Media Networks (SMN)Avoiding Anonymous Users in Multiple Social Media Networks (SMN)
Avoiding Anonymous Users in Multiple Social Media Networks (SMN)
paperpublications3
 
Android Application for College
Android Application for CollegeAndroid Application for College
Android Application for College
paperpublications3
 
Multimedia Cloud Computing To Save Smartphone Energy
Multimedia Cloud Computing To Save Smartphone EnergyMultimedia Cloud Computing To Save Smartphone Energy
Multimedia Cloud Computing To Save Smartphone Energy
paperpublications3
 
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction
Enhancing Data Security in Cloud Storage Auditing With Key AbstractionEnhancing Data Security in Cloud Storage Auditing With Key Abstraction
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction
paperpublications3
 
Secure Encrypted Data in Cloud Based Environment
Secure Encrypted Data in Cloud Based EnvironmentSecure Encrypted Data in Cloud Based Environment
Secure Encrypted Data in Cloud Based Environment
paperpublications3
 

Viewers also liked (20)

Diabetics Online
Diabetics OnlineDiabetics Online
Diabetics Online
 
Folder Security Using Graphical Password Authentication Scheme
Folder Security Using Graphical Password Authentication SchemeFolder Security Using Graphical Password Authentication Scheme
Folder Security Using Graphical Password Authentication Scheme
 
Supervised Multi Attribute Gene Manipulation For Cancer
Supervised Multi Attribute Gene Manipulation For CancerSupervised Multi Attribute Gene Manipulation For Cancer
Supervised Multi Attribute Gene Manipulation For Cancer
 
Analysis of Fungus in Plant Using Image Processing Techniques
Analysis of Fungus in Plant Using Image Processing TechniquesAnalysis of Fungus in Plant Using Image Processing Techniques
Analysis of Fungus in Plant Using Image Processing Techniques
 
Privacy Preserving Data Leak Detection for Sensitive Data
Privacy Preserving Data Leak Detection for Sensitive DataPrivacy Preserving Data Leak Detection for Sensitive Data
Privacy Preserving Data Leak Detection for Sensitive Data
 
Sign Language Recognition with Gesture Analysis
Sign Language Recognition with Gesture AnalysisSign Language Recognition with Gesture Analysis
Sign Language Recognition with Gesture Analysis
 
Tree Based Proactive Source Routing Protocol for MANETs
Tree Based Proactive Source Routing Protocol for MANETsTree Based Proactive Source Routing Protocol for MANETs
Tree Based Proactive Source Routing Protocol for MANETs
 
Automatic Fire Fighting Robot
Automatic Fire Fighting RobotAutomatic Fire Fighting Robot
Automatic Fire Fighting Robot
 
Smart Password
Smart PasswordSmart Password
Smart Password
 
Some Aspects of Abelian Categories
Some Aspects of Abelian CategoriesSome Aspects of Abelian Categories
Some Aspects of Abelian Categories
 
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...
 
Efficient File Sharing Scheme in Mobile Adhoc Network
Efficient File Sharing Scheme in Mobile Adhoc NetworkEfficient File Sharing Scheme in Mobile Adhoc Network
Efficient File Sharing Scheme in Mobile Adhoc Network
 
Efficient and Optimal Routing Scheme for Wireless Sensor Networks
Efficient and Optimal Routing Scheme for Wireless Sensor NetworksEfficient and Optimal Routing Scheme for Wireless Sensor Networks
Efficient and Optimal Routing Scheme for Wireless Sensor Networks
 
Fingerprint Feature Extraction, Identification and Authentication: A Review
Fingerprint Feature Extraction, Identification and Authentication: A ReviewFingerprint Feature Extraction, Identification and Authentication: A Review
Fingerprint Feature Extraction, Identification and Authentication: A Review
 
Comparative Study of Data Mining Classification Algorithms in Heart Disease P...
Comparative Study of Data Mining Classification Algorithms in Heart Disease P...Comparative Study of Data Mining Classification Algorithms in Heart Disease P...
Comparative Study of Data Mining Classification Algorithms in Heart Disease P...
 
Avoiding Anonymous Users in Multiple Social Media Networks (SMN)
Avoiding Anonymous Users in Multiple Social Media Networks (SMN)Avoiding Anonymous Users in Multiple Social Media Networks (SMN)
Avoiding Anonymous Users in Multiple Social Media Networks (SMN)
 
Android Application for College
Android Application for CollegeAndroid Application for College
Android Application for College
 
Multimedia Cloud Computing To Save Smartphone Energy
Multimedia Cloud Computing To Save Smartphone EnergyMultimedia Cloud Computing To Save Smartphone Energy
Multimedia Cloud Computing To Save Smartphone Energy
 
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction
Enhancing Data Security in Cloud Storage Auditing With Key AbstractionEnhancing Data Security in Cloud Storage Auditing With Key Abstraction
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction
 
Secure Encrypted Data in Cloud Based Environment
Secure Encrypted Data in Cloud Based EnvironmentSecure Encrypted Data in Cloud Based Environment
Secure Encrypted Data in Cloud Based Environment
 

Similar to Fuzzy α^m-Separation Axioms

Fair Restrained Dominating Set in the Corona of Graphs
Fair Restrained Dominating Set in the Corona of GraphsFair Restrained Dominating Set in the Corona of Graphs
Fair Restrained Dominating Set in the Corona of Graphs
Dr. Amarjeet Singh
 
Fair Secure Dominating Set in the Corona of Graphs
Fair Secure Dominating Set in the Corona of GraphsFair Secure Dominating Set in the Corona of Graphs
Fair Secure Dominating Set in the Corona of Graphs
Dr. Amarjeet Singh
 
FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...
FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...
FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...
IJESM JOURNAL
 
A survey on different definitions of soft points: limitations, comparisons and...
A survey on different definitions of soft points: limitations, comparisons and...A survey on different definitions of soft points: limitations, comparisons and...
A survey on different definitions of soft points: limitations, comparisons and...
Journal of Fuzzy Extension and Applications
 
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
inventionjournals
 
Super Fair Dominating Set in the Cartesian Product of Graphs
Super Fair Dominating Set in the Cartesian Product of GraphsSuper Fair Dominating Set in the Cartesian Product of Graphs
Super Fair Dominating Set in the Cartesian Product of Graphs
Dr. Amarjeet Singh
 
Fuzzy hypersoft sets and its weightage operator for decision making
Fuzzy hypersoft sets and its weightage operator for decision makingFuzzy hypersoft sets and its weightage operator for decision making
Fuzzy hypersoft sets and its weightage operator for decision making
Journal of Fuzzy Extension and Applications
 
Certain properties of - -fuzzy subrings
Certain properties of - -fuzzy subringsCertain properties of - -fuzzy subrings
Certain properties of - -fuzzy subrings
nooriasukmaningtyas
 
Fundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation SpaceFundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation Space
YogeshIJTSRD
 
Intuitionistic Fuzzy Semipre Generalized Connected Spaces
Intuitionistic Fuzzy Semipre Generalized Connected SpacesIntuitionistic Fuzzy Semipre Generalized Connected Spaces
Intuitionistic Fuzzy Semipre Generalized Connected Spaces
Editor IJCATR
 
MINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETS
MINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETSMINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETS
MINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETS
IAEME Publication
 
International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI)International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI)
inventionjournals
 
Compact Monothetic C semirings
Compact Monothetic C semiringsCompact Monothetic C semirings
Compact Monothetic C semirings
ijtsrd
 
Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...
Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...
Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...
Editor IJCATR
 
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
IOSR Journals
 
IRJET- Nano Generalized Delta Semi Closed Sets in Nano Topological Spaces
IRJET-  	  Nano Generalized Delta Semi Closed Sets in Nano Topological SpacesIRJET-  	  Nano Generalized Delta Semi Closed Sets in Nano Topological Spaces
IRJET- Nano Generalized Delta Semi Closed Sets in Nano Topological Spaces
IRJET Journal
 
A study on fundamentals of refined intuitionistic fuzzy set with some properties
A study on fundamentals of refined intuitionistic fuzzy set with some propertiesA study on fundamentals of refined intuitionistic fuzzy set with some properties
A study on fundamentals of refined intuitionistic fuzzy set with some properties
Journal of Fuzzy Extension and Applications
 
11.on almost generalized semi continuous
11.on almost    generalized semi continuous11.on almost    generalized semi continuous
11.on almost generalized semi continuous
Alexander Decker
 
On almost generalized semi continuous
On almost    generalized semi continuousOn almost    generalized semi continuous
On almost generalized semi continuous
Alexander Decker
 
Fuzzy Homogeneous Bitopological Spaces
Fuzzy  Homogeneous Bitopological Spaces Fuzzy  Homogeneous Bitopological Spaces
Fuzzy Homogeneous Bitopological Spaces
IJECEIAES
 

Similar to Fuzzy α^m-Separation Axioms (20)

Fair Restrained Dominating Set in the Corona of Graphs
Fair Restrained Dominating Set in the Corona of GraphsFair Restrained Dominating Set in the Corona of Graphs
Fair Restrained Dominating Set in the Corona of Graphs
 
Fair Secure Dominating Set in the Corona of Graphs
Fair Secure Dominating Set in the Corona of GraphsFair Secure Dominating Set in the Corona of Graphs
Fair Secure Dominating Set in the Corona of Graphs
 
FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...
FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...
FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...
 
A survey on different definitions of soft points: limitations, comparisons and...
A survey on different definitions of soft points: limitations, comparisons and...A survey on different definitions of soft points: limitations, comparisons and...
A survey on different definitions of soft points: limitations, comparisons and...
 
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
 
Super Fair Dominating Set in the Cartesian Product of Graphs
Super Fair Dominating Set in the Cartesian Product of GraphsSuper Fair Dominating Set in the Cartesian Product of Graphs
Super Fair Dominating Set in the Cartesian Product of Graphs
 
Fuzzy hypersoft sets and its weightage operator for decision making
Fuzzy hypersoft sets and its weightage operator for decision makingFuzzy hypersoft sets and its weightage operator for decision making
Fuzzy hypersoft sets and its weightage operator for decision making
 
Certain properties of - -fuzzy subrings
Certain properties of - -fuzzy subringsCertain properties of - -fuzzy subrings
Certain properties of - -fuzzy subrings
 
Fundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation SpaceFundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation Space
 
Intuitionistic Fuzzy Semipre Generalized Connected Spaces
Intuitionistic Fuzzy Semipre Generalized Connected SpacesIntuitionistic Fuzzy Semipre Generalized Connected Spaces
Intuitionistic Fuzzy Semipre Generalized Connected Spaces
 
MINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETS
MINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETSMINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETS
MINIMAL OF 풗-OPEN SETS AND 풗-CLOSED SETS
 
International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI)International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI)
 
Compact Monothetic C semirings
Compact Monothetic C semiringsCompact Monothetic C semirings
Compact Monothetic C semirings
 
Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...
Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...
Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological S...
 
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
 
IRJET- Nano Generalized Delta Semi Closed Sets in Nano Topological Spaces
IRJET-  	  Nano Generalized Delta Semi Closed Sets in Nano Topological SpacesIRJET-  	  Nano Generalized Delta Semi Closed Sets in Nano Topological Spaces
IRJET- Nano Generalized Delta Semi Closed Sets in Nano Topological Spaces
 
A study on fundamentals of refined intuitionistic fuzzy set with some properties
A study on fundamentals of refined intuitionistic fuzzy set with some propertiesA study on fundamentals of refined intuitionistic fuzzy set with some properties
A study on fundamentals of refined intuitionistic fuzzy set with some properties
 
11.on almost generalized semi continuous
11.on almost    generalized semi continuous11.on almost    generalized semi continuous
11.on almost generalized semi continuous
 
On almost generalized semi continuous
On almost    generalized semi continuousOn almost    generalized semi continuous
On almost generalized semi continuous
 
Fuzzy Homogeneous Bitopological Spaces
Fuzzy  Homogeneous Bitopological Spaces Fuzzy  Homogeneous Bitopological Spaces
Fuzzy Homogeneous Bitopological Spaces
 

Recently uploaded

New techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdfNew techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdf
wisnuprabawa3
 
Question paper of renewable energy sources
Question paper of renewable energy sourcesQuestion paper of renewable energy sources
Question paper of renewable energy sources
mahammadsalmanmech
 
Manufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptxManufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptx
Madan Karki
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Christina Lin
 
Understanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine LearningUnderstanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine Learning
SUTEJAS
 
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
gerogepatton
 
Modelagem de um CSTR com reação endotermica.pdf
Modelagem de um CSTR com reação endotermica.pdfModelagem de um CSTR com reação endotermica.pdf
Modelagem de um CSTR com reação endotermica.pdf
camseq
 
CSM Cloud Service Management Presentarion
CSM Cloud Service Management PresentarionCSM Cloud Service Management Presentarion
CSM Cloud Service Management Presentarion
rpskprasana
 
Wearable antenna for antenna applications
Wearable antenna for antenna applicationsWearable antenna for antenna applications
Wearable antenna for antenna applications
Madhumitha Jayaram
 
Heat Resistant Concrete Presentation ppt
Heat Resistant Concrete Presentation pptHeat Resistant Concrete Presentation ppt
Heat Resistant Concrete Presentation ppt
mamunhossenbd75
 
Swimming pool mechanical components design.pptx
Swimming pool  mechanical components design.pptxSwimming pool  mechanical components design.pptx
Swimming pool mechanical components design.pptx
yokeleetan1
 
Low power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniquesLow power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniques
nooriasukmaningtyas
 
PPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testingPPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testing
anoopmanoharan2
 
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
University of Maribor
 
Literature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptxLiterature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptx
Dr Ramhari Poudyal
 
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELDEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
gerogepatton
 
DfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributionsDfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributions
gestioneergodomus
 
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdfIron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
RadiNasr
 
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdfBPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
MIGUELANGEL966976
 
Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...
IJECEIAES
 

Recently uploaded (20)

New techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdfNew techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdf
 
Question paper of renewable energy sources
Question paper of renewable energy sourcesQuestion paper of renewable energy sources
Question paper of renewable energy sources
 
Manufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptxManufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptx
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
 
Understanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine LearningUnderstanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine Learning
 
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
 
Modelagem de um CSTR com reação endotermica.pdf
Modelagem de um CSTR com reação endotermica.pdfModelagem de um CSTR com reação endotermica.pdf
Modelagem de um CSTR com reação endotermica.pdf
 
CSM Cloud Service Management Presentarion
CSM Cloud Service Management PresentarionCSM Cloud Service Management Presentarion
CSM Cloud Service Management Presentarion
 
Wearable antenna for antenna applications
Wearable antenna for antenna applicationsWearable antenna for antenna applications
Wearable antenna for antenna applications
 
Heat Resistant Concrete Presentation ppt
Heat Resistant Concrete Presentation pptHeat Resistant Concrete Presentation ppt
Heat Resistant Concrete Presentation ppt
 
Swimming pool mechanical components design.pptx
Swimming pool  mechanical components design.pptxSwimming pool  mechanical components design.pptx
Swimming pool mechanical components design.pptx
 
Low power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniquesLow power architecture of logic gates using adiabatic techniques
Low power architecture of logic gates using adiabatic techniques
 
PPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testingPPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testing
 
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
 
Literature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptxLiterature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptx
 
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELDEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
 
DfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributionsDfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributions
 
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdfIron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
 
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdfBPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
 
Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...
 

Fuzzy α^m-Separation Axioms

  • 1. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 56 Paper Publications Fuzzy -Separation Axioms 1 Qays Hatem Imran, 2 Hayder Kadhim Zghair 1 Department of Mathematics, College of Education for Pure Science, Al-Muthanna University, Samawah, Iraq 2 Department of Software, College of Information Technology, University of Babylon, Babylon, Iraq Abstract: This paper will introduce a new class of fuzzy closed set (briefly F- ) called fuzzy -closed set as well as, introduce the fuzzy -kernel set of the fuzzy topological space. The investigation will address and discuss some of the properties of the fuzzy separation axioms such as fuzzy - -space and fuzzy - -space (note that, the indexes and are natural numbers of the spaces and are from 0 to 3 and from 0 to 4 respectively). Mathematics Subject Classification (2010): 54A40. Keywords: -closed set, - -space, and - -space, . 1. INTRODUCTION In 1965 Zadeh studied the fuzzy sets (briefly -sets) (see [6]) which plays such a role in the field of fuzzy topological spaces (or simply fts). The fuzzy topological spaces investigated by Chang in 1968 (see [3]). A. S. Bin Shahna [1] defined fuzzy -closed sets. In 1997, fuzzy generalized closed set (briefly - ) was introduced by G. Balasubramania and P. Sundaram [5]. In 2014, M. Mathew and R. Parimelazhagan [7] defined -closed sets of topological spaces. The aim of this paper is to introduce a concept of -closed sets and study their basic properties in fts. Furthermore, the investigation will include some of the properties of the fuzzy separation axioms such fuzzy - -space and fuzzy - -space (here the indexes and are natural numbers of the spaces and are from 0 to 3 and from 0 to 4 respectively). 2. PRELIMINARIES Throughout this paper, or simply always mean a fts. A fuzzy point [4] with support and value ( ) at will be denoted by , and for fuzzy set , iff . Two fuzzy points and are said to be distinct iff their supports are distinct. That is, by and we mean the constant fuzzy sets taking the values and on , respectively [2]. For a fuzzy set in a fts , , and represents the fuzzy closure of , the fuzzy interior of and the fuzzy complement of respectively. Definition 2.1:[12] A fuzzy point in a set with support and membership value is called crisp point, denoted by . For any fuzzy set in , we have iff . Definition 2.2:[8] A fuzzy point is called quasi-coincident (briefly -coincident) with the fuzzy set is denoted by iff . A fuzzy set in a fts is called -coincident with a fuzzy set which is denoted by iff there exists such that . If the fuzzy sets and in a fts are not -coincident then we write ̅ . Note that ̅ . Definition 2.3:[8] A fuzzy set in a fts is called -neighbourhood (briefly -nhd) of a fuzzy point (resp. fuzzy set ) if there is a - in a fts such that (resp. ).
  • 2. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 57 Paper Publications Definition 2.4:[1] A fuzzy set of a fts is called a fuzzy -open set (briefly - ) if and a fuzzy -closed set (briefly - ) if . The fuzzy -closure of a fuzzy set of fts is the intersection of all - that contain and is denoted by . Definition 2.5:[5] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever and is a - in . Definition 2.6:[10] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever and is a - in . Definition 2.7:[9] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever and is a - in . Remark 2.8:[5,11] In a fts , then the following statements are true: (i) Every - is a - . (ii) Every - is a - . Remark 2.9:[9,10] In a fts , then the following statements are true: (i) Every - is a - . (ii) Every - is a - . (iii) Every - is a - . 3. FUZZY -CLOSED SETS Definition 3.1: A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever and is a - . The complement of a fuzzy -closed set in is fuzzy -open set (briefly - ) in , the family of all - (resp. - ) of a fts is denoted by - (resp. - ). Example 3.2: Let and the fuzzy set in defined as follows: . Let be a fts. Then the fuzzy sets and are - and - at the same time in . Remark 3.3: In a fts , then the following statements are true: (i) Every - is a - . (ii) Every - is a - . (iii) Every - is a - . (iv) Every - is a - . Proof: (i) This follows directly from the definition (3.1). (ii) Let be a - in and let be a - such that . Since every - is a - and is a - , . Therefore, is a - in . (iii) From the part (ii) and remark (2.9) (ii). (iv) From the part (iii) and remark (2.9) (iii). Theorem 3.4: A fuzzy set is - iff contains no non-empty - . Proof: Necessity. Suppose that is a non-empty -closed subset of such that . Then . Then . Therefore and . Since is a - and is a - , . Thus . Therefore . Therefore contains no non-empty - .
  • 3. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 58 Paper Publications Sufficiency. Let be a - . Suppose that is not contained in . Then is a non- empty - and contained in which is a contradiction. Therefore, and hence is a - . Theorem 3.5: Let , if is a - relative to and is a - then is a - in a fts . Proof: Let be a - in a fts such that . Given that . Therefore and . This implies . Since is a - relative to , then . implies that . Thus . This implies that . Therefore . Since is a - in . . Also implies that . Thus . Therefore . Since is not contained in , is a - relative to . Theorem 3.6: If is a - and , then is a - . Proof: Let be a - such that . Let be a - in a fts such that . Since is a - , we have whenever . Since and , then . Therefore, . Thus, is a - in . Theorem 3.7: The intersection of a - and a - is a - . Proof: Let be a - and be a - . Since is a - ( ) whenever where is a - . To show that is a - . It is enough to show that ( ) whenever , where is a - . Let then . Since is a - , is a - and is a - ( ) . Now, ( ) ( ) ( ) ( ) . This implies that is a - . Theorem 3.8: If and are two - in a fts , then is a - in . Proof: Let and be two - in a fts . Let be a - in such that . Now, ( ) ( ) ( ) . Hence is a - . Remark 3.9: The union of two - need not be a - . Definition 3.10: The intersection of all - in a fts containing is called fuzzy -closure of and is denoted by - , - : , is a - . Definition 3.11: The union of all - in a fts contained in is called fuzzy -interior of and is denoted by - , - is a - . Proposition 3.12: Let be any fuzzy set in a fts . Then the following properties hold: (i) - iff is a - . (ii) - iff is a - . (iii) - is the largest - contained in . (iv) - is the smallest - containing . Proof: (i), (ii), (iii) and (iv) are obvious.
  • 4. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 59 Paper Publications Proposition 3.13: Let be any fuzzy set in a fts . Then the following properties hold: (i) - - , (ii) - - . Proof: (i) By definition, - is a - - is a - is a - is a - - (ii) The proof is similar to (i). Definition 3.14: A fuzzy set in a fts is said to be a fuzzy -neighbourhood (briefly -nhd) of a fuzzy point if there exists a - such that . A -nhd is said to be a -open-nhd (resp. - closed-nhd) iff is a - (resp. - ). A fuzzy set in a fts is said to be a fuzzy - -neighbourhood (briefly - -nhd) of a fuzzy point (resp. fuzzy set ) if there exists a - in a fts such that (resp. ). Theorem 3.15: A fuzzy set of a fts is - iff ̅ ̅ , for every - of . Proof: Necessity. Let be a - and ̅ . Then and is a - in which implies that as is a - . Hence, ̅ . Sufficiency. Let be a - of a fts such that . Then ̅ and is a - in . By hypothesis, ̅ implies . Hence, is a - in . Theorem 3.16: Let and be a fuzzy point and a fuzzy set respectively in a fts . Then - iff every - -nhd of is -coincident with . Proof: Let - . Suppose there exists a - -nhd of such that ̅ . Since is a - -nhd of , there exists a - in such that whish gives that ̅ and hence . Then - , as is a - . Since , we have - , a contradiction. Thus every - -nhd of is -coincident with . Conversely, suppose - . Then there exists a - such that and . Then we have and ̅ , a contradiction. Hence - . Theorem 3.17: Let and be two fuzzy sets in a fts . Then the following are true: (i) - , - . (ii) - is a - in . (iii) - - when . (iv) iff - , when is a - in . (v) - - ( - ). Proof: (i) and (ii) are obvious. (iii) Let - . By theorem (3.16), there is a - -nhd of a fuzzy point such that ̅ , so there is a - such that and ̅ . Since , then ̅ . Hence - by theorem (3.16). Thus - - . (iv) Let be a - in . Suppose that ̅ , then . Since is a - and by a part (iii), - - . Hence, ̅ - . Conversely, suppose that ̅ - . Then - . Since - , we have . Hence ̅ .
  • 5. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 60 Paper Publications (v) Since - - ( - ). We prove that - ( - - . Suppose that - . Then by theorem (3.16), there exists a - -nhd of a fuzzy point such that ̅ and so there is a - in such that and ̅ . By a part (iv), ̅ - . Then by theorem (3.16), - - . Thus - - - . Hence - - - . Theorem 3.18: Let and be two fuzzy sets in a fts . Then the following are true: (i) - , - . (ii) - is a - in . (iii) - - when . (iv) - - ( - ). Proof: Obvious. Remark 3.19: The following are the implications of a - and the reverse is not true. 4. FUZZY -KERNEL AND FUZZY - -SPACES, Definition 4.1: The intersection of all -open subset of containing is called the fuzzy -kernel of (briefly - ), this means - - : . Definition 4.2: In a fts , a fuzzy set is said to be weakly ultra fuzzy -separated from if there exists a - such that or - . By definition (4.2), we have the following: For every two distinct fuzzy points and of , (i) - is not weakly ultra fuzzy -separated from . (ii) - is not weakly ultra fuzzy -separated from . Corollary 4.3: Let be a fts, then - iff - for each . Proof: Suppose that - . Then there exists a - containing such that . Therefore, we have - . The converse part can be proved in a similar way. Definition 4.4: A fts is called fuzzy - -space ( - -space, for short) if for each - and , then - . Definition 4.5: A fts is called fuzzy - -space ( - -space, for short) if for each two distinct fuzzy points and of with - - , there exist disjoint - such that - and - . Theorem 4.6: Let be a fts. Then is - -space iff - - , for each . - 𝛼 𝑚 - 𝛼 - 𝛼- 𝛼--
  • 6. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 61 Paper Publications Proof: Let be a - -space. If - - , for each , then there exist another fuzzy point such that - and - } this means there exist an - , implies - this contradiction. Thus - - . Conversely, let - - , for each - , then - - [by definition (4.1)]. Hence by definition (4.4), is a - -space. Theorem 4.7: A fts is an - -space iff for each - and , then - . Proof: Let for each - and , then - and let be a - , then for each implies is a - implies - [by assumption]. Therefore - implies - [by corollary (4.3)]. So - . Thus is an - -space. Conversely, let be a - -space and be a - and . Then for each implies is a - , then - [since is a - -space], so - - . Thus - . Corollary 4.8: A fts is - -space iff for each - and , then - - . Proof: Clearly. Theorem 4.9: Every - -space is a - -space. Proof: Let be a - -space and let be a - , , then for each implies is a - and - implies - - . Hence by definition (4.5), - . Thus is a - -space. Theorem 4.10: A fts is - -space iff for each with - - , then there exist - , such that - , - and - , - and . Proof: Let be a - -space. Then for each with - - . Since every - -space is a - -space [by theorem (4.9)], and by theorem (4.6), - - , then there exist - , such that - and - and [since is a - -space], then and are F - such that . Put and . Thus and so that - and - . Conversely, let for each with - - , there exist - , such that - - and - - and , then and are - such that . Put and . Thus, - and - and , so that and implies - and - , then - and - . Thus, is a - -space. Corollary 4.11: A fts is - -space iff for each with - - there exist disjoint - such that - - and - - . Proof: Let be a - -space and let with - - , then there exist disjoint - such that - and - . Also is - -space [by theorem (4.9)] implies for each , then - - [by theorem (4.6)], but - - - - - . Thus - - and - - . Conversely, let for each with - - there exist disjoint - such that - - and - - . Since - , then - - - for each . So we get - and - . Thus, is a - -space.
  • 7. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 62 Paper Publications Definition 4.12: Let be a fts. Then is called: (i) fuzzy -regular space ( -space, for short), if for each fuzzy point and each - such that – , there exist disjoint - and such that and . (ii) fuzzy -normal space ( -space, for short) iff for each pair of disjoint - and , there exist disjoint - and such that and . (iii) fuzzy - -space ( - -space, for short) if it is property -space. (iv) fuzzy - -space ( - -space, for short) iff it is - -space and -space. Example 4.13: Consider the fts of example (3.2). Then is a -space and -space. Remark 4.14: Every - -space is a - -space, . Proof: Clearly. Theorem 4.15: A fts is -space ( - -space) iff for each -closed subset of and with - - then there exist - , such that - , - and - , - and . Proof: Let be a -space ( - -space) and let be a - , , then there exist disjoint - such that and , then and are - such that . Put and , so we get - , - and - , - and . Conversely, let for each -closed subset of and with - - , then there exist - such that - , - and - , - and . Then and are - such that and - , - . So that and . Thus, is a -space ( - -space). Lemma 4.16: Let be a -space and be a - . Then - - . Proof: Let be a -space and be a - . Then for each , there exist disjoint - such that and . Since - , implies - , thus - - . We showing that if implies - - , therefore - - - . As - - [by definition (4.1)]. Thus, - - . Theorem 4.17: A fts is -space ( - -space) iff for each -closed subset of and with - - - - , then there exist disjoint - such that - - and - - . Proof: Let be a -space ( - -space) and let be a - , . Then there exist disjoint - such that and By lemma (4.16), - - - , in the other hand is a - -space [by theorem (4.9) and remark (4.14)]. Hence, by theorem (4.6), - - , for each . Thus, - - and - - . Conversely, let for each - and with - - - - , then there exist disjoint - such that - - and - - . Then and . Thus, is a -space ( - -space). Theorem 4.18: A fts is -space iff for each disjoint - , with - - then there exist - , such that - , - and - , - and .
  • 8. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 63 Paper Publications Proof: Let be a -space and let for each disjoint - , with - - then there exist disjoint - such that and and , then and are - such that and - , - Put and . Thus, - , - and - , - . Conversely, let for each disjoint - , with - - , there exist - , such that - , - and - , - and implies and are - such that . Put and , thus - and - , so that and . Thus is a -space. Theorem 4.19: Every - -space is a -space. Proof: Let be a - and . Then - - , then for each there exist - such that - , - and - , - [since is a - -space and by theorem (4.10)], let , so we have . Hence is a -space, then there exist disjoint - such that and . Thus, is a -space. 5. FUZZY - -SPACES, Definition 5.1: Let be a fts. Then is called: (i) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points in , there exists a - in containing one and not the other. (ii) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points and of , there exists - containing and respectively such that and . (iii) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points and of , there exist disjoint - in such that and . (iv) fuzzy - -space ( - -space, for short) iff it is - -space and r-space. (v) fuzzy - -space ( - -space, for short) iff it is - -space and n-space. Example 5.2: Let and be a fts on . Then is a crisp point in and is a - - space. Example 5.3: Let and be a fts on . Then are crisp points in and is a - -space and - -space. Example 5.4: The discrete fuzzy topology in is a - -space and - -space. Remark 5.5: Every - -space is a - -space, . Proof: Clearly. Theorem 5.6: A fts is - -space iff either - or - , for each . Proof: Let be a - -space then for each , there exists a - such that , or , . Thus either , implies - or , implies - . Conversely, let either - or - , for each . Then there exists a - such that , or , . Thus is a - -space.
  • 9. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 64 Paper Publications Theorem 5.7: A fts is - -space iff either - is weakly ultra fuzzy -separated from or - is weakly ultra fuzzy -separated from for each . Proof: Let be a - -space then for each , there exists a - such that , or , . Now if , implies - is weakly ultra fuzzy -separated from . Or if , implies - is weakly ultra fuzzy -separated from . Conversely, let either - be weakly ultra fuzzy -separated from or - be weakly ultra fuzzy -separated from . Then there exists a - such that - and or - implies , or , . Thus, is a - -space. Theorem 5.8: A fts is - -space iff for each , - is weakly ultra fuzzy -separated from and - is weakly ultra fuzzy -separated from . Proof: Let be a - -space then for each there exist - such that , and , . Implies - is weakly ultra fuzzy -separated from and - is weakly ultra fuzzy -separated from . Conversely, let - be weakly ultra fuzzy -separated from and - be weakly ultra fuzzy -separated from . Then there exist - such that - and - implies , and , . Thus, is a - -space. Theorem 5.9: A fts is - -space iff for each , - . Proof: Let be a - -space and let - . Then - contains another fuzzy point distinct from say . So - implies - is not weakly ultra fuzzy -separated from . Hence by theorem (5.8), is not a - -space this is contradiction. Thus - . Conversely, let - , for each and let be not a - -space. Then by theorem (5.8), - is not weakly ultra fuzzy -separated from , this means that for every - contains - then implies - implies - , this is contradiction. Thus, is a - -space. Theorem 5.10: A fts is - -space iff for each , - and - } . Proof: Let be a - -space then for each , there exists - such that , and , . Implies - and - . Conversely, let - and - , for each . Then there exists - such that , and , . Thus, is a - -space. Theorem 5.11: A fts is - -space iff for each implies - - . Proof: Let be a - -space. Then - and - [by theorem (5.9)]. Thus, - - . Conversely, let for each implies - - and let be not - -space then for each implies - or - [by theorem (5.10)], then - - this is contradiction. Thus, is a - -space. Theorem 5.12: A fts is - -space iff is - -space and - -space. Proof: Let be a - -space and let be a - , then for each , - - [by theorem (5.11)] implies - and - ) this means - , hence - . Thus, is a - -space.
  • 10. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 65 Paper Publications Conversely, let be a - -space and - -space, then for each there exists a - such that , or . Say since is a - -space, then - , this means there exists a - such that . Thus, is a - -space. Theorem 5.13: A fts is - -space iff (i) is - -space and - -space. (ii) is - -space and - -space. Proof: (i) Let be a - -space then it is a - -space. Now since is a - -space then for each , there exist disjoint - such that and implies - and - , therefore - and - . Thus, is a - -space. Conversely, let be a - -space and - -space, then for each , there exists a - such that or , implies - - , since is a - -space [by assumption], then there exist disjoint - such that and . Thus, is a - -space. (ii) By the same way of part (i) a - -space is - -space and - -space. Conversely, let be a - -space and - -space, then for each , there exist - such that and implies - - } , since is a - -space, then there exist disjoint - such that and . Thus, is a - -space. Corollary 5.14: A - -space is - -space iff for each with - - then there exist - , such that - , - and - , - and . Proof: By theorem (4.10) and theorem (5.13). Corollary 5.15: A - -space is - -space iff one of the following conditions holds: (i) for each with - - , then there exist - such that - - and - - . (ii) for each with - - then there exist - , such that - , - and - , - and . Proof: (i) By corollary (4.11) and theorem (5.13). (ii) By theorem (4.10) and theorem (5.13). Theorem 5.16: A - -space is - -space iff one of the following conditions holds: (i) for each , - . (ii) for each , - - implies - - . (iii) for each , either - or - . (iv) for each , then - and - . Proof: (i) Let be a - -space. Then is a - -space and - -space [by theorem (5.13)]. Hence by theorem (5.9), - for each . Conversely, let for each , - , then by theorem (5.9), is a - -space. Also is a - -space by assumption. Hence by theorem (5.13), is a - -space. (ii) Let be a - -space. Then is - -space [by remark (5.5)]. Hence by theorem (5.11), - - for each . Conversely, assume that for each , - - implies - - . So by theorem (5.11), is a - -space, also is a - -space by assumption. Hence by theorem (5.13), is a - -space.
  • 11. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 66 Paper Publications (iii) Let be a - -space. Then is a - -space [by remark (5.5)]. Hence by theorem (5.6), either - or - for each . Conversely, assume that for each , either - or - for each . So by theorem (5.6), is a - -space, also is - -space by assumption. Thus is a - -space [by theorem (5.13)]. (iv) Let be a - -space. Then is a - -space and - -space [by theorem (5.13)]. Hence by theorem (5.10), - and - . Conversely, let for each then - and - . Then by theorem (5.10), is a - -space. Also is a - -space by assumption. Hence by theorem (5.13), is a - -space. Remark 5.17: Each fuzzy separation axiom is defined as the conjunction of two weaker axioms: - -space = - -space and - -space = - -space and - -space, . Theorem 5.18: Let be a fts and - for each then is - -space if and only if it is a - -space. Proof: Let be a - -space. Then, is a - -space [By remark (5.17)]. Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, - for each , then is a - -space [by theorem (5.9)]. Hence by remark (5.17), is a - -space. Theorem 5.19: Let be a fts and let , implies - - , then is a - -space iff it is a - -space. Proof: Let be a - -space. Then is a - -space [by remark (5.17)]. Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, - - , for each , then by theorem (5.11), is a - -space. Hence by remark (5.17), is a - -space. Theorem 5.20: Let be a fts and for each either - or - , then is a - -space iff it is a - -space. Proof: Let be a - -space. Then is a - -space [by remark (5.17)]. Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, for each either - or - . This means either - is weakly ultra fuzzy -separated from or - is weakly ultra fuzzy -separated from , so by theorem (5.7), is a - -space. Hence by remark (5.17), is a - -space. Theorem 5.21: Let be a fts and let , then - and - , is a - -space iff it is a - -space. Proof: Let be a - -space. Then is a - -space [by remark (5.17)]. Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, for each then - and - . Therefore, - is weakly ultra fuzzy -separated from and - is weakly ultra fuzzy -separated from , so by theorem (5.8), is a - -space. Hence by remark (5.17), is a - -space. Remark 5.22: The relation between fuzzy -separation axioms can be representing as a matrix. Therefore, the element refers to this relation. As the following matrix representation shows:
  • 12. 1022-ISSN 2350 International Journal of Recent Research in Mathematics Computer Science and Information Technology www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu Page | 67 Paper Publications and - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Matrix Representation The relation between fuzzy -separation axioms REFERENCES [1] S. Bin Shahna, “On fuzzy strong semi continuity and fuzzy pre continuity”, Fuzzy sets and system, 44(2), (1991), 303-308. [2] Sikn, “On fuzzy FC - Compactness”, Comm. Korean Math. Soc., 13(1998), 137-150. [3] L. Chang, “Fuzzy topological spaces”, J. Math. Anal. Appl., 24(1968), 182-190. [4] K. Wong, “Fuzzy points and local properties of fuzzy topology”, J. Math. Anal. Appl., 46(1974), 316-328. [5] G. Balasubramania and P. Sundaram, “On some generalizations of fuzzy continuous functions”, Fuzzy sets and Systems, 86(1), (1997), 93-100. [6] L. A. Zadeh, “Fuzzy sets”, Information and control, 8 (1965), 338-353. [7] M. Mathew and R. Parimelazhagan, “ -Closed set in topological spaces”, International Journal of Mathematical Analysis, Vol.8, No.47, (2014), 2325-2329. [8] P. M. Pu and Y. M. Liu, “ Fuzzy topology I. Neighborhood structure of a fuzzy point and Moore-Smith convergence”, J. Math. Anal. Appl., 76(1980), 571-599. [9] R. K. Saraf and S. Mishra, “Fgα-closed sets”, J. Tripura Math. Soc., 2(2000), 27-32. [10] R. K. Saraf, G. Navalagi and M. Khanna, “On fuzzy semi pre generalized closed sets”, Bull. Malaysian Math. Sci. Soc., 28(1), (2005), 19-30. [11] S. S. Thakur and S. Singh, “On fuzzy semi pre open sets and fuzzy semi pre continuous”, Fuzzy sets and system, 98(3), (1998), 383-391. [12] S. Ganguly and S. Saha, “A note on -continuity and -connected sets in fuzzy set theory”, Simon Stevin, 62(1988).