Answering An Open Problem on $T$-Norms for Type-2 Fuzzy Sets
Xinxing Wu, Guanrong Chen

TL;DR
This paper proves that certain convolution-based operations on functions over [0,1] are t-norms or t-conorms, resolving an open problem and characterizing their properties in the context of Type-2 fuzzy sets.
Contribution
It establishes that specific convolution operations are t-norms or t-conorms, answering a previously open question and providing new insights into their characteristics.
Findings
Confirmed convolution operations are t-norms or t-conorms.
Provided characterizations of t-norm and t-conorm via convolution operations.
Resolved an open problem from prior research.
Abstract
This paper proves that a binary operation on , ensuring that the binary operation is a -norm or is a -conorm, is a -norm, where and are special convolution operations defined by for any , where and are a continuous -norm and a continuous -conorm on , answering negatively an open problem posed in \cite{HCT2015}. Besides, some characteristics of -norm and -conorm are obtained in terms of the binary operations and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFuzzy Logic and Control Systems · Multi-Criteria Decision Making · Rough Sets and Fuzzy Logic
Answering an Open Problem on -Norms for Type-2 Fuzzy Sets
Xinxing Wu
School of Sciences, Southwest Petroleum University, Chengdu, Sichuan 610500, China
and
Guanrong Chen
Department of Electrical Engineering, City University of Hong Kong, Hong Kong SAR, China
Abstract.
This paper proves that a binary operation on , ensuring that the binary operation is a -norm or is a -conorm, is a -norm, where and are special convolution operations defined by
[TABLE]
[TABLE]
for any , where and are a continuous -norm and a continuous -conorm on , answering negatively an open problem posed in [17]. Besides, some characteristics of -norm and -conorm are obtained in terms of the binary operations and .
Key words and phrases:
Normal and convex function, -norm, -conorm, -norm, -conorm, type-2 fuzzy set.
This work was supported by the National Natural Science Foundation of China (No. 11601449), the Science and Technology Innovation Team of Education Department of Sichuan for Dynamical Systems and its Applications (No. 18TD0013), and the Youth Science and Technology Innovation Team of Southwest Petroleum University for Nonlinear Systems (No. 2017CXTD02).
1. Introduction
In 1975, Zadeh [1] introduced the notion of type-2 fuzzy sets (T2FSs) – that is, fuzzy set with fuzzy sets as truth values (simply, “fuzzy-fuzzy sets”) – being an extension of type-1 fuzzy sets (FSs) and interval-valued fuzzy sets (IVFSs), which was also equivalently expressed in different forms by Mendel et al. ([2]–[5]). Because the truth values of T2FSs are fuzzy, they are more adaptable to a further study of uncertainty than FSs and have been applied in many studies ([6]–[25]). Mendel [6] summarized some important advances for FSs and T2FSs from 2001 to 2007. Hu and Kwong [7] discussed -norm operations of T2FSs and obtained a few properties of type-2 fuzzy numbers. For better understanding of T2FSs, Aisbett et al. [8] translates their constructs to the language of functions in spaces. Chen and Wang [9] used T2FSs to give a new technique for fuzzy multiple attributes decision making. Sola et al. [10] provided a more general perspective for interval T2FSs and showed that IVFSs can be viewed as a special case of interval T2FSs. Ruiz et al. [11] obtained two results for join and meet operations for T2FSs with arbitrary secondary memberships. Recently, Wang [12] introduced the notion of conditional fuzzy sets to characterize T2FSs. Then, Wu et al. [13] presented a Jaccard similarity measure for general T2FSs, as an extension of the Jaccard similarity measure for FSs and IVFSs.
Being an extension of the logic connective conjunction and disjunctionin classical two-valued logic, triangular norms (-norms) with the neutral and triangular conorms (-conorms) with the neutral [math] on the unit interval were introduced by Menger [14] in 1942 and by Schweizer and Sklar [15] in 1961, respectively. Because -norms and -conorms have a close connection with fuzzy set theory and order related theories, they play an important role in many fields, such as fuzzy set theory [26], fuzzy logic [16], fuzzy systems modeling [27], and probabilistic metric spaces [15]. Walker and Walker [28] extended -norms and -conorms to the algebra of truth values of T2FSs. Then, Hernándes et al. [17] introduced the notions of -norm and -conorm by adding some “restrictive axioms” (see Definition 2 below) with systematic analysis. In particular, they [17] proved that the following binary operation (resp., ) on the set of all normal and convex functions constructed by convolution is a -norm (resp., a -conorm). Recently, we proved [29] that the fuzzy metric of every stationary fuzzy metric space is uniformly continuous.
Throughout this paper, let , be the set of all mappings from to , and ‘’ denote the usual order relation in the lattice of real numbers. In particular, let and be the set of all normal and convex functions in .
Definition 1**.**
[24] A -norm on is a binary operation satisfying
- (T1)
(commutativity/symmetry) for ; 2. (T2)
(associativity) for ; 3. (T3)
(increasing) is increasing in each argument; 4. (T4)
(neutral element) for .
A binary operation is a -conorm on if it satisfies axioms (T1), (T2), and (T3) above; axiom (T4’): for .
For any subset of , a special fuzzy set , which is called the characteristic function of , is defined as
[TABLE]
Definition 2**.**
[17] A binary operation is a -norm (-norm according to the restrictive axioms), if
- (O1)
is commutative, i.e., for ; 2. (O2)
is associative, i.e., for ; 3. (O3)
for (neutral element); 4. (O4)
letting such that ; then, (increasing in each argument); 5. (O5)
; 6. (O6)
is closed on ; 7. (O7)
is closed on ;
where is the set of all characteristic functions of the elements of , and is the set of all characteristic functions of the closed subintervals of , i.e., , .
A binary operation is a -conorm if it satisfies axioms (O1), (O2), (O4), (O6), and (O7) above; axiom (O3’): ; and axiom (O5’): . Axioms (O1), (O2), (O3), (O3’), and (O4) are called “basic axioms”, and an operation that complies with these axioms will be referred to as -norm or -conorm, respectively.
Convolution as a standard way to combine functions was used to construct operations on . Let and be two binary operations defined on and , respectively, and be an appropriate operation on . Define a binary operation on the set by
[TABLE]
This method of defining an operation on from operations on and is called convolution.
Definition 3**.**
[17] Let be a binary operation on , be a -norm on , and be a -conorm on . Define the binary operations and as follows: for ,
[TABLE]
and
[TABLE]
In 2015, Hernándes et al. [17] proposed the following open problem on the binary operations and .
Question 4**.**
[17] Apart from the -norms, does there exist other binary operation ‘’ on such that ‘’ and ‘’ are, respectively, a -norm and a -conorm on ?
This paper first gives a negative answer to Question 4, proving that, if a binary operation ensures that is a -norm on or is a -conorm on , then is a -norm, i.e., satisfies axioms (T1)–(T4). Then, it is proved that the following are equivalent:
- (1)
is a -norm on ; 2. (2)
is a -norm on ; 3. (3)
is a -norm on ; 4. (4)
is a -conorm on ; 5. (5)
is a -conorm on .
Finally, analogous results on are presented when the binary operation is restricted to be a continuous -norm.
2. Preliminaries
A type-1 fuzzy set in space is a mapping from to , i.e., , and is called the degree of membership of an element to the set . The two sets and are special elements in , with and , respectively. A fuzzy set is normal if .
Definition 5**.**
[17] A function is convex if, for any , it holds that .
Definition 6**.**
[30] A type-2 fuzzy set in space is a mapping
[TABLE]
i.e., . For any , is also called the degree of membership of an element to the set .
Definition 7**.**
[30] The operations of (union), (intersection), (complementation) on are defined as follows: for any ,
[TABLE]
[TABLE]
and
[TABLE]
From [30], it follows that does not have a lattice structure, although and satisfy the De Morgan’s laws with respect to the given operation .
Walker and Walker [30] introduced the following partial order on .
Definition 8**.**
[30] if ; if .
It follows from [30, Proposition 14] that both and are partial orders on . In [22, 23, 30], it was proved that the subalgebra is a bounded complete lattice. In particular, and are the minimum and maximum, respectively.
For , define and in by
[TABLE]
and
[TABLE]
Clearly, and are monotonically increasing and decreasing, respectively. The following properties of and are obtained by Walker et al. ([22, 23, 30]).
Proposition 9**.**
[30] For ,
- (1)
if and only if ; 2. (2)
if and only if ; 3. (3)
, ; 4. (4)
, ; 5. (5)
;
Theorem 10**.**
([22, 23]) Let . Then, if and only if and .
Lemma 11**.**
For , and .
Proof.
From the definitions of and , this holds trivially. ∎
3. Answer to the Open Problem
3.1. Commutativity and Associativity of
Lemma 12**.**
Let be a -norm on . Then, if and only if .
Lemma 13**.**
Let be a continuous -norm on and be a binary operation on . Then,
[TABLE]
Proof.
Since is a -norm, from Lemma 12, it follows that
[TABLE]
∎
Proposition 14**.**
Let be a continuous -norm on and be a binary operation on . Then,
- (1)
and are commutative on if and only if is commutative; 2. (2)
If and are associative on , then is associative.
Proof.
(1) The sufficiency follows from the proof of [17, Proposition 1]. It remains to prove the necessity. Suppose on the contrary that is not commutative. Then, there exist such that . Choose two functions as
[TABLE]
and
[TABLE]
for . It can be verified that , as and are decreasing. Since is commutative, applying Lemma 13 yields that
[TABLE]
which is a contradiction. Therefore, is commutative.
(2) Suppose on the contrary that is not associative. Then, there exist such that . Choose three functions as
[TABLE]
[TABLE]
and
[TABLE]
for . It can be verified that , as , , and are decreasing. Since is associative, applying Lemma 13 yields that
[TABLE]
which is a contradiction. Therefore, is associative. ∎
Remark 15*.*
Similar results to Proposition 14 are obtained by Hernández et al. [17] under the assumption that and are commutative or associative on , which is stronger than the condition in Proposition 14.
3.2. Neutral Element for
For any fixed , define by
[TABLE]
for . It can be verified that , as is increasing for .
Lemma 16**.**
Let be a continuous -norm on and be a binary operation on . If is a -norm on , then for all .
Proof.
(1) As is a neural element, by Lemma 13, one has
[TABLE]
(2) Fix any . From , it follows that, for any ,
[TABLE]
Since \vartriangle$$(x,-) is continuous on , and \vartriangle$$(x,0)=0, \vartriangle$$(x,1)=x, it follows from the intermediate value theorem that there exists some such that \vartriangle$$(x,z_{1})=x$$\vartriangle$$z_{1}=t. This, together with (3.1), implies that
[TABLE]
(3) Note that . Similarly to the proof of (2), it follows that there exists such that . This implies that
[TABLE]
Summing up (1)–(3) and the commutativity of (Proposition 14), it follows that, for any ,
[TABLE]
∎
Lemma 17**.**
Let be a continuous -norm on and be a binary operation on . If is a -norm on , then for all .
Proof.
(1) Since is a neural element, from Lemma 13, it follows that
[TABLE]
(2) For any fixed , . For with , consider the following two cases:
Case 1. If , then . This implies that ;
Case 2. If , then . Applying Lemma 16 gives that
[TABLE]
Thus,
[TABLE]
The proof is completed by applying and the commutativity of . ∎
3.3. Increasing in Each Argument for
For any fixed , define by
[TABLE]
It can be verified that , as is decreasing for . Clearly, functions , , and constructed in Proposition 14 satisfy that , , and .
Applying the decreasing property of immediately yields the following result.
Lemma 18**.**
For any , and .
Lemma 19**.**
For any with , .
Proof.
Clearly, . Applying Lemma 18 yields that
[TABLE]
and
[TABLE]
This, together with Theorem 10, implies that
[TABLE]
∎
Lemma 20**.**
Let be a continuous -norm on and be a binary operation on . If is a -norm on , then for any the functions and are increasing, where and for .
Proof.
It follows from Proposition 14 that . So, it suffices to prove that is increasing.
For any , since is increasing in each argument, from Lemma 19, it follows that
[TABLE]
In particular, by Theorem 10,
[TABLE]
This, together with Lemmas 11 and 13, implies that
[TABLE]
i.e.,
[TABLE]
Therefore, is increasing. ∎
3.4. Answer to Question 4
Theorem 21**.**
Let be a continuous -norm on and be a binary operation on . If is a -norm on , then is a -norm.
Proof.
It follows directly from Proposition 14, and Lemmas 17 and 20. ∎
Similarly, the following result can be verified.
Theorem 22**.**
Let be a continuous -conorm on and be a binary operation on . If is a -conorm on , then is a -norm.
Remark 23*.*
Theorems 21 and 22 show that a binary operation on , ensuring that is a -norm (thus a -norm) on or is a -conorm (thus a -conorm) on , must be a -norm. This give a negative answer to Question 4.
Combining together Theorems 21, 22, and [17, Proposition 14], one obtains the following.
Theorem 24**.**
Let be a continuous -norm, be a continuous -conorm, and be a continuous binary operation on . Then, the following statements are equivalent:
- (1)
* is a -norm on ;* 2. (2)
* is a -norm on ;* 3. (3)
* is a -norm on ;* 4. (4)
* is a -conorm on ;* 5. (5)
* is a -conorm on .*
4. Further Study on the Binary Operation
Let be a continuous -norm on and be a surjective binary operation on . Define the binary operation as follows: for ,
[TABLE]
Here, the surjection assumption on is necessary, because is not well defined for every point in , if is not surjective. Motivated by Question 4, a fundamental question is: Apart from the -norms, does there exist other binary operation ‘’ on such that ‘’ is a -norm on ?
This section will also give a negative answer to this question.
Lemma 25**.**
For , if and only if .
Proof.
Firstly, it can be verified that, for any ,
[TABLE]
and
[TABLE]
This, together with Theorem 10, implies that
[TABLE]
∎
Lemma 26**.**
Let be a continuous -norm on and be a binary operation on . Then, for any , .
Proof.
Since is a continuous -norm, applying Lemma 12 gives
- (a)
for , ; 2. (b)
if and only if and .
This, together with , implies that
[TABLE]
∎
Lemma 27**.**
Let be a continuous -norm on and be a binary operation on . Then,
- (1)
* is commutative on if and only if is commutative;* 2. (2)
If is associative on , then is associative.
Proof.
(1) The sufficiency holds trivially. It remains to check the necessity.
For , since is commutative, it follows from Lemma 26 that
[TABLE]
implying that
[TABLE]
Thus, is commutative.
(2) For , since is associative, it follows from Lemma 26 that
[TABLE]
implying that
[TABLE]
Thus, is associative. ∎
Lemma 28**.**
Let be a continuous -norm on and be a binary operation on . If is a -norm on , then for all .
Proof.
For any , since is an neutral element, applying Lemma 26 yields that
[TABLE]
Thus, . ∎
Lemma 29**.**
Let be a continuous -norm on and be a binary operation on . If is a -norm on , then, for any , the functions and is increasing, where and for any .
Proof.
It follows from Lemma 27 that . So, it suffices to prove that is increasing.
For , applying Lemma 25 follows that
[TABLE]
Since is increasing in each argument, applying Lemma 26 yields that
[TABLE]
This, together with Lemma 25, implies that
[TABLE]
Therefore, is increasing. ∎
Combining together Lemmas 27–29 and [17, Proposition 14] immediately yields the following result.
Theorem 30**.**
Let be a continuous -norm on and be a continuous binary operation on . Then, the following statements are equivalent:
- (1)
* is a -norm on ;* 2. (2)
* is a -norm on ;* 3. (3)
* is a -norm on .*
Similarly, one can obtain the following result.
Theorem 31**.**
Let be a continuous -norm on and be a continuous binary operation on . Then, the following statements are equivalent:
- (1)
* is a -conorm on ;* 2. (2)
* is a -conorm on ;* 3. (3)
* is a -conorm on .*
5. Conclusion
This paper has further studied the binary operations and defined in (1.1), (1.2) and (4.1) on . By introducing two special families of functions and (), it first proves that, when the continuous -norm or continuous -conorm is fixed, the following hold:
- (1)
is a continuous -norm on if and only if is a continuous -norm on if and only if is a continuous -norm; 2. (2)
is a continuous -conorm on if and only if is a continuous -conorm on if and only if is a continuous -norm.
In particular, these results negatively answer Question 4. Similarly to Question 4, the case that the binary operation is fixed (see (4.1)) has been investigated and some analogous results were obtained.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Zadeh, “The concept of a linguistic variable and its application to approximate reasoning–I,” Inf. Sci. , vol. 8, pp. 199–249, 1975.
- 2[2] N. N. Karnik and J. M. Mendel, “Operations on type-2 fuzzy sets,” Fuzzy Sets Syst. , vol. 122, pp. 327–348, 2001.
- 3[3] N. N. Karnik and J. M. Mendel, “Centroid of a type-2 fuzzy set,” Inf. Sci. , vol. 132, pp. 195–220, 2001.
- 4[4] J. M. Mendel, “Uncertain Rule-Based Fuzzy Logic Systems: Introduction and New Directions,” Prentice-Hall, Upper Saddle River, NJ, 2001.
- 5[5] J. M. Mendel and R.I. John, “Type-2 fuzzy sets made simple,” IEEE Trans. Fuzzy Syst. , vol. 10, 117–127 (2002).
- 6[6] J. M. Mendel, “Advances in type-2 fuzzy sets and systems,” Inf. Sci. , vol. 177,84–110, 2007.
- 7[7] B. Hu and C. Kwong, “On type-2 fuzzy sets and their t-norm operations,” Inf. Sci. , vol. 255, pp. 58–81, 2013.
- 8[8] J. Aisbett, J. T. Rickard, and D. G. Morgenthaler, “Type-2 fuzzy sets as functions on spaces,” IEEE Trans. Fuzzy Syst. , vol. 18, pp. 841–844, 2010.
