Existence theorems in nonlinear analysis and applications to optimization related models

VIETNAM NATIONAL UNIVERSITY - HCMC
UNIVERSITY OF SCIENCE
Nguyen Hong Quan
EXISTENCE THEOREMS IN NONLINEAR
ANALYSIS AND APPLICATIONS TO
OPTIMIZATION-RELATED MODELS
Major: Mathematical Optimization
Codes: 62 46 20 01
Referee 1: Assoc.Prof. Dr. Nguyen Dinh
Referee 2: Dr. Huynh Quang Vu
Referee 3: Assoc.Prof. Dr. Lam Quoc Anh
Independent Referee 1: Prof. D.Sc. Nguyen Dong Yen
Independent Referee 2: Assoc.Prof. Dr. Mai Duc Thanh
SCIENTIFIC SUPERVISOR
Professor Phan Quoc Khanh
Ho Chi Minh City - 2013
Contents
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . IV
1 Existence theorems in nonlinear analysis and applications . . . . . . . . 1
1.1 Notions and definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Existence theorems in GFC-spaces . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
1.3.1 Variational inclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
1.3.2 Minimax theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2 Nonlinear existence theorems for mappings on product
GFC-spaces and applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
2.1 Existence theorems on product GFC-spaces . . . . . . . . . . . . . . . . . . . 37
2.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
3 Topological characterizations of existence in nonlinear analysis
and optimization-related problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
3.1 Topological existence theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52

3.2 The existence of solutions to optimization-related problems . . . . . 70
3.2.1 Variational relation problems . . . . . . . . . . . . . . . . . . . . . . . . . 70
3.2.2 Invariant-point theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
3.2.3 Equilibrium problems of the Stampacchia and Minty types 77
3.2.4 Minimax theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
3.2.5 Nash equilibria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
4 Generic stability and essential components of generalized KKM
points and applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
4.1 Notions and definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
4.2 Generic essentialness of T -KKM mappings . . . . . . . . . . . . . . . . . . . 94
4.3 Essential components of sets of T -KKM points . . . . . . . . . . . . . . . . 98
4.4 Applications to maximal elements and variational inclusions . . . . . 99
4.4.1 Essential components of T
0
-maximal elements . . . . . . . . . . . 100
4.4.2 Essential components of solutions to variational inclusions . 100
Contents III
4.4.3 Essential components of particular cases of variational
inclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
List of the author’s papers related to the thesis. . . . . . . . . . . . . . . . . . . . . . 105
List of the author’s conference reports related to the thesis . . . . . . . . . . . 106
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
Glossary of Symbols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
Preface
The existence theorems, including theorems about various points like fixed
points, coincidence points, intersection points, maximal elements, and other re-
sults as KKM theorems, minimax theorems, etc., constitute one of the most im-
portant parts of mathematics. They are crucial tools in the solution existence study
of wide-ranging problems of optimization and applied mathematics.

The existence theorems have a long history of development passing more than
a century with the following major milestones: the Brouwer fixed point theorem
(1912, [14]), Classical KKM principle (1929, [57]), Kakutani fixed point theorem
(1941, [50]), KKM-Fan principle (1961, [33]). From 80s of the 20th century, to
meet demands of practical situations, many classes of problems in optimization
have appeared. One of the first and most important issues of such a class is to
know if solutions exist or not. This requires more new effective mathematical
tools. Hence, existence theorems have been intensively developed to response
that requirement. Especially, in recent years the theory of existence theorems has
obtained many significant achievements.
Like other mathematical theories, the existence theorems have been built from
simple basic results by generalization and abstraction methods. In early forms of
these fundamental results, the convexity played a central role in formulating re-
sults. Therefore, most of the later results mainly focus on improving assumptions
on convexity or replacing them by purely topological assumptions. According
to our observations, for the last three decades the existence theorems have been
developed in three ways. First, some researchers renovated classical notions of
convexity based on linear structures. For instance, the KKM-Fan mapping (Fan
[33]) was extended into the S-KKM mapping (e.g., Chang and Zhang [15], Chang
and Yen [16], Chang, Huang, Jeng and Kuo [17]). In terms of these notions,
new existence results were achieved. Second, many authors replaced the classi-
cal convexity by abstract convexity notions, not using linear structures, and they
extended earlier existing notions and results to these structures. In the frame-
work of this research direction, types of spaces with generalized convexity struc-
tures were proposed and studied. Started with Lassonde ([60]) where a convex
space was created, the following spaces (in the chronological order) were in-
Preface V
troduced: S-contractible spaces (Horvath [45]), H-spaces (Horvath [46-47]), G-
convex spaces (Park and Kim [79-85]), and FC-spaces (Ding [24-32]). These
spaces have been used in studying existence theorems and nonlinear problems. In

the third approach, a number of authors (e.g., Wu [93], Tuy [91-92], Geraghty and
Lin [38], Kindler and Trost [54], Kindler [55-56], Konig [59], Tarafdar and Yuan
[90]) proved existence results which did not require any convexity structures,
where convexity conditions were replaced by connectedness conditions which
are purely topological conditions.
One of the main purposes of this thesis is to develop further the theory of
existence theorems, focusing on the last two approaches. Based on analyzing the
earlier notions and results, we introduce several new structures and use them to
formulate new definitions and establish new or more general results. By providing
illustrative examples, we show the existence of our structures and their usefulness
in many applications. Moreover, our notions and results in this thesis improve or
include as special cases a number of known notions and results.
It is worthwhile noticing that the equivalence of mathematical theorems is
meaningful in applications because it allows us to approach to a problem from
different angles. Therefore, researchers pay much attention on proving equiva-
lence relations between existence results. For examples, in Ha [40], an extension
of Kakutani fixed-point theorem was proved to be equivalent to a section theo-
rem and a minimax result, an equivalence between the KKM-Fan theorem and
a Browder-type fixed-point theorem was shown in Tarafdar [89]. Later on many
researchers discovered similar equivalence relations for other kinds of results like
coincidence theorems, matching theorems, intersection theorems, maximal-point
theorems, section theorems and some geometric results. One of our attempts in
this thesis is to show the equivalence between many of our existence theorems.
On the other hand, any mathematical result needs be applicable for certain sit-
uations. Typical applications of existence theorems are in optimization problems.
Therefore, using our existence theorems to establish solution existence results
for optimization-related models is also a purpose of this thesis. The harvested
results include many new solution existence theorems for various problems as
minimax problems, equilibrium problems, generalized inclusions, variational re-
lation problems, or practical problems as traffic networks, Nash equilibria, ab-

stract economies, etc.
One of the important topics in nonlinear optimization, which have been at-
tracting many mathematicians recently, is properties of solution sets and solu-
tion maps. The properties of solution sets such as closedness, connectedness,
convexity, etc, were studied in many papers (e.g., Fort [37], Jones and Gowda
[49], Khanh and Luc [53], Papageorgiou and Shahzad [78], Rapcsak [86], Zhong,
Huang and Wong [105]). The properties of solution maps, like semicontinuities,
continuity, differentiability, etc., which are commonly called the stability prop-
erties, have also been intensively investigated during recent years (e.g., Anh and
Khanh [1-7], Khanh and Luc [53], Xiang, Liu and Zhou [94], Yang and Yu [96],
Preface VI
Yu and Xiang [98], Yu, Yang and Xiang [99], Zhou, Xiang and Yang [101]).
Based on relationships between sets of particular points of set-valued maps and
solution sets of optimization problems, we propose solution map notions for these
points, consider their stability and apply the obtained results to optimization prob-
lems. Stability issues considered in this thesis are included in the generic stability
study.
The thesis consists of four chapters and contains the results of 10 papers (from
the list of 14 related papers of the author):
Chapter 1: “Existence theorems in nonlinear analysis and applications” is
based on the papers (Q2), (Q3), (Q4), (Q6), (Q7);
Chapter 2: “Nonlinear existence theorems for mappings on product GFC-
spaces and applications” is based on the paper (Q5);
Chapter 3: “Topological characterizations of existence in analysis and opti-
mization related problems” is based on the papers (Q10), (Q11), (Q12);
Chapter 4: “Generic stability and essential components of generalized KKM
points and applications” is based on the paper (Q8).
Acknowledgments
I express my deep gratitude to Professor Phan Quoc Khanh, my supervisor, for
a continuous guidance, encouragement and valuable suggestions. I would like to

thank very much the University of Science of Hochiminh City for providing me
all conditions and facilities for my work. I am also indebted to the Vietnam Insti-
tute for Advanced Study in Mathematics (VIASM) and its members. During my
stay there as a visiting young researcher, they facilitated me with both a financial
support and a perfect research environment for the completion of a part of this
thesis.
Ho Chi Minh City, October 2013 Nguyen Hong Quan
1
Existence theorems in nonlinear analysis and
applications
In this chapter, we propose a definition of GFC-spaces to encompass G-convex
spaces, FC-spaces and many earlier existing spaces with generalized convexity
structures. Existence theorems are then established with underlying structures
being GFC-spaces under relaxed assumptions. These results contain, as properly
particular cases, a number of counterparts which were recently developed in the
literature. As applications, using these results we prove the existence of solutions
to a general variational inclusion problem, which contains most of the existing
results of this type, and develop in detail general types of minimax theorems.
Examples are given to explain advantages of our results.
1.1 Notions and definitions
We recall notions used in the whole thesis. Let Y be a nonempty set, Y  stands
for the set of all finite subsets of Y . For n ∈ N, the set of all natural numbers, ∆
n
stands for the n-simplex with the vertices being the unit vectors e
0
= (1,0, ,0),
e
1
= (0,1, ,0), , e
n

= (0,0, ,1) of a basis of R
n+1
. For N = {y
0
,y
1
,y
n
} ∈
Y  and M = {y
i
0
,y
i
1
, ,y
i
k
} ⊂ N, let ∆
|N|
≡ ∆
n
, and ∆
M
≡ ∆
k
be the face of
∆
|N|
corresponding to M, i.e., ∆

M
= co{e
i
0
,e
i
1
, e
i
k
}. If A,B ⊂ X, X being a
topological space, then A (or clA), A
B
(or cl
B
A), intA, int
B
A and A
c
signify the
closure, closure in B, interior, interior in B and complement X \ A, respectively
(shortly, resp), of A. Let X, Y be nonempty sets and F : X ⇒ Y be a set-valued
map. For x ∈ X and y ∈ Y , the sets F(x), F
−1
(y) = {x ∈ X | y ∈ F(x)} and F
∗
(y) =
X \ F
−1
(y) are called an image, a fiber (or inverse image) and a cofiber, resp. The

map F
−1
(F
∗
) is called the inverse map (dual map, resp) of F. The graph of F
is GphF := {(x,y) ∈ X ×Y |y ∈ F(x)}. Now let X and Y be topological spaces,
F : X ⇒ Y , and f : X → R. F is called closed (open, resp) if its graph is closed
(open, resp). F is said to be upper semicontinuous (usc, for short) (resp, lower
semicontinuous (lsc)) if for each open (resp, closed) subset U of Y , the set {x ∈
X | F(x) ⊂ U} is open (resp, closed). F is said to be continuous if it is both usc
and lsc. f is said to be usc (resp, lsc), if, for all α ∈ R, the set {x ∈ X | f (x) ≥ α}
(resp, {x ∈ X | f (x) ≤ α}) is closed.
1.1 Notions and definitions 2
The following concepts are taken from [22, 25]. A subset A of a topological
space X is called compactly open (compactly closed, resp) if, for each nonempty
compact subset K of X, A ∩ K is open (closed, resp) in K. The compact interior
and compact closure of A are defined by, resp,
cintA =

{B ⊂ X : B ⊂ A and B is compactly open in X},
cclA =

{B ⊂ X : B ⊃ A and B is compactly closed in X}.
F : Y ⇒ X is called transfer open-valued (transfer closed-valued, resp) if ∀y ∈ Y,
∀x ∈ F(y) (∀x /∈ F(y), resp), ∃y

∈ Y such that x ∈ int(F(y

) (x /∈ cl(F(y


), resp).
F is termed transfer compactly open-valued (transfer compactly closed-valued)
if ∀y ∈ Y , ∀K ⊂ X: nonempty and compact, ∀x ∈ F(y) ∩ K (∀x /∈ F(y) ∩ K),
∃y

∈ Y such that x ∈ cintF(y

) (x /∈ cclF(y

), resp). Of course intA ⊂ cintA (clA ⊃
cclA), and transfer open-valuedness (transfer closed-valuedness) implies transfer
compact open-valuedness (transfer compact closed-valuedness, resp). Moreover,
a set-valued mapping has open values (closed values) then it is transfer open-
valued (transfer closed-valued). We will use these notions in order to compare
our results directly with many known existing ones.
Lemma 1.1.1 (e.g., [22]) Let Y be a set, X be a topological space and F : Y ⇒ X.
The following statements are equivalent
(i) F is transfer compactly closed-valued (transfer compactly open-valued, resp);
(ii) for each compact subset K ⊂ X ,

y∈Y
(K ∩ F(y)) =

y∈Y
(K ∩ cclF(y)) =

y∈Y
(K ∩ cl
K
F(y))



y∈Y
(K ∩ F(y)) =

y∈Y
(K ∩ cintF(y)) =

y∈Y
(K ∩ int
K
F(y)), resp

.
We propose the following definition of a GFC-space to unify a number of ear-
lier existing notions of spaces with generalized convexity structures, but without
linear structures. This notion is proposed based on observing that although the
abstract convexity structures associated with the earlier existing spaces such as
convex spaces ([60]), H-spaces ([46-47]), G-convex spaces ([79-85]), FC-spaces
([24-32]) are different, all of them use the image of a simplex through a continu-
ous map.
Definition 1.1.1 Let X be a topological space, Y be a nonempty set and Φ be a
family of continuous mappings ϕ : ∆
n
→ X ,n ∈ N. Then a triple (X,Y,Φ) is said
to be a generalized finitely continuous topological space (GFC-space in short) if
for each finite subset N ∈ Y , there is ϕ
N
: ∆
|N|

→ X of the family Φ (we also
use (X,Y,{ϕ
N
}) to denote (X,Y,Φ)).
1.1 Notions and definitions 3
The above mentioned existing spaces are the examples for GFC-space. In par-
ticular, a convex subset A of a topological vector space is a GFC-space, where
X = Y = A and each N = {a
0
,a
1
, ,a
n
} ∈ A, there is ϕ
N
: ∆
|N|
→ A which is
defined by ϕ
N
(e) =
∑
n
i=0
λ
i
a
i
for all e =
∑

n
i=0
λ
i
e
i
∈ ∆
|N|
. GFC-spaces are properly
more general than known existing spaces. Therefore it is reasonable and valuable
to study existence theorems and nonlinear problems in GFC-spaces without linear
structure.
The following example shows that GFC-spaces are properly more general
than G-convex spaces. Recall that, a G-convex space is [79-85] a triple (X,Y,ϒ ),
where X and Y are as Definition 1.1.1 and ϒ : Y  ⇒ X is such that, for each
N ∈ Y , there exists a continuous map ϕ
N
: ∆
|N|
→ ϒ (N) such that, for each
M ∈ N, ϕ
N
(∆
M
) ⊂ ϒ (M). A G-convex space (X,Y,ϒ ) is called trivial iff, for
all N ∈ Y , ϒ (N) = X. Of course, any above-mentioned space can be made into
a trivial G-convex space, but a trivial G-convex space has no use.
Example 1.1.1 Let Y =]0,+∞[, X = {(x,x) | x ∈]0,+∞[} ⊂ R
2
and, for each

N ∈ Y , ϕ
N
(e) = (α(N),α(N)) ∈ X for all e ∈ ∆
|N|
, where α(N) = min N.maxN.
Then, (X,Y,{ϕ
N
}) is a GFC-space. Suppose there exists ϒ : Y  ⇒ X such that
(X,Y,ϒ ) is a nontrivial G-convex space, and (X,Y,{ϕ
N
}) can be made into
(X,Y,ϒ ). Then, since (X,Y,ϒ ) is a G-convex space, we have, for all N ∈ Y 
and y ∈ Y , ϕ
N∪{y}
(∆
|N|
) = (α(N ∪ {y}),α(N ∪ {y})) ∈ ϒ (N). It follows that, for
all N ∈ Y,
Λ :=

(α(N ∪ {y}),α(N ∪ {y})) | y ∈ Y

⊂ ϒ (N). (1.1.1)
On the other hand, for all N ∈ Y and x ∈]0,+∞[, taking y =
x
maxN
if x ≤ α(N)
and y =
x
minN

if x > α(N), we have (x, x) = (α(N ∪{y}),α(N ∪{y})) ∈ Λ. Thus,
X ⊂ Λ . This and (1.1.1) imply that, for all N ∈ Y , ϒ (N) = X, i.e., (X,Y,ϒ ) is a
trivial G-convex space.
Next, we define several concepts in a GFC-space.
Definition 1.1.2 Let (X,Y,Φ) be a GFC-space, D,C ⊂ Y and S : Y ⇒ X be given.
(i) D is called an S-subset of Y (S-subset of Y wrt C) if for all N ∈ Y  and for all
M ⊂ N ∩ D (for all M ⊂ N ∩C, resp), ϕ
N
(∆
M
) ⊂ S(D).
(ii)If in addition to (i), S
−1
(ϕ
N
(∆
M
)) ⊂ D, then D is called an S
GFC
-subset of
Y . The GFC-hull wrt S of C is defined by GFC
S
(C) =

{D ⊂ Y | D is S
GFC
-
subset of Y containing C}.
Clearly, if D is an S
GFC

-subset of Y , D must be an S-subset of Y . Roughly
speaking, if D is an S-subset of Y then (S(D),D,Φ) is a ”pre” GFC-space, and if
D is an S
GFC
-subset of Y then (S(D),D,Φ) is a ”full” GFC-space. When X = Y ,
i.e, (X,Y,Φ) = (X,Φ) is an FC-space, and S = I is the identity map, then being
an S
GFC
-subset or an S-subset of X coincides with being an FC-subspace of X
([30]). Moreover, the notion of a GFC-hull wrt S of a set extends the notions of
1.1 Notions and definitions 4
an FC-hull of a set in a FC-space ([25]) and a G-convex hull of a set in a G-
convex space ([64]). The extension of concepts of subspaces and convex hulls as
above also shows the rationality of the GFC-spaces. The following Lemma 1.1.2
extends Lemma 2.1 of [95] from FC-spaces to GFC-spaces.
Lemma 1.1.2 Let (X,Y,Φ) be a GFC-space, C a nonempty subset of Y and
S : Y ⇒ X. Then,
(a) GFC
S
(C) is an S
GFC
-subset of Y ;
(b) GFC
S
(C) is the smallest S
GFC
-subset of Y containing C;
(c) GFC
S
(C) =


N∈C
GFC
S
(N).
Proof. (a) and (b) are obvious.
(c) For every N ∈ C, it is clear that GFC
S
(N) ⊂ GFC
S
(C). Hence,
C ⊂

N∈C
GFC
S
(N) ⊂ GFC
S
(C).
Therefore, it suffices to show that the union in these inclusions, which is now
denoted by B, is an S
GFC
-subset of Y. Assume that N
0
∈ Y  and M
0
⊂ N
0
∩B. By
the definition of B, there is {N

1
, ,N
l
} ∈ C, such that M
0
⊂

l
i=1
GFC
S
(N
i
) ⊂
B. Since

l
i=1
N
i
∈ C, one has GFC
S
(

l
i=1
N
i
) ⊂ B. As, ∀ j = 1, ,l, GFC
S

(N
j
)
⊂ GFC
S
(

l
i=1
N
i
), one has further M
0
⊂ GFC
S
(

l
i=1
N
i
). Since each GFC - hull
wrt S is S
GFC
-subset, by Definition 1.1.2, S
−1
(ϕ
N
0
(∆

M
0
)) ⊂ GFC
S


l
i=1
N
i

⊂ B.
Hence, again by this definition, B is an S
GFC
-subset of Y . 
The notion of a GFC-space helps us also to extend the notion of generalized
KKM maps which plays an essential role in the theory of existence.
Definition 1.1.3 Let (X,Y,Φ) be a GFC-space, Z be a topological space, F :
Y ⇒ Z and T : X ⇒ Z be set-valued mappings. F is said to be a generalized KKM
mapping with respect to (shortly, w.r.t) T (T -KKM mapping in short) if, for each
N ∈ Y and each M ⊂ N, one has T (ϕ
N
(∆
M
)) ⊂

y∈M
F(y).
The definition of T -KKM mappings was introduced for X being a convex sub-
set of a topological vector space in [16] and extended to FC-spaces in [24]. Defini-

tion 1.1.3 includes these definitions as particular cases. It encompasses also many
other kinds of generalized KKM mappings. We mention here some of them. Let
(X,{ϕ
N
}) be an FC-space, Y be a nonempty set and s : Y → X be a mapping. We
define a GFC-space (X,Y,{ϕ
N
}) by setting ϕ
N
= ϕ
s(N)
for each N ∈ Y . Then, a
generalized s-KKM mapping wrt T introduced in [25] becomes a T -KKM map-
ping by Definition 1.1.3. A multivalued mapping F : Y ⇒ X, being an R-KKM
mapping as defined in [20], is a special case of T -KKM mappings on GFC-space
when X = Z and T is the identity map. The definition of generalized KKM map-
pings wrt to T in [61] is as well a particular case of Definition 1.1.3.
1.1 Notions and definitions 5
Definition 1.1.4 Let (X,Y,Φ) be a GFC-space and Z be a topological space.
A multivalued mapping T : X ⇒ Z is called better admissible if T is usc and
compact-valued such that for each N ∈ Y  and each continuous mapping ψ :
T (ϕ
N
(∆
|N|
)) → ∆
|N|
, the composition ψ ◦T |
ϕ
N

(∆
|N|
)
◦ϕ
N
: ∆
|N|
⇒ ∆
|N|
has a fixed
point. The class of all such better admissible mapping from X to Z is denoted by
B(X,Y,Z).
The class of better admissible mappings generalizes classes of admissible
mappings proposed in [24, 82, 85].
Definition 1.1.5 Let (X,Y,Φ) be a GFC-space. We say that a set-valued map-
ping T : X ⇒ Z has the generalized KKM property if, for each T-KKM mapping
F : Y ⇒ Z, the family

F(y) : y ∈ Y

has the finite intersection property, i.e. all fi-
nite intersections of sets of this family are nonempty. By KKM(X,Y,Z) we denote
the class of all mappings T : X ⇒ Z which enjoy the generalized KKM property.
Lemma 1.1.3 Let (X,Y,Φ) be a GFC-space, Z be a topological space, S :
Y ⇒ X, D be an S-subset of Y , and T ∈ KKM(X,Y,Z). Then, T |
S(D)
∈ KKM

S(D),D,T(S(D))


.
Proof. Assume that R : D ⇒ T (S(D)) is a T |
S(D)
-KKM mapping. Then, for each
N ∈ D ⊂ Y  and each M ⊂ N,
T (ϕ
N
(∆
M
)) = T |
S(D)
(ϕ
N
(∆
M
)) ⊂

y∈M
R(y).
Define a set-valued mapping F : Y ⇒ Z by
F(y) =

R(y) if y ∈ D,
Z if otherwise.
Clearly F is a T-KKM mapping. Since T ∈ KKM(X,Y,Z), the family

F(y) : y ∈
Y

has the finite intersection property. It follows that the family


R(y) : y ∈ D

has this property too. Thus, the lemma is proved. 
Lemma 1.1.4 Let (X,Y,Φ) be an GFC-space and S : Y ⇒ X . Assume that Ω :
Z ⇒ Y has nonempty values such that Ω
−1
is transfer compactly open-valued.
Let GFC
S
◦ Ω : Z ⇒ Y be defined by (GFC
S
◦ Ω)(z) = GFC
S
(Ω(z)) (GFC
S
◦ Ω
is called a GFC-hull mapping wrt S of Ω). Then (GFC
S
◦ Ω)
−1
is also transfer
compactly open-valued.
Proof. Let K ⊂ Z be any nonempty compact subset, y ∈ Y and z ∈ (GFC
S
◦
Ω)
−1
(y) ∩ K. Then y ∈ GFC
S

(Ω(z)). By Lemma 1.1.2(c), there is N ∈ Ω (z)
such that y ∈ GFC
S
(N). We have z ∈ Ω
−1
(y

) ∩ K for all y

∈ N. Since Ω
−1
is
transfer compactly open-valued, there exists

N ∈ Y  with |

N| = |N| such that
z ∈ int
K

Ω
−1
( ˆy) ∩ K

⊂ Ω
−1
( ˆy) ∩ K for all ˆy ∈

N. Then,


N ∈ Ω(z) and hence
1.2 Existence theorems in GFC-spaces 6

N ⊂ GFC
S
(Ω(z)). Fixing ˆy
0
∈

N and choosing ˆy = ˆy
0
we have ˆy ∈ GFC
S
(Ω(z)) =
(GFC
S
◦ Ω)(z), i.e., z ∈ (GFC
S
◦ Ω)
−1
( ˆy). Moreover, z ∈ int
K

Ω
−1
( ˆy) ∩ K

⊂ int
K


(GFC
S
◦ Ω )
−1
( ˆy) ∩ K

. Thus, (GFC
S
◦ Ω )
−1
is transfer compactly open-
valued. 
1.2 Existence theorems in GFC-spaces
Using two elementary topological tools: the finite intersection property of com-
pact sets and the existence, for a finite covering of a compact set, of a partition of
unity associated with this covering, we first prove the following three versions of
results.
Theorem 1.2.1 (Intersection) Let (X,Y,{ϕ
N
}) be a GFC-space, Z be a topo-
logical space. Let T ∈ B(X,Y,Z) and F : Y ⇒ Z satisfy the following conditions
(i) for each y ∈ Y , F(y) is compactly closed;
(ii) F is T-KKM;
(iii) either of the following three conditions holds
(a) there are N
0
∈ Y  and a compact subset K of Z with

y∈N
0

F(y) ⊂ K;
(b) there is S : Y ⇒ X such that for each N ∈ Y , there exists an S-subset L
N
of Y,
containing N, so that S(L
N
) is a compact subset and, for some nonempty and
compact subset K of Z, T (S(L
N
)) ∩

y∈L
N
F(y) ⊂ K;
(c) there are S : Y ⇒ X and a nonempty subset Y
0
⊂ Y such that K :=

y∈Y
0
F(y)
is compact and that, for each N ∈ Y , there exists an S-subset L
N
of Y con-
taining Y
0
∪ N so that S(L
N
) is compact.
Then, K ∩ T (X)∩


y∈Y
F(y) = /0.
Theorem 1.2.2 (Coincidence points) Let (X,Y,{ϕ
N
}) be a GFC-space and Z
be a topological space. Let S : Y ⇒ X, T : X ⇒ Z and F : Z ⇒ Y be multivalued
mappings with T ∈ B(X,Y,Z). Assume that
(i) for each x ∈ X and each z ∈ T (x), F(z) is an S-subset of Y;
(ii) for each y ∈ Y, F
−1
(y) contains a compactly open O
y
(some O
y
may be empty)
of Z such that K :=

y∈Y
O
y
is nonempty and compact;
(iii) either of the following three conditions holds:
(a) there is N
0
∈ Y  such that

y∈N
0
O

c
y
⊂ K;
(b) for each N ∈ Y , there is an S-subset L
N
of Y, containing N such that S(L
N
)
is compact and T (S(L
N
)) ∩

y∈L
N
O
c
y
⊂ K;
(c) K = Z; there is a nonempty subset Y
0
of Y such that

y∈Y
0
O
c
y
is compact or
empty; and for each N ∈ Y  there is an S-subset L
N

of Y containing Y
0
∪ N
so that S(L
N
) is compact.
Then, a point ( ¯x, ¯y, ¯z) ∈ X ×Y ×Z exists such that ¯x ∈ S( ¯y), ¯y ∈ F(¯z) and ¯z ∈ T (¯x).
1.2 Existence theorems in GFC-spaces 7
Theorem 1.2.3 (Maximal-elements) Let (X,Y,{ϕ
N
}) be a GFC-space, Z be a
topological space and K ⊂ Z be nonempty and compact. Let F : Z ⇒ Y and
T : X ⇒ Z be multivalued mapping such that T ∈ B(X,Y,Z) and the following
assumptions are satisfied
(i) for each y ∈ Y , F
−1
(y) includes a compactly open subset O
y
(some O
y
may
be empty) of Z such that

y∈Y
(O
y
∩ K) =

y∈Y
(F

−1
(y) ∩ K);
(ii) for any N ∈ Y  and M ⊂ N, T (ϕ
N
(∆
M
)) ∩

y∈M
O
y
= /0;
(iii) either of the following conditions hold:
(a) there is N
0
∈ Y  such that Z\K ⊂

y∈N
0
O
y
;
(b) there is a multivalued map S : Y ⇒ X such that, for each N ∈ Y , there is an
S-subset L
N
of Y containing N so that S(L
N
) is compact and T (S(L
N
))\K ⊂


y∈L
N
O
y
.
Then, a point ¯z ∈ K exists such that F(¯z) = /0.
Theorem 1.2.4 (Maximal-elements) Let (X,Y,{ϕ
N
}), Z, F and T be defined as in
Theorem 1.2.3 such that (ii) is satisfied and (i) and (iii) are replaced respectively
by
(i’) for each y ∈ Y, F
−1
(y) contains a compactly open subset O
y
, which may be
empty, of Z such that,

y∈Y
(O
y
∩Z
0
) =

y∈Y
(F
−1
(y)∩Z

0
) for each nonempty
compact subset Z
0
of Z;
(iii’) there are a multivalued map S : Y ⇒ X and a nonempty subset Y
0
of Y such
that K :=

y∈Y
0
O
c
y
is compact and that, for each N ∈ Y , there exists an
S-subset L
N
of Y containing Y
0
∪ N so that S(L
N
) is compact.
Then, an element ¯z ∈ Z exists with F(¯z) = /0.
Remark 1.2.1 Our Theorem 1.2.1 contains Theorem 3 of [83] and Theorems 1-3
of [22] as special cases for the case of G-convex spaces. Theorem 1.2.2 general-
izes Theorem 1 of [80], Theorem 1.2.3 extends Theorem 2.2 of [24], and Theorem
1.2.4 includes Theorem 2.1 of [24] as a special case for the FC-space setting.
Proof. To prove the above theorems, we first prove the following lemma.
Lemma 1.2.1 Let (X,Y,{ϕ

N
}) be a GFC-space and Z be a topological space.
Let F : Y ⇒ Z and T : X ⇒ Z be multivalued mappings. Assume that
(i) for each y ∈ Y , F(y) is compactly closed;
(ii) T ∈ B(X,Y,Z) and F is T-KKM.
Then, for each N ∈ Y , T (ϕ
N
(∆
|N|
)) ∩

y∈N
F(y) = /0.
Proof of Lemma 1.2.1. Suppose to the contrary that N = {y
0
,y
1
, ,y
n
} ∈ Y 
exists such that
1.2 Existence theorems in GFC-spaces 8
T (ϕ
N
(∆
|N|
)) =

y
i

∈N

(Z\F(y
i
)) ∩ T (ϕ
N
(∆
|N|
))

,
i.e. the family

(Z\F(y
i
))∩T (ϕ
N
(∆
|N|
))

n
i=0
is an open covering of the compact
set T (ϕ
N
(∆
|N|
)). Let {ψ
i

}
n
i=0
be a continuous partition of unity associated with
this covering and ψ : T (ϕ
N
(∆
|N|
)) → ∆
|N|
be defined by ψ(z) =
∑
n
i=0
ψ
i
(z)e
i
.
Then ψ is continuous. Since T is better admissible, there is a fixed point of ψ ◦
T |
ϕ
N
(∆
|N|
)
◦ϕ
N
, i.e. there is z
0

∈ T (ϕ
N
(∆
|N|
)) such that z
0
∈ T (ϕ
N
(ψ(z
0
))). Setting
J(z
0
) =

j ∈ {0,1, ,n} : ψ
j
(z
0
) = 0

and M(z
0
) = {y
j
∈ N | j ∈ J(z
0
)}, We have
ψ(z
0

) =
∑
j∈J(z
0
)
ψ
j
(z
0
)e
j
∈ ∆
M(z
0
)
.
As F is T -KKM, we also have
z
0
∈ T (ϕ
N
(ψ(z
0
))) ⊂ T (ϕ
N
(∆
M(z
0
)
)) ⊂


j∈J(z
0
)
F(y
j
).
Hence, there exists j ∈ J(z
0
), z
0
∈ F(y
j
).
On the other hand, by the definitions of J(z
0
) and of the partition {ψ
i
}
n
i=0
,
z
0
∈

z ∈ T (ϕ
N
(∆
|N|

)) : ψ
j
(z) = 0

⊂ (Z\F(y
j
)) ∩ T (ϕ
N
(∆
|N|
)) ⊂ Z\F(y
j
),
a contradiction.
Proof of Theorem 1.2.1. Case of (a). For y ∈ Y , set U(y) = T(X)∩(

y

∈N
0
F(y

))∩
F(y). By (i) and (a),

U(y)

y∈Y
is a family of sets which are closed in K. For each
N ∈ Y, setting M = N ∪ N

0
, by Lemma 1.2.1 we have
/0 = T (ϕ
M
(∆
|M|
)) ∩

y∈M
F(y) ⊂ T (X)∩

y∈M
F(y) =

y∈N
U(y).
Since K is compact, this implies that
/0 =

y∈Y
U(y) ⊂ K ∩ T (X) ∩

y∈Y
F(y).
Case of (b). By (i),

K ∩ T (X)∩F(y)

y∈Y
is a family of sets which are closed in

K (K is given in (b)). Suppose that
/0 = K ∩ T (X) ∩

y∈Y
F(y) =

y∈Y

K ∩ T (X)∩F(y)

.
Then there exists N ∈ Y  such that
/0 =

y∈N

K ∩ T (X)∩F(y)

= K ∩ T (X)∩

y∈N
F(y),
1.2 Existence theorems in GFC-spaces 9
i.e.,
T (X)∩

y∈N
F(y) ⊂ Z\K.
In view of the assumption (b), T (S(L
N

)) ∩

y∈L
N
F(y) ⊂ K. On the other hand,
T (S(L
N
)) ∩

y∈L
N
F(y) ⊂ T (X)∩

y∈N
F(y) ⊂ Z\K.
Thus, T (S(L
N
)) ∩

y∈L
N
F(y) = /0.
As L
N
is an S-subset of Y , by virtue of Lemma 1.2.1 we have, for each M ∈
L
N
,
/0 = T (ϕ
M

(∆
|M|
)) ∩

y∈M
F(y) ⊂ T (S(L
N
)) ∩

y∈M
F(y).
By the compactness of T (S(L
N
)) (as T is usc, compact-valued and S(L
N
) is com-
pact), this implies that T (S(L
N
)) ∩

y∈L
N
F(y) = /0, a contradiction.
Case of (c). If K is compact, then

K ∩ T (X) ∩ F(y)

y∈Y
is a family of closed
subsets of K. Suppose that K ∩ T (X) ∩


y∈Y
F(y) = /0. Then there is N ∈ Y 
such that
/0 =

y∈N

K ∩ T (X)∩F(y)

= T (X)∩

y∈Y
0
∪N
F(y).
Therefore,
T (S(L
N
)) ∩

y∈L
N
F(y) ⊂ T (X)∩

y∈Y
0
∪N
F(y) = /0.
Now we can argue similarly as for the case (b) to get a contradiction.

Proof of Theorem 1.2.2. Define a new multivalued mapping G : Y ⇒ Z by set-
ting, ∀y ∈ Y, G(y) = O
c
y
, which is compactly closed by (ii), i.e. assumption (i) of
Theorem 1.2.1 for G in the place of F is fulfilled. It is clear that (a), (b), and (c)
imply the corresponding assumptions of Theorem 1.2.1 for G. By the definition
of K in (ii),
K ∩
T (X)∩

y∈Y
G(y) ⊂ K ∩

y∈Y
O
c
y
= /0,
which means that the conclusion of Theorem 1.2.1 for G in the place of F does
not hold. Therefore assumption (ii) of this theorem must be violated, i.e. G is not
T -KKM. This means that there are N ∈ Y and M ⊂ N such that
T (ϕ
N
(∆
M
)) ⊂

y∈M
G(y) =


y∈M
O
c
y
.
This in turn is equivalent to the existence of ¯x ∈ ϕ
N
(∆
M
) and ¯z ∈ T ( ¯x) such that
¯z ∈ O
y
, for all y ∈ M. Since O
y
⊂ F
−1
(y) by (ii), y ∈ F(¯z), which is an S-subset
1.2 Existence theorems in GFC-spaces 10
of Y . Hence ¯x ∈ ϕ
N
(∆
M
) ⊂ S(F(¯z)), which means that there is ¯y ∈ F(¯z) such that
¯x ∈ S( ¯y).
Proof of Theorem 1.2.3. We check the assumptions of Theorem 1.2.1 in order
to apply it for, instead of F, a new multivalued mapping G : Y ⇒ Z defined by
G(y) = O
c
y

. Assumption (i) is clearly fulfilled. For (ii), with arbitrary N ∈ Y  and
M ⊂ N, we have, by (ii) of Theorem 1.2.3,
T (ϕ
N
(∆
M
)) ⊂

y∈M
O
c
y
=

y∈M
G(y),
i.e. G is T -KKM as required. By (a) of this theorem, we obtain (a) since

y∈N
0
G(y) =

y∈N
0
O
c
y
⊂ Z\(Z\K) = K.
From (b) of this theorem it follows that
T (S(L

N
)) ∩

y∈L
N
G(y) = T (S(L
N
)) ∩

Z\

y∈L
N
O
y

⊂ T (S(L
N
)) ∩

Z\(T (S(L
N
))\K)

⊂ K,
i.e. (b) is satisfied. Now that all the assumptions of Theorem 1.2.1 have been
checked, we obtain from this theorem
/0 = K ∩
T (X)∩


y∈Y
G(y)
= K ∩ T (X)∩

Z\

y∈Y
O
y

⊂ K ∩ T (X)∩

Z\

y∈Y
(O
y
∩ K)

= K ∩ T (X)∩

Z\

y∈Y
(F
−1
(y) ∩ K)

.
Therefore an element ¯z ∈ K exists such that ¯z /∈ F

−1
(y) ∩ K for every y ∈ Y , i.e.
F(¯z) = /0.
Proof of Theorem 1.2.4. It is not hard to see that all the assumptions (i), (ii) and
(c) of Theorem 1.2.1 are fulfilled with G : Y ⇒ Z defined by G(y) = O
c
y
in the
place of F. By this theorem we have,
/0 = K ∩ T (X) ∩

y∈Y
G(y)
1.2 Existence theorems in GFC-spaces 11
⊂ K ∩ T (X)∩

Z\

y∈Y
(O
y
∩ K)

= K ∩ T (X)∩

Z\

y∈Y
(F
−1

(y) ∩ K)

.
Consequently, there is ¯z ∈ K such that ¯z /∈ F
−1
(y) for each y ∈ Y , which means
that F(¯z) = /0. 
The above theorems are very close to each other, but they are not completely
equivalent. The coincidence point and maximal-element theorems are deduced
from intersection theorems. To underline a possible equivalence, we establish a
maximal element theorem and show the equivalence between the three theorems
as follows.
Theorem 1.2.5 (Maximal elements) Let (X,Y,{ϕ
N
}) be a GFC-space, Z a topo-
logical space, T ∈ KKM(X,Y,Z) and S : Y ⇒ X a multivalued mapping such that
Y is an S-subset of itself. Assume that Ω : Z ⇒ Y satisfies the following conditions
(i) Ω
−1
is transfer compactly open-valued;
(ii) for each (y,z) ∈ Y × T (S(y)), y /∈ GFC
S
(Ω(z));
(iii) for each compact subset D ⊂ X , T (D) is compact;
(iv) there is a nonempty compact subset K of Z such that for each N ∈ Y , there
is an S-subset L
N
of Y containing N such that S(L
N
) is compact and for each

z ∈ T (S(L
N
)) \ K, there exists y ∈ L
N
such that z ∈ cint(GFC
S
◦ Ω )
−1
(y).
Then, there is ˆz ∈ Z such that Ω(ˆz) = /0.
Theorem 1.2.6 (Coincidence points) Let (X ,Y,{ϕ
N
}) be a GFC-space, Z a topo-
logical space, T ∈ KKM(X,Y,Z) and S : Y ⇒ X a multivalued mapping such
that Y is an S-subset of itself. For multivalued mappings H and Ω from Z into Y ,
impose the following conditions
(i) H has nonempty-values and H
−1
is transfer compactly open-valued;
(ii) GFC
S
(H(z)) ⊂ Ω (z) for all z ∈ Z;
(iii) for each compact subset D ⊂ X , T (D) is compact;
(iv) there is a nonempty compact subset K of Z such that for each N ∈ Y , there
is an S-subset L
N
of Y containing N such that S(L
N
) is compact and for each
z ∈ T (S(L

N
))\K, there exists y ∈ L
N
with z ∈ cint(GFC
S
◦ H)
−1
(y).
Then, a point ( ˆx, ˆy, ˆz) ∈ X ×Y ×Z exists such that ˆx ∈ S(ˆy), ˆz ∈ T ( ˆx) and ˆy ∈ Ω(ˆz).
Theorem 1.2.7 (Nonempty intersection) Let (X,Y,{ϕ
N
}) be a GFC-space, Z a
topological space, T ∈ KKM(X,Y,Z) and S : Y ⇒ X a multivalued mapping such
that Y is an S-subset of itself. Assume P,Q : Y ⇒ Z satisfy the following conditions
(i) P is transfer compactly closed-valued;
1.2 Existence theorems in GFC-spaces 12
(ii) for all y ∈ Y , T (S(y)) ⊂ Q(y);
(iii) for all N ∈ Y , Q(GFC
S
(N)) ⊂ P(N);
(iv) for each compact subset D ⊂ X, T(D) is compact;
(v) there is a nonempty compact subset K of Z such that, for each N ∈ Y, there is
an S-subset L
N
of Y containing N such that S(L
N
) is compact and T (S(L
N
))∩


y∈L
N
cclP(y) ⊂ K.
Then,

y∈Y
P(y) = /0.
Remark 1.2.2 Theorem 1.2.5 includes the following known theorems: Theorem
3.1 of [95] for FC-spaces, Theorem 3.1 of [23], Theorem 6 of [62], Theorem 3
of [63] and Theorem 3.1 of [18] for G-convex spaces. Theorem 1.2.6 generalizes
theorem 3.1 of [40], Theorems 2.5-2.6 of [65], Theorem 3.5 of [67] for convex
spaces. If X = Y and S = I, Theorem 1.2.6 implies Theorem 3.1 of [36]. Theo-
rem 1.2.7 generalizes Theorem 3.3 of [66], Theorems 3.2-3.3 of [67] for convex
spaces. If X = Y and S = I, Theorem 1.2.7 implies Theorems 3.2-3.3 of [36].
The following example illustrates Theorem 1.2.5, showing in particular that
its assumptions are relaxed and not hard to be checked.
Example 1.2.1 Let X = [−2,2], Y = [−2,0[ and, for all N = {y
0
,y
1
, ,y
n
} ∈ Y ,
ϕ
N
(e) =
∑
n
i=0
λ

i
y
i
, where e =
∑
n
i=0
λ
i
e
i
∈ ∆
|N|
, e
i
being the ith unit vector of R
n+1
.
Then, (X ,Y,{ϕ
N
}) is a GFC-space. Let Z = [0,2] and S : Y ⇒ X, T : X ⇒ Z and
Ω : Z ⇒ Y be defined by S(y) = {y}, T (x) = [0, |x|] and Ω (z) = ]−z,0[. Then, it is
not hard to see that T ∈ KKM(X,Y,Z) and, for each z ∈ Z, Ω(z) is an S
GFC
-subset
of Y , i.e. GFC
S
(Ω(z)) = Ω (z). It is also clear that, for all (y,z) ∈ Y ×T (S(y)) =
Y × [0,|y|], y /∈ ] − z,0[ = GFC
S

(Ω(z)). One has Ω
−1
(−2) = /0 and Ω
−1
(y) =
{z ∈ Z| −z < y < 0} = ]−y,2] for y ∈ ]−2,0[. Then, Ω
−1
(y) is open in Z. Hence,
Ω
−1
is transfer compactly open-valued. Thus (i) and (ii) of Theorem 1.2.5 are
satisfied. (iii) is obviously fulfilled. (iv) is checked with K = Z and L
N
= Y for
each N ∈ Y . Theorem 1.2.5 implies the existence of

z ∈ Z such that Ω (

z) = /0.
One easily sees directly that

z = 0 is a maximal-element of Ω.
Proof. We first prove Theorem 1.2.5.
Proof of Theorem 1.2.5. Define F : Y ⇒ Z by F(y) = Z \ (GFC
S
◦ Ω )
−1
(y) for
y ∈ Y . By Lemma 1.1.2 and the transfer compact open-valuedness of Ω
−1

, F
is transfer compactly closed-valued. We prove that F is T-KKM. Take arbitrary
N ∈ Y , M ⊂ N and suppose that T(ϕ
N
(∆
M
)) ⊂

y

∈M
F(y

) is not satisfied.
Then, there are x ∈ ϕ
N
(∆
M
) and z ∈ T (x) such that z /∈ F(y

) for every y

∈ M, i.e.,
z ∈ (GFC
S
◦Ω)
−1
(y

) for every y


∈ M. Hence y

∈ GFC
S
(Ω(z)) for every y

∈ M.
Since GFC
S
(Ω(z)) is an S-subset of Y , ϕ
N
(∆
M
) ⊂ S

GFC
S
(Ω(z))

. Therefore,
y ∈ GFC
S
(Ω(z)) exists such that x ∈ S(y) and hence z ∈ T(S(y)). Thus, there
is (y,z) ∈ Y × T (S(y)) such that y ∈ GFC
S
(Ω(z)), which contradicts assumption
(ii).
1.2 Existence theorems in GFC-spaces 13
Now suppose ad absurdum that, for all z ∈ Z, Ω(z) = /0. Then, for all z ∈ K,

(GFC
S
◦ Ω)(z) = /0. By the transfer compact open-valuedness of (GFC
S
◦ Ω)
−1
and the compactness of K, there is N ∈ Y  such that
K =

y∈Y

(GFC
S
◦ Ω )
−1
(y) ∩ K

=

y∈Y

cint(GFC
S
◦ Ω )
−1
(y) ∩ K

=

y∈N


cint(GFC
S
◦ Ω )
−1
(y) ∩ K

⊂

y∈L
N
cint(GFC
S
◦ Ω )
−1
(y)
=

y∈L
N

Z \ cclF(y)

= Z \

y∈L
N
cclF(y),
where L
N

is given in assumption (iv). Since, for each z ∈ T (S(L
N
))\K, there exists
y ∈ L
N
with z ∈ cint(GFC
S
◦ Ω )
−1
(y), we have
T (S(L
N
)) \ K ⊂

y∈L
N
cint(GFC
S
◦ Ω )
−1
(y)
= Z \

y∈L
N
cclF(y).
Therefore,
T (S(L
N
)) =


K ∩ T (S(L
N
))

∪

T (S(L
N
)) \ K

⊂ Z \

y∈L
N
cclF(y). (1.2.2)
Consider GFC-space (S(L
N
),L
N
,ϕ
N
) and mappings
ˆ
T = T |
S(L
N
)
,
ˆ

F : L
N
⇒ Z
by
ˆ
F(y) = cclF(y) ∩ T (S(L
N
)). As F is T -KKM, by Lemma 1.1.3 we see that
T |
S(L
N
)
∈ KKM

S(L
N
),L
N
, T (S(L
N
))

and
ˆ
F is T |
S(L
N
)
-KKM. Hence the family
{cl

ˆ
F(y) : y ∈ L
N
} = {cclF(y) ∩ T (S(L
N
)) : y ∈ L
N
} has the finite intersection
property. Since this is a family of closed subsets of compact set
T (S(L
N
)), one
has

y∈L
N

cclF(y) ∩ T (S(L
N
))

=

y∈L
N
ˆ
F(y) = /0.
It follows that there is ¯z ∈ T (S(L
N
)) such that ¯z ∈


y∈L
N
cclF(y), which contra-
dicts (1.2.2).
Theorem 1.2.5 implies Theorem 1.2.6. Suppose the conclusion of Theorem 1.2.6
is false. Then, for all (y,z) ∈ Y × T(S(y)), y /∈ Ω(z). By (ii), y /∈ GFC
S
(H(z)).
Thus, the assumptions of Theorem 1.2.5 are satisfied for H. Hence, we have ˆz ∈ K
such that H(ˆz) = /0, contradicting (i).
Theorem 1.2.6 implies Theorem 1.2.7. Define H,Ω : Z ⇒ Y by H(z) = Y \P
−1
(z)
and Ω (z) = Y \ Q
−1
(z). We verify the assumptions of Theorem 1.2.6. For y ∈ Y,
1.2 Existence theorems in GFC-spaces 14
H
−1
(y) = {z ∈ Z : y ∈ Y \ P
−1
(z)} = {z ∈ Z : z /∈ P(y)} = Z \ P(y). By (i), H
−1
is transfer compactly open-valued as required in (i) of Theorem 1.2.6.
To check (ii) of Theorem 1.2.6 suppose to the contrary the existence of
z ∈ Z and y ∈ GFC
S
(H(z)) such that y /∈ Ω (z) = Y \ Q
−1

(z), i.e. z ∈ Q(y).
By Lemma 1.1.2(c), there exists N ∈ H(z) with y ∈ GFC
S
(N). Then, by
(iii), z ∈ Q(y) ⊂ Q(GFC
S
(N)) ⊂ P(N). Hence, ¯y ∈ N ⊂ H(z) exists such that
z ∈ P( ¯y) = Z \ H
−1
( ¯y), i.e. ¯y /∈ H(z), a contradiction. (iii) of Theorem 1.2.6 is
assumption (iv).
To see (iv) of Theorem 1.2.6, for each N ∈ Y , by (v) one has an S-subset L
N
of Y containing N such that S(L
N
) is compact and T (S(L
N
))∩

y∈L
N
cclP(y) ⊂ K.
This means that for each z ∈ T (S(L
N
))\K, there is y ∈ L
N
such that z ∈ Z \cclP(y)
= cint(Z \ P(y)) = cintH
−1
(y) ⊂ cint(GFC

S
◦ H)
−1
(y) as required.
Now, by (ii), for all (x,y,z) ∈ X ×Y × Z with x ∈ S(y) and z ∈ T (x), one has
z ∈ Q(y) = Z \ Ω
−1
(y), i.e. y /∈ Ω(z). Then, the conclusion of Theorem 1.2.6
is not true for H and Ω. Thus, assumption (i) of Theorem 1.2.6 must be vio-
lated. Consequently, there exists ˆz ∈ Z such that /0 = H(ˆz) = Y \ P
−1
(ˆz). Hence
P
−1
(ˆz) = Y , i.e., ˆz ∈

y∈Y
P(y).
Theorem 1.2.7 implies Theorem 1.2.5. Define P,Q : Y ⇒ Z by P(y) = Z \ Ω
−1
(y)
and Q(y) = Z \(GFC
S
◦Ω)
−1
(y). We check the assumptions of Theorem 1.2.7 for
P and Q. By assumptions (i), (ii) of Theorem 1.2.5, assumption (i), (iv) of Theo-
rem 1.2.7 are clearly fulfilled. For N ∈ Y , (GFC
S
◦Ω)

−1
(GFC
S
(N)) ⊃ Ω
−1
(N).
Hence Q(GFC
S
(N)) = Z \(GFC
S
◦Ω)
−1
(GFC
S
(N)) ⊂ Z \Ω
−1
(N) = P(N), i.e.,
assumption (iii) of Theorem 1.2.7 is satisfied. For (ii) of Theorem 1.2.7, for all y ∈
Y and z ∈ T (S(y)), from (ii) of Theorem 1.2.5 we see that z /∈ (GFC
S
◦ Ω )
−1
(y).
Then, z ∈ Z \ (GFC
S
◦ Ω )
−1
(y) = Q(y). This means that T (S(y)) ⊂ Q(y). To see
(v) of Theorem 1.2.7, by (iv) of Theorem 1.2.5 we have a nonempty compact
subset K ⊂ Z and for each N ∈ Y , one has an S-subset L

N
of Y containing
N such that S(L
N
) is compact. Take any T(S(L
N
)) ∩

y∈L
N
cclP(y). If z /∈ K,
then z ∈ T (S(L
N
)) \ K and by (iv) of Theorem 1.2.5, there is y ∈ L
N
such that
z ∈ cint(GFC
S
◦ Ω)
−1
(y), i.e., z /∈ Z \ cint(GFC
S
◦ Ω)
−1
(y) ⊂ Z \ cintΩ
−1
(y)
= cclP(y) which is a contraction. Thus, by Theorem 1.2.7,

y∈Y

P(y) = /0. Hence,
there is ˆz ∈ Z such that ˆz /∈ Ω
−1
(y) for every y ∈ Y, i.e. Ω(ˆz) = /0. 
The following consequence is an extension of Theorem 1 in [11].
Corollary 1.2.1 Let (X,Y,{ϕ
N
}) be a GFC-space,

Z be a nonempty set, S : Y ⇒
X, Ω : X ⇒ Y, F : X ⇒

Z and G : Y ⇒

Z. Assume that
(i) G(Y ) =

Z and F
−1
is onto and transfer compactly open-valued;
(ii) for all x ∈ X, Ω(x) is an S
GFC
-subset of Y ;
(iii) for each x ∈ X,

y ∈ Y : F(x) ∩ G(y) = /0

⊂ Ω(x);
1.2 Existence theorems in GFC-spaces 15
(iv) there is a nonempty compact subset A of X such that for each N ∈ Y , there is

an S-subset L
N
of Y containing N such that S(L
N
) is compact and S(L
N
))\A ⊂

y∈L
N
cint

x ∈ X : F(x) ∩ G(y) = /0

.
Then, a point ( ˆx, ˆy) ∈ X ×Y exists such that ˆx ∈ S( ˆy) and ˆy ∈ Ω ( ˆx).
Proof. Define H : X ⇒ Y by H(x) = {y ∈ Y : F(x) ∩ G(y) = /0}. We check the
assumptions of Theorem 1.2.6 for S, T = I and Ω (with Z = X). Let

K ⊂ X be
any nonempty compact subset, y ∈ Y and x ∈ H
−1
(y) ∩

K. Then, there is z ∈
F(x) ∩ G(y) such that x ∈ F
−1
(z) ∩

K. By (i), there exists z


∈

Z such that
x ∈ int

K
(F
−1
(z

) ∩

K)
⊂

y∈Y

z∈G(y)
int

K
(F
−1
(z) ∩

K)
⊂

y∈Y

int

K


z∈G(y)
(F
−1
(z) ∩

K)

⊂

y∈Y
int

K
(H
−1
(y) ∩

K).
It follows that there is y

∈ Y such that x ∈ int

K
(H
−1

(y

) ∩

K), i.e. H
−1
is transfer
compactly open-valued. By (ii) and (iii), GFC
S
(H(x)) ⊂ Ω (x), i.e. assumption
(ii) of Theorem 1.2.6 is fulfilled. By (iv) we have (iv) of Theorem 1.2.6. Thus,
applying this theorem we are done. 
From the Theorems 1.2.5-1.2.7 we derive equivalent forms of a general al-
ternative theorem. Alternative theorems of this type have been rather rarely
studied but they are also important. For H : X ⇒ Y we define H
c
: X ⇒ Y by
H
c
(x) = Y \ H(x) for x ∈ X. The mentioned forms of a general alternative theo-
rem are stated as follows.
Theorem 1.2.8 Let (X,Y,{ϕ
N
}) be a GFC-space,

Z be a nonempty set, S : Y ⇒ X ,
F : X ⇒

Z and G : Y ⇒


Z. Assume that
(i) F
−1
is transfer compactly open-valued;
(ii) for all x ∈ X,

y ∈ Y : F(x) ⊂ G
c
(y)

is an S
GFC
-subset of Y ;
(iii) for each (y,x) ∈ grS, F(x) ⊂ G
c
(y);
(iv) there is a nonempty compact subset A of X such that for each N ∈ Y , there is
an S-subset L
N
of Y containing N such that S(L
N
) is compact and S(L
N
))\A ⊂

y∈L
N
cint

x ∈ X : F(x) ⊂ G

c
(y)

.
Then, at least one of the following assertions holds:
(a) there exists ¯x ∈ X such that F(¯x) = /0;
(b) there exists ¯z ∈

Z such that G
−1
(¯z) = /0.
Theorem 1.2.9 Let (X,Y,{ϕ
N
}) be a GFC-space,

Z be a nonempty set, S : Y ⇒ X ,
P : X ⇒

Z and Q : Y ⇒

Z, impose that
(i) P
−1
is transfer compactly closed-valued;
(ii) for all x ∈ X,

y ∈ Y : Q
c
(y) ⊂ P(x)


is an S
GFC
-subset of Y ;
1.2 Existence theorems in GFC-spaces 16
(iii) for each (x,y) ∈ grS, Q
c
(y) ⊂ P(x);
(iv) there is a nonempty compact subset A of X such that for each N ∈ Y , there is
an S-subset L
N
of Y containing N such that S(L
N
) is compact and S(L
N
))\A ⊂

y∈L
N
cint

x ∈ X : Q
c
(y) ⊂ P(x)

.
Then, at least one of the following assertions holds:
(a)

z∈


Z
P
−1
(z) = /0
(b)

y∈Y
Q(y) = /0.
Theorem 1.2.10 Let (X,Y,{ϕ
N
}) be a GFC-space,

Z be a nonempty set, S : Y ⇒
X, F : X ⇒

Z and Q : Y ⇒

Z, assume that
(i) F
−1
is transfer compactly open-valued;
(ii) for all x ∈ X,

y ∈ Y : F(x) ⊂ Q(y)

is an S
GFC
-subset of Y ;
(iii) for each (x,y) ∈ grS, F(x) ⊂ Q(y);
(iv) there is a nonempty compact subset A of X such that for each N ∈ Y , there is

an S-subset L
N
of Y containing N such that S(L
N
) is compact and S(L
N
))\A ⊂

y∈L
N
cint

x ∈ X : F(x) ⊂ Q(y)

.
Then, at least one of the following assertions holds:
(a) there exists

x ∈ X such that F(

x) = /0;
(b)

y∈Y
Q(y) = /0.
Theorem 1.2.11 Let (X,Y,{ϕ
N
}) be a GFC-space,

Z be a nonempty set, S : Y ⇒

X, P : X ⇒

Z and G : Y ⇒

Z, impose that
(i) P
−1
is transfer compactly closed-valued;
(ii) for all x ∈ X,

y ∈ Y : G(y) ⊂ P(x)

is an S
GFC
-subset of Y ;
(iii) for each (x,y) ∈ grS, G(y) ⊂ P(x);
(iv) there is a nonempty compact subset A of X such that for each N ∈ Y , there is
an S-subset L
N
of Y containing N such that S(L
N
) is compact and S(L
N
))\A ⊂

y∈L
N
cint

x ∈ X : G(y) ⊂ P(x)


.
Then, at least one of the following assertions holds:
(a)

z∈

Z
P
−1
(z) = /0;
(b) there exists ¯z ∈

Z such that G
−1
(¯z) = /0.
Remark 1.2.3 If X = Y and S = I, Theorem 1.2.8 implies Theorem 3 of [11]
and different to Theorem 7 of [10].
Proof. Theorem 1.2.5 implies Theorem 1.2.8. Suppose to the contrary that, for
all (x,z) ∈ X ×

Z, F(x) = /0 and G
−1
(z) = /0. Then G(Y ) =

Z. Define Ω : X ⇒ Y by
Ω(x) =

y ∈ Y : F(x) ⊂ G
c

(y)

. We check the assumptions of Theorem 1.2.5 for
Z = X and T = I. By (iv) assumptions (iii) and (iv) of Theorem 1.2.5 are obvious.
(ii) and (iii) imply assumption (ii) of Theorem 1.2.5. Arguing for Ω similarly as
for H in the proof of Corollary 1.2.1 we see that Ω
−1
is transfer compactly open-
valued as required in assumption (i) of Theorem 1.2.5. Applying this theorem
1.2 Existence theorems in GFC-spaces 17
we have ¯x ∈ X such that Ω(¯x) = /0. Then, F( ¯x) ∩ G(y) = /0 for all y ∈ Y . Hence,
F( ¯x) ∩

Z = /0, i.e. F( ¯x) = /0, a contradiction.
Theorem 1.2.8 implies Theorem 1.2.9. Setting F = P
c
, G = Q
c
and applying The-
orem 1.2.8 to F and G we are done.
Theorem 1.2.9 implies Theorem 1.2.10. Make use of Theorem 1.2.9 for the given
Q and P = F
c
.
Theorem 1.2.10 implies Theorem 1.2.11. Employ Theorem 1.2.10 for F = P
c
and
Q = G
c
.

Theorem 1.2.11 implies Theorem 1.2.8. Set P = F
c
and use Theorem 1.2.11. 
Next, we establish KKM type theorems, which encompass a large number of
known KKM type theorems.
Theorem 1.2.12 Let (X,Y,Φ) be a GFC-space, Z be a topological space, S :
Y ⇒ X and F : Y ⇒ Z be set-valued mappings and T ∈ KKM(X,Y,Z) such that
Y is an S-subset of itself. Let the following conditions hold
(i) T(S(Y )) is a compact subset (of Z);
(ii) F is T-KKM and transfer compactly closed-valued.
Then, T (S(Y))∩

y∈Y
F(y) = /0.
Proof. We define a new set-valued mapping

F : Y ⇒ T (S(Y )) by, for y ∈ Y ,

F(y) = T (S(Y))∩cclF(y). Then

F has clearly closed values in T (S(Y )). We claim
that

F is T -KKM. Indeed, for N ∈ Y  and M ⊂ N, as F is T-KKM one has
T (ϕ
N
(∆
M
)) ⊂


y∈M
F(y). Since Y is an S-subset of Y, T (ϕ
N
(∆
M
)) ⊂ T (S(Y )).
Therefore
T (ϕ
N
(∆
M
)) ⊂ T (S(Y )) ∩

y∈M
F(y) =

y∈M

T (S(Y))∩ F(y)

⊂

y∈M

F(y).
As T ∈ KKM (X ,Y,Z), the family {

F(y) : y ∈ Y } = {

F(y) : y ∈ Y } has the fi-

nite intersection property. Since this is a family of closed subsets of compact set
T (S(Y)), by Lemma 1.1.1 one has
T (S(Y))∩

y∈Y
F(y) =

y∈Y

T (S(Y))∩ F(y)

=

y∈Y

T (S(Y))∩ cclF(y)

=

y∈Y

F(y)
= /0.

1.2 Existence theorems in GFC-spaces 18
Remark 1.2.4 Theorem 1.2.12 is proved based on the finite intersection prop-
erty of compact sets. To see advantages of our Theorem 1.2.12, we discuss its
particular cases. Let (X,Φ) be an FC-space, Z be a topological space, Y be a
set, F : Y ⇒ Z, s : Y → X and T ∈ KKM(X,Y,Z) be given. Following [25],
F is called an s-KKM wrt T if for each N = {y

0
,y
1
, ,y
n
} ∈ Y and each
M = {y
i
0
,y
i
1
, ,y
i
k
} ⊂ N, T (ϕ
s(N)
(∆
M
)) ⊂

k
j=0
F(y
i
j
), where ϕ
s(N)
: ∆
|N|

→ X
is the mapping of the family Φ, corresponding to {s(y
0
),s(y
1
), ,s(y
n
)} in the
definition of an FC-space [24]. We define a GFC-space (X,Y,Φ) as follows: for
N ∈ Y , as the corresponding mapping from Φ we take ϕ
s(N)
. Then an s-KKM
mapping wrt T acting on the FC-space (X,Φ) becomes a T-KKM mapping acting
on the GFC-space (X,Y,Φ), according to Definition 1.1.3. Therefore, Theorem
3.2 of [25] is a special case of Theorem 1.2.12, where S ≡ s. If in addition Y = X,
S ≡ s ≡ I (the identity map) and T is a compact mapping, our Theorem 1.2.12
collapses to Theorem 3.3 of [25] and Theorem 3.2 of [31]. If a set-valued map-
ping is compactly closed-valued then it is also transfer compactly closed-valued.
So Theorem 1.2.12 includes properly Theorem 3.1 of [25] and Theorem 3.1 of
[31]. When (X,Y,Φ) = (X,Y,Γ ) is a G-convex space [79] and S ≡ I, our Theo-
rem 1.2.12 implies Theorem 1 of [61], where the assumption corresponding to our
condition (ii) is more stringent. Assume that X is a convex space, co(·) is the usual
convex hull operator in this convex space. In [17] F :Y ⇒ Z is called a generalized
S-KKM mapping wrt T if, for any N = {y
0
,y
1
, ,y
n
} ∈ Y , T (coS(N)) ⊂ F(N).

We define a GFC-space (X,Y,{ϕ
N
}) as follows. Take s : Y → X which is any fixed
selection of S and, for any N = {y
0
,y
1
, ,y
n
} ∈ Y , take ϕ
N
: ∆
|N|
→ X by the
definition ϕ
N
(e) =
∑
n
i=0
λ
i
s(y
i
) for all e =
∑
n
i=0
λ
i

e
i
∈ ∆
|N|
. Then (X,Y,{ϕ
N
}) is
clearly a GFC-space. It is equally obvious that a set-valued mapping F is S-KKM
wrt T only if F is T-KKM by our Definition 1.1.3. Consequently Theorem 4.3 of
[17] is a true special case of our Theorem 1.2.12 with S(·) replaced by co(S(·)).
Using a coercivity condition to replace the compactness condition (i) in The-
orem 1.2.12, we obtain the following result.
Theorem 1.2.13 Let (X,Y,Φ) be a GFC-space, Z be a topological space, S :
Y ⇒ X and F : Y ⇒ Z be set-valued mappings and T ∈ KKM(X,Y,Z). Assume
that
(i
1
) for each compact subset D ⊂ X , T (D) is compact;
(i
2
) there is a compact subset K of Z such that for each N ∈ Y , there is an S-
subset L
N
of Y, containing N with either S(L
N
) or S(L
N
) being compact and
T (S(L
N

)) ∩

y∈L
N
cclF(y) ⊂ K;
(ii) F is T-KKM and transfer compactly closed-valued.
Then, T (S(Y))∩

y∈Y
F(y) = /0.
Proof. (a) First, assume that F is compactly closed-valued. Suppose ab absurdo
that
1.2 Existence theorems in GFC-spaces 19
Z =

T (S(Y))∩

y∈Y
F(y)

c
= T (S(Y))
c
∪

y∈Y
F(y)
c
.
Then, the compact set K (in (i

2
)) has an open covering K ∩ T (S(Y))
c
, {K ∩
F(y)
c
}
y∈Y
and hence there is N ∈ Y such that
K ⊂ T (S(Y))
c
∪

y∈N
F(y)
c
⊂ T (S(L
N
))
c
∪

y∈N
F(y)
c
.
By assumption (i
2
), K
c

⊂ T (S(L
N
))
c
∪

y∈L
N
F(y)
c
. Therefore,
Z = K ∪ K
c
⊂ T (S(L
N
))
c
∪

y∈L
N
F(y)
c
.
So T (S(L
N
)) ∩

y∈L
N

F(y) = /0. We consider now the first case of assumption
(i
2
). We apply Theorem 1.2.12 to GFC-space (S(L
N
),L
N
,Φ) with Z, S, T, F re-
placed by T(S(L
N
)), S|
L
N
, T |
S(L
N
)
and F
1
: L
N
⇒ T(S(L
N
)), where F
1
defined
by F
1
(y) = T (S(L
N

)) ∩ F(y) for all y ∈ L
N
. We see that L
N
is an S|
L
N
-subset of
itself. Moreover, cl
T (S(L
N
))
T |
S(L
N
)
(S|
L
N
(L
N
)) is compact by (i
1
) and (i
2
), where
cl
T (S(L
N
))

stands for the closure in T (S(L
N
)). To check the remaining assump-
tion (ii) of Theorem 1.2.12, we observe that F
1
has compactly closed-values in
T (S(L
N
)) and T |
S(L
N
)
∈ KKM

S(L
N
),L
N
,T(S(L
N
))

(by Lemma 1.1.3). To see
that F
1
is T |
S(L
N
)
-KKM let N

∗
∈ L
N
 and M
∗
⊂ N
∗
. Then, since L
N
is an S|
L
N
-
subset of L
N
,
T |
S(L
N
)
(ϕ
N
∗
(∆
M
∗
)) ⊂ T (ϕ
N
∗
(∆

M
∗
))⊂ T (S(L
N
)) ∩

y∈M
∗
F(y) =

y∈M
∗
F
1
(y),
i.e., F
1
is T |
S(L
N
)
-KKM. Making use of Theorem 1.2.12 yields
/0 = cl
T (S(L
N
))

T |
S(L
N

)
(S|
L
N
(L
N
))

∩

y∈L
N
F
1
(y) ⊂ T (S(L
N
)) ∩

y∈L
N
F(y),
a contradiction.
Now consider the second case of (i
2
). By (i
1
), T(S(L
N
)) is compact. Then its
closed subset T (S(L

N
)) is compact as well. Therefore we can apply Theorem
1.2.12 as for the first case of (i
2
).
(b) If F is transfer compactly closed-valued, we consider

F defined by

F(y) =
cclF(y) and apply part (a) together with Lemma 1.1.1. 
Remark 1.2.5 Since our Definition 1.1.3 of a T-KKM mapping includes many
definitions of KKM type mappings as discussed after Theorem 1.2.12, it is easy
to see that Theorem 1.2.13 has true special cases as follows. When applied to the
particular case, where X =Y and S ≡ I, Theorem 1.2.13 improves Theorem 3.3 of
[31]. If (X,Y,Φ) = (X,Y,Γ ) is a G-convex space and S ≡ I then Theorem 1.2.13
implies Theorem 3 of [61] and Theorem 5.1 of [19].
For S-KKM mappings with respect to T and the class S-KKM(X,Y,Z) defined
in [17] we have the following consequence which is Theorem 5.1 of [17].