For a fuzzy subset system ZL, the concepts of a ΔΓL-completion and a ZΓL-completion of a given fuzzy poset (X, e) are introduced and their universal properties are investigated. In this paper, we prove that: (1) the ΔΓL-completion ΔΓL (X) is a join-completion with the universal property; (2) the ZΓL-completion ZΓL (X) is the smallest ZL-complete fuzzy subposet of ΔΓL (X) in the case that ZL is fuzzy subset-hereditary. The results show that the Dedekind-MacNeille completion is a special case of the ZΓL-completion.
One important aspect of domain theory [8] is to extend the poset to a complete one. Since the DM-completion was proposed by Dedekind and MacNeille [15], the idea of completions has aroused the interest of many researchers, and there are many researches on this aspect, such as the Alexandroff completion, the cauchy ideal completion, the Frink ideal completion, the D-completion, and so on (see [5, 7, 12, 27]). In 2015, Zhao [28] extended the D-completion to the more general structure Z-subset system, namely Z-completion. Subsequently, Zhang and Li (see [24–26]) did a sequence of work on completions by Z-subset system: (1) constructed the Zδ-completions, which generalized the DM-completions of posets; (2) constructed the Z-convergence space completion embedding each T0-closure space into a Z-convergence one; (3) provided a general framework for poset completions, i.e., the ZΓ-completion, which includes numerous special cases.
With the development of fuzzy set theory, fuzzy orders have penetrated into many fields of mathematics, such as domain, topology, rough set and so on (see [2, 4, 6, 11, 13, 14, 16–23, 29, 30]). In the framework of fuzzy domain, Wagner [18] constructed an enriched version of the DM-completion for an Ω-category. Bĕlohlávek [2, 4] used fuzzy concept lattices to describe the DM-completion of a fuzzy poset. And Xie et al. [20] used cuts to construct the DM-completions of fuzzy posets. When we take Ω = L to be a frame, it is easily seen that the three versions of the DM-completion for a fuzzy poset agree with each other. Later, Wang and Zhao [19] provided the join-completion of a fuzzy poset and Su and Li [17] discussed the Δ1-completion of a fuzzy poset. On the other hand, Ma, Rao and Zhao et al. [14, 16, 30] studied ZL-subset systems in the fuzzy setting, called fuzzy ZL-subset systems. The details are as follows: Zhao [30] introduced the definition of ZL-continuous fuzzy posets and discussed some simple properties; Rao [16] studied section-retraction pair of ZL-continuous fuzzy posets and obtained an extension theorem of ZL-algebraic fuzzy posets; Ma and Zhao [14] further investigated the properties of ZL-continuous fuzzy posets and ZL-algebraic fuzzy posets. Then, how can we describe the ZL-completion for fuzzy posets? Can we get the same results as in the classical domain theory? And what is the role of it in fuzzy domain theory? For this purpose, in this paper we first define a ΔΓL-completion of a fuzzy poset, and discuss its universal property. Then we build a ZΓL-completion with the universal property for a fuzzy poset and discuss the relationship with other completions.
The contents are arranged as follows: In Sect. 2, some basic notions and conclusions that will be used throughout this paper are listed. In Sect. 3, for a fuzzy subset system ZL and a fuzzy subset selection ΓL of fuzzy ZL-subsets, the ΔL-closed fuzzy subsets and ΔΓL-completion for a fuzzy poset are introduced and investigated. Moreover, it is shown that the ΔΓL-completion is a join-completion with the university property. In Sect. 4, the ΔΓL-continuously ⊔-existing fuzzy subsets and ΔΓL-continuous mapping are introduced. Then the concept of a ΔΓL-completion for a fuzzy poset is proposed and discussed. In particular, it is shown that the ZΓL-completion ZΓL (X) is the smallest ZL-complete fuzzy subposet of ΔΓL (X) and any ΔΓL-continuous mapping f : X ⟶ Y into a ZL-complete fuzzy poset (Y, eY) extends uniquely to a Z⊔-continuous mapping from the ZΓL-completion ZΓL (X) to Y.
Preliminaries
For the convenience of the reader, in this section, some basic concepts are reviewed. In this paper, we will use a complete residuated lattice as the structures of truth values. Such an algebraic structure is significant in fuzzy logic in a narrow sense (see [2, 3, 11]). If no other conditions are imposed, in the sequel, L always denotes a complete residuated lattice. A complete residuated lattice is an algebraic structure (L, ∧ , ∨ , ∗ , → , 0, 1) such that (1) (L, ∧ , ∨ , 0, 1) is a complete lattice with the least element 0 and the greatest element 1; (2) (L, ∗ , 1) is a commutative monoid, i.e., ∗ is commutative, associative, and a ∗ 1 = a holds for all a ∈ L; (3) ∗ and → form an adjoint pair, i.e., a ∗ b ≤ c ⇔ a ≤ b → c for all a, b, c ∈ L.
Proposition 2.1.(Bĕlohlávek [3] and Hájek [10]). Let L be a complete residuated lattice, a, b, c ∈ L, and {ak} k∈K, {bk} k∈K ⊆ L, then
(1) 0 ∗ a = 0, 1 → a = a, 0 → a = 1;
(2) 1 ≤ a → b ⇔ a ≤ b;
(3) (a → b) ∗ (b → c) ≤ (a → c);
(4) a → (b → c) = (a ∗ b) → c = b → (a → c);
(5) a ∗ ⋁ k∈Kbk = ⋁ k∈Ka ∗ bk;
(6) (⋁ k∈Kak) → b = ⋀ k∈K (ak → b);
(7) a → (⋀ k∈Kbk) = ⋀ k∈K (a → bk);
(8) (a → b) → (a → c) ≥ b → c, (a → b) → (c → b) ≥ c → a;
(9) a ∗ (a → b) ≤ b, a ≤ (a → b) → b;
(10) a ∗ (b ∧ c) ≤ (a ∗ b) ∧ (a ∗ c);
(11) a → (b ∗ c) ≥ (a → b) ∗ c.
More properties about complete residuated lattices can be found in [3, 10].
LX denotes the set of all fuzzy subsets of X. For A ⊆ X, χA denotes the characteristic function of A. In particular, when A = {x}, χA is denoted by χx. For a ∈ L and A, B ∈ LX, write fuzzy subsets a ∗ A, a → A and A ⊆ B by (a ∗ A) (x) = a ∗ A (x), (a → A) (x) = a → A (x) and A (x) ≤ B (x) for all x ∈ X.
Definition 2.2. (Bĕlohlávek [4] and Fan [6]) A fuzzy poset is a pair (X, e) such that X is a set and e : X × X ⟶ L is a mapping, called a fuzzy order, that satisfies for every x, y, z ∈ X,
(1) e (x, x) =1;
(2) e (x, y) ∗ e (y, z) ≤ e (x, z);
(3) e (x, y) = e (y, x) =1 implies x = y.
Let X be a nonempty set and A, B ∈ LX, the subsethood degree of A in B [9] is defined by sub (A, B) = ⋀ x∈XA (x) → B (x) and sub is also called the fuzzy inclusion order on LX. Then (LX, sub) is a fuzzy poset. Some basic properties of sub are collected in the following proposition, which can be found in [2, 9].
Proposition 2.3.Let sub : LX × LX ⟶ L on LX, A, B, C, D ∈ LX, and {Bk} k∈K ⊆ LX. Then
(1) sub (A, B) =1 iff A ⊆ B;
(2) sub (A, B) ∗ sub (C, D) ≤ sub (A ∗ C, B ∗ D);
(3) sub (A, ⋀ k∈KBk) = ⋀ k∈Ksub (A, Bk);
(4) sub (⋁ k∈KBk, A) = ⋀ k∈Ksub (Bk, A).
Definition 2.4. (Yao [21], Zhang and Fan [23]) Let (X, e) be a fuzzy poset. An element x0 ∈ X is called a join (resp . , meet) of A, in symbols x0 = ⊔ A (resp . , x0 = ⊓ A), iff
(1) for any x ∈ X, A (x) ≤ e (x, x0) (resp . , A (x) ≤ e (x0, x));
(2) for any .
Proposition 2.5.(Yao [21]) Let (X, e) be a fuzzy poset. Then
(1) x0 = ⊔ A iff for all y ∈ X;
(2) x0 = ⊓ A iff for all y ∈ X.
Let (X, e) be a fuzzy poset. A ∈ LX is called a fuzzy upper subset (or a fuzzy lower subset) iff ∀x, y ∈ X, A (x) ∗ e (x, y) ≤ A (y) (orA (x) ∗ e (y, x) ≤ A (y)). ↓A ∈ LX is defined by ↓A (x) = ⋁ x′∈XA (x′) ∗ e (x, x′) for all x ∈ X. Then ↓A is a fuzzy lower subset and A is a fuzzy lower subset iff A = ↓ A. For x ∈ X, define the mappings ιx, μx : X ⟶ L as follows: ∀y ∈ X, ιx (y) = e (y, x) , μx (y) = e (x, y). Obviously, ιx is a fuzzy lower subset and μx is a fuzzy upper subset. Let Ψ (X) = {ιx | x ∈ X} denote the set of all fuzzy principal ideals of X.
Given a map f : X → Y between two fuzzy posets (X, e) and (Y, eY), as usual, define f→ : LX → LY and f← : LY → LX by f→ (A) (y) = ⋁ x∈XA (x) ∗ eY (y, f (x)) , f← (B) (x) = B (f (x)) , ∀ y ∈ Y, x ∈ X . Then the following results can be found in [2, 13].
Proposition 2.6.Let f : X → Y be a mapping two fuzzy posets (X, e) and (Y, eY), A, B ∈ LX, and C, D ∈ LY. Then the following statements hold:
(1) sub (A, B) ≤ subY (f→ (A) , f→ (B));
(2) subY (C, D) ≤ sub (f← (C) , f← (D));
(3) A ⊆ f← (f→ (A));
(4) f→ (f← (C)) ⊆ C and f← (C) is a fuzzy lower subset of X when C = ↓ C.
Definition 2.7. (Yao [21], Zhang and Fan [23]) Let (X, eX) , (Y, eY) be two fuzzy posets, then a mapping f : X → Y is called
(1) a fuzzy order-preserving if eX (x, y) ≤ eY (f (x) , f (y)) for all x, y ∈ X;
(2) a fuzzy order-embedding if eX (x, y) = eY (f (x) , f (y)) for all x, y ∈ X;
(3) a fuzzy order-isomorphism if f is a fuzzy order-embedding which maps X onto Y.
Let (X, e) be a fuzzy poset and A ∈ LX. The Au, Al ∈ LX is defined as follows: Au (x) = ⋀ x′∈XA (x′) → e (x′, x) , Al (x) = ⋀ x′∈XA (x′) → e (x, x′) , ∀ x ∈ X . The cut operator (-) δ : LX ⟶ LX is defined by Aδ = Aul. A is called a cut if A = Aδ. Clearly, a cut is always a fuzzy lower subset and the cut operator is a fuzzy closure operator on X, that is, (1) A ⊆ Aδ, (2) sub (A, B) ≤ sub (Aδ, Bδ), and (3) Aδ = (Aδ) δ for all A, B ∈ LX. The Dedekind-MacNeille completion DML (X) = {A ∈ LX : A = Aδ}.
Proposition 2.8.Let (X, e) be a fuzzy poset and A ∈ LX. Then Aδ = ιx for some x ∈ X iff ⊔A = x.
Definition 2.9. (Bĕlohlávek [2], Wang [19], and Xie [20]) Let (X, e) be a fuzzy poset, P ⊆ X, and i : P ⟶ X an inclusion mapping.
(1) If for every x ∈ X there is a fuzzy subset A of P such that x = ⊔ i→ (A), then P is said to be join-dense in X;
(2) If (Y, eY) is a fuzzy complete lattice and φ : X ⟶ Y is a fuzzy order-embedding, then (Y, eY) is called a completion of X; For convenience, a completion (Y, eY) of X via the fuzzy order-embedding φ is denoted by the pair (Y, φ) (or just Y if there is no ambiguity);
(3) If (Y, φ) is a completion of X and φ (X) is join-dense in Y, then (Y, φ) is called a join-completion of X.
Proposition 2.10.(Wang [19]) Let (X, e) be a fuzzy poset and C a fuzzy closure operator on X. If C is consistent, i.e., C (χx) = ιx for all x ∈ X, then is a join-completion of X, where and is defined by φC (x) = ιx for all x ∈ X.
Let FPos be the category of fuzzy posets with fuzzy order-preserving mappings as morphisms. A fuzzy subset system [14] on FPos is a functor ZL : FPos ⟶ Set satisfying the following conditions:
(1) , ZL (X, e) ⊆ LX, for convenience ZL (X, e) is always denoted by ZL (X);
(2) , if A ∈ ZL (X), then ZL (f) (A) = f→ (A) ∈ ZL (Y);
(3) such that ∃ A ∈ ZL (X) satisfies ⋁x∈XA (x) =1.
For all A ∈ ZL (X), A is called a fuzzy ZL-subset of X. By (2), for any P ⊆ X, A ∈ ZL (P) implies i→ (A) ∈ ZL (X), where i : P ⟶ X is an inclusion mapping. By (2) and (3), ιx ∈ ZL (X) for all x ∈ X. In fact, by (3), such that ∃ B ∈ ZL (Y) satisfies ⋁y∈YB (y) =1. We can define a mapping f : Y ⟶ X as f (y) = x for all y ∈ Y. Then f is a fuzzy order-preserving mapping and f→ (B) (x′) = ⋁ y∈YB (y) ∗ e (x′, f (y)) = ⋁ y∈YB (y) ∗ e (x′, x) = e (x′, x) = ιx (x′) for all x′ ∈ X. So ιx = f→ (B) ∈ ZL (X) by (2). Moreover, if f is a fuzzy order-isomorphism, then A ∈ ZL (X) ⇔ f→ (A) ∈ ZL (Y).
Example 2.11. (Ma [14], Rao [16] and Zhao [30])Let (X, e) be a fuzzy poset, , , and , then , and are a fuzzy subset system.
(X, e) is called ZL-complete if ⊔D exists for all D ∈ ZL (X). P ⊆ X is called a ZL-complete fuzzy subposet if ∀D ∈ ZL (P), ⊔i→ (D) ∈ P. A ∈ LX is called ZL-closed if ∀D ∈ ZL (X) with existing ⊔D implies sub (D, A) ≤ A (⊔ D). Clearly, is a fuzzy closure space defined in [1], then the ZL-closure operator CZL is defined as follows: for any B ∈ LX, A mapping f : X ⟶ Y between two fuzzy posets is fuzzy Z⊔-continuous iff f is a fuzzy order-preserving and f (⊔ D) = ⊔ f→ (D) for all D ∈ ZL (X) with existing ⊔D.
Definition 2.12. A fuzzy subset system ZL is called fuzzy subset-hereditary if for any fuzzy posets (X, eX), (Y, eY) and a fuzzy order-embedding f : X ⟶ Y, D ∈ ZL (X) iff f→ (D) ∈ ZL (Y).
Proposition 2.13.Let (X, e) be a fuzzy poset, P ⊆ X, and D ∈ LP. If ZL is fuzzy subset-hereditary, then D ∈ ZL (P) iff i→ (D) ∈ ZL (X).
The ΔΓL-completion of fuzzy posets
Let ΓL (X) ⊆ ZL (X). If ⊔D exists in X for any D ∈ ΓL (X), then we say (X, e) is ΓL-complete. In particular, if (X, e) is ZL-complete, then (X, e) is ΓL-complete for any ΓL. In this section, We define a special type of fuzzy subsets by the fuzzy subset selection ΓL (X) and construct a ΔΓL-completion of a fuzzy poset based on it.
Definition 3.1. Let (X, e) be a fuzzy poset. A fuzzy subset A ∈ LX is called ΔΓL-closed if
(1) A = ↓ A;
(2) ∀D ∈ ΓL (X), sub (D, A) ≤ sub (Dδ, A).
Proposition 3.2.Let (X, e) be a fuzzy poset and ΔΓL (X) = {A ∈ LX | AisΔΓL - closed}. Then (ΔΓL (X) , sub) is a fuzzy complete lattice.
Proof. We only need to show that for any , exists and . Let for any x ∈ X, then B ∈ ΔΓL (X). In fact, for any x, y ∈ X,
which implies that B is a fuzzy lower subset of X. Moreover, for any D ∈ ΓL (X),
Then we can easy check that B is the meet of , i.e., .
Define a fuzzy ΔΓL-closure operator CΔΓL on X by CΔΓL (B) (x) = ⋀ A∈ΔΓL(X)sub (B, A) → A (x) for any B ∈ LX and x ∈ X. Let , then by Theorem 3.6 in [1].
Proposition 3.3.Let (X, e) be a fuzzy poset, A ∈ LX and .
(1) If A = Aδ, then A ∈ ΔΓL (X). In particular, Ψ (X) ⊆ ΔΓL (X);
(2) .
Proof. (1) Let A = Aδ, then A is a fuzzy lower subset, i.e., A = ↓ A. For any D ∈ ΓL (X), sub (D, A) ≤ sub (Dδ, Aδ) = sub (Dδ, A). Therefore, A ∈ ΔΓL (X). Moreover, Ψ (X) ⊆ ΔΓL (X) since ιxδ = ιx.
(2) For any B ∈ ΔΓL (X),
Moreover,
Proposition 3.4.Let (X, e) be a fuzzy poset. Then
(1) CΔΓL is a consistent fuzzy closure operator on X, i.e., CΔΓL (χx) = ιx for all x ∈ X;
(2) (ΔΓL (X) , ηX) is a join-completion of (X, e), where ηX : X ⟶ ΔΓL (X) defined by ηX (x) = ιx for all x ∈ X. In this case, we always call (ΔΓL (X) , ηX) or simply ΔΓL (X) the ΔΓL-completion of the fuzzy poset (X, e).
Proof. (1) For any x, x′ ∈ X, it is obvious that sub (ιx, CΔΓL (χx)) = CΔΓL (χx) (x) =1 and
Therefore CΔΓL (χx) = ιx.
(2) It is a direct consequence of (1), Proposition 3.2 and Proposition 3.16 in [19].
Define a mapping by for all A ∈ LX and x ∈ X. Then we have the following result.
Lemma 3.5.For all A ∈ LX, .
Proof. Let A ∈ LX and x ∈ X, then since is a fuzzy lower subset. By Proposition 3.3, we have that
On the other hand,
which implies that . Therefore .
By Lemma 3.5 and Theorem 4.5 in [19], we obtain that the ΔΓL-completion ΔΓL (X) of a fuzzy poset (X, e) has the universal property, details as follows:
Theorem 3.6.The ΔΓL-completion ΔΓL (X) of a fuzzy poset (X, e) has the universal property in the following sense: for any CΔΓL-homomorphism f : X ⟶ Y into a fuzzy complete lattice (Y, eY) there is a unique join-preserving mapping such that , i.e., the following diagram commutes:
Here CΔΓL-homomorphism f : X ⟶ Y means f← (ιy) ∈ ΔΓL (X) for all y ∈ Y and is defined by for all A ∈ ΔΓL (X).
Example 3.7. Let (X, e) be a fuzzy poset. (1) When and , a fuzzy subset A ∈ LX is -closed iff A = Aδ by A ⊆ A and Proposition 3.3. Moreover, is exactly the Dedekind-Macneille completion of the fuzzy poset (X, e).
(2) When ΓL (X) = ΦL (X), where ΦL (X) =∅, we have that A ∈ LX is ΔΦL-closed iff A = ↓ A. In this case, ΔΦL (X) = {A ∈ LX | A = ↓ A} is the ΔΦL-completion of (X, e).
The ZΓL-completion of fuzzy posets
To go further, the fuzzy subset systems ZL we consider in the following part of this paper are required to be fuzzy subset-hereditary. In this section, we construct the smallest ZΓL-completion in ΔΓL (X) and discuss its universal property.
Definition 4.1. A mapping f : X ⟶ Y between two fuzzy posets (X, eX) and (Y, eY) is called a ΔΓL-continuous mapping if
(1) f is a fuzzy order-preserving;
(2) ∀D ∈ ΓL (X), (f→ (D)) δ = (f→ (Dδ)) δ.
Proposition 4.2.Let f : X ⟶ Y be a mapping between two fuzzy posets (X, eX) and (Y, eY). Consider the following conditions:
(1) f is ΔΓL-continuous;
(2) f← (A) ∈ ΔΓL (X) for all A ∈ ΔΓL (Y);
(3) f is a fuzzy order-preserving and ⊔f→ (D) = ⊔ f→ (Dδ) for all D ∈ ΓL (X);
(4) f is a fuzzy order-preserving and ⊔f→ (D) = f (⊔ D) for all D ∈ ΓL (X).
Then (1) ⇔ (2), (1) ⇔ (2) ⇔ (3) when (Y, eY) is ZL-complete, and (1) ⇔ (2) ⇔ (3) ⇔ (4) when (X, eX) is ΓL-complete.
Proof. (1)⇒(2): Suppose that f is ΔΓL-continuous, A ∈ ΔΓL (Y), and D ∈ ΓL (X), then f← (A) is a fuzzy lower subset of X, f→ (D) ∈ ΔΓL (Y) and
Therefore f← (A) ∈ ΔΓL (X).
(2)⇒(1): Step 1. We show that f is a fuzzy order-preserving. In fact, for any x, x′ ∈ X, (χf(x′)) δ = ιf(x′) ∈ ΔΓL (Y). And so f← (ιf(x′)) ∈ ΔΓL (X) and f← (ιf(x′)) (x′) =1. Therefore eX (x, x′) = eX (x, x′) ∗ f← (ιf(x′)) (x′) ≤ f← (ιf(x′)) (x) = eY (f (x) , f (x′)) .
Step 2. We show that ∀D ∈ ΓL (X), (f→ (D)) δ = (f→ (Dδ)) δ. Obviously, (f→ (D)) δ ⊆ (f→ (Dδ)) δ since D ⊆ Dδ. On the other hand, for any D ∈ ΓL (X) we get f→ (D) ∈ ZL (Y) and (f→ (D)) δ ∈ ΔΓL (Y) by Proposition 3.3. Then f← ((f→ (D)) δ) ∈ ΔΓL (X). Moreover, D ⊆ f← (f→ (D)) ⊆ f← ((f→ (D)) δ) and so Dδ ⊆ (f← ((f→ (D)) δ)) δ = f← ((f→ (D)) δ). Therefore f→ (Dδ) ⊆ f→ (f← ((f→ (D)) δ)) ⊆ (f→ (D)) δ and thus (f→ (Dδ)) δ ⊆ (f→ (D)) δ) δ ⊆ (f→ (D)) δ.
Suppose that (Y, eY) is ZL-complete. Obviously (3) ⇒ (1) since (f→ (D)) δ = ι⊔f→(D) = ι⊔f→(Dδ) = (f→ (Dδ)) δ for all D ∈ ΓL (X). Conversely, let f be a ΔΓL-continuous and D ∈ ΓL (X), then f→ (D) ∈ ZL (Y) and ⊔f→ (D) exists in Y since (Y, eY) is ZL-complete. Hence (f→ (Dδ)) δ = (f→ (D)) δ = ι⊔f→(D) and so ⊔f→ (Dδ) = ⊔ f→ (D) by Proposition 2.8. This implies that (1) ⇒ (3), and hence (1) ⇔ (2) ⇔ (3).
Let (X, eX) be a ΓL-complete fuzzy poset and D ∈ ΓL (X), then ⊔D exists and Dδ = ι⊔D by Proposition 2.8. Suppose that (4) is satisfied, then f is a fuzzy order-preserving and ⊔f→ (D) = f (⊔ D) = ⊔ f→ (ι⊔D) = ⊔ f→ (Dδ). Thus (4) ⇒ (3). As for the proof of (3) ⇒ (1), it is essentially the same as that of the above paragraph. Now suppose that (1) is true, then for any D ∈ ΓL (X) and y, z ∈ Y, one has
and
Thus f (⊔ D) = ⊔ f→ (D). Therefore (1) ⇔ (4).
Remark 4.3. We denote “ΔZL” in the case that ΓL (X) is chosen to be ZL (X). Then a ΔZL-continuous mapping f : X ⟶ Y between ZL-complete fuzzy posets is exactly a Z⊔-continuous mapping by Proposition 4.2 (4). Moreover, A ∈ ΔZL (X) iff A = ↓ A and for any D ∈ ZL (X), sub (D, A) ≤ A (⊔ D) iff A = ↓ A and A is ZL-closed.
Lemma 4.4.Let f : X ⟶ Y be a ΔΓL-continuous mapping between fuzzy posets where (Y, eY) is ZL-complete, and A ∈ LX, then ⊔f→ (A) exists iff ⊔f→ (CΔΓL (A)) exists, and both imply ⊔f→ (A) = ⊔ f→ (CΔΓL (A)).
Proof. It suffices to show that for any y0 ∈ Y is an upper bound of f→ (A) iff y0 is an upper bound of f→ (CΔΓL (A)). It is obvious that every upper bound of f→ (CΔΓL (A)) is also an upper bound of f→ (A) since f→ (A) ⊆ f→ (CΔΓL (A)). Now suppose that y0 ∈ Y is an upper bound of f→ (A). Let A′ (x) = eY (f (x) , y0) ∧ CΔΓL (A) (x) for any x ∈ X. Then y0 is an upper bound of f→ (A′) since
For any x, x′ ∈ X, we have
and
which implies A′ = ↓ A′. Moreover, for any D ∈ ΓL (X), one has
Hence A′ ∈ ΔΓL (X) and thus CΔΓL (A) ⊆ A′. Therefore CΔΓL (A) = A′ and so f→ (CΔΓL (A)) = f→ (A′), which completes the proof.
Proposition 4.5.For any fuzzy poset (X, e), with the fuzzy inclusion order sub is a ZL-complete fuzzy subposet of ΔΓL (X).
Proof. Let and be a ZL-complete fuzzy subposet of ΔΓL (X) with , then , where i1 is the inclusion mapping from Ψ (X) to and is the inclusion mapping from to ΔΓL (X). Moreover, for any A ∈ ΔΓL (X),
where i is the inclusion mapping from Ψ (X) to ΔΓL (X). Hence , which implies that by the arbitrariness of . Therefore is a ZL-complete fuzzy subposet of ΔΓL (X).
By Proposition 4.5, we have that is the smallest ZL-complete fuzzy subposet containing Ψ (X) in ΔΓL (X). Then a natural question is whether has the corresponding universal property. To solve this problem, we give the following conclusions and definitions.
Proposition 4.6.Let (X, e) be a fuzzy poset and be defined by ηX (x) = ιx for any x ∈ X. Then the mapping is ΔΓL-continuous.
Proof. Obviously ηX is a fuzzy order-preserving. By Proposition 4.2 and 4.5, we only need to show that for any D ∈ ΓL (X). Since , exists in . Moreover, any upper bound of is also an upper bound of by . Next, we show is an upper bound of . By Proposition 3.3 and 4.5, we have and
Thus
and
This means that and thus . And because for any , we have
, which implies that Dδ is an upper bound of . This means that the proof completes.
Definition 4.7. For any fuzzy poset (X, eX), a fuzzy subset A of X is called ΔΓL-continuously ⊔-existing (with respect to the fuzzy subset system ZL) if for any ZL-complete poset (Y, eY) and ΔΓL-continuous mapping f : X ⟶ Y, ⊔f→ (A) always exists in Y. For the sake of future discussion, let ZΓL (X) = {A ∈ LX | AisΔΓL - continuously ⊔ - existing andΔΓL - closed}.
It is obvious that all fuzzy ZL-subsets are ΔΓL-continuously ⊔-existing. In particular, we have all fuzzy principal ideals are ΔΓL-continuously ⊔-existing and so Ψ (X) ⊆ ZΓL (X) ⊆ ΔΓL (X). However, a ΔΓL-continuously ⊔-existing fuzzy subset may fail to be a fuzzy ZL-subset in general.
By Lemma 4.4 and Definition 4.7, we have the following result.
Remark 4.8. For any ΔΓL-continuous mapping f : X ⟶ Y between fuzzy posets where (Y, eY) is ZL-complete, A ∈ LX is ΔΓL-continuously ⊔-existing iff CΔΓL (A) is ΔΓL-continuously ⊔-existing.
Proposition 4.9.The fuzzy poset (ZΓL (X) , sub) is a ZL-complete fuzzy subposet of ΔΓL (X).
Proof. Let , then we only need show that is ΔΓL-continuously ⊔-existing since ⊔i→ (D) ∈ ΔΓL (X) is obvious. Let f : X ⟶ Y be a ΔΓL-continuous mapping into a ZL-complete fuzzy poset (Y, eY), then we define by for any A ∈ ZΓL (X) and thus is well defined. By the fuzzy order-preserving of f, it follows that is a fuzzy order-preserving since
for any A, B ∈ ZΓL (X), and thus and exists in Y. Then for any y ∈ Y,
which implies that . Thus exists in Y and by Lemma 4.4. Notice . Hence which implies that exists in Y. Thus is ΔΓL-continuously ⊔-existing. Therefore (ZΓL (X) , sub) is a ZL-complete fuzzy subposet of ΔΓL (X).
Since is the smallest ZL-complete fuzzy poset containing Ψ (X) in ΔΓL (X), by Proposition 4.9. This means that every is ΔΓL-continuously ⊔-existing.
Theorem 4.10.The is universal in the following sense: for any ΔΓL-continuous mapping f : X ⟶ Y into a ZL-complete fuzzy poset (Y, eY) there is a unique Z⊔-continuous mapping such that , i.e., the following diagram commutes:
Proof. Let f : X ⟶ Y be a ΔΓL-continuous mapping into a ZL-complete fuzzy poset (Y, eY). We define by for any . The mapping is well defined since every is ΔΓL-continuously ⊔-existing. We shall show that is Z⊔-continuous. Obviously, is a fuzzy order-preserving by the proof Proposition 4.9. Moreover, for any , we have
The proof for the last equation above is similar to the proof Proposition 4.9. Hence is a Z⊔-continuous mapping. Obviously . Moreover ⊔f→ (ιx) = f (x). In fact, for any y ∈ Y,
and
Therefore . Next, we show that the uniqueness of . Let be a Z⊔-continuous mapping such that f = g ∘ ηX and . Since for all x ∈ X, . If we show that is a ZL-complete fuzzy subposet of , then since is the smallest ZL-complete fuzzy poset containing Ψ (X) in ΔΓL (X) and so , which implies that . In fact, for any , exists in , where i is the inclusion mapping from to . Moreover, since
. By the same way, we can check that , and thus , which implies . Therefore is a ZL-complete fuzzy subposet of . The proof is complete.
Definition 4.11. For a fuzzy poset (X, e), we call is a ZΓL-completion of (X, e).
By Theorem 4.10, we have that the ZΓL-completion has the following universal property: for any ΔΓL-continuous mapping f : X ⟶ Y into a ZL-complete fuzzy poset (Y, eY), there is a unique Z⊔-continuous mapping such that . To better understand the structure of the elements in , we naturally want to know whether is exactly ZΓL (X).
Lemma 4.12.A ∈ LX is ΔΓL-continuously ⊔-existing iff is ΔZL-continuously ⊔-existing in .
Proof. Let be a ΔZL-continuously ⊔-existing fuzzy subset of and f : X ⟶ Y be a ΔΓL-continuous mapping into a ZL-complete fuzzy poset (Y, eY). By Theorem 4.10 and Remark 4.3, there is a unique ΔZL-continuous mapping such that . Since is a ΔZL-continuously ⊔-existing, exists in Y. Then exists in Y, and thus A is ΔΓL-continuously ⊔-existing.
Conversely, let A be ΔΓL-continuously ⊔-existing and be a ΔZL-continuous mapping into a ZL-complete fuzzy poset (Y, eY). We first show that g ∘ ηX is ΔΓL-continuous. In fact, for any B ∈ ΔZL (Y), since g is ΔZL-continuous and ηX is ΔΓL-continuous, we have , and so , which implies g ∘ ηX is ΔΓL-continuous by Proposition 4.2. Then exists in Y and thus is ΔZL-continuously ⊔-existing.
Theorem 4.13.For any fuzzy poset (X, e), .
Proof. We only need to show that , i.e., . In fact, for any A ∈ ZΓL (X), we have that is a ΔZL-continuously ⊔-existing fuzzy subset of by Lemma 4.12. Then is also ΔZL-continuously ⊔-existing by Remark 4.8. Then , and thus exists. Moreover, for any x ∈ X,
Let , then and . Next, we first show that . In fact, for any ,
and for any ,
where is the fuzzy inclusion order on LLX. Then we show that . In fact, for any ,
Hence and , and thus To sum up, we have and so .
By Example 3.7, we have the following examples of ZΓL-completion.
Example 4.14. Let (X, e) be a fuzzy poset.
(1) is exactly the Dedekind-Macneille completion of the fuzzy poset (X, e).
(2) When ΓL (X) = ΦL (X), a mapping f : X ⟶ Y between fuzzy posets (X, e) and (Y, eY) is ΔΦL-continuous iff f is a fuzzy order-preserving. Let IZL (X) = {↓ D | D ∈ ZL (X)}, then Ψ (X) ⊆ IZL (X) ⊆ ΔΦL (X). A fuzzy subset system ZL is union-complete if for any , . In this case, (IZL (X) , sub) is ZL-complete and IZL (X) = ZΦL (X), which implies that IZL (X) is the ZΦL-completion of (X, e).
Conclusion
Fuzzy posets as the generalization of posets have received more and more attention. Just as the completion of posets is a very important topic in the classical poset theory, the completion of fuzzy posets deserves discussion in fuzzy poset theory. In this paper, we focused on the completion of fuzzy posets based on a fuzzy subset system ZL and a fuzzy subset selection ΓL. Firstly, we constructed the ΔΓL-completions ΔΓL (X) of a fuzzy poset (X, e) and showed that it is a join-completeion with universal property. Then in the case that ZL is fuzzy subset-hereditary, we defined the ZΓL-completion of a fuzzy poset (X, e) to be the smallest ZL-complete subposet containing all fuzzy principal ideals in ΔΓL (X). Moreover, in order to discuss the corresponding universal property of the ZΓL-completion, we introduced a special type of fuzzy subsets, called ΔΓL-continuously ⊔-existing subsets. The results show that the ZΓL-completion of a fuzzy poset (X, e) is exactly the set ZΓL (X) of all ΔΓL-continuously ⊔-existing subsets and has the universal property. As a special case, we obtained that the DML (X) and IZL (X) of a fuzzy poset (X, e) are the ZΓL-completion.
Footnotes
Acknowledgement
The authors would like to thank very much for the support of the National Natural Science Foundation of China (No. 11861006).
References
1.
BĕlohlávekR., Fuzzy closure operators, Journal of Mathematical Analysis and Applications262 (2001), 473–489.
2.
BĕlohlávekR., Fuzzy Relational Systems, Foundations and Principles, Kluwer Academic, Plenum Publishers, New York, 2002.
3.
BĕlohlávekR., Some properties of residuated lattices, Czechoslovak Mathematical Journal53 (2003), 161–171.
4.
BĕlohlávekR., Concept lattices and order in fuzzy logic, Annals of Pure and Applied Logic128 (2004), 277–298.
5.
ErnéM. and PalkoV., Uniform ideal completion, Mathematica Slovaca48(4) (1998), 327–335.
6.
FanL., A new approach to quantitative domain theory, Electronic Notes in Theoretical Computer Science45 (2001), 77–87.
7.
FrinkO., Ideals in partially ordered sets, The American Mathematical Monthly61(4) (1954), 223–234.
8.
GierzG., HofmannK.H., KeimelK., LawsonJ.D., MisloveM. and ScottD.S., Continuous Lattices and Domains, Cambridge University Press, 2003.
9.
GoguenJ.A., L-fuzzy sets, Journal of Mathematical Analysis and Applications18 (1967), 145–174.
10.
HájekP., Mathematics of Fuzzy Logic, Kluwer Academic Publishers, Dordrecht, 1998.
11.
JinQ., LiL.Q. and LangG.M., p-regularity and p-regular modification in T-convergence spaces, Mathematics7 (4) (2019), 370.
12.
KeimelK. and LawsonJ.D., D-completions and the d-topology, Annals of Pure and Applied Logic159 (2009), 292–306.
13.
LaiH.L. and ZhangD.X., Complete and directed complete Ω-categories, Theoretical Computer Science388 (2007), 1–24.
14.
MaN.N. and ZhaoB., Some results on fuzzy ZL-continuous (algebraic) poset, Soft Computing22 (2018), 4549–4559.
15.
MacNeilleH.M., Partially ordered sets, Transactions of the American Mathematical Society42 (1937), 416–460.
16.
RaoS.P., Theoretical Research into Bases of Fuzzy Domains and its Generalization, PhD Thesis, College of Mathematics and Econometrics, Hunan University, Changsha, 2014.
17.
SuS.H. and QiL., The relationship between Δ1-completions and formal L-contexts over an L-ordered set, Procedia Computer Science102 (2016), 18–25.
18.
WagnerK.R., Solving Recursive Domain Equations with Enriched Categories, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Technical Repor CMU-CS-94-159, July 1994.
19.
WangK.Y. and ZhaoB., Join-completions of L-ordered sets, Fuzzy Sets and Systems199 (2012), 92–107.
20.
XieW.X., ZhangQ.Y. and FanL., The Dedekind-MacNeille completions for fuzzy posets, Fuzzy Sets and Systems160 (2009), 2292–2316.
21.
YaoW., Quantitative domains via fuzzy sets: Part I: Continuity of fuzzy directed complete posets, Fuzzy Sets and Systems161 (2010), 973–987.
22.
YaoW. and ShiF.G., Quantitative domains via fuzzy sets: Part II: fuzzy Scott topology on fuzzy directed complete posets, Fuzzy Sets and Systems161 (2011), 1–21.
23.
ZhangQ.Y. and FanL., Continuity in quantitative domains, Fuzzy Sets and Systems154 (2005), 118–131.
24.
ZhangZ.X. and LiQ.G., A generalization of the Dedekind-MacNeille completion, Semigroup Forum96 (2018), 553–564.
25.
ZhangZ.X. and LiQ.G., A uniform approach to completions of posets, Journal of Logical and Algebraic Methods in Programming106 (2019), 107–116.
26.
ZhangZ.X., LiQ.G. and ZhangN., A unified method for completions of posets and closure spaces, Soft Computing23 (2019), 10699–10708.
27.
ZhaoD.S. and FanH.T., Dcpo-completion of posets, Theoretical Computer Science411 (2010), 2167–2173.
28.
ZhaoD.S., Closure spaces and completions of posets, Semigroup Forum90 (2015), 545–555.
29.
ZhaoF.F., LiL.Q., SunS.B. and JinQ., Rough approximation operators based on quantale-valued fuzzy generalized neighborhood systems, Iranian Journal of Fuzzy Systems16(6) (2019), 53–63.
30.
ZhaoN.N., Fuzzy Z-domain and Some Properties of Relevant Categories, MA Thesis, College of Mathematics and Information Science, Shaanxi Normal University, Xian, 2011.