Lqwhuqdwlrqdo#Mrxuqdo#ri#Ix}}|#Orjlf#dqg#Lqwhooljhqw#V|vwhpv/#yro1#44/#qr1#6/#Vhswhpehu#5344/#ss1#4860497

kwws=22g{1grl1ruj243186<42LMILV15344144161486

Fuzzy Mappings and Fuzzy Equivalence Relations

Pyung Ki Lim1 , Ga Hee Choi2 and Kul Hur3

1,2,3
Division of Mathematics and Informational Statistics, and Nanoscale Science and
Technology Institute, Wonkwang University, Iksan, Chonbuk, Korea 570-749

Abstract

Equivalence relations and mappings for crisp sets are very well known. This paper attempts an investigation of
equivalence relations and mappings for fuzzy sets. We list some concepts and results related to fuzzy relations.
We give some examples corresponding to the concept of fuzzy equality and fuzzy mapping introduced by Demirci
[1]. In addition, we introduce the notion of preimage and quotient of fuzzy equivalence relations. Finally, we
investigate relations between a fuzzy equivalence relation and a fuzzy mapping.

Key Words : fuzzy mapping, fuzzy relation, fuzzy equivalence relation, fuzzy quotient of fuzzy mapping by
fuzzy equivalence relation.

relation and a fuzzy mapping.

Throughout this paper, we denote the unit interval
[0, 1] as I, and X, Y , Z, etc., denote ordinary sets. In
1. Introduction particular, I X denotes the set of all fuzzy sets in X.

The notion of fuzzy sets in a set generalises that

of crisp subsets, and Zadeh[9] introduced it as an
approach to a mathematical representation of vague-
ness in everyday language. Also a fuzzy relation be-
2. Preliminaries
tween Xand Y as a fuzzy set in X × Y was pro-
posed by Zadeh[9]. Later he studied similarity rela-
tions in [10]. Subsequently, Goguen[2], Murali[3] and In this section, we list some basic notions and re-
Ovchinnikov[5], etc., have studied fuzzy relations in sults which are needed in the later sections.
various contents. Furthermore, Nemitz[4] have inves-
tigated fuzzy relations connected with equivalence re- Definition 2.1 [7]. Let f : X → Y be an (ordinary)
lations and fuzzy functions. In particular, more re- mapping, let A ∈ I X and let B ∈ I Y . Then:
cently, Demirci[1] studied fuzzy equalities and fuzzy (i) The image of A under f, denoted by f (A), is a
mappings. fuzzy set in Y defined as follows : For each y ∈ Y ,
Equivalence relations and mappings in crisp set
theory are very well known. This paper attempts an ⎧ 
⎨ A(x) if f −1 (y) = ∅,
investigation of equivalence relations and mappings [f (A)](y) = x∈f −1 (y)
in fuzzy set theory. In Section 2, we list some con- ⎩
0 otherwise
cepts and results related to fuzzy relations. In Section
3, we give some examples corresponding to the con- (ii) The preimage of B under f, denoted by f −1 (B),
cept of fuzzy equality and fuzzy mapping introduced is a fuzzy set in X defined as follows : For each x ∈ X,
by Demirci[1]. Also, adding to his results, we obtain [f −1 (B)](x) = (B ◦ f )(x) = B(f (x)).
some another results. In Section 4, we introduce the
notions of preimage and quotient of fuzzy equivalence Result 2.A [8]. Let f : X → Y be an(ordinary) map-
relations. And we study some properties. In Section ping, let A ∈ I X and {Aα }α∈Γ ⊂ I X , and let B ∈ I Y
5, we investigate relations between a fuzzy equivalence and {Bα }α∈Γ ⊂ I Y . Then:
Manuscript received Jul. 12, 2011; revised Sep. 9, 2011;
accepted Sep. 21, 2011.
3
Corresponding author
This paper was supported by Wonkwang University in 2011.
486
##
Lqwhuqdwlrqdo#Mrxuqdo#ri#Ix}}|#Orjlf#dqg#Lqwhooljhqw#V|vwhpv/#yro1#44/#qr1#6/#Vhswhpehu#5344

(a) [f (A)]c ⊂ f (Ac ). In particular, f is bijective, Let R be a fuzzy equivalence relation on X and
then [f (A)]c = f (Ac ). let a ∈ X. We defined the mapping Ra : X → I as
(b) f −1 (B c ) = [f −1 (B)]c . follows : ∀x ∈ X, Ra(x) = R(a, x).
(c) If Aα ⊂ Aβ , for α, β ∈ Γ, then f (Aα ) ⊂ f (Aβ ). Then clearly Ra ∈ I X . In this case, Ra is called a
(d) If Bα ⊂ Bβ , for α, β ∈ Γ, then f −1 (Bα ) ⊂ fuzzy equivalence class of R containing a ∈ X. The
−1
f (Bβ ). set {Ra : a ∈ X} is called the fuzzy quotient set of X
(e) A ⊂ f −1 (f (A)). In particular, if f is injective, by R and denoted by X/R (See[5]).
then f −1 (f (A)) = A.
(f) f −1 (f (B)) ⊂ B. In particular, if f is surjec- Result 2.B [5, Lemma 2, Corollary and Theorem 1].
tive, then f (f −1 (B)) = B. Let R be a fuzzy equivalence relation on X. Then
  (a) Ra = Rb if and only if R(a, b) = 1 , ∀a, b ∈ X.
(g) f ( Aα ) = f (Aα ).
(b) Ra ∩ Rb = ∅ if and only if R(a, b) = 0,
α∈Γ α∈Γ
  ∀a, b ∈ X.
(h) f −1
( Bα ) = f −1 (Bα ). 
(c) Ra = X.
α∈Γ α∈Γ a∈X
(i) f ( Aα ) ⊂ f (Aα ).
α∈Γ α∈Γ
 
−1
(j) f ( Bα ) = f −1 (Bα ).
α∈Γ α∈Γ 3. Fuzzy mappings
(h) If g : Y → Z is a mapping and C ∈ I Z , then
(g◦f )−1 (C) = f −1 (g −1 (C)), and (g◦f )(A) = g(f (A)).

Definition 2.2 [9]. R is called a fuzzy relation from X
to Y (or a fuzzy relation on X × Y ) if R ∈ I X×Y , i.e,
R is a fuzzy set in X × Y . In particular, if R ∈ I X×X ,
then R is called a fuzzy relation on (or in ) X.
We will denote the set of all fuzzy relations on X
as FR(X).
Definition 2.3 [10]. Let R ∈ I X×Y and S ∈ I Y ×Z .
Then:
(i) The sup-min composition of R and S, denoted
by S ◦R, is a fuzzy relation on X ×Z defined as follows:
∀x ∈ X, ∀z ∈ Z,

(S ◦ R)(x, z) = [R(x, y) ∧ S(y, z)].
y∈Y
(ii) The inverse of R, denoted by R−1 , is a fuzzy
relation on Y × X defined by R−1 (y, x) = R(x, y),
∀(x, y) ∈ X × Y .
Definition 2.4 [5,10]. Let R ∈ FR(X). Then R is
said to be :
In this section, we list some concepts and their
properties by Demirci [1]. And we give some examples
and obtain some results.
Definition 3.1[1]. A mapping EX : X × X → I is
called a fuzzy equality on X if it satisfies the following
conditions :
(e.1) EX (x, y) = 1 ⇔ x = y, ∀x, y ∈ X,
(e.2) EX (x, y) = EX (y, x), ∀x, y ∈ X,
(e.3) EX (x, y)∧EX (y, z) ≤ EX (x, z), ∀x, y, z ∈ X.
We will denote the set of all fuzzy equalities as
E(X).
Example 3.1. Let X={ ,,} and let EX :
X ×X → I be the mapping defined as following matrix
:
EX  
1 0.3 0.3
 0.3 1 0.8
 0.3 0.8 1
Then we can easily see that EX ∈ E(X).

(i) reflexive if R(x, x) = 1 , ∀x ∈ X. Definition 3.2[1]. Let f be a fuzzy relation on X ×Y .

(ii) symmetric if R(x, y) = R(y, x), ∀x, y ∈ X, i.e,
R = R−1 .
(iii) transitive if R ◦ R ⊂ R,
(iv) a fuzzy equivalence relation on X if it satisfies
(i),(ii) and (iii).
We will denote the set of all fuzzy equivalence re-
lation on X as FER(X).
Then f is called a fuzzy mapping with respect to (in
short, w.r.t.) EX ∈ E(X) and EY ∈ E(Y ), denoted
by f : X → Y , if it satisfies the following condition :
(f.1) ∀x ∈ X, ∃y ∈ Y , such that f (x, y) > 0,
(f.2) ∀x1 , x2 ∈ X, ∀y1 , y2 ∈ Y , f (x1 , y1 ) ∧
f (x2 , y2 ) ∧ EX (x1 , x2 ) ≤ EY (y1 , y2 )
Example 3.2. Let X and EX ∈ E(X) be same as in
Example 3.1. Let Y = {a, b} and EY : Y × Y → I be

487
 ##
Ix}}|#Pdsslqjv#dqg#Ix}}|#Htxlydohqfh#Uhodwlrqv

the mapping defined as follows : k  

a 1 0.3 0.2
EY a b b 1 0 0.3
a 1 0.7 Then we can easily show that k : Y → X is strong
b 0.7 1 and injective w.r.t. EY and EX .
Then it is easily seen that EY ∈ E(Y ). Now define
the fuzzy relation f on X × Y follows : Definition 3.4[1]. The identify fuzzy mapping on X,
denoted by IX , is the fuzzy relation on X × X defined
fa b by:
0.5 1 
 0.4 0.7 1 if x = y,
IX (x, y) =
 1 0 0 otherwise, for any x, y ∈ X.
Then we can easily prove that f : X → Y is a fuzzy
mapping w.r.t. EX and EY .
Remark 3.4. (a) IX : X → X is strong bijective
Definition 3.3[1]. Let f : X → Y be a fuzzy map- w.r.t. any fuzzy equality on X. Moreover IX itself is
ping w.r.t. EX ∈ E(X) and EY ∈ E(Y ). Then f is a fuzzy equality on X.
said to be : (b) An (ordinary) mapping f : X → Y is a
strong fuzzy mapping w.r.t. EX = IX ∈ E(X) and
(i) strong if ∀x ∈ X, ∃y ∈ Y such that f (x, y) = 1, EY = IY ∈ E(Y )
(ii) surjective if ∀y ∈ Y , ∃x ∈ X such that (c) Let f : X → Y be an (ordinary) mapping. If
f (x, y) > 0, f is injective [resp surjective and bijective], then f is
(iii) strong surjective if ∀y ∈ Y , ∃x ∈ X such that injective [resp. strong surjective and strong bijective]
f (x, y) = 1, w.r.t. IX ∈ EX and IY ∈ E(Y ).
(iv) injective if f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ EY (y1 , y2 ) ≤
EX (x1 , x2 ), ∀x1 , x2 ∈ X, ∀y1 , y2 ∈ Y , Result 3.A[1, Proposition 2.1]. Let f : X → Y
(v) bijective if it is surjective and injective, and g : Y → Z be fuzzy mappings w.r.t. EX ∈ E(X),
(vi) strong bijective if it is strong surjective and EY ∈ E(Y) and EZ ∈ E(Z). Then sup-min composi-
injective. tion g ◦ f is a fuzzy mapping g ◦ f : X → Z w.r.t. EX
and EZ
Example 3.3. (a) Let X, Y , EX , EY and f be same
as in Example 3.2. Then f : X → Y is not strong Proposition 3.5. Let f : X → Y and g : Y → Z
but strong surjective . Moreover , it can be easily seen be fuzzy mappings w.r.t. EX ∈ E(X), EY ∈ E(Y )
that f is not injective. and EZ ∈ E(Z). If f and g are strong [resp. injec-
(b) Let X, Y , EX and EY be same as in Example tive, surjective, strong surjective, bijective and strong
3.2. Define the fuzzy relation g on X × Y as follows : bijective], then so is g ◦ f .

g a b Proof. (i) Suppose f and g are strong and let x ∈ X.

0.5 1 Since f is strong, ∃y0 ∈ Y such that f (x, y0 ) = 1 .
 1 0.7 Since g is strong, ∃z0 ∈ Z such that g(y0 , z0 ) = 1.
 1 0 Thus 
Then we can easily see that g is strong and strong (g ◦ f )(x, z0 ) = [f (x, y] ∧ g(y, z0 )] ≥ f (x, y0 ) ∧
surjective w.r.t. EX and EY . But g is not injective. y∈Y
(c) Let X, Y , EX and EY be same as in Example g(y0 , z0 ) = 1.
3.2. Define the fuzzy relation h on Y × X as follows : So g ◦ f is strong.
(ii) Suppose f and g are surjective and let z ∈ Z.
h   Since g is surjective, ∃y0 ∈ Y such that g(y0 , z) > 0.
a 0.5 0.4 1 Since f is surjective, ∃x0 ∈ X such that f (x0 , y0 ) > 0.
b 1 0.7 0 Thus 
Then h(a, ) ∧h(b,) ∧EY (a, b) = 0.5  0.3 = EX (g◦f )(x0 , z) = [f (x0 , y)∧g(y, z)] ≥ f (x0 , y0 )∧
( ,) . Thus h is not a fuzzy mapping w.r.t. EY and y∈Y
EX . g(y0 , z) > 0.
(d) Let X,Y , EX and EY be same as in Example So g ◦ f is surjective.
3.2. Define the fuzzy relation k on Y × X as follows : (iii) Suppose f and g are strong surjective and let
z ∈ Z. Since g is strong surjective, ∃y0 ∈ Y such that

488
##
Lqwhuqdwlrqdo#Mrxuqdo#ri#Ix}}|#Orjlf#dqg#Lqwhooljhqw#V|vwhpv/#yro1#44/#qr1#6/#Vhswhpehu#5344

g(y0 , z) = 1. Since f is strong surjective, ∃x0 ∈ X Let f : X → Y and g : Y → Z be two ordinary

such that f (x0 , y0 ) =1. Thus mappings. Then it is well-known that if g ◦ f : X → Z
(g ◦f )(x0 , z) = [f (x, y)∧g(y, z)] ≥ f (x0 , y0 )∧ is injective, then so is f . However, in case which f
y∈Y and g are fuzzy mappings, the above statement does
g(y0 , z) = 1. not hold.
So g ◦ f is strong surjective.
(iv) Suppose f and g are injective. Let x1 , x2 ∈ X, Example 3.6. Let X = {x1 , x2 , x3 }, Y = {y1 , y2 }
let y1 , y2 ∈ Y and let z1 , z2 ∈ Z. and Z = {z1 , z2 }, let EX : X × X → I be the mapping
Since f is injective, defined by EX (xi , xi ) = 1 (i = 1, 2, 3), EX (x1 , x2 ) =
f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ EY (y1 , y2 ) ≤ EX (x1 , x3 ) = EX (x2 , x1 ) = EX (x3 , x1 ) = 0 and
EX (x1 , x2 ). (3.1) EX (x2 , x3 ) = EX (x3 , x2 ) = 0.5. Then clearly EX ∈
Since g is injective, E(X).
g(y1 , z1 ) ∧ g(y2 , z2 ) ∧ EZ (z1 , z2 ) ≤ Now let f : X × Y → I and g : Y × Z → I be the
EY (y1 , y2 ). (3.2) mappings defined as follows, respectively :
By (3.1) and (3.2), f (x1 , y1 ) = f (x2 , y2 ) = 1, f (x3 , y2 ) = 0.8
(f (x1 , y1 ) ∧ g(y1 , z1 )) ∧ (f (x2 , y2 ) ∧ g(y2 , z2 )) ∧ and
EZ (z1 , z2 ) ≤ EX (x1 , x2 ). g(y1 , z1 ) = 1, g(y2 , z2 ) = 0.2.
Thus   Then we can easily see that f is a fuzzy mapping w.r.t.
( [f (x1 , y)∧g(y, z1 )])∧( f (x2 , y)∧g(y, z2 ))∧ EX and IY , and g is a fuzzy mapping w.r.t. IY and
y∈Y y∈Y IZ . Furthermore, we can see that g ◦ f : X → Z is a
EZ (z1 , z2 ) fuzzy injective mapping w.r.t. EX and IZ . But f is
≤ EX (x1 , x2 ). So (g ◦ f )(x1 , z1 ) ∧ (g ◦ f )(x2 , z2 ) ∧ not injective.
EZ (z1 , z2 ) ≤ EX (x1 , x2 ).
Hence g ◦ f is injective. Definition 3.7. Let f : X → Y be a fuzzy mapping
The remaiders are obvious by (i), (ii), (iii) and w.r.t. EX ∈ E(X) and EY ∈ E(Y ). Then f is said to
(iv). be invertible if the fuzzy relation f −1 on Y × X is a
fuzzy mapping f −1 : Y → X w.r.t. EY and EX .
Proposition 3.6. Let f : X → Y and g : Y → Z be
fuzzy mappings w.r.t. EX ∈ E(X), EY ∈ E(Y ) and Lemma 3.8. Let f : X → Y be a fuzzy mapping
EZ ∈ E(Z). w.r.t. EX ∈ E(X) and EY ∈ E(Y ). If f is invertible,
(a) If g ◦ f is strong, then so is f . then f is bijective.
(b) If g ◦ f is surjective[resp. strong surjective],
then so is g. Proof. Suppose f is invertible and let y ∈ Y . Since
f −1 : Y → X is a fuzzy mapping w.r.t. EY and EX ,
Proof.(a) Suppose g ◦ f is strong and let x ∈ X. ∃x0 ∈ X such that f −1 (y, x0 ) > 0. Then f (x0 , y) > 0.
Then ∃Z0 ∈ Z  such that (g ◦ f )(x, z0 ) = 1. Thus Thus f is surjective. Now let x1 , x2 ∈ X and let
(g ◦ f )(x, z0 ) = [f (x, y) ∧ g(y, z0 )] = 1. So ∃y0 ∈ Y y1 , y2 ∈ Y . Since f −1 : Y → X is a fuzzy mapping,
y∈Y f −1 (y1 , x1 ) ∧ f −1 (y2 , x2 ) ∧ EY (y1 , y2 ) ≤ EX (x1 , x2 ).
such that f (x, y0 ) ∧ g(y0 , z0 ) = 1. In particular Then f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ EY (y1 , y2 ) ≤ EX (x1 , x2 ).
f (x, y0 ) = 1. Hence f is strong. So f is injective. Hence f is bijective.
(b) Suppose g ◦ f is surjective and let z ∈ Z. Then
∃x0 ∈ X such that (g ◦ f )(x0 , z) > 0. Lemma 3.9. Let f : X → Y be a bijective fuzzy
Thus  mapping w.r.t. EX ∈ E(X) and EY ∈ E(Y ). Then
[f (x0 , y) ∧ g(y, z)] > 0 the fuzzy relation f −1 on Y × X is a bijective fuzzy
y∈Y mapping f −1 : Y → X w.r.t. EY and EX .
So ∃y0 ∈ Y such that f (x0 , y0 ) ∧ g(y0 , z) > 0. In
Particular, g(y0 , z) > 0. Hence g is surjective. Proof. Let y ∈ Y . Since f is surjective, ∃x0 ∈ X
Now suppose g◦f is strong surjective and let z ∈ Z. such that f (x0 , y) > 0. Then f −1 (y, x0 ) > 0.
Then ∃x0 ∈ X such that (g ◦ f )(x0 , z) = 1. Thus f −1 satisfies the condition (f.1). Now let
Thus  y1 , y2 ∈ Y and let x1 , x2 ∈ X. Since f is injective,
[f (x0 , y) ∧ g(y, z)] = 1. f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ EY (y1 , y2 ) ≤ EY (x1 , x2 ). Then
y∈Y f −1 (y1 , x1 ) ∧ f −1 (y2 , x2 ) ∧ EY (y1 , y2 ) ≤ EX (x1 , x2 ).
So ∃y0 ∈ Y such that f (x0 , y0 ) ∧ g(y0 , z) = 1. In Thus f −1 satisfies the condition (f.2). So f −1 :
particular, g(y0 , z) = 1. Hence g is surjective. Y → X is fuzzy mapping w.r.t. EY and EX . Let
x ∈ X. Since f is a fuzzy mapping, ∃y0 ∈ Y

489
 ##
Ix}}|#Pdsslqjv#dqg#Ix}}|#Htxlydohqfh#Uhodwlrqv


such that f (x, y0 ) > 0. Then f −1 (y0 , x) > 0. = f (x, y) = 1.
Thus f −1 is surjective. Now let y1 , y2 ∈ Y and x∈X
let x1 , x2 ∈ X. Since f is a fuzzy mapping, So, in either cases, IY ⊂ f ◦ f −1 . Hence f ◦ f −1 =
f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ EX (x1 , x2 ) ≤ EY (y1 , y2 ). Then IY .
f −1 (y1 , x1 ) ∧ f −1 (y2 , x2 ) ∧ EX (x1 , x2 ) ≤ EY (y1 , y2 ).
Thus f −1 is injective. So f −1 is bijective. This com- The following is the immediate result of Result 3.B
petes the proof. and Lemma 3.11.

The following shows us that f : X → Y is strong Theorem 3.12. Let f : X → Y be a fuzzy mapping
surjective but f −1 : Y → X is not strong surjective. w.r.t. EX ∈ E(X) and EY ∈ E(Y ). If f is strong
Thus f is strong bijective but f −1 is not strong bijec- and strong bijective, EX = IX and EY = IY , then
tive. f −1 ◦ f = IX and f ◦ f −1 = IY .

Example 3.9. Let X, Y and EX be the same as in Result 3.C[1, Proposition 2.4]. Let f : X → Y
Example 3.6. We define the mapping f : X × Y → I and g : Y → Z be bijective w.r.t. EX ∈ E(X), EY ∈
as follows: E(Y ) and EZ ∈ E(Z). Then (g ◦ f )−1 = f −1 ◦ g −1
f (x1 , y1 ) = f (x2 , y2 ) = 1 and f (x3 , y2 ) = 0.5. and the fuzzy relation (g ◦ f )−1 is a fuzzy mapping
Then we can easily check that f is strong surjective (g ◦ f )−1 : Z → X w.r.t. EZ and EX .
but f −1 is not strong surjective. Moreover, f is in-
jective. So f is strong bijective but f −1 is not strong Definition 3.13. [1]. Let f : X → Y be a fuzzy
bijective. mapping, let A ∈ I X and let B ∈ I Y . Then:
(i) The image of A under f, denoted by f (A), is a
The following is the immediate result of Lemmas fuzzy set in Y defined
 as follows:
3.8 and 3.9. f (A)(y) = [A(x) ∧ f (x, y)], ∀y ∈ Y .
x∈X
Theorem 3.10. [1, Proposition 2.2]. Let f : X → Y (ii) The preimage of B under f, denoted by f −1 (B),
be a fuzzy mapping w.r.t. EX ∈ E(X) and EY ∈ is a fuzzy set in X defined
 as follows:
E(Y ). Then f is invertible if and only if f is bijective. f −1 (B)(x) = [B(y) ∧ f (x, y)], ∀x ∈ X.
y∈Y
Result 3.B[1, Proposition 2.3]. If f : X → Y Remark 3.13. (a) If f : X → Y is an (ordinary)
is strong and injective w.r.t. EX = IX ∈ E(X) and mapping, then it is clear that Definition 3.13 is iden-
EY ∈ E(Y ), the f −1 ◦ f = IX . tical with Definition 2.1
(b) If f : X → Y is strong surjective, then
Lemma 3.11. Let f : X → Y be a fuzzy mapping
f (A)(y) = A(x), ∀y ∈ Y .
w.r.t. EX ∈ E(X) and EY ∈ E(Y ). If f is strong
f (x,y)=1
surjective and EY = IY , then f ◦ f −1 = IY .
(c) If f : X → Y is strong, then f −1 (B)(x) =

Proof. Let y, y  ∈ Y . Then B(y), ∀x ∈ X.
(f◦ f −1 )(y, y  ) f (x,y)=1

= [f −1 (y, x) ∧ f (x, y  )] The following is the immediate result of Definition

x∈X 3.13.

= [f (x, y) ∧ f (x, y  )]
x∈X Proposition 3.14. Let f : X → Y and g : Y → Z be

= 
[f (x, y)∧f (x, y )∧EX (x, x)] [∵ EX (x, x) = 1] fuzzy mappings w.r.t. EX ∈ E(X), EY ∈ E(Y ) and
x∈X EZ ∈ E(Z), let A ∈ I X and let B ∈ I Z . Then :
≤ EY (y, y  ) [∵ f is a fuzzy mapping] (a) (g ◦ f )(A) = g(f (A)).
=IY (y, y  ). [∵ EY = IY ] (b) (g ◦ f )−1 (B) = f −1 (g −1 (B)).
Thus f ◦ f −1 ⊂ IY . Now let y, y  ∈ Y . Then clearly
IY (y, y  ) = 1 or IY (y, y  ) = 0. If IY (y, y  ) = 0, Result 3.D[1, Proposition 2.5]. Let f : X → Y be
then clearly IY (y, y  ) ≤ (f ◦ f −1 )(y, y  ). Suppose a fuzzy mapping w.r.t. EX ∈ E(X) and EY ∈ E(Y ),
IY (y, y  ) = 1, i.e, y = y  . Since f is strong surjec- let A ∈ I X and let B ∈ I Y .
tive, for y ∈ Y , ∃x0 ∈ X such that f (x0 , y) = 1. Thus (a) If f is strong, then A ⊂ f −1 (f (A)).
(f −1  −1 (b) If EX = IX and f is injective, then
◦ f )(y, y ) = (f ◦ f )(y, y)
= −1
[f (y, x) ∧ f (x, y)] f −1 (f (A)) ⊂ A.
x∈X (c) If f is strong surjective, then B ⊂ f (f −1 (B)).

48:
##
Lqwhuqdwlrqdo#Mrxuqdo#ri#Ix}}|#Orjlf#dqg#Lqwhooljhqw#V|vwhpv/#yro1#44/#qr1#6/#Vhswhpehu#5344

(d) If EY = IY , then f (f −1 (B)) ⊂ B. (c) It is clear from (a) and (b).

The following is the immediate result of Theorem Result 3.E[1, Proposition 2.6]. Let f : X → Y be
2.5 in [6] and Definition 3.13. a fuzzy mapping w.r.t. EX ∈ E(X) and EY ∈ E(Y ),
let A ∈ I X and let B ∈ I Y .
Proposition 3.15. Let f : X → Y be a fuzzy map- (a) If EX = IX and f is injective, then f (Ac ) ⊂
ping w.r.t. EX ∈ E(X) and EY ∈ E(Y ). [f (A)]c .
(a) Define the (ordinary) relation f from I X to I Y (b) If f is strong surjective, then [f (A)]c ⊂ f (Ac ).
as follows: f (A) = f (A), ∀A ∈ I X . Then f : I X → I Y (c) If f is strong, then [f −1 (B)]c ⊂ f −1 (B c ).
is an (ordinary) mapping. (d) If EY = IY , then f −1 (B c ) ⊂ [f −1 (B)c ].
(b) Define the (ordinary) relation f from I Y to
I as follows: f (B) = f −1 (B), ∀B ∈ I Y . Then
X Result 3.F[1, Proposition 2.7]. Let f : X → Y be
f : I Y → I X is an ordinary mapping. a fuzzy mapping w.r.t. EX ∈ E(X) and EY ∈ E(Y ),
let {Aα }α∈Γ ⊂ I Y and let {Bα }α∈Γ ⊂ I Y .
 
The followings are the immediate results of Result (a) f ( Aα ) = f (Aα ).
3.D and Proposition 3.14. α∈Γ α∈Γ
 
−1
(b) f ( Bα ) = f −1 (Bα ).
Corollary 3.15. Let f : X → Y be strong surjec- α∈Γ α∈Γ
tive w.r.t. EX ∈ E(X) and EY = Iy ∈ E(Y ). Then (c) f ( Aα ) ⊂ f (Aα ).
f¯ ◦ f ◦ f¯ = f¯ α∈Γ
 α∈Γ

−1
(d) f ( Bα ) ⊂ f −1 (Bα ).
X
Proof. Let A ∈ I . Since f is strong surjec- α∈Γ α∈Γ
tive, by Result 3.D(c), f (A) ⊂ f (f −1 (f (A))). Since (e) If Aα ⊂ Aβ for α, β ∈ Γ, then f (Aα ) ⊂ f (Aβ ).
EY = IY , by Result 3.D(d), f (f −1 (f (A))) ⊂ f (A). (f) If Bα ⊂ Bβ for α, β ∈ Γ, then f −1 (Bα ) ⊂
−1
So f (f −1 (f (A))) = f (A). Hence f¯ ◦ f ◦ f¯ = f¯. f (Bβ ).

(g) If f is injective and EX = IX , then f (Aα ) ⊂
Proposition 3.16. Let f : X → Y be a fuzzy map-  α∈Γ
ping w.r.t. EX ∈ E(X) and EY ∈ E(Y ). f( (Aα ).
(a) If f is strong, injective and EX = IX , then f ◦ f¯ α∈Γ
 
is bijective. Hence f¯ is injective and f is surjective. (h) If EY = IY , then f −1 (Bα ) ⊂ f −1 ( Bα ).
α∈Γ α∈Γ
(b) If f is strong surjective and EY = IY , then f¯◦f
The following is the immediate result of Definition
is bijective. Hence f¯ is surjective and f is injective.
3.1
(c) If f is strong, strong bijective, EX = IX and
EY = IY , then f¯ and f are bijective.
Let {Xα }α∈Γ be a family of sets
Proposition 3.17.
and let X = Xα be the product of {Xα }α∈Γ .
Proof.(a) Clearly f ◦ f¯ : I X → I X is a mapping. Sup- α∈Γ
pose (f ◦ f¯)(A1 ) = (f ◦ f¯)(A2 ) ∀A1 , A2 ∈ I X . Then If EXα is a
fuzzy equality on Xα for each α ∈ Γ,
f (f¯(A1 )) = f (f¯(A2 )). Thus, by the definitions of f then EX = EXα is a fuzzy equality on X, where
and f¯, f −1 (f (A1 )) = f −1 (f (A2 )). By Result 3.D, α∈Γ
EX : X × X → I is the mapping defined as follows :
A1 = A2 . So f ◦ f¯ is injective. Let A ∈ I X .

Then clearly f (A) ∈ I Y . Moreover, by Result 3.D, ∀(xα ), (yα ) ∈ X, EX ((xα ), (yα )) = EXα (xα , yα ).
α∈Γ
f −1 (f (A)) = A. Thus (f ◦ f¯)(A) = A. So f ◦ f¯ is
The following is the immediate result of Definition
surjective. Hence f ◦ f¯ is bijective.
3.2 and Proposition 3.17.
(b) Clearly f¯ ◦ f : I Y → I X is a mapping. Sup-

pose (f¯ ◦ f )(B1 ) = (f¯ ◦ f )(B2 ), ∀B1 , B2 ∈ I Y . Then Proposition 3.18. Let X = Xα be the product
f¯(f B1 )) = f¯(f (B2 )), i.e, f (f −1 (B1 )) = f (f −1 (B2 )). α∈Γ

By Result 3.D, B1 = B2 . Thus f¯ ◦ f is injec- of a family {Xα }α∈Γ of sets. For each α ∈ Γ, we define
tive. Let B ∈ I Y . Then clearly f −1 (B) ∈ I X and the fuzzy relation πα on X × Xα as follows :
f (f −1 (B)) = B. Thus (f¯ ◦ f )(B) = B. So f¯ ◦ f is 
1 if x = xα ,
surjective. Hence f¯ ◦ f is bijective. πα ((xα ), x) =
≥0 if x =
 xα , ∀(xα ) ∈ X, ∀x ∈ Xα .

48;
 ##
Ix}}|#Pdsslqjv#dqg#Ix}}|#Htxlydohqfh#Uhodwlrqv

f −2 (R) is called the preimage of R under f, where

Then π
α : X → Xα is a fuzzy mapping w.r.t. f −2 = (f 2 )−1 = (f × f )−1 .
EX = EXα ∈ E(X) and EXα ∈ E(Xα ), ∀α ∈ Γ.
α∈Γ Proof. It is clear that f −2 (R) is a fuzzy relation on
In this case, πα is called the fuzzy projection of X to X.
Xα . (i) Let x ∈ X. Then
f −2 (R)(x,
 x)
From Proposition 3.18, it is clear that πα is strong = [R(y, y  ) ∧ (f × f )((x, x), (y, y  ))]
and strong surjective. (y,y  )∈Y ×Y
Definition 3.13 and Notation f 2 = f × f ]
[By 
Proposition 3.19. Let πα : X = Πα∈Γ Xα → Xα
= [R(y, y  ) ∧ (f (x, y) ∧ f (x, y  ))]
be the fuzzy projection of X to Xα and let Bα ∈
(y,y  )∈Y ×Y
I Xα , ∀α
∈ Γ. Then [By Proposition 3.19]
πα−1 (Bα ) = Bα , ≥ R(y0 , y0 )
α∈Γ α∈Γ
[Since f is strong, ∃y0 ∈ Y such that f (x, y0 ) = 1.]
where Bα is the fuzzy set in X defined as follows: =1.
α∈Γ

Thus f −2 (R) is reflexive.
( Bα )((xα )) = Bα (xα ), ∀(xα ) ∈ X. (ii) By the definition of f −2 (R), it is clear that
−2
α∈Γ α∈Γ f (R) is symmetric.
Proof.Let (xα ) ∈ X. Then (iii) Let x, x ∈ X. Then
−2
[ πα−1 (Bα )]((xα )) [f (R) ◦ f −2 (R)](x, x )
α∈Γ

= [f −2 (R)(x, x ) ∧ f −2 (R)(x , x )]
= πα−1 (Bα )((xα )) x ∈X
 
α∈Γ

 = {( [R(y, y  )∧(f ×f )((x, x ), (y, y  ))])
= [Bα (x) ∧ πα ((xα ), x)] x ∈X
(y,y )∈Y ×Y


α∈Γ x∈Xα

∧( [R(y  , y  )∧(f ×f )((x , x ), (y  , y  ))]}
= Bα (xα )[Since πα is strong] (y  ,y  )∈Y ×Y
 
α∈Γ
= {( [R(y, y  ) ∧ f (x, y) ∧ f (x , y  )] ∧
=( Bα )((xα )). x ∈X y,y  )∈Y ×Y

α∈Γ
( [R(y  , y  ) ∧ f (x , y  ) ∧ f (x , y  )]}
The following is the immediate result of Definition y  ,y  ∈Y ×Y

3.2 and Proposition 3.17. = [R(y, y0 ) ∧ R(y0 , y  ) ∧ f (x, y) ∧
(y,y  )∈Y ×Y
Proposition 3.20. Let f : X → Y be a fuzzy map- f (x , y  )]
ping w.r.t. EX ∈ E(X) and EY ∈ E(Y ). We define [Since f is strong, ∃y0 ∈ Y such that f (x , y0 ) = 1]
the fuzzy relation g on (X × X) × (Y × Y ) as follows : ≤ [R(y, y  ) ∧ (f × f )((x, x ), (y, y  ))]
g((x, x ), (y, y  ) = f (x, y) ∧ f (x , y  ), ∀(x, x ) ∈
(y,y  )∈Y ×Y
X × X, ∀(y, y  ) ∈ Y × Y . [∵ R is transitive].
Then g : X × X → Y × Y is a fuzzy mapping = f −2 (R)(x, x ).
w.r.t. EX×X = EX × EX ∈ E(X × X) and EY ×Y = Thus f −2 (R) ◦ f −2 (R) ⊂ f −2 (R). So f −2 (R) is tran-
EY ×EY ∈ E(Y ×Y ). In this case, g is called the fuzzy sitive. Hence f −2 (R) is fuzzy equivalence relation on
product mapping of f and is denoted by g = f ×f = f 2 . X.

Corollary 4.1 Let f and R be same as in Proposition

4.1. Then f −2 (R) = f −1 ◦ R ◦ f .
4. Preimage and quotient of fuzzy
equivalence relations. Proof. Let a, b ∈ X. Then
f −2 (R)(a, b) = (c,d)∈Y ×Y [R(c, d) ∧ (f ×
f )((a, b), (c,
 d))]
Proposition 4.1 Let f : X → Y be a strong fuzzy = [R(c, d) ∧ f (a, c) ∧ f (b, d)]
mapping w.r.t. EX ∈ E(X) and EY ∈ E(Y ), and let (c,d)∈Y ×Y
 
R be a fuzzy equivalence relation on Y . Then f −2 (R) = {( [f (a, c) ∧ R(c, d)]) ∧ f (b, d)}
is a fuzzy equivalence relation on X. In this case, d∈Y c∈Y

48<
##
Lqwhuqdwlrqdo#Mrxuqdo#ri#Ix}}|#Orjlf#dqg#Lqwhooljhqw#V|vwhpv/#yro1#44/#qr1#6/#Vhswhpehu#5344


= [(R ◦ f )(a, d) ∧ f (b, d)]
d∈Y
 The following is the immediate result of Proposi-
= [(R ◦ f )(a, d) ∧ f −1 (d, b)] tion 4.3.
d∈Y
= (f −1 ◦ (R ◦ f ))(a, b). Corollary 4.3 Let R, G and H be fuzzy equiva-
Hence f −2 (R) = f −1 ◦ R ◦ f . lence relations on X such that R ⊂ G ⊂ H. Then
G/R ⊂ H/R.
Proposition 4.2 If R is a fuzzy equivalence relation
on X, then ∃ the strong and strong surjective fuzzy Proposition 4.4 Let R, G and H be fuzzy equiva-
mapping π : X → X/R w.r.t. IX ∈ E(X) and lence relation on X such that R ⊂ G ⊂ H.
EX/R ∈ E(X/R), where EX/R : X/R×X/R → I is the (a) R ⊂ G ◦ H.
fuzzy equality on X/R defined as follows : ∀a, b ∈ X, (b) If G ◦ H is a fuzzy equivalence relation on X,
EX/R (Ra, Rb) = R(a, b). then (G ◦ H)/R is a fuzzy equivalence relation on X/R
In this case, π is called the natural (or canonical ) fuzzy and G/R ◦ H/R = (G ◦ H)/R.
mapping. (c) G/R ◦ H/R is a fuzzy equivalence relation on
X/R.
Proof. We define the fuzzy relation π : X × X/R → I
as follows : ∀a, b ∈ X, Proof. (a) Let a, c ∈ X. Then
π(a, Rb) = Rb(a) = R(b, a). (G
◦ H)(a, c)
Then clearly π satisfies the condition (f.1). Let = [H(a, b) ∧ G(b, c)]
a1 , a2 , b1 , b2 ∈ X. If a1 = a2 , then clearly IX (a1 , a2 ) = b∈X

0. Thus ≥ [R(a, b) ∧ R(b, c)] [∵ R ⊂ G ⊂ H]
π(a1 , Rb1 ) ∧ π(a2 , Rb2 ) ∧ IX (a1 , a2 ) ≤ b∈X
EX/R (Rb1 , Rb2 ). ≥ R(a, c) ∧ R(c, c)
Suppose a1 = a2 . Then = R(a, c). [∵ R(c, c) = 1]
π(a1 , Rb1 ) ∧ π(a2 , Rb2 ) ∧ IX (a1 , a2 ) Thus R ⊂ G ◦ H.
= R(a1 , b1 ) ∧ R(a1 , b2 ) ∧ IX (a1 , a1 ) (b) By the hypothesis and, (a) and Proposition 4.3,
= R(b1 , a1 ) ∧ R(a1 , b2 ) it is clear that (G◦H)/R is a fuzzy equivalence relation
[Since R is symmetric and IX (a1 , a1 ) = 1]. on X/R. Let a, c ∈ X. Then
≤ R(b1 , b2 ) [ Since R is transitive]. (G/R
 ◦ H/R)(Ra, Rc)
= EX/R (Rb1 , Rb2 ). = [H/R(Ra, Rb) ∧ G/R(Rb, Rc)]
Thus π satisfies the condition (f.2). So π : X → X/R b∈X

is a fuzzy mapping w.r.t. IX and EX/R . Moreover, it = [H(a, b) ∧ G(b, c)]
is clear that π is strong and strong surjective from the b∈X
definition of π. = (G ◦ H)(a, c)
= [(G ◦ H)/R](Ra, Rc).
Proposition 4.3 Let R and G be fuzzy equivalence Thus G/R ◦ H/R = (G ◦ H)/R.
relations on X such that R ⊂ G. We define the map- (c) It is obvious from (b).
ping G/R : X/R × X/R → I as follows :
G/R(Ra, Rb) = G(a, b), ∀a, b ∈ X. Proposition 4.5 Let R and G be fuzzy equivalence
Then G/R is a fuzzy equivalence relation on X/R. In relations on X and Y , respestively . Let the fuzzy
this case, G/R is called the fuzzy quotient of G by R. product of R and G, denoted by R · G, be a fuzzy
relation on (X × Y ) × (X × Y ) defined as follows :
Proof. It is clear that G/R is reflexive and symmetric. ∀x1 , x2 ∈ X, ∀y1 , y2 ∈ Y ,
Let a, c ∈ X. Then (R · G)((x1 , y1 ), (x2 , y2 )) = R(x1 , x2 ) ∧ G(y1 , y2 ).
(G/R ◦ G/R)(Ra, Rc) Then R · G is a fuzzy equivalence relation on X × Y .

= [G/R(Ra, Rb) ∧ G/R(Rb, Rc)]
b∈X
 Proof. Let (a, b) ∈ X × Y . Then
= [G(a, b) ∧ G(b, c)] (R · G)((a, b), (a, b))
b∈X = R(a, a) ∧ G(b, b).
= (G ◦ G)(a, c) = 1. [∵ R and G are fuzzy equivalence relations]
≤ G(a, c) [∵ G is transitive] Thus R · G is reflexive. It is clear that R · G is sym-
= G/R(Ra, Rc). metric. Now let (a1 , b1 ), (a3 , b3 ) ∈ X × Y . Then
Hence G/R is a fuzzy equivalence relation on X/R. [(R · G) ◦ (R · G)]((a1 .b1 ), (a3 , b3 ))

493
 ##
Ix}}|#Pdsslqjv#dqg#Ix}}|#Htxlydohqfh#Uhodwlrqv

 
= [(R · G)((a1 , b1 ), (a, b)) ∧ (R · ≤ [f (a, b) ∧ f (c, b ) ∧ EY (b, b )]
(a,b)∈X×Y (b,b )∈Y ×Y
G)((a, b), (a3 , b3 ))] [∵ EY is a fuzzy equality on Y ]

= [R(a1 , a)∧G(b1 , b)∧R(a, a3 )∧G(b, b3 )] = R(a, c).
(a,b)∈X×Y So R is transitive. Hence R is fuzzy equivalence rela-
  tion on X.
= ( [R(a1 , a) ∧ R(a, a3 )]) ∧ ( [G(b1 , b) ∧
a∈X b∈Y
G(b, b3 )]) The following is the immediate result of Proposi-
= (R ◦ R)(a1 , a3 ) ∧ (G ◦ G)(b1 , b3 ) tions 4.2 and 5.1.
≤ R(a1 , a3 ) ∧ G(b1 , b3 ) [∵ R and G are transitive]
Corollary 5.1 Let R be a fuzzy equivalence relation
= (R · G)((a1 , b1 ), (a3 , b3 )).
on X. If π : X → X/R is the natural fuzzy mapping
Thus (R · G) ◦ (R · G) ⊂ R · G. So R · G is transi-
w.r.t. IX ∈ E(X) and EX/R ∈ E(X/R), then R = Rπ .
tive. Hence R · G is a fuzzy equivalence relation on
X ×Y.
Proof. From Proposition 4.2, it is clear that π is
strong and strong surjective. Let a, b ∈ X, Then
Rπ (a,
b)
5. Fuzzy equivalence relations and = [π(a, Rc) ∧ π(b, Rd) ∧ EX/R (Rc, Rd)]
(c,d)∈X×X
fuzzy mappings. 
= [R(c, a) ∧ R(d, b) ∧ R(c, d)]
(c,d)∈X×X
[By the definitions of π and EX/R .]
Proposition 5.1 Let f : X → Y be a strong fuzzy  
= {( (R(a, c) ∧ R(c, d)]) ∧ R(d, b)}
mapping w.r.t. EX ∈ E(X) and EY ∈ E(Y ). We
d∈X c∈X
define the mapping R : X 
× X → I as follows : [∵
R is symmetric]
R(x, x ) = [f (x, y) ∧ f (x , y  ) ∧ = [(R ◦ R)(a, d) ∧ R(d, b)]
(y,y  )∈Y ×Y
d∈X
EY (y, y  )], ∀(x, x ) ∈ X × X. 
≤ [R(a, d) ∧ R(d, b)] [ ∵ R is transitive]
Then R is a fuzzy equivalence relation on X. In this d∈X
case, R is called the fuzzy equivalence relation on X = (R ◦ R)(a, b)
determined by f and will be denoted by Rf . ≤ R(a, b). [ ∵ R is transitive]
Thus Rπ ⊂ R. On the other hand,
Proof. Let a ∈ X. Then R(a, b)
R(a, a)
 = R(a, a) ∧ R(b, b) ∧ R(a, b)
= [f (a, b) ∧ f (a, b ) ∧ EY (b, b )] =π(a, Ra) ∧ π(b, Rb) ∧ EX/R (Ra, Rb)
(b,b )∈Y ×Y [By the definitions of π and EX/R .]

≥ f (a, b0 ) ∧ f (a, b0 ) ∧ EY (b0 , b0 ) ≤ [π(a, Rc) ∧ π(b, Rd) ∧ EX/R (Rc, Rd)]
[Since f is strong, ∃b0 ∈ Y such that f (a, b0 ) = 1] (c,d)∈X×X
= 1. =Rπ (a, b). [By the definitions of Rπ ]
Thus R is reflexive. It is clear that R is symmetric. So R ⊂ Rπ . Hence R = Rπ .
Now let a, c ∈ X. Then
(R ◦ R)(a, c) Remark 5.1 Corollary 5.1 is the generalization of

= [R(a, x) ∧ R(x, c)] Theorem 3.22 in [6] in fuzzy setting.
x∈X
  Proposition 5.2 Let f : X → Y be a strong fuzzy
= {( [f (a, b) ∧ f (x, b ) ∧ EY (b, b )])
mapping w.r.t. IX ∈ E(X) and EY ∈ E(Y ) and let
x∈X (b,b )∈Y ×Y
 ran f = {y ∈ Y : ∃x ∈ X such that f (x, y) > 0} ⊂ Y .
∧( [f (x, b ) ∧ f (c, b ) ∧ EY (b , b )])} Let R be the fuzzy equivalence relation determined by
(b ,b )∈Y ×Y f. We define two fuzzy relations s and t on X/R×ranf

=( [f (a, b) ∧ f (x, b0 ) ∧ EY (b, b0 )]) and ranf × Y , respectively as follows:
(b,b0 )∈Y ×Y s(Ra, y) = f (a, y), ∀a ∈ X, ∀y ∈ ran f

∧( [f (x, b0 ) ∧ f (c, b ) ∧ EY (b0 , b )]) and

b0 ,b ∈Y ×Y  1 if y = y  ,
[Since f is strong, ∃b0 ∈ Y such that f (x, b0 ) = 1.] t(y, y ) =
0 if y = y  , ∀y ∈ ran f, ∀y  ∈ Y.

494
##
Lqwhuqdwlrqdo#Mrxuqdo#ri#Ix}}|#Orjlf#dqg#Lqwhooljhqw#V|vwhpv/#yro1#44/#qr1#6/#Vhswhpehu#5344
Then s is strong and bijective, t is strong and injective
and f = t ◦ s ◦ π.
Proof. (i) From Proposition 4.2, it is clear that
π : X → X/R is a strong and strong surjective fuzzy
mapping w.r.t. IX and EX/R ∈ E(X/R).
(ii) It is easily seen that s : X/R → ran f is a fuzzy
mapping w.r.t. EX/R and EY . Let y ∈ ran f. Then
∃x ∈ X such that f (x, y) > 0. Thus Rx ∈ X/R and
s(Rx, y) = f (x, y) > 0. So s is surjective. Now let
x1 , x2 ∈ X and y1 , y2 ∈ ran f. Then
EX/R (Rx1 , Rx2 )
= R(x  1 , x2 )
= [f (x1 , c) ∧ f (x2 , d) ∧ EY (c, d)]
(c,d)∈Y ×Y
[ ∵ R is the fuzzy equivalence relation determined
by f ]
≥ f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ EY (y1 , y2 )
=s(Rx1 , y1 ) ∧ s(Rx2 , y2 ) ∧ EY (y1 , y2 ).
[By the definition of s.]
Thus s is injective. Since f is strong, it is clear that s
is strong. Hence s is strong and bijective.
(iii) From the definition of t, it is clear that t: ran
f → Y is strong and injective fuzzy mapping w.r.t. EY
and EY .
(iv) Let x ∈ X and let y ∈ Y . Then
(t ◦ s ◦ π)(x, y)
= [(t  ◦ s) ◦ π](x, y)
= [π(x, Ra) ∧ (t ◦ s)(Ra, y)]
Ra∈X/R
 
= [R(a, x) ∧ ( [s(Ra, z) ∧ t(z, y)])]
Ra∈X/R z∈ranf
[By
 the definitionsof π and t ◦ s]
= [R(a, x) ∧ ( [f (a, z) ∧ t(z, y)])]
a∈X z∈ranf
[Bythe definition of s.]
= [f (x, z) ∧ t(z, y)][∵ R is reflexive]
z∈ranf
= f (x, y). [By the definition of t]
Thus t ◦ s ◦ π = f . This completes the proof.
The following is the immediate result of Proposi-
tions 3.6 and 5.2
Corollary 5.2 Let f ,s ,t and R be same as in Propo-
sition 5.2. If f is surjective [resp. strong surjective],
then t : ran f → Y is strong and bijective [resp.
strong bijective] and hence s : X/R → Y is strong and
bijective [resp. strong bijective].
Remark 5.2 Proposition 5.2 and Corollary 5.2 are
the generalizations of Theorems 3.23 and 3.24 in [6] in
fuzzy setting.
495
Proposition 5.3 Let f : X → Y be a strong fuzzy
mapping w.r.t. IX ∈ E(X) and EY ∈ E(Y ). Let R
be the fuzzy equivalence relation on X determined by
f and let G be any fuzzy equivalence relation on X
such that G ⊂ R. We define the fuzzy relation f /G
on X/G × Y as follows:
[f /G](Gx, y) = f (x, y), ∀x ∈ X, ∀y ∈ Y .
Then f /G : X/G → Y is a strong fuzzy mapping
w.r.t. EX/G ∈ E(X/G) and EY . In this case, f /G is
called the fuzzy quatient of f by G.
Proof. From the definition of f /G, it is clear that f /G
satisfies the condition (f.1). Let Gx1 , Gx2 ∈ X/G and
let y1 , y2 ∈ Y . Then
(f /G)(Gx1 , y1 ) ∧ (f /G)(Gx1 , y2 ) ∧
EX/G (Gx1 , Gx2 )
= f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ G(x1 , x2 )
≤ f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ R(x1 , x2 ) [Since G ⊂ R]
= f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ ( (c,d)∈Y ×Y [f (x1 , c) ∧
f (x2 , d) ∧ EY (c, d)]).
[ ∵ R is the fuzzy equivalence relation determined
by f ]
= f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ EY (c0 , d0 ). (5.1)
[Since f is strong, ∃c0 , d0 ∈ Y such that
f (x1 , c0 ) = f (x2 , d0 ) = 1]
Since f : X → Y is fuzzy mapping w.r.t. IX and EY ,
f (x1 , y1 )∧f (x2 , y2 )∧IX (x1 , x2 ) ≤ EY (y1 , y2 ). (5.2)
By (5.1) and (5.2),
f (x1 , y1 ) ∧ f (x2 , y2 ) ∧ IX (x1 , x2 ) ∧ EY (c0 , d0 )
≤ EY (c0 , d0 ) ∧ EY (y1 , y2 ) ≤ EY (y1 , y2 )
Thus
(f /G)(Gx1 , y1 ) ∧ (f /G)(Gx2 , y2 ) ∧
EX/R (Gx1 , Gx2 ) ≤ EY (y1 , y2 ).
So f /G satisfies the condition (f.2). Since f is strong,
it is clear that f /G is strong. Hence f /G : X/G → Y
is strong w.r.t. EX/G and EY .
Proposition 5.4 Let f , R, G and f /G be same as in
Proposition 5.3. Then R/G is the fuzzy equivalence
relation on X/G determined by f /G.
Proof. Let Rf /G be the fuzzy equivalence relation on
X/G determined by f /G and let Ga, Gb ∈ X/G. Then
Rf /G (Ga, Gb)

= [(f /G)(Ga, c)∧(f /G)(Gb, d)∧EY (c, d)]
(c,d)∈Y ×Y

= [f (a, c) ∧ f (b, d) ∧ EY (c, d)]
(c,d)∈Y ×Y
=R(a, b) [By Proposition 5.1]
=R/G(Ga, Gb). [By Proposition 4.3]
Thus Rf /G = R/G . So R/G is the fuzzy equivalence
relation on X/G determined by f /G.
 ##
Ix}}|#Pdsslqjv#dqg#Ix}}|#Htxlydohqfh#Uhodwlrqv

 
Remark 5.4 Proposition 5.4 is the generalization of = {( [R(x, x ) ∧ f (x, y) ∧ f (x , y  )])∧
Theorem 3.26 in [6] in fuzzy setting. y  ∈Y (x,x )∈X×X

( [R(x , x ) ∧ f (x , y  ) ∧ f (x , y  )])}
Proposition 5.5 Let R and G be fuzzy equivalence (x ,x )∈X×X
relations on X such that G ⊂ R. Then ∃ a strong and 
= [R(x, x0 ) ∧ R(x0 , x ) ∧ f (x, y) ∧
strong bijective fuzzy mapping h : (X/G)/(R/G) →
(x,x )∈X×X
X/R
f (x , y  )]
[Since f is strong surjective, ∃x0 ∈ X such that
Proof. By Proposition 4.2, ∃ a strong and strong
f (x0 , y  ) = 1]
surjective fuzzy mapping π : X → X/R w.r.t. 
IX ∈ E(X) and EX/R ∈ E(X/R). By Corollary ≤ [R(x, x ) ∧ f (x, y) ∧ f (x , y  )]
5.1, it is clear that R is the fuzzy equivalence relation (x,x )∈X×X

on X determined by π. Then, by Proposition 5.3, [ ∵ R is transitive]

π/G : X/G → X/R is strong w.r.t. EX/G ∈ E(X/G) = f 2 (R)(y, y  )
and EX/R . Thus, by Proposition 5.4, R/G is the fuzzy Thus f 2 (R) ◦ f 2 (R) ⊂ f 2 (R). So f 2 (R) is transitive.
equivalence relation determined by π/G. Since π is Hence f 2 (R) is a fuzzy equivalence relation on Y .
strong surjective, π/G is strong surjective. So, π/G
is strong and strong surjective. Hence, by Corollary Theorem 5.7 Let f : X → Y be strong and strong
5.2, ∃ a strong and strong bijective fuzzy mapping surjective w.r.t. IX ∈ E(X) and EY ∈ E(Y ), let R be
h : (X/G)/(R/G) → X/R. the fuzzy equivalence relation on X induced by f and
let G be any fuzzy equivalence relation on Y . Then :
The following is the immediate result of Proposi- (a) R ⊂ f −2 (G).
tion 5.5. (b) H = f −2 (G) if and only it G = f 2 (H).
Hence ∃ a bijection h: FER(Y ) → FERR (X), where
Corollary 5.5 Let R and G be any fuzzy equivalence FERR (X) denotes the set of all fuzzy equivalence re-
relations on X. Then : lations on X containing R.
(a) ∃ a bijective fuzzy mapping g : X/(R ◦ G) →
(X/R)/(R ◦ G/R). Proof. (a) Let x, x ∈ X. Then
(b) ∃ a bijective fuzzy mapping h : X/R → R(x, x )

(X/R ∩ G)/(R/R ∩ G). = [f (x, y) ∧ f (x , y  ) ∧ EY (y, y  )]
(y,y  )∈Y ×Y
Proposition 5.6 Let f : X → Y be a strong and [By Proposition 5.1]

strong surjective fuzzy mapping w.r.t. IX ∈ E(X) ≤ [f (x, y) ∧ f (x , y  )]
and EY ∈ E(Y ), and let R be an fuzzy equivalence (y,y  )∈Y ×Y
relation on X. Then f 2 (R) is a fuzzy equivalence re- 
lation on Y . In this case, f 2 (R) is called the image of = [G(y0 , y0 ) ∧ f (x, y) ∧ f (x , y  )]
(y,y  )∈Y ×Y
R under f.
[ ∵ G(y0 , y0 ) = 1]

Proof. Let y ∈ Y . Then = [G(y, y  ) ∧ f 2 ((x, x ), (y, y  ))]
f 2 (R)(y, y) (y,y  )∈Y ×Y

= [R(x, x ) ∧ f 2 ((x, x ), (y, y))] =f (G)(x, x ).
−2

(x,x )∈X
Thus R ⊂ f −2 (G).
 (b) (⇒) : Suppose H = f −2 (G) and let y, y  ∈ Y .
= [R(x, x ) ∧ f (x, y) ∧ f (x , y)] Then
(x,x )∈X
f 2 (H)(y, y  )
≥ R(x0 , x0 ) 
[Since f is strong surjective, ∃x0 ∈ X such that = [H(x, x ) ∧ f 2 ((x, x ), (y, y  ))]
(x,x )∈X×X
f (x0 , y) = 1] 
=1. = [f −2 (G)(x, x ) ∧ f (x, y) ∧ f (x , y  )]
Thus f 2 (R) is reflexive. From the definition of f 2 (R), (x,x )∈X×X
it is clear that f 2 (R) is symmetric. Now let y, y  ∈ Y . = f −2 (G)(x0 , x0 )
Then [Since f is strong surjective, ∃x0 , x0 ∈ X such
[f 2 (R) ◦ f 2 (R)](y, y  ) that f (x0 , y) = f (x0 , y  ) = 1.]
 
= [f 2 (R)(y, y  ) ∧ f 2 (R)(y  , y  )] = [G(z, z  ) ∧ f (x0 , z) ∧ f (x0 , z  )]
y  ∈Y (z,z  )∈Y ×Y

496
##
Lqwhuqdwlrqdo#Mrxuqdo#ri#Ix}}|#Orjlf#dqg#Lqwhooljhqw#V|vwhpv/#yro1#44/#qr1#6/#Vhswhpehu#5344

= G(y, y  ). [ ∵ f (x0 , y) = f (x0 , y  ) = 1] [4] W.C.Nemitz, “Fuzzy relations and fuzzy func-
Thus f 2 (H) = G. tions”, Fuzzy Sets and Systems, vol.19, no. 8, pp.
(⇐) : Suppose f 2 (H) = G and let x, x ∈ X. Then 177-191, 1986.
f −2 (G)(x,
 x )
[5] S.V.Ovchinnikov, “Structure of fuzzy binary rela-
= [G(y, y  ) ∧ f 2 ((x, x ), (y, y  ))]
tions”, Fuzzy Sets and Systems, vol.6, no. 2, pp.
(y,y  )∈Y ×Y
 169-195, 1981.
= [f 2 (H)(y, y  ) ∧ f (x, y) ∧ f (x , y  )]
(y,y  )∈Y ×Y [6] C.C.Pinter, “Set Theory”, Kyung Moon Publish-
=f 2
(H)(y0 , y0 ) ers, 2002.
[Since f is strong, ∃y0 , y0 ∈ Y such that
[7] P.M.Pu and Y.M.Liu, “Fuzzy topology II. Prod-
) = f (x , y0 ) = 1].
f (x, y0
uct and quotient spaces”, J.Math.Anal.Appl.
= [H(a, b) ∧ f (a, y0 ) ∧ f (b, y0 )] vol.77, no. 2, pp. 20-37, 1980.
(a,b)∈X×X
= H(x, x ). [∵ f (x, y0 ) = f (x , y0 ) = 1.] [8] T.H.Yalvac, “Fuzzy sets and functions on fuzzy
Thus f −2 (G) = H. space”, J.Math.Anal.Appl. vol.126, pp. 409-423,
Now we define h: FER(Y ) → FERR (X) as follows: 1989.
∀G ∈ FER(Y ), h(G) = f −2 (G). Then, by Proposi-
tion 5.6 and (a), clearly h(G) ∈ FERR (X). It is easy [9] L.A.Zadeh, “Fuzzy sets”, Inform. and Control,
to see that h is bijective. This completes the proof. vol.8, pp. 338-353, 1965.

[10] L.A.Zadeh, “Similarity relations and fuzzy order-

Acknowlegments ing”, Inform. Soi, vol.3, pp. 117-200, 1971.
By accepting some propositions of referees, we cor-
rected some parts of this paper. Moreover, we used as
examples (Example 3.6 and 3.9) two counterexamples Pyung Ki Lim
proposed by them. So we would like to thank them Professor of Wonkwang University
for their advices. Research Area: Fuzzy Topology, Dynamic Topology,
etc.
E-mail : pklim@wonkwang.ac.kr
References
Ga Hee Choi
Research Area: Fuzzy Topology.
[1] M.Demirci, “Fuzzy functions and their fundamen-
E-mail : ykgahee@naver.com
tal properties”, Fuzzy Sets and Systems, vol.106,
no. 2, pp. 239-246, 1999.
Kul Hur
[2] J.A.Gouen, “L-fuzzy sets”, J.Math.Anal.Appl.,
vol.18, no. 1, pp. 145-17, 1967. Professor of Wonkwang University
Research Area: Fuzzy Topology, Fuzzy Algebra, etc.
[3] V.Murali, “Fuzzy equivalence relations”, Fuzzy E-mail : kulhur@wonkwang.ac.kr
Sets and Systems, vol.30, pp. 155-163, 1989.

497