1 Introduction

Ky Fan’s approximation theorem (Theorem 2 in [1]) has attracted great attention worldwide over the last few decades. The normed space version of the theorem is as follows.

Theorem Let K be a non-empty compact convex set in a normed linear space X. If f is a continuous map from K into X, then there exists a point u in K such that uf(u)=d(f(u),K). The point u in the theorem above is called a best approximation point of f in K.

Ky Fan’s Theorem is of great importance in nonlinear analysis, approximation theory, game theory and minimax theorems. In recent years, the theorem has been studied and generalized in various respects and applied in the analysis of many problems. Lin and Park [2], O’Regan and Shahzad [3] obtained a multivalued version of Ky Fan’s result for condensing maps. Tan and Yuan [4] and Liu [5, 6] extended the theorem to the more general continuous 1-set-contractive maps under some stronger hypothesis. In the last decade, the study of random approximations and random fixed points have been a very active area of research in probabilistic functional analysis. Some results have already been achieved in this line such as those by Lin [7], Seghal and Singh [8], Seghal and Water [9], Liu [10, 11], Tan and Yuan [4], Beg and Shahzad [12]. Meanwhile, Lin [13] proved Fan’s theorem for a continuous condensing map defined on a closed ball in a Banach space. Subsequently, Lin and Yen [14] proved that Ky Fan’s Theorem is true for a semi-contractive map defined on a closed convex subset of a Hilbert space. Very recently, Liu [5] proved that Ky Fan’s Theorem is true for the 1-set-contractive maps defined on a bounded closed convex subset in a Banach space when is replaced by Minkowski’s function. For more results, the reader is referred to Shahzad [15], Markin and Shahzad [16], Amini-Harandi [17], Roux and Singh [18], Liu [19, 20], O’Regan [21], and so on.

However, so far, Ky Fan’s Theorem has not been well investigated for the cases where f is a discontinuous map and has no compact conditions. Partly motivated by this difficulty, Alber [22] introduced the notion of a generalized projection operator and noted that Π C can be used instead of P C in Banach space. Based on this concept, Li and Ok [23] proved that the metric projection operator is order-preserving in partially ordered Banach spaces. Motivated and inspired by the above mentioned work, in this paper, we obtain two best approximation theorems through the order-theoretic fixed-point theorems by using Π C instead of P C for reflexive, strictly convex and smooth Banach lattice. In the first best approximation theorem, we establish a sequence { x n } which converges strongly to the unique best approximation point; while in the second best approximation theorem, we obtain the existence of a minimum best approximation point and a maximum best approximation point in order intervals. As an application of our best approximation theorems, a fixed-point theorem for non-self maps is established under some conditions which do not need to require any continuous and compact conditions on f.

The rest of the paper is organized as follows. In Section 2, we review the definition of the generalized projection operator in Banach spaces and its basic properties, and also give some definitions in Banach lattice and some fundamental results as preliminaries for our theorems. In Section 3, we establish the properties of the generalized projection operator in Banach lattice under some assumptions. Then we combine these results with an order-theoretic fixed-point theorem to derive some best approximation theorems. Section 4 provides an application of these best approximation theorems to the fixed-point theory.

2 Preliminaries

2.1 The generalized projection operator

Let X be a real Banach space with the dual X . We denote by J the normalized duality mapping from X to 2 X defined by

Jx= { x X : x , x = x x , x = x } ,
(2.1)

for all xX, where , denotes the generalized duality pairing between X and X. It is well known that if X is reflexive, strictly convex and smooth, J is a surjective, injective, and single-valued map.

Let X be a reflexive, strictly convex and smooth Banach space and C a non-empty closed convex subset of X. Consider the Lyapunov functional defined by

W(x,y)= x 2 2Jx,y+ y 2 ,x,yX.
(2.2)

Following Alber [22], the generalized projection operator Π C :XC is a map that assigns to an arbitrary point xX the minimum point of the functional W(x,y), that is, Π C (x)= x ˆ , where x ˆ C is the solution to the minimization problem

W(x, x ˆ )= inf y C W(x,y).
(2.3)

Existence and uniqueness of the operator Π C follows from the properties of the functional W(x,y) and the strict monotonicity of the mapping J. It is obvious from the definition of the functional W that

( x y ) 2 W(x,y) ( x + y ) 2 ,x,yX.
(2.4)

If X is a Hilbert space, then W(x,y)= x y 2 and Π C = P C .

If X is a reflexive, strictly convex, and smooth Banach space, then for x,yX, W(x,y)=0 if and only if x=y. It is sufficient to show that if W(x,y)=0 then x=y. From (2.4), we have x=y. This implies that Jx,y= y 2 = J x 2 . From the definition of J, one has Jx=Jy. Therefore, we have x=y; and for more details, the reader is referred to [24, 25].

As shown in [22], the generalized projection operator on a convex closed set C satisfies the following properties:

  1. (i)

    The operator Π C is fixed in each point xC, i.e., x ˆ =x.

  2. (ii)

    The operator Π C is d-accretive in X, i.e.,

    JxJy, x ˆ y ˆ 0,x,yX.
    (2.5)
  3. (iii)

    The point Π C (x)= x ˆ is a generalized projection of x on CX if and only if the following inequality is satisfied:

    JxJ x ˆ , x ˆ y0,yC.
    (2.6)
  4. (iv)

    The operator Π C gives the absolutely best approximation of xX relative to the functional W(x,y), i.e.,

    W( x ˆ ,y)=W(x,y)W(x, x ˆ ),yC.
    (2.7)

2.1.1 Banach lattices

Let (X,) be a real partially ordered Banach space with the dual X and S be a subset of X. We say that an element x of X is an upper bound for S if Sx, that is, yx for each yS (the notation Sx is similarly understood). We say that S is bounded from above if Sx for some xX, and bounded from below if Sx for some xX. In turn, S is said to be bounded if it is bounded both from above and below. The supremum of S is the minimum of the set of all upper bounds for S, and is denoted by X S (the infimum of S is denoted as X S). As is conventional, we denote X {x,y} as xy, and X {x,y} as xy, for any x,yX. If xy and xy exist for every x and y in X, we say that (X,) is a lattice. And if X S and X S exist for every non-empty (bounded) SX, we say that (X,) is a (Dedekind) complete lattice. If Y is a non-empty subset of X which contains xy and xy for every x,yY, then Y is said to be a sublattice of X.

A normed lattice X is a vector lattice with a norm such that the following condition is satisfied:

|x||y|impliesxy,for all x,yX,

where |x| is defined by |x|=x(x) for each xX.

A Riesz space is a lattice (X,) where X is a (real) linear space whose linear structure is compatible with the partial order ⪯ in the sense that for all x,yX, xy implies αx+zαy+z for every zX and real number α>0. The positive cone of (X,) is X + ={xX:xθ}, which is a pointed convex cone in X. We will assume throughout the paper that the positive cones is closed.

Let (X,) be a Banach lattice, that is, (X,) is an ordered Riesz space with X being Banach space (if X is a Hilbert space here, (X,) is referred to as a Hilbert lattice). The cone X + is said to be solid if X + has a non-empty interior i.e. int X + . The cone X + is said to be normal if there is a number K>0 such that for all x,yX, θxy implies xKy. The least positive number satisfying this inequality is called the normal constant of X + .

Definition 2.1 ([23])

Let (X,) be a Banach lattice, a sublattice Y of X is said to be regular if 2 is submodular on Y with respect to ⪯, that is,

x y 2 + x y 2 x 2 + y 2 ,x,yY.
(2.8)

Obviously, if (X,) is itself regular, then every sublattice of X is regular. We know every Hilbert normed lattice is regular and the positive cones of many Banach lattices are regular. For example, if p2, every sublattice S of R n , p with S R + n is regular; if p2, every sublattice S of p with S + p is regular.

Definition 2.2 ([23])

For any lattices (X, X ) and (Y, Y ), we say that a map F:XY is order-preserving if x X y implies F(x) Y F(y).

2.1.2 Order-dual

Let (X,) be a Banach lattice. The dual of ⪯ is the partial order ⪯ on X defined as follows:

ϕ φiffφϕ,x0,x X + .
(2.9)

It is well known that ( X , ) is a Banach lattice, which is called the dual of (X,). As usual, we denote the positive cone of ( X , ) by X + , and recall that x X + iff φ,x0 for every φ X + (see Meyer-Nieberg [26], Proposition 1.4.2).

Let (H,,) be a Hilbert space and KH be a closed convex cone. Recall that K ={xH:x,y0,yK} is called the dual cone of K. The cone K is called subdual if K K and superdual if K K. Suppose (H,,) be a Hilbert lattice and K be its positive cone, for any x,yH, we denote the minimum (supremum) with respect to K as xy (xy) and the minimum (supremum) with respect to K as x y (x y).

The following fixed-point theorem is fundamental for the proof of the best approximation theorem.

Theorem 2.1 ([27])

Let K be a normal and solid cone. Suppose that f:KK is increasing and satisfies the following conditions:

  1. (i)

    There exist vintK and c>0, such that θf(v)v, f(θ)cf(v).

  2. (ii)

    For any 0<a<b<1 and any bounded subset BK, there exists η(a,b,B)>0 such that

    f(tx)t(1+η)f(x),xB,t[a,b].
    (2.10)

Then f has a unique fixed point x in K such that θ x v. Moreover, if x 0 K such that x n =f( x n 1 ) (n=1,2,3,), then x n x 0 for n.

We denote d W (x,K)=inf{W(x,y):yK}, where xX and W is a Lyapunov functional in X.

3 Best approximation theorems

First we establish the following properties of the generalized projection operators.

Lemma 3.1 Let (X,) be a partially ordered space, and let X + be its positive cone, then

Π X + (tx)=t Π X + (x),t>0,xX.

Proof For every t>0, xX, we take y X + . It is obvious that y t X + , and so by equation (2.6) we have

J x J Π X + ( x ) , Π X + ( x ) y t 0,
(3.1)

and further, by the positive homogeneity of J, we get

J t x J t Π X + ( x ) , t Π X + ( x ) y 0,y X + .
(3.2)

Using (2.6), we obtain Π X + (tx)=t Π X + (x). □

Lemma 3.2 For a reflexive, strictly convex, and smooth Banach lattice (X,), the following statements are equivalent:

(H1) The normalized duality mapping J is order-preserving;

(H2) x,yX, xy implies J x J y 2 + J x J y 2 x 2 + y 2 .

Proof (H1) ⇒ (H2) If J is order-preserving, for xy, we have JxJy=Jx, JxJy=Jy. It is thus obvious that (H2) holds.

(H2) ⇒ (H1) Assume that J is not order-preserving, then there exist x 0 , y 0 X, x 0 y 0 such that J x 0 J y 0 J x 0 , J x 0 J y 0 J y 0 . Since X is a reflexive Banach lattice, J is surjective and X is a Banach lattice, which implies that there exist z 1 x 0 , z 2 y 0 X, such that J x 0 J y 0 =J z 1 , J x 0 J y 0 =J z 2 . Indeed we have

2J x 0 J y 0 , x 0 2J x 0 J y 0 x 0 J x 0 J y 0 2 + x 0 2 .
(3.3)

Since X is strictly convex, which implies only in the case z 1 =t x 0 , t0, the relation 2J x 0 J y 0 , x 0 =2J x 0 J y 0 x 0 holds. Moreover, only in the case z 1 = x 0 , the relation 2J x 0 J y 0 x 0 = J x 0 J y 0 2 + x 0 2 holds. This obviously implies 2J x 0 J y 0 , x 0 = J x 0 J y 0 2 + x 0 2 if and only if z 1 = x 0 . From the assumption, it is impossible that z 1 = x 0 . Thus

2J x 0 J y 0 , x 0 < J x 0 J y 0 2 + x 0 2 .
(3.4)

In a similar way, we get

2J x 0 J y 0 , y 0 < J x 0 J y 0 2 + y 0 2 .
(3.5)

Adding equations (3.4) and (3.5), we have

2 J x 0 J y 0 , x 0 + 2 J x 0 J y 0 , y 0 < J x 0 J y 0 2 + x 0 2 + J x 0 J y 0 2 + y 0 2
(3.6)

and

2 J x 0 J y 0 J x 0 , x 0 + 2 J x 0 J y 0 J y 0 , y 0 < J x 0 J y 0 2 x 0 2 + J x 0 J y 0 2 y 0 2 .
(3.7)

Using J x 0 J y 0 +J x 0 J y 0 =J x 0 +J y 0 , we obtain

2 J x 0 J y 0 J y 0 , x 0 + 2 J x 0 J y 0 J y 0 , y 0 < J x 0 J y 0 2 + J x 0 J y 0 2 x 0 2 y 0 2 ,
(3.8)

and thus

2J x 0 J y 0 J y 0 , y 0 x 0 < J x 0 J y 0 2 + J x 0 J y 0 2 x 0 2 y 0 2 .
(3.9)

Since J x 0 J y 0 J y 0 X + and y 0 x 0 X + , we have

J x 0 J y 0 J y 0 , y 0 x 0 0.

This contradicts (H2). So J is order-preserving and the assertion is proved. □

Lemma 3.3 Let (X,) be a reflexive, strictly convex, smooth Banach lattice and satisfy condition (H2) and C a closed convex regular sublattice of X. Then, Π C is increasing.

Proof To derive a contradiction, assume that Π C is not increasing. Then, there exist x 0 , y 0 X, x 0 y 0 such that Π C x 0 Π C y 0 Π C x 0 , Π C x 0 Π C y 0 Π C y 0 . Because C is a sublattice of X, we have Π C x 0 Π C y 0 C. It follows from the definition of Π C that W( x 0 , Π C x 0 )<W( x 0 , Π C x 0 Π C y 0 ), that is,

2J x 0 , Π C x 0 Π C y 0 Π C x 0 < Π C x 0 Π C y 0 2 Π C x 0 2 .
(3.10)

On the other hand, as Π C x 0 Π C y 0 C, we trivially have W( y 0 , Π C y 0 )<W( y 0 , Π C x 0 Π C y 0 ), that is,

2J y 0 , Π C x 0 Π C y 0 Π C y 0 < Π C x 0 Π C y 0 2 Π C y 0 2 .
(3.11)

Using the fact that xy+xy=x+y, we can write the inequality (3.10) as

2J x 0 , Π C x 0 Π C y 0 Π C y 0 < Π C x 0 Π C y 0 2 Π C x 0 2 .
(3.12)

Combining equations (3.11) and (3.12) yields

2 J y 0 J x 0 , Π C x 0 Π C y 0 Π C y 0 < Π C x 0 Π C y 0 2 + Π C x 0 Π C y 0 2 Π C y 0 2 Π C x 0 2 .
(3.13)

Thus, by the regularity of C, we get

J y 0 J x 0 , Π C x 0 Π C y 0 Π C y 0 <0.

By Lemma 3.2, J y 0 J x 0 X + , and so Π C x 0 Π C y 0 Π C y 0 does not belong to X + , which is a contradiction. This proves that Π C is increasing. □

Lemma 3.4 Let H be a Hilbert normed lattice with its positive cone K and C a closed convex sublattice of H. Then, P C is increasing.

Proof It is well known that J is an identity function in Hilbert space. x,yK, we have |xy|=(xy)(yx)x+y. As H is a normed lattice, we get xyx+y, that is, x y 2 x + y 2 . Furthermore, x,y0. Thus, x K . Conclusion: K is subdual cone. Let x,yH be such that xy, we have yxK K , that is, x y. Thus x y=y and x y=x. We have x y 2 + x y 2 = x 2 + y 2 . So (H2) holds. From Lemma 3.2.1 in [23], we know that C is regular. By Lemma 3.3, P C is increasing. □

From Theorem 2.1 and the properties of the generalized projection operator, we obtain the following best approximation theorems.

Theorem 3.1 Let (X,) be a reflexive, strictly convex, smooth Banach lattice satisfying condition (H2), and X + be normal, solid and regular. Suppose that f: X + X is increasing and satisfies the following conditions:

(H3) There exist vint X + and c>0, such that f(v)v, Π X + (f(v))θ and f(θ)cf(v).

(H4) For any 0<a<b<1 and any bounded subset B X + , there exists η(a,b,B)>0 such that

f(tx)t(1+η)f(x),xB,t[a,b].
(3.14)

Then f has a unique point x in X + , satisfying θ x v, such that W(f( x ), x )= d W (f( x ), X + ). Moreover, if x 0 X + and x n = Π X + (f( x n 1 )) (n=1,2,3,), then x n x 0 for n.

Proof Define F: X + X + by F(x)= Π X + (f(x)). It is obvious that X + is a sublattice of X. By Lemma 3.3, it is easy to see that F is increasing. Since Π X + is increasing and f(v)v, f(θ)cf(v), we get

θ Π X + ( f ( v ) ) Π X + (v)=v.
(3.15)

Using Lemma 3.1, we have

Π X + ( f ( θ ) ) Π X + ( c f ( v ) ) =c Π X + ( f ( v ) ) .
(3.16)

From f(tx)t(1+η)f(x), xB, t[a,b], we obtain

Π X + ( f ( t x ) ) Π X + ( t ( 1 + η ) f ( x ) ) =t(1+η) Π X + ( f ( x ) ) .
(3.17)

Thus F satisfies all conditions of Theorem 2.1, and so F has a unique fixed point x in X + , such that θ x v, and x n x 0 for n. Now we consider F( x )= x , i.e. Π X + (f( x ))= x . By the definition of Π X + , we get

W ( f ( x ) , x ) = inf y X + W ( f ( x ) , y ) = d W ( f ( x ) , X + ) .

The assertion is proved. □

Remark 3.1 In Theorem 3.1, f is a discontinuous map and has no compact conditions.

Corollary 3.1 Let H be a Hilbert normed lattice and its positive cone K be solid. Suppose that f:KH is increasing and satisfies (H3), (H4) in K. Then f has a unique point x in K, satisfying θ x v, such that f( x ) x =d(f( x ),K)= inf y K f( x )y. Moreover, if x 0 K and x n = P K (f( x n 1 )) (n=1,2,3,), then x n x 0 for n.

Proof The assertion follows from the above Lemma 3.4 and Theorem 3.1. □

Let (X,) be a Banach lattice. Given u 0 , v 0 X such that u 0 v 0 , we denote by [ u 0 , v 0 ] the set:

[ u 0 , v 0 ]={zX: u 0 z v 0 }.

It is easy to see that [ u 0 , v 0 ] is a sublattice of X.

Theorem 3.2 Let (X,) be a reflexive, strictly convex, smooth Banach and Dedekind complete lattice satisfying condition (H2). Suppose that [ u 0 , v 0 ] is regular and f:[ u 0 , v 0 ]X is increasing. Then, f has a minimum best approximation point x and a maximum best approximation point x with respect to W(x,y) in [ u 0 , v 0 ], such that

u 0 u 1 u n x x v n v 1 v 0 ,
(3.18)

where u n = Π [ u 0 , v 0 ] (f( u n 1 )), v n = Π [ u 0 , v 0 ] (f( v n 1 )) (n=1,2,3,).

Proof Define F:[ u 0 , v 0 ][ u 0 , v 0 ] by F(x)= Π [ u 0 , v 0 ] (f(x)). From Lemma 3.3, we see that F is increasing. It is easy to see that u 0 F( u 0 ) and F( v 0 ) v 0 . Thus, F satisfies all conditions of Theorem 2.1.2 in [28]. Then, F has a minimum fixed point x and a maximum fixed point x and satisfies (3.18). By the definition of Π [ u 0 , v 0 ] , the assertion is proved. □

Remark 3.2 In Theorem 3.2, f is a discontinuous map and has no compact conditions.

Example 3.1 Let (X,)=( 2 ,). Here ⪯ stands for the coordinatewise ordering. Given u 0 , v 0 2 such that u 0 v 0 . Then, by Theorem 3.2, every increasing f:[ u 0 , v 0 ] 2 has a minimum best approximation point and a maximum best approximation point with respect to W(x,y) in [ u 0 , v 0 ].

Example 3.2 Let (X,)=( L 2 (Ω),), the space of measurable functions which are 2nd power summable on Ω. Endow L 2 (Ω) with the following norm and ⪯:

x = ( Ω | x ( t ) | 2 d μ ) 1 2 , L 2 ( Ω ) + = { x L 2 ( Ω ) : x ( t ) 0 ,  a.e.  t Ω } .

It is easy to see that ( L 2 (Ω),) is a Hilbert normed lattice. Given u 0 , v 0 L 2 (Ω) such that u 0 v 0 ; then, by Theorem 3.2, every increasing f:[ u 0 , v 0 ] L 2 (Ω) has a minimum best approximation point and a maximum best approximation point with respect to W(x,y) in [ u 0 , v 0 ].

4 Fixed-point theorems

From the above best approximation theorems, we can obtain the following fixed-point theorems.

Theorem 4.1 Suppose that all conditions in Theorem  3.1 are satisfied. Moreover, one of the following conditions holds:

(H5) f(θ)θ;

(H6) f(v)θ.

Then, f has a unique fixed point x in X + , which satisfies θ x v. Moreover, if x 0 X + and x n = Π X + (f( x n 1 )) (n=1,2,3,), then x n x 0 for n.

Proof It suffices to show that x is the fixed point of f. Indeed, if (H5) holds, using θ x v, we get f(θ)f( x )f(v). Thus f( x )=(f( x )f(θ))+f(θ) X + and W(f( x ), x )= d W (f( x ), X + )=0. Hence f( x )= x .

If (H6) holds, using f(θ)cf(v), we get f(θ) X + . From (H5), we have f( x )= x . The assertion is proved. □

If f:[ u 0 , v 0 ][ u 0 , v 0 ] is self-projective, then Π [ u 0 , v 0 ] (f(x))=f(x), and Theorem 3.2 reduces to the following fixed-point theorem:

Corollary 4.1 Let (X,) be a Dedekind complete lattice. Suppose that f:[ u 0 , v 0 ]X is increasing and satisfies:

u 0 f( u 0 ),f( v 0 ) v 0 .

Then, f has a minimum fixed point x and a maximum fixed point x in [ u 0 , v 0 ]. Moreover, if u n =f( u n 1 ) and v n =f( v n 1 ) (n=1,2,3,), then equation (3.18) holds.