- Research
- Open access
- Published:
Fixed point theorems on ordered vector spaces
Fixed Point Theory and Applications volume 2014, Article number: 109 (2014)
Abstract
In this paper, we introduce the concept of ordered metric spaces with respect to some ordered vector spaces, which is an extension of the normal metric spaces. Then we investigate some properties of ordered metric spaces and provide several fixed point theorems. As applications we prove several existence theorems for best ordered approximation.
MSC: 46B42, 47H10, 58J20, 91A06, 91A10.
1 Introduction
Let S be a nonempty set and let X be a Banach space. Let K be a closed convex cone in X. The cone metric defined on S, with respect to the cone K in X, is a bifunction , for which the following properties hold:
-
(a)
and if and only if ;
-
(b)
;
-
(c)
, for all .
Note that if we take X to be the set of real numbers and take , then any cone metric space with respect to K turns out to be a normal metric space. Hence the concept of vector metric spaces extends the notion of the normal metric spaces.
In the field of nonlinear analysis, vector metric spaces have been widely studied by many authors (see [1]). Similarly to ordinary analysis, the concepts of continuity and of the Lipschitz condition for mapping on vector metric spaces have been introduced and have been applied for proving the existence of fixed points (see [2–4]).
Since the definition of vector metrics is based on closed convex cones in normed vector spaces, and every closed convex cone in a vector space can induce a partial order on it, which equips this vector space to be an ordered vector space, it is natural to generalize the concept of cone metric spaces to ordered metric spaces (see Section 3).
This paper is organized as follows: in Section 2, we recall some concepts of ordered vector spaces and order-convergence of sequences; in Section 3, we introduce the concept of ordered metric spaces and investigate some properties; in Section 4, several fixed point theorems on ordered metric spaces are provided; in Section 5, we extend the concept of best ordered approximation and prove several existence theorems by applying the fixed point theorems provided in Section 4.
2 Preliminaries
In this section, we recall some concepts of ordered sets and some properties of order-limits. For more details, the readers are referred to [5–7]. Then we extend the concept of order-continuity of mappings on ordered vector spaces and provide some properties that are similar to those of ordinary limits in analysis. These properties will be frequently used throughout this paper.
In this paper, all vector spaces considered are real vector spaces. A vector space X equipped with a partial order (that is, is a reflexive, antisymmetric, and transitive binary relation on X) is called a partially ordered vector space, or is simply called an ordered vector space, which is written as , if the following (order-linearity) properties hold:
(v1) implies , for all .
(v2) implies , for all and .
A sequence in an ordered vector space is said to be order-decreasing, which is denoted by , whenever implies . An order-decreasing sequence is said to order-converge to x, if and exists with , which is denoted by . The meaning of is analogously defined for an order-increasing sequence ; and , if and only if and exists with .
Lemma 2.1 Let , be two sequences in an arbitrary ordered vector space . The following properties hold:
-
1.
implies , for every .
-
2.
and imply .
-
3.
and imply , for any nonnegative numbers a and b.
Definition 2.2 An ordered vector space is said to be generalized Archimedean if and only if for any given element and any decreasing sequence of positive numbers with limit 0, we have
Let X be a vector space and K a closed convex cone in X. Define a binary relation on X as follows:
Then is a partial order on X, which satisfies conditions (v1) and (v2), and therefore is an ordered vector space, which is said to be induced by the closed convex cone K.
Lemma 2.3 Every ordered vector space induced by a closed convex cone is generalized Archimedean.
The proof of Lemma 2.3 is straightforward and it is omitted here.
In order theory, the order completeness of a poset is as important as the topological counterpart of a topological space in analysis. Recall that a subset C of an ordered vector space is said to be chain complete if and only if for any chain in X, exists. Next, we define a special case of chain-complete subsets.
Definition 2.4 Let be an ordered vector space and C a subset of X. C is said to be (sequentially) conditionally chain complete if and only if for any sequence in C, the following properties hold:
-
1.
If and has a lower bound, then exists satisfying .
-
2.
If and has an upper bound, then exists satisfying .
3 Ordered metric spaces
We extend the concept of cone metric to the following ordered metric with respect to ordered vector spaces.
Definition 3.1 Let S be a nonempty set and let be an ordered vector space. A bifunction is called an ordered metric on S, with respect to X if, for every u, v, and s in S, it satisfies the following conditions:
(m1) with , if and only if ;
(m2) ;
(m3) .
Then is called an ordered metric space, and is called the ordered distance between u and v, with respect to the ordered vector space .
We offer some examples below to demonstrate that the class of ordered metric spaces is a very broad one. First, note that is an ordered vector space with the ordinal real order ⩾. Then we have the following results.
Example 3.2 The metric defined on a metric space is an ordered metric; and therefore, every metric space is an ordered metric space.
Example 3.3 Let B be a Banach space with the norm and let d be the metric on B induced by . Then d is an ordered metric; and therefore, every Banach space with the metric induced by its norm is an ordered metric space (where the metric d is defined by , for every ).
Example 3.4 Every cone metric on a nonempty set is an ordered metric; and therefore, every cone metric space is an ordered metric space.
As a matter of fact, if an ordered vector space is induced by a closed convex cone K in X, then from (1), if and only if ; and therefore, the ordered metrics on sets extend the concept of cone metrics.
Example 3.5 Let be a Riesz space (vector lattice). Then the bifunction induced by the (ordered) absolute values on X as , for every , is an ordered metric on X. Hence every Riesz space with the ordered metric induced by its (ordered) absolute values is an ordered metric space.
Here, as usual, for any , , and are called the (ordered) positive part, negative part, and (ordered) absolute value of x, respectively.
In real analysis, an arbitrary metric on a metric space is a function with positive values in R, which is totally ordered with respect to the ordinal order of real numbers. This property implies that the distances of pairs of elements are comparable. But in ordered metric space, the ordered distances of pairs of elements are not always comparable. Thus, this idea provides us a useful tool to study some problems, which have outcomes in a poset.
Definition 3.6 A sequence in an ordered metric space is said to order-converge to an element , which is denoted by , whenever there exists another sequence in with such that
In this case, s is called an order-limit of the sequence .
Lemma 3.7 If a sequence in an ordered metric space is order-convergent, then its order-limit is unique.
Proof Let u and v be order-limits of . Then there are sequences and in X with and such that
From condition (m3), they imply
From Part 2 of Lemma 2.1, . It implies . Hence . From condition (m1) in the definition of ordered metric, it follows that . □
Definition 3.8 A sequence in an ordered metric space is called an order-Cauchy sequence, whenever there exists another sequence in with such that
Definition 3.9 An ordered metric space is said to be order-metric complete, whenever every order-Cauchy sequence in S is order-convergent.
Definition 3.10 Let and be ordered metric spaces, with respect to the ordered vector spaces and , respectively. A mapping is said to be sequentially or σ-continuous, whenever, for any sequence , , with respect to the ordered metric on S, implies , with respect to the ordered metric on T.
4 Several fixed point theorems on ordered metric spaces
Theorem 4.1 Let be an order-metric complete ordered metric space, with respect to a generalized Archimedean ordered vector space . Let be a self-mapping. Suppose there is a positive number , such that
Then f has a unique fixed point.
Proof Taking any , we define a sequence . From condition (4), it follows that
Iterating the above order-inequality yields
By property (m3) of order-metric and properties of partial orders in ordered vector spaces, for any positive integer i, we get
Take
Since is generalized Archimedean, from Definition 2.2, it yields . It implies that is an order-Cauchy sequence in , which is an order-metric complete ordered metric space. Hence, has an order-limit, say ; that is,
Then, from Definition 3.6, there is a sequence , with such that
Since the mapping has the ordered Lipschitzian property given by (4) with defined in (5), from the above order inequality, it yields
From Lemma 2.1, implies . So we obtain
It implies
It follows that ; and therefore, is a fixed point of f. The uniqueness of the fixed point of f immediately follows from condition (4) of the mapping f and condition (m1) of the ordered metric. □
From Example 3.5, any arbitrary Riesz space (vector lattice) is an ordered metric space with the ordered metric induced by its (ordered) absolute values. Then the following result immediately follows from Theorem 4.1.
Corollary 4.2 Let S be a nonempty order-metric complete subset of a generalized Archimedean Riesz space. Let be a self-mapping. Suppose there is a positive number , such that
Then f has a unique fixed point.
Next we generalize the concept of order-increasing of mappings on ordered vector spaces.
and be ordered metric spaces, with respect to ordered vector spaces and , respectively. A set-valued mapping is said to be ordered metric increasing upward from S to , whenever there are elements , such that, for any given , implies that, for every , there is satisfying (with respect to points and ). F is said to be ordered metric increasing downward from S to (with respect to points s and t), whenever for any given , implies that, for every , there is satisfying . F is said to be ordered metric increasing from S to (with respect to points and ), whenever F is both ordered metric increasing downward and ordered metric increasing upward. In particular, if and , then F is said to be ordered metric increasing (upward, downward) on S (with respect to point ).
A single-valued mapping is said to be ordered metric increasing (decreasing) with respect to elements , , whenever, for any given , implies .
Definition 4.3 Let be an ordered metric space with respect to an ordered vector space . is called a monodromy ordered metric space, with respect to an element , whenever the map is one to one. Such an element is called a monotonized point of the ordered metric space .
Example 4.4 For an arbitrary positive integer n, let denote the ordered vector space, where n is the coordinate ordering on the n-dimensional Euclidean space . Let S be a subset of the positive cone of containing the origin of . Define an ordered metric on S as: for any ,
It follows that
It implies that the ordered metric space is a monodromy ordered metric space with respect to its monotonized point .
Example 4.5 Let be a Riesz space and let the ordered metric on X be defined in Example 3.5. Similarly to Example 4.4, we can see that every subset S of the positive cone of X containing the origin of X is a monodromy ordered metric space with the same metric on S and with respect to a monotonized point .
Recall that a nonempty subset A of a poset is said to be inductive if every chain in A has an upper bound in A. The next definition extends this concept.
Definition 4.6 A nonempty subset A of a poset is said to be totally inductive in P whenever, for any given chain , every element has an upper bound in A implies that the chain has an upper bound in A.
It is clear that every totally inductive subset of a poset is inductive. However, the inverse may not true. The following lemma provides a sufficient condition for an inductive set to be totally inductive.
Lemma 4.7 Let A be an inductive subset of a poset . If A has finite number of maximal elements, then A is totally inductive.
Proof Take an arbitrary chain satisfying that every element has an upper bound . We write the set of maximal elements of A by , for some positive integer m. We claim that, for any given , we must have
To prove (6), assume, by way of contradiction, that (6) does not hold for some . Then we define
Since , we get . For any arbitrary chain C in , it is also a chain in A. It follows that the inductivity of A implies that C has an upper bound . It is clear that . Thus, it shows that d is an upper bound of C in , hence is inductive. Using Zorn’s Lemma, has a maximal element w of . In the case if there is with and , then and w could not be a maximal element in . It shows that w is also a maximal element of A. From the hypotheses that does not satisfy (6), then the maximal element . It is a contradiction to the assumption that is the collection of all maximal elements of A. The claim is proved.
Following (6), a collection of subsets of C is recursively defined as below:
By (6), it follows that is a partition of with some empty members.
Next we show that in , there is one and only one nonempty member. To this end, contrarily assume that there are two numbers , such that and both are nonempty. Then we take and . Since is a chain, which is totally ordered, so we must have either or . It implies either or . It is a contradiction to the fact that . It proves that in , there is a unique nonempty member. Thus, this lemma follows immediately. □
Theorem 4.8 Let be a monodromy ordered metric space with respect to an ordered vector space and with a monotonized point . Suppose a set-valued mapping satisfies the following conditions:
-
1.
F is ordered metric increasing upward on S with respect to the point ;
-
2.
For every , the set is a totally inductive subset of X;
-
3.
The set is a chain-complete subset of X;
-
4.
There is an element such that , for some .
Then F has a fixed point.
Proof We define the ordered metric image set for the given mapping F as follows:
From condition 4, ; and therefore, is a nonempty subset of X.
For any , if satisfying , then from condition 1 and , there is such that . It implies . So we get
Next, we show that is inductive.
For any given chain , suppose that with such that
From condition 3, exists and is in . So there are and such that
It implies
For every α, since , from condition 1, (10) implies that there is such that
From (8), we have
From condition 2, is a totally inductive subset of X. Then (11) implies that the chain has an upper bound in , which is denoted by with . Hence
From (9), it implies
It follows that . It implies that the chain has an upper bound in ; and therefore, is inductive.
Applying Zorn’s lemma, has a maximal element, say , for some , which satisfies
From (7), we have . Since is a maximal element of , from (13), it implies that
Since is monodromy with respect to this element , (14) implies that . Hence is a fixed point of F. □
Recall that every Riesz space (vector lattice) can be considered as an ordered metric space with the ordered metric induced by its ordered absolute values. The positive cone of is denoted by
Let S be an arbitrary nonempty subset S of containing 0. From Example 4.5, is a monodromy ordered metric space with respect to the ordered vector space , and with as a monotonized point. It satisfies, for any , ; and therefore, for any , if and only if . Hence, if a set-valued mapping is ordered metric increasing upward, with respect to point 0, then it is ordered increasing upward, that is, whenever for any given , implies that, for every , there is satisfying . As a consequence of Theorem 4.8, we have the following.
Corollary 4.9 Let be a nonempty subset of the positive cone of a Riesz space , which contains 0. Suppose a set-valued mapping satisfies the following conditions:
-
1.
F is ordered increasing upward on S;
-
2.
for every , the set is a totally inductive subset of X;
-
3.
the set is a chain-complete subset of X;
-
4.
there is an element such that , for some .
Then F has a fixed point.
Remark 4.10 From Lemma 4.7, Theorem 4.8 and Corollary 4.9 still hold if condition 2 is, respectively, replaced by
2′ For every , the set , or , is an inductive subset of X with finite number of maximal elements.
Considering single-valued mappings as special cases of set-valued mappings, the following result follows immediately from Theorem 4.8.
Corollary 4.11 Let be a monodromy ordered metric space with respect to an ordered vector space and with a monotonized point . If a single-valued self-mapping f on S satisfies the following conditions:
-
1.
f is ordered metric increasing on S with respect to the point ;
-
2.
The set is a chain-complete subset of X;
-
3.
There is an element such that .
Then f has a fixed point.
5 Applications to best ordered approximation problems
Since Fan [8] proved a best approximation theorem by applying fixed point theorem on normed linear spaces, many authors have extended this theorem to more general topological spaces and have provided applications to approximation theory (see [9–12]). As applications of the fixed point theorems proved in previous section, in this section, we extend the concept of best approximation from metric spaces to ordered metric spaces and give some best ordered approximation theorems.
Definition 5.1 Let be an ordered metric space with respect to an ordered vector space and K a nonempty subset of S. Let be a map. An element is called a best ordered approximation of f on K, if it satisfies
where is the smallest (minimum) element of the set with respect to the ordering on X.
For any given single-valued map , define a set-valued map by
This mapping is called the approximating mapping of the map f.
It is worthy to note that if is monodromy, then, for any given map and for , the value of its approximating mapping is either ∅ or a singleton.
As a consequence of Corollary 4.11, we have the following.
Theorem 5.2 Let be a monodromy ordered metric space with respect to an ordered vector space and with a monotonized point and K a nonempty order-metric complete subset of S containing . Let be a map. Suppose the approximating mapping of f satisfies the following conditions:
-
1.
; and therefore it is a singleton, for every ;
-
2.
is ordered metric increasing on K with respect to the point ;
-
3.
the set is a chain-complete subset of X;
-
4.
there is an element such that .
Then f has a best ordered approximation on K.
Proof Since , it is easily to see that is also a monodromy ordered metric space with respect to an ordered vector space and with this monotonized points . Condition 1 implies that the map is well defined. From conditions 2-4 in this theorem, the map satisfies all conditions in Corollary 4.11. Then it follows that has a fixed points . It implies
Hence is a best ordered approximation of f on K. □
Theorem 5.3 Let be a monodromy ordered metric space, with respect to a generalized Archimedean ordered vector space and with a monotonized point and K a nonempty order-metric complete subset of S containing . Let be a map. Suppose the approximating mapping of f satisfies the following conditions:
-
1.
, for every ;
-
2.
there is a positive number , such that , for all .
Then f has a best ordered approximation on K.
Proof Since is monodromy, from condition 1, it implies that, for every , the value of its approximating mapping is a singleton. Hence, we can consider as a single-valued map from K to K. By condition 2 of this theorem, satisfies condition (4) in Theorem 4.1. It follows that has a fixed point. Similarly to the proof of Theorem 4.1, the fixed point of is a best ordered approximation of f on K. □
Definition 5.4 Let be an ordered metric space with respect to an ordered vector space and K a nonempty subset of S. Let be a map. An element is called an extended best ordered approximation of f on K, if it satisfies
where is the set of minimal elements of the set with respect to the ordering on X.
It is clear that even in the case if is a monodromy, for any given map and for , the value of its approximating mapping may not be a singleton. As a consequence of Theorem 4.8, we have the following.
Theorem 5.5 Let be a monodromy ordered metric space with respect to an ordered vector space and with a monotonized point and K a nonempty subset of S containing . Let be a map. Suppose the approximating mapping of f satisfies the following conditions:
-
1.
, for every ;
-
2.
is ordered metric increasing upward on K with respect to the point ;
-
3.
for every , the set is a totally inductive subset of X;
-
4.
the set is a chain-complete subset of X;
-
5.
there is an element such that , for some .
Then f has a best ordered approximation on K.
Misc
Equal contributors
References
Mustafa Z, Sims B: A new approach to generalized metric spaces. J. Nonlinear Convex Anal. 2006, 7(2):289–297.
Dhage BC: Generalized metric space and mapping with fixed point. Bull. Am. Math. Soc. 1992, 84: 329–336.
Huang LG, Zhang X: Cone metric spaces and fixed point theorems of contractive mappings. J. Math. Anal. Appl. 2007, 332: 1468–1476. 10.1016/j.jmaa.2005.03.087
Morales JR, Rojas S: Cone metric spaces and fixed point theorems of T -contractive mappings. Notas Mat. 2008, 4(2):66–78.
Aliprantis CD, Burkinshaw O: Positive Operators. Springer, Berlin; 2006.
Alber YI, Reich S: An iterative method for solving a class of nonlinear operator equations in Banach spaces. Panam. Math. J. 1994, 4(2):39–54.
Carl S, Heikkilä S: Fixed Point Theory in Ordered Sets and Applications: From Differential and Integral Equations to Game Theory. Springer, New York; 2010.
Fan K: Extensions of two fixed point theorems of F. E. Browder. Math. Z. 1969, 112: 234–240. 10.1007/BF01110225
Lin TC, Park S: Approximation and fixed point theorems for condensing composites of multifunctions. J. Math. Anal. Appl. 1998, 233: 1–8.
Liu LS, Li XK: On approximation theorems and fixed point theorems for non-self-mappings in uniformly convex Banach spaces. Banyan Math. J. 1997, 4: 11–20.
Reich S: Fixed points in locally convex spaces. Math. Z. 1972, 125: 17–31. 10.1007/BF01111112
Reich S: Approximate selection sets, best approximations, fixed points, and invariant sets. J. Math. Anal. Appl. 1978, 62: 104–113. 10.1016/0022-247X(78)90222-6
Acknowledgements
The authors are grateful for those who have offered their valuable suggestions on improving our work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors are equal contributors.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Li, J.L., Zhang, C.J. & Chen, Q.Q. Fixed point theorems on ordered vector spaces. Fixed Point Theory Appl 2014, 109 (2014). https://doi.org/10.1186/1687-1812-2014-109
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1687-1812-2014-109