Open Access

Applications of order-clustered fixed point theorems to generalized saddle point problems and preordered variational inequalities

Fixed Point Theory and Applications20142014:191

https://doi.org/10.1186/1687-1812-2014-191

Received: 18 May 2014

Accepted: 15 August 2014

Published: 5 September 2014

Abstract

In this paper, we introduce the concepts of preordered Banach spaces, generalized saddle points and preordered variational inequalities. Then we apply the order-clustered fixed point theorems to prove the existence of solutions to these problems.

MSC:06A06, 47B48, 47B60, 49J40.

Keywords

chain-complete preordered sets order-clustered fixed point Abian-Brown fixed point theorem order-increasing upward mapping generalized saddle point generalized Nash equilibrium preordered variational inequality

1 Introduction

In an ordinary game, the sets of strategies of the players or the decision makers may be equipped with a preorder, and the decision makers may consider having indifference (same) utilities at order equivalent elements. It is the motivation to investigate the properties of order equivalent elements and order equivalent classes in a preordered set, which are called order-clusters in [1].

Fixed point theory has played important roles in traditional equilibrium theory, variational inequalities and optimization theory (see [212]). Fixed point theorems have been applied in the proofs of the existence of solutions in equilibrium problems, variational inequalities, and other problems, in which the underlying spaces are topological spaces and the considered mappings must satisfy some continuity conditions. One is to extend these techniques from traditional variational analysis to analysis on ordered sets, in which there are order structures which may not be topological structures. Hence some new fixed point theorems on ordered sets must be developed.

For single-valued mappings, Tarski et al. provided a fixed point theorem on complete lattices and on chain-complete posets (see [1]). For set-valued mappings, Fujimoto in [13] generalized Tarski’s fixed point theorem from single-valued mappings to set-valued mappings on complete lattices. Very recently, in [6, 7], Li provided several versions of extensions of both the Abian-Brown fixed point theorem and the Fujimoto-Tarski fixed point theorem for set-valued mappings on chain-complete posets. These fixed point theorems have been applied to solve vector-complementarity problems and generalized Nash equilibrium problems.

To generalize the fixed point theorems from posets to preordered sets, Xie et al. in [1] introduced the concepts of order cluster and order-clustered fixed point for order-cluster preserving mappings. They also provided some order-clustered fixed point theorems on preordered sets, which have been applied to solve some generalized equilibrium problems for some strategic games with preordered preferences. We recall the fixed point theorem obtained in [1].

Let ( P , ) be a chain-complete preordered set and let F : P 2 P { } be a set-valued mapping. Suppose that F satisfies the following two conditions:

A1. F is order-increasing upward.

A3. There is an element y in P with y u , for some u F ( y ) .

Assume, in addition to conditions A1 and A3, F also satisfies one of the following conditions:

A2. { z P : z u  for some  u F ( x ) } is an inductive subset of P, for each x P .

A2′. F ( x ) is inductive with a finite number of maximal element clusters, for every x P .

A2″. F ( x ) has a maximum element, for every x P .

Then F has an order-clustered fixed point, that is, there are x P and w [ x ] with w F ( x ) .

In this paper, we apply the above fixed point theorem to solve some generalized variational inequalities, in which the ranges of the considered mappings and the underlying spaces both are preordered sets. We also solve generalized saddle point problems and generalized equilibrium problems in preordered sets.

2 Order-clustered fixed point theorems on preordered sets

In this section, we recall and provide some concepts and properties of preordered sets and the concept of order-clustered fixed point of set-valued mapping on preordered sets, which is introduced in [1] by Xie et al. Here we closely follow the notations from [2, 7, 1416] and [1].

Let P be a nonempty set. An ordering relation  on P is said to be a preorder, whenever it satisfies the following two conditions:
  1. 1.

    (reflexive) x x , for every x P .

     
  2. 2.

    (transitive) x y and y z imply x z , for all x , y , z P .

     
Then P, together with the preorder , is called a preordered set, which is denoted by ( P , ) . Furthermore, a preorder on a preordered set P is said to be a partial order if, in addition to the above two properties, it also satisfies
  1. 3.

    (antisymmetric) x y and y x imply x = y , for every x , y P .

     

In this case, ( P , ) is simply called a poset.

Remark 2.1 It is worthy to mention for clarification that a preordered set ( P , ) equipped with the preorder on P is called a partially ordered system (p.o.s.) in [15].

Let ( P , ) be a preordered set and let A be a nonempty subset of P. Then an element u of P is called an upper bound of A if x u for each x A . The collection of all upper bounds of A is denoted by uppA. That is,
upp A = { y P : y x , for all  x A } .
If an upper bound u of A is in A, then u is called a greatest element (or a maximum element) of A. The collection of all greatest elements (maximum elements) of A is denoted by maxA, that is,
max A = { y A : y x , for all  x A } .
A lower bound of A can be similarly defined and the collection of all lower bounds of A is written as
low A = { y P : y x ,  for all  x A } .
The collection of all smallest elements (minimum elements) of A is denoted by minA. That is,
min A = { y A : y x ,  for all  x A } .
If the set of all upper bounds of A has a smallest element, then we call it a supremum of A; and the collection of all supremum elements of A is denoted by supA or A. That is,
sup A = A = min ( upp A ) .
An infimum of A is similarly defined as a greatest element of the set of all lower bounds of A, provided that it exists; and the collection of all infimum elements of A is denoted by infA or A. We have
inf A = A = max ( low A ) .

It is important to note that, from the above definitions, if A is a subset of a preordered set ( P , ) , then maxA and minA are subsets of A; and uppA, lowA, supA, and infA all are subsets of P. In particular, if ( P , ) is a poset, then maxA, minA, supA, and infA all are singletons, provided that they are nonempty. In this case, maxA, minA, supA, and infA are simply written by the contained elements, respectively.

An element y A is said to be a maximal element of a subset A of a preordered set ( P , ) if for any z A with y z implies z y . The collection of all maximal elements of A is denoted by MaxA, that is,
Max A = { y A : x A  and  x y  imply  y x } .
Similar to the definition of maximal element, a minimal element of A can be defined. The collection of all minimal elements of A is written as
Min A = { y A : x A  and  x y  imply  y x } .
Then every greatest element (or smallest element) of a subset A of a preordered set ( P , ) is a maximal element (or minimum element) of A; the converse does not hold. That is,
max A Max A and min A Min A , for every  A P .

A subset C of a preordered set ( P , ) is said to be totally ordered, or a chain in P, whenever, for every pair x , y C , either x y or y x . Following [13] and [10], we have the following.

Definition 2.2 A nonempty subset A of a preordered set ( P , ) is said to be
  1. i.

    inductive if every chain C in A possesses an upper bound in A, that is, upp C A ;

     
  2. ii.

    chain-complete whenever, every chain C in A has a supremum element in A; that is, upp C A .

     
Let ( P , ) be a preordered set. For any z , w P , we denote the following -intervals:
[ z ) = { x P : x z } , ( w ] = { x P : x w } and [ z , w ] = [ z ) ( w ] = { x P : z x w } .

Let ( P , ) be a preordered set. For any x , y P , we say that x, y are -order equivalent (-order indifference), which is denoted by x y , whenever both x y and y x hold. It is clear that is an equivalence relation on P. For any x P , let [ x ] denote the order equivalent class (order indifference class) containing x, which is called a -cluster (or simply an order cluster, or a cluster, if there is no confusion caused). Let P / or P ˜ denote the collection of all order clusters in the preordered set ( P , ) . So x [ x ] P ˜ , for every x P .

In the case that z w , we have [ z , w ] = [ z ] , which is the order cluster containing z. It is worthy to note that both [ z ) and ( w ] can be considered as unions of order clusters.

Given two preordered sets ( X , X ) and ( U , U ) , we say that a single valued mapping f : X U is order-increasing (or order-preserving) if x X y in X implies f ( x ) U f ( y ) in U. An order-increasing single valued mapping f : X U is said to be strictly order-increasing whenever x X y implies f ( x ) U f ( x ) , where X and U are the strict parts of  X and U , respectively.

We say that a set-valued mapping F : X 2 U { } is order-increasing upward if x X y in X and u F ( x ) imply that there is w F ( y ) such that u U w . F is said to be order-increasing downward if x X y in X and w F ( y ) imply that there is u F ( x ) such that u U w . A set-valued mapping F is said to be order-increasing whenever F is both order-increasing upward and downward.

Order-increasing mappings from preordered set to preordered set have the following equivalent classes preserving properties (see [1]).

Lemma 2.3 Let ( X , X ) and ( U , U ) be two preordered sets and let f : X U be an order-increasing single valued mapping. Then, for every x in X, y [ x ] implies f ( y ) [ f ( x ) ] in U.

Definition 2.4 Let ( X , X ) and ( U , U ) be two preordered sets and let f : X U be a single valued mapping. f is said to be order-cluster-preserving, whenever
x X y implies f ( x ) U f ( y ) , for  x , y X .

Lemma 2.5 Every order-preserving single valued mapping from a preordered set to another preordered set is cluster-preserving.

Definition 2.6 Let ( X , X ) be a preordered set and let F : X 2 X { } be a set-valued mapping. An element x X is called
  1. 1.

    a fixed point of F, whenever x F ( x ) ;

     
  2. 2.

    an X -clustered fixed point (an order-clustered-fixed point, or simply a clustered fixed point) of F, whenever there is a w [ x ] such that w F ( x ) .

     
Let ( P , ) be a chain-complete preordered set and let F : P 2 P { } be a set-valued mapping. Following Fujimoto [13], we use the notation
S F ( x ) = { z P : z u  for some  u F ( x ) } , for every  x P .

Xie et al. in [1] proved the following results, which are extensions of the theorem proved by Li in [7] from chain-complete posets to chain-complete preordered sets.

Theorem 2.7 Let ( P , ) be a chain-complete preordered set and let F : P 2 P { } be a set-valued mapping. Suppose that F satisfies the following two conditions:

A1. F is order-increasing upward.

A3. There is an element y in P with y u , for some u F ( y ) .

Assume, in addition to conditions A1 and A3, F also satisfies one of the following conditions:

A2. S F ( x ) is an inductive subset of P, for each x P .

A2′. F ( x ) is inductive with a finite number of maximal element clusters, for every x P .

A2″. F ( x ) has a maximum element, for every x P .

Then F has an order-clustered fixed point, that is, there are x P and w [ x ] with w F ( x ) .

Remark 2.8 If ( P , ) is a chain-complete preordered set satisfying P , then condition A3 in Theorem 2.7 will be automatically satisfied.

Proof In the case that P , then for any y P , we must have y u , for every u F ( y ) . □

3 Generalized saddle point problems for bifunctions on preordered sets

Let ( X , X ) and ( Y , Y ) be preordered sets. The product set X × Y of the preordered sets X and Y is ordered by the component-wise ordering, which is denoted by X × Y . That is, for any ( x 1 , y 1 ) and ( x 2 , y 2 ) X × Y
( x 1 , y 1 ) X × Y ( x 2 , y 2 ) if and only if x 1 X x 2 and y 1 Y y 2 .
One can check that the coordinate ordering X × Y on X × Y induced by the preorders X and Y defines a preordering relation on X × Y ; and hence ( X × Y , X × Y ) is a preordered set. It has the following properties:
  1. 1.

    If both ( X , X ) and ( Y , Y ) are chain-complete (inductive) preordered sets, then ( X × Y , X × Y ) is also a chain-complete (inductive) preordered set.

     
  2. 2.

    For any x X and y Y , [ ( x , y ) ] = [ x ] × [ y ] , here [ ( x , y ) ] , [ x ] , [ y ] are understood to be the order clusters in ( X × Y , X × Y ) , ( X , X ) and ( Y , Y ) , respectively.

     
  3. 3.
    For any ( x , y ) , ( s , t ) X × Y with ( x , y ) Y ( s , t ) , then we have
    ( ( x , y ) ] = ( x ] × ( y ] , [ ( x , y ) ) = [ x ) × [ y ) and [ ( x , y ) , ( s , t ) ] = [ x , s ] × [ y , t ] ,
     

here, ( ( x , y ) ] , ( x ] , ( y ] are the order intervals in ( X × Y , X × Y ) , ( X , X ) and ( Y , Y ) , respectively.

Definition 3.1 Let ( X , X ) , ( Y , Y ) and ( U ; U ) be preordered sets. Let C, D be nonempty subsets of X and Y, respectively. Let F : C × D U be a mapping. A point ( x , y ) C × D is called a generalized saddle point of the mapping F if it satisfies
F ( x , y ) U F ( x , y ) U F ( x , y ) , for all  x C  and  y D .
It is equivalent, for all x C and y D , to
u U w U v ,

for any u [ F ( x , y ) ] , w [ F ( x , y ) ] and v [ F ( x , y ) ] .

Definition 3.2 Let ( X , X ) , ( Y , Y ) and ( U ; U ) be preordered sets. Let C, D be nonempty subsets of X and Y, respectively. Let F : C × D U be a mapping. F is said to be
  1. 1.
    order-phase preserving for the first variable on C, whenever, for any x 2 X x 1 in C,
    F ( x 1 , y ) U F ( x 1 , t ) implies F ( x 2 , y ) U F ( x 2 , t ) , for any  y , t D ;
     
  2. 2.
    order-phase preserving for the second variable on D, whenever, for any y 2 Y y 1 in D,
    F ( x , y 1 ) U F ( s , y 1 ) implies F ( x , y 2 ) U F ( s , y 2 ) , for any  x , s C .
     
From Definition 2.4, if a mapping F from ( C × D , X × Y ) to ( U , U ) is order-cluster preserving, then it is order-cluster preserving for every single variable. That is,
  1. 1.

    s [ x ] in C implies F ( s , y ) [ F ( x , y ) ] in U, for every given y D ;

     
  2. 2.

    t [ y ] in D implies F ( x , t ) [ F ( x , y ) ] in U, for every given x C .

     
Example 3.3 Let ( R , ) be the set of real numbers equipped with the ordinary real order ≥. Let F : R × R R be a real function as
F ( x , y ) = x 2 y 2 , for all  x , y R .

Then F is order-phase preserving for both variables on R.

Theorem 3.4 Let ( X , X ) , ( Y , Y ) and ( U ; U ) be preordered sets. Let C, D be nonempty chain-complete subsets of X and Y, respectively. Let F : C × D U be a mapping and satisfy the following conditions:
  1. 1.

    F ( x , y ) is order-phase preserving for variables x and y on C and D, respectively.

     
  2. 2.

    For every fixed x C , { t D : F ( x , t ) min { F ( x , y ) : y D } } is a nonempty inductive subset of D with a finite number of maximal elements.

     
  3. 3.

    For every fixed y D , { s C : F ( s , y ) max { F ( x , y ) : x C } } is a nonempty inductive subset of C with a finite number of maximal elements.

     
  4. 4.
    There is an element ( x , y ) C × D with x X s , for some s C satisfying
    F ( s , y ) max { F ( x , y ) : x C }
     
and y Y t , for some t D satisfying
F ( x , t ) min { F ( x , y ) : y D } .
  1. 5.

    F is order-cluster preserving on C × D .

     

Then F has a generalized saddle point.

Proof For the given mapping F : C × D U , we define mappings ϒ F : C 2 D and Ψ F : D 2 C by
ϒ F ( x ) = { t D : F ( x , t ) min { F ( x , y ) : y D } } , for any  x C , Ψ F ( y ) = { s C : F ( s , y ) max { F ( x , y ) : x C } } , for any  y D .
It is worthy to note that since ϒ F ( x ) D and Ψ F ( y ) C , the above definitions are equivalent to
ϒ F ( x ) = { t D : F ( x , t ) y D F ( x , y ) } , for any  x C , Ψ F ( y ) = { s C : F ( s , y ) x C F ( x , y ) } , for any  y D .
Define T : C × D 2 C × D { } by
T ( x , y ) = Ψ F ( y ) × ϒ F ( x ) , for all  ( x , y ) C × D .

From conditions 2 and 3, T is well defined.

At first, we show that, for any ( x 1 , y 1 ) , ( x 2 , y 2 ) C × D , ( x 2 , y 2 ) X × Y ( x 1 , y 1 ) implies T ( x 1 , y 1 ) T ( x 2 , y 2 ) . For any given ( s 1 , t 1 ) T ( x 1 , y 1 ) , we need to prove ( s 1 , t 1 ) T ( x 2 , y 2 ) . To this end, from that ( s 1 , t 1 ) T ( x 1 , y 1 ) is equivalent to s 1 Ψ F ( y 1 ) and t 1 ϒ F ( x 1 ) , we have
F ( s 1 , y 1 ) max { F ( x , y 1 ) : x C }
(1)
and
F ( x 1 , t 1 ) min { F ( x 1 , y ) : y D } .
(2)
From (1), we have F ( x , y 1 ) U F ( s 1 , y 1 ) , for all x C . Since y 2 Y y 1 , then from condition 1 in this theorem that F ( x , y ) is order-phase preserving for variable y on D, it implies F ( x , y 2 ) U F ( s 1 , y 2 ) , for all x C . That is, F ( s 1 , y 2 ) max { F ( x , y 2 ) : x C } ; and therefore, s 1 Ψ F ( y 2 ) . So we obtain
Ψ F ( y 1 ) Ψ F ( y 2 ) .
(3)
On the other hand, from (2), we have F ( x 1 , t 1 ) U F ( x 1 , y ) , for all y D . Since x 2 X x 1 , then from condition 1 in this theorem that F ( x , y ) is order-phase preserving for the variable x on C, it implies F ( x 2 , t 1 ) U F ( x 2 , y ) , for all y D . That is, F ( x 2 , t 1 ) min { F ( x 1 , y ) : y D } ; and therefore, t 1 ϒ F ( x 2 ) . So we obtain
ϒ F ( x 1 ) ϒ F ( x 2 ) , if  x 2 X x 1 .
(4)
Combining (3) and (4), we get
Ψ F ( y 1 ) × ϒ F ( x 1 ) Ψ F ( y 2 ) × ϒ F ( x 2 ) .

That is, T ( x 1 , y 1 ) T ( x 2 , y 2 ) . It clearly implies that T is order-increasing upward.

We claim that an element ( p , q ) is a maximal element of Ψ F ( y ) × ϒ F ( x ) , if and only if p is a maximal element of Ψ F ( y ) and q is a maximal element of ϒ F ( x ) . In fact, if p is a maximal element of Ψ F ( y ) and q is a maximal element of ϒ F ( x ) , then, for any ( s , t ) Ψ F ( y ) × ϒ F ( x ) , we find that s X p implies p X s and t Y q implies q Y t . Then we find that ( s , t ) X × Y ( p , q ) implies ( p , q ) X × Y ( s , t ) . So ( p , q ) is a maximal element of Ψ F ( y ) × ϒ F ( x ) .

On the other hand, if p is not a maximal element of Ψ F ( y ) or q is not a maximal element of ϒ F ( x ) , say, p is not a maximal element of Ψ F ( y ) , then there is s Ψ F ( y ) with s X p , that is, ( s , q ) X × Y ( p , q ) . It implies that ( p , q ) cannot be a maximal element of Ψ F ( y ) × ϒ F ( x ) . Hence, from conditions 3 and 4 in this theorem, ( T ( x , y ) , X × Y ) is an inductive preordered set with a finite number of maximal elements.

Let ( x , y ) be the element in C × D given in condition 4 of this theorem. Then there are points s Ψ F ( y ) and t ϒ F ( x ) satisfying x X s , and y Y t ; that is,
( s , t ) T ( x , y ) and ( x , y ) X × Y ( s , t ) .
Hence the mapping T from C × D to 2 C × D { } satisfies all conditions in Theorem 2.7 with respect to condition A2′. As we apply the mapping T to the preordered set ( C × D , X × Y ) , which is a chain complete preordered set, from Theorem 2.7, T has an order-clustered fixed point, say ( x , y ) C × D . Let [ ( x , y ) ] C × D denote the order-cluster in ( C × D , X × Y ) containing the point ( x , y ) . So there is an element ( u , v ) [ ( x , y ) ] C × D C × D such that ( u , v ) T ( x , y ) . Then we have
u Ψ F ( y ) and v ϒ F ( x ) .

It next will be shown that Ψ F and ϒ F both are order-cluster preserving on D and C, respectively. In fact, from condition 1, F ( x , y ) is order-phase preserving on C.

From u Ψ F ( y ) , we get F ( u , y ) max { F ( x , y ) : x C } , that is,
F ( u , y ) U F ( x , y ) , for all  x C .
(5)
From condition 5, F is order-cluster preserving. From ( u , v ) [ ( x , y ) ] , it implies F ( u , y ) [ F ( x , y ) ] . By (5), we have
F ( x , y ) U F ( x , y ) , for all  x C .
(6)
From v ϒ F ( x ) , we have F ( x , v ) min { F ( x , y ) : y D } , that is,
F ( x , v ) U F ( x , y ) , for all  y D .
(7)
Since F is order-cluster preserving, from ( u , v ) [ ( x , y ) ] , it implies F ( x , v ) [ F ( x , y ) ] . From (7), we have
F ( x , y ) U F ( x , y ) , for all  y D .
(8)
By combining (6) and (8), we get
F ( x , y ) U F ( x , y ) U F ( x , y ) , for all  x C  and  y D .

Hence ( x , y ) is a generalized saddle point of F on C × D . □

If we apply the two mappings ϒ F and Ψ F for a mapping F, defined in the proof of Theorem 3.4, and apply their order-increasing properties, we can get the following theorem.

Theorem 3.5 Let ( X , X ) , ( Y , Y ) and ( U ; U ) be preordered sets. Let C, D be nonempty chain-complete subsets of X and Y, respectively. Let F : C × D U be a mapping and satisfy the following conditions:
  1. 1.

    ϒ F : C 2 D and Ψ F : D 2 C both are order-increasing upward.

     
  2. 2.

    For every fixed x C , ( ϒ F ( x ) , Y ) is a nonempty inductive subset of D with a finite number of maximal elements.

     
  3. 3.

    For every fixed y D , ( Ψ F ( y ) , X ) is a nonempty inductive subset of C with a finite number of maximal elements.

     
  4. 4.

    There is an element ( x , y ) C × D with x X s , for some s Ψ F ( y ) and y Y t , for some t ϒ F ( x ) .

     
  5. 5.

    F is order-cluster preserving on C × D .

     

Then F has a generalized saddle point.

Sketch of the proof Let T : C × D 2 C × D { } be defined as in the proof of Theorem 3.4:
T ( x , y ) = Ψ F ( y ) × ϒ F ( x ) , for all  ( x , y ) C × D .

For any ( x 1 , y 1 ) , ( x 2 , y 2 ) C × D with ( x 2 , y 2 ) X × Y ( x 1 , y 1 ) , take an arbitrary element ( s 1 , t 1 ) T ( x 1 , y 1 ) , we have s 1 Ψ F ( y 1 ) and t 1 ϒ F ( x 1 ) . Since y 2 Y y 1 and x 2 X x 1 , from condition 1 in this theorem, there are s 2 Ψ F ( y 2 ) and t 2 ϒ F ( x 2 ) such that s 2 X s 1 and t 2 Y t 1 . That is ( s 2 , t 2 ) C × D satisfying ( s 2 , t 2 ) X × Y ( s 1 , t 1 ) and ( s 2 , t 2 ) T ( x 2 , y 2 ) . Hence T is an X × Y -increasing mapping from C × D to 2 C × D { } . The rest of the proof is similar to the proof of Theorem 3.4. □

4 Generalized equilibrium problems of bifunctions on preordered sets

Definition 4.1 Let ( X , X ) and ( U ; U ) be preordered sets. Let C be a nonempty subset of X. Let F : C × C U be a mapping. A point x C is called a generalized equilibrium of the mapping F if it satisfies
F ( x , x ) U F ( x , x ) , for all  x C .
It is equivalent to the following, for all x C :
u U w ,

for any u [ F ( x , x ) ] and w [ F ( x , x ) ] .

For a given mapping F : C × C U , define a mapping Γ : C 2 C by
Γ F ( x ) = { t C : F ( x , t ) y C F ( x , y ) } = { t C : F ( x , t ) max { F ( x , y ) : y C } } , for any  x C .

We prove the following theorem for the existence of generalized equilibrium. The proof is similar to the proofs of Theorems 3.4 and 3.5.

Theorem 4.2 Let ( X , X ) and ( U ; U ) be preordered sets. Let C be a nonempty chain-complete subset of X. Let F : C × C U be a mapping and satisfy the following conditions:
  1. 1.

    F ( , y ) is order-phase preserving on C, for every y C .

     
  2. 2.

    For every fixed x C , ( Γ F ( x ) , X ) is a nonempty inductive subset of C with a finite number of maximal elements.

     
  3. 3.

    There is an element x C with x X s , for some s Γ F ( x ) .

     
  4. 4.

    F is order-cluster preserving on C × C .

     

Then F has a generalized equilibrium in C.

Proof For the given mapping F, by condition 2 in this theorem, the mapping Γ F : C 2 C { } is well defined. It will next be shown that Γ F is order-increasing upward. For any x 1 , x 2 C with x 2 X x 1 , for arbitrary t 1 Γ F ( x 1 ) , we have
F ( x 1 , t 1 ) max { F ( x 1 , y ) : y C } .
That is, F ( x 1 , y ) U F ( x 1 , t 1 ) , for all y D . Since x 2 X x 1 , then from condition 1 in this theorem we see that F ( x , y ) is order-phase preserving with respect to x C , it implies F ( x 2 , y ) U F ( x 2 , t 1 ) , for all y C . That is, F ( x 2 , t 1 ) max { F ( x 2 , y ) : y C } . We obtain t 1 Γ F ( x 2 ) . It implies that Γ F is order-increasing upward. From condition 3 in this theorem, it is clearly seen that the elements x C , s Γ F ( x ) satisfy x s . Hence the mapping Γ F from C to 2 C { } satisfies all conditions in Theorem 2.7 with respect to condition A2′, as we consider the mapping is from the chain-complete preordered set ( C , X ) to 2 C { } . We denote by [ x ] C the order cluster in ( C , X ) containing x . So Γ F has an order-clustered fixed point, say x C . So there is u [ x ] C C , such that u Γ F ( x ) . Then we have
F ( x , u ) max { F ( x , y ) : y C } ,
which is equivalent to
F ( x , u ) U F ( x , y ) , for all  y C .
(9)
Since F is order cluster preserving, from u [ x ] C , it implies F ( x , u ) [ F ( x , x ) ] . By (9), we have
F ( x , x ) U F ( x , y ) , for all  y C .

 □

5 Order-clustered fixed point theorems and generalized preordered-variational inequalities

In this section, we consider preordered topological spaces and their properties. We also give some fixed point theorems on preordered topological spaces, which will be applied to solving generalized preordered-variational inequalities in preordered Banach spaces. The notations and terminologies used in this section are derived from Aliprantis and Burkinshaw [14], Carl and Heikkilä [2], Li [7], Ok [16], Xie et al. [1].

Let ( P , ) be a preordered set equipped with a topology τ (it is also a topological space). The topology τ is called a natural topology on ( P , ) with respect to the preorder , whenever, for every z P , the -intervals [ z ) and ( z ] are all τ-closed. A preordered set ( P , ) equipped with a natural topology τ is called a preordered topological space, and it is denoted by ( P , τ , ) .

A preorder on a vector space P is said to be convex, whenever for any z P , the -intervals [ z ) and ( z ] are all convex subsets in P.

We say that a Banach space ( B , ) endowed with a preorder is a preordered Banach space if its norm topology is a natural topology with respect to the preorder on B. A preordered Banach space ( B , , ) is called a convex preordered Banach space if the preorder is convex on B.

Recall that every convex subset in a Banach space is closed in the norm topology if and only if it is closed in the weak topology. Then we have the following result.

Theorem 5.1 Let ( B , ) be a Banach space with norm . Let be a convex preorder on B. Then, with respect to the convex preorder , the norm topology on B is a natural topology, if and only if the weak topology on B is a natural topology.

The connections between the chain-completeness and compactness of subsets in ordered topological spaces are very important topics in the theory of ordered topological spaces. In [6], Li proved that every nonempty compact subset of a partially ordered Hausdorff topological space is chain-complete. In this paper, we extend it to preordered Hausdorff topological spaces. The proof is similar to the proof of Theorem 2.3 in [6] and it is omitted here.

Theorem 5.2 Every nonempty compact subset of a preordered Hausdorff topological space is chain-complete.

Notice that nonempty bounded closed and convex subset of a reflexive Banach space is compact in the weak topology. From Theorems 5.1 and 5.2, we have the following.

Corollary 5.3 Let ( B , ) be a convex preordered reflexive Banach space. Then, for any nonempty bounded closed and convex subset P of B, ( P , ) is a chain-complete preordered set.

Applying Theorems 2.7, 5.1 and 5.2, we obtain the following result.

Theorem 5.4 Let ( B , , ) be a convex preordered reflexive Banach space and let P be a nonempty bounded closed convex subset of B. Let F : P 2 P { } be a set-valued mapping. Suppose that F satisfies the following two conditions:

A1. F is order-increasing upward.

A3. There is an element y in P with y u , for some u F ( y ) .

Assume, in addition conditions A1 and A3, F also satisfies one of the conditions below:

A2. S F ( x ) is an inductive subset of P, for each x P .

A2′. F ( x ) is inductive with a finite number of maximal element clusters, for every x P .

A2″. F ( x ) has a maximum element, for every x P .

Then F has an order-clustered fixed point, that is, there are x P and w [ x ] P with w F ( x ) .

Let ( B , B ) and ( U ; U ) be Banach spaces. As usual, we denote by L ( B , U ) the collection of all linear mappings from B to U.

Definition 5.5 Let ( B , B ) and ( U ; U ) be preordered Banach spaces and C a nonempty subset of B. Let F : C L ( B , U ) be a mapping. A generalized preordered-variational inequality problem associated with C, F, and U, denoted by GPVI ( F , C , U ) , is to find a point x C , such that
F ( x ) ( x x ) U 0 , for all  x C ,
(10)

where 0 is understood as the origin of the Banach space U. Any such point x C is called a solution to the problem GPVI ( F , C , U ) .

Notice that F ( x ) L ( B , U ) , then (10) is equivalent to
F ( x ) ( x ) U F ( x ) ( x ) , for all  x C .
(11)

Definition 5.6 Let ( B , B ) and ( U ; U ) be preordered Banach spaces, and C a nonempty subset of B. A mapping F : C L ( B , U ) is said to be order-phase preserving on C, whenever for any x 2 B x 1 in C, F ( x 1 ) ( y ) U 0 implies F ( x 2 ) ( y ) U 0 , for any given y B .

Theorem 5.7 Let ( B , B ) be a convex preordered reflexive Banach space and ( U ; U ) a preordered Banach space. Let C be a nonempty bounded closed convex subset of B. Let F : C L ( B , U ) be a mapping and satisfy the following conditions:
  1. 1.

    F ( x ) : B U is preorder-phase preserving on C, for every x C .

     
  2. 2.

    For every fixed x C , the set ( { t C : F ( x ) ( t ) min { F ( x ) ( y ) : y C } } , B ) is a nonempty inductive subset of C with a finite number of maximal order clusters.

     
  3. 3.

    There are elements x , s C with x B s , such that F ( x ) ( s ) min { F ( x ) ( y ) : y C } .

     
  4. 4.

    F ( x ) : B U is order-cluster preserving, for every x C .

     

Then the problem GPVI ( F , C , U ) has a solution.

Proof Since ( B , B ) is a convex preordered reflexive Banach space and C is a nonempty bounded closed convex subset of B, from Corollary 5.3, ( C , B ) is chain-complete. Define a mapping Λ F by
Λ F ( x ) = { t C : F ( x ) ( t ) min { F ( x ) ( y ) : y C } } , for any  x C .
From condition 2 in this theorem, Λ F : C 2 C { } is well defined. Similarly to the proof of Theorem 4.2, we can show that the mapping Λ F , from C to 2 C { } , satisfies all conditions in Theorem 5.4 with respect to condition A2′. So Λ F has an order-clustered fixed point, say x C . Then there is u [ x ] C , such that u Λ F ( x ) . Then we have
F ( x ) ( u ) min { F ( x ) ( y ) : y C } ,
which is equivalent to
F ( x ) ( u ) U F ( x ) ( y ) , for all  y C .
(12)
Since F is order-cluster preserving, from u [ x ] C , it implies F ( x ) ( u ) [ F ( x ) ( x ) ] . By (12), we have
F ( x ) ( x ) U F ( x ) ( y ) , for all  y C .
Hence the point x satisfies (11). It is equivalent to
F ( x ) ( x x ) U 0 , for all  x C .

 □

Declarations

Acknowledgements

The authors sincerely thank the anonymous reviewers for their valuable suggestions, which improved the presentation of this paper. The first author was partially supported by the National Natural Science Foundation of China (11171137). The third author was partially supported by the National Natural Science Foundation of China (Grant 11101379).

Authors’ Affiliations

(1)
Department of Mathematics, Lishui University
(2)
Department of Mathematics, Shawnee State University
(3)
Department of Mathematics, Zhejiang Normal University

References

  1. Xie LS, Li JL, Yang WS: Order-clustered fixed point theorems on chain-complete preordered sets and their applications to extended and generalized Nash equilibria. Fixed Point Theory Appl. 2013., 2013: Article ID 192Google Scholar
  2. Carl S, Heikkilä S: Fixed Point Theory in Ordered Sets and Applications: From Differential and Integral Equations to Game Theory. Springer, New York; 2010.Google Scholar
  3. Crouzeix JP: Pseudomonotone variational inequality problems: existence of solutions. Math. Program. 1997, 78(3):305–314. 10.1007/BF02614358View ArticleMathSciNetGoogle Scholar
  4. Isac G Lecture Notes in Mathematics 1528. In Complementarity Problems. Springer, Berlin; 1992.Google Scholar
  5. Isac G, Li JL: Complementarity problems, Karamardian’s condition and a generalization of Harker-Pang condition. Nonlinear Anal. Forum 2001, 6(2):383–390.MathSciNetGoogle Scholar
  6. Li, JL: Fixed point theorems on partially ordered topological Vector Spaces and their applications to equilibrium problems with incomplete preferences. J. Fixed Point Theory Appl. (to appear)Google Scholar
  7. Li JL: Several extensions of the Abian-Brown fixed point theorem and their applications to extended and generalized Nash equilibria on chain-complete posets. J. Math. Anal. Appl. 2014, 409: 1084–1092. 10.1016/j.jmaa.2013.07.070View ArticleMathSciNetGoogle Scholar
  8. Li JL, Ok EA: Optimal solutions to variational inequalities on Banach lattices. J. Math. Anal. Appl. 2012, 388(2):1157–1165. 10.1016/j.jmaa.2011.11.009View ArticleMathSciNetGoogle Scholar
  9. Von Neumann J, Morgenstern O: The Theory of Games and Economic Behavior. Princeton University Press, Princeton; 1944.Google Scholar
  10. Xie LS, Li JL, Yang WS: Vector and ordered variational inequalities and applications to order-optimization problems on Banach lattices. J. Appl. Math. 2013., 2013: Article ID 439394Google Scholar
  11. Yao JC: Variational inequalities with generalized monotone operators. Math. Oper. Res. 1994, 19(3):691–705. 10.1287/moor.19.3.691View ArticleMathSciNetGoogle Scholar
  12. Zhang CJ: Set-Valued Analysis with Applications in Economics. Sciences Press, Beijing; 2004. (Chinese)Google Scholar
  13. Fujimoto T: An extension of Tarski’s fixed point theorem and its applications to isotone complementarity problems. Math. Program. 1984, 28: 116–118. 10.1007/BF02612716View ArticleMathSciNetGoogle Scholar
  14. Aliprantis CD, Burkinshaw O: Positive Operators. Springer, Dordrecht; 2006.View ArticleGoogle Scholar
  15. Dunford N, Schwartz JT: Linear Operators, Part I. Wiley, New York; 1988.Google Scholar
  16. Ok, EA: Order theory (forthcoming)Google Scholar

Copyright

© Xie et al.; licensee Springer. 2014

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.