1 Introduction and statements of the results
In the sequel, H is a real Hilbert space, with
$\mathrm {dim}(H)\geq 2$
,
$\Omega $
is an open convex subset of H and
$\Phi :\Omega \to H$
is a given operator.
We say that
$\Phi $
has a Lipschitzian derivative if
$\Phi $
is Fréchet differentiable and the derivative of
$\Phi $
, denoted by
$\Phi '$
, is Lipschitzian, i.e., one has

where
$\mathcal {L}(H)$
is the space of all continuous linear operators from H into itself endowed with the norm

For a generic set
$A\subseteq H$
, we denote by
$\overline {\mathrm {conv}}(A)$
the closed convex hull of A, i.e., the smallest closed convex set containing A.
We are interested in the existence of zeros for
$\Phi $
.
To shorten the statements, we now introduce the following notations. Namely, for each convex set
$X\subseteq H$
, we set

where
$\Gamma _X$
denotes the family of all convex functions
$\psi :X\to \mathbf {R}$
.
We have
Proposition 1.1 Let
$X\subseteq H$
be a convex set with more than one point. Then,
$\delta _X>0$
.
We will get Proposition 1.1 as a by-product of Theorem 1.1 below. In [Reference Zalinescu2], C. Zalinescu provided a proof of Proposition 1.1 based on quite hard arguments of convex analysis.
Moreover, for each subset V of
$\Omega $
, we denote by
$\mathcal {A}_V$
the family of all convex sets
$X\subseteq V$
such that

The aim of this very short note is to establish the following result
Theorem 1.1 Assume that
$\Phi $
is a
$C^1$
operator with Lipschitzian derivative and let V be a subset of
$\Omega $
such that
$\Phi (V)$
is closed. Then, the following assertions are equivalent:
(1)
$0\in \Phi (V)$
;
(2)
$\inf _{X\in \mathcal {A}_{V}}\delta _X=0$
.
More precisely, the key result of this note is Theorem 1.2 below. Theorem 1.1 then follows as a by-product of it.
Theorem 1.2 Assume that
$\Phi $
is a
$C^1$
operator such that
$\Phi '$
is Lipschitzian, with Lipschitz constant L. Let V be a subset of
$\Omega $
such that

Then, for each convex set
$X\subset V$
such that
$\delta _X<{{2\eta }\over {L}}$
, one has

We will prove Theorem 1.2 and Theorem 1.1 as well in the next section. The main tool that we will use is the classical Kneser minimax theorem [Reference Kneser1]. For the reader convenience, we recall its statement
Theorem 1.A Let E be a vector space, F a locally convex topological vector space,
$X\subseteq E$
a convex set and
$Y\subset F$
a compact convex set. Moreover, let
$h:X\times Y\to \mathbf {R}$
be a function which is convex in X and upper semicontinuous and concave in Y. Then, one has

The interest of Theorem 1.1 resides mainly in its full novelty which is, in turn, due to the particular proof approach based on Theorem 1.A. Actually, we are not aware of known results with which Theorem 1.1 can be compared even in a vague manner.
In particular, it seems that the number
$\delta _X$
is here introduced for the first time. We think that it is worth studying in depth. For instance, it would be useful to provide an explicit positive lower bound for it. Indeed, the current proofs of Proposition 1.1 (ours and that in [Reference Zalinescu2]) are highly indirect.
Another interesting feature of Theorem 1.1 resides in the derivative of
$\Phi $
: not only it does not appear in the conclusion at all, but also it needs to be Lipschitzian. In this connection, the following example is enlightening.
Example 1.1 Let
$h:\mathbf {R}\to \mathbf {R}$
be any
$C^1$
function with the following property:
$[-\pi ,\pi ]\subseteq h(\mathbf {R})$
and there exist two sequences in
$(0,+\infty )$
$\{\alpha _n\}, \{\beta _n\}$
such that





for all
$n\in \mathbf {N}$
. For instance, one can take:
$h(x)=\pi \sin (2\pi x^2)$
,
$\alpha _n=\sqrt {n}$
,
$\beta _n=\sqrt {n+{{3}\over {4}}}$
. Then, consider the function
$\Phi :\mathbf {R}^2\to \mathbf {R}^2$
defined by

for all
$(x,y)\in \mathbf {R}^2$
. So,
$\Phi $
is
$C^1$
and

In connection with Theorem 1.1, take
$\Omega =V=\mathbf {R}^2$
. Now, fix
$\epsilon>0$
and
$n\in \mathbf {N}$
so that
$\beta _n^2-\alpha _n^2<\epsilon $
. Set

So, X is convex and the points
$(0,1)$
,
$(0,-1)$
belong to
$\Phi (X)$
. Consequently

Therefore,
$X\in \mathcal {A}_V$
. Moreover, we have

This shows that

However,
$\Phi (V)$
is closed and
$0\not \in \Phi (V)$
. So, the implication
$(2)\to (1)$
in Theorem 1.1 does not hold.
2 Proofs
Proof of Theorem 1.2
Fix any convex set
$X\subset V$
and any convex function
$\psi :X\to \mathbf {R}$
satisfying

Of course, pairs
$(X,\psi )$
of this type do exist: for instance, this is the case when X is a singleton. Set

and consider the functions
$\varphi :X\to \mathbf {R}$
,
$f:\Omega \times Y\to \mathbf {R}$
and
$g:X\times Y\to \mathbf {R}$
defined by


and

We claim that

Arguing by contradiction, assume that

We then would have

For each
$y\in Y$
, the function
$f(\cdot ,y)$
is
$C^1$
and its derivative (denoted by
$f^{\prime }_x(\cdot ,y)$
) is given by

for all
$x\in \Omega $
,
$u\in H$
. Also, for each
$v, w\in \Omega $
, we have

Taking (2.4) into account, we also have


In other words, the derivative of the function
${{L}\over {2}}\|\cdot \|^2+f(\cdot ,y)$
is monotone in
$\Omega $
and so the function is convex there ([Reference Zeidler3], Proposition 42.6). This implies that
$g(\cdot ,y)$
is convex in X since
$\psi $
is so. Furthermore, Y is weakly compact and, for each
$x\in X$
, the function
$g(x,\cdot )$
is weakly continuous, being affine and continuous. Hence, applying Theorem 1.A, we would have

contradicting (2.3). So, (2.2) does hold. Notice that

Therefore, from (2.2) we infer that

and hence, in view of (2.1), taking into account that
$\eta \leq \inf _{x\in X}\|\Phi (x)\|$
, we have

Because of this inequality, we can fix
$\gamma>0$
and
$\tilde y\in Y$
so that

Thus, if we set

we have

since C is closed and convex, while
$0\not \in C$
and the proof is complete.
Proof of Theorem 1.1
The implication
$(1)\to (2)$
is immediate. Indeed, if there exists
$\tilde x\in V$
such that
$\Phi (\tilde x)=0$
, then the singleton
$\{\tilde x\}$
belongs to the family
$\mathcal {A}_{V}$
and
$\delta _{\{\tilde x\}}=0$
, and so
$(2)$
holds. Viceversa, assume that
$(2)$
holds. We have to prove
$(1)$
. Arguing by contradiction, suppose that
$0\not \in \Phi (V)$
. Since
$\Phi (V)$
is closed, this implies that
$\inf _{x\in V}\|\Phi (x)\|>0$
. By assumption, there is a convex set
$X\subset V$
such that

and

contradicting Theorem 1.2.
From the proof of Theorem 1.1, it clearly follows the following.
Theorem 2.1 Assume that
$\Phi $
is a
$C^1$
operator with Lipschitzian derivative and let V be a subset of
$\Omega $
such that

Then,
$\inf _{x\in V}\|\Phi (x)\|=0$
.
Proof of Proposition 1.1
Arguing by contradiction, assume that there is a convex set
$X\subset H$
, with more than one point, such that
$\delta _X=0$
. Fix
$x_1, x_2\in X$
, with
$x_1\neq x_2$
. Let V be the closed segment joining
$x_1$
with
$x_2$
. Clearly,
$\delta _V=0$
. Fix
$u, v, w\in H$
so that
$\langle u,v\rangle =0$
,
$\|u\|=\|v\|=1$
,
$\langle w,x_1\rangle \neq \langle w,x_2\rangle $
. Finally, consider the operator
$\Phi :H\to H$
defined by

Of course,
$\Phi $
has a Lipschitzian derivative,
$\Phi (V)$
is compact and
$0\not \in \Phi (V)$
. Moreover,
$\Phi (x_1)=v$
and
$\Phi (x_2)=-v$
. Consequently,
$0\in \mathrm {conv}(\Phi (V))$
and so
$V\in \mathcal {A}_V$
. Hence, condition
$(2)$
of Theorem 1.1 is satisfied and not condition
$(1)$
. This contradiction ends the proof.
Acknowledgements
The author wishes to thank the referee for his/her remarks showing the excessive conciseness of the original version.
Funding
This work has been funded by the European Union - NextGenerationEU Mission 4 - Component 2 - Investment 1.1 under the Italian Ministry of University and Research (MUR) programme “PRIN 2022” - grant number 2022BCFHN2 - Advanced theoretical aspects in PDEs and their applications - CUP: E53D23005650006. The author has also been supported by the Gruppo Nazionale per l’Analisi Matematica, la Probabilità e le loro Applicazioni (GNAMPA) of the Istituto Nazionale di Alta Matematica (INdAM) and by the Università degli Studi di Catania, PIACERI 2020-2022, Linea di intervento 2, Progetto “MAFANE”.