2.5. The Applications of Quotient Space Theory

2.5.1. Introduction

In this section, we will present a new constructional definition of fuzzy sets by using fuzzy equivalence relations, and discuss its properties. We will also discuss the isomorphism and similarity principles of fuzzy sets, the necessary and sufficient condition of the isomorphism and ε-similarity of two fuzzy equivalence relations. These principles and results can overcome the subjectivity of the concept of fuzzy sets defined by membership functions to a certain extent, and deepen the understanding of fuzzy set theory so that a more objectively fuzzy set theory can be established probably. More details can be seen in (Zhang and Zhang, 2003b, 2003d, 2005b, 2005c).
Zadeh (1965) presented a fuzzy set theory that is an efficient tool for describing uncertainty, and has wide applications, for example, fuzzy control, fuzzy reasoning, etc. But the concept of fuzziness defined by membership functions that many people pay close attention to is subjective. The definition of fuzziness that Zadeh proposed is the following.

Definition 2.21

X is a domain. If image is a fuzzy subset of X, for any image, assigning a number image to x, image is called a membership of x with respect to image.
Mapping image, image is called a membership function of image.
It is noted that in the following discussion, domain X is assumed to be infinite (not limited to finite). For simplicity, the membership function is denoted by image rather than image.
The main operations of fuzzy sets: given two fuzzy sets image and image, the union, intersection, and complement operations are defined as follows:

image

In practice such as fuzzy control, designers may choose the membership functions optionally in some degree, i.e., the membership functions of the same fuzzy variable may (slightly) be different, but the controllers designed from the different membership functions still have the same (or approximate) performances. The robustness of the fuzzy analysis method, based on (more or less) optionally chosen membership functions, has brought many people’s attention. Some researchers (Liang and Song, 1996; Lin and Tsumoto, 2000; Mitsuishi et al., 2000; Verkuilen, 2001; Lin, 2001a) presented the probabilistic interpretation of membership functions. For example, Lin (2001a) interpreted memberships as probabilities. Each sample space has a probability, and each point is associated with one sample space. So the total space is like a fiber space. Each fiber space is a probability space. Liang and Song (1996) regarded the values of a membership function as independent and identically distributed random variables, and proved that the mean of the membership function exists for all the elements of the universe of discourse. He interpreted the meaning of a subjective concept of a group of people as the mean of a membership function for all people within the group. Mitsuishi et al. (2000) introduced a new concept of empty fuzzy set, in order to define the membership functions in the probabilistic sense. That is, although different persons may assign (slightly) different membership functions to a fuzzy concept, when solving a real problem (fuzzy control or fuzzy reasoning), in average they can get an approximate result. Unfortunately, these results were obtained based on a strong assumption, i.e., the values of a membership function are assumed to be independent and identically distributed random variables. Verkuilen (2001) introduced the concept of membership functions by the multi-scale method, and discussed its corresponding properties. Lin (1988, 1992, 1997) presented a topological definition, topological rough set, of fuzzy sets by using neighborhood systems, discussed the properties of fuzzy sets from their structure, and then presented a definition of the equivalence between two fuzzy membership functions, and the necessary and sufficient conditions of the equivalence between two membership functions. He also discussed the concept of granular fuzzy sets in Lin (1998, 2001b), and ‘elastic’ membership functions in Lin (1996, 2000, 2001b). Lin’s works provide a structural interpretation of membership functions (fuzzy sets).
It can be seen that the membership function of a fuzzy set can be interpreted in two ways: one probabilistic, the other structural. We will show below that for a fuzzy set (concept), it may probably be described by different types of membership functions, as long as their structures (see the structural definition of fuzzy sets below) are the same, it still appears with the same characteristics. That is, although these membership functions are different in appearance, they are the same in essence. Therefore, the structural interpretation of fuzzy sets would be better than the probabilistic one. And it seems that in a given environment, most persons would have a similar structural interpretation for the same fuzzy concept. We will introduce a structural definition of fuzzy sets, and discuss its properties below, since the structural description is more essential to a fuzzy set.

2.5.2. The Structural Definition of Fuzzy Sets

2.5.2.1. The Structural Definition of Membership Functions

Definition 2.22
image is a fuzzy equivalence relation on X. A is a crisp set of X. Define a corresponding fuzzy set A such that its membership function A(x) is as follows

image(2.11)

A(x) is called a structural definition of membership functions.
Therefore, A is a fuzzy set extended from a crisp set A by fuzzy equivalence relation R and with A as its core. The new definition is induced from a fuzzy equivalence relation, and represents the relationship between a crisp set and its corresponding fuzzy set so that it deepens the understanding of fuzzy sets.
The following example shows that two different equivalence relations may correspond to the same hierarchical structure.

Example 2.16

image. Given two fuzzy equivalence relations image and image on X as follows.
Fuzzy equivalence relation image : image, image, image.
Its corresponding hierarchical structure is image, image, image, and image.
Fuzzy equivalence relation image is image, image, image, and image.
Its corresponding hierarchical structure is image, image, image, and image.
Fuzzy equivalence relations image and image are different, but they have the same hierarchical structure {{1,2,3,4},{(1,2),3,4},{(1,2),(3,4)},{(1,2,3,4)}}. Certainly, there are countless fuzzy equivalence relations corresponding to the above hierarchical structure.

Definition 2.23

image and image are two hierarchical quotient structures on X. If there exists a one-one corresponding, strictly increasing, and onto mapping image such that image, then image and image are called the same.

Definition 2.24

If image and image are two fuzzy equivalence relations corresponding to the same hierarchical structure, then image and image are called isomorphic.

Definition 2.25

Given a fuzzy subset A and its membership function image. Defining an equivalence relation image on X, we have a quotient space image corresponding to R. Furthermore, define an order ‘<’ on image such that image, space image obtained is a totally ordered quotient space corresponding to fuzzy set A.

Definition 2.26

If two fuzzy subsets image and image correspond to the same totally ordered quotient space, then image and image are called isomorphic.

2.5.2.2. The Isomorphism Discrimination of Two Fuzzy Equivalence Relations

We will show below the properties of two equivalent fuzzy equivalence relations, and the necessary and sufficient condition of isomorphism for two fuzzy equivalence relations.

Proposition 2.14

If two fuzzy equivalence relations R1 and R2 on X are isomorphic, then we have the following properties.
1. For image, image.
2. image
image
3. For image, image.
For simplicity, in the following discussion, we use the symbol image instead of image.

Proof:

1. Assume image. Let image. f is an isomorphic mapping.
Letting image and image, then x and y are equivalent in image, but u and v are not equivalent in image.
Since image and image are isomorphic, there exists a one-one, strictly increasing, and onto mapping image. Letting image, we have x and y equivalent in image, but u and v are not equivalent in image. Thus, image and image, i.e., image.
Similarly, we have image.
2. Let image and image. We will show image.
Otherwise, in assuming that image, for image, let image. Since f is a one-one, strictly increasing and onto mapping, we have image. In assuming image, we have image. Thus, image. Again, from image, we have image. This is a contradiction. So image.
Since f is a one-one mapping, we have

image

image

3. Property 3 is the deduction of Property 1. Otherwise, there exist image and image. But from Property 1, we have image. This is a contradiction. So Property 3 holds.

Definition 2.27

R1 and R2 are two fuzzy equivalence relations on X. Property 1 of Proposition 2.14 holds. Let image and image be the ranges of R1 and R2, respectively. Define image as image.
From Proposition 2.14, when Property 1 holds, Property 3 holds as well. From Definition 2.27, assume that image. From Property 3, we have image. Then, image. Therefore, mapping f is defined as single valued and unique. From Property 1 of Proposition 2.14, f is a one-one and strictly increasing.

Proposition 2.15

R1 and R2 are two fuzzy equivalence relations on X, and satisfy Property 1 of Proposition 2.14. Let image and image be the ranges of R1 and R2, respectively. Then, the mapping f defined by Definition 2.27 can be extended to a one-one, strictly increasing, and onto mapping from image.

Proof:

Letting image and image are closures of image and image, respectively, set image, is open and may be represented by the union of at most countable many open intervals. Their starting and finishing points are image and image, respectively.
For any image, there exists image. Define image image.
We will show next that image must be some image.
Otherwise, in assuming that image, there exists image (monotonously decrease to image). From Property 1 and 2, we have image (monotonously decrease to image). Then there exists image, when image, image.
This contradict with image. Then, we have that image is some image.
Similarly, when image, we have image.
Now, f will be expanded to [0,1]. For image, let image. When image let image. And let image. When image assume that image. Letting image we have image. When image define image.
Therefore, f is expanded to a one-one, strictly increasing, and onto mapping from image.
Assume that image and image are hierarchical structures corresponding to image and image, respectively, then image.

Theorem 2.7: The Discrimination Principle of Isomorphism

R1 and R2 are two fuzzy equivalence relations on X. The necessary and sufficient conditions of isomorphism of R1 and R2 are that the following two properties hold.
1. Property 1 of Proposition 2.14
2. Property 2 of Proposition 2.14

Proof:

image : Let f be the mapping defined in Definition 2.27. From Proposition 2.15, it’s known that f can be expanded to [0,1], and is still a one-one, strictly increasing, and onto mapping. Thus, f is an isomorphic mapping of R1 and R2.
The expansion process is the following.
From Property 2 of Proposition 2.14, for point image, let image. Letting image, we define image. For image, i.e., image is an external point of S, there exists an interval image such that image.
Letting image and image, we have

image

Letting image, and image, define image.
Therefore, f is expanded to a one-one, strictly increasing, and onto mapping from image, i.e., an isomorphic mapping corresponding to R1 and R2.
image : From Proposition 2.14, Property 1 and 2 hold.

Proposition 2.16

The ranges of R1 and R2 are [0,1]. The isomorphism of R1 and R2 ⇔ their corresponding function image is a strictly increasing and continuous function.

Proof:

⇐: Since f is a strictly increasing and continuous function, for any image, and Property 2 of Proposition 2.14 holds. From Proposition 2.15, R1 and R2 are isomorphic.
⇒: Assume that R1 and R2 are isomorphic. From the Basic Theorem, it’s known that their corresponding isomorphic mapping image is a one-one, strictly increasing, and onto mapping. So f is continuous.

Corollary 2.2

Assume image is a distance function on image. Two fuzzy equivalence relations on X are defined as follows.

image

where image are strictly decreasing and continuous functions. Then, R1 and R2 are isomorphic.

Proof:

We have image, where image, and image is the inverse of image. Since image and image are strictly decreasing and continuous, image is also strictly decreasing and continuous. Since image is the combination of two strictly decreasing and continuous functions, image is strictly increasing and continuous. Then, we have that R1 and R2 are isomorphic.

Corollary 2.3

Assume image is a distance function on image. Two fuzzy equivalence relations on X are defined as follows.

image

where image.
If image, then R1 and R2 are isomorphic.

Example 2.17

Assume image. Let

image

image

Choose a proper image such that image.

image

We have image, image, image, and image. From Corollary 2.3, R1 and R2 are isomorphic.

2.5.3. The Robustness of the Structural Definition of Fuzzy Sets

2.5.3.1. The Isomorphism of Fuzzy Sets

Proposition 2.17
R1 and R2 are two isomorphic fuzzy equivalence relations on X. f is isomorphic transformation. A is a common set on X. For image, fuzzy subsets image and image are defined by image and image, according to Definition 2.22. Then, image and image are isomorphic, and image.

Proof:

From Definition 2.22, we have

image

From image and that f is one-one and strictly increasing, there exists image such that

image

Again, sine f is strictly increasing and continuous, we have image. Thus, image and image.
Similarly, we have image, i.e., image
Finally, image.

Proposition 2.18

R1 and R2 are two isomorphic fuzzy equivalence relations on X. A and B are two common sets on X. Fuzzy subsets image and image are defined by image and image, according to Definition 2.22. Then, image and image (or image and image) are isomorphic.

Proof:

image and image are membership functions corresponding to the four fuzzy subsets. The membership functions of image and image are denoted by image and image, respectively. From Definition 2.22, we have image and image.
In order to show that image and image are isomorphic, it is only needed to show image, image. Since f is one-one and strictly increasing, from Proposition 2.15, we have

image

Therefore, image and image are isomorphic.
Similarly, image and image are isomorphic.

Proposition 2.19

R1 and R2 are two isomorphic fuzzy equivalence relations on X. A and B are two common sets on X. Fuzzy subsets image and image are defined by image and image, according to Definition 2.22, then image and image are isomorphic, where image is the complement of A1, and its membership function is image.

Proof:

Since the corresponding totally ordered quotient space of the complement of image has the same elements with that of image and the only difference is their opposite order, image and image are isomorphic.

Theorem 2.8: Isomorphism Principle

R1 and R2 are two isomorphic fuzzy equivalence relations, and image is a set of common subsets on X. Define two sets image and image of fuzzy subsets from image and image respectively, and carry out a finite number of union, intersection and complement operations on them, we have two sets image and image of fuzzy subsets. Then, the two sets C and D of fuzzy sets are isomorphic.

Proof:

The conclusion can be obtained from Propositions 2.15 and 2.16.
The theorem shows that the corresponding totally ordered quotient space of a fuzzy subset is its essential property. For the isomorphic fuzzy subsets, although they might have different membership functions, after a finite number of operations (inference), the fuzzy subsets obtained are still isomorphic. Therefore, as long as the essential property of fuzzy subsets remains the same, the usage of different membership functions does not affect the final results.

Example 2.18

Sets A={1,3} and B={1} are taken from image. Fuzzy equivalence relations image and image as defined in Example 2.16.
Define fuzzy subsets image and image from image and image, respectively. Their membership functions as follows.

image

Then we have

image

Fuzzy sets image and image have different membership functions on X, but they are isomorphic since they correspond to the same totally ordered quotient space image.
Similarly, fuzzy sets image and image also have different membership functions, but they correspond to the same totally ordered quotient space image as well.
From the structural relation view point, both fuzzy subsets image and image indicate that elements 1 and 3 belong to their core A, and element 2 is closer to the core than element 4. Due to the different understanding of each person, their descriptions of the degree of closeness might be different, but the mutual relationships among elements should be the same.
The structural definition, given in Definition 2.22, of fuzzy sets is defined from fuzzy equivalence relations. This is very significant. For example, if using neighborhood systems to defined fuzzy sets directly, the isomorphism principle might not hold. The following is a counter-example.

Example 2.19

Assume that the structures of fuzzy subsets image and image are the following.

image

Define their membership functions as follows
image, image, image, and image, where image and image are membership functions of image, image and image are membership functions of image.
Carry out set operations on image and image with membership functions image, image and image, image, respectively, we have

image

After the set operations, the results with respect to different membership functions are no long isomorphic. This shows that using fuzzy membership functions to define fuzzy sets, although it is a structural definition but cannot satisfy the isomorphism principle generally (Lin, 1997).

2.5.3.2. The image -Similarity of Fuzzy Sets

The Definition of image -Similarity of Fuzzy Sets
In the above section, we presented a structural definition of fuzzy sets, which answers the cause of the robustness of fuzzy analysis in some degree. But the conditions that two fuzzy equivalence relations are isomorphic are too strong. We present a weaker condition, i.e., image-similarity of fuzzy sets, below.

Definition 2.28

Given two fuzzy equivalence relations image and image, and image. If there exists fuzzy equivalence relation image such that (1) image and image are isomorphic, (2) image, then image and image are called image-similarity.

Definition 2.29

Given two fuzzy equivalence relations image and image, and image. If there exists fuzzy set image such that (1) image and image are isomorphic (or image and image are isomorphic), (2) image (or image), then image and image are called image-similarity.

Proposition 2.20

Assume that image and image are two image-similarity fuzzy equivalence relations on X. A is a common set on X. Fuzzy subsets image and image are defined by image and image, respectively, according to Definition 2.22, then image and image are called image-similarity.

Proof:

Assume that image, i.e., image and image are isomorphic, and image.
For x, assume that image. Thus

image

Similarly, image.
That is, image. We have that image and image are image-similarity.

Proposition 2.21

Assume that image and image are two image-similarity fuzzy equivalence relations on X. A and B are two common sets on X. Fuzzy subsets image, image and image, image are defined from image and image, according to Definition 2.22. Then, image and image (or image and image) are image-similarity.

Proof:

The membership functions corresponding to the four fuzzy sets are image and image, respectively. The membership functions of image and image are denoted by image and image, respectively. From Definition 2.22,

image

Assume that image, i.e., image and image are isomorphic, and image.
Assume that image.
Similarly, image. Finally, we have image, i.e., image and image are image-similarity.
Similarly, image and image are image-similarity.

Theorem 2.9: Similarity Principle

Assume that image and image are two image-similarity fuzzy equivalence relations on X. image is a set of common sets on X. Using image and image to define a set of fuzzy sets, we have image and image. And carrying out a finite number of set operations on A and B, then we have sets image and image of fuzzy sets. Then, C and D are image-similarity.

Proof:

Assume that image and image are isomorphic, and image. Let image be a set of fuzzy sets defined by image. After a finite number of set operations, we have a set image of fuzzy sets. From the isomorphism principle, C and F are isomorphic.
On the other hand, using the same method of Proposition 2.21, we have image, i.e., D and C are image-similarity, where image and image are membership functions of fuzzy sets image and image.
The Discrimination of image-Similarity of Fuzzy Sets
Theorem 2.10
Assume that the ranges of image and image are [0,1]. Then, we have image and image are image-similarity ⇔ there exists a strictly increasing function F such that image.

Proof:

Let image. From Proposition 2.16, we have image and image are isomorphic. Then, from Definition 2.28, we have image and image are image-similarity.
3. The Structural Property of image-Similarity of Fuzzy Equivalence Relations
Assume that image and image are two equivalence relations. image and image are their corresponding hierarchical structures. If image and image are image-similarity, then there exists a strictly increasing function image for image such that image.
Conversely, for image such that image.
The relation between image and image can be shown in Fig. 2.3.
image
Figure 2.3 The image-Similarity between Two Equivalence Relations
image
Figure 2.4 The Membership Functions of A and A
Fig. 2.3 shows that the hierarchical structures corresponding to image and image cannot be merged into one structure, but for any quotient space image within image, there exist two quotient spaces image and image in image, one is in front of image, and the other is behind image. Conversely, for any image within image, there exist two quotient spaces image and image in image, one is in front of image, and the other is behind image.

2.5.3.3. The Geometrical Meaning of the Structural Definition of Fuzzy Sets

In the structural definition of fuzzy sets, their membership functions are induced from equivalence relations. Now, we discuss the geometrical meaning of structures of fuzzy sets by using structures of fuzzy equivalence relations.
A fuzzy equivalence relation image is given. First, assume that fuzzy subset image is induced from a singleton image. The membership function of the fuzzy set defined by image is image. From Basic Theorem, letting image, then image is a normalized isosceles distance of some quotient space [X] of X. Under the distance, image is the neighborhood system of image, where image corresponds to the structure of fuzzy set image.
According to Definition 2.25, a totally ordered quotient space image can be defined by the neighborhood system. The order of the quotient space is decided by the distance from point image.
Generally, for any set A, define a fuzzy set A based on Definition 2.22, and A(x) is its membership function. Letting image, image is the distance from point x to set A in the sense of distance image. If image is a ε-neighborhood of A, then a corresponding totally ordered quotient space can be defined by the neighborhood system image of A, according to Definition 2.25, where the order of the quotient space is decided by the distance from a point to set A.
From the isomorphism principle in Section 2.5.2, it’s known that the structure of the totally ordered quotient space, corresponding to a fuzzy subset, is the essential property of the fuzzy subset.
Fig. 2.4 shows the geometrical intuition of common set A, and its corresponding fuzzy set A, where a crisp set A corresponds to a ‘platform’ with a vertical boundary face, while a fuzzy set A corresponds to a ‘platform’ with a slant boundary face.
From Definition 2.25, it’s known that a fuzzy set A decides an order relation of some quotient space [X] on X. The order is the essential property of A, and provides the relationship of distances from a spatial point to the core image of fuzzy set A. In common membership functions, an absolute value is used to describe the relation between a fuzzy set and any element within the set. While in the structural definition of fuzzy sets, the relative order relationship among elements is used to describe the fuzziness. Using the structural definition, as long as people have the same understanding of the relative order relation (or image-similarity) among elements, even different membership functions are used, the results they have are isomorphic (image-similarity), and after a finite number of fuzzy set operations, the results are still isomorphic. We show an example below.

Example 2.20

Fuzzy equivalence relation image is as Example 2.16. Letting image, define A and its corresponding membership function as

image

Its corresponding totally ordered quotient space is {(1),(1,2),(1,2,3,4)}.
Letting image be image, then its corresponding totally ordered quotient space is {(1),(1,2),(1,2,3,4)}.
There are three elements (1),(2),(3,4) in quotient space [X]A. Their order relation is (1)<(2)<(3,4). And the order relation is the essential property of fuzzy set image.

2.5.4. Conclusions

In the section, from the quotient space theory, we present the structural definition of a fuzzy set based on fuzzy equivalence relations, and the isomorphism and similarity principles of fuzzy sets. These principles may interpret the cause of robustness of fuzzy analysis, and answer the question why the same (or similar) results can be had, even using different membership functions in real fuzzy analysis.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.145.40.189