Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $(Y,\|\cdot\|)$ a Banach space and $b\colon Y\to \mathbb{R}$ a nonnegative convex function such that, for some $\mathcal{E}>0$, the set $\{y\in Y\,:\, b(y)<\mathcal{E}\}$ is nonempty and bounded.

I need prove that exist $z\in Y$, $c>0$ and $C>0$ such that $b(y)-b(z)\geq c\|y-z\|$ for $y\in Y\backslash B_C(z)$.

Note: $B_C(z):=\{y\in Y\,:\, \|y-z\|\leq C\}$.

Thanks in advance.

share|cite|improve this question
up vote 2 down vote accepted

Let $\epsilon_0$ be the fixed positive constant such that $F_0 := \{ y \mid b(y) < \epsilon_0\}$ is nonempty and bounded. Fix $z\in F_0$. Then we have that if $y \in Y \setminus F_0$, $b(y) - b(z) \geq \epsilon_0 - b(z) =: \delta_0 > 0$.

By assumption $F_0$ is bounded, hence there exists $C > 0$ such that $B_C(z) \supset F_0$. (Here I take $B_C(z)$ to be the open ball; a simple modification of the following argument also allows for closed balls.)

Let $c = \frac{\delta_0}{2C}$. Now we verify this choice of $C$ and $c$ is good.

Given $y \in Y\setminus B_C(z)$, let $\tilde{y} = \frac{C}{\|y-z\|} (y-z) + z$. By convexity of the function $b$ we have that

$$ \frac{C}{\|y-z\|} (b(y) - b(z)) + b(z) \geq b(\tilde{y}) \geq b(z) + \delta_0 $$

Hence we have that

$$ b(y) - b(z) \geq \frac{\delta_0}{C} \|y-z\| > \frac{\delta_0}{2C} \|y-z\| = c \| y - z\| $$

as claimed.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.