The Intrinsic Characterization of a Fuzzy Consistently Connected Domain

: The concepts of a fuzzy connected set (fc set) and a fuzzy consistently connected set (fcc set) are introduced on fuzzy posets, along with a discussion of their basic properties. Inspired by some equivalent conditions of crisp connected sets, the characterizations of the fc sets are given, and we also explore fuzzy completeness and fuzzy compactness in addition to defining a new fuzzy way-below relation based on fcc complete sets. Using this relationship as a basis, the fcc domain is also provided and studied, and its equivalent characterizations are obtained. In summary, we develop a method to establish fcc completeness from a continuous poset


Introduction and Related Work
In the 1960s, the birth of fuzzy mathematics [1] and the establishment of continuous lattices [2] aroused the research interest of a large number of scholars.Following its development, the theory of continuous lattices was successfully promoted to the theory of continuous domain by G Gierz [3].References [4][5][6] innovatively combined domain theory with fuzzy mathematics, with Zhang Qiye and Fan Lei introducing the concept of fuzzy partial order, which, in turn, led to the emergence of fuzzy domain theory.A Chaudhuri and P Das [7] introduced a new concept of fuzzy set connectivity called cs-connectivity.This concept is different from other connectivity concepts, and they found that cs-connectivity is not equivalent to these existing definitions of connectivity; they examined the validity of the standard results under this new concept of connectivity.In references [8,9], the concept of connected sets was introduced to broaden the scope of continuous partial order theory, and the concept of the connected continuous domain was introduced using the concept of connected sets, with fruitful results obtained by Shang Yun and Zhao Bin, they introduce and explore the concept of a consistently connected continuous domain, and extend the application scope of continuous poset theory by exploiting the characteristics of connected sets, solved the limitations of continuous poset theory in the treatment of the real number set and the natural number set, and to characterize it through the properties of the principal ideal and connected closed sets, they also study the directional completeness of consistently connected complete posets and obtains good theoretical results.In [10][11][12], Tang Zhaoyong introduced and examined the connectivity on partially ordered sets from various perspectives using step sets, resulting in a series of significant findings.In [13], Tang Zhaoyong and Xu Luoshan deeply explore the connectivity and local connectivity of posets from the perspective of order and topology, especially the properties of multiple intrinsic topologies (such as Alexandrov topology and Scott topology); they try to prove the equivalence of the order connectivity of posets and its intrinsic topology and to show the properties of local connectivity.Moreover, by constructing counterexamples, they also reveal that the connectivity of the lower topology does not necessarily guarantee the sequential connectivity of the poset itself.In [14,15], they introduce and study the concept of connectivity, especially to explore the step set.They also explore the construction of connected branches and show that posets can be uniquely decomposed into the non-intersection union of these connected branches.Furthermore, they show that the connected relations of the posets constitute an equivalence relation.These results provide a new tool and theoretical framework for understanding and operating posets.Reference [16] examines and characterizes the notion of the prime neutrosophic ideal and prime neutrosophic filter.The structure of the neutrosophic open-set lattice on a topology generated by a neutrosophic relation is described in it.They have defined the concepts of neutrosophic ideals and neutrosophic filters on that lattice in terms of their level sets and meet and join operations.In addition, we have examined and defined the concepts of prime neutrosophic filters and ideals as fascinating subsets of neutrosophic ideals and filters.This work mostly discussed neutrosophic ideals and neutrosophic filters on the lattice structure of neutrosophic open sets.Reference [17] explores the fuzzy topology induced by fuzzy relations, extending classical concepts, and establishes necessary and sufficient conditions for its generation, along with characterizations involving fuzzy interval orders, preorders, and sequential fuzzy topologies.Furthermore, the fuzzy bi-topological space generated by the fuzzy relations is explored.
The research motivation for exploring the fuzzy connected set lies in the desire to expand the application of the continuous poset theory.By defining a novel fuzzy way-below relation on the fcc complete set, we aim to deepen our understanding of this structure and enhance its utility.Furthermore, the introduction and investigation of the concept of fcc continuous domain serve to enrich the theoretical framework and broaden its potential applications.This line of inquiry offers significant insights into the properties and characteristics of fc sets, thereby contributing to the advancement of the field of fuzzy set theory and its applications.
However, in fuzzy domain theory, there is no concept of connected sets.Thus, we introduce the concepts of fuzzy connected sets and fuzzy consistently connected sets on fuzzy posets, and their basic properties are discussed.In the third section of this paper, a new fuzzy way-below relationship is defined on fuzzy consistently connected complete posets, which allows for the exploration of the fuzzy consistently connected continuous domain.In addition, its equivalent characterizations are determined.

Preliminaries
Below, we present some important terms and definitions used in this paper.Here, we describe the definitions of fuzzy sets, domain theory, and consistently connected theory.
, the membership function, gives the grade of membership of each element x i ∈ X in A.

Definition 2 ([1]
).Let X be a set, L be a complete lattice, and L X be all mappings from X to L. Each A ∈ L X is called a fuzzy subset of X.For A ⊆ X, χ A ∈ L X is the characteristic function of A, defined as where 0 and 1 represent the least and great elements of L.

Definition 3 ([3]
).A poset is said to be complete with respect to directed sets if every directed subset has a sup.A directed complete poset is abbreviated as a dcpo.

Definition 4 ([3]
).Let L be a poset.We say that x is way − below y, in symbols x ≪ y if for all directed subsets D ⊆ L for which supD exists, the relation y ≤ supD always implies the existence of d ∈ D with x ≤ d.An element satisfying x ≪ x is said to be compact or isolated f rom below.

Definition 5 ([3]
).A poset L is deemed continuous if for all x ∈ L, the set ⇓ x = {u ∈ L : u ≪ x} is directed and x = sup{u ∈ L : u ≪ x}.A dcpo that is continuous as a poset is referred to as a domain.

Definition 6 ([4]
).Let X be a set and e : X × X → L be a mapping.Then, (X, e) is deemed a fuzzy poset if e satisfies the following: (1) ∀x ∈ X, e(x, x) = 1; (2) ∀x, y, z ∈ X, e(x, y) ∧ e(y, z) ≤ e(x, z); Then, e is referred to as a fuzzy partial order in X.

Definition 7 ([6]
).Let f : X → Y be a mapping from a set X to a fuzzy poset (Y, e Y ).Define f → :

Definition 8 ([8]
).Let X be a poset.∅ ̸ = B ⊆ X. B is considered connected if for all x, y ∈ B, there exists x = x 1 , x 2 , • • •, x n = y such that x i ∈ B, and x i , x i+1 are comparable.If B is connected and x, y ∈ B, then x and y are considered connected in B.

Definition 9 ([4]
).Let (X, e) be a fuzzy poset, x 0 ∈ X and A ∈ L X .x 0 is said to be the supremum (resp.infimum) of A, written as x 0 = ⊔A (resp. Definition 11 ([5]).Let (X, e) be a fuzzy poset.For all Definition 12 ([5]).Let (X, e) be a fuzzy poset.For all D ∈ L X , D is a fuzzy directed subset if

z).
A fuzzy direct subset I ∈ L X is considered a fuzzy ideal if it is a fuzzy lower set.

Definition 13 ([5]
).Let (X, e) be a fuzzy poset.For all D ∈ L X , D is considered a fuzzy co-directed subset if

y).
A fuzzy co-direct subset I ∈ L X is considered a fuzzy filter if it is a fuzzy upper set.
(1) Both the directed set and the co-directed set are connected sets.
(2) The image of a connected set under a homomorphic mapping is a connected set.
(3) Both the totally ordered set and the one-point set are connected sets.
Definition 16 ([9]).Let X be a poset.X is a consistently connected complete poset if, for all consistently connected sets D ⊆ X, ⊔D exists.
Definition 17 ([9]).Let X be a consistently connected complete poset.The consistently connected way-below relation ≪ c of X is defined as follows: for x, y ∈ X, x is said to be compatible when less than or equal to y, in symbols x ≪ c y if for all consistently connected set D, y ≤ supD implies x ≤ d for some d ∈ D. We write ⇓ c x = {u ∈ X : u ≪ c x}.
Definition 18 ([9]).Let X be a consistently connected complete poset.X is considered a consistently connected domain if (1) ∀x ∈ X, ⇓ c x is the consistently connected set in X; (2) ∀x ∈ X, x = sup ⇓ c x.

Fuzzy Connected Sets and Fuzzy Consistently Connected Sets
In order to extend the connected sets on posets to fuzzy domain theory in this section, an equivalent definition in alternative form of connected sets is first provided.
Definition 20.Let (X, e) be a fuzzy poset.For every D ∈ L X , the fuzzy subset D is considered a fuzzy connected set if (1) ∨ x∈X D(x) = 1; (2) For all a, b ∈ X, there exists D(a A fuzzy connected set is abbreviated as an fc set.Lemma 1.Let (X, ≤) be a poset, and it is considered as a fuzzy poset (X, e), L = 2.Then, for all cases, D ∈ X is a connected set in (X, ≤) if and only if the characteristic function χ D is an fc set in (X, e).
Proof.⇒ Let D be a connected set.
(2) Because D is a connected set, then, for every a, b ∈ D, there exists and for every i, x i and x i+1 are comparable; that is, for every i, Then, Using Definition 2, we obtain In addition, for every i, From this, for every i, we obtain Hence, the character function χ D is an fc set in (X, e).⇐ Let χ D be an fc set in (X, e).
(2) Because χ D is an fc set in (X, e), then for all a, b ∈ D, there exists Then, we have which means that for every i, x i and x i+1 are comparable, and hence, D ∈ X is a connected set in (X, ≤).
Remark 2. A fuzzy connected set may not necessarily be a fuzzy directed (co-directed) set.
Example 1.Let (X, ≤) be a poset of Figure 1.Consider it as a fuzzy poset (X, e), L = 2, D = {a, b, c, d}.Then, D is a connected subset of X, and χ D is an fc subset, but χ D is not a fuzzy directed (co-directed) subset of (X, e).Then, we obtain Thus, D is an fc set.Proposition 2. Let (X, ≤) be a poset, and it is considered as a fuzzy poset (X, e), L = 2.For all D ∈ X, χ D is an fc subset if χ D is a fuzzy directed (co-directed) subset.
Proof.It can be seen from the assumed conditions that there exists x 0 ∈ X such that χ D (x 0 ) = 1, and based on Proposition 1, the conclusion is true.Definition 21.Let (X, e) be a fuzzy poset, and a fuzzy subset D ⊆ L X .D is considered a fuzzy consistently connected set if (1) D is a fuzzy connected set; (2) there exists p ∈ X such that D ⊆↓ p (↓ p ∈ L X , ∀x ∈ X, ↓ p(x) = e(x, p)).A fuzzy consistently connected set is abbreviated as an fcc set.
All fcc sets in the fuzzy poset (X, e) are denoted by C F (X), and D is an fcc ideal if D is a fuzzy lower set.All fcc ideals in the fuzzy poset (X, e) are denoted by CI F (X). Definition 22.Let (X, e) be a fuzzy poset.(X, e) is an fcc complete poset if for all fcc subset D, ⊔D exists.Proposition 3. Let (X, ≤) be a poset, and consider it as a fuzzy poset (X, e), L = 2. (X, ≤) is a consistently connected complete set if and only if (X, e) is an fcc complete poset.
Proof.Suppose that (X, ≤) is a consistently connected complete set.For all D is an fcc set, let A = {x ∈ X : D(x) = 1}, then A ⊆ X.According to Lemma 1, A is consistently connected, then there exists x 0 ∈ X such that x 0 = supA, and we need to prove that x 0 = ⊔D.
Conversely, suppose (X, e) is an fcc complete set and A is a consistently connected set.Then, according to Lemma 1, χ A is fcc, and (X, e) is fcc complete; as such, there exists an x 1 ∈ X such that x 1 = ⊔χ A , and we need to demonstrate that x 1 = ⊔A. ( (2) Suppose y ∈ X such that for all x ∈ A, x ≤ y, that is, Therefore, e(x 1 , y) ≥ ∧ x∈X (χ A (x) → e(x, y)) = 1, and hence x 1 ≤ y.So, we have x 1 = supA.

Fcc Way-Below and Fcc Domain
In this section, we give definitions of fcc way-below and a fcc continuous set, as well as equivalent characterizations of fcc domain and a discussion of related properties.Definition 23.Let (X, e) be an fcc directed complete poset.For all y ∈ X, ⇓ FC y ∈ L X .This is deemed fcc way-below if ∀x ∈ X, ⇓ FC y(x) = ∧ I∈CI F (X) (e(y, ⊔I) → I(x)).
From Definition 21, we plot Figure 2 as an elaborated illustration of the Definition 23.X is a fuzzy poset, and the side length is unit length 1, where the projection coordinate value of any point is the matching degree of membership of x and y with respect to X. D is an fcc set, all the internal points have connectivity, and use * to represent supD.As p is a point in the unit cube, D is below the projection coordinates of p, which satisfies the consistently connectivity of D. Definition 24.Let (X, e) be an fcc complete set.(X, e) is considered an fcc continuous set if ∀x ∈ X, ⇓ FC x ∈ CI F (X) and x = ⊔ ⇓ FC x.Definition 25.An fcc directed complete poset that is an fcc continuous set is an f cc domain.
Definition 26.Let (X, e) be an fcc complete set.x is the fcc compact element in X if ⇓ FC x(x) = 1.All fcc compact elements in X are denoted K FC (X).
Definition 27.Let (X, e) be an fcc complete set, x ∈ X. Define a mapping k x : X → L: X is considered an fcc algebraic poset if k x is an fcc subset of X and ⊔k x = x.
From Example 1.9 of [9] and Proposition 3, we have the following examples: Example 2. For the poset R of real numbers, (R, e ≤ ) is an fcc domain.
Example 3.For the poset N of natural numbers, (N, e ≤ ) is a fuzzy algebraic domain.

Example 4.
Let A be an fcc domain.Then, the principal ideal of A is an fcc domain.
Proof.On the one hand, according to Proposition 4, we have ∨ z∈X ⇓ FC z(x)∧ ⇓ FC y(z) ≤⇓ FC y(x).On the other hand, we simply need to prove that ⇓ FC y(x) ≤ ∨ z∈X ⇓ FC z(x)∧ ⇓ FC y(z).Suppose D ∈ L X , for all a ∈ X, D(a) = ∨ z∈X ⇓ FC z(a)∧ ⇓ FC y(z), we shall prove that ⇓ FC y(x) ≤ D(x).
Firstly, D(x) is an fcc ideal.(1) For all x ∈ X, ⇓ FC x is an fcc ideal.
(2) For all a, b ∈ X, every fcc way-below lower set is an fcc ideal in fcc domain, so that it is fuzzy consistently connected, according to Definition 20, There exists c ∈ X such that Furthermore, there exists d ∈ X such that Therefore, D is a fuzzy lower set.(4) For all x ∈ X, D(x) ≤⇓ FC y(x) ≤↓ y(x), then we obtain D ≤↓ y, and thus D is fuzzy consistent.
In fact, for all a ∈ X,  Theorem 2. Let (X, e) be an fcc complete poset.Then, (X, e) is an fcc domain if and only if (⇓ FC , ⊔) is a fuzzy Galois adjunction between (X, e) and (CI F (X), Sub X ).

Conclusions
We discuss fuzzy connectivity under a fuzzy partial order and provide the equivalence characterization of the connected set along with the definition of the fc set.A set is considered a connected poset if and only if its characterization functions are fuzzy-connected.The definition of the fcc set and its equivalent characterizations are obtained.In the last section, the definitions of fcc way-below and fcc domain are given, and the equivalence characterizations of fcc continuous poset and fcc complete set are then discussed.Finally, a method for deriving fcc completeness from an fcc continuous poset is established.
In this paper, we deeply explore the fuzzy connectivity under the fuzzy partial order and provide the equivalent characterization of the connected set by defining the fuzzy connected set (fc set).In the framework of fuzzy mathematics, connectivity is an important concept that helps us to understand and analyze the properties of complex mathematics structures.First, we define the connectivity of a set under a fuzzy partial order.Specifically, a set is considered to be a connected poset if and only if its characteristic function is fuzzy connected.This means that, under the fuzzy partial order, there is a continuous and uninterrupted relationship between the elements in the set, which makes the whole set present a holistic structure.In order to further understand the concept of a fuzzy connected set, we further explore the definition of the fuzzy consistently connected set (fcc set) and its equivalent characterization.The fcc set is a special set of fuzzy connectivity that satisfies more stringent conditions to enable a better description of certain specific types of fuzzy structure.Through the equivalent characterization of the fcc set, we can more clearly recognize its properties and characteristics, providing a basis for subsequent research and application.In the final section of this article, we introduce the concept of fcc way-below relation and fcc domain and discuss the equivalent characterization of fcc continuous posets and fcc complete sets.These concepts provide us with a new perspective to examine the application of fuzzy connectivity in complex systems.In particular, we propose a method to derive fcc completeness from the fcc continuous poset, which helps us to better understand and apply the theory of fuzzy consistent connectivity.Overall, this paper explores, in depth, the related concepts and properties of fuzzy consistent connectivity in the framework of fuzzy partial order.By introducing the concepts of the fc set, fcc set, fcc completed set, and fcc domain, we provide new ideas and methods for the study of fuzzy consistent connectivity.These results not only help us to have a deeper understanding of the intrinsic structure of fuzzy mathematics and complex mathematic structures but also provide strong support for subsequent research and applications.
It is worth mentioning that the fuzzy connectivity theory explored in this paper has broad prospects in practical applications.For example, in the fields of image processing, social network analysis, data mining, etc., fuzzy connectivity can be used to describe connected regions in an image, connected subgraphs in a social network, and connected clusters in a data set.Through the analysis and utilization of these connected structures, we can better understand and exploit the inherent laws and properties of these complex structures.Moreover, with the continuous development of fuzzy mathematics and complex structures, we believe that fuzzy connectivity theory will be more widely applied and developed.In the future, we can further explore the combination of fuzzy connectivity and other mathematical tools, such as fuzzy logic, fuzzy clustering, etc., to form a more perfect theoretical system and methodology.At the same time, we can also focus on the application cases of fuzzy connectivity in practical problems to promote its in-depth development and application in various fields.For example, we can take the fuzzy poset as the starting point and consider the connected proposition of its intrinsic topology.In conclusion, this paper explores fuzzy connectivity in the framework of a fuzzy partial order and proposes a series of new concepts and methods.These achievements not only enrich the theoretical system of fuzzy mathematics but also provide strong support for subsequent research and application.We believe that in future studies, fuzzy connectivity theory and fuzzy consistently connected theory will play an increasingly important role in providing us with new ideas and methods to solve complex problems.

Figure 1 .Proposition 1 .
Figure 1.Graph of example 1. Proposition 1.Let (X, e) be a fuzzy poset, and a fuzzy directed (co-directed) subset D ⊆ L X .Then, D is a fuzzy connected if there exists a point x 0 ∈ X such that D(x 0 ) = 1.Proof.It follows from D being fuzzy directed that ∨D(x) = 1.Since D is a fuzzy directed set, by the condition that for all a, b ∈ X, D(a) ∧ D(b) ≤ ∨ z∈X D(z) ∧ e(a, z) ∧ e(b, z), then there exists x 0 ∈ X.Let x a = a, x b = b, such that D(a) = D(x a ), D(x 0 ) = 1, D(x b ) = D(b).Then, we obtain

Figure 2 .
Figure 2. Graph of FC way-below relation.