Next Article in Journal
Robust Approximate Optimality Conditions for Uncertain Nonsmooth Optimization with Infinite Number of Constraints
Next Article in Special Issue
Two Classes of Entropy Measures for Complex Fuzzy Sets
Previous Article in Journal
Cournot-Bayesian General Equilibrium: A Radon Measure Approach
Previous Article in Special Issue
Characterizations of Right Weakly Regular Semigroups in Terms of Generalized Cubic Soft Sets
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Duality in Fuzzy Sets and Dual Arithmetics of Fuzzy Sets

Department of Mathematics, National Kaohsiung Normal University, Kaohsiung 802, Taiwan
Mathematics 2019, 7(1), 11; https://doi.org/10.3390/math7010011
Submission received: 20 November 2018 / Revised: 9 December 2018 / Accepted: 20 December 2018 / Published: 22 December 2018
(This article belongs to the Special Issue Fuzziness and Mathematical Logic )

Abstract

:
The conventional concept of α-level sets of fuzzy sets will be treated as the upper α-level sets. In this paper, the concept of lower α-level sets of fuzzy sets will be introduced, which can also be regarded as a dual concept of upper α-level sets of fuzzy sets. We shall also introduce the concept of dual fuzzy sets. Under these settings, we can establish the so-called dual decomposition theorem. We shall also study the dual arithmetics of fuzzy sets in R and establish some interesting results based on the upper and lower α-level sets.

1. Introduction

The properties of fuzzy numbers and the arithmetic of fuzzy quantities (or fuzzy numbers) have been studied for a long time. The interesting issue for studying the additive inverse of a fuzzy number may refer to Hong and Do [1], Vrba [2] and Wu [3,4]. Also, Anzilli and Facchinetti [5], Bodjanova [6], Dubois and Prade [7] investigated the median, mean and variance of fuzzy numbers. Wang et al. [8] studied the two-dimensional discrete fuzzy numbers. Mitchell and Schaefer [9] and Yager and Filev [10] studied the orderings of fuzzy numbers. On the other hand, Deschrijver [11,12] studied the arithmetic operators in interval-valued fuzzy set. Ban and Coroianu [13] investigated the approximation of fuzzy numbers. Guerra and Stefanini [14] studied the approximation of arithmetic of fuzzy numbers. Holčapek and Štěpnička [15] studied a new framework for arithmetics of extensional fuzzy numbers. Stupňanová [16] used a probabilistic approach to study the arithmetics of fuzzy numbers. Wu [17] used the decomposition and construction of fuzzy sets to study the arithmetic operations on fuzzy quantities. In this paper, we shall study the dual arithmetic of fuzzy sets by considering the dual membership function.
The α -level set of a fuzzy set will be called the upper α -level set. In this paper, we shall define the so-called lower α -level set. The well-known (primal) decomposition theorem says that the membership function of a fuzzy set can be expressed in terms of the characteristic function of (upper) α -level sets. In this paper, we are going to establish the so-called dual decomposition theorem by showing that the membership function can be expressed in terms of lower α -level sets.
On the other hand, the concept of dual fuzzy set will be proposed by considering theso-called dual membership function. Based on the dual membership functions, we shall also study the so-called dual arithmetic of fuzzy sets in R . The definition of arithmetic operations is based on the supremum and minimum of membership functions. Inspired by its form, we shall define the so-called dual arithmetic operations based on the infimum and maximum of dual membership functions. A duality relation is also established between the arithmetics and dual arithmetics.
In Section 2, we introduce the concept of lower α -level sets and present some interesting properties that will be used in the subsequent discussion. In Section 3, we introduce the concept of dual fuzzy set and present some interesting results based on the lower α -level sets. In Section 4, we establish the so-called dual decomposition theorem. In Section 5, we introduce the dual arithmetics of fuzzy sets in R and establish some interesting results based on the upper and lower α -level sets.

2. Lower and Upper Level Sets

Let A ˜ be a fuzzy subset of a universal set U with membership function denoted by ξ A ˜ . For α ( 0 , 1 ] , the α -level set of A ˜ is denoted and defined by
A ˜ α = x U : ξ A ˜ ( x ) α .
For α [ 0 , 1 ) , we also define
A ˜ α + = x U : ξ A ˜ ( x ) > α .
The support of a fuzzy set A ˜ within a universal set U is the crisp set defined by
A ˜ 0 + = { x U : ξ A ˜ ( x ) > 0 } .
The definition of 0-level set is an important issue in fuzzy sets theory. If the universal set U is endowed with a topology τ , then the 0-level set A ˜ 0 can be defined as the closure of the support of A ˜ , i.e.,
A ˜ 0 = cl A ˜ 0 + .
If U is not endowed with a topological structure, then the intuitive way for defining the 0-level set is to follow the equality (1) for α = 0 . In this case, the 0-level set of A ˜ is the whole universal set U. This kind of 0-level set seems not so useful. Therefore, we always endow a topological structure to the universal set U when the 0-level set should be seriously considered.
Let A ˜ be a fuzzy set in U with membership function ξ A ˜ . The range of ξ A ˜ is denoted by R ( ξ A ˜ ) that is a subset of [ 0 , 1 ] . We see that the range R ( ξ A ˜ ) can be a proper subset of [ 0 , 1 ] with R ( ξ A ˜ ) [ 0 , 1 ] . Define
α A ˜ * = sup R ( ξ A ˜ ) = sup x A ˜ 0 ξ A ˜ ( x )   and   α A ˜ = inf R ( ξ A ˜ ) = inf x A ˜ 0 ξ A ˜ ( x ) .
Remark 1.
We have the following observations.
  • For any 0 α α A ˜ , even though α R ( ξ A ˜ ) , we have A ˜ α = A ˜ α A ˜ .
  • For any α A ˜ < α < α A ˜ * , even though α R ( ξ A ˜ ) , we have A ˜ α . It is also obvious that A ˜ α = for α > α A ˜ * .
  • If the maximum max R ( ξ A ˜ ) exists, i.e., sup R ( ξ A ˜ ) = max R ( ξ A ˜ ) , then we have A ˜ α A ˜ * . If max R ( ξ A ˜ ) does not exist, then A ˜ α A ˜ * = .
Therefore we have the following interesting and useful result.
Proposition 1.
Let A ˜ be a fuzzy set in U with membership function ξ A ˜ . Define α A ˜ * = sup R ( ξ A ˜ ) and
I A ˜ * = 0 , α A ˜ *   i s   a   h a l f - o p e n   i n t e r v a l , i f   t h e   m a x i m u m   max R ( ξ A ˜ )   d o e s   n o t   e x i s t 0 , α A ˜ *   i s   a   c l o s e d   i n t e r v a l , i f   t h e   m a x i m u m   max R ( ξ A ˜ )   e x i s t s .
Then A ˜ α for all α I A ˜ * and A ˜ α = for all α I A ˜ * . Moreover, we have R ( ξ A ˜ ) I A ˜ * .
Remark 2.
Recall that A ˜ is called a normal fuzzy set in U if and only if there exists x U such that ξ A ˜ ( x ) = 1 . In this case, we have I A ˜ * = [ 0 , 1 ] . However, the range R ( ξ A ˜ ) is not necessarily equal to [ 0 , 1 ] even though A ˜ is normal, since the membership function of A ˜ is not necessarily a continuous function.
The 0-level set A ˜ 0 of A ˜ is also called the proper domain of A ˜ , since ξ A ˜ ( x ) = 0 for all x A ˜ 0 . For α I A ˜ * , the α -level set A ˜ α of A ˜ may be called the upper α -level set (or upper α -cut) of A ˜ . We also see that
A ˜ α = x U : ξ A ˜ ( x ) α = x A ˜ 0 : ξ A ˜ ( x ) α
and
A ˜ α + = x U : ξ A ˜ ( x ) > α = x A ˜ 0 : ξ A ˜ ( x ) > α
Next we shall consider the so-called lower α -level set (or lower α -cut) of A ˜ .
Definition 1.
Let A ˜ be a fuzzy set in a topological space U with proper domain A ˜ 0 . For α [ 0 , 1 ] , the following set
α A ˜ = x A ˜ 0 : ξ A ˜ ( x ) α
is called the lower α-level set of A ˜ . For α ( 0 , 1 ] , we also define
α A ˜ = x A ˜ 0 : ξ A ˜ ( x ) < α .
We remark that the lower α -level set α A ˜ is considered in the proper domain A ˜ 0 rather than the whole universal set U. In general, it is clear to see that
α A ˜ = x A ˜ 0 : ξ A ˜ ( x ) α x U : ξ A ˜ ( x ) α .
Next, we present some interesting observations. We first recall that the notation x A \ B means x A and x B .
Remark 3.
Let A ˜ be a fuzzy set in U with range R ( ξ A ˜ ) . Recall the notations
α A ˜ * = sup R ( ξ A ˜ )   a n d   α A ˜ = inf R ( ξ A ˜ ) .
Then we have the following observations.
  • For any 0 α < α A ˜ , we have α A ˜ = . For any α > α A ˜ , even though α R ( ξ A ˜ ) , using (4), we have
    α A ˜ = A ˜ 0 x A ˜ 0 : ξ A ˜ ( x ) > α = A ˜ 0 x U : ξ A ˜ ( x ) > α = A ˜ 0 \ A ˜ α + .
    It is also obvious that α A ˜ = A ˜ 0 for α α A ˜ * . If the minimum min R ( ξ A ˜ ) exists, i.e., inf R ( ξ A ˜ ) = min R ( ξ A ˜ ) , then we have α A ˜ A ˜ and if min R ( ξ A ˜ ) does not exist, then α A ˜ A ˜ = .
  • If x 0 A ˜ then x A ˜ 0 and ξ A ˜ ( x ) = 0 .
  • For any α , β [ 0 , 1 ] with α < β , we have α A ˜ β A ˜ .
  • From Proposition 1, for α I A ˜ * with α > 0 , we have
    A ˜ α = x A ˜ 0 : ξ A ˜ ( x ) α = A ˜ 0 x A ˜ 0 : ξ A ˜ ( x ) < α = A ˜ 0 \ α A ˜ .
Regarding the lower α -level sets, from the first observation of Remark 3, we have the following interesting and useful result.
Proposition 2.
Let A ˜ be a fuzzy set in U with membership function ξ A ˜ . Define α A ˜ = inf R ( ξ A ˜ ) and
I A ˜ = α A ˜ , 1   i s   a   h a l f - o p e n   i n t e r v a l , i f   t h e   m i n i m u m   min R ( ξ A ˜ )   d o e s   n o t   e x i s t α A ˜ , 1   i s   a   c l o s e d   i n t e r v a l , i f   t h e   m i n i m u m   min R ( ξ A ˜ )   e x i s t s .
Then α A ˜ for all α I A ˜ and α A ˜ = for all α I A ˜ .
Remark 4.
If α A ˜ = 0 in Proposition 2, then I A ˜ = [ 0 , 1 ] . However, the range R ( ξ A ˜ ) is not necessarily equal to [ 0 , 1 ] when A ˜ is normal, since the membership function of A ˜ is not necessarily a continuous function.
Based on the interval I A ˜ in Proposition 2, we present some basic properties of lower α -level sets, which will be used in the further study.
Proposition 3.
Let A ˜ be a fuzzy set in U. Then we have the following results.
(i)
If α I A ˜ with α < 1 and { α n } n = 1 is a decreasing sequence in [ 0 , 1 ] such that α n α , then
α A ˜ = n = 1 α n A ˜ .
(ii)
For α I A ˜ with α > 0 , the following statements hold true.
  • If α n α , then
    n = 1 α n A ˜ α A ˜   a n d   α A ˜ n = 1 α n A ˜ n = 1 α n A ˜ .
  • If α n α with α n < α for all n, then
    α A ˜ = n = 1 α n A ˜ = n = 1 α n A ˜ .
(iii)
If α I A ˜ with α < 1 , then
α A ˜ = α < β 1 β A ˜ = α β 1 β A ˜ .
(iv)
If α I A ˜ with α > 0 , then
α A ˜ = 0 β < α β A ˜ .
Proof. 
To prove part (i), since α n α for all n = 1 , 2 , , we have α A ˜ α n A ˜ for all n = 1 , 2 , , which implies α A ˜ n = 1 α n A ˜ . On the other hand, for x n = 1 α n A ˜ , we have ξ A ˜ ( x ) α n for all n = 1 , 2 , , which implies ξ A ˜ ( x ) inf n α n = α . Therefore, we conclude that x α A ˜ .
To prove part (ii), given x α A ˜ , we have ξ A ˜ ( x ) < α . Since α n α , given any 0 < ϵ α ξ A ˜ ( x ) , there exists N such that 0 < α α N < ϵ , which says that ξ A ˜ ( x ) < α N , i.e., x n = 1 α n A ˜ . Therefore, we obtain the inclusion α A ˜ n = 1 α n A ˜ . On the other hand, since α n α , we have the following cases.
  • If α n α for all n = 1 , 2 , , then α n A ˜ α A ˜ , which implies n = 1 α n A ˜ α A ˜ .
  • If α n < α for all n = 1 , 2 , , we see that x α n A ˜ implies ξ A ˜ ( x ) α n < α , which says that α n A ˜ α A ˜ for all n = 1 , 2 , . Therefore, we have n = 1 α n A ˜ α A ˜ .
Then we obtain the desired equalities and inclusions.
To prove part (iii), for 1 β > α 0 , we have α A ˜ β A ˜ . Therefore, we have the inclusion α A ˜ β ( α , 1 ] β A ˜ . On the other hand, given any ϵ > 0 , for x β ( α , 1 ] β A ˜ , we have x α + ϵ A ˜ , since α + ϵ > α . This says that ξ A ˜ ( x ) α + ϵ , which also implies ξ A ˜ ( x ) α , since ϵ is an arbitrary positive number (i.e., we can take ϵ 0 ). Therefore, we conclude that x α A ˜ .
To prove part (iv), for β < α , if x β A ˜ , i.e., ξ A ˜ ( x ) β < α , then x α A ˜ . Therefore we obtain β A ˜ α A ˜ , which implies the inclusion 0 β < α β A ˜ α A ˜ . On the other hand, given any x α A ˜ , we have ξ A ˜ ( x ) < α . By the denseness, there exists β 0 such that ξ A ˜ ( x ) β 0 < α , i.e., x 0 β < α β A ˜ . Therefore, we obtain α A ˜ 0 β < α β A ˜ . This shows the desired equality, and the proof is complete. □
Based on the interval I A ˜ * in Proposition 1, we can similarly obtain the following results.
Proposition 4.
Let A ˜ be a fuzzy set in U. Then we have the following results.
(i)
If α I A ˜ * with α > 0 and { α n } n = 1 is an increasing sequence in [ 0 , 1 ] such that α n α , then
A ˜ α = n = 1 A ˜ α n .
(ii)
For α I A ˜ * with α < 1 , we have the following results.
  • If α [ 0 , 1 ) and α n α , then n = 1 A ˜ α n A ˜ α and A ˜ α + n = 1 A ˜ α n .
  • If α [ 0 , 1 ) and α n α with α n > α for all n, then A ˜ α + = n = 1 A ˜ α n .
(iii)
If α I A ˜ * with α > 0 , then
A ˜ α = β [ 0 , α ] A ˜ β = β [ 0 , α ) A ˜ β .
(iv)
If α I A ˜ * with α < 1 , then
A ˜ α + = α < β 1 A ˜ β .
Let f : S R be a real-valued function defined on a convex subset S of a real vector space U. Recall that f is quasi-convex on S if and only if, for each x , y S , the following inequality is satisfied:
f λ x + ( 1 λ ) y max f ( x ) , f ( y )
for each 0 < λ < 1 . It is well-known that f is quasi-convex on S if and only if the set { x S : f ( x ) α } is convex for each α R . We also recall that f is quasi-concave on S if and only if f is quasi-convex on S. More precisely, the real-valued function f is quasi-concave on S if and only if
f λ x + ( 1 λ ) y min f ( x ) , f ( y )
for each 0 < λ < 1 . We also have that f is quasi-concave on S if and only if the set { x S : f ( x ) α } is convex for each α R .
Let U be a vector space endowed with a topology, and let A ˜ be a fuzzy subset of U with membership function ξ A ˜ . It is well-known that the membership function ξ A ˜ is quasi-concave if and only if the α -level set A ˜ α is a convex subset of U for each α ( 0 , 1 ] . In this case, the union 0 < α 1 A ˜ α is also a convex subset of U. This says that the upper zero-level set
A ˜ 0 = cl 0 < α 1 A ˜ α
is a closed and convex subset of U. In particular, if U = R then the convex set A ˜ α is reduced to be an interval for α [ 0 , 1 ] .
Let f : ( U , τ U ) R be a real-valued function defined on a topological space ( U , τ U ) . Recall that f is upper semi-continuous on U if and only if { x U : f ( x ) λ } is a closed subset of U for all λ R , and f is lower semi-continuous on U if and only if { x U : f ( x ) λ } is a closed subset of U for all λ R . It is clear to see that if f is upper semi-continuous on U then f is lower semi-continuous on U, and if f is lower semi-continuous on U then f is upper semi-continuous on U.
Definition 2.
Let U be a vector space endowed with a topology, and let A ˜ be a fuzzy subset of U with membership function ξ A ˜ . We denote by F c c ( U ) the family of all fuzzy subsets of U such that each A ˜ F c c ( U ) satisfies the following conditions.
  • The membership function ξ A ˜ is upper semi-continuous and quasi-concave on U.
  • The upper 0-level set A ˜ 0 is a compact subset of U.
In particular, if U = R then each A ˜ F c c ( R ) is called a fuzzy interval. If the fuzzy interval a ˜ is normal and the upper 1-level set a ˜ 1 is a singleton set { a } , where a R , then a ˜ is also called a fuzzy number with core value a. Usually, we write the upper case A ˜ to denote the fuzzy interval, and write the lower case a ˜ to denote the fuzzy number.
The upper semi-continuity and quasi-concavity says that each upper α -level set A ˜ α is a closed and convex subset of U for α [ 0 , 1 ] . Recall that, in a topological space, each closed subset of a compact set is a compact set. Since A ˜ α A ˜ 0 for α ( 0 , 1 ] , it follows that each upper α -level set A ˜ α is also a compact set for α ( 0 , 1 ] .
Suppose that A ˜ is a fuzzy interval. Then the upper 0-level set A ˜ 0 is a closed and bounded subset of R . Also, the convexity, boundedness and closedness of each upper α -level set A ˜ α says that it is a bounded closed interval for α [ 0 , 1 ] . More precisely, we have
A ˜ α = if   α I A ˜ * A ˜ α L , A ˜ α U if   α I A ˜ * .
In particular, if a ˜ is a fuzzy number, then a ˜ α = [ a ˜ α L , a ˜ α U ] for all α [ 0 , 1 ] and a ˜ 1 L = a ˜ 1 U for α = 1 , i.e., the upper 1-level set a ˜ 1 = { a ˜ 1 L = a ˜ 1 U = a } is a singleton set, where a is the core value.
Example 1.
Let A ˜ be a fuzzy interval. Then the upper α-level set A ˜ α is a closed interval given by A ˜ α = [ A ˜ α L , A ˜ α U ] for all α [ 0 , 1 ] . From part (iv) of Proposition 4, for α I A ˜ * with α < 1 , we have
A ˜ α + = α < β 1 A ˜ β = α < β 1 A ˜ β L , A ˜ β U .
Since A ˜ α A ˜ β for β < α , if we further assume that the end-points A ˜ α L and A ˜ α U are continuous functions with respect to α on [ 0 , 1 ] , then A ˜ α + = ( A ˜ α L , A ˜ α U ) is an open interval. In this case, from Remark 3, for α I A ˜ with α > α A ˜ , the lower α-level set α A ˜ is given by
α A ˜ = A ˜ 0 \ A ˜ α + = A ˜ 0 L , A ˜ 0 U \ A ˜ α L , A ˜ α U = A ˜ 0 L , A ˜ α L A ˜ α U , A ˜ 0 U
that is also a closed set in R , where α A ˜ = inf R ( ξ A ˜ ) . This also says that the membership function ξ A ˜ of A ˜ is lower semi-continuous. Therefore we conclude that the membership function of A ˜ is continuous. We also see that the lower 1-level set is
1 A ˜ = A ˜ 0 = A ˜ 0 L , A ˜ 0 U .
Suppose that the minimum min R ( ξ A ˜ ) exists, i.e.,
α A ˜ = inf R ( ξ A ˜ ) = min R ( ξ A ˜ ) .
Then the lower α A ˜ -level set of A ˜ consists of two points as
α A ˜ A ˜ = A ˜ α A ˜ L , A ˜ α A ˜ U .
We also see that α A ˜ = for 0 α < α A ˜ .

3. Dual Fuzzy Sets

Let A ˜ be a fuzzy set in U with membership function ξ A ˜ defined on U. Recall that the membership function of complement fuzzy set of A ˜ is denoted and defined by ξ A ˜ c = 1 ξ A ˜ that is also defined on U. Since the 0-level set A ˜ 0 is treated as the proper domain of A ˜ , we consider the restrict function ξ A ˜ c | A ˜ 0 of ξ A ˜ c on A ˜ 0 and define a function ξ A ˜ : A ˜ 0 [ 0 , 1 ] on A ˜ 0 by
ξ A ˜ ( x ) = ξ A ˜ c | A ˜ 0 ( x ) = 1 ξ A ˜ ( x ) .
Then we use the notation A ˜ to denote the dual fuzzy set of A ˜ . The membership function of A ˜ is given in (6) that is also called a dual membership function. We also remark that ξ A ˜ ξ A ˜ c , since their domains are different.
Remark 5.
The relationships between the α-level sets of A ˜ and A ˜ are given below
  • If A ˜ α and 1 α A ˜ , then
    A ˜ α = x U : ξ A ˜ ( x ) α = x U : ξ A ˜ ( x ) 1 α = 1 α A ˜
  • If α A ˜ and A ˜ 1 α , then
    α A ˜ = x U : ξ A ˜ ( x ) α = x U : ξ A ˜ ( x ) 1 α = A ˜ 1 α
  • If A ˜ α and 1 α A ˜ , then
    A ˜ α = x U : ξ A ˜ ( x ) α = x U : ξ A ˜ ( x ) 1 α = 1 α A ˜
  • If α A ˜ and A ˜ 1 α , then
    α A ˜ = x U : ξ A ˜ ( x ) α = x U : ξ A ˜ ( x ) 1 α = A ˜ 1 α .
Let us recall that notation I A ˜ * in Proposition 1 and the notation I A ˜ in Proposition 2. Then we have the following interesting results.
Proposition 5.
Let A ˜ be a fuzzy set in U with the dual fuzzy set A ˜ . For α , β [ 0 , 1 ] with α + β = 1 , we have the following properties.
(i)
α I A ˜ * if and only if β I A ˜ .
(ii)
If α I A ˜ * or β I A ˜ then A ˜ α = β A ˜ .
Proof. 
We first have
1 α A ˜ * = 1 sup x A ˜ 0 ξ A ˜ ( x ) = 1 + inf x A ˜ 0 ξ A ˜ ( x ) = inf x A ˜ 0 1 ξ A ˜ ( x ) = inf x A ˜ 0 ξ A ˜ ( x ) = α A ˜ .
The equalities (7) also say that the maximum max R ( ξ A ˜ ) exists if and only if the minimum min R ( ξ A ˜ ) exists. To prove part (i), suppose that α I A ˜ * . We have two cases.
  • Assume that the maximum max R ( ξ A ˜ ) exists. Then the minimum min R ( ξ A ˜ ) exists and 0 α α A ˜ * , Therefore we obtain 1 β 1 α A ˜ * , which also says that 1 β α A ˜ by using (7). This shows that β I A ˜ .
  • Assume that the maximum max R ( ξ A ˜ ) doe not exist. Then the minimum min R ( ξ A ˜ ) does not exist and 0 α < α A ˜ * . Therefore we obtain 1 β > 1 α A ˜ * , which also says that 1 β > α A ˜ by using (7). This shows that β I A ˜ .
For the converse, suppose that β I A ˜ . Then we can similarly show that α I A ˜ * . Part (ii) follows from Remark 5 and part (i) immediately. This completes the proof. □
Let A ˜ F c c ( U ) . Then the membership function ξ A ˜ is upper semi-continuous and quasi-concave on A ˜ 0 . It is also clear to see that the membership function ξ A ˜ = 1 ξ A ˜ of dual fuzzy set A ˜ is lower semi-continuous and quasi-convex on A ˜ 0 . This says that the lower α -level set α A ˜ is a closed and convex subset of A ˜ 0 for α ( 0 , 1 ] .
Example 2.
Let A ˜ be a fuzzy interval with dual fuzzy set A ˜ . Since the upper 0-level set A ˜ 0 is bounded and the lower α-level set α A ˜ is a closed and convex subset of R for α ( 0 , 1 ] , it follows that α A ˜ is also a bounded closed interval given by
α A ˜ = i f   α I A ˜ α A ˜ L , α A ˜ U i f   α I A ˜ ,
Using part (ii) of Proposition 5, we also have
α A ˜ = i f   α I A ˜ A ˜ 1 α i f   α I A ˜ = i f   α I A ˜ A ˜ 1 α L , A ˜ 1 α U i f   α I A ˜ .
This shows that
α A ˜ L = A ˜ 1 α L   a n d   α A ˜ U = A ˜ 1 α U .
From part (iv) of Proposition 3, for α I A ˜ with α > 0 , we have
α A ˜ = 0 β < α β A ˜ = 0 β < α β A ˜ L , β A ˜ U .
Since β A ˜ α A ˜ for β < α , if we further assume that the end-points β A ˜ L and β A ˜ U are continuous functions with respect to β on [ 0 , 1 ] , then α A ˜ = ( α A ˜ L , α A ˜ U ) is an open interval. In this case, from Remark 3, for α I A ˜ * with α > 0 , the upper α-level set A ˜ α is given by
A ˜ α = A ˜ 0 \ α A ˜ = A ˜ 0 L , A ˜ 0 U \ α A ˜ L , α A ˜ U = A ˜ 0 L , α A ˜ L α A ˜ U , A ˜ 0 U
that is a closed set in R . This also says that the membership function of A ˜ is upper semi-continuous. Therefore, we conclude that the membership functions of A ˜ and A ˜ are continuous.

4. Dual Decomposition Theorems

Let A be a subset of U. The characteristic function χ A of A is defined to be
χ A ( x ) = 1 if   x A 0 if   x A .
Now we define the so-called dual characteristic function χ A of A as follows
χ A ( x ) = 0 if   x A 1 if   x A .
It is clear to see that
χ A ( x ) + χ A ( x ) = 1   for   each   x U .
Let A ˜ be a normal fuzzy set in U. The well-known (primal) decomposition theorem says that the membership function ξ A ˜ can be expressed as
ξ A ˜ ( x ) = sup α [ 0 , 1 ] α · χ A ˜ α ( x ) = sup α ( 0 , 1 ] α · χ A ˜ α ( x ) ,
where χ A ˜ α is the characteristic function of the α -level set A ˜ α . If A ˜ is not normal, then we can also show that
ξ A ˜ ( x ) = sup α I A ˜ * α · χ A ˜ α ( x ) = sup α R ( ξ A ˜ ) α · χ A ˜ α ( x ) .
The (primal) decomposition theorem says that the membership function can be expressed in terms of upper α -level sets. In the sequel, we are going to show that the membership function can also be expressed in terms of lower α -level sets as the following form
ξ A ˜ ( x ) = sup α I A ˜ α · χ α A ˜ ( x ) = sup α R ( ξ A ˜ ) α · χ α A ˜ ( x ) ,
where χ α A ˜ is the dual characteristic function of lower α -level set α A ˜ .
Proposition 6.
Let A ˜ be a fuzzy set in a vector space U that is also endowed with a topology. Given any fixed x U , we have the following results.
(i)
Suppose that the minimum min R ( ξ A ˜ ) exists. Then the function ζ x ( α ) = α · χ α A ˜ ( x ) is lower semi-continuous on I A ˜ .
(ii)
Suppose that the maximum max R ( ξ A ˜ ) exists. Then the function η x ( α ) = α · χ A ˜ α ( x ) is upper semi-continuous on I A ˜ * .
Proof. 
To prove part (i), from Proposition 2, we see that I A ˜ is a closed interval. We need to show that the following set
F r = α I A ˜ : ζ x ( α ) r = α I A ˜ : α · χ α A ˜ ( x ) r
is closed for each r R . If r < 0 then F r = is closed. If r = 0 then F r = { 0 } a singleton set is closed. If r 1 then F r = I A ˜ is also closed. Therefore we remain to show that F r is closed for each r ( 0 , 1 ) . Now, for each α cl ( F r ) , there exists a sequence { α n } n = 1 in F r such that α n α , i.e., α n r and x α n A ˜ for all n. Then we have
α = lim n α n r < 1 .
We also see that there exists a subsequence { α n k } k = 1 of { α n } n = 1 such that α n k α or α n k α .
  • Suppose that α n k α , i.e., α α n k for all k. Then we have x α A ˜ , since α n k A ˜ α A ˜ for all k. This says that α F r , since α r .
  • Suppose that α n k α . Since x α n k A ˜ for all k, using part (i) of Proposition 3, we have x α A ˜ . This says that α F r , since α r .
Therefore, we conclude that cl ( F r ) F r , i.e., F r is closed.
To prove part (ii), from Proposition 1, we see that I A ˜ * is a closed interval. We need to show that the following set
F r = α I A ˜ * : η x ( α ) r = α I A ˜ * : α · χ A ˜ α ( x ) r
is closed for each r R . If r 0 then F r = I A ˜ * is closed. If r > 1 then F r = is closed. If r = 1 then F r = or F r = { 1 } a singleton set is also closed. Therefore we remain to show that F r is closed for each r ( 0 , 1 ) . Now, for each α cl ( F r ) , since r > 0 , we have α > 0 . Therefore, there exists a sequence { α n } n = 1 such that α n α and α n F r for all n, i.e., α n r and x A ˜ α n for all n. Then we have α r . We also see that there exists a subsequence { α n k } k = 1 of { α n } n = 1 such that α n k α or α n k α .
  • If α n k α , i.e., α α n k for all k, then x A ˜ α , since A ˜ α n k A ˜ α for all k by part (i) of Proposition 4. This says that α F r , since α r .
  • If α n k α , Then since x A ˜ α n k for all k by part (ii) of Proposition 4, we have x A ˜ α . This says that α F r , since α r .
Therefore, we conclude that cl ( F r ) F r , i.e., F r is closed. This completes the proof. □
Theorem 1.
(Dual Decomposition Theorem) Let A ˜ be a fuzzy set in U with proper domain A ˜ 0 . For x A ˜ 0 , the membership degree ξ A ˜ ( x ) can be expressed in terms of lower α-level sets as follows
ξ A ˜ ( x ) = sup α R ( ξ A ˜ ) α · χ α A ˜ ( x ) = max α R ( ξ A ˜ ) α · χ α A ˜ ( x ) = max α R ( ξ A ˜ ) α · 1 χ α A ˜ ( x ) = sup α I A ˜ α · χ α A ˜ ( x ) = max α I A ˜ α · χ α A ˜ ( x ) = max α I A ˜ α · 1 χ α A ˜ ( x ) ,
where I A ˜ is given in (5).
Proof. 
Let α 0 = ξ A ˜ ( x ) R ( ξ A ˜ ) I A ˜ , i.e., α 0 I A ˜ . Suppose that α 0 = 0 . If x α A ˜ for some α I A ˜ , then ξ A ˜ ( x ) > α 0 , which contradicts ξ A ˜ ( x ) = α 0 = 0 . Therefore x α A ˜ for all α I A ˜ , which says that α · χ α A ˜ ( x ) = 0 for all α I A ˜ . This shows that the equalities in (8) are satisfied. Now we assume α 0 > 0 . Then x α 0 A ˜ . For α I A ˜ with α < α 0 , if x α A ˜ , then ξ A ˜ ( x ) α < α 0 , which contradicts α 0 = ξ A ˜ ( x ) . Therefore, we have x α A ˜ for α I A ˜ with α < α 0 . If α I A ˜ with α α 0 , then x α 0 A ˜ α A ˜ , which says that x α A ˜ for α α 0 . Then we obtain
sup α I A ˜ α · χ α A ˜ ( x ) = max sup { α I A ˜ : α < α 0 } α · χ α A ˜ ( x ) , sup { α I A ˜ : α α 0 } α · χ α A ˜ ( x ) = max sup { α I A ˜ : α < α 0 } α , 0 = max { α 0 , 0 } = α 0 = ξ A ˜ ( x ) .
Since α 0 I A ˜ , the above supremum is attained. It means that
ξ A ˜ ( x ) = max α I A ˜ α · χ α A ˜ ( x ) .
The above arguments are still valid when I A ˜ is replaced by R ( ξ A ˜ ) . Therefore we obtain the desired equalities. This completes the proof. □
Remark 6.
The decomposition theorem for dual fuzzy set A ˜ based on the upper α-level sets of A ˜ is given by
ξ A ˜ ( x ) = sup α R ( ξ A ˜ ) α · χ A ˜ α ( x ) .
According to Theorem 1, the dual decomposition theorem for A ˜ based on the lower α-level sets of A ˜ is given by
ξ A ˜ ( x ) = sup α R ( ξ A ˜ ) α · χ α A ˜ ( x ) = max α R ( ξ A ˜ ) α · χ α A ˜ ( x ) = max α R ( ξ A ˜ ) α · 1 χ α A ˜ ( x ) = sup α I A ˜ α · χ α A ˜ ( x ) = max α I A ˜ α · χ α A ˜ ( x ) = max α I A ˜ α · 1 χ α A ˜ ( x ) .
Next we are going to present the dual decomposition theorem on a countable set. We write Q ( 0 , 1 ] = Q ( 0 , 1 ] , where Q denotes the set of all rational numbers. It well-known that the countable set Q is dense in R . This means that, given any r R , there exist two sequences { p n } n = 1 and { q n } n = 1 in the countable set Q such that p n r and q n r as n .
Theorem 2.
(Dual Decomposition Theorem) Let A ˜ be a fuzzy set in U with proper domain A ˜ 0 . Suppose that inf R ( ξ A ˜ ) = 0 . For x A ˜ 0 , the membership degree ξ A ˜ ( x ) can be expressed in terms of lower α-level sets as follows
ξ A ˜ ( x ) = sup α [ 0 , 1 ] α · χ α A ˜ ( x ) = max α [ 0 , 1 ] α · χ α A ˜ ( x ) = max α [ 0 , 1 ] α · 1 χ α A ˜ ( x )
= sup α Q ( 0 , 1 ] α · χ α A ˜ ( x ) = max α Q ( 0 , 1 ] α · χ α A ˜ ( x ) = max α Q ( 0 , 1 ] α · 1 χ α A ˜ ( x ) .
Proof. 
From Remark 4, it follows that I A ˜ = [ 0 , 1 ] . Using Theorem 1, we can obtain the equalities (9). To prove the equalities (10), let ξ A ˜ ( x ) = α 0 . We first assume that α 0 = 0 . From the proof of Theorem 1, we have x α A ˜ for all α I A ˜ = [ 0 , 1 ] , which says that α · χ α A ˜ ( x ) = 0 for all α Q ( 0 , 1 ] . It follows that
ξ A ˜ ( x ) = α 0 = 0 = sup α Q ( 0 , 1 ] α · χ α A ˜ ( x ) .
Now we assume that 0 < α 0 . Using (9), we have
0 < ξ A ˜ ( x ) = α 0 = sup α [ 0 , 1 ] α · χ α A ˜ ( x ) sup α Q ( 0 , 1 ] α · χ α A ˜ ( x ) .
Since α 0 > 0 , from the proof of Theorem 1 we have x α A ˜ for α I A ˜ = [ 0 , 1 ] with α < α 0 . The denseness also says that there exists a sequence { α n } n = 1 in Q ( 0 , 1 ] such that α n α 0 with α n < α 0 . It follows that x α n A ˜ for all n. Let Γ = { α n } n = 1 Q ( 0 , 1 ] . Then we have
ξ A ˜ ( x ) = α 0 = lim n α n = sup n α n = sup n α n · χ α n A ˜ ( x ) = sup α Γ α · χ α A ˜ ( x ) sup α Q ( 0 , 1 ] α · χ α A ˜ ( x ) .
Combining (11) and (12), we obtain the equality
ξ A ˜ ( x ) = sup α Q ( 0 , 1 ] α · χ α A ˜ ( x ) .
This completes the proof. □

5. Dual Arithmetics of Fuzzy Sets

Let A ˜ and B ˜ be fuzzy numbers in R ; that is, A ˜ and B ˜ are normal fuzzy sets in R satisfying some elegant structures such that their α -level sets turn into the bounded closed intervals in R . Then we have the following well-known equality
( A ˜ B ˜ ) α = A ˜ α B ˜ α a b : a A ˜ α   and   b B ˜ α   for   α [ 0 , 1 ] ,
where the upper α -level sets are considered. For convenience, we use the same notation ∘ to denote the operations for the α -level sets A ˜ α B ˜ α and the real numbers a b . In this paper, we shall consider the general fuzzy sets in R rather than the fuzzy numbers to establish the similar equality based on the lower α -level sets.
Let ⊙ denote any one of the four basic arithmetic operations , , , between fuzzy sets A ˜ and B ˜ in R . The membership function of A ˜ B ˜ is defined by
ξ A ˜ B ˜ ( z ) = sup { ( x , y ) U × U : z = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) }
for all z R , where the operation { + , , × , / } , respectively. Since the 0-level sets A ˜ 0 and B ˜ 0 are the proper domain of A ˜ and B ˜ , respectively, i.e., ξ A ˜ ( x ) = 0 for x A ˜ 0 and ξ B ˜ ( x ) = 0 for x B ˜ 0 , we have
ξ A ˜ B ˜ ( z ) = sup { ( x , y ) U × U : z = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = sup { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } .
Inspired by the above expression (13), we define a new operation between A ˜ and B ˜ using the dual membership functions as follows
ξ A ˜ B ˜ ( z ) = inf { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = inf { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } max { ξ A ˜ c ( x ) , ξ B ˜ c ( y ) } .
We need to emphasize that
inf { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } inf { ( x , y ) : z = x y } max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } .
However, this operation A ˜ B ˜ is reasonable, since we consider the proper domains as shown in (13). Then we have
ξ A ˜ B ˜ ( z ) = inf { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } max { 1 ξ A ˜ ( x ) , 1 ξ B ˜ ( y ) } = 1 sup { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = 1 ξ A ˜ B ˜ ( z ) ,
which implies
ξ A ˜ B ˜ ( z ) + ξ A ˜ B ˜ ( z ) = 1 .
Therefore we say that A ˜ B ˜ is the dual arithmetic of A ˜ B ˜ . This means that, instead of calculating A ˜ B ˜ , we can alternatively calculate A ˜ B ˜ and use the duality (14) to recover A ˜ B ˜ . We are going to study the lower α -level sets of dual arithmetic A ˜ B ˜ and establish the relationships between A ˜ B ˜ and A ˜ B ˜ .
Let A ˜ and B ˜ be two fuzzy sets in R with membership functions ξ A ˜ and ξ B ˜ , respectively. Let
α A ˜ * = sup R ( ξ A ˜ )   and   α B ˜ * = sup R ( ξ B ˜ ) .
From Proposition 1 and (3), we see that A ˜ α for α I A ˜ * , where I A ˜ * is given by
I A ˜ * = 0 , α A ˜ * , if   max R ( ξ A ˜ )   does   not   exist 0 , α A ˜ * , if   max R ( ξ A ˜ )   exists .
Similarly, we also see that B ˜ α for α I B ˜ * , where I B ˜ * is given by
I B ˜ * = 0 , α B ˜ * , if   max R ( ξ B ˜ )   does   not   exist 0 , α B ˜ * , if   max R ( ξ B ˜ )   exists .
For further discussion, we need a simple lemma.
Lemma 1.
Let f be a real-valued function defined on A, and let k be a constant. Then
sup x A min f ( x ) , k = min sup x A f ( x ) , k
and
inf x A max f ( x ) , k = max inf x A f ( x ) , k .
Proof. 
We have
min sup x A f ( x ) , k = k , if   there   exists   x A   such   that   f ( x ) > k sup x A f ( x ) , if   f ( x ) k   for   all   x A .
and
sup x A min f ( x ) , k = max sup { x A : f ( x ) > k } min f ( x ) , k , sup { x A : f ( x ) k } min f ( x ) , k , if   there   exists   x A   such   that   f ( x ) > k sup x A f ( x ) , if   f ( x ) k   for   all   x A . = max k , sup { x A : f ( x ) k } f ( x ) , if   there   exists   x A   such   that   f ( x ) > k sup x A f ( x ) , if   f ( x ) k   for   all   x A . = k , if   there   exists   x A   such   that   f ( x ) > k sup x A f ( x ) , if   f ( x ) k   for   all   x A .
Another equality can be similarly obtained. This completes the proof. □
Proposition 7.
Let A ˜ and B ˜ be two fuzzy sets in R . Then the following statements hold true.
(i)
We have
α A ˜ B ˜ * sup R ( ξ A ˜ B ˜ ) = min sup R ( ξ A ˜ ) , sup R ( ξ B ˜ )
with
I A ˜ B ˜ * = 0 , α A ˜ B ˜ * , i f max R ( ξ A ˜ B ˜ )   d o e s   n o t   e x i s t 0 , α A ˜ B ˜ * , i f max R ( ξ A ˜ B ˜ )   e x i s t s
We also have ( A ˜ B ˜ ) α for α I A ˜ B ˜ * and ( A ˜ B ˜ ) α = for α I A ˜ B ˜ * .
(ii)
We have
α A ˜ B ˜ inf R ( ξ A ˜ B ˜ ) = max inf R ( ξ A ˜ ) , inf R ( ξ B ˜ ) = max 1 sup R ( ξ A ˜ ) , 1 sup R ( ξ B ˜ ) .
with
I A ˜ B ˜ = α A ˜ B ˜ , 1 , i f min R ( ξ A ˜ B ˜ )   d o e s   n o t   e x i s t α A ˜ B ˜ , 1 , i f min R ( ξ A ˜ B ˜ )   e x i s t s
We also have α ( A ˜ B ˜ ) for α I A ˜ B ˜ and α ( A ˜ B ˜ ) = for α I A ˜ B ˜ .
Proof. 
To prove part (i), let α A ˜ * and α B ˜ * be defined in (15). Then ξ A ˜ ( x ) α A ˜ * and ξ B ˜ ( y ) α B ˜ * for all x A ˜ 0 and y B ˜ 0 . It follows that
min ξ A ˜ ( x ) , ξ B ˜ ( y ) min α A ˜ * , α B ˜ *
for all x A ˜ 0 and y B ˜ 0 , which implies
ξ A ˜ B ˜ ( z ) = sup { ( x , y ) : z = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = sup { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } min α A ˜ * , α B ˜ *
for all z U . This says that min { α A ˜ * , α B ˜ * } is an upper bound of function ξ A ˜ B ˜ . Suppose that η ξ A ˜ B ˜ ( z ) for all z U . Then η min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } for all x A ˜ 0 , y B ˜ 0 and z U . Using Lemma 1, we have
η sup x A ˜ 0 sup y B ˜ 0 min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = min sup x A ˜ 0 ξ A ˜ ( x ) , sup y B ˜ 0 ξ B ˜ ( y ) = min α A ˜ * , α B ˜ * .
This says that min { α A ˜ * , α B ˜ * } is a least upper bound of function ξ A ˜ B ˜ . By the definition of supremum, we obtain the desired equality (16). The interval I A ˜ B ˜ * follows from Proposition 1 immediately.
To prove part (ii), we first note that
inf x A ˜ 0 ξ A ˜ ( x ) = 1 sup x A ˜ 0 ξ A ˜ ( x ) = 1 α A ˜ *   a n d   inf x A ˜ 0 ξ B ˜ ( x ) = 1 sup x A ˜ 0 ξ B ˜ ( x ) = 1 α B ˜ * .
Since
ξ A ˜ ( x ) inf x A ˜ 0 ξ A ˜ ( x ) = 1 α A ˜ *   a n d   ξ B ˜ ( x ) inf x A ˜ 0 ξ B ˜ ( x ) = 1 α B ˜ *
for all x A ˜ 0 and y B ˜ 0 , it follows that
max ξ A ˜ ( x ) , ξ B ˜ ( y ) max 1 α A ˜ * , 1 α B ˜ *
for all x A ˜ 0 and y B ˜ 0 , which implies
ξ A ˜ B ˜ ( z ) = inf { ( x , y ) A ˜ 0 × B ˜ 0 : z = x * y } max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } max 1 α A ˜ * , 1 α B ˜ *
for all z U . This says that max { 1 α A ˜ * , 1 α B ˜ * } is a lower bound of function ξ A ˜ B ˜ . Suppose that ζ ξ A ˜ B ˜ ( z ) for all z U . Then ζ max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } for all x A ˜ 0 , y B ˜ 0 and z U . Using Lemma 1, we have
ζ inf x A ˜ 0 inf y B ˜ 0 max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = max inf x A ˜ 0 ξ A ˜ ( x ) , inf y B ˜ 0 ξ B ˜ ( y ) = max 1 α A ˜ * , 1 α B ˜ * .
This says that max 1 α A ˜ * , 1 α B ˜ * is a greatest lower bound of function ξ A ˜ B ˜ . By the definition of infimum, we obtain the desired equality (17). The interval I A ˜ B ˜ follows from Proposition 2 immediately. This completes the proof. □
We write I * , = I A ˜ * I B ˜ * . Then I * , is given by
I * , = 0 , α A ˜ * 0 , α B ˜ * , if   max R ( ξ A ˜ )   and   max R ( ξ B ˜ )   does   not   exist 0 , α A ˜ * 0 , α B ˜ * , if   max R ( ξ A ˜ )   exists   and   max R ( ξ B ˜ )   does   not   exist 0 , α A ˜ * 0 , α B ˜ * , if   max R ( ξ A ˜ )   does   not   exist   and   max R ( ξ B ˜ )   exists 0 , α A ˜ * 0 , α B ˜ * , if   max R ( ξ A ˜ )   and   max R ( ξ B ˜ )   exist .
From part (i) of Proposition 7 by referring to (16), we see that
I * , = I A ˜ B ˜ * .
Let S be a nonempty subset in a topological space ( U , τ ) . Recall that S is compact if and only if, for every sequence { x n } n = 1 in S, there exists a convergent subsequence { x n k } k = 1 in S. If the limit of { x n k } k = 1 is denoted by x 0 , then x 0 is in S. In particular, if U = R n , then S is compact if and only if S is closed and bounded. We need a useful lemma.
Lemma 2.
(Royden ([18] p. 161)). Let U be a topological space, and let K be a compact subset of U. Let f be a real-valued function defined on U.
(i)
If f is lower semi-continuous, then f assumes its minimum on a compact subset of U; that is, the infimum is attained in the following sense
inf x K f ( x ) = min x K f ( x ) .
(ii)
If f is upper semi-continuous, then f assumes its maximum on a compact subset of U; that is, the supremum is attained in the following sense
sup x K f ( x ) = max x K f ( x ) .
If α I * , then A ˜ α = or B ˜ α = . Therefore, in order to consider the operation
A ˜ α B ˜ α a b : a A ˜ α   and   b B ˜ α ,
we need to take α I * , . We also remark that if A ˜ and B ˜ are normal fuzzy sets then I * , = [ 0 , 1 ] .
Theorem 3.
Let A ˜ and B ˜ be two fuzzy sets in R with the dual fuzzy sets A ˜ and B ˜ , respectively. Suppose that the arithmetic operations { , , } correspond to the operations { + , , * } . Then the following statements hold true.
(i)
We have ( A ˜ B ˜ ) α = for α I * , .
(ii)
We have the following inclusion
( A ˜ B ˜ ) α A ˜ α B ˜ α = 1 α A ˜ 1 α B ˜   f o r   a l l   α I * , .
(iii)
Suppose that the membership functions of A ˜ and B ˜ are upper semi-continuous. Then
( A ˜ B ˜ ) α = A ˜ α B ˜ α   f o r   a l l   α I * ,   w i t h   α > 0
and
( A ˜ B ˜ ) 0 = cl ( A ˜ B ˜ ) 0 + = cl 0 < α I * , A ˜ α B ˜ α .
(iv)
Suppose that the membership functions of A ˜ and B ˜ are upper semi-continuous, and that the supports A ˜ 0 + and B ˜ 0 + are bounded. Then
( A ˜ B ˜ ) α = A ˜ α B ˜ α = 1 α A ˜ 1 α B ˜   f o r   a l l   α I * , .
Proof. 
To prove part (i), since I * , = I A ˜ B ˜ * by (19), Proposition 1 says that ( A ˜ B ˜ ) α = for α I A ˜ B ˜ * = I * , .
To prove part (ii), for α I * , with α > 0 and z α A ˜ α B ˜ α , since A ˜ α and B ˜ α , there exist x α A ˜ α and y α B ˜ α such that z α = x α y α for { + , , * } , where ξ A ˜ ( x α ) α and ξ B ˜ ( y α ) α . Therefore, we have
ξ A ˜ B ˜ ( z α ) = sup { ( x , y ) : z α = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } min { ξ A ˜ ( x α ) , ξ B ˜ ( y α ) } α ,
which says that z α ( A ˜ B ˜ ) α . This shows that A ˜ α B ˜ α ( A ˜ B ˜ ) α for α I * , with α > 0 .
Now, for α = 0 and z 0 A ˜ 0 B ˜ 0 , there also exist x 0 A ˜ 0 and y 0 B ˜ 0 such that z 0 = x 0 y 0 for { + , , * } . Since
A ˜ 0 = cl { x R : ξ A ˜ ( x ) > 0 }   and   B ˜ 0 = cl { y R : ξ B ˜ ( y ) > 0 } ,
there exist sequence { x n } n = 1 in { x R : ξ A ˜ ( x ) > 0 } and sequence { y n } n = 1 in { y R : ξ B ˜ ( y ) > 0 } such that x n x 0 and y n y 0 as n . Let z n = x n y n . Then we see that z n x 0 y 0 = z 0 , since the binary operation { + , , * } is continuous. We also have
ξ A ˜ B ˜ ( z n ) = sup { ( x , y ) : z n = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } min { ξ A ˜ ( x n ) , ξ B ˜ ( y n ) } > 0 ,
which says that z n { z R : ξ A ˜ B ˜ ( z ) > 0 } . Since z n z 0 , it means that
z 0 cl { z R : ξ A ˜ B ˜ ( z ) > 0 } = ( A ˜ B ˜ ) 0 .
This shows that A ˜ 0 B ˜ 0 ( A ˜ B ˜ ) 0 . Therefore we conclude that A ˜ α B ˜ α ( A ˜ B ˜ ) α for α I * , .
To prove part (iii), in order to prove another direction of inclusion, we further assume that the membership functions of A ˜ and B ˜ are upper semi-continuous; that is, the nonempty α -level sets A ˜ α and B ˜ α are closed subsets of R for all α I * , . Given any α I * , with α > 0 and z α ( A ˜ B ˜ ) α , we have
sup { ( x , y ) : z α = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = ξ A ˜ B ˜ ( z α ) α .
Since z α is finite, it is clear to see that F { ( x , y ) : z α = x y } is a bounded subset of R 2 . We also see that the function g ( x , y ) = x y is continuous on R 2 . Since the singleton set { z α } is a closed subset of R , it follows that the inverse image F = g 1 ( { z α } ) of { z α } is also a closed subset of R 2 . This says that F is a compact subset of R 2 . Now we want to show that the function f ( x , y ) = min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } is upper semi-continuous, i.e., we want to show that { ( x , y ) : f ( x , y ) α } is a closed subset of R 2 for any α R .
  • For α I * , with α > 0 , i.e., A ˜ α and B ˜ α , we have
    { ( x , y ) : f ( x , y ) α } = ( x , y ) : ξ A ˜ ( x ) α   and   ξ B ˜ ( y ) α = ( x , y ) : x A ˜ α   and   y B ˜ α = A ˜ α × B ˜ α ,
    which is a closed subset of R 2 , since A ˜ α and B ˜ α are closed subsets of R .
  • If α 0 , then { ( x , y ) : f ( x , y ) α } = R 2 is a closed subset of R 2 .
  • If α I * , with α > 0 then A ˜ α = or B ˜ α = . Suppose that A ˜ α = . Then ξ A ˜ ( x ) < α for all x R . Similarly, if B ˜ α = , then ξ B ˜ ( y ) < α for all y R . Therefore we conclude that f ( x , y ) < α for all ( x , y ) R 2 , which implies { ( x , y ) : f ( x , y ) α } = that is also a closed subset of R 2 .
Therefore the function f ( x , y ) is indeed upper semi-continuous. By Lemma 2, the function f assumes maximum on F; that is, from (20), we have
max ( x , y ) F f ( x , y ) = max { ( x , y ) : z α = x y } f ( x , y ) = sup { ( x , y ) : z α = x y } f ( x , y ) α .
In other words, there exists ( x α , y α ) F such that z α = x α y α and
min { ξ A ˜ ( x α ) , ξ B ˜ ( y α ) } = f ( x α , y α ) = max ( x , y ) F f ( x , y ) α ,
i.e., ξ A ˜ ( x α ) α and ξ B ˜ ( y α ) α . Therefore, we obtain x α A ˜ α and y α B ˜ α , which says that z α A ˜ α B ˜ α , i.e., ( A ˜ B ˜ ) α A ˜ α B ˜ α for all α I * , with α > 0 . Using part (i), we obtain the desired equality. We also have
( A ˜ B ˜ ) 0 = cl ( A ˜ B ˜ ) 0 + = cl 0 < α 1 ( A ˜ B ˜ ) α   ( using   part   ( iv )   of   Proposition   4 ) = cl 0 < α I * , A ˜ α B ˜ α   ( using   part   ( i ) ) = cl 0 < α I * , A ˜ α B ˜ α .
To prove part (iv), for α = 0 and
z 0 ( A ˜ B ˜ ) 0 = cl ( A ˜ B ˜ ) 0 + = cl z R : ξ A ˜ B ˜ ( z ) > 0 ,
there exists a sequence { z n } n = 1 in the set { z R : ξ A ˜ B ˜ ( z ) > 0 } such that z n z 0 as n . Using the above same arguments by referring to (21), we also have
0 < ξ A ˜ B ˜ ( z n ) = sup { ( x , y ) : z n = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = max { ( x , y ) : z n = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } .
Therefore, there exist x n and y n such that z n = x n y n and
min { ξ A ˜ ( x n ) , ξ B ˜ ( y n ) } = max { ( x , y ) : z n = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) } > 0 ,
i.e., ξ A ˜ ( x n ) > 0 and ξ B ˜ ( y n ) > 0 . This shows that the sequences { x n } n = 1 and { y n } n = 1 are in the supports A ˜ 0 + and B ˜ 0 + , respectively. Since A ˜ 0 + and B ˜ 0 + are bounded, i.e., { x n } n = 1 and { y n } n = 1 are bounded sequences, there exist convergent subsequences { x n k } k = 1 and { y n k } k = 1 of { x n } n = 1 and { y n } n = 1 , respectively. In other words, we have x n k x 0 and y n k y 0 as k , where x 0 cl ( A ˜ 0 + ) = A ˜ 0 and y 0 cl ( B ˜ 0 + ) = B ˜ 0 . Let z n k = x n k y n k . Then { z n k } k = 1 is a subsequence of { z n } n = 1 , i.e., z n k z 0 as k . Since
z 0 = lim k z n k = lim k ( x n k y n k ) = lim k x n k lim k y n k = x 0 y 0 ,
which shows that z 0 A ˜ 0 B ˜ 0 . Therefore we obtain the inclusion ( A ˜ B ˜ ) 0 A ˜ 0 B ˜ 0 . Using parts (i) and (ii), we obtain the desired equalities. This completes the proof. □
We do not consider the operation ⊘ in Theorem 3. The reasons is that the case of zero denominator should be avoided. We also remark that the arguments in the proof of Theorem 3 are still available for the operation ⊘ by carefully excluding the zero denominator. In order not to complicate the proof of Theorem 3, we omit the case of operation ⊘.
Let A ˜ and B ˜ be two fuzzy sets in R with the dual fuzzy sets A ˜ and B ˜ , respectively. We define
α A ˜ = inf R ( ξ A ˜ )   and   α B ˜ = inf R ( ξ B ˜ ) .
From Proposition 2 and (5), we see that α A ˜ for α I A ˜ , where I A ˜ is given by
I A ˜ = α A ˜ , 1 , if   min R ( ξ A ˜ )   does   not   exist α A ˜ , 1 , if   min R ( ξ A ˜ )   exists .
Similarly, we also see that α B ˜ for α I B ˜ , where I B ˜ is given by
I B ˜ = α B ˜ , 1 , if   min R ( ξ B ˜ )   does   not   exist α B ˜ , 1 , if   min R ( ξ B ˜ )   exists .
We write I , = I A ˜ I B ˜ . Then I , is given by
I , = α A ˜ , 1 α B ˜ , 1 , if   min R ( ξ A ˜ )   and   min R ( ξ B ˜ )   does   not   exist α A ˜ , 1 α B ˜ , 1 , if   min R ( ξ A ˜ )   exists   and   min R ( ξ B ˜ )   does   not   exist α A ˜ , 1 α B ˜ , 1 , if   min R ( ξ A ˜ )   does   not   exist   and   min R ( ξ B ˜ )   exists α A ˜ , 1 α B ˜ , 1 , if   min R ( ξ A ˜ )   and   min R ( ξ B ˜ )   exist .
From part (ii) of Proposition 7 by referring to (17), we see that
I , = I A ˜ B ˜ .
Let ( U , τ U ) be a topological space, and let A be a subset of U. Then the subset A can be endowed with a topology τ A such that ( A , τ A ) is a topological subspace of ( U , τ U ) . In other words, the subset C of A is a τ A -closed subset of A if and only if C = A D for some τ U -closed subset D of U. In this case, we say that f : ( A , τ A ) R is upper semi-continuous on A if and only if { x A : f ( x ) λ } is a τ A -closed subset of A for all λ R . We also see that if f is upper semi-continuous on A then f is lower semi-continuous on A, and if f is lower semi-continuous on A then f is upper semi-continuous on A. We have the following observations.
  • Suppose that A ˜ is a fuzzy set in U such that its membership function ξ A ˜ is upper semi-continuous on U. Then ξ A ˜ is also upper semi-continuous on the proper domain A ˜ 0 . Indeed, the set
    x A ˜ 0 : ξ A ˜ ( x ) λ = A ˜ 0 x U : ξ A ˜ ( x ) λ
    is a τ A ˜ 0 -closed subset of A ˜ 0 .
  • Suppose that A ˜ is a fuzzy set in U such that its membership function ξ A ˜ is upper semi-continuous on the proper domain A ˜ 0 . Then it is clear to see that the dual membership function ξ A ˜ = 1 ξ A ˜ of A ˜ is lower semi-continuous on A ˜ 0 .
Theorem 4.
Let A ˜ and B ˜ be two fuzzy sets in R with the dual fuzzy sets A ˜ and B ˜ , respectively. Suppose that the dual arithmetic operations { , , } correspond to the operations { + , , * } . Then the following statements hold true.
(i)
We have α ( A ˜ B ˜ ) = for α I , .
(ii)
We have the inclusion
α ( A ˜ B ˜ ) α A ˜ α B ˜ = A ˜ 1 α B ˜ 1 α   f o r   a l l   α I , .
(iii)
Suppose that the membership functions of A ˜ and B ˜ are upper semi-continuous on A ˜ 0 and B ˜ 0 , respectively. Then
α ( A ˜ B ˜ ) = α A ˜ α B ˜ = A ˜ 1 α B ˜ 1 α   f o r   a l l   α I , .
Proof. 
To prove part (i), since I , = I A ˜ B ˜ by (23), Proposition 2 says that α ( A ˜ B ˜ ) = for α I A ˜ B ˜ = I , .
To prove part (ii), for α I , and z α α A ˜ α B ˜ , there exist x α α A ˜ and y α α B ˜ such that z α = x α y α for { + , , * } , where ξ A ˜ ( x α ) α and ξ B ˜ ( y α ) α . Therefore, we have
ξ A ˜ B ˜ ( z α ) = inf { ( x , y ) A ˜ 0 × B ˜ 0 : z α = x y } max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } max { ξ A ˜ ( x α ) , ξ B ˜ ( y α ) } α ,
which says that z α α ( A ˜ B ˜ ) . This shows that α A ˜ α B ˜ α ( A ˜ B ˜ ) for α I , .
To prove part (iii), in order to prove another direction of inclusion, we further assume that the membership functions ξ A ˜ and ξ B ˜ of A ˜ and B ˜ are upper semi-continuous on A ˜ 0 , which imply that the dual membership functions ξ A ˜ and ξ B ˜ are lower semi-continuous functions on A ˜ 0 ; that is, the nonempty lower α -level sets α A ˜ and α B ˜ are τ A ˜ 0 -closed subsets of A ˜ 0 for all α I , . Since α ( A ˜ B ˜ ) for α I A ˜ B ˜ = I , , given any z α α ( A ˜ B ˜ ) , we have
inf { ( x , y ) A ˜ 0 × B ˜ 0 : z α = x y } max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } = ξ A ˜ B ˜ ( z α ) α .
Since z α is finite, it is clear to see that
F { ( x , y ) A ˜ 0 × B ˜ 0 : z α = x y }
is a bounded subset of A ˜ 0 × B ˜ 0 . We also see that the function g ( x , y ) = x y is continuous on A ˜ 0 × B ˜ 0 . Since the singleton set { z α } is a closed subset of R , it follows that the inverse image F = g 1 ( { z α } ) of { z α } is also a closed subset of A ˜ 0 × B ˜ 0 . This says that F is a compact subset of A ˜ 0 × B ˜ 0 . Now we want to show that the function f ( x , y ) = max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } is lower semi-continuous on A ˜ 0 × B ˜ 0 , i.e., we want to show that
{ ( x , y ) A ˜ 0 × B ˜ 0 : f ( x , y ) α }
is a closed subset of A ˜ 0 × B ˜ 0 for any α R .
  • For α I , = I A ˜ B ˜ = I A ˜ I B ˜ with α 0 , i.e., α A ˜ and α B ˜ , we have
    { ( x , y ) A ˜ 0 × B ˜ 0 : f ( x , y ) α } = ( x , y ) A ˜ 0 × B ˜ 0 : ξ A ˜ ( x ) α   and   ξ B ˜ ( y ) α = ( x , y ) A ˜ 0 × B ˜ 0 : x α A ˜   and   y α B ˜ = α A ˜ × α B ˜
    that is a closed subset of A ˜ 0 × B ˜ 0 , since α A ˜ and α B ˜ are closed subsets of A ˜ 0 and B ˜ 0 , respectively.
  • If α < 0 , then { ( x , y ) : f ( x , y ) α } = is a closed subset of A ˜ 0 × B ˜ 0 .
  • If α I , with α 0 then α A ˜ = or α B ˜ = . Suppose that α A ˜ = . Then ξ A ˜ ( x ) > α for all x A ˜ 0 . Similarly, if α B ˜ = , then ξ B ˜ ( y ) > α for all y B ˜ 0 . Therefore we conclude that f ( x , y ) > α for all ( x , y ) A ˜ 0 × B ˜ 0 ,which implies
    ( x , y ) A ˜ 0 × B ˜ 0 : f ( x , y ) α =
    that is also a closed subset of A ˜ 0 × B ˜ 0 .
Therefore the function f ( x , y ) is indeed lower semi-continuous on A ˜ 0 × B ˜ 0 . By Lemma 2, the function f assumes minimum on the compact subset F of A ˜ 0 × B ˜ 0 ; that is, from (24), we have
min ( x , y ) F f ( x , y ) = min { ( x , y ) A ˜ 0 × B ˜ 0 : z α = x y } f ( x , y ) = inf { ( x , y ) A ˜ 0 × B ˜ 0 : z α = x y } f ( x , y ) α .
In other words, there exists ( x α , y α ) F such that z α = x α y α and
max { ξ A ˜ ( x α ) , ξ B ˜ ( y α ) } = f ( x α , y α ) = min ( x , y ) F f ( x , y ) α ,
i.e., ξ A ˜ ( x α ) α and ξ B ˜ ( y α ) α . Therefore, we obtain x α α A ˜ and y α α B ˜ , which says that z α α A ˜ α B ˜ , i.e., α ( A ˜ B ˜ ) α A ˜ α B ˜ for all α I A ˜ B ˜ = I , . This completes the proof. □
The related results regarding the mixed lower and upper α -level sets are presented below. Recall that the 0-level set ( A ˜ B ˜ ) 0 is the proper domain of the membership function ξ A ˜ B ˜ of A ˜ B ˜ .
Theorem 5.
Let A ˜ and B ˜ be two fuzzy sets in R . Consider that the arithmetic operations { , , } correspond to the operations { + , , * } . Suppose that the membership functions of A ˜ and B ˜ are upper semi-continuous. Then we have the following results.
  • If α min sup R ( ξ A ˜ ) , sup R ( ξ B ˜ ) , then α ( A ˜ B ˜ ) = ( A ˜ B ˜ ) 0 that is the proper domain of the membership function ξ A ˜ B ˜ of A ˜ B ˜ .
  • If 0 α < inf R ( ξ A ˜ B ˜ ) , then α ( A ˜ B ˜ ) = .
  • If inf R ( ξ A ˜ B ˜ ) < α < min sup R ( ξ A ˜ ) , sup R ( ξ B ˜ ) , then
    α ( A ˜ B ˜ ) = ( A ˜ B ˜ ) 0 { β I * , : β > α } ( A ˜ β B ˜ β ) = { β I * , : β > α } ( A ˜ B ˜ ) 0 \ ( A ˜ β B ˜ β ) .
  • Let α = inf R ( ξ A ˜ B ˜ ) . If the minimum min R ( ξ A ˜ B ˜ ) does not exist, then α ( A ˜ B ˜ ) = . If the minimum min R ( ξ A ˜ B ˜ ) exist, then α ( A ˜ B ˜ ) and can be obtained from (25).
We further assume that the supports A ˜ 0 + and B ˜ 0 + are bounded. Then the above 0-level set ( A ˜ B ˜ ) 0 can be replaced by A ˜ 0 B ˜ 0 .
Proof. 
From the first observation of Remark 3, we see that α ( A ˜ B ˜ ) = for 0 α < inf R ( ξ A ˜ B ˜ ) . Also, from (16), if
α α A ˜ B ˜ * sup R ( ξ A ˜ B ˜ ) = min sup R ( ξ A ˜ ) , sup R ( ξ B ˜ )
then α ( A ˜ B ˜ ) = ( A ˜ B ˜ ) 0 . For inf R ( ξ A ˜ B ˜ ) < α < α A ˜ B ˜ * , we have
α ( A ˜ B ˜ ) = ( A ˜ B ˜ ) 0 ( A ˜ B ˜ ) α +   ( using   the   first   observation   of   Remark   3 ) = ( A ˜ B ˜ ) 0 α < β 1 ( A ˜ B ˜ ) β   ( using   part   ( iv )   of   Proposition   4 ) = ( A ˜ B ˜ ) 0 { β I * , : β > α } ( A ˜ β B ˜ β )   ( using   parts   ( i )   and   ( iii )   of   Theorem   3 ) .
Finally, using part (iv) of Theorem 3, the 0-level set ( A ˜ B ˜ ) 0 can be replaced by A ˜ 0 B ˜ 0 . This completes the proof. □
Theorem 6.
Let A ˜ and B ˜ be two fuzzy sets in R with the dual fuzzy set A ˜ and B ˜ , respectively. Consider the dual arithmetic operations { , , } correspond to the operations { + , , * } . Suppose that the membership functions of A ˜ and B ˜ are upper semi-continuous on A ˜ 0 and B ˜ 0 , respectively. Then we have the following results.
  • If 0 α α A ˜ B ˜ max { 1 sup R ( ξ A ˜ ) , 1 sup R ( ξ B ˜ ) } , then ( A ˜ B ˜ ) α = ( A ˜ B ˜ ) α A ˜ B ˜ .
  • If α > sup R ( ξ A ˜ B ˜ ) , then ( A ˜ B ˜ ) α = .
  • If max { 1 sup R ( ξ A ˜ ) , 1 sup R ( ξ B ˜ ) } < α < sup R ( ξ A ˜ B ˜ ) , then
    ( A ˜ B ˜ ) α = ( A ˜ B ˜ ) 0 { β I , : 0 β < α } ( β A ˜ β B ˜ ) = { β I , : 0 β < α } ( A ˜ B ˜ ) 0 \ ( β A ˜ β B ˜ ) .
  • Let α = sup R ( ξ A ˜ B ˜ ) . If the maximum max R ( ξ A ˜ B ˜ ) does not exist, then ( A ˜ B ˜ ) α = . If the maximum max R ( ξ A ˜ B ˜ ) exist, then ( A ˜ B ˜ ) α and can be obtained from (26).
Proof. 
From Remark 1, we see that ( A ˜ B ˜ ) α = for α > sup R ( ξ A ˜ B ˜ ) . Also, from (17), if
0 α α A ˜ B ˜ inf R ( ξ A ˜ B ˜ ) = max 1 sup R ( ξ A ˜ ) , 1 sup R ( ξ B ˜ )
then ( A ˜ B ˜ ) α = ( A ˜ B ˜ ) α A ˜ B ˜ . For α A ˜ B ˜ < α < sup R ( ξ A ˜ B ˜ ) , we have
( A ˜ B ˜ ) α = ( A ˜ B ˜ ) 0 α ( A ˜ B ˜ )   ( using   Remark   3 ) = ( A ˜ B ˜ ) 0 0 β < α β ( A ˜ B ˜ )   ( using   part   ( iv )   of   Proposition   3 ) = ( A ˜ B ˜ ) 0 { β I , : 0 β < α } ( β A ˜ β B ˜ )   ( using   parts   ( i )   and   ( iii )   of   Theorem   4 ) .
This completes the proof. □
Example 3.
Let a ˜ and b ˜ be two fuzzy numbers. Then we have
sup R ( ξ a ˜ ) = sup R ( ξ b ˜ ) = 1   a n d   I * , = [ 0 , 1 ] .
Using Theorem 3, for α [ 0 , 1 ] , the upper α-level set of a ˜ b ˜ is given by
( a ˜ b ˜ ) α = a ˜ α b ˜ α = a ˜ α L , a ˜ α U b ˜ α L , b ˜ α U .
Now we consider the lower α-level set of a ˜ b ˜ . From Theorem 5, the lower 1-level set of a ˜ b ˜ is given by
1 ( a ˜ b ˜ ) = a ˜ 0 b ˜ 0 = a ˜ 0 L , a ˜ 0 U b ˜ 0 L , b ˜ 0 U .
For inf R ( ξ a ˜ b ˜ ) < α < 1 , we have
α ( a ˜ b ˜ ) = a ˜ 0 b ˜ 0 α < β 1 ( a ˜ β b ˜ β ) = a ˜ 0 b ˜ 0 α < β 1 a ˜ β L , a ˜ β U b ˜ β L , b ˜ β U .
Suppose that we take = + and = . Then we have
1 ( a ˜ b ˜ ) = a ˜ 0 + b ˜ 0 = a ˜ 0 L , a ˜ 0 U + b ˜ 0 L , b ˜ 0 U = a ˜ 0 L + b ˜ 0 L , a ˜ 0 U + b ˜ 0 U .
For inf R ( ξ a ˜ b ˜ ) < α < 1 , we have
α ( a ˜ b ˜ ) = a ˜ 0 L + b ˜ 0 L , a ˜ 0 U + b ˜ 0 U α < β 1 a ˜ β L + b ˜ β L , a ˜ β U + b ˜ β U .
In order to obtain a more simplified form of α ( a ˜ b ˜ ) , we further assume that the end-points a ˜ α L , a ˜ α U , b ˜ α L and b ˜ α U are continuous on [ 0 , 1 ] with respect to α. Therefore the endpoints a ˜ β L + b ˜ β L and a ˜ β U + b ˜ β U are continuous functions on [ 0 , 1 ] with respect to β, it follows that
α < β 1 a ˜ β L + b ˜ β L , a ˜ β U + b ˜ β U = a ˜ α L + b ˜ α L , a ˜ α U + b ˜ α U
is an open interval. Therefore, for inf R ( ξ a ˜ b ˜ ) < α < 1 , we obtain
α ( a ˜ b ˜ ) = a ˜ 0 L + b ˜ 0 L , a ˜ α L + b ˜ α L a ˜ α U + b ˜ α U , a ˜ 0 U + b ˜ 0 U .
Example 4.
Let a ˜ and b ˜ be two fuzzy numbers with dual fuzzy set a ˜ and b ˜ in R , respectively. According to Example 2 and (23), for I , = I a ˜ I b ˜ , the lower α-level sets of a ˜ and b ˜ are nonempty and given by
α a ˜ = α a ˜ L , α a ˜ U = a ˜ 1 α L , a ˜ 1 α U   a n d   α b ˜ = α b ˜ L , α a ˜ U = b ˜ 1 α L , b ˜ 1 α U .
Using part (iii) of Theorem 4, the lower α-level set of the dual arithmetic a ˜ b ˜ is given by
α ( a ˜ b ˜ ) = α a ˜ α b ˜ = α a ˜ L , α a ˜ U α b ˜ L , α b ˜ U = a ˜ 1 α L , a ˜ 1 α U b ˜ 1 α L , b ˜ 1 α U .
Using Theorem 6, for 0 < α < sup R ( ξ a ˜ b ˜ ) , we have
( a ˜ b ˜ ) α = ( a ˜ b ˜ ) 0 0 β < α ( β a ˜ β b ˜ ) = ( a ˜ b ˜ ) 0 0 β < α β a ˜ L , β a ˜ U β b ˜ L , β b ˜ U = ( a ˜ b ˜ ) 0 0 β < α a ˜ 1 β L , a ˜ 1 β U b ˜ 1 β L , b ˜ 1 β U
For 0 < α < sup R ( ξ a ˜ b ˜ ) , we can similarly show that
0 β < α β a ˜ L + β b ˜ L , β a ˜ U + β b ˜ U = α a ˜ L + α b ˜ L , α a ˜ U + α b ˜ U = a ˜ 1 α L + b ˜ 1 α L , a ˜ 1 α U + b ˜ 1 α U
is an open interval. Therefore, for 0 < α < sup R ( ξ a ˜ b ˜ ) , we obtain
( a ˜ b ˜ ) α = ( a ˜ b ˜ ) 0 α a ˜ L + α b ˜ L , α a ˜ U + α b ˜ U = ( a ˜ b ˜ ) 0 a ˜ 1 α L + b ˜ 1 α L , a ˜ 1 α U + b ˜ 1 α U .

6. Conclusions

Let A ˜ be a fuzzy subset of a universal set U with membership function denoted by ξ A ˜ . The conventional α -level set is called the upper α -level set in this paper. Therefore, we define the so-called lower α -level set that is based on the 0-level set A ˜ 0 rather than on the whole universal set U. The well-known (primal) decomposition theorem given below
ξ A ˜ ( x ) = sup α [ 0 , 1 ] α · χ A ˜ α ( x ) = sup α ( 0 , 1 ] α · χ A ˜ α ( x )
is based on the normality of A ˜ . If A ˜ is not normal, then we have
ξ A ˜ ( x ) = sup α R ( ξ A ˜ ) α · χ A ˜ α ( x ) .
The (primal) decomposition theorem says that the membership function can be expressed in terms of upper α -level sets. In this paper, we establish the so-called dual decomposition theorem by showing that the membership function can be expressed in terms of lower α -level sets as shown below
ξ A ˜ ( x ) = sup α [ 0 , 1 ] α · χ α A ˜ ( x ) = max α [ 0 , 1 ] α · χ α A ˜ ( x ) = max α [ 0 , 1 ] α · 1 χ α A ˜ ( x ) = sup α Q ( 0 , 1 ] α · χ α A ˜ ( x ) = max α Q ( 0 , 1 ] α · χ α A ˜ ( x ) = max α Q ( 0 , 1 ] α · 1 χ α A ˜ ( x )
by referring to Theorem 2.
On the other hand, the conventional arithmetic operation between fuzzy sets A ˜ and B ˜ in R is defined by
ξ A ˜ B ˜ ( z ) = sup { ( x , y ) U × U : z = x y } min { ξ A ˜ ( x ) , ξ B ˜ ( y ) }
for all z R . Using the dual membership functions, the dual arithmetic operation is defined by
ξ A ˜ B ˜ ( z ) = inf { ( x , y ) A ˜ 0 × B ˜ 0 : z = x y } max { ξ A ˜ ( x ) , ξ B ˜ ( y ) } .
Then the following interesting duality relation is established
ξ A ˜ B ˜ ( z ) + ξ A ˜ B ˜ ( z ) = 1 f o r a l l z U .
The advantage of considering dual arithmetic is, when A ˜ B ˜ is easier to calculate than that of A ˜ B ˜ , we can just first calculate A ˜ B ˜ and then to recover the arithmetic by using the duality relation.
In future study, we shall apply the dual decomposition theorem and dual arithmetic of fuzzy numbers to investigate the fuzzy real analysis. We also expect to use the results obtained in this paper to study the fuzzy problems arisen from the topic of operations research, which are always used to model the engineering problems.

Funding

This research received no external funding.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Hong, D.H.; Do, H.Y. Additive Decomposition of Fuzzy Quantities. Inf. Sci. 1996, 88, 201–207. [Google Scholar] [CrossRef]
  2. Vrba, J. A Note on Inverses in Arithmetic with Fuzzy Numbers. Fuzzy Sets Syst. 1992, 50, 267–278. [Google Scholar] [CrossRef]
  3. Wu, H.-C. Near Fixed Point Theorems in the Space of Fuzzy Numbers. Mathematics 2018, 6, 108. [Google Scholar] [CrossRef]
  4. Wu, H.-C. Compatibility between Fuzzy Set Operations and Level Set Operations: Applications to Fuzzy Difference. Fuzzy Sets Syst. 2018, 353, 1–43. [Google Scholar] [CrossRef]
  5. Anzilli, L.; Facchinetti, G. New Definitions of Mean Value and Variance of Fuzzy Numbers: An Application to the Pricing of Life Insurance Policies and Real Options. Int. J. Approx. Reason. 2017, 91, 96–113. [Google Scholar] [CrossRef]
  6. Bodjanova, S. Median value and median interval of a fuzzy number. Inf. Sci. 2005, 172, 73–89. [Google Scholar] [CrossRef]
  7. Dubois, D.; Prade, H. The mean value of a fuzzy number. Fuzzy Sets Syst. 1987, 24, 179–300. [Google Scholar] [CrossRef]
  8. Wang, G.; Shi, P.; Xie, Y.; Shi, Y. Two-Dimensional Discrete Fuzzy Numbers and Applications. Inf. Sci. 2016, 32, 258–269. [Google Scholar] [CrossRef]
  9. Mitchell, H.B.; Schaefer, P.A. On Ordering Fuzzy Numbers. Int. J. Intell. Syst. 2000, 15, 981–993. [Google Scholar] [CrossRef]
  10. Yager, R.R.; Filev, D. On Ranking Fuzzy Numbers Using Valuation. Int. J. Intell. Syst. 1999, 14, 1249–1268. [Google Scholar] [CrossRef]
  11. Deschrijver, G. Arithmetic Operators in Interval-Valued Fuzzy Set Theory. Inf. Sci. 2007, 177, 2906–2924. [Google Scholar] [CrossRef]
  12. Deschrijver, G. Generalized Arithmetic Operators and Their Relationship to t-Norms in Interval-Valued Fuzzy Set Theory. Fuzzy Sets Syst. 2009, 160, 3080–3102. [Google Scholar] [CrossRef]
  13. Ban, A.I.; Coroianu, L. Existence, Uniqueness, Calculus and Properties of Triangular Approximations of Fuzzy Numbers under a General Condition. Int. J. Approx. Reason. 2015, 62, 1–26. [Google Scholar] [CrossRef]
  14. Guerra, M.L.; Stefanini, L. Approximate Fuzzy Arithmetic Operations Using Monotonic Interpolations. Fuzzy Sets Syst. 2005, 150, 5–33. [Google Scholar] [CrossRef]
  15. Holčapek, M.; Štěpnička, M. MI-algebras: A New Frame Work for Arithmetics of (Extensional) Fuzzy Numbers. Fuzzy Sets Syst. 2014, 257, 102–131. [Google Scholar] [CrossRef]
  16. Stupňanová, A. A Probabilistic Approach to the Arithmetics of Fuzzy Numbers. Fuzzy Sets Syst. 2015, 264, 64–75. [Google Scholar] [CrossRef]
  17. Wu, H.-C. Decomposition and Construction of Fuzzy Sets and Their Applications to the Arithmetic Operations on Fuzzy Quantities. Fuzzy Sets Syst. 2013, 233, 1–25. [Google Scholar] [CrossRef]
  18. Royden, H.L. Real Analysis, 2nd ed.; Macmillan: London, UK, 1968. [Google Scholar]

Share and Cite

MDPI and ACS Style

Wu, H.-C. Duality in Fuzzy Sets and Dual Arithmetics of Fuzzy Sets. Mathematics 2019, 7, 11. https://doi.org/10.3390/math7010011

AMA Style

Wu H-C. Duality in Fuzzy Sets and Dual Arithmetics of Fuzzy Sets. Mathematics. 2019; 7(1):11. https://doi.org/10.3390/math7010011

Chicago/Turabian Style

Wu, Hsien-Chung. 2019. "Duality in Fuzzy Sets and Dual Arithmetics of Fuzzy Sets" Mathematics 7, no. 1: 11. https://doi.org/10.3390/math7010011

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop