1 Introduction

In 1905, the famous French mathematician Maurice Fréchet [1, 2] introduced the concept of metric spaces. In 1934, his PhD student, the Serbian mathematician, Ðuro Kurepa [3], introduced more abstract metric spaces, in which the metric takes values in an ordered vector space. In the literature, the metric spaces with vector valued metric are known under various names: pseudometric spaces [3, 4], K-metric spaces [57], generalized metric spaces [8, 9], vector-valued metric spaces [10], cone-valued metric spaces [11, 12], cone metric spaces [13, 14].

It is well known that cone metric spaces and cone normed spaces have deep applications in the numerical analysis and the fixed point theory. Some applications of cone metric spaces can be seen in Collatz [4], Zabrejko [6], Rus, Petruşel, Petruşel [15] and in references therein. Schröder [16, 17] was the first who pointed out the important role of cone metric spaces in the numerical analysis. The famous Russian mathematician Kantorovich [18] was the first who showed the importance of cone normed spaces for the numerical analysis.

Starting from 2007, many authors have studied cone metric spaces over solid Banach spaces and fixed point theorems in such spaces (Huang and Zhang [13], Rezapour and Hamlbarani [19], Wardowski [20], Pathak and Shahzad [21], Şahin and Telsi [22], Amini-Harandi and Fakhar [23], Sönmez [24], Latif and Shaddad [25], Turkoglu and Abuloha [26], Khamsi [27], Radenović and Kadelburg [28], Khani and Pourmahdian [29], Asadi, Vaezpour and Soleimani [30], Ding, Kadelburg, Karapinar, Radenović [31], Lin, Chen, Jovanović, Wu [32] and others).

Recently, some authors have studied cone metric spaces over solid topological vector spaces and fixed point theorems in such spaces (Beg, Azam and Arshad [33], Du [34, 35], Azam, Beg and Arshad [36], Janković, Kadelburg and Radenović [14], Kadelburg, Radenović and Rakočević [37], Arandelović and Kečkić [38], Simić [39], Çakalli, Sönmez and Genç [40], Asadi, Rhoades and Soleimani [41] and others).

The purpose of this paper is three-fold. First, we develop a unified theory for solid vector spaces. Second, we develop a unified theory for cone metric spaces over a solid vector space. Third, we present full statements of the iterated contraction principle and the Banach contraction principle in cone metric spaces over a solid vector space. The main results of the paper generalize, extend and complement some recent results of Du [34], Kadelburg, Radenović and Rakočević [37], Pathak and Shahzad [21], Wardowski [20], Radenović and Kadelburg [28] and others.

The paper is structured as follows.

In Section 2, we introduce an axiomatic definition of a vector space with convergence, which does not require neither axiom for the uniqueness of the limit of a convergent sequence nor axiom for convergence of subsequences of a convergent sequence (Definition 2.1). Our axioms are enough to prove some fixed point theorems in cone metric spaces over solid vector spaces.

In Section 3, we establish a necessary and sufficient condition for the interior of a solid cone in a vector space with convergence (Theorem 3.1).

In Section 4, we introduce the definition of an ordered vector space with convergence and the well-known theorem that the vector orderings and cones in a vector space with convergence are in one-to-one correspondence.

In Section 5, we introduce an axiomatic definition of the new notion of a strict vector ordering on an ordered vector space with convergence (Definition 5.1). Then we show that an ordered vector space with convergence can be equipped with a strict vector ordering ≺ if and only if it is a solid vector space (Theorem 5.1). Moreover, if the positive cone of an ordered vector space with convergence is solid, then there exists only one strict vector ordering on this space. Hence, the strict vector orderings and solid cones in an vector space with convergence are in one-to-one correspondence. It turns out that a solid vector space can be defined as an ordered vector space with convergence equipped with a strict vector ordering (Corollary 5.1).

In Section 6, we show that every solid vector space can be endowed with an order topology τ and that x n x implies x n τ x (Theorems 6.1 and 6.2). As a consequence, we show that every convergent sequence in a solid vector space is bounded and has a unique limit (Theorem 6.3).

In Section 7, using the Minkowski functional, we show that the order topology on every solid vector space is normable with a monotone norm (Theorem 7.1). We also show that every normal solid vector space Y is normable in the sense that there exists a norm on Y such that x n x if and only if x n x (Theorem 7.3). At the end of the section, we show that the convergence of sequences in a normal solid vector space has the properties of the convergence in ℝ (Theorem 7.4). This result shows that the sandwich theorem plays an important role in solid vector spaces. In particular, Theorem 7.4 shows that a sequence ( x n ) in a normal solid vector space converges to a vector x if and only if for every vector c0, we have xc x n x+c for sufficiently large n.

In Section 8, we introduce the classical definitions of cone metric spaces and cone normed spaces. Note that in our definition of a cone normed space (X,) we allow X to be a vector space over an arbitrary normed field K.

In Section 9, we study cone metric spaces over solid vector spaces. The theory of such cone metric spaces is very close to the theory of the usual metric spaces. For example, every cone metric space over a solid vector space is a metrizable topological space (Theorem 9.2) and in such spaces the nested ball theorem holds (Theorem 9.10). Moreover, the cone metric is equivalent to a metric which preserve some inequalities. Among the other results in this section, we prove that every cone normed space over a solid vector space is normable (Theorem 9.4). Also, in this section, we give some useful properties of cone metric spaces which allow us to establish convergence results for Picard iteration with a priori and a posteriori error estimates (Theorem 9.6 and Theorem 9.9). Some of the results in this section generalize, extend and complement some results of Du [34], Kadelburg, Radenović and Rakočević [37, 42], Çakalli, Sönmez and Genç [40], Simić [39], Abdeljawad and Rezapour [43], Arandelović and Kečkić [38], Amini-Harandi and Fakhar, [23], Khani and Pourmahdian [29], Sönmez [24], Asadi, Vaezpour and Soleimani [30], Şahin and Telsi [22] and Azam, Beg and Arshad [36].

In Section 10, we establish a full statement of the iterated contraction principle in cone metric spaces over a solid vector space. The main result of this section (Theorem 10.1) generalizes, extends and complements some results of Pathak and Shahzad [21], Wardowski [20], Ortega and Rheinboldt [[44], Theorem 12.3.2] and others.

In Section 11, we establish a full statement of the Banach contraction principle in cone metric spaces over a solid vector space. The main result of this section (Theorem 11.1) generalizes, extends and complements some results of Rezapour and Hamlbarani [19], Du [34], Radenović and Kadelburg [28] and others.

2 Vector spaces with convergence

In this section, we introduce a kind of sequential convergence in a vector space. There is a classical axiomatization of sequential convergence on an arbitrary set (see Fréchet [2], Dudley [45], Frič [46], Rus [47] Petruşel and Rus [48], Gutierres and Hofmann [49], Rus, Petruşel and Petruşel [15] and references therein). Let Y be any nonempty set and S be the set of all infinite sequences in Y. Let us recall that a sequential convergence or ℒ-convergence on Y is a relation → between S and Y such that:

A set endowed with a sequential convergence is called a sequential space or ℒ-space.

  1. (A0)

    If x n ?x and x n ?y, then x=y.

  2. (A1)

    If x n =x for all n, then x n ?x.

  3. (A2)

    If x n ?x and ( y n ) is any subsequence of ( x n ), then y n ?x.

Some authors consider the sequential convergence in vector spaces (see Jakubík [50], Schröder [16, 17], Collatz [4], De Pascale, Marino and Pietramala [51] , Zabrejko [6], Rus, Petruşel and Petruşel [15] and references therein). In the paper [50] of Jakubík are given the following axioms for sequential convergence in a vector space Y:

  1. (B1)

    If x n ?x and y n ?y, then x n + y n ?x+y.

  2. (B2)

    If x n ?x and ??R, then ? x n ??x.

  3. (B3)

    If ? n ?? in R and x?Y, then ? n x??x.

  4. (B4)

    If x n ?x and ( y n ) is any subsequence of ( x n ), then y n ?x.

  5. (B5)

    If x n ?x and x n ?y, then x=y.

It is clear that a vector space Y satisfying axioms (B1)-(B5) is a sequential space.

In this study, we do not need axioms (B4) and (B5). It is possible to prove some fixed point theorems without using axioms (B4) and (B5). We introduce the following definition of weak sequential convergence in a vector space Y.

Definition 2.1 Let Y be a real vector space and S be the set of all infinite sequences in Y. A binary relation → between S and Y is called a convergence on Y if it satisfies the following axioms:

  1. (C1)

    If x n ?x and y n ?y, then x n + y n ?x+y.

  2. (C2)

    If x n ?x and ??R, then ? x n ??x.

  3. (C3)

    If ? n ?? in R and x?Y, then ? n x??x.

The pair (Y,) is said to be a vector space with convergence. If x n x, then ( x n ) is said to be a convergent sequence in Y, and the vector x is said to be a limit of ( x n ).

The following two properties of the convergence in a vector space Y follow immediately from Definition 2.1.

  1. (C4)

    If x n =x for all n, then x n x.

  2. (C5)

    The convergence and the limits of a sequence do not depend on the change of finitely many of its terms.

Definition 2.2 Let (Y,) be a vector space with convergence.

  1. (a)

    A set AY is said to be (sequentially) open if x n x and xA imply x n A for all but finitely many n.

  2. (b)

    A set AY is said to be (sequentially) closed if x n x and x n A for all n imply xA.

Remark 2.1 Let (Y,) be a vector space with convergence. It is easy to prove that if a set AY is open, then YA is closed. Let us note that the converse holds true provided that every subsequence of a convergent sequence in Y is convergent with the same limits.

The following lemma follows immediately from the first part of Definition 2.2.

Lemma 2.1 Let (Y,) be a vector space with convergence. The open sets in Y satisfies the following properties:

  1. (i)

    and Y are open.

  2. (ii)

    The union of any family of open sets is open.

  3. (iii)

    The intersection of any finite family of open sets is open.

Remark 2.2 Lemma 2.1 shows that the family of all open subsets of (Y,) defines a topology on Y. Note that in this paper we will never consider this topology on Y.

Lemma 2.2 Let (Y,) be a vector space with convergence. Suppose U and V are two nonempty subsets of Y. Then the following statements hold true:

  1. (i)

    If U is open and λ>0, then λU is open.

  2. (ii)

    If U or V is open, then U+V is open.

Proof (i) Let λ>0 and U be an open subset of Y. Suppose ( x n ) is a convergent sequence in Y with a limit xλU. Then there exists a vector aU such that x=λa. Consider the sequence ( a n ) defined by a n = 1 λ x n . It follows from (C2) that a n a since a= 1 λ x. Taking into account that U is open and aU, we conclude that a n U for all but finitely many n. Then x n λU for the same n since x n =λ a n . Therefore, the set λU is open.

(ii) Let U be an arbitrary subset of Y and V be an open subset of Y. Suppose ( x n ) is a convergent sequence in Y with limit x?U+V. Then there exist a?U and b?V such that x=a+b. Consider the sequence ( b n ) defined by b n = x n -a. It follows from (C1) and (C4) that b n ?b since b=x-a. Taking into account that V is open and b?V, we conclude that b n ?V for all but finitely many n. Then x n ?U+V for these n since x n =a+ b n . Therefore, the set U+V is open. ?

Due to the first two parts of Lemma 2.1, we can give the following definition.

Definition 2.3 Let A be a subset of a vector space with convergence. The interior A of A is called the biggest open subset contained in A, that is, A =U where ⋃ ranges through the family of all open subsets of Y contained in A.

The following lemma follows immediately from Definition 2.3.

Lemma 2.3 Let A and B be two subsets of a vector space with convergence. Then

ABimplies A B .

Example 2.1 Let (Y,τ) be an arbitrary topological vector space and let τ be the τ-convergence in Y. Obviously, (Y, τ ) is a vector space with convergence. It is well known that every τ-open subset of (Y,τ) is sequentially open and every τ-closed set is sequentially closed. Recall also that a topological space is called a sequential topological space if it satisfies one of the following equivalent conditions:

  1. (a)

    Every sequentially open subset of Y is t-open.

  2. (b)

    Every sequentially closed subset of Y is t-closed.

According to a well-known theorem of Franklin [52], every first countable topological vector space is a sequential space. For more details on sequential topological spaces, we refer the reader to the survey paper of Goreham [53].

3 Solid cones in vector spaces with convergence

In this section, we establish a useful criterion for the interior of a solid cone. This criterion will play an important role in Section 5.

For more on cone theory, see the classical survey paper of Krein and Rutman [54], the classical monographs of Krasnoselskii [[55], Chapter 1], Deimling [[56], Chapter 6], Zeidler [[57], Section 1.6] as well as the recent monograph of Aliprantis and Tourky [58].

Definition 3.1 Let (Y,) be a vector space with convergence. A nonempty closed subset K of a vector space Y is called a cone if it satisfies the following properties:

  1. (i)

    ?K?K for any ?=0;

  2. (ii)

    K+K?K;

  3. (iii)

    Kn(-K)={0}.

A cone K is called trivial if K={0}. A nontrivial cone K is said to be a solid cone if its interior is nonempty.

Lemma 3.1 Let (Y,) be a vector space with convergence and K be a cone in Y. Then there is at most one nonempty open subset U of K satisfying the following conditions:

  1. (i)

    ?U?U for any ?>0;

  2. (ii)

    K+U?U;

  3. (iii)

    0?U.

Proof Let U be a nonempty open subsets of K satisfying conditions (i)-(iii). First we shall prove that every nonempty open subset V of K is a subset of U. Let a vector xV be fixed. Choose a vector aU with a0. This is possible since U is nonempty and 0U. Consider the sequence ( x n ) in Y defined by x n =x 1 n a. It follows from (C1) and (C4) that x n x. Since V is open and xV, then there exists nN such that x n V. Therefore, x n K since VK. On the other hand it follows from (i) that 1 n aU since aU. Then from (ii) we conclude that x= x n + 1 n aU which proves that VU. Now if U and V are two nonempty open subsets of K satisfying conditions (i)-(iii), then we have both VU and UV which means that U=V. □

Now we are ready to establish a criterion for the interior of a solid cone.

Theorem 3.1 Let (Y,) be a vector space with convergence and K be a cone in Y. Then the interior K of K has the following properties:

  1. (i)

    ? K ° ? K ° for any ?>0;

  2. (ii)

    K+ K ° ? K ° ;

  3. (iii)

    0? K ° .

Conversely, if a nonempty open subset K of K satisfies properties (i)-(iii), then K is just the interior of K.

Proof First part. We shall prove that the interior K of a solid cone K satisfies properties (i)-(iii).

  1. (i)

    Let ?>0. It follows from Lemma 2.2(i) that ? K ° is open. From K ° ?K and ?K?K, we conclude that ? K ° ?K. This inclusion and Lemma 2.3 imply ? K ° ? K ° .

  2. (ii)

    According to Lemma 2.2(ii) K+ K ° is an open set. It follows from K ° ?K and K+K?K that K+ K ° ?K. Now from Lemma 2.3, we obtain that K+ K ° ? K ° .

  3. (iii)

    Assume that 0? K ° . Since K is nonempty and nontrivial, then we can choose a vector a?K with a?0. By axiom (C3), - 1 n a?0. Taking into account that K ° is open, we conclude that there exists n?N such that - 1 n a? K ° . Then it follows from (i) that -a? K ° . Since K ° ?K, we have both a?K and -a?K, which implies a=0. This is a contradiction which proves that 0? K ° .

Second part. The second part of the theorem follows from Lemma 3.1. Indeed, suppose that K is a nonempty open subset of K satisfying properties (i)-(iii). Then by Lemma 3.1, we conclude that K is a unique nonempty open subset of K satisfying these properties. On the other hand, it follows from the first part of the theorem that the interior of K also satisfies properties (i)-(iii). Therefore, K coincide with the interior of K. □

4 Ordered vector spaces with convergence

Recall that a binary relation ⪯ on a set Y is said to be an ordering on Y if it is reflexive, antisymmetric and transitive.

Definition 4.1 Let (Y,) be a vector space with convergence. An ordering ⪯ on Y is said to be a vector ordering if it is compatible with the algebraic and convergence structures on Y in the sense that the following are true:

  1. (V1)

    If x?y, then x+z?y+z;

  2. (V2)

    If ?=0 and x?y, then ?x??y;

  3. (V3)

    If x n ?x, y n ?y, x n ? y n for all n, then x?y.

A vector space with convergence (Y,) equipped with a vector ordering ⪯ is called an ordered vector space with convergence and is denoted by (Y,,). If the convergence → on Y is produced by a vector topology τ, we sometimes write (Y,τ,) instead of (Y,,). Analogously, if the convergence → on Y is produced by a norm , we sometimes write (Y,,).

Axiom (V3) is known as passage to the limit in inequalities. Obviously, it is equivalent to the following statement:

(V3′) If x n x, x n 0 for all n, then x0.

Every vector ordering ⪯ on an ordered vector space (Y,,) satisfies also the following properties:

  1. (V4)

    If ?=0 and x?y, then ?x??y;

  2. (V5)

    If ?=µ and x?0, then ?x?µx;

  3. (V6)

    If ?=µ and x?0, then ?x?µx;

  4. (V7)

    If x?y and u?v, then x+u?y+v.

Definition 4.2 Let (Y,,) be an ordered vector space with convergence. The set

Y + ={xY:x0}
(4.1)

is called the positive cone of the ordering ⪯ or positive cone of Y.

The following well-known theorem shows that the positive cone is indeed a cone. It shows also that the vector orderings and cones in a vector space with convergence are in one-to-one correspondence.

Theorem 4.1 Let (Y,) be a vector space with convergence. If a relationis a vector ordering on Y, then its positive cone is a cone in Y. Conversely, if a subset K of Y is a cone, then the relationon Y defined by means of

xyif and only ifyxK
(4.2)

is a vector ordering on Y whose positive cone coincides with K.

Definition 4.3 Let (Y,,) be an ordered vector space with convergence.

  1. (a)

    A set A?Y is called bounded if there exist two vectors in a,b?Y such that a?x?b for all x?A.

  2. (b)

    A sequence ( x n ) in Y is called bounded if the set of its terms is bounded.

  3. (c)

    A sequence ( x n ) in Y is called increasing if x 1 ? x 2 ???.

  4. (d)

    A sequence ( x n ) in Y is called decreasing if x 1 ? x 2 ???.

Definition 4.4 An ordered vector space with convergence (Y,,) is called a solid vector space if its positive cone is solid.

Definition 4.5 An ordered vector space with convergence (Y,,) is called a normal vector space whenever for arbitrary sequences ( x n ), ( y n ), ( z n ) in Y,

x n y n z n for all n and  x n x and  z n ximply y n x.
(4.3)

The statement (4.3) is known as sandwich theorem or rule of intermediate sequence.

Definition 4.6 An ordered vector space with convergence (Y,,) is called a regular vector space if it satisfies one of the following equivalent conditions.

  1. (a)

    Every bounded increasing sequence in Y is convergent.

  2. (b)

    Every bounded decreasing sequence in Y is convergent.

5 Strict vector orderings and solid cones

In this section, we introduce the new notion of strict vector ordering and prove that an ordered vector space with convergence can be equipped with a strict vector ordering if and only if it is a solid vector space.

Recall that a nonempty binary relation ≺ on a set Y is said to be a strict ordering on Y if it is irreflexive, asymmetric and transitive.

Definition 5.1 Let (Y,,) be an ordered vector space with convergence. A strict ordering ≺ on Y is said to be a strict vector ordering if it is compatible with the vector ordering, the algebraic structure and the convergence structure on Y in the sense that the following are true:

  1. (S1)

    If x?y, then x?y;

  2. (S2)

    If x?y and y?z, then x?z;

  3. (S3)

    If x?y, then x+z?y+z;

  4. (S4)

    If ?>0 and x?y, then ?x??y;

  5. (S5)

    If x n ?x, y n ?y and x?y, then x n ? y n for all but finitely many n.

An ordered vector space with convergence (Y,,) equipped with a strict vector ordering ≺ is denoted by (Y,,,). It turns out that ordered vector spaces with strict vector ordering are just solid vector spaces (see Corollary 5.1 below).

Axiom (S5) is known as converse property of passage to the limit in inequalities. It is equivalent to the following statement:

(S5′) If x n 0 and c0, then x n c for all but finitely many n.

Strict vector ordering ≺ on a ordered vector space with convergence (Y,,) satisfies also the following properties:

  1. (S6)

    If ?<0 and x?y, then ?x??y;

  2. (S7)

    If ?<µ and x?0, then ?x?µx;

  3. (S8)

    If ?<µ and x?0, then ?x?µx;

  4. (S9)

    If x?y and y?z, then x?z;

  5. (S10)

    If x?y and u?v, then x+u?y+v;

  6. (S11)

    If x?c for each c?0, then x?0;

  7. (S12)

    For every finite set A?Y consisting of strictly positive vectors, there exists a vector c?0 such that c?x for all x?A. Moreover, for every vector b?0, c always can be chosen in the form c=?b for some ?>0;

  8. (S13)

    For every finite set A?Y, there is a vector c?0 such that -c?x?c for all x?A. Moreover, for every vector b?0, c always can be chosen in the form c=?b for some ?>0;

  9. (S14)

    For every x?Y and every b?Y with b?0, there exists ?>0 such that -?b?x??b.

The proofs of properties (S6)-(S10) are trivial. Property (S14) is a special case of (S13). So we shall prove (S11)-(S13).

Proof of (S11) Let x be a vector in Y such that xc for each c0. Choose a vector bY with b0. It follows from (S4) that 1 n b0 for each nN. Hence, x 1 n b for each nN. Passing to the limit in this inequality, we obtain x0. □

Proof of (S12) Let x be an arbitrary vector from A. Choose a vector bY with b0. Since 1 n b0 and 0x, then from (S5) we deduce that 1 n bx for all but finitely many n. Taking into account that A is a finite set, we conclude that for sufficiently large n we have 1 n bx for all xA. Now every vector c= 1 n b with sufficiently large n satisfies cx for all xA. To complete the proof put λ= 1 n . □

Proof of (S13) Let x be an arbitrary vector from A. Choose a vector bY with b0. Since 1 n x0 and 1 n x0, then from (S5) we obtain that 1 n xb and 1 n xb for all but finitely many n. From these inequalities, we conclude that nbxnb. Taking into account that A is a finite set, we get that every vector c=nb with sufficiently large n satisfies cxc for all xA. To complete the proof, put λ=n. □

The next theorem shows that an ordered vector space with convergence can be equipped with a strict vector ordering if and only if it is a solid vector space. Moreover, on every ordered vector space, there is at most one strict vector ordering. In other words, the solid cones and strict vector orderings on a vector space with convergence are in one-to-one correspondence.

Theorem 5.1 Let (Y,,) be an ordered vector space with convergence, and let K be its positive cone, i.e., K={xY:x0}. If a relationis a strict vector ordering on Y, then K is a solid cone with the interior

K ={xY:x0}.
(5.1)

Conversely, if K is a solid cone with the interior K , then the relationon Y defined by means of

xyif and only ifyx K
(5.2)

is a unique strict vector ordering on Y.

Proof First part. Suppose a relation ≺ is a strict vector ordering on Y. We shall prove that the set K defined by (5.1) is a nonempty open subset of K which satisfies conditions (i)-(iii) of Theorem 3.1. Then it follows from the second part of Theorem 3.1 that K is the interior of K and that K is a solid cone. By the definition of strict ordering, it follows that the relation ≺ is nonempty. Therefore, there are at least two vectors a and b in Y such that ab. From (S3), we obtain ba0. Therefore, ba K , which proves that K is nonempty. Now let x n x and x K . By the definition of K , we get x0. Then by (S5), we conclude that x n 0 for all but finitely many n which means that K is open. Conditions (i) and (ii) of Theorem 3.1 follow immediately from (S4) and (S10), respectively. It remains to prove that 0 K . Assume the contrary, that is 0 K . By the definition of  K , we get 00, which is a contradiction since the relation ≺ is irreflexive.

Second part. Let K be a solid cone and K be its interior. Note that according to the first part of Theorem 3.1, K has the following properties: λ K K for any λ>0, K+ K K and 0 K . We have to prove that the relation ≺ defined by (5.2) is a strict vector ordering. First we shall show that ≺ is nonempty and irreflexive. Since K is solid, K is nonempty and nontrivial. Hence, there exists a vector c K such that c0. Now by the definition of ≺, we get 0c which means that ≺ is nonempty. To prove that ≺ is irreflexive assume the contrary. Then there exists a vector xY such that xx. Hence, 0=xx K which is a contradiction since 0 K . Now we shall show that ≺ satisfies properties (S1)-(S5).

  1. (S1)

    Let x?y. Using the definition (5.2), the inclusion K ° ?K, and the definition of the positive cone K, we have

    x?y?y-x? K ° ?y-x?K?y-x?0?x?y.
  2. (S2)

    Let x?y and y?z. Using the definition of the positive cone K, the definition (5.2) and the inclusion K+ K ° ? K ° , we get

    x?y and y?z?y-x?K and z-y? K ° ?z-x? K ° ?x?z.
  3. (S3)

    follows immediately from the definition (5.2).

  4. (S4)

    Let x?y and ?>0. Using the definition (5.2) and taking into account that ? K ° ? K ° , we obtain

    x?y?y-x? K ° ??(y-x)? K ° ??y-?x? K ° ??x??y.
  5. (S5)

    Let x n ?x, y n ?y and x?y. This yields y n - x n ?y-x and y-x? K ° . Since K ° is open, we conclude that y n - x n ? K ° for all but finitely many n. Hence, x n ? y n for all but finitely many n.

Uniqueness. Now we shall prove the uniqueness of the strict vector ordering on Y. Assume that ≺ and < are two vector orderings on Y. It follows from the first part of the theorem that

K ={xY:x0}={xY:x>0}.

From this and (S3), we get for all x,yY,

xyyx0yx K yx>0x<y

which means that relations ≺ and < are equal. □

Note that property (S13) shows that every finite set in a solid vector space is bounded. Property (S12) shows that every finite set consisting of strictly positive vectors in a solid vector space is bounded below by a positive vector.

The following assertion is an immediate consequence of Theorem 5.1. It shows that a solid vector space can be defined as an ordered vector space with convergence equipped with a strict vector ordering.

Corollary 5.1 Let (Y,,) be an ordered vector space with convergence. Then the following statements are equivalent:

  1. (i)

    Y is a solid vector space.

  2. (ii)

    Y can be equipped with a strict vector ordering.

Remark 5.1 The strict ordering ≺ defined by (5.2) was first introduced in 1948 by Krein and Rutman [[54], p.8] in the case when K is a solid cone in a Banach space Y. In this case, they proved that ≺ satisfies axioms (S1)-(S4).

In conclusion of this section, we present three examples of solid vector spaces We end the section with a remark which shows that axiom (S5) plays an important role in the definition of strict vector ordering.

Example 5.1 Let Y= R n equipped with the coordinate-wise convergence →, and with coordinate-wise ordering defined by

Then (Y,,,) is a solid vector space. This space is normal and regular.

Example 5.2 Let Y=C[0,1] with the max-norm . Define the pointwise ordering ⪯ and ≺ on Y by means of

Then (Y, ,,) is a solid Banach space. This space is normal but nonregular. Consider, for example, the sequence ( x n ) in Y defined by x n (t)= t n . We have x 1 x 2 0 but ( x n ) is not convergent in Y.

Example 5.3 Let Y= C 1 [0,1] with the norm x= x + x . Define the ordering ⪯ and ≺ as in Example 5.2. Then (Y,,,) is a solid Banach space. The space Y is not normal. Consider, for example, the sequences ( x n ) and ( y n ) in Y defined by x n (t)= t n n and y n (t)= 1 n . It is easy to see that 0 x n y n for all n, y n 0 and x n 0.

Remark 5.2 Let (Y,,) be an arbitrary ordered vector space with convergence. Then the relation ≺ on Y defined by

xyif and only ifxy and xy
(5.3)

is a strict ordering on Y and it always satisfies axioms (S1)-(S4) and properties (S5)-(S10). However, it is not in general a strict vector ordering on Y. For example, from the uniqueness of strict vector ordering (Theorem 5.1), it follows that ≺ defined by (5.3) is not a strict vector ordering in the ordered vector spaces defined in Examples 5.1-5.3.

6 Order topology on solid vector spaces

In this section, we show that every solid vector space can be endowed with an order topology τ and that x n x implies x n τ x. As a consequence, we show that every convergent sequence in a solid vector space has a unique limit.

Definition 6.1 Let (Y,,,) be a solid vector space, and let a,bY be two vectors with ab. Then the set (a,b)={xY:axb} is called an open interval in Y.

It is easy to see that every open interval in Y is an infinite set. Indeed, one can prove that a+λ(ba)(a,b) for all λR with 0<λ<1.

Theorem 6.1 Let (Y,,,) be a solid vector space. Then the collectionof all open intervals in Y is a basis for a Hausdorff topology τ on Y.

Proof One has to prove that ℬ satisfies the requirements for a basis. First, note that every vector x of Y lies in at least one element of ℬ. Indeed, x(xc,x+c) for each vector c0. Second, note that the intersection of any two open intervals contains another open interval, or is empty. Suppose ( a 1 , b 1 ) and ( a 2 , b 2 ) are two elements of ℬ and a vector x lies in their intersection. Then b i x0 and x a i 0 for i=1,2. It follows from (S12) that there exists a vector c0 such that c b i x and cx a i for i=1,2. Hence, a i xc and x+c b i for i=1,2. This implies that

(xc,x+c)( a 1 , b 1 )( a 2 , b 2 ).

It remains to show that the topology τ is Hausdorff. We shall prove that for all x,yX with xy there exists c0 such that the intersection of the intervals (xc,x+c) and (yc,y+c) is empty. Assume the contrary. Then there exists x,yX with xy such that for every c0 the intersection of (xc,x+c) and (yc,y+c) is nonempty. Now let c0 be fixed. Hence, there is a vector zY satisfying xczx+c and yczy+c. Therefore,

cxzcandczyc.

Using (S10), we get

2cxy2c.

Applying these inequalities to 1 2 c, we conclude that xyc and yxc for each c0. Now it follows from (S11) that xy and yx, which is a contradiction since xy. □

Thanks to Theorem 6.1, we can give the following definition.

Definition 6.2 Let (Y,,,) be a solid vector space. The topology τ on Y with basis formed by open intervals in Y is called the order topology on Y.

Remark 6.1 Let (Y,,,) be a solid vector space. It follows from the proof of Theorem 6.1 that the collection

B = { ( x c , x + c ) : x , c Y , c 0 }

is also a basis for the order topology τ on Y.

Theorem 6.2 Let (Y,,,) be a solid vector space and let τ be the order topology on Y. Then:

  1. (i)

    For a sequence ( x n ) in Y, x n ? t x if and only if for every c?0 there exists N?N such that x-c? x n ?x-c for all n>N.

  2. (ii)

    For a sequence ( x n ) in Y, x n ?x implies x n ? t x.

Proof The first claim follows from Remark 6.1. Let x n x and (a,b) be a neighborhood of x. From axb and (S5), we conclude that x n (a,b) for all but finitely many n. Hence, x n τ x which proves the second claim. □

At the end of the next section, we shall prove that the converse of the statement (ii) of Theorem 6.2 holds true if and only if Y is normal.

Theorem 6.3 If (Y,,,) is a solid vector space, then the convergence on Y has the following properties.

  1. (C6)

    Each convergent sequence in Y has a unique limit.

  2. (C7)

    Each convergent sequence in Y is bounded.

Proof (C6) Let ( x n ) be a convergent sequence in Y. Assume that there are x,yY such that x n x and x n y. It follows from Theorem 6.2 that x n τ x and x n τ y. According to Theorem 6.1 the topology τ is Hausdorff. Now by the uniqueness of the limit of a convergent sequence in the Hausdorff topological space (Y,τ), we conclude that x=y.

(C7) Let ( x n ) be a convergent sequence in Y and x n x. By Theorem 6.2, x n τ x. Choose an open interval (a,b) which contains x. Then there exists a natural number N such that x n (a,b) for all nN. According to (S13), the set {a,b, x 1 ,, x N } is bounded in Y which proves that ( x n ) is bounded. □

7 Minkowski functional on solid vector spaces

In this section, using the Minkowski functional, we prove that the order topology on every solid vector space is normable. Also, we show that every normal solid vector space Y is normable in the sense that there exists a norm on Y such that x n x if and only if x n x. Finally, we give a criterion for a normal vector space and show that the convergence of a sequence in normal solid vector space has the properties of the convergence in ℝ. This last result shows that the sandwich theorem plays an important role in solid vector spaces.

Definition 7.1 Let Y be a real vector space. A subset A of Y is called:

  1. (a)

    absorbing, if for all xY there exists λ>0 such that xλA;

  2. (b)

    balanced, if λAA for every λR with |λ|1.

Definition 7.2 Let Y be a real vector space and AY an absorbing set. Then the functional :YR defined by

x=inf{λ0:xλA}
(7.1)

is called the Minkowski functional of A.

It is well known (see, e.g., Rudin [[59], Theorem 1.35]) that the Minkowski functional of every absorbing, convex and balanced subset A of a vector space Y is a seminorm on Y.

Lemma 7.1 Let (Y,,) be an ordered vector space with convergence. Suppose a subset A of Y is an absorbing, convex, balanced and bounded. Then the Minkowski functional :YR of A is a norm on Y. Moreover, if A is closed, then

x=min{λ0:xλA}.
(7.2)

Proof Let xY be fixed and let B x ={λ0:xλA}. Since A is absorbing, B x is nonempty. Since A is balanced, α B x and α<β imply β B x . Let inf B x =λ. By the definition of inf B x , for every nN there exists αB such that α<λ+ 1 n . Hence, λ+ 1 n B x which means that x(λ+ 1 n )A.

Now we are ready to prove the is indeed a norm on Y. Since the Minkowski functional of A is seminorm, we have only to prove that x=0 implies x=0. Let x be a vector in Y such that x=0. In the case λ=0 the inclusion x(λ+ 1 n )A reduces to x 1 n A. Since A is bounded, there is an interval [a,b] containing A. Hence, 1 n ax 1 n b for all nN. According to (C3), 1 n a0 and 1 n b0. Hence, applying (V3) we conclude that 0x0 which means that x=0.

It remains to prove (7.2) provided that A is closed. We have to prove that λ=inf B x belongs to B x . If λ=0, then x=0 which implies that λ B x . Now let λ0. The inclusion x(λ+ 1 n )A implies that the sequence ( x n ) defined by x n = ( λ + 1 n ) 1 x lies in A. According to (C3), x n λ 1 x which implies x λ 1 A since A is closed. Hence, xλA which proves that λ B x . □

Definition 7.3 Let (Y,,) be an ordered vector space with convergence, and let a,bY be two vectors with ab. The set [a,b]={xY:axb} is called a closed interval in Y.

Obviously, every closed interval [b,b] in an ordered vector space with convergence Y is a convex, balanced, closed and bounded set. It follows from (S14) that [b,b] is also an absorbing set provided that Y is a solid vector space and b0.

Definition 7.4 Let (Y,,) be an ordered vector space with convergence. A norm on Y is called:

  1. (a)

    monotone if ?x?=?y? whenever 0?x?y;

  2. (b)

    semimonotone if there exists a constant K>0 such that ?x?=K?y? whenever 0?x?y.

Lemma 7.2 Let (Y,,,) be a solid vector space, and let :YR be the Minkowski functional of [b,b] for some vector b in Y with b0. Then:

  1. (i)

    ?·? is a monotone norm on Y which can be defined by

    ?x?=min{?=0:-?b?x??b}.
    (7.3)
  2. (ii)

    For x?Y and e>0,

    ?x?<e if and only if -eb?x?eb.
    (7.4)

Proof (i) The claim with the exception of the monotonicity of the norm follows from Lemma 7.1. Let x and y be two vectors in Y such that 0xy. From (7.3), we get yyb. Hence, ybxyb. Again from (7.3), we obtain xy. Hence, is a monotone norm.

  1. (ii)

    Let ?x?<e. From (7.3), we have -?x?b?x??x?b, which implies

    -eb?x?eb.

Conversely, let εbxεb. Then εbx0 and εb+x0. It follows from (S12) that there is λ>0 such that εbxλb and εb+xλb. Consequently,

(ελ)bx(ελ)b.

From this and (7.3), we conclude that xελ<ε. □

The following theorem shows that the order topology on Y is normable.

Theorem 7.1 Let (Y,,,) be a solid vector space, and let :YR be the Minkowski functional of [b,b] for some bY with b0. Then:

  1. (i)

    The monotone norm ?·? generates the order topology on Y.

  2. (ii)

    For a sequence ( x n ) in Y, x n ?x implies x n ? ? · ? x.

  3. (iii)

    For a sequence ( x n ) in Y, x n ?x if and only if x n ? ? · ? x, provided that the space Y is normal.

Proof (i) Denoting by B(x,ε) an open ball in the normed space (Y,), we shall prove that each B(x,ε) contains some interval (u,v) in Y and vice versa. First, we shall prove the following identity:

B(x,ε)=(xεb,xεb)for all xY and ε>0.
(7.5)

According to Lemma 7.2, for each x,yYand ε>0,

xy<εif and only ifxεbyx+εb

which proves (7.5). Note that identity (7.5) means that every open ball in the normed space (Y,) is an open interval in Y. Now let (u,v) be an arbitrary open interval in Y and let x(u,v). Choose an interval of the type (xc,x+c), which is a subset of (u,v), where cY with c0. Then choosing ε>0 such that εbc, we conclude by (7.5) that B(x,ε)(u,v).

(ii) follows from (i) and Theorem 6.2.

(iii) Suppose that Y is a normal vector space. According to (ii), we have to prove that x n x implies x n x. To prove this it sufficient to show that x n 0 implies x n 0. Let ( x n ) be a sequence in Y such that x n 0. By Lemma 7.2, we have

x n b x n x n bfor all n.

Now applying the sandwich theorem, we conclude that x n 0, which completes the proof. □

The main part of Theorem 7.1 can be formulated in the following theorem.

Theorem 7.2 Let (Y,,,) be a solid vector space. Then there exists a monotone norm on Y such that the following statements hold true.

  1. (i)

    The norm ?·? generates the order topology on Y.

  2. (ii)

    For a sequence ( x n ) in Y, x n ?x implies x n ? ? · ? x.

  3. (iii)

    If Y is a normal vector space, then for a sequence ( x n ) in Y, x n ?x if and only if x n ? ? · ? x.

In the next theorem, we shall give a criterion for a normal vector space. In particular, this theorem shows that every normal solid vector space Y is normable in the sense that there exists a norm on Y such that x n x if and only if x n x. Analogous result for normability of normal topological vector space was proved by Vandergraft [60].

Theorem 7.3 Let (Y,,,) be a solid vector space. Then the following statements are equivalent:

  1. (i)

    Y is a normal vector space.

  2. (ii)

    The convergence in Y is generated by a monotone norm on Y.

  3. (iii)

    The convergence in Y is generated by the order topology on Y.

Proof (i) → (ii) Suppose Y is a normal vector space. Let :YR be the Minkowski functional of [b,b] for some vector b in Y with b0. According to Lemma 7.2, the Minkowski functional of [b,b] is a monotone norm on Y. We shall prove that the convergence in Y is generated by this norm. We have to prove that for a sequence ( x n ) in Y, x n x if and only if x n x. Without loss of generality, we may assume that x=0. Then we have to prove that x n 0 if and only if x n 0. Taking into account Theorem 7.1, we have only to prove that x n 0 implies x n 0. Let x n 0. By Lemma 7.2, we get

x n b x n x n bfor all n.

It follows from axiom (C3) that x n b0. Then by the sandwich theorem, we conclude that x n 0.

(ii) → (iii) Suppose the convergence in Y is generated by a monotone norm on Y, i.e., for a sequence ( x n ) in Y, x n x if and only if x n x. We shall prove that the convergence in Y is generated by the order topology τ on Y. According to Theorem 6.2, it is sufficient to prove that for a sequence ( x n ) in Y, x n τ x implies x n x. Again without loss of generality, we may assume that x=0. Let x n τ 0. Let ε>0 be fixed. It follows from Theorem 6.2 that for every vector c0,

c x n c
(7.6)

for all sufficiently large n. From (7.6), we obtain 0c x n 2c. By monotonicity of the norm, we conclude that c x n 2c, which implies that x n 3c. Now choosing a vector c0 such that c<ε/3, we obtain x n <ε for all sufficiently large n. Hence, x n 0, which is equivalent to x n x.

(iii) → (i) Suppose the convergence in Y is generated by the order topology on Y. We shall prove that Y is normal. Obviously, condition (4.3) in Definition 4.5 is equivalent to the following:

0 x n y n for all n and  y n 0imply x n 0.
(7.7)

Let ( x n ) and ( y n ) be two sequences in Y such that 0 x n y n for all n and y n 0. We have to prove that x n 0. Let c0 be fixed. It follows from y n 0 and (S5) that y n c for all but finitely many n. From this and 0 x n y n , we conclude that c x n c for all sufficiently large n. Now it follows from Theorem 6.2 that x n τ x which is equivalent to x n 0. □

Note that Theorem 7.3 remains true if we replace in it ‘monotone norm’ by ‘semimonotone norm’.

The following theorem shows that the convergence in a normal solid vector space has the properties of the convergence in ℝ.

Theorem 7.4 If (Y,,,) is a normal solid vector space, then the convergence on Y has the following additional properties:

  1. (C8)

    Each subsequence of a convergent sequence converges to the same limit.

  2. (C9)

    The convergence of a sequence and its limit do not depend on finitely many of its terms.

  3. (C10)

    If ? n ?? in R and x n ?x, then ? n x n ??x.

  4. (C11)

    If ? n ?0 in R and ( x n ) is a bounded sequence in Y, then ? n x n ?0.

  5. (C12)

    If ( ? n ) is a bounded sequence in R and x n ?0, then ? n x n ?0.

  6. (C13)

    For each sequence ( x n ) in Y, x n ?x if and only if for every c?0 there exists a natural number N such that x-c? x n ?x+c for all n>N.

Proof Let be a norm on Y that generates the convergence in Y. The existence of such norm follows from Theorem 7.3. The properties C8)-(C10) are valid in any normed space. Property (C13) follows from Theorems 6.2 and 7.3. The proofs of (C11) and (C12) are similar. We will prove only (C11). Since ( x n ) is bounded, there exist a,bY such that a x n b for all n. This implies

| λ n |a| λ n | x n | λ n |b.
(7.8)

By axiom (C3), we get | λ n |a0 and | λ n |b0. Applying the sandwich theorem to the inequalities (7.8), we conclude that | λ n | x n 0. Then by Theorem 7.3, we obtain | λ n | x n 0, that is, λ n x n 0. Again by Theorem 7.3, we conclude that λ n x n 0. □

8 Cone metric spaces and cone normed spaces

In this section, we introduce the notions of cone metric spaces and cone normed spaces. Cone metric spaces were first introduced in 1934 by Kurepa [3]. Cone normed spaces were first introduced in 1936 by Kantorovich [18, 61]. For more on these abstract metric spaces, see the monograph of Collatz [4], the survey paper of Zabrejko [6] as well as the recent monograph of Rus, Petruşel and Petruşel [15] and references therein.

There are a lot of generalizations of the classical Banach fixed point principle in cone metric spaces (see Schröder [16, 17], Perov [62], Collatz [[4], Chapter 2], Zabrejko [6], De Pascale, Marino and Pietramala [51], Rus, Petruşel and Şerban [7], Rus, Petruşel and Petruşel [[15], Chapter 6] and references therein).

Definition 8.1 Let X be a nonempty set, and let (Y,,) be an ordered vector space with convergence. A vector-valued function d:X×XY is said to be a cone metric on Y if the following conditions hold:

  1. (i)

    d(x,y)?0 for all x,y?X and d(x,y)=0 if and only if x=y;

  2. (ii)

    d(x,y)=d(x,y) for all x,y?X;

  3. (iii)

    d(x,y)?d(x,z)+d(z,y) for all x,y,z?X.

The pair (X,d) is called a cone metric space over Y. The elements of a cone metric space X are called points.

Obviously, every metric space is a cone metric space over ℝ. In Section 9 we show that the theory of cone metric spaces over solid vector spaces is very close to the theory of the metric spaces.

Definition 8.2 Let K be an arbitrary field. A map ||:KR is called a norm or absolute value on K if it satisfies the following axioms:

  1. (i)

    |x|=0 for all x?X and |x|=0 if and only if x=0;

  2. (ii)

    |xy|=|x|·|y| for all x,y?X;

  3. (iii)

    |x+y|=|x|+|y| for all x?X.

An absolute value is called trivial if |x|=1 for x0. A field (K,||) equipped with a nontrivial absolute value is called a normed field or valued field.

Note that finite fields and their extensions only have the trivial absolute value. A normed field is always assumed to carry the topology induced by the metric

ρ(x,y)=|xy|,

with respect to which it is a topological field. An absolute value is also called a multiplicative valuation or a norm. For more on normed fields, see, e.g., Katok [[63], Section 1.2] or Engler and Prestel [[64], Section 1.1].

One of the most important class of cone metric spaces is the class of cone normed spaces.

Definition 8.3 Let X be a vector space over a normed field (K,||), and let (Y,,) be an ordered vector space with convergence. A map :XY is said to be a cone norm on X if the following conditions hold:

  1. (i)

    ?x??0 for all x?X and ?x?=0 if and only if x=0;

  2. (ii)

    ??x?=|?|?y? for all ??K and x?X;

  3. (iii)

    ?x+y???x?+?y? for all x,y?X.

The pair (X,) is said to be a cone normed space over Y.

It is easy to show that each cone normed space (X,) over an ordered vector space with convergence Y is a cone metric space over Y with the cone metric defined by d(x,y)=xy.

We end this section with the definitions of closed balls and bounded sets in cone metric spaces.

Definition 8.4 Suppose (X,d) is a cone metric space over an ordered vector space with convergence (Y,,). For a point x 0 X and a vector rY with r0, the set

U ¯ ( x 0 ,r)= { x X : d ( x , x 0 ) r }

is called a closed ball with center x 0 and radius r.

Definition 8.5 Let X be a cone metric space.

  1. (a)

    A set A?X is called bounded if it is contained in some closed ball.

  2. (b)

    A sequence ( x n ) in X is called bounded if the set of its terms is bounded.

Let (X,d) be a cone metric space over an ordered vector space with convergence (Y,,). It is easy to show that a nonempty set AX is bounded if and only if there exists a vector bY such that d(x,y)b for all x,yA.

Analogously, if (X,) is a cone normed space over an ordered vector space with convergence (Y,,), then a nonempty set AX is bounded if and only if there exists a vector bY such that xb for all xA.

9 Cone metric spaces over solid vector spaces

In this section, we shall study the cone metric spaces over solid vector spaces. The theory of such cone metric spaces is very close to the theory of the usual metric spaces. We show that every cone metric space over a solid vector space is a metrizable topological space. Every cone normed space over a solid vector space is normable.

9.1 Topological structure of cone metric spaces

Definition 9.1 Let (X,d) be a cone metric space over a solid vector space (Y,,,). For a point x 0 X and a vector rY with r0, the set

U( x 0 ,r)= { x X : d ( x , x 0 ) r }

is called an open ball with center x 0 and radius r.

Theorem 9.1 Let (X,d) be a cone metric space over a solid vector space (Y,,,). Then the collection

B= { U ( x , r ) : x X , r Y , r 0 }

of all open balls in X is a basis for a topology τ d on X.

Proof Suppose that U( x 1 , c 1 ) and U( x 2 , c 2 ) are two open balls in X and take

xU( x 1 , c 1 )U( x 2 , c 2 ).

Then d(x, x i ) c i for i=1,2. From (S3), we get c i d(x, x i )0 for i=1,2. It follows from (S12) that there exists a vector cY with c0 such that c c i d(x, x i ) for i=1,2. By (S3), we obtain d(x, x i ) c i c for i=1,2. Now using the triangle inequality and (S10), it easy to show that

U(x,c)U( x 1 , c 1 )U( x 2 , c 2 ).

Therefore, the collection ℬ is a basis for a topology on X. □

Thanks to Theorem 9.1 we can give the following definition.

Definition 9.2 Let (X,d) be a cone metric space over a solid vector space (Y,,,). The topology τ d on X with basis formed by open balls in X is called the cone metric topology on X.

We shall always assume that a cone metric space (X,d) over a solid vector space Y is endowed with the cone metric topology τ d . Hence, every cone metric space is a topological space.

Definition 9.3 Let (X,d) be a cone metric space over a solid vector space (Y,,,). Then:

  1. (i)

    A sequence ( x n ) in X is called Cauchy if for every c?Y with c?0 there is N?N such that d( x n , x m )?c for all n,m>N.

  2. (ii)

    A cone metric space X is called complete if each Cauchy sequence in X is convergent.

  3. (iii)

    A complete cone normed space is called a cone Banach space.

In the following theorem, we show that each cone metric space (X,d) over a solid vector space is metrizable. Besides, if (X,d) is a complete cone metric space, then it is completely metrizable. Moreover, the cone metric is equivalent to a metric which preserve some inequalities.

Theorem 9.2 Let (X,d) be a cone metric space over a solid vector space (Y,,,). Suppose :YR is the Minkowski functional of [b,b] for some bY with b0. Define the metric ρ on X by ρ(x,y)=d(x,y). Then:

  1. (i)

    The topology of (X,d) coincides with the topology of (X,?).

  2. (ii)

    (X,d) is complete if and only if (X,?) is complete.

  3. (iii)

    For x, x 1 ,, x n ?X, y, y 1 ,, y n ?X, a?Y and ? 1 ,, ? n ?R,

    d(x,y)?a+ ? i = 1 n ? i d( x i , y i ) implies ?(x,y)=?a?+ ? i = 1 n ? i ?( x i , y i ).

Proof (i) It follows from Lemma 7.2(i) and Definition 8.1 that ρ is a metric on X. Denoting by B(x,ε) an open ball in the metric space (X,ρ) and by U(x,c) an open ball in the cone metric space (X,d), we shall prove that each B(x,ε) contains some U(x,c) and vice versa. First, we shall show that

B(x,ε)=U(x,εb)for all xX and ε>0.
(9.1)

According to Lemma 7.2(ii), for all x,yX and ε>0,

d ( x , y ) <εif and only ifd(x,y)εb,

that is,

ρ(x,y)<εif and only ifd(x,y)εb
(9.2)

which proves (9.1). Note that identity (9.1) means that every open ball in the metric space (X,ρ) is an open ball in the cone metric space (X,d). Now let U(x,c) be an arbitrary open ball in the cone metric space (X,d). Choosing ε>0 such that εbc, we conclude by (9.1) that B(x,ε)U(x,c).

(ii) Let ( x n ) be a sequence in X. We have to prove that ( x n ) is d-Cauchy if and only if it is ρ-Cauchy. First note that (9.2) implies that for each ε>0 and all m,nN,

ρ( x n , x m )<εif and only ifd( x n , x m )εb.

Let ( x n ) be d-Cauchy and ε>0 be fixed. Then there is an integer N such that d( x n , x m )εb for all m,n>N. Hence, ρ( x n , x m )<ε for all m,n>N which means that ( x n ) be ρ-Cauchy.

Now, let ( x n ) be ρ-Cauchy and c0 be fixed. Choose ε>0 such that εbc. Then there is an integer N such that d( x n , x m )<ε for all m,n>N. Therefore, for these n and m we get d( x n , x m )εbc, which means that ( x n ) is d-Cauchy.

(iii) follows from the monotony of the norm and the definition of the metric ρ. □

As we have seen the identity (9.1) plays an important role in the proof of Theorem 9.2. It is easy to see that this identity holds also for closed balls in the spaces (X,ρ) and (X,d). Namely, we have

B ¯ (x,ε)= U ¯ (x,εb)for all xX and ε>0.
(9.3)

The main idea of Theorem 9.2 can be formulated in the following theorem.

Theorem 9.3 Let (X,d) be a cone metric space over a solid vector space (Y,,,). Then there exists a metric ρ on X such that the following statements hold true.

  1. (i)

    The topology of (X,d) coincides with the topology of (X,?).

  2. (ii)

    (X,d) is complete if and only if (X,?) is complete.

  3. (iii)

    For x, x 1 ,, x n ?X, y, y 1 ,, y n ?X and ? 1 ,, ? n ?R,

    d(x,y)? ? i = 1 n ? i d( x i , y i ) implies ?(x,y)= ? i = 1 n ? i ?( x i , y i ).

Metrizable topological spaces inherit all topological properties from metric spaces. In particular, it follows from Theorem 9.3 that every cone metric space over a solid vector space is a Hausdorff paracompact space and first-countable. Since every first countable space is sequential, we immediately get that every cone metric space is a sequential space. Hence, as a consequence of Theorem 9.3 we get the following corollary.

Corollary 9.1 Let (X,d) be a cone metric space over a solid vector space Y. Then the following statements hold true:

  1. (i)

    A subset of X is open if and only if it is sequentially open.

  2. (ii)

    A subset of X is closed if and only if it is sequentially closed.

  3. (iii)

    A function f:D?X?X is continuous if and only if it is sequentially continuous.

Lemma 9.1 Let (X,d) be a cone metric space over a solid vector space Y. Then every closed ball U ¯ (a,r) in X is a closed set.

Proof According to Corollary 9.1 we have to prove that U ¯ (a,r) is a sequentially closed set. Let ( x n ) be a convergent sequence in U ¯ (a,r) and let xY be its limit. Let cY with c0 be fixed. Since x n x, then there exists nN such that d( x n ,x)c. Using the triangle inequality, we get d(x,a)d( x n ,a)+d( x n ,x)r+c. Hence, d(x,a)rc for all cY with c0. Then by (S11) we conclude that d(x,a)r0 which implies x U ¯ (a,r). Therefore, U ¯ (a,r) is a closed set in X. □

Remark 9.1 Theorem 9.3 plays an important role in the theory of cone metric spaces over a solid vector space. In particular, using this theorem one can prove that some fixed point theorems in cone metric spaces are equivalent to their versions in usual metric spaces. For example, the short version of the Banach contraction principle in complete cone metric spaces (see Theorem 11.2 below) follows directly from its short version in metric spaces. Du [34] was the first who showed that there are equivalence between some metric and cone metric results. He obtained his results using the so-called nonlinear scalarization function. One year later, Kadelburg, Radenović and Rakočević [37] showed that the same results can be obtained using Minkowski functional in topological vector spaces.

Remark 9.2 Theorem 9.2 generalizes and extends some recent results of Du [[34], Theorems 2.1 and 2.2], Kadelburg, Radenović and Rakočević [[37], Theorems 3.1 and 3.2], Çakalli, Sönmez and Genç [[40], Theorem 2.3], Simić [[39], Theorem 2.2], Abdeljawad and Rezapour [[43], Theorem 16] Arandelović and Kečkić [[38], Lemma 2]. All of these authors have studied cone metric spaces over a solid Hausdorff topological vector space. Note that the identity (9.1) was proved by Çakalli, Sönmez and Genç [[40], Theorem 2.2] provided that Y is a Hausdorff topological vector space.

Theorem 9.2 generalizes and extends also some recent results of Amini-Harandi and Fakhar [[23], Lemma 2.1], Turkoglu and Abuloha [26], Khani and Pourmahdian [[29], Theorem 3.4], Sönmez [[24], Theorem 1], Asadi, Vaezpour and Soleimani [[30], Theorem 2.1], Feng and Mao [[65], Theorem 2.2]. These authors have studied cone metric spaces over a solid Banach space.

Note that Asadi, Rhoades and Soleimani [41] proved that the metrics of Feng and Mao [65] and Du [34] are equivalent.

Finally, let us note a work of Khamsi [27] in which he introduced a metric-type structure in cone metric spaces over a normal Banach space.

Definition 9.4 Let (X,) be a cone normed space over a solid vector space Y. The cone metric topology τ d on X induced by the metric d(x,y)=xy is called the cone topology on X.

In the following theorem, we show that each cone normed space (X,) over a solid vector space is normable. Moreover, if (X,) is a cone Banach space, then it is completely normable.

Theorem 9.4 Suppose X is a vector space over a normed field (K,||). Let (X,) be a cone normed space over a solid vector space (Y,,,). Let μ:YR be the Minkowski functional of [b,b] for some bY with b0. Define the norm by x=μ(). Then:

  1. (i)

    The topology of (X,?·?) coincides with topology of (X,?·?).

  2. (ii)

    (X,?·?) is a cone Banach space if and only if (X,?·?) is a Banach space.

  3. (iii)

    For x, x 1 ,, x n ?X, a?Y and ? 1 ,, ? n ?R,

    ?x??a+ ? i = 1 n ? i ? x i ?implies?x?=µ(a)+ ? i = 1 n ? i ? x i ?.

Proof The topology of (X,) is induced by the cone metric d(x,y)=xy and the topology of (X,) is induced by the metric ρ(x,y)=xy. It is easy to see that ρ=μd. Now the conclusions of the theorem follow from Theorem 9.2. □

Remark 9.3 Theorem 9.4(i) was recently proved by Çakalli, Sönmez and Genç [[40], Theorem 2.4] provided that K=R and Y is a Hausdorff topological vector space.

The following corollary is an immediate consequence of Theorem 9.4(i).

Corollary 9.2 Every cone normed space (X,) over a solid vector space Y is a topological vector space.

9.2 Convergence in cone metric spaces

Let (X,d) be a cone metric space over a solid vector space (Y,,,). Let ( x n ) be a sequence in X and x a point in X. We denote the convergence of ( x n ) to x with respect to the cone metric topology, by x n d x or simply by x n x. Obviously, x n d x if and only if for every vector cY with c0, d( x n ,x)c for all but finitely many n. This definition for the convergence in cone metric spaces over a solid Banach space can be found in the works of Chung [11, 12] published in the period from 1981 to 1982. The definition of complete cone metric space (Definition 9.3) in the case when Y is a solid Banach space also can be found in [11, 12].

Theorem 9.5 Let (X,d) be a cone metric space over a solid vector space Y. Then the convergence in X has the following properties:

  1. (i)

    Any convergent sequence has a unique limit.

  2. (ii)

    Any subsequence of a convergent sequence converges to the same limit.

  3. (iii)

    Any convergent sequence is bounded.

  4. (iv)

    The convergence and the limit of a sequence do not depend on finitely many of its terms.

Proof The properties (i), (ii) and (iv) are valid in any Hausdorff topological space. It remains to prove (iii). Let ( x n ) be a sequence in X which converges to a point xX. Choose a vector c 1 Y with c 1 0. Then there exists NN such that d( x n ,x) c 1 for all nN. By (S13), there is a vector c 2 Y such that d( x n ,x) c 2 for all n=1,,N. Again by (S13), we get that there is a vector cY such that c i c for i=1,2. Then by the transitivity of ≺, we conclude that x n U(x,c) for all nN, which means that ( x n ) is bounded. □

Applying Theorem 9.2, we shall prove a useful sufficient condition for convergence of a sequence in a cone metric space over a solid vector space.

Theorem 9.6 Let (X,d) be a cone metric space over a solid vector space (Y,,,). Suppose ( x n ) is a sequence in X satisfying

d( x n ,x) b n +αd( y n ,y)+βd( z n ,z) for all n,
(9.4)

where x is a point in X, ( b n ) is a sequence in Y converging to 0, ( y n ) is a sequence in X converging to y, ( z n ) is a sequence in X converging to z, α and β are nonnegative numbers. Then the sequence ( x n ) converges to x.

Proof Let be the Minkowski functional of [b,b] for some bY with b0. Define the metric ρ on X as in Theorem 9.2. Then from (9.4), we get

ρ( x n ,x) b n +αρ( y n ,y)+βρ( z n ,z)for all n.
(9.5)

According to Theorem 7.1(ii), b n 0 implies b n 0. Hence, the right-hand side of (9.5) converges to 0 in ℝ. By the usual sandwich theorem, we conclude that x n ρ x which is equivalent to x n d x. □

Remark 9.4 A special case (α=β=0) of Theorem 9.6 was given without proof by Kadelburg, Radenović and Rakočević [42] in the case when Y is a Banach space. This special case was proved by Şahin and Telsi [[22], Lemma 3.3].

It is easy to see that if ( x n ) is a sequence in a cone metric space (X,d) over a solid vector space Y, then

d( x n ,x)0implies x n d x,
(9.6)

but the converse is not true (see Example 9.2(ii) below). Note also that in general case the cone metric is not (sequentially) continuous function (see Example 9.2(iii) below), that is, from x n x and y n y it need not follow that d( x n , y n )d(x,y).

In the following theorem, we shall prove that the converse of (9.6) holds provided that Y is normal and solid.

Theorem 9.7 Suppose (X,d) is a cone metric space over a normal solid vector space (Y,,,). Then

x n d x if and only if d( x n ,x)0.
(9.7)

Proof Let be the Minkowski functional of [b,b] for some bY with b0. Define the metric ρ on X as in Theorem 9.2. By Theorem 9.2,

x n d xif and only if x n ρ x.
(9.8)

By Theorems 7.1 and 7.3, for each sequence ( u n ) in Y

u n 0if and only if u n 0.

Applying this with u n =d( x n ,x), we get

d( x n ,x)0if and onlyρ( x n ,x)0,

that is,

d( x n ,x)0if and only x n ρ x.
(9.9)

Now (9.7) follows from (9.8) and (9.9). □

The following theorem follows immediately from Corollary 9.2. It can also be proved by Theorem 9.6.

Theorem 9.8 Let X be a vector space over a complete normed field (K,||), and let (X,) be a cone normed space over a solid vector space (Y,,,). Then the convergence in X satisfies the properties (i)-(iv) of Theorem  9.5 and it satisfies also the following properties:

  1. (v)

    If x n x and y n y, then x n + y n x+y.

  2. (vi)

    If λ n λ in K and x n x, then λ n x n λx.

9.3 Complete cone metric spaces

Now we shall prove a useful sufficient condition for Cauchy sequence in cone metric spaces over a solid vector space. The second part of this result gives an error estimate for the limit of a convergent sequence in cone metric space. Also we shall prove a criterion for completeness of a cone metric space over a solid vector space.

Theorem 9.9 Let (X,d) be a cone metric space over a solid vector space (Y,,,). Suppose ( x n ) is a sequence in X satisfying

d( x n , x m ) b n for all n,m0 with mn,
(9.10)

where ( b n ) is a sequence in Y which converges to 0. Then:

  1. (i)

    The sequence ( x n ) is a Cauchy sequence in X.

  2. (ii)

    If ( x n ) converges to a point x?X, then

    d( x n ,x)? b n for all n=0.
    (9.11)

Proof (i) Let cY with c0 be fixed. According to (S5), b n 0 implies that there exists NN such that b n c for all n>N. It follows from (9.10) and (S2) that d( x n , x m )c for all m,n>N with mn. Therefore, x n is a Cauchy sequence in X.

(ii) Suppose x n x. Let n0 be fixed. Choose an arbitrary cY with c0. Since x n x, then there exists m>n such that d( x m ,x)c. By the triangle inequality, (9.10) and (S10), we get

d( x n ,x)d( x n , x m )+d( x m ,x) b n +c.

It follows from (S3) that d( x n ,x) b n c holds for each c0, which according to (S11) means that d( x n ,x) b n 0. Hence, d( x n ,x) b n , which completes the proof. □

Remark 9.5 The part (i) of Theorem 9.9 was proved by Azam, Beg and Arshad [[36], Lemma 1.3] in the case when Y is a topological vector space. Note also that whenever the cone metric space (X,d) is complete, then the assumption of the second part of Theorem 9.9 is satisfied automatically.

A sequence of closed balls ( U ¯ ( x n , r n )) in a cone metric space X is called a nested sequence if

U ¯ ( x 1 , r 1 ) U ¯ ( x 2 , r 2 ).

Now we shall prove a simple criterion for the completeness of a cone metric space over a solid vector space.

Theorem 9.10 (Nested ball theorem)

A cone metric space (X,d) over a solid vector space (Y,,,) is complete if and only if every nested sequence ( U ¯ ( x n , r n )) of closed balls in X such that r n 0 has a nonempty intersection.

Proof Let be the Minkowski functional of [b,b] for some bY with b0. Define the metric ρ on X as in Theorem 9.2. By Theorem 9.2, (X,d) is complete if and only if (X,ρ) is complete.

Necessity. If ( U ¯ ( x n , r n )) is a nested sequence of closed balls in (X,d) such that r n 0, then according to Lemma 9.1 it is a nested sequence of closed sets in (X,ρ) with the sequence of diameters ( δ n ) converging to zero. Indeed, it easy to see that ρ(x,y)=d(x,y)2 r n for all x,y U ¯ ( x n , r n ). Hence, δ n 2 r n , which yields δ n 0. Applying Cantor’s intersection theorem to the metric space (X,ρ), we conclude that the intersection of the sets U ¯ ( x n , r n ) is nonempty.

Sufficiently. Assume that every nested sequence of closed balls in (X,d) with radii converging to zero has a nonempty intersection. We shall prove that each nested sequence ( B ¯ ( x n , ε n )) of closed balls in (X,ρ) such that ε n 0 has a nonempty intersection. By identity (9.3), we get

B ¯ ( x n , ε n )= U ¯ ( x n , r n )for all n,
(9.12)

where r n = ε n b0. Hence, according to the assumptions the balls B ¯ ( x n , ε n ) have a nonempty intersection. Applying the nested ball theorem to the metric space (X,ρ), we conclude that it is complete and so (X,d) is also complete. □

9.4 Examples of complete cone metric spaces

We end this section with three examples of complete cone metric spaces. Some other examples on cone metric spaces can be found in [6].

Example 9.1 Let X be a nonempty set and let (Y,,,) be a solid vector space. Suppose a is a vector in Y such that a0 and a0. Define the cone metric d:X×XY by

d(x,y)={ a if  x y , 0 if  x = y .
(9.13)

Then (X,d) is a complete cone metric space over Y. This space is called a discrete cone metric space.

Proof It is obvious that (X,d) is a cone metric space (even if Y is an arbitrary ordered vector space). We shall prove that every Cauchy sequence in X is stationary. Assume the contrary and choose a sequence ( x n ) in X, which is Cauchy but not stationary. Then for every cY with c0 there exist n,mN such that d( x n , x m )c and x n x m . Hence, ac for each c0. Then by (S11) we conclude that a0 which together with a0 leads to the contradiction a=0. Therefore, every Cauchy sequence in X is stationary and so convergent in X. □

Example 9.2 Let (Y,,,) be a solid vector space, and let X be its positive cone. Define the cone metric d:X×XY as follows:

d(x,y)={ x + y if  x y , 0 if  x = y .
(9.14)

Then the following statements hold true:

  1. (i)

    (X,d) is a complete cone metric space over Y.

  2. (ii)

    If Y is not normal, then there are sequences ( x n ) in X such that x n ?0 but d( x n ,0)?0.

  3. (iii)

    If Y is not normal, then the cone metric d is not continuous.

Proof First we shall prove the following claim: A sequence ( x n ) in X is Cauchy if and only if it satisfies one of the following two conditions:

  1. (a)

    The sequence ( x n ) is stationary.

  2. (b)

    For every c?0 the inequality x n ?c holds for all but finitely many n.

Necessity. Suppose ( x n ) is Cauchy but not stationary. Then for every cY with c0 there exists NN such that d( x n , x m )c for all n,m>N. Hence, for all n,m>N we have x n + x m c whenever x n x m . Let n>N be fixed. Since ( x n ) is not stationary, there exists m>N such that x n x m . Hence, x n + x m c. From this taking into account that x m 0, we get x n c and so ( x n ) satisfies (b).

Sufficiently. Suppose that ( x n ) satisfies (b). Then for every c0 there exists NN such that for all n>N we have x n 1 2 c. Let n,m>N be fixed. Then

d( x n , x m ) x n + x m c

which means that ( x n ) is Cauchy.

Now we shall prove the statements of the example.

(i) Let ( x n ) be a Cauchy sequence in X. If ( x n ) satisfies (a), then it is convergent. Now suppose that ( x n ) satisfies (b). Let c0 be fixed. Then d( x n ,0) x n c for all but finitely many n. This proves that x n 0. Therefore, in both cases ( x n ) is convergent.

(ii) Since Y is not normal, then there exist two sequences ( x n ) and ( y n ) in Y such that 0 x n y n for all n, y n 0 and x n 0. Let us consider ( x n ) as a sequence in X. It follows from the definition of the cone metric d that d( x n ,0)= x n for all n. Hence, d( x n ,0) y n for all n. Then by Theorem 9.6, we conclude that x n 0. On the other hand, d( x n ,0)= x n 0.

(iii) Assume that the cone metric d is a continuous. Let ( x n ) be any sequence in X satisfying (ii). From x n 0 and continuity of the cone metric d, we obtain d( x n ,0)d(0,0), i.e. x n 0 in Y which is a contradiction. Hence, the cone metric d is not continuous. □

Example 9.3 Let X= K n be n-dimensional vector space over K, where (K,||) is a complete normed field. Let Y= R n be equipped with the coordinate-wise convergence and the coordinate-wise ordering (see Example 5.1). Define the cone norm :XY by

x= ( α 1 | x 1 | , , α n | x n | ) ,
(9.15)

where x=( x 1 ,, x n ) and α 1 ,, α n are positive numbers. Then (X,) is a cone Banach space over Y.

10 Iterated contractions in cone metric spaces

The iterated contraction principle in usual metric spaces was briefly mentioned in 1968 by Rheinboldt [66] as a special case of a more general theorem. Two years later, the iterated contraction principle (with a posteriori error estimates) has been published in the famous monograph of Ortega and Rheinboldt [[44], Theorem 12.3.2]. Great contribution to the iterated contraction principle in metric spaces and its applications to the fixed point theory was also given by Gel’man [67], Rus [68, 69], Kasahara [70], Hicks and Rhoades [71], Park [72] and others (see also Proinov [73] and [[74], Section 6]). The iterated contraction principle is also known under the name of graphic contraction principle (see Rus, Petruşel and Petruşel [[15], Section 3.2]).

In this section, we shall establish a full statement of the iterated contraction principle in cone metric spaces over a solid vector space. We shall formulate the result for nonself-mappings since the case of self-mappings is a special case of this one.

The following definition is due to Rheinbold [66] (see also Ortega and Rheinboldt [[44], Definition 12.3.1]) in metric space setting.

Definition 10.1 Let (X,d) be a cone metric space over an ordered vector space with convergence (Y,,). A mapping T:DXX is said to be an iterated contraction on D if there exists 0λ<1 such that

d ( T x , T 2 x ) λd(x,Tx)for all xD with TxD.
(10.1)

The real number λ is called a contractive constant of T.

Let (X,d) be a cone metric space over a solid vector space (Y,,,), and let T:DXX be an arbitrary mapping in X. Then starting from a point x 0 D we can build up the Picard iterative sequence

x n + 1 =T x n ,n=0,1,2,,
(10.2)

associated to the mapping T. We say that the iteration (10.2) is well defined if x n D for all n=0,1,2, . The main problems which arise for the Picard iteration are the following:

  1. (i)

    Convergence problem. To find initial conditions for x 0 ?D which guarantee that the Picard iteration (10.2) is well defined and converging to a point ??D.

  2. (ii)

    Existence problem. To find conditions which guarantee that ? is a fixed points of T.

  3. (iii)

    Uniqueness problem. To find a subset of D in which ? is a unique fixed point of T.

  4. (iv)

    Error estimates problem. To find a priory and a posteriori estimates for the cone distance d( x n ,?).

In our opinion, the solving of problem (i) for the convergence of the Picard iteration plays an important role for the solving of problem (ii) for existence of fixed points of T. It turns out that in many cases the convergence of the Picard iteration to a point ξD implies that ξ is a fixed point of T. For example, such situation can be seen in the next proposition.

Proposition 10.1 Let (X,d) be a cone metric space over a solid vector space (Y,,,) and T:DXX. Suppose the Picard iteration (10.2) for some x 0 D is well defined and converging to a point ξD. Then each of the following conditions implies that ξ is a fixed point of T.

  1. (F1)

    T is continuous at ?.

  2. (F2)

    T has a closed graph.

  3. (F3)

    G(x)=?d(x,Tx)? is lower semicontinuous at ? for some semimonotone norm ?·? on Y.

  4. (F4)

    d(?,T?)?ad(x,?)+ßd(Tx,?) for each x?D, where a,ß=0.

Proof If either (F1) or (F2) is satisfied, then the conclusion follows from Theorem 9.5 and definition (10.2) of the Picard iteration.

Let the condition (F3) be satisfied. Since the norm is semimonotone, there exists a constant K>0 such that xKy whenever 0xy. First we shall prove that x n ξ implies d( x n , x n + 1 )0. We claim that for every ε>0 there exists a vector cY such that c0 and c<ε. To prove this take a vector bY with b0. We have 1 n b= 1 n b0. Hence, every vector c= 1 n b with sufficiently large n satisfies c<ε. Now let ε>0 be fixed. Choose a vector cY such that c0 and c<ε/K. From the triangle inequality, we get d( x n , x n + 1 )d( x n ,ξ)+d( x n + 1 ,ξ). Now it follows from x n ξ that d( x n , x n + 1 )c for all but finitely many n. Hence, d( x n , x n + 1 )Kc<ε for these n. Therefore, d( x n , x n + 1 )0. Now taking into account that G is lower semicontinuous at ξ, we conclude that

0 d ( ξ , T ξ ) =G(ξ) lim inf n G( x n )= lim inf n d ( x n , x n + 1 =0

which implies that ξ is a fixed point of T.

Now suppose that the condition (F4) is satisfied. By substituting x= x n , we get

d(ξ,Tξ)αd( x n ,ξ)+βd( x n + 1 ,ξ).

From this, taking into account that x n ξ, we conclude that d(ξ,Tξ)c for each cY with c0. According to (S11), this implies d(ξ,Tξ)0. Therefore, d(ξ,Tξ)=0, which means that ξ is a fixed point of T. □

Remark 10.1 Obviously, if the space (X,d) in Proposition 10.1 is a metric space, then the function G in (F4) can be defined by G(x)=d(x,Tx). In a metric space setting, this is a classical result (see [71]). Let us note also that if the space Y in Proposition 10.1 is a normal solid normed space with norm , then one can choose in (F4) just this norm (see [20]).

Throughout this and the next section for convenience, we assume in ℝ that 0 0 =1 by definition.

Proposition 10.2 Let (X,d) be a cone metric space over a solid vector space (Y,,,) and ( x n ) is a sequence in X satisfying

d( x n + 1 , x n + 2 )λd( x n , x n + 1 ) for every n0,
(10.3)

where 0λ<1. Then ( x n ) is a Cauchy sequence in X and lies in the closed ball U ¯ ( x 0 ,r) with radius

r= 1 1 λ d( x 0 , x 1 ).

Moreover, if ( x n ) converges to a point ξ in X, then the following estimates hold:

d( x n ,ξ) λ n 1 λ d( x 0 , x 1 ) for all n0;
(10.4)
d( x n ,ξ) 1 1 λ d( x n , x n + 1 ) for all n0;
(10.5)
d( x n ,ξ) λ 1 λ d( x n , x n 1 ) for all n1.
(10.6)

Proof From (10.3) by induction on n0, we get

d( x n , x n + 1 ) λ n d( x 0 , x 1 )for every n0.

Now we shall show that ( x n ) satisfies

d( x n , x m ) b n for all n,m0 with mn,
(10.7)

where b n = λ n 1 λ d( x 0 , x 1 ). Indeed, for all n,m0 with mn, we have

d ( x n , x m ) j = n m d ( x j , x j + 1 ) j = n m λ j d ( x 0 , x 1 ) = ( j = n m λ j ) d ( x 0 , x 1 ) ( j = n λ j ) d ( x 0 , x 1 ) = λ n 1 λ d ( x 0 , x 1 ) = b n .

It follows from axiom (C3) that b n 0 in Y. Then by Theorem 9.9(i), we conclude that ( x n ) is a Cauchy sequence in X. Putting n=0 in (10.7) we obtain that d( x m , x 0 ) b 0 for every m0. Hence, the sequence ( x n ) lies in the ball U ¯ ( x 0 ,r) since r= b 0 . Now suppose that ( x n ) converges to a point ξX. Then it follows from Theorem 9.9(ii) that ( x n ) satisfies the inequality d( x n ,ξ) b n (for every n0) which proves (10.4). Applying (10.4) with n=0, we conclude that the first two terms of the sequence ( x n ) satisfy the inequality

d( x 0 ,ξ) 1 1 λ d( x 0 , x 1 ).

Note that for every n0 the sequence ( x n , x n + 1 , x n + 2 ,) also satisfies (10.3) and converges to ξ. Therefore, applying the last inequality to the first two terms of this sequence we get (10.5). The inequality (10.6) follows from (10.5) and (10.3). □

Remark 10.2 Proposition 10.2 generalizes, improves and complements a recent result of Latif and Shaddad [[25], Lemma 3.1]. They have proved that a sequence ( x n ) in a cone metric space X satisfying (10.3) is Cauchy provided that Y is a normal Banach space.

Theorem 10.1 (Iterated contraction principle)

Let (X,d) be a complete cone metric space over a solid vector space (Y,,,). Let T:DXX be a mapping satisfying the following conditions:

  1. (a)

    T is an iterated contraction on D with contractive constant ?<1.

  2. (b)

    There is x 0 ?D such that U ¯ ( x 0 ,r)?D, where r= 1 1 - ? d( x 0 ,T x 0 ).

Then the following hold true:

  1. (i)

    Convergence of the iterative method. The Picard iteration (10.2) starting from x 0 is well defined, remains in the closed ball U ¯ ( x 0 ,r) and converges to a point ?? U ¯ ( x 0 ,r).

  2. (ii)

    A priori error estimate. The following estimate holds:

    d( x n ,?)? ? n 1 - ? d( x 0 ,T x 0 ) for all n=0.
    (10.8)
  3. (iii)

    A posteriori error estimates. The following estimates hold:

    d( x n ,?)? 1 1 - ? d( x n , x n + 1 ) for all n=0;
    (10.9)
    d( x n ,?)? ? 1 - ? d( x n , x n - 1 ) for all n=1.
    (10.10)
  4. (iv)

    Existence of fixed points. If at least one of the conditions (F1)-(F2) is satisfied, then ? is a fixed point of T.

Proof Define the function ρ:DY by ρ(x)= 1 1 λ d(x,Tx). It follows from condition (a) that ρ(Tx)λρ(x) for each xD with TxD. Now define the set U as follows

U= { x D : U ¯ ( x , ρ ( x ) ) D } .

It follows from ρ( x 0 )=r and (b) that the set U is not empty. We shall prove that T(U)U. Let x be a given point in U. It follows from the definition of ρ that d(x,Tx)ρ(x) which means that Tx U ¯ (x,ρ(x))D. Therefore, TxD. Further, we shall show that

U ¯ ( T x , ρ ( T x ) ) U ¯ ( x , ρ ( x ) ) .

Indeed, suppose that y U ¯ (Tx,ρ(Tx)). Then

d(y,x)d(y,Tx)+d(x,Tx)ρ(Tx)+d(x,Tx)λρ(x)+d(x,Tx)=ρ(x)

which means that y U ¯ (x,ρ(x)). Hence, U ¯ (Tx,ρ(Tx))D and so TxU. This proves that T(U)U which means that Picard iteration ( x n ) is well defined. From (a), we deduce that it satisfies (10.3). Now conclusions (i)-(iii) follow from Proposition 10.2. Conclusion (iv) follows from Proposition 10.1. □

Remark 10.3 Obviously, whenever T is a self-mapping of X, condition (b) of Theorem 10.1 is satisfied automatically for every x 0 X and so it can be omitted. If D is closed and T(D)D, then condition (b) also can be dropped.

Remark 10.4 Note that Theorem 10.1(i) generalizes and extends some results of Pathak and Shahzad [[21], Theorem 3.7] and Wardowski [[20], Theorem 3.3]. Their results have been proved for a selfmapping T of X in the case when Y is a normal Banach space.

11 Contraction mappings in cone metric spaces

In 1922, the famous Polish mathematician, Stefan Banach [75], established his famous fixed point theorem nowadays known as the Banach fixed point theorem or the Banach contraction principle. The Banach contraction principle is one of the most useful theorem in the fixed point theory. It has a short version and full version. Its full version in a metric space setting can be seen, for example, in the monographs of Kirk [76], Zeidler [[57], Section 1.6] and Berinde [[77], Section 2.1].

The object of this section is to give a full statement of the Banach contraction principle for a nonself-mapping in a cone metric spaces over a solid vector space.

Definition 11.1 ([75])

Let (X,d) be a cone metric space over an ordered vector space with convergence (Y,,). A mapping T:DXX is said to be a contraction on D if there exists 0λ<1 such that

d(Tx,Ty)λd(x,Ty)for all x,yD.
(11.1)

The real number λ is called a contractive constant of T.

Theorem 11.1 (Banach contraction principle)

Let (X,d) be a complete cone metric space over a solid vector space (Y,,,). Let T:DXX be a mapping satisfying the following conditions:

  1. (a)

    T is a contraction on D with contractive constant ?<1.

  2. (b)

    There is x 0 ?D such that U ¯ ( x 0 ,r)?D, where r= 1 1 - ? d( x 0 ,T x 0 ).

Then the following hold true:

  1. (i)

    Existence and uniqueness. T has a unique fixed point ? in D.

  2. (ii)

    Convergence of the iterative method. The Picard iteration (10.2) starting from x 0 is well defined, remains in the closed ball U ¯ ( x 0 ,r) and converges to ?.

  3. (iii)

    A priori error estimate. The following estimate holds:

    d( x n ,?)? ? n 1 - ? d( x 0 ,T x 0 ) for all n=0.
    (11.2)
  4. (iv)

    A posteriori error estimates. The following estimates hold:

    d( x n ,?)? 1 1 - ? d( x n , x n + 1 ) for all n=0;
    (11.3)
    d( x n ,?)? ? 1 - ? d( x n , x n - 1 ) for all n=1.
    (11.4)
  5. (v)

    Rate of convergence. The rate of convergence of the Picard iteration is given by

    d( x n + 1 ,?)??d( x n ,?) for all n=1;
    (11.5)
    d( x n ,?)? ? n d( x 0 ,?) for all n=0.
    (11.6)

Proof Using the triangle inequality and the contraction condition (a), one can see that condition (F4) holds with α=λ and β=1. Conclusions (i)-(iv) with the exception of the uniqueness of the fixed point follow immediately from Theorem 10.1 since every contraction mapping is an iterated contraction mapping. Suppose T has two fixed points x,yD. Then it follows from (a) that d(x,y)λd(x,y), which leads to (1λ)d(x,y)0 and so d(x,y)0. Hence, d(x,y)=0 which means that x=y. Therefore, ξ is a unique fixed point of T in D. Conclusion (v) follows from (a) and (i) by putting x= x n and y=ξ. □

Kirk in his paper [76] wrote for the Banach contraction principle in usual metric spaces the following, ‘The great significance of Banach’s principle, and the reason it is one of the most frequently cited fixed point theorems in all of analysis, lies in the fact that (i)-(v) contain elements of fundamental importance to the theoretical and practical treatment of mathematical equations’. We would add that in general cone metrics give finer estimates than usual metrics.

Recall that a self-mapping T of a cone metric space (X,d) is called contraction on X if there exists 0λ<1 such that d(Tx,Ty)λd(x,y) for all x,yX. The following short version of the Banach contraction principle for self-mappings in cone metric spaces follows immediately from Theorem 11.1. Note that the short version of Banach’s principle follows also from the short version of Banach’s principle in metric spaces and Theorem 9.2.

Theorem 11.2 Each contraction T on a cone metric space (X,d) over a solid vector space Y has a unique fixed point and for each x 0 X the Picard iteration (10.2) converges to the fixed point.

Remark 11.1 Theorem 11.2 was proved by Huang and Zhang [[13], Theorem 1] in the case when Y is a normal Banach space. One year later, Rezapour and Hamlbarani [[19], Theorem 2.3] improved their result omitting the assumption of normality. Finally, Du [[34], Theorem 2.3] proved this result assuming that Y is a locally convex Hausdorff topological vector space.

Remark 11.2 Recently, Radenović and Kadelburg [[28], Theorem 3.3] have established the a priory estimate (11.2) for a self-mappings T of a cone metric space X over a solid Banach space Y.

Remark 11.3 In Section 8, we have mentioned that there are various generalizations of the Banach contraction principle in a cone metric space (X,d) over an ordered vector ℒ-space (Y,,). Many authors have obtained fixed point theorems for selfmappings T:XX of the type

d(Tx,Ty)Qd(x,Ty)for all x,yX,
(11.7)

where Q: Y + Y + is a linear nonnegative operator. Obviously, condition (11.7) has more general form than (11.1). Nevertheless, Theorem 11.2 is not a consequence of the results mentioned in Section 2 because they are obtained under different assumptions. In particular, the authors of these results assume, by definition, that a sequence ( x n ) in X converges to xX if and only if d( x n ,x)0 in Y, which is not true in cone metric spaces over an arbitrary solid vector space (see Section 9.2).

12 Conclusion

In the first part of this paper (Sections 2-7), we develop a unified theory for solid vector spaces. A real vector space Y with convergence (→) is called a solid vector space if it is equipped with a vector ordering (⪯) and a strict vector ordering (≺). It turns out that every convergent sequence in a solid vector space has a unique limit. Every solid vector space Y can be endowed with an order topology τ such that x n x implies x n τ x. It turns out that the converse of this implication holds if and only if the space Y is normal, i.e., the sandwich theorem holds in Y. Using the Minkowski functional, we show that the order topology on every solid vector space is normable with a monotone norm. Among the other results in this part of the paper, we show that an ordered vector space can be equipped with a strict vector ordering if and only if it has a solid positive cone. Moreover, if the positive cone of the vector ordering is solid, then there exists a unique strict vector ordering on this space.

In the second part of the paper (Sections 8-9), we develop a unified theory for cone metric spaces and cone normed spaces over a solid vector space. We show that every (complete) cone metric space (X,d) over a solid vector space Y is a (completely) metrizable topological space. Moreover, there exists an equivalent metric ρ on X that preserve some inequalities. In particular, an inequality of the type

d(x,y) i = 1 n λ i d( x i , y i )(x,y, x i , y i X, λ i R)
(12.1)

implies the inequality

ρ(x,y) i = 1 n λ i ρ( x i , y i ).
(12.2)

Using this result, one can prove that some fixed point theorems in cone metric spaces are equivalent to their versions in usual metric spaces. For example, the short version of the Banach contraction principle in a cone metric space is equivalent to its version in a metric space because the Banach contractive condition d(Tx,Ty)λd(x,y) is of the type (12.1). Let us note that the above mentioned result cannot be applied to many contractive conditions in a cone metric space. That is why we need further properties of cone metric spaces. Further, we give some useful properties of cone metric spaces, which allow us to prove convergence results for Picard iteration with a priori and a posteriori error estimates. Among the other results in this part of the paper, we prove that every cone normed space over a solid vector space is normable.

In the third part of the paper (Sections 10-11), applying the cone metric theory, we present full statements of the iterated contraction principle and the Banach contraction principle in cone metric spaces over a solid vector space.

Let us note that some of the results of the paper (Theorems 9.2, 9.3, 9.4, 9.6 and 9.9; Propositions 10.1 and 10.2) give a method for obtaining convergence theorems (with error estimates) for Picard iteration and fixed point theorems in a cone metric space over a solid vector space.

Finally, let us note that we have come to the idea of a general theory of cone metric spaces (over a solid vector spaces) dealing with convergence problems of some iterative methods for finding all zeros of a polynomial f simultaneously (i.e., as a vector in C n , where n is the degree of f). In our next papers, we will continue studying the cone metric space theory and its applications. For instance, we shall show that almost all results given in Proinov [74, 78] can be extended in cone metric spaces over a solid vector space. Also, we shall present new convergence theorems for some iterative methods for finding zeros of a polynomial simultaneously. These results generalize, improve and complement a lot of results given in the monographs of Sendov, Andreev, Kjurkchiev [79] and Petković [80]. In particular, it turns out that the cone norms in C n give better a priori and a posteriori error estimates for iterative methods in C n than usual norms.