In this paper, we introduce the degree to which a mapping is an (L, M)-fuzzy convexity. When and are (L, M)-fuzzy convex spaces to some extent, the degrees to which a mapping f : X ⟶ Y is convexity-preserving or convex-to-convex are defined. Finally, the degree to which a surjective mapping f : X ⟶ Y is a quotient mapping is also defined. We not only give their characterizations but also discuss the relationships among them.
Introduction
The convex set, which is an ordinary notion inspired by the shape of some figures, such as circles and polyhedrons in 2 or 3-dimensional Euclidean spaces, has an old history and has been applied to various research areas. In the standard case, a set in an n-dimensional Euclidean space is convex if and only if it contains the whole segments joining any two of its points. By axiomatizing the properties of convex sets in Euclidean spaces, the concept of convexity (or abstract convexity) was introduced in [3, 30]. Under the axiomatic framework of M. van de Vel, the theory of convexity has been studied widespread from different perspectives, and has been found that it includes many mathematical structures (see the monograph of M. van de Vel [30]). There exist convexities in real vector spaces [28], convexities in lattices [29], convexities in posets [1], convexities in matroids [30], convexities in metric spaces and graphs [27].
With the development of fuzzy mathematics, many mathematical structures have been generalized to the fuzzy case, such as fuzzy topology [2], fuzzy convergence structures [12, 16] and so on. The notion of convexity has also been combined with fuzzy set theory. In 1994, M.V. Rosa presented the notion of fuzzy convexity in [20]. In 2009, Y. Maruyama generalized it to L-fuzzy setting in [10]. In a Rosa-Maruyama’s fuzzy convexity, convex sets are fuzzy, but the convexity comprising those convex sets is a crisp subset of IX or LX. Recently, F.G. Shi and Z.Y. Xiu [25] gave a new approach to fuzzification of convexity in a completely different direction and proposed the concept of M-fuzzifying convexity. Furthermore, F.G. Shi and Z.Y. Xiu introduced the concept of (L, M)-fuzzy convexity in [24]. Now the theory of fuzzy convex structures are generally investigated in the frameworks of L-convex structures [6, 18], M-fuzzifying convex structures [22, 32–36] and (L, M)-fuzzy convex structures [8, 24], respectively.
An (L, M)-fuzzy convexity is exactly a mapping from LX to M satisfying three axioms. Given a mapping , it is either an (L, M)-fuzzy convexity or not. Then a natural problem is as follows. For any mapping , is it an (L, M)-fuzzy convexity to some extent? Our aim is to solve this problem.
The main aim of this paper is to define the degree to which a mapping is an (L, M)-fuzzy convexity and the degree to which an L-subset is an L-convex set with respect to . Based on these concepts, we will introduce the degrees to which a mappings f : X ⟶ Y is a convexity-preserving, a convex-to-convex or a quotient mapping.
This paper is organized as follows. In Section 2, some necessary concepts of convexity and (L, M)-fuzzy convexity are recalled. In Section 3, the degree to which a mapping is an (L, M)-fuzzy convexity is introduced. Meanwhile, the degrees to which is an M-fuzzifying convexity, an (L, M)-fuzzy closure system or an M-fuzzifying closure system are also introduced. Besides, we propose the degree to which an L-subset is an L-convex set with respect to . In Section 4, when and are (L, M)-fuzzy convex spaces to some extent, the degrees to which a mappings f : X ⟶ Y is convexity-preserving or convex-to-convex are defined. Their characterizations and some properties are given. In Section 5, the degree to which a surjective mapping f : X ⟶ Y is a quotient mapping is also defined. We give not only their characterizations but also discuss the relationships between them.
Preliminaries
Throughout this paper, unless otherwise stated, (L, ∨, ∧) denotes a complete lattice and (M, ∨, ∧) denotes a completely distributive lattice. The smallest element and the largest element in M are denoted by ⊥M and ⊤M, respectively. X is a non-empty set. We denote the set of all subsets of X by 2X and denote the set of all L-subsets of X by LX. LX is also a complete lattice when it inherits the structure of the lattice L in a natural way, by defining ∧, ∨, ≤ pointwisely. The smallest element and the largest element in LX are denoted by ⊥LX and ⊤LX, respectively.
We can define a residual implication in the completely distributive lattice M by
Also, we denote a ↔ b = (a → b) ∧ (b → a). Some properties of the implication operation are listed in the following lemma.
Lemma 2.1. ([4]) Let (M, ∨, ∧) be a completely distributive lattice and → be the implication operation corresponding to ∧. Then for alla, b, c ∈ M, {ai} i∈I, {bi} i∈I ⊆ M, the following statements hold.
(1) ⊤M → a = a.
(2) (a → b) ≥ c ⇔ a ∧ c ≤ b.
(3) a → b = ⊤ M ⇔ a ≤ b.
(4) a → (⋀ i∈Ibi) = ⋀ i∈I (a → bi), hence a → b ≤ a → c whenever b ≤ c.
(5) (⋁ i∈Iai) → b = ⋀ i∈I (ai → b), hence a → c ≥ b → c whenever a ≤ b.
(6) (a → c) ∧ (c → b) ≤ a → b.
The binary relation≺op in M is defined as follows: for a, b ∈ M, a ≺ opb if and only if for every subset D ⊆ M, the relation inf D ≤b always implies the existence of d ∈ D with d ≤ a. Let α (b) = {a ∈ M | a ≺ opb}. We have b = ⋀ α (b) for each b ∈ M and α : M ⟶ 2M is an ⋀-⋃ and order-reversing mapping (see [21, 31]).
Let f : X ⟶ Y be a mapping. Define f→ : 2X ⟶ 2Y and f← : 2Y ⟶ 2X by f→ (A) = {f (x) | x ∈ A} for all A ∈ 2X and f← (B) = {x ∈ X | f (x) ∈ B} for all B ∈ 2Y. The forward L-power operator and the backward L-power operator induced by f are defined by for all A ∈ LX, y ∈ Y and for all B ∈ LY, respectively [19].
Definition 2.2. ([5, 30]) A subset of 2X is called a convexity (or convex structure), if it satisfies the following conditions:
(C1) ∅, ;
(C2) If is non-empty, then ;
(C3) If is non-empty and totally ordered by inclusion, then .
The pair is called a convex space (or convexity space [30]) and the members of are called convex sets. A mapping is called convexity-preserving if for each . A mapping is called convex-to-convex if for each .
In 1994, M.V. Rosa introduced the notion of fuzzy convexity in [20]. In 2009, Y. Maruyama generalized it to L-fuzzy setting in [10]. In 2014, F.G. Shi and Z.Y. Xiu gave the definition of M-fuzzifying convexity in [25]. Recently, F.G. Shi and Z.Y. Xiu [24] further extended it to an M-fuzzy subset of LX (called an (L, M)-fuzzy convexity) as follows.
Definition 2.3. ([24]) A mapping is called an (L, M)-fuzzy convexity (or (L, M)-fuzzy convex structure) if it satisfies the following conditions:
(LMC1);
(LMC2) If {Ai ∣ i ∈ I} ⊆ LX is non-empty, then ;
(LMC3) If {Aj ∣ j ∈ J} ⊆ LX is non-empty and totally ordered, then .
The pair is called an (L, M)-fuzzy convex space. For each A ∈ LX, can be regarded as the degree to which A is an L-convex set.
Denote {0, 1} =2 and [0, 1] = I. Then an (L, 2)-fuzzy convexity is an L-fuzzy convexity in [10], an (I, 2)-fuzzy convexity is a fuzzy convexity in [20], an (2, M)-fuzzy convexity is an M-fuzzifying convexity in [22, 25], an (2, 2)-fuzzy convexity is a convexity in [5, 30].
Remark 2.4. Denote a directed family {Aj} j∈J ⊆ LX by . We say {Aj} j∈J is directed, if for each Aj1, Aj2 ∈ {Aj} j∈J, there exists Aj3 ∈ {Aj} j∈J such that Aj1, Aj2 ⊆ Aj3. Besides, Shi and Xiu show that (LMC3) can be replaced by the following condition in [24]:
(LMC3*) If is non-empty, then .
Definition 2.5. ([24]) Let and be two (L, M)-fuzzy convex spaces. A mapping f : X ⟶ Y is called a convexity-preserving mapping if for all B ∈ LY. A mapping f : X ⟶ Y is called a convex-to-convex mapping if for all A ∈ LX.
We denote and . It is easy to show that is an (L, M)-fuzzy convexity on X if and only if ∀a ∈ M, is an L-convexity on X. Excepting this, we have the following theorem.
Theorem 2.6. ([24]) Letbe a mapping. Then the following statements are equivalent.
(1) is an (L, M)-fuzzy convexity onX.
(2) ∀a ∈ M ∖ {⊥ M}, is anL-convexity onX.
(3) ∀a ∈ α (⊥ M), is anL-convexity onX.
Finally, we recall the definitions of (L, M)-fuzzy closure system and M-fuzzifying closure system.
Definition 2.7. ([23]) A mapping is called an (L, M)-fuzzy closure system provided that it satisfies the following conditions:
(LMCS) ∀ {Ai ∣ i ∈ I} ⊆ LX, .
The pair is called an (L, M)-fuzzy closure system space.
(L, M)-fuzzy convexity degrees
An (L, M)-fuzzy convexity is exactly a mapping from LX to M satisfying three axioms. Given a mapping , it is either an (L, M)-fuzzy convexity or not. Then a natural problem is as follows. For any mapping , is it an (L, M)-fuzzy convexity to some extent? In this section, we shall consider this problem.
Now we introduce the notions of the degrees to which a mapping is an (L, M)-fuzzy convexity and the degrees to which an a mapping is an (L, M)-fuzzy closure system.
Definition 3.1. D(C) Let be a mapping. Then defined by
is called the degree to which is an (L, M)-fuzzy convexity (or the (L, M)-fuzzy convexity degree of ).
Remark 3.2. If , then ; ∀ {Ai} i∈I ⊆ LX, and , It is exactly the definition of (L, M)-fuzzy convexity. Moreover, is an (L, M)-fuzzy convexity if and only if . However, there exist examples to show .
Example 3.3. Let M = [0, 1] and be a mapping which satisfies for all A ∈ LX. By Definition 3.1, we have . This shows .
Definition 3.4. D(Q) Let be a mapping. Then defined by
is called the degree to which is an (L, M)-fuzzy closure system (or the (L, M)-fuzzy closure system degree of ).
The following theorem is obvious.
Theorem 3.5.Letbe a mapping. Then.
Remark 3.6. If L = 2 in Definition 3.1 and Definition 3.4, then (resp., ) is the M-fuzzifying convexity degree of (resp., the M-fuzzifying closure system degree of ).
From properties of the implication operation in Lemma 2.1, the following lemma is straightforward.
Lemma 3.7. D(C) Letbe a mapping. For anya ∈ M, if and only if, , for all {Ai} i∈I ⊆ LXandfor all.
Theorem 3.8.Letbe a mapping. Then
Proof. By Lemma 3.7, it is easy to be proved.□
The next two theorems give other characterizations about (L, M)-fuzzy convexity degrees by means of its two kinds of cut sets.
Theorem 3.9. D(C) Letbe a mapping. Then
Proof. Let RHS denote the right hand side of the above equality.
Suppose that , ⋀i∈I, ∀ {Ai} i∈I ⊆ LX, ⋀j∈J, . For any b ≤ a, , , we have , and , This shows , and . By Theorem 3.8, .
Conversely, assume that is an L-convexity. For any {Ai} i∈I ⊆ LX and . Let b = a. Then ⊥LX, , which means , . Let . Then b ≤ a and . Thus , i.e., . Let . Then b ≤ a and . Thus , i.e., . Combining this with Theorem 3.8, .□
Theorem 3.10. D(C) Letbe a mapping. Then
Let RHS denote the right hand side of the above equality.
Suppose that , , ∀ {Ai} i∈I ⊆ LX, , . For any b ∉ α (a), , , we have and . Since α is an ⋀-⋃ map and α is order-reversing, we have , and α (a)∪ . This implies and , which means and . Since and , we know and , which shows . By Theorem 3.8, .
Conversely, assume that is an L-convexity. For any ∀b ∉ α (a), , we have . This implies and . For any {Ai} i∈I ⊆ LX, suppose that . Since . it follows that b ∉ α (a) and , which means for any i ∈ I. Note that is an L-convexity. Then , i.e., . By the arbitrariness of b, we obtain . Similarly, we can prove for all Combining this with Theorem 3.8, . □
Analogously, we can obtain characterizations of (L, M)-fuzzy closure systems in the following theorem.
Theorem 3.11. D(Q) Letbe a mapping. Then
As we know, can also be treated as a mapping D : MLX ⟶ M defined by . Then we have the following theorem.
Theorem 3.12. D(C)is an (L, M)-fuzzy pretopology Letbe a family of mappings. Then.
Proof. By Lemma 2.1, we have
□
In what follows, we introduce the degree to which an L-subset is an L-convex set with respect to , which is a generalization of L-convex set degree in [24].
Definition 3.13. Con(A) Given a mapping and a fuzzy set A ∈ LX, we define by
Then the value is called the degree to which A is an L-convex set with respect to (or the L-convex set degree of A with respect to ).
Remark 3.14. If , which means is an (L, M)-fuzzy convexity, then , which can be regarded as a generalization of L-convex set degree in [24].
Theorem 3.15. L-convex set Given a mappingand a fuzzy setA ∈ LX. Then
(1) , ∀ {Ai ∣ i ∈ I} ⊆ LX.
(2) , ∀ {Aj ∣ j ∈ J} dir ⊆ LX.
If is viewed as a mapping defined by , then satisfies the conditions (LMC2) and (LMC3) inDefinition 2.3.
Proof. (1) By Definition 3.13, it suffices to show that and for any {Ai ∣ i ∈ I} ⊆ LX. By Definition 3.1 and Lemma 2.1, we have .
(2) can be proved similarly. □
Degrees of convexity-preserving and convex-to-convex mappings
In this section, when and are (L, M)-fuzzy convex spaces to some extent, the degrees to which a mappings f : X ⟶ Y is convexity-preserving or convex-to-convex with respect to and are defined. Their characterizations and some properties are given.
Definition 4.1. CP, CC Given two mappings and . Let f : X ⟶ Y be a mapping. Then
a) the convexity-preserving degree of f with respect to and is defined by
b) the convex-to-convex degree of f with respect to and is defined by
In the following, characterizations about the convexity-preserving degree, the convex-to-convex degree of f with respect to and will be presented.
Theorem 4.2. characterizationsof convexity-preserving degree Given two mappingsand. Letanddenote the (L, M)-fuzzy convexity degrees ofand, respectively. Then
Proof. (1) For any a ∈ M, a ≤ CP (f) if and only if for all B ∈ LY, if and only if for all B ∈ LY.
(2) Let RHS denote the right hand side of equality. Suppose that for all B ∈ LY. For any and , i.e., , we have . Thus and , i.e., . By the result of (1), CP (f) ≤ RHS.
Conversely, take any . Then and , i.e., . Thus and , i.e., . This implies . By the arbitrariness of b, we obtain . Combining this with (1), CP (f) ≥ RHS.
(3) Let RHS denote the right hand side of equality. Suppose that for all B ∈ LY. For any and , i.e., , we have . Since α is an ⋀-⋃ map, it follows
This implies and , i.e., . By the result of (1), CP (f) ≤ RHS.
Conversely, take any . Since , we have and , i.e., . Thus and , i.e., . This implies . By the arbitrariness of b, we obtain . Combining this with (1), CP (f) ≥ RHS. □
Analogous, we can obtain characterizations about the convex-to-convex degree of f with respect to and in the followingtheorem.
Theorem 4.3.Given two mappingsand. Letanddenote the (L, M)-fuzzy convexity degrees ofand, respectively. Then
Definition 4.4. Given two mappings and . Let f : X ⟶ Y be a bijective mapping. Then the isomorphism degree of f with respect to and is defined by
where f-1 is the inverse mapping of f.
Theorem 4.5.Given two mappingsand. Letf : X ⟶ Ybe a bijective mapping. ThenCP (f-1) = CC (f) and
Proof. Since f is bijective, we have for all A ∈ LX. Then
Hence ISO (f) = CP (f)∧ CP (f-1) = CP (f) ∧ CC (f). □
Proposition 4.6.Given a mapping. Letid : X ⟶ Xbe the identity mapping. Then
Proof. Obviously. □
Proposition 4.7.Given three mappings, and. Letf : X ⟶ Yandg : Y ⟶ Zbe mappings.
(1) Iffis surjective, thenCP (f) ∧ CC (g ∘ f) ≤ CC (g).
(2) Ifgis injective, thenCP (g) ∧ CC (g ∘ f) ≤ CC (f).
Proof. (1) Since f is surjective, it follows that for any B ∈ LY. Then . By Lemma 2.1 (6), we have
(2) Since g is injective, we have for all B ∈ LY. Then for all A ∈ LX. By Lemma 2.1 (6), we have
Proposition 4.8.Given three mappings, and. Letf : X ⟶ Yandg : Y ⟶ Zbe mappings. Then
(1) CP (f) ∧ CP (g) ≤ CP (g ∘ f).
(2) CC (f) ∧ CC (g) ≤ CC (g ∘ f).
(3) iffandgare bijective, thenISO (f) ∧ ISO (g) ≤ ISO (g ∘ f).
Proof. We only prove (1), (2) and (3) can be proved similarly. By Definition 4.1 and Lemma 2.1 (6), we have
Lemma 4.9.Given two mappingsand. Letf : X ⟶ Ybe a bijective mapping. Then
.
.
Proof. We only prove (1). The proof of (2) is similar to that of (1).
Since f is bijective, we have for all A ∈ LX and for all B ∈ LY. Then
Hence (A)). □
Theorem 4.10.Given two mappingsand. Letf : X ⟶ Ybe a bijective mapping. Then
Degrees of quotient mappings
In this section, when and are (L, M)-fuzzy convex spaces to some extent, the degree to which a surjective mapping f : X ⟶ Y is a quotient mapping is defined and the relationships between the quotient degree, the convexity-preserving degree and the convex-to-convex degree of mappings are discussed.
Definition 5.1. Given two mappings and . Let f : X ⟶ Y be a surjective mapping. Then QU (f) defined by
is called the quotient degree of f with respect to and .
Theorem 5.2.Given two mappingsand. Letf : X ⟶ Ybe a surjective mapping. ThenQU (f) ≤ CP (f).
Proof. Obviously. □
Finally, we discuss the relationships among QU (f), CP (f) and CC (f).
Theorem 5.3.Given two mappingsand. Letf : X ⟶ Ybe a surjective mapping. ThenCP (f) ∧ CC (f) ≤ QU (f).
Proof. Since f is surjective, we have for all D ∈ LY. Then
Theorem 5.4.Given three mappings, and. Letf : X ⟶ Yandg : Y ⟶ Zbe surjective mappings. Then
(1) QU (f) ∧ QU (g) ≤ QU (g ∘ f).
(2) QU (g ∘ f) ∧ CP (f) ∧ CP (g) ≤ QU (g).
Proof. (1) By Lemma 2.1, we have
(2) Firstly, we know
and
Then
Hence
Conclusion
In this paper, the degree to which a mapping is an (L, M)-fuzzy convexity and the degree to which an L-subset is an L-convex set with respect to were defined. Afterwards, we defined the degrees to which a mapping f : X ⟶ Y is convexity-preserving, convex-to-convex and a quotient mapping with respect to and and discussed the relationships between them.
Motivated by these, many properties and results in classical convex theory can be reconsidered under (L, M)-fuzzy convexity degrees, such as convex invariance, topological convex structures etc., which will be the subjects of our future research.
References
1.
G.Birkhoff, Lattice Theory, American Mathematical Society Colloquium Publications, 1967.
2.
C.L.Chang, Fuzzy topological spaces, Journal of Mathematical Analysis and Applications24 (1968), 182–190.
3.
W.A.Coppel, Axioms for convexity, Bulletin of the Australian Mathematical Society47 (1993), 179–197.
4.
U.Höhle and A.P.Šostak, Axiomatic Foundations of Fixed-Basis Fuzzy Topology, In: U.Höhle and S.E.Rodabaugh(Eds.), Mathematics of Fuzzy Sets: Logic, Topology, and Measure Theory, Kluwer Academic Publishers, Dordrecht, 1999, pp. 123–272.
5.
R.E.Jamison Waldner, A perspective on abstract convexity: Classifying alignments by varieties, 1982, pp. 113–150.
6.
Q.Jin and L.Q.Li, On the embedding of convex spaces in stratified L-convex spaces, Springer Plus (2016), 5:1610.
7.
D.C.Kay and E.W.Womble, Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers, Pacific Journal of Mathematics38 (1971), 471–485.
8.
L.Q.Li, On the category of enriched (L, M)-convex spaces, Journal of Intelligent and Fuzzy Systems33 (2017), 3209–3216.
9.
J.V.Llinares, Abstract convexity, some relations and applications, Optimization51 (2002), 797–818.
B.Pang and F.G.Shi, Strong inclusion orders between L-subsets and its applications in L-convex spaces, Quaestiones Mathematicae (2018). DOI: 10.2989/16073606.2018.1436613
15.
B.Pang and F.G.Shi, Fuzzy counterparts of hull operators and interval operators in the framework of L-convex spaces, Fuzzy Sets and Systems (2018). DOI: 10.1016/j.fss.2018.05.012
16.
B.Pang and Z.Y.Xiu, Stratified L-prefilter convergence structures in stratified L-topological spaces, Soft Computing22 (2018), 7539–7551.
17.
B.Pang and Z.Y.Xiu, An axiomatic approach to bases and subbases in L-convex spaces and their applications, Fuzzy Sets Systems (2018). DOI: 10.1016/j.fss.2018.08.002
18.
B.Pang and Y.Zhao, Characterizations of L-convex spaces, Iranian Journal of Fuzzy Systems13(4) (2016), 51–61.
19.
S.E.Rodabaugh, Powerset operator based foundation for point-set lattice-theoretic (poslat) fuzzy set theories and topologies, Quaestiones Mathematicae20 (1997), 463–530.
20.
M.V.Rosa, On fuzzy topology fuzzy convexity spaces and fuzzy local convexity, Fuzzy Sets and Systems62 (1994), 97–100.
21.
F.G.Shi, Theory of Lβ-nested sets and Lα-nested sets and its applications, Fuzzy Systems and Mathematics4 (1995), 65–72.
22.
F.G.Shi and E.Q.Li, The restricted hull operator of M-fuzzifying convex structures, Journal of Intelligent and Fuzzy Systems30 (2015), 409–421.
23.
F.G.Shi and B.Pang, Categories isomorphic to the category of L-fuzzy closure system spaces, Iranian Journal of Fuzzy Systems10 (2013), 127–146.
24.
F.G.Shi and Z.Y.Xiu, (L, M)-fuzzy convex structures, The Journal of Nonlinear Science and Applications10 (2017), 3655–3669.
25.
F.G.Shi and Z.Y.Xiu, A new approach to the fuzzification of convex structures, Journal of Applied Mathematics2014 (2014), 1–12.
26.
G.Sierksma, Extending a convexity space to an aligned space, Proceedings of the Koninklijke Nederlandse Akademie Van Wetenschappen87 (1984), 429–435.
27.
V.P.Soltan, D-convexity in graphs, Soviet Math Dokl28 (1983), 419–421.
28.
F.A.Valentine, Convex sets, McGraw-Hill, 1964.
29.
M.van de Vel, Binary convexities and distributive lattices, Proceedings of the London Mathematical Society48 (1984), 1–33.
30.
M.van de Vel, Theory of Convex Structures, North- Holland, Amsterdam, 1993.
31.
G.J.Wang, Theory of topological molecular lattices, Fuzzy Sets and Systems47 (1992), 351–376.
32.
X.Y.Wu and S.Z.Bai, On M-fuzzifying jhc convex structures and M-fuzzifying peano interval spaces, Journal of Intelligent and Fuzzy Systems30 (2016), 2447–2458.
33.
Z.Y.Xiu and F.G.Shi, M-fuzzifying cotopological spaces and M-fuzzifying convex spaces as M-fuzzifying closure spaces, Journal of Intelligent and Fuzzy Systems33 (2017), 613–620.
34.
Z.Y.Xiu and B.Pang, Base axioms and subbase axioms in M-fuzzifying convex spaces, Iranian Journal of Fuzzy Systems15(2) (2018), 75–87.
35.
Z.Y.Xiu and F.G.Shi, M-fuzzifying interval spaces, Iranian Journal of Fuzzy Systems14 (2017), 145–162.
36.
S.J.Yang and F.G.Shi, M-fuzzifying independence spaces, Journal of Intelligent and Fuzzy Systems34 (2018), 11–21.