The Hierarchical Minimax Inequalities for Set-Valued Mappings
Abstract
We study the minimax inequalities for set-valued mappings with hierarchical process and propose two versions of minimax inequalities in topological vector spaces settings. As applications, we discuss the existent results of solutions for set equilibrium problems. Some examples are given to illustrate the established results.
1. Introduction and Preliminaries
These versions, (Hi-1) and (Hi-2), arise naturally from some minimax theorems in the vector or real-valued settings. We refer to [1–4] and the references therein.
The notations we use in the above relations are as follows.
Definition 1 (see [1], [3].)Let A be a nonempty subset of Z. A point z ∈ A is called a
- (a)
minimal point of A if A∩(z − C) = {z}; MinA denotes the set of all minimal points of A;
- (b)
maximal point of A if A∩(z + C) = {z}; MaxA denotes the set of all maximal points of A;
- (c)
weakly minimal point of A if A∩(z − intC) = ∅; MinwA denotes the set of all weakly minimal points of A;
- (d)
weakly maximal point of A if A∩(z + intC) = ∅; MaxwA denotes the set of all weakly maximal points of A.
We note that, for a nonempty compact set A, both sets MaxA and MinA are nonempty. Furthermore, MinA ⊂ MinwA, MaxA ⊂ MaxwA, A ⊂ MinA + C, and A ⊂ MaxA − C. Following [3], we denote both Max and Maxw by max (both Min and Minw by min) in ℝ since both Max and Maxw (both Min and Minw) are the same in ℝ.
We present some fundamental concepts which will be used in the following.
Definition 2 (see [5], [6].)Let U, V be Hausdorff topological spaces. A set-valued map F : U⇉V with nonempty values is said to be
- (a)
upper semicontinuous at x0 ∈ U if for every x0 ∈ U and for every open set N containing F(x0) there exists a neighborhood M of x0 such that F(M) ⊂ N;
- (b)
lower semicontinuous at x0 ∈ U if for any net {xν} ⊂ U, xν → x0, y0 ∈ T(x0) implies that there exists net yν ∈ T(xν) such that yν → y0;
- (c)
continuous at x0 ∈ U if F is upper semicontinuous as well as lower semicontinuous at x0.
We note that if T is upper semicontinuous at x0 and T(x0) is compact, then for any net {xν} ⊂ U, xν → x0, and for any net yν ∈ T(xν) for each ν there exists y0 ∈ T(x0) and a subnet such that . We refer to [5, 6] for more details.
Definition 3 (see [3], [7].)Let k ∈ intC and v ∈ Z. The Gerstewitz function ξkv : Z → ℝ is defined by
Some fundamental properties for the Gerstewitz function are as follows.
Proposition 4 (see [3], [7].)Let k ∈ intC and v ∈ Z. The Gerstewitz function ξkv : Z → ℝ has the following properties:
- (a)
ξkv(u) > r⇔u ∉ v + rk − C;
- (b)
ξkv(u) ≥ r⇔u ∉ v + rk − intC;
- (c)
ξkv(·) is a convex, continuous, and increasing function.
We also need the following different kinds of cone-convexities for set-valued mappings.
Definition 5 (see [1].)Let X be a nonempty convex subset of a topological vector space. A set-valued mapping F : X⇉Z is said to be
- (a)
above-C-convex (resp., above-C-concave) on X if, for all x1, x2 ∈ X and all λ ∈ [0,1],
(2) - (b)
above-naturally C-quasiconvex on X if, for all x1, x2 ∈ X and all λ ∈ [0,1],
(3)where coA denotes the convex hull of a set A; - (c)
above-C-convex-like (resp., above-C-concave-like) on X (X is not necessary convex) if, for all x1, x2 ∈ X and all λ ∈ [0,1], there is an x′ ∈ X such that
(4)
We note that whenever F is a scalar function and C = ℝ+, the mappings in Definition 5 reduce to the classical ones. The following theorem is a special case of the scalar hierarchical minimax theorem by Lin [8].
Theorem 6. Let X be a nonempty compact convex subset of real Hausdorff topological vector space. Let the set-valued mappings F, G, H : X × X⇉ℝ such that F(x, y) ⊂ G(x, y) ⊂ H(x, y) for all (x, y) ∈ X × X; ⋃y∈X F(x, y) and ⋃x∈X H(x, y) are compact for each x ∈ X and for each y ∈ X and satisfy the following conditions:
- (i)
x ↦ F(x, y) is lower semicontinuous on X for each y ∈ X and y ↦ F(x, y) is above-ℝ+-concave on X for each x ∈ X;
- (ii)
x ↦ G(x, y) is above-naturally ℝ+-quasiconvex for each y ∈ X, and y ↦ G(x, y) is lower semicontinuous on X for each x ∈ X;
- (iii)
x ↦ H(x, y) is lower semicontinuous on X for each y ∈ X, y ↦ H(x, y) is above-ℝ+-concave on X for each x ∈ X, and y ↦ H(x, y) is lower semicontinuous for each x ∈ X.
Lemma 7. Let F : X⇉ℝ be such that max⋃x∈X F(x), max⋃x∈X maxF(x), and maxF(x) exist for all x ∈ X. Then
Proof. By using the similar technique of Lemma 3.3 [9], we can show that the conclusion is valid.
2. Scalar Hierarchical Minimax Inequalities
We first state the following scalar hierarchical minimax inequalities.
Theorem 8. Let X be a nonempty compact (not necessarily convex) subset of a real Hausdorff topological space. Let the set-valued mappings F, S, T, G : X × X⇉ℝ with nonempty compact values such that
- (i)
(x, y) ↦ F(x, y) and (x, y) ↦ G(x, y) are upper semicontinuous on X × X;
- (ii)
x ↦ maxS(x, y) is convex-like for each y ∈ X, and y ↦ maxT(x, y) is concave-like on Y for each x ∈ X;
- (iii)
for all (x, y) ∈ X × X, maxF(x, y) ≤ maxS(x, y) ≤ maxT(x, y) ≤ maxG(x, y).
Proof. From (i), we know that both sides of (s-Hi) exist. For any r ∈ ℝ,
Theorem 9. Let X be a nonempty compact convex subset of a real Hausdorff topological vector space. Let the set-valued mappings F, G : X × X⇉ℝ with nonempty compact values such that
- (i)
(x, y) ↦ F(x, y) and (x, y) ↦ G(x, y) are upper semicontinuous on X × X;
- (ii)
y ↦ maxF(x, y) is quasiconcave for each x ∈ X; that is, for each x ∈ X, the set {y ∈ X : maxF(x, y) ≥ r} is convex in X;
- (iii)
for all (x, y) ∈ X × X, maxF(x, y) ≤ maxG(x, y).
Proof. By (i), we know that both sides of (s-Hi) exist. Choose any r ∈ ℝ satisfies
The following examples illustrate Theorems 8 and 9.
Example 10. Let X = {0}∪{1/n : n ∈ ℕ} and f(x) = x2, g(y) = 1 − y2 for all x, y ∈ X. Define F, S, T, G : X × X⇉ℝ by F(x, y) = [0, f(x)g(y)], S(x, y) = [−1, f(x)g(y) + 1], T(x, y) = [2, f(x)g(y) + 2], and G(x, y) = [3, f(x)g(y) + 3]. Obviously, all conditions of Theorem 8 hold. Hence the relation (s-Hi) holds. Indeed, by simple calculation, we can see that
3. Hierarchical Minimax Inequalities
In this section, we will present two versions of hierarchical minimax inequalities. The following theorem is the first result satisfies the relation (Hi-1).
Theorem 12. Let X be a nonempty compact convex subset of a real Hausdorff topological vector space. Let the set-valued mappings F, G, H : X × X⇉Z with nonempty compact values such that F(x, y) ⊂ G(x, y) ⊂ H(x, y) for all (x, y) ∈ X × Y satisfy the following conditions:
- (i)
(x, y) ↦ F(x, y) is upper semicontinuous, y ↦ F(x, y) is above-C-concave on Y for each x ∈ X, and x ↦ F(x, y) is lower semicontinuous on X for each y ∈ Y;
- (ii)
x ↦ G(x, y) is above-naturally C-quasiconvex for each y ∈ Y, and y ↦ G(x, y) is lower semicontinuous on Y for each x ∈ X;
- (iii)
y ↦ H(x, y) is lower semicontinuous and above-C-concave on Y for each x ∈ X, and x ↦ H(x, y) is lower semicontinuous on X for each y ∈ Y;
- (iv)
for each y ∈ Y,
(28)
Proof. Let Γ(x): = Maxw⋃y∈Y F(x, y) for all x ∈ X. From Lemma 2.4 and Proposition 3.5 in [1], the mapping x ↦ Γ(x) is upper semicontinuous with nonempty compact values on X. Hence ⋃x∈X Γ(x) is compact and so is co(⋃x∈X Γ(x)). Then co(⋃x∈X Γ(x)) + C is a closed convex set with nonempty interior. Suppose that v ∉ co(⋃x∈X Γ(x)) + C. By separation theorem, there is a k ∈ ℝ, ϵ > 0, and a nonzero continuous linear functional ξ : Z ↦ ℝ such that
The following example illustrates that Theorem 12 is valid.
Example 13. Let X = [0,1], , and f : X⇉ℝ define
Hence, Maxw⋃x∈X F(x, x) = {0}×[0,1].
Theorem 14. Let X be a nonempty compact convex subset of real Hausdorff topological vector space. Let the set-valued mappings F, G, H : X × X⇉Z such that F(x, y) ⊂ G(x, y) ⊂ H(x, y) for all (x, y) ∈ X × X and satisfy the following conditions:
- (i)
(x, y) ↦ F(x, y) is continuous with nonempty compact values, and y ↦ ξkvF(x, y) is above-ℝ+-concave on X for each x ∈ X and any Gerstewitz function ξkv;
- (ii)
x ↦ G(x, y) is above-naturally C-quasiconvex for each y ∈ X, and y ↦ G(x, y) is lower semicontinuous on X for each x ∈ X;
- (iii)
(x, y) ↦ H(x, y) is upper semicontinuous with nonempty compact values, y ↦ ξkvH(x, y) is above-ℝ+-concave on X for each x ∈ X, and x ↦ H(x, y) is lower semicontinuous on X for each y ∈ X and any Gerstewitz function ξkv;
- (iv)
for each y ∈ Y,
(46)
Proof. Let Γ(x) be defined the same as that in Theorem 12 for all x ∈ X. From the process in the proof of Theorem 12, we know that the set ⋃x∈X Γ(x) is nonempty compact. Suppose that v ∉ ⋃x∈X Γ(x) + C. For any k ∈ intC, there is a Gerstewitz function ξkv : Z ↦ ℝ such that
By conditions (i)–(iii), we know that all conditions of Theorem 6 hold for the mappings ξkvF(x, y), ξkvG(x, y), and ξkvH(x, y), and, hence, we have
4. Strong and Weak Solutions for SEP
We recall that a set-valued mapping Ω : X ↦ Z is called a KKM mapping if for each finite subset {x1, …, xn} ⊂ X.
Fan Lemma (see [11]). Let Ω : X⇉Z be a KKM mapping with nonempty closed values. If there exists an x0 ∈ X such that Ω(x0) is a compact set of Z, then ⋂x∈X Ω(x) ≠ ∅.
We first state that the existent result of weak solution for (SEP) is as follows.
Theorem 15. Let Z be a finite dimensional space and the set-valued mappings F and T are two upper semicontinuous mappings with nonempty compact values such that,
- (i)
for each x ∈ K, there is s ∈ T(x) such that F(s, x, x)⊄− int C;
- (ii)
for each x ∈ K, the sets {(s, y) ∈ TK × K : F(s, x, y)⊂− int C} and T(x) are convex.
Proof. Define Ω : K⇉K by
Since , for all i ∈ {1,2, …, n}, choose any si ∈ T(x0); we have
For the existence of strong solution for (SEP), we propose the following results.
Theorem 16. Under the framework of Theorem 15, in addition, the mappings A, B, G : TK × K × K⇉Z with nonempty compact values such that
- (i)
the mapping s ↦ G(s, x, y) is upper semicontinuous mappings for each x, y ∈ K;
- (ii)
both sets ⋃s∈T(x) F(s, x, y) and ⋃y∈K G(s, x, y) are compact for x, y ∈ K, s ∈ T(x);
- (iii)
the mapping s ↦ maxB(s, x, y) is concave-like for each x, y ∈ K, and the mapping y ↦ maxA(s, x, y) is convex-like for each x, y ∈ K, s ∈ T(x);
- (iv)
for each x, y ∈ K, s ∈ T(x), maxF(s, x, y) ≤ maxA(s, x, y) ≤ maxB(s, x, y) ≤ maxG(s, x, y);
- (v)
for each y ∈ K, there is an with such that
(64)
Proof. According to Theorem 15, we know that (SEP)F has a weak solution. That is, there is an such that
Finally, we give the following example to illustrate that Theorems 15 and 16 are valid.
Example 17. Let K = [1,2], C = ℝ+, Z = ℝ, and T : K⇉ℝ be defined by T(x) = [0,2x] for all x ∈ K. Then we define F, A, B, G : TK × K × K⇉ℝ which are defined by
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
In this research, the first author was supported by Grant no. NSC102-2115-M-039-001- of the National Science Council of Taiwan (Taiwan). The second author was supported partly by National Science Council of the Republic of China.