# Strict inequality in the environment of convexity

I have a nonempty convex set $C \subset \mathbb{R}^n$ with $0 \notin C$. Moreover, the inner of C is nonempty. I know that there exists a unique $x \in \overline{C}$ with $\Vert x \Vert = d(0,C)$. Now I am supposed to show that for all $\lambda \in (0,1)$ and $y \in C$ such that $y \neq x$ I have \begin{align*} \Vert x \Vert < \Vert (1-\lambda) x + \lambda y\Vert. \end{align*} Unfortunately, I don't know how to obtain this strict inequality.

You said it yourself. There is a unique $x \in \overline C$ with the property that $\|x\| = d(0,C)$. If $y \in C$ and $0 < \lambda < 1$ then $\lambda x + (1-\lambda) y \in \overline C$ too, so that $\| \lambda x + (1-\lambda)y\| \ge d(0,C).$ But $x \not= y$ implies $\lambda x + (1-\lambda)y \not= x$, so you must have $\|\lambda x + (1-\lambda)y\| \not= d(0,C)$.
Consider a function $f(x) =||x||$ on compact set $A=B(0, R)\cap \overline{C}$ where $B(x,r)=\{y\in\mathbb{R}^n : ||y-x||\leq r\}$ and $R=d(0, C) +1 .$