(L,M)-fuzzy convex structures
β β thanks: The project is supported by the National Natural Science Foundation of China (11371002) and Specialized
Research Fund for the Doctoral Program of Higher Education (20131101110048).
Fu-Gui Shi1, Zhen-Yu Xiu2111Corresponding author. Email:[email protected]
1* School of Mathematics and Statistics, Beijing Institute of Technology,
Beijing 100081, China
2College of Applied Mathematics, Chengdu University of Information Technology,
Chengdu 610000, China
Abstract
In this paper,
the notion of (L,M)-fuzzy convex structures is
introduced. It is a
generalization of L-convex structures and M-fuzzifying convex structures.
In our definition of (L,M)-fuzzy convex structures, each L-fuzzy
subset can be regarded as an L-convex set to some degree. The notion of convexity preserving functions is also generalized to lattice-valued case. Moreover, under the framework of (L,M)-fuzzy convex structures, the concepts of quotient structures, substructures and products are presented and their fundamental properties are discussed. Finally, we create a functor Ο from MYCS
to LMCS and show that
there exists an adjunction
between MYCS and LMCS, where MYCS and LMCS denote the category of M-fuzzifying convex structures,
and the category of (L,M)-fuzzy convex structures,
respectively.
Keywords:
(L,M)-fuzzy convex structure,
(L,M)-fuzzy convexity preserving function, quotient structures, substructures,
products
1 Introduction and preliminaries
Convexity theory has been accepted to be of increasing importance in recent years
in the study of extremum problems in many areas of applied mathematics. The
concept of convexity which was mainly defined and studied in Rn in the pioneering works of Newton, Minkowski and others as described in [2], now finds a place in several other mathematical structures such as vector spaces, posets, lattices, metric spaces, graphs and median algebras.
This development is motivated by not only the need for an abstract theory of convexity generalizing the classical theorems in Rn due to Helly, Caratheodory etc; but also by the necessity to unify geometric aspects of all these mathematical structures. Abstract convexity theory is a branch of mathematics dealing with set-theoretic structures satisfying axioms similar to that usual convex sets fulfill. Here, by βusual convex setsβ, we mean convex sets in real linear spaces. In a general setting, the axioms of abstract convexity
are the following:
(1) The empty set and the universe set are convex;
(2) The intersection of a nonempty collection of convex sets is convex;
(3) The union of a chain of convex sets is convex.
Clearly, usual convex sets have properties (1)-(3), but there are many other collections of sets, coming from various types of mathematical objects, that satisfy conditions (1)-(3), such as convexities in lattices and in Boolean algebras [26, 27], convexities in metric spaces and graphs [12, 19]. Also, convex structures appeared naturally in topology, especially in the theory of supercompact spaces [14].
The notion of a fuzzy subset was introduced by Zadeh [31] and then fuzzy subsets have been applied to various branches of mathematics.
In 1994, Rosa generalized the notion of a convex structure to a fuzzy convex structure (X,C) in [17, 18]
and C was defined as a crisp family of fuzzy subsets of a set X satisfying certain axioms. For convenience, we call this fuzzy convex structure an I-convex structure.
In 2009, Maruyama generalized I-convex structures
to L-convex structures in [13], where L is a completely distributive lattice. In 2014, Shi and Xiu [23] introduced a new approach to the fuzzification of convex structures, which is called an M-fuzzifying convex structure.
An M-fuzzifying convex structure is a pair (X,C), where C is a mapping from 2X to M satisfying three axioms. Recently, Shi and Li [22] generalized the notion of restricted hull operators in classical convex spaces to M-fuzzifying restricted hull operators and used it to characterize M-fuzzifying convex structures. Pang and Shi [16] introduced several types of L-convex spaces, including stratified L-convex spaces, convex-generated L-convex spaces, weakly induced L-convex spaces and induced L-convex spaces and discussed their relations from a categorical aspect.
In this paper, based on the idea of [10] and [24], combining L-convex structures and M-fuzzifying convex structures and based on complete distributive lattices L and M,
we present
a more general approach to the fuzzification of
convex structures. More specifically,
we
define
an (L,M)-fuzzy convexity on a nonempty set X by
means of a mapping C:LXβM satisfying three
axioms. It is a
generalization of L-convex structures and M-fuzzifying convex structures. Each L-fuzzy subset of X can be regarded as an
L-convex set to some degree.
Throughout this paper, unless otherwise stated, both L and M denote complete distributive lattices, I=[0,1], 2={0,1} and X is a nonempty
set. LX is the set of all L-fuzzy sets (or L-sets for short)
on X. We often do not distinguish a crisp subset A of X and
its characteristic function ΟAβ. The smallest element and the largest element in LX are denoted by Οβ
β and ΟXβ, respectively. The smallest element and the
largest element in M(L) are denoted by β₯Mβ(β₯Lβ) and β€Mβ(β€Lβ),
respectively. We also adopt the convention that ββ
=β€Mβ.
The binary relation βΊ in M is defined as follows: for
a,bβM, aβΊb if and only if for every subset DβM, the relation bβ€supD always implies the existence of
dβD with aβ€d [4]. {aβM:aβΊb}
is called the greatest minimal family of b in the sense of
[28], denoted by Ξ²(b).
Moreover, 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 β§Dβ€a always implies the existence of
dβD with dβ€b. {bβM:aβΊopb}
is called the greatest maximal family of a in the sense of
[28], denoted by Ξ±(a).
In a completely
distributive lattice M, there exist Ξ±(b) and Ξ²(b) for
each bβM, and b=βΞ²(b)=βΞ±(b) (see
[28]).
For aβL and AβLX, we use the
following notations:
(1) A[a]β={xβX:aβ€A(x)}.
(2) A[a]={xβX:aξ βΞ±(A(x))}.
(3) A(a)β={xβX:aβΞ²(A(x))}.
Some properties of these cut sets can be found in
[7, 15, 20, 21].
Let f:XβY be a mapping. Define
fLββ:LXβLY and
fLββ:LYβLX by
fLββ(A)(y)=f(x)=yββA(x) for AβLX
and yβY, and fLββ(B)=Bβf for BβLY,
respectively.
Theorem 1.1** ([28]).**
For {aiβ:iβΞ©}βM,
- (1)
Ξ±(iβΞ©ββaiβ)=iβΞ©ββΞ±(aiβ), i.e.,
Ξ± is a βββ mapping.
2. (2)
Ξ²(iβΞ©ββaiβ)=iβΞ©ββΞ²(aiβ), i.e.,
Ξ² is a βββ mapping.
Theorem 1.2** ([7, 21]).**
*For each
L-fuzzy set A in LX, we have:
(1) A=aβLββ(aβ§A[a]β)=aβLββ(aβ¨A[a]). (2) βaβL, A[a]β=bβΞ²(a)ββA[b]β=bβΞ²(a)ββA(b)β.
(3) βaβL, A[a]=aβΞ±(b)ββA[b].Β Β Β Β Β Β Β Β Β Β Β Β (4) βaβL, A(a)β=aβΞ²(b)ββA[b]β.*
Theorem 1.3** ([20]).**
*For a family of L-fuzzy sets {Aiβ:iβΞ©} in LX and aβL, we have:
(1) (iβΞ©ββAiβ)[a]β=iβΞ©ββ(Aiβ)[a]β.
(2) (iβΞ©ββAiβ)(a)β=iβΞ©ββ(Aiβ)(a)β.
(3) (iβΞ©ββAiβ)[a]=iβΞ©ββ(Aiβ)[a].*
Definition 1.4** ([26]).**
A subset C of 2X is called
a convexity if it satisfies the following conditions:
(C1)
β
,XβC;
(C2)
if {Aiβ:iβΞ©}βC is nonempty,
then iβΞ©ββAiββC;
(C3)
if {Aiβ:iβΞ©}βC is nonempty and totally ordered by inclusion, then
iβΞ©ββAiββC.
The pair (X,C) is calld a convex structure and
the elements in C are called convex sets.
Definition 1.5** ([13]).**
For a nonempty set X and a subset C of LX, C is called
an L-convexity if it satisfies the following conditions:
(LC1)
Οβ
β,ΟXββC;
(LC2)
if {Aiβ:iβΞ©}βC is nonempty,
then iβΞ©ββAiββC;
(LC3)
if {Aiβ:iβΞ©}βC is nonempty and totally ordered by inclusion, then
iβΞ©ββAiββC.
If C is an L-convexity on X, then the pair (X,C) is called an L-convex structure. When L=2, an L-convexity is exactly an I-convex structure in [17, 18].
Definition 1.6** ([23]).**
A mapping C:2XβM is called an M-fuzzifying convexity
on X
if it satisfies the following conditions:
(MYC1)
C(β
)=C(X)=β€Mβ;
(MYC2)
if {Aiβ:iβΞ©}β2X is nonempty, then
C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ);
(MYC3)
if {Aiβ:iβΞ©}β2X is
nonempty and totally ordered by inclusion, then C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ).
If C is an M-fuzzifying convexity on X, then the pair (X,C) is called an M-fuzzifying convex structure.
Theorem 1.7** ([23]).**
A mapping C:2XβM is an M-fuzzifying
convexity if and only if for each aβM\{β₯Mβ}, C[a]β is a convexity.
Definition 1.8** ([23]).**
Let Ο:2XβM be a mapping. The M-fuzzifying convex structure (X,C) generated by Ο is given by
[TABLE]
where G denotes all the M-fuzzifying convexities on X. Then Ο is called a subbase of the M-fuzzifying convexity C. Alternatively, we say that Ο generates the convexity CΟβ.
Definition 1.9** ([1]).**
Let L be a lattice and
A a fuzzy subset of L. Then A is called a fuzzy sublattice of L if for all x,yβL,
(i) A(xβ§y)β₯A(x)β§A(y),
(ii) A(xβ¨y)β₯A(x)β§A(y).
A fuzzy sublattice A is said to be fuzzy convex if for every interval [a,b]βL
and for all xβ[a,b], A(x)β₯A(a)β§A(b).
Definition 1.10** ([2]).**
Let G be a group. A fuzzy subset Ξ» of G is said to be a fuzzy
subgroup if
(1) Ξ»(xy)β₯Ξ»(x)β§Ξ»(y),
(2) Ξ»(xβ1)β₯Ξ»(x).
Let G be an ordered group. A fuzzy subgroup Ξ» of G is said to be a
fuzzy convex subgroup if for every interval [a,b]βG
and for all xβ[a,b], we have Ξ»(x)β₯Ξ»(a)β§Ξ»(b).
2 (L,M)-fuzzy convex structures
In this section, combining the concepts of L-convex structures and M-fuzzifying convex structures, we introduce a general approach to the fuzzification of
convex structures as follows.
Definition 2.1**.**
A mapping C:LXβM
is called an (L,M)-fuzzy convexity on X if it satisfies the
following three conditions:
(LMC1)
C(Οβ
β)=C(ΟXβ)=β€Mβ;
(LMC2)
if {Aiβ:iβΞ©}βLX is nonempty, then
C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ);
(LMC3)
if {Aiβ:iβΞ©}βLX is nonempty and totally ordered by inclusion, then C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ).
If C is an (L,M)-fuzzy convexity, then (X,C)
is called an (L,M)-fuzzy convex structure.
An
(L,2)-fuzzy convex structure is an
L-convex structure. An
(I,2)-fuzzy convex structure can be viewed as an I- convex structure.
A (2,M)-fuzzy convex structure is
an M-fuzzifying convex structure. A crisp convex structure in [26]
can be regarded as a (2,2)-fuzzy convex structure.
If C is an (L,M)-fuzzy convexity, then C(A)
can be regarded as the degree to which A is an L-convex set.
Next we give some examples of (L,M)-fuzzy convex structures, L-convex structures and M-fuzzifying convex structures, respectively.
Example 2.2**.**
Let a mapping T:LXβM be an (L,M)-fuzzy topology in [10, 24]. If it satisfies the following conditions:
(S)
β{Ajβ}jβJββLX, T(βjβJβAjβ)β₯βjβJβT(Ajβ),
then T is called a saturated (L,M)-fuzzy topology, and (X,T) is called an Alexandroff (L,M)-fuzzy topological space.
We can see that an Alexandroff (L,M)-fuzzy topological space (X,T) is an (L,M)-fuzzy convex structure.
When L=2 and M=I, an Alexandroff (L,M)-fuzzy topological space (X,T) is an Alexandroff fuzzifying topological space in [6, 29] and it is an example of M-fuzzifying convex structures.
Example 2.3** ([5]).**
An I-fuzzified set of all upper sets of a fuzzy preordered set (X,R) is a map β(R):IXβI defined by
[TABLE]
For a given fuzzy preorder R on X, β(R), the I-fuzzified set of all upper sets of (X,R) has the following properties: for all FβIX, U,VβIX and Ξ»β[0,1],
(i) β(R)(Ξ»)=1 for every constant mapping Ξ» from X to [0,1];
(ii) ββ(R)(F)β€β(R)(βF)
where β(R)(F)={β(R)(U)β£UβF};
(iii)
ββ(R)(F)β€β(R)(βF).
We can see that β(R) satisfies (LMC1)-(LMC3) and then
(X,β(R)) is an (L,M)-fuzzy convex structure, where M=L=I.
Example 2.4**.**
Define a mapping C:LRnβM by
[TABLE]
where the binary function β is defined as follows: for a,b,cβL,
aβb=β{cβL:aβ§cβ€b}.
Then (X,C) is an (L,M)-fuzzy convex structure. Next we show that C satisfies (LMC1)-(LMC3).
(LMC1) Clearly, C(Οβ
β)=C(ΟRnβ)=β€Mβ.
(LMC2) For any nonempty set {Aiβ:iβΞ©}βLRn, we have
[TABLE]
The proof of (LMC3) is similar to that of (LMC2) and is omitted.
When M=2, we obtain the following example.
Example 2.5** ([13]).**
An L-fuzzy set ΞΌ on Rn
is an L-fuzzy convex set on Rn
iff
ΞΌ(rx+(1βr)y)β₯ΞΌ(x)β§ΞΌ(y)
for any x, yβRn
and for any rβ[0,1]. CLβ
denotes the set of all L-fuzzy convex sets on Rn. Then (Rn,CLβ)
is an L-convex structure.
Example 2.6**.**
Let C denote the set of all fuzzy convex sublattices on L. It is easy to show that C is an I-convexity and (L,C) is an I-convex structure.
Example 2.7**.**
Let G be an ordered group, and let C denote the set of all fuzzy convex subgroup on G. Then we can see that C is an I-convexity and (G,C) is an I-convex structure.
The next two theorems give characterizations of an (L,M)-fuzzy
convexity.
Theorem 2.8**.**
A mapping C:LXβM is an (L,M)-fuzzy
convexity if and only if for each aβM\{β₯Mβ}, C[a]β is an L-convexity .
Proof*.*
The proof is obvious and is omitted.
β
Theorem 2.9**.**
A mapping
C:LXβM is an (L,M)-fuzzy convexity if
and only if for each aβΞ±(β₯Mβ), C[a] is an
L-convexity.
Proof*.*
Sufficiency.
(LMC1) For each aβΞ±(β₯Mβ), Οβ
β,ΟXββC[a]. We have C(Οβ
β)=C(ΟXβ)=β€Mβ.
(LMC2) Let {Aiββ£iβΞ©}βLX be nonempty,
and for aβΞ±(β₯Mβ),
aβ/Ξ±(iβΞ©ββC(Aiβ)).
Thus aβ/iβΞ©ββΞ±(C(Aiβ)). We know that aβ/Ξ±(C(Aiβ)) and then AiββC[a] for each iβΞ©. Since for each aβΞ±(β₯Mβ),
C[a] is an L-convexity, iβΞ©ββAiββC[a], that is, aβ/Ξ±(C(iβΞ©ββAiβ)). Therefore C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ).
(LMC3) Let {Aiββ£iβΞ©}βLX be nonempty and totally ordered by inclusion, and let aβ/Ξ±(iβΞ©ββC(Aiβ)) for aβΞ±(β₯Mβ).
Thus aβ/iβΞ©ββΞ±(C(Aiβ)). We know that aβ/Ξ±(C(Aiβ)) and then AiββC[a] for each iβΞ©. Since for each aβΞ±(β₯Mβ),
C[a] is an L-convexity, iβΞ©ββAiββC[a], that is, aβ/Ξ±(C(iβΞ©ββAiβ)). Therefore C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ).
Necessity. Suppose that C:LXβM is an
(L,M)-fuzzy convexity and aβΞ±(β₯Mβ). Now we
prove that C[a] is an L-convexity.
(LC1) By C(Οβ
β)=C(ΟXβ)=β€Mβ and
Ξ±(β€Mβ)=β
, we know that aξ βΞ±(C(Οβ
β)) and aξ βΞ±(C(ΟXβ)). This implies Οβ
β,ΟXββC[a].
(LC2) If {Aiβ:iβΞ©}βC[a], then
βiβΞ©, aξ βΞ±(C(Aiβ)). Hence
aξ βiβΞ©ββΞ±(C(Aiβ)). By
C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ), we know that
Ξ±(C(iβΞ©ββAiβ))βΞ±(iβΞ©ββC(Aiβ))=iβΞ©ββΞ±(C(Aiβ)). This shows aξ βΞ±(C(iβΞ©ββAiβ)). Therefore iβΞ©ββAiββC[a].
(LC3) If {Aiβ:iβΞ©}βC[a] is nonempty and totally ordered by inclusion, then
βiβΞ©, aξ βΞ±(C(Aiβ)). Hence
aξ βiβΞ©ββΞ±(C(Aiβ)). By
C(iβΞ©ββAiβ)β₯iβΞ©ββC(Aiβ), we know that
Ξ±(C(iβΞ©ββAiβ))βΞ±(iβΞ©ββC(Aiβ))=iβΞ©ββΞ±(C(Aiβ)). This shows aξ βΞ±(C(iβΞ©ββAiβ)). Therefore iβΞ©ββAiββC[a]. The proof is completed. β
Now we consider the conditions that a family of
L-convexities forms an (L,M)-fuzzy convexity. By
Theorem 1.2, we can obtain the following result.
Corollary 2.10**.**
If C is an
(L,M)-fuzzy convexity, then
- (1)
C[b]ββC[a]β* for any a,bβM\{β₯Mβ} with aβΞ²(b).*
2. (2)
C[b]βC[a]* for any a,bβΞ±(β₯Mβ) with bβΞ±(a).*
Theorem 2.11**.**
Let
{Ca:Β aβΞ±(β₯Mβ)} be a family of
L-convexities. If Ca=β{Cb:aβΞ±(b)} for all aβΞ±(β₯Mβ), then there exists an
(L,M)-fuzzy convexity C such that
C[a]=Ca.
Proof*.*
The proof is straightforward and is omitted.
β
Theorem 2.12**.**
Let
{Caβ:Β aβM\{β₯Mβ}} be a family
of L-convexities. If Caβ=β{Cbβ:bβΞ²(a)} for all aβM\{β₯Mβ}, then there exists
an (L,M)-fuzzy convexity C such that C[a]β=Caβ.
Proof*.*
This is straightforward.
β
Definition 2.13**.**
Let C,D be (L,M)-fuzzy convexities on X.
If C(A)β€D(A) for all AβLX, i.e., Cβ€D, then C is coarser than D and D is finer than C.
Theorem 2.14**.**
Let {Ctβ:tβT} be a family of (L,M)-fuzzy convexities on X.
Then tβTββCtβ is an (L,M)-fuzzy
convexity on X, where tβTββCtβ:LXβM is defined by
(tβTββCtβ)(A)=tβTββCtβ(A) for each AβLX. Obviously, tβTββCtβ is coarser than Ctβ for all tβT.
Proof*.*
This is straightforward.
β
3 (L,M)-fuzzy convexity preserving functions
In this section, we shall generalize the notion of convexity preserving functions to
lattice-valued setting.
Definition 3.1**.**
Let (X,C) and (Y,D) be (L,M)-fuzzy convex structures. A function f:XβY is called an (L,M)-fuzzy convexity preserving function
if
C(fLββ(B))β₯D(B) for all BβLY.
A (2,M)-fuzzy convexity preserving function is an
M-fuzzifying convexity preserving function in [23].
Theorem 3.2**.**
Let (Y,D) be an (L,M)-fuzzy convex structure and f:XβY a surjective function. Define a mapping
fLββ(D):LXβM by
[TABLE]
Then (X,fLββ(D)) is an (L,M)-fuzzy convex structure.
Proof*.*
(LMC1) holds from the following equalities:
[TABLE]
and
[TABLE]
(LMC2)
For any nonempty set {Aiβ:iβΞ©}βLX, let a be any element in M with the property of iβΞ©ββfLββ(D)(Aiβ)β»a. For each iβΞ©, β{D(B):fLββ(B)=Aiβ}=fLββ(D)(Aiβ)β»a. Then for each iβΞ©, there exists BiββLX such that
fLββ(Biβ)=Aiβ and D(Biβ)β₯a. Note that
fLββ(iβΞ©ββBiβ)=iβΞ©ββfLββ(Biβ)=iβΞ©ββAiβ and D(iβΞ©ββBiβ)β₯iβΞ©ββD(Biβ)β₯a. Finally we have
[TABLE]
This implies
fLββ(D)(iβΞ©ββAiβ)β₯iβΞ©ββfLββ(D)(Aiβ).
(LMC3) For any nonempty set {Aiβ:iβΞ©}βLX, which is totally ordered by inclusion, let a be any element in M with the property of iβΞ©ββfLββ(D)(Aiβ)β»a, that is, iβΞ©βββ{D(B):fLββ(B)=Aiβ}β»a. Then βiβΞ©, β{D(B):fLββ(B)=Aiβ}=fLββ(D)(Aiβ)β»a. For each iβΞ©, there exists BiββLX such that
fLββ(Biβ)=Aiβ and D(Biβ)β₯a.
Since f is surjective and {Aiβ:iβΞ©} is totally ordered by inclusion, we have {Biβ:iβΞ©} is totally ordered by inclusion.
Note that
fLββ(iβΞ©ββBiβ)=iβΞ©ββfLββ(Biβ)=iβΞ©ββAiβ and D(iβΞ©ββBiβ)β₯iβΞ©ββD(Biβ)β₯a. Finally we have
[TABLE]
This implies
fLββ(D)(iβΞ©ββAiβ)β₯iβΞ©ββfLββ(D)(Aiβ).
β
The following theorem gives a characterization of (L,M)-fuzzy
convexity preserving functions.
Theorem 3.3**.**
Let (X,C) and (Y,D) be two (L,M)-fuzzy convex structures. A surjective function f:XβY is an (L,M)-fuzzy convexity preserving function if and
only if fLββ(D)(A)β€C(A) for all AβLX.
Proof*.*
Necessity. If f:XβY is an (L,M)-fuzzy convexity preserving function,
then C(fLββ(B))β₯D(B) for all
BβLY. Hence for all AβLX, we have
[TABLE]
Sufficiency. If fLββ(D)(A)β€C(A) for all
AβLX, then
[TABLE]
for all BβLY. This shows that f:XβY is an (L,M)-fuzzy convexity preserving function.
β
The following theorems are trivial.
Theorem 3.4**.**
If f:(X,C)β(Y,D) and g:(Y,D)β(Z,H) are (L,M)-fuzzy convexity preserving functions, then gβf:(X,C)β(Z,H) is an (L,M)-fuzzy
convexity preserving function.
Theorem 3.5**.**
Let (X,C) and (Y,D) be (L,M)-fuzzy convex structures. Then a function f:(X,C)β(Y,D) is an (L,M)-fuzzy
convexity preserving function if and only if f:(X,C[a]β)β(Y,D[a]β) is an L-convexity preserving function for any aβM\{β₯Mβ}.
Theorem 3.6**.**
Let (X,C) and
(Y,D) be (L,M)-fuzzy convex structures. Then a function f:(X,C)β(Y,D) is an (L,M)-fuzzy convexity preserving function if and
only if f:(X,C[a])β(Y,D[a]) is an
L-convexity preserving function for any aβΞ±(β₯Mβ).
4 Quotient (L,M)-fuzzy convex structures
In this section, the notions of quotient structures and quotient functions are generalized to lattice-valued setting.
Theorem 4.1**.**
Let (X,C) be an (L,M)-fuzzy convex structure and f:XβY a surjective function. Define a mapping
C/fβ:LYβM by
[TABLE]
Then (Y,C/fβ) is an (L,M)-fuzzy convex structure and we call C/fβ a quotient (L,M)-fuzzy convexity on Y with respect to f and C. Moreover, it is easy to see that f is an (L,M)-fuzzy convexity preserving function from (X,C) to (Y,C/fβ).
Proof*.*
(LMC1) holds from the following equalities:
C/fβ(Οβ
β)=C(fLββ(Οβ
β))=C(Οβ
β)=β€Mβ
and
C/fβ(ΟYβ)=C(fLββ(ΟYβ))=C(ΟXβ)=β€Mβ.
(LMC2) can be shown from the following fact:
for any nonempty set {Biβ:iβΞ©}βLY,
[TABLE]
(LMC3) If {Biβ:iβΞ©}βLY is nonempty and totally ordered by inclusion, then
[TABLE]
β
Theorem 4.2**.**
Let (X,C) be an (L,M)-fuzzy convex structure and f:XβY a surjective function. Then C/fβ is the finest convexity on Y such that f is an (L,M)-fuzzy convexity preserving function.
Proof*.*
Let D be an (L,M)-fuzzy convexity on Y such that f is an (L,M)-fuzzy convexity preserving function from (X,C) to (Y,D). Then we have for all BβLY, C(fLββ(B))β₯D(B) and thus
C/fβ(B)=C(fLββ(B))β₯D(B). Therefore C/fββ₯D.
β
Definition 4.3**.**
Let (X,C) and (Y,D) be (L,M)-fuzzy convex structures. A function f:XβY is called an (L,M)-fuzzy quotient function if f is surjective and D is a quotient (L,M)-fuzzy convexity with respect to f and C.
Theorem 4.4**.**
If f:(X,C)β(Y,D) is an (L,M)-fuzzy quotient function, then g:(Y,D)β(Z,H) is an (L,M)-fuzzy convexity preserving function if and only if gβf:(X,C)β(Z,H) is an (L,M)-fuzzy
convexity preserving function.
Proof*.*
Since f:(X,C)β(Y,D) is an (L,M)-fuzzy quotient function, we know that f is surjective and βBβLY,
D(B)=C(fLββ(B)).
Necessity. Since g:(Y,D)β(Z,H) is an (L,M)-fuzzy convexity preserving function, βAβLZ, D(gLββ(A))β₯H(A). Thus βAβLZ, C((gβf)Lββ(A))=C(fLββ(gLββ(A)))=D(gLββ(A))β₯H(A).
Sufficiency. Since gβf:(X,C)β(Z,H) is an (L,M)-fuzzy
convexity preserving function, then βAβLZ,
D(gLββ(A))=C(fLββ(gLββ(A)))=C((gβf)Lββ(A))β₯H(A).
β
Definition 4.5**.**
Let (X,C) and (Y,D) be (L,M)-fuzzy convex structures. A function f:XβY is called an (L,M)-fuzzy convex-to-convex function if
D(fLββ(A))β₯C(A) for all AβLX.
Theorem 4.6**.**
If f:(X,C)β(Y,D) is a surjective (L,M)-fuzzy convexity preserving function and is an (L,M)-fuzzy convex-to-convex function,
then D is a quotient (L,M)-fuzzy convexity. Moreover, f is an (L,M)-fuzzy quotient function with respect to f and C.
Proof*.*
Since f:(X,C)β(Y,D) is a surjective (L,M)-fuzzy convexity preserving function and an (L,M)-fuzzy convex-to-convex function, we have βBβLY, C(fLββ(B))β₯D(B)
and βAβLX, D(fLββ(A))β₯C(A). Since f is surjective, we know for all BβLY, fLββ(fLββ(B))=B. Hence
[TABLE]
So C(fLββ(B))=D(B) for each BβLY and then D is a quotient (L,M)-fuzzy convexity with respect to f and C.
β
By Theorem 4.1, we can obtain the following result.
Theorem 4.7**.**
Let (X,C) be an (L,M)-fuzzy convex structure
and R be an
equivalence relation defined on X. Let X/R be
the usual quotient set and let Ο be the projection
map from X to X/R. Define D:L(X/R)βM by
[TABLE]
Then D is an (L,M)-fuzzy convexity on X/R and (X/R,D) is a quotient (L,M)-fuzzy convex structure of (X,C).
Corollary 4.8** ([17, 18]).**
Let X be any set and R be an
equivalence relation defined on X. Let X/R be
the usual quotient set and let Ο be the projection
map from X to X/R.
If (X,C) is an I-convex structure, then one can
define an I-convexity D on X/R as follows:
D={BβI(X/R):ΟIββ(B)βC}. Then D is an I-convexity on X/R and (X/R,D) is called the
quotient I-convex structure .
5 Substructures and products of (L,M)-fuzzy convex structures
In this section,
we give substructures and products of (L,M)-fuzzy convex structures and discuss some of their fundamental properties.
Lemma 5.1**.**
Let (X,C) be an L-convex structure and β
ξ =YβX.
For AβC, co(Aβ£Y)β£Y=Aβ£Y.
Proof*.*
On the one hand, it is obvious that Aβ£Yβco(Aβ£Y). Then Aβ£Y=(Aβ£Y)β£Yβco(Aβ£Y)β£Y. On the other hand, Aβ£YβA. Hence co(Aβ£Y)βco(A)=A and then co(Aβ£Y)β£Yβco(A)β£Y=Aβ£Y. Therefore, co(Aβ£Y)β£Y=Aβ£Y.
β
Theorem 5.2**.**
Let (X,C) be an (L,M)-fuzzy convex structure, β
ξ =YβX. Then (Y,Cβ£Y) is an (L,M)-fuzzy convex structure on Y, where βAβLY, (Cβ£Y)(A)=β{C(B):BβLX,Β Bβ£Y=A}. We call (Y,Cβ£Y) an
(L,M)-fuzzy substructure of (X,C).
Proof.
(1)Clearly, (Cβ£Y)(Οβ
β)=(Cβ£Y)(ΟXβ)=β€Mβ.
(2) For any nonempty set {Aiβ:iβΞ©}βLY, we have
[TABLE]
where Hiβ={B:BβLX,Β Bβ£Y=Aiβ} (iβΞ©). Since
(iβΞ©ββf(i))β£Y=iβΞ©ββ(f(i)β£Y)=iβΞ©ββAiβ, we have (Cβ£Y)(iβΞ©ββAiβ)β₯iβΞ©ββ(Cβ£Y)(Aiβ).
(3) For any {Aiβ:iβΞ©}βLY, which is nonempty and totally ordered by inclusion, we have
[TABLE]
where ΞΌiβ={B:BβLX,Β Bβ£Y=Aiβ} (iβΞ©). Since
(tβTββf(i))β£Y=iβΞ©ββ(f(i)β£Y)=iβΞ©ββAiβ, we have (Cβ£Y)(iβΞ©ββAiβ)β₯iβΞ©ββ(Cβ£Y)(Aiβ).
(3) For any set {Aiβ:iβΞ©}βLYβLX, which is nonempty and totally ordered by inclusion, let a be any element in M\{β₯} with the property of iβΞ©ββ(Cβ£Y)(Aiβ)β»a, that is, iβΞ©βββ{C(B):BβLX,Β Bβ£Y=Aiβ}β»a.
Then for each iβΞ©, there exists BiββLX such that
Biββ£Y=Aiβ and C(Biβ)β₯a, i.e., BiββC[a]β.
By Theorem 1.7, for each aβM\{β₯}, (X,C[a]β) is a convex structure.
Let coaβ denote the hull operator of (X,C[a]β) for each aβM\{β₯}. Then coaβ(Aiβ)βC[a]β for all iβΞ©.
Since {Aiβ:iβΞ©}βLY is nonempty and totally ordered by inclusion, {coaβ(Aiβ):iβΞ©} is nonempty and totally ordered by inclusion. Hence, iβΞ©ββcoaβ(Aiβ)βC[a]β, that is, C(iβΞ©ββcoaβ(Aiβ))β₯a. By Lemma 5.1,
[TABLE]
So we have (Cβ£Y)(iβΞ©ββAiβ)β₯a. This implies (Cβ£Y)(iβΞ©ββAiβ)β₯iβΞ©ββ(Cβ£Y)(Aiβ).
β
Corollary 5.3** ([17, 18]).**
Let (X,C) be an I-convex structure, β
ξ =YβX. Then an I-convexity Cβ£Y on Y is given by the fuzzy sets of the form {Bβ£Y:BβC}. The pair (Y,Cβ£Y) is an I-convex substructure of (X,C).
By Theorem 2.14, we can give the following definition:
Definition 5.4**.**
Let Ο:LXβM be a mapping. The (L,M)-fuzzy convex structure (X,C) generated by Ο is given by
[TABLE]
where H denotes all the (L,M)-fuzzy convexities on X. Then Ο is called a subbase of the (L,M)-fuzzy convexity C. Alternatively, we say that Ο generates the convexity C.
Based on Definition 5.4, we can define the product of (L,M)-fuzzy convex structures as follows:
Definition 5.5**.**
Let {(Xtβ,Ctβ)}tβTβ be a family of (L,M)-fuzzy convex structures. Let X be the product of the sets of Xtβ for tβT, and let Οtβ:XβXtβ denote the projection for each tβT. Define a maping Ο:LXβM by
Ο(A)=tβTββ(Οtβ)Lββ(B)=AββCtβ(B) for each AβLX.
Then the product convexity C of X is the one generated by the subbase Ο.
The resulting (L,M)-fuzzy convex structure (X,C) is called the product of {(Xtβ,Ctβ)}tβTβ and is donated by tβTββ(Xtβ,Ctβ).
When L=[0,1] and M=2, we can obtain the following definition.
Definition 5.6** ([17, 18]).**
Let {(Xtβ,Ctβ)}tβTβ be a family of I-convex structures. Let X be the product of the sets of Xtβ for tβT, and let Οtβ:XβXtβ denote the projection for each tβT.
Then X can be equipped with
the I-convexity C generated by the convex
fuzzy sets of the form {(Οtβ)Iββ(B):BβCtβ,tβT}.
Then C is called the product I-convexity for
X and (X,C) is called the product I-convex structure.
Theorem 5.7**.**
Let (X,C) be the product of {(Xtβ,Ctβ)}tβTβ. Then βtβT, Οtβ:XβXtβ is an
(L,M)-fuzzy convexity preserving function. Moreover, C is the coarsest (L,M)-fuzzy convex structure such that {Οtβ:tβT} are (L,M)-fuzzy convexity preserving functions.
Proof*.*
Let t0ββT. βBβLXt0ββ, by
[TABLE]
it implies that Οt0ββ:XβXt0ββ is an
(L,M)-fuzzy convexity preserving function. By the arbitrariness of t0β, we know βtβT, Οtβ:XβXtβ is an
(L,M)-fuzzy convexity preserving function. If there is an (L,M)-fuzzy convex structure D on X such that βtβT, Οtβ:XβXtβ is an (L,M)-fuzzy convexity preserving function,
then we need to prove Dβ₯C. βBβLX, tβT, if (Οtβ)Lββ(G)=B, D(B)=D((Οtβ)Lββ(G))β₯Ctβ(G).
Note that Ο(B)=tβTββ(Οtβ)Lββ(G)=BββCtβ(G). We have D(B)β₯Ο(B) for all BβLX. Hence Dβ₯C.
β
6 Relation between MYCS and LMCS
In this section, we discuss the relation between (L,M)-fuzzy convex structures and M-fuzzifying convex structures from a categorical aspect. (L,M)-fuzzy convex structures and their (L,M)-fuzzy convexity preserving functions form a category which is denoted by LMCS and M-fuzzifying convex structures and their M-fuzzifying convexity preserving functions form a category which is denoted by MYCS. Moreover, we create a functor Ο from MYCS
to LMCS and show that there exists an adjunction between MYCS and LMCS. We always suppose that Ξ²(aβ§b)=Ξ²(a)β©Ξ²(b) for any a,bβL in this section.
Lemma 6.1**.**
If Ξ²(aβ§b)=Ξ²(a)β©Ξ²(b) for any a,bβL, then for AβLX, {A[c]β:bβΞ²(c)} is up-directed.
Proof*.*
Let A[c1β]β,A[c2β]ββ{A[c]β:bβΞ²(c)}. Then
bβΞ²(c1β) and bβΞ²(c2β). We have bβΞ²(c1β)βΞ²(c2β)=Ξ²(c1ββ§c2β). Hence A[c1ββ§c2β]ββ{A[c]β:bβΞ²(c)}. Moreover, A[c1β]β,A[c2β]ββA[c1ββ§c2β]β. Therefore, {A[c]β:bβΞ²(c)} is up-directed.
β
Theorem 6.2**.**
Let (X,C) be an M-fuzzifying convex structure. Define a mapping Ο(C):LXβM by
[TABLE]
*Then Ο(C) is an (L,M)-fuzzy convexity.
*
Proof*.*
(LMC1) Obviously, Ο(C)(ΟXβ)=Ο(C)(Οβ
β)=β€Mβ.
(LMC2) For any nonempty set {Aiβ:iβΞ©}βLX, we have
[TABLE]
(LMC3)
For any set {Aiβ:iβΞ©}βLX, which is nonempty and totally ordered by inclusion, we need to prove that Ο(C)(iβΞ©ββAiβ)β₯iβΞ©ββΟ(C)(Aiβ), that is,
aβLββC((iβΞ©ββAiβ)[a]β)β₯iβΞ©ββaβLββC((Aiβ)[a]β). Let hβM\{β₯Mβ} and iβΞ©ββaβLββC((Aiβ)[a]β)β₯h. Then we have for any iβΞ© and for any aβL, C((Aiβ)[a]β)β₯h, i.e., (Aiβ)[a]ββC[h]β. Since (X,C) is an M-fuzzifying convex structure, by Theorem 1.7, for each hβM\{β₯Mβ}, (X,C[h]β) is a convex structure. By Theorems 1.2 and 1.3, we know that
[TABLE]
By Lemma 6.1,
for each bβΞ²(a) and for each iβΞ©,
{(Aiβ)[c]β:bβΞ²(c)}βC[h]β is up-directed.
Then by Definition 1.4, we have bβΞ²(c)ββ(Aiβ)[c]ββC[h]β.
Let Biβ=bβΞ²(c)ββ(Aiβ)[c]β for each iβΞ©. Since {Aiβ:iβΞ©} is totally ordered, we obtain {Biβ:iβΞ©} is totally ordered. Then iβΞ©ββbβΞ²(c)ββ(Aiβ)[c]ββC[h]β. Therefore (iβΞ©ββAiβ)[a]β=bβΞ²(a)ββiβΞ©ββbβΞ²(c)ββ(Aiβ)[c]ββC[h]β. Hence Ο(C)(iβΞ©ββAiβ)β₯h. By the arbitrariness of h, we have Ο(C)(iβΞ©ββAiβ)β₯iβΞ©ββΟ(C)(Aiβ).
β
Theorem 6.3**.**
Let (X,C) and (Y,D) be two M-fuzzifying convex structures and
f:XβY a function. Then f:(X,C)β(Y,D) is an M-fuzzifying convexity preserving function if and only if f:(X,Ο(C))β(Y,Ο(D)) is an (L,M)-fuzzy
convexity preserving function.
Proof*.*
Necessity. Suppose that f:(X,C)β(Y,D)
is an M-fuzzifying convexity preserving function. Then C(fβ1(A))β₯D(A) for any Aβ2Y. In order to prove that f:(X,Ο(C))β(Y,Ο(D)) is an (L,M)-fuzzy
convexity preserving function, we need to prove
Ο(C)(fLββ(A))β₯Ο(D)(A)
for any AβLY.
For any AβLY and for any aβL, we have fLββ(A)[a]β=fβ1(A[a]β).
In fact, for any AβLY, by
[TABLE]
we can prove the necessity.
Sufficiency. Suppose that f:(X,Ο(C))β(Y,Ο(D)) is an (L,M)-fuzzy convexity preserving function. Then
Ο(C)(fLββ(A))β₯Ο(D)(A)
for any AβLY. In particular, it follows that
Ο(C)(fLββ(A))β₯Ο(D)(A)
for any Aβ2Y. In order to prove that f:(X,C)β(Y,D) is an M-fuzzifying convexity preserving function, we
need to prove C(fβ1(A))β₯D(A) for any
Aβ2Y. In fact, for any Aβ2Y,
we have
[TABLE]
This shows that f:(X,C)β(Y,D) is an M-fuzzifying convexity preserving function.
β
Theorem 6.4**.**
Suppose that (X,C) is an (L,M)-fuzzy convex structure.
We can obtain an M-fuzzifying convex structure ΞΉ(C) on X generated by the
subbase
ΟCβ(U):2XβM defined as follows:
[TABLE]
Then ΞΉβΟ=id and ΟβΞΉβ₯id.
Proof*.*
We observe that for every M-fuzzifying convex structure C on X the relation ΟΟ(C)β(U)β₯C(U) holds for all Uβ2X. In fact, it could be showed by
βUβ2X,
[TABLE]
Thus, ΞΉ(Ο(C))β₯C, i.e., ΞΉβΟβ₯id.
Conversely,
let Uβ2X and take any aβL. Then for each
BβLX with B[a]β=U,
[TABLE]
Hence,
ΟΟ(C)β(U)=aβLβββ{Ο(C)(B):BβLX,B[a]β=U}β€C(U).
It means that ΞΉ(Ο(C))β€C, i.e., ΞΉβΟβ€id. Finally, we obtain ΞΉβΟ=id by all proofs above.
Let (X,C) be an (L,M)-fuzzy convex structure. Then
[TABLE]
for all Uβ2X and ΞΉ(C)=β{D:ΟCββ€DβH}, where H denotes all the M-fuzzifying convexities on X.
βAβLX, by
[TABLE]
we have ΟβΞΉ(C)β₯C, i.e., ΟβΞΉβ₯id.
β
Theorem 6.5**.**
Let (X,C) be an M-fuzzifying convex structure, (X,D) be an (L,M)-fuzzy convex structure and f:(X,C)β(Y,ΞΉ(D)) be an M-fuzzifying convexity preserving function.
Then f:(X,Ο(C))β(Y,D) is an (L,M)-fuzzy convexity preserving function.
Proof.
Since f:(X,C)β(Y,ΞΉ(D)) is an M-fuzzifying convexity preserving function, βAβ2Y, C(fβ1(A))β₯ΞΉ(D)(A).
βBβLY, by
[TABLE]
we obtain f:(X,Ο(C))β(Y,D) is an (L,M)-fuzzy convexity preserving function.
β
Based on the above results, we finally obtain the following theorem.
Theorem 6.6**.**
There exists an adjunction between MYCS and LMCS.
7 Conclusion
In this paper, combining L-convex structures [13, 17, 18] and M-fuzzifying convex structures [23] and based on complete distributive lattices L and M,
we present
a more general approach to the fuzzification of
convex structures.
It is a generalization of L-convex structures and M-fuzzifying convex structures. Under the framework of (L,M)-fuzzy convex structures, the concepts of quotient structures, substructures and products are presented and their fundamental properties are discussed.
The notion of convexity preserving functions
is also generalized to lattice-valued fuzzy setting and then an (L,M)-fuzzy convexity preserving function is obtained. Thus there are two categories LMCS and MYCS, where LMCS consists of all (L,M)-fuzzy convex structures and of all (L,M)-fuzzy convexity preserving functions, and MYCS consists of all M-fuzzifying convex structures and of all M-fuzzifying convexity preserving functions.
Moreover, we create a functor Ο from MYCS
to LMCS and show that there exists an adjunction
between MYCS and LMCS.
The above facts will be useful to help further investigations and it is possible that the fuzzification of convex structure would be applied to some problems related to the theory of abstract convexity in the future.