This paper introduces a special Galois connection combined with the wedge-below relation. Furthermore, by using this tool, it is shown that the category of M-fuzzifying betweenness spaces and the category of M-fuzzifying convex spaces are isomorphic and the category of arity-2 M-fuzzifying convex spaces can be embedded in the category of M-fuzzifying interval spaces as a reflective subcategory.
Convex sets widely exist in various research areas of mathematics, such as graphs, metric spaces, matroids, lattices and so on. With the deepening of research, the properties of convex sets are abstracted and an axiomatic convex structure is established. A family of subsets of a set X which is denoted by is called a convexity [21] provided that contains the empty set and the universal set, and it is closed under intersections and directed joins (equivalently, totally ordered joins). Then the pair is called a convex structure. The relationship between convex structures and matroids is very close. Matroids can be regard as convex structures with exchange law and convex sets are exactly the flat sets in matroids. Polyhedrons are typical convex sets. And betweenness is a relation on X to describe whether a point depends on a polyhedron. Arity-2 convex structures exist widely in various mathematical structures, like pre-ordered sets, Euclidean spaces and so on. Interval spaces abstracted from the intervals play an important role in convexity theory.
With the development of fuzzy mathematics, many structures have been combined with fuzzy set theory, such as fuzzy convergence [6, 36], fuzzy topology [13, 38], fuzzy order [22, 23] and so on. Similarly, the combination of convex structures and fuzzy set theory has also been greatly developed. There are generally the following research directions: M-fuzzifying convexities [2, 33], L-convexities [1, 34] and (L, M)-fuzzy convexities [8, 39]. When studying the relationship between convexities and other structures, complement plays an important role. De Morgan algebra can be regarded as a kind of generalization of complement. Under the premise of De Morgan algebra, Shi and Li [17] showed the isomorphism between M-fuzzifying betweenness spaces and M-fuzzifying convex spaces. Xiu and Shi [33] proved that the category of arity-2 M-fuzzifying convex spaces is a reflective subcategory of the category of M-fuzzifying interval spaces. But De Morgan algebra is a very strong condition. In this paper, we will introduce LRG adjunctions combined with the wedge-below relation. By this tool, we use an M-fuzzifying convexity (resp., arity-2 M-fuzzifying convexity) to construct an M-fuzzifying betweenness (resp., M-fuzzifying interval operator). Then we will show the categorical relationship between M-fuzzifying interval spaces and arity-2 M-fuzzifying convex spaces.
This paper is organized as follows. In Section 2, we will recall some necessary concepts of lattices and M-fuzzifying convexities. In Section 3, we will discuss the categorical relationship between M-fuzzifying convex and M-fuzzifying betweenness spaces with a special Galois connection. In Section 4, with this Galois connection, we will consider the categorical relationship between arity-2 M-fuzzifying convex spaces and M-fuzzifying interval spaces.
Preliminaries
Completely distributive lattice
We recall the concepts of completely distributive lattices in this subsection. The pair (L, ≤) is called a lattice [5] provided that for every two elements a, b ∈ L, there exists a supremum a ∨ b and an infimum a ∧ b. A lattice (L, ≤) is complete if for any subset of L the supremum and infimum exist. The largest element and the smallest element in L are denoted by 1 and 0, respectively. For a preordered set P, S ⊆ P is directed provided that for any a, b ∈ S, there exists c ∈ S such that c ≥ a and c ≥ b. A directed set S is always denoted by S↑.
The binary relation 〈 on L is defined as follows: for a, b ∈ L, a 〈 b if and only if for any D ⊆ L, b ≤ sup D implies that there exists d ∈ D such that a ≤ d [26]. β (b) = {a ∈ L ∣ a 〈 b} is called the greatest minimal family [26] of b. Moreover, the relation 〈op in L is defined as follows: for a, b ∈ L, b 〈 opa if and only if for any D ⊆ L, the relation b ≥ inf D implies that there exists d ∈ D such that a ≥ d. α (b) = {a ∈ L ∣ b 〈 opa} is called the greatest maximal family [26] of b. In a completely distributive lattice L, α (b) and β (b) exist, and b = ⋁ β (b) = ⋀ α (b) [26]. If a 〈 b, then there exists c ∈ L such that a 〈 c 〈 b. If a ≤ b 〈 c ≤ d, then a 〈 d. So does 〈op. Let L1 and L2 be two complete lattices. If a pair of mappings f : L1 → L2 and g : L2 → L1 (f : L1 ⇄ L2 : g for short) satisfies f (a) ≥ b if and only if g (b) ≥ a, then we call (f, g) an Galois connection.
Lemma 2.1. [[26]] Let L be a completely distributive lattice and {ai ∣ i ∈ I} ⊆ L. Then
(1) β (⋁ i∈Iai) = ⋃ i∈Iβ (ai), i.e., β is a union-preserving mapping.
(2) α (⋀ i∈Iai) = ⋃ i∈ωα (ai), i.e., α is a ∧ -∪ mapping.
Definition 2.2. [16] Let A ∈ LX, a ∈ L. Define A[a] = {x ∈ X ∣ A (x) ≥ a} , A[a] = {x ∈ X ∣ a ∉ α (A (x))} .
M-fuzzifying convexity, M-fuzzifying betweenness and interval operator
Let X be a nonempty set and be the set {F ⊆ X ∣ |F| isfinite .}, then or F ⊆ finX indicates that F is finite.
Definition 2.3. [19] A mapping is called an M-fuzzifying convexity on X if it satisfies the following conditions:
(MC1);
(MC2) If {Ai} i∈I ⊆ 2X is nonempty, then ;
(MC3) If {Ai} i∈I ⊆ 2X is directed by inclusion, then .
If is an M-fuzzifying convexity on X, then the pair is called an M-fuzzifying convex structure or M-fuzzifying convex space (MC for short).
Definition 2.4. [33] A mapping is called an M-fuzzifying betweenness on X if it satisfies the following conditions:
(MB1) For each x ∈ X, ;
(MB2) If and x ∈ F, then ;
(MB3) For each and x ∈ X,
If is an M-fuzzifying betweenness on X, then the pair is called an M-fuzzifying betweenness space (MB for short).
Remark 2.5. If is an M-fuzzifying convexity, then for any a ∈ M, is a convex space which satisfies (C1), (C2) and (C3) in [21]. Similarly, If is an M-fuzzifying betweenness, then for any a ∈ M, is a betweenness space which satisfies (BT1), (BT2) and (BT3) in [21].
Definition 2.6. [33] A mapping is called an M-fuzzifying interval operator on X if it satisfies the following conditions: for all x, y ∈ X,
(MI1) ;
(MI2) .
If is an M-fuzzifying interval operator on X, then the pair is called an M-fuzzifying interval space (MI for short).
In this paper, we need to discuss the Galois connection between two completely distributive lattices and consider the connection between M-fuzzifying betweenness and M-fuzzifying convexity in a broader context. Therefore, if not emphasized, we assume that (P, ≤) and (Q, ≤) are completely distributive lattices, is a mapping from 2X to P, is a mapping from to Q and is a mapping from X × X to QX.
Relationship between M-fuzzifying betweenness spaces and M-fuzzifying convex spaces via LRG-Galois connections
In this part, in order to discuss the categorical relationship between M-fuzzifying betweenness and M-fuzzifying convex spaces without De Morgan algebra, we propose LRG adjunctions.
Definition 3.1. Assume f : P → Q and g : Q → P are mappings. The pair (f, g) is called an LRG adjunction, if it satisfies the following condition:
(LRG) For any a ∈ P and b ∈ Q, f (a) 〈 opb ⇔ g (b) 〈 a .
Example 3.2. Assume P = Q = [0, 1]. (f, g) satisfies (LRG) provided that for any a, b ∈ [0, 1], f (a) < b if and only if g (b) < a (i.e., f (a) ≥ b if and only if g (b) ≥ a). Then (f, g) is a Galois connection.
Proposition 3.3.If a pair of mappings f : P ⇄ Q : g satisfies (LRG). Then f is an antitone mapping and for any A ⊆ P, f (⋁ A) = ⋀ f (A) (f is a ⋁ -⋀ mapping).
Proof. (1) Assume a, b ∈ P with a ≤ b. Take each x ∈ Q such that f (a) 〈 opx. By (LRG), we have g (x) 〈 a ≤ b. Then it follows from (LRG) that f (b) 〈 opx. This implies f (a) = ⋀ {x ∈ Q ∣ f (a) 〈 opx} ≥ ⋀ {x ∈ Q ∣ f (b) 〈 opx} = f (b) .
(2) By (1), it follows that
In order to show the inverse inequality, take each x ∈ Q such that
By (LRG), we have
Then there exists a0 ∈ A such that g (x) 〈 a0, which is equivalent to f (a0) 〈 opx. This imples
By the arbitrariness of x, we obtain
This shows f is a ⋁ -⋀ mapping. □
Corollary 3.4.Suppose a pair of mappings f : P ⇄ Q : g satisfies (LRG). Then f (1) =0, f (0) =1.
By (LRG), we can use an M-fuzzifying convexity to construct an M-fuzzifying betweenness.
Theorem 3.5. Suppose f : P ⇄ Q : g are a pair of mappings satisfying (LRG). Let be an M-fuzzifying convexity and define by
Then is an M-fuzzifying betweenness space.
Proof. It suffices to show satisfies (MB1)–(MB3).
(MB1) For each x ∈ X, ;
(MB2) For each x ∈ F, ;
(MB3) By the definition of greatest maximal families, we need only show that for each a ∈ Q,
Suppose a ∈ Q.
It follows from (LRG) that
(*) holds if and only if there exists B0 with x ∉ B0 ⊇ finF such that which implies that there exists t ∈ P such that . Since implies , . Hence x ∉ cot (F) where cot is the closure operator of . By properties of closure operator of convexities [21], x ∉ cot (F) implies that x ∉ cot (G) or G ⊈ cot (F), in which G ⊆ finX. If x ∉ cot (G), then there exists a subset A with x ∉ A ⊇ finG such that (i.e., ). If G ⊈ cot (F), then there exists u ∈ G with u ∉ Cu ⊇ finF such that (i.e., ). Furthermore, by g (a) 〈 t, we have
It follows from
that
□
The next theorem shows how to construct an M-fuzzifying convexity by using an M-fuzzifying betweenness.
Theorem 3.6. Let g : Q → P be a mapping with g (0) =1 and be an M-fuzzifying betweenness space. Define by
then is an M-fuzzifying convex space.
Proof. It suffices to show satisfies (MC1)–(MC3).
(MC1) . .
(MC2) We only need show for each a ∈ P and each family of subsets {Ai} i∈L ∈ 2X,
Suppose a ∈ P.
which is equivalent to that there exist x0 and F0 with x0 ∉ (⋂ i∈IAi) ⊇ finF0 such that . This implies that there exist i0 ∈ I with x0 ∉ Ai0 ⊇ finF0 such that , which means
Hence as we desired,
(MC3) The proof of (MC3) is similar to (MC2). Just need note that F is a finite set, thus for each directed family of subsets with , there exists an i1 ∈ I such that F ⊆ Ai1. And if , then x ∉ Ai for any i ∈ I. □
Before continuing to the next part, we will define the LRG-Galois connection.
Definition 3.7. Suppose a pair of mappings f : P ⇄ Q : g forms a Galois connection. We call (f, g) an LRG-Galois connection if it satisfies (LRG).
Remark 3.8. (1) If a pair of mappings f : P ⇄ Q : g forms a Galois connection, then fg ≥ idQ and gf ≥ idP.
(2) In the rest of this paper, we add several conditions that g (1) =0, g (0) =1 and g is a ⋁ -⋀ mapping to LRG-Galois connection.
Example 3.9. (1) Assume P = Q = [0, 1]. Let f (x) =1 - x2 and for each x ∈ [0, 1]. Then (f, g) is an LRG-Galois connection.
(2) Assume (P, ≤) and (Q, ≤) are complete join semi-lattice. Pop (resp., Qop) is the dual of P (resp., Q). Then the pair (op, op) is an LRG-Galois connection.
Theorem 3.10.Suppose a pair of mappings f : P ⇄ Q : g forms an LRG-Galois connection and is an M-fuzzifying betweenness space. Then for any , .
Proof. For each x ∈ X and each F ⊆ finX, we have
Suppose . Then it follows that there exists A0 with x ∉ A0 ⊇ finF such that
By (LRG),
which implies that for all G and y with y ∉ A0 ⊇ finG, we have , which is equivalent to that . Since (f, g) is an Galois connection, . Hence for all G and y with y ∉ A0 ⊇ finG, we have . Let G = F and y = x, then , i.e., . It follows from that . □
In Proposition 3.10, if f ∘ g = id, then we can obtain a stronger result as follow.
Theorem 3.11.Let a pair of mappings f : P ⇄ Q : g with f ∘ g = idQ form an LRG-Galois connection. Assume is an M-fuzzifying betweenness space, then for each , .
Proof. For each , we only need to show that the left-hand side is smaller than the right-hand side.
Suppose
This is equivalent to that for each A with x ∉ A ⊇ finF, there exists (y, G) with y ∉ A ⊇ finG such that . Suppose that . Let . Then x ∉ YaF, otherwise and this is a contradiction. Since for each u ∈ F, . Hence F ⊆ YaF. Furthermore, there exists (y, G) with y ∉ YaF ⊇ finG such that . By (BT3), (BT2) and the definition of YaF,
It follows that y ∈ YaF, which is a contradiction. Hence the assumption that fails to hold. Thus we have proved that
implies that . By the arbitrariness of a, we obtain
as desired. □
Similarly, we can obtain following results.
Theorem 3.12.Suppose a pair of mappings f : P ⇄ Q : g forms an LRG-Galois connection and is an M-fuzzifying convex space. Then for any A ∈ 2X, .
Proof. Given an A ∈ 2X, we have
For any (x, F) with x ∉ A ⊇ finF,
Since g is antitone,
By the arbitrariness of x and F, .□
Corollary 3.3.Suppose an LRG-Galois connection (f, g) satisfies that g ∘ f = id and is an M-fuzzifying convex space. Then .
Proof. For each , let BxF = {B ⊆ X ∣ x ∉ B ⊇ finF}. By g ∘ f = id and the completely distributive law, given an A ⊆ X, we have
Hence . The inverse inequality holds for Theorem 3.12. Thus the conclusion is proved. □
Theorem 3.14.Let a pair of mappings f : P ⇄ Q : g form an LRG-Galois connection. Then
(1) If and are M-fuzzifying convex spaces with , then .
(2) If and are M-fuzzifying betweenness spaces with , then .
This is because f, g are antitone. On the basis of the above discussion, we will further study the categorical relationship between M-fuzzifying convex spaces and M-fuzzifying betweenness spaces. Definition 3.15 can be found in some researches of fuzzy convex structure such as [17].
Definition 3.15. ([17]). (1) Let and be M-fuzzifying convex spaces. If a mapping h : X → Y satisfies the following condition: for each A ∈ 2X, , then h is called an M-fuzzifying convexity-preserving mapping.
(2) Let and be M-fuzzifying betweenness spaces. If a mapping h : X → Y satisfies the following condition: for each , . then h is called an M-fuzzifying betweenness-preserving mapping.
The category of M-fuzzifying convex spaces and M-fuzzifying convexity-preserving mappings is denoted by MC. The category of M-fuzzifying betweenness spaces and M-fuzzifying betweenness-preserving mappings is denoted by MB.
Theorem 3.16.There is a pair of functors K: MC⇄MB:H, in which and . And there exists a natural isomorphism between the hom-sets and .
Proof. (1) Firstly, take any MC-morphism . Since f is antitone and h (x) ∉ B ⊇ h (F) if and only if x ∉ h-1 (B) ⊇ F,
Hence is an MC-morphism.
Secondly, take any MB-morphism . Since g is antitone and h (x) ∉ B ⊇ h (F) if and only if x ∉ h-1 (B) ⊇ F,
Hence is an MC-morphism.
Lastly, it is not difficult to check that H and K preserve the unit morphism and composition.
(2) The naturality of the transformation between and is established by compositions of mappings. Then need only show that for any M-fuzzifying convex space , any M-fuzzifying betweenness space , and any mapping h : X → Y, if and only if .
On one hand, as h (x) ∉ B ⊇ h (F) ⇔ x ∉ h-1 (B) ⊇ F, we have
On the other hand, as h (x) ∉ B ⊇ h (F) ⇔ x ∉ h-1 (B) ⊇ F, we have:
□
Corollary 3.17.(1) If there exists an LRG-Galois connection (f, g) between P and Q, then there exists a adjoint pair between MC and MB;
(2) Suppose (f, g) is an LRG-Galois connection between P and Q. If fg = id and gf = id, then MC and MB are isomorphic.
Relationship between M-fuzzifying interval spaces and arity-2 M-fuzzifying convex spaces via LRG-Galois connections
A convexity is of arity-n provided that it is precisely a collection of such sets C which satisfies the property that if |F| ≤ n, then F ⊆ C implies co (F) ⊆ C. Arity-2 convexities exist widely in various mathematical structures (like convexity in Rn, poset, convex graph and so on). In this part, we will discuss the relationship between M-fuzzifying arity-2 convexities and M-fuzzifying interval operators.
Example 4.1. For the number axis , let M = {0, 1}, , Then M-fuzzifying interval space is all the close intervals in the general sense.
Theorem 4.2. Suppose is an M-fuzzifying interval space and g : Q → P is a mapping. Define by
Then is an M-fuzzifying convex space.
Proof. It suffices to show satisfies (MC1)–(MC3).
(MC1) .
(MC2) Given a family of subsets {AI} i∈I, for each a ∈ P,
holds if and only if there exist z0, y0, z0 with z0 ∉ (⋂ i∈IAi) ⊇ {x0, y0} such that . It follows that there exist A0 with z0 ∉ A0 ⊇ {x0, y0} such that . This is equivalent to that
Then it follows from that .
(MC3) Given a directed family of subsets , for each a ∈ P,
holds if and only if there exist z0, y0, z0 with
such that . It follows that there exists A0 with z ∉ A0 ⊇ {x0, y0} such that . This is equivalent to that
It follows from that . □
Corollary 4.3.If is an M-fuzzifying interval space, then is an M-fuzzifying betweenness space.
By Theorem 4.2, we have a following definition:
Definition 4.4. We call the M-fuzzifying convex space an arity-2 M-fuzzifying convex space, if is an M-fuzzifying interval space.
The following theorem show the rationality of Definition 4.
Theorem 4.5.Suppose is an M-fuzzifying interval space and is an arity-2 M-fuzzifying convex space. Then for any a ∈ Q, is an arity-2 convexity.
Proof. By Remark 2.2, for any a ∈ Q, is a convexity. We only need to show that for a given subset D, if {s, t} ⊆ D, then
is equivalent to that
And (*1) holds if and only if for any x, y, z ∈ X with z ∉ D ⊇ {x, y}, we have . Take each s, t, r ∈ X such that r ∉ D ⊇ {s, t}. If for any , Ai ⊉ {s, t}, then
Then . Suppose there exists with Ai ⊇ {s, t}. It follows that
By A ⊆ D, we can know r ∉ D implies r ∉ A. By (C2) in Remark 2.2, we can know . it follows from that . By arbitrariness of r, s, t, we can know (*1) hold.□
Theorem 4.6.If is an M-fuzzifying betweenness space, define mapping by . Then is an M-fuzzifying interval space.
Proof. It is not difficult to know that (MI1) holds for (MB1) and (MI2) holds for (MB2). □
Theorem 4.7.Let a pair of mappings f : P ⇄ Q : g form an LRG-Galois connection and be an M-fuzzifying interval space. Then for any s, t ∈ X, .
Proof. Given s, t ∈ X, since (f, g) is an LRG-Galois connection, we have
Theorem 4.8.Suppose a pair of mappings f : P ⇄ Q : g forms an LRG-Galois connection and is an M-fuzzifying convex space, then for any A ∈ 2X, .
Proof. Given an A ∈ 2X, since (f, g) is an LRG-Galois connection, we have
□
Furthermore, an arity-2 M-fuzzifying convex space satisfies the following property.
Theorem 4.9.Suppose a pair of mappings f : P ⇄ Q : g forms an LRG-Galois connection and is an M-fuzzifying betweenness space. Assume is an arity-2 M-fuzzifying convex space, then for any A ∈ 2X.
Proof. Similarly to Theorem 4.8, by Theorem 3.5, Theorem 4.2 and Theorem 4.6, . By Theorem 3.14 and Theorem 4.7, . □
The next definition can be found in some articles of fuzzy convex structures such as [25].
Definition 4.10. ([25]). (1) Let and be arity-2 M-fuzzifying convex spaces. If a mapping h : X → Y satisfies the following condition: for each A ∈ 2X, , then h is called an arity-2 M-fuzzifying convexity-preserving mapping.
(2) Let and be M-fuzzifying interval spaces. If a mapping h : X → Y satisfies the following condition: for each , . then h is called an M-fuzzifying interval-preserving mapping.
The category of arity-2 M-fuzzifying convex spaces and arity-2 M-fuzzifying convexity-preserving mappings is denoted by MCa2. The category of M-fuzzifying interval spaces and M-fuzzifying interval-preserving mappings is denoted by MI.
Remark 4.11. MCa2 is a full subcategory of MC.
Next, we will discuss the categorical relationship between MCa2 and MI.
Theorem 4.12.There exists a pair of functors I :MCa2⇄MB :R, in which , . And the functors satisfies:
(1) R ∘ I = Id;
(2) I is a full functor;
(3) is a natural isomorphism.
Proof. Similarly to Theorem 3.16, I and R are functors. By Theorem 4.9, we can know that on Ob(MCa2), R ∘ I = Id. Similarly to Theorem 3.16, for a mapping h : X → Y, if and only if . Hence (1) and (2) are established. (3) ia a corollary of Theorem 3.16.
Corollary 4.13.If there exists an LRG-Galois connection (f, g) between P and Q, then MCa2 is a reflective subcategory of MI.
By Theorem 4, we have , then . By Theorem 4.9, we have . In these inductions, we need not fg = id or gf = id. Hence fg = id or gf = id is not necessary in Corollary 4.13.
Conclusion
In this paper, we propose LRG-Galois connection. The categorical relationship between MC and MB is discussed. And MCa2 is proved to be a reflective subcategory of MI. In fact, we can further consider the role of Galois connections.
(1) A Galois connection is a generalization of De Morgan law. In many situations that complement sets are needed, we can use special Galois connections instead of complements. Similarly, a Galois adjunction is a generalization of the inclusion relation. In many situations that complement sets are not needed, we can use a special Galois adjunctions instead of containments.
(2) In theory of structures on lattices (such as [26]), a generalized order-homomorphisms [26] h and its adjunctions h⊣ are often used. (h, h⊣) is a Galois adjunction, so if we regard MCs and MBs as objects, then morphism between an MC and MB could be the left Galois adjunctions.
Footnotes
Acknowledgments
This work is supported by the Postdoctoral Science Foundation of China (No. 2020M670142).
WangL., WuX.Y. and XiuZ.Y., A degree approach to relationship among fuzzy convex structures, fuzzy closure systems and fuzzy Alexandrov topologies, Open Mathematics17 (2019), 913–928.
29.
WuX.Y. and LiE.Q., Category and subcategories of (L, M)-fuzzy convex spaces, Iran J Fuzzy Syst16(1) (2019), 173–190.
30.
WuX.Y., LiE.Q. and BaiS.Z., Geometric properties of M-fuzzifying convex structures, J Intell Fuzzy Syst32(6) (2017), 4273–4284.
31.
WuX.Y. and ShiF.G., M-fuzzifying Bryant-Webster spaces and M-fuzzifying join spaces, J Intell Fuzzy Syst35 (2018), 1807–1819.
32.
WuX.Y. and ShiF.G., L-concave bases and L-topologicalconcave spaces, J Intell Fuzzy Syst35 (2018), 4731–4743.