4

Let $f: I \to \mathbb{R}$ where $I$ is an interval. We say that $f$ is convex if for every $a,b\in I$ and every $\lambda : 0<\lambda < 1.\\$ Prove that for any $x\in (a,b)$ $f(\lambda b + (1-\lambda)a) \leq \lambda f(b) + (1-\lambda )f(a) \implies f(x) \leq \frac{(x-a)}{(b-a)}f(b) + \frac{(b-x)}{(b-a)}f(a)\\$

I can see how this works clearly geometrically but I am unsure where to start. It is clear that $\frac{x-a}{b-a}$ and $\frac{b-x}{b-a} \leq 1$. And by the triangle inequality that $f(x)\leq f(a) + f(b)$ but I don't know where to even begin. Can anyone help?

Kyle H.
  • 293
  • 1
  • 3
  • 7

1 Answers1

4

If $$\lambda= \frac{x-a}{b-a},$$ then $$1-\lambda= \frac{b-a}{b-a}-\frac{x-a}{b-a}=\frac{b-x}{b-a}.$$

Mathematical statements are usually Extremely general... the above inequality holds for $\textit{all}$ $0<\lambda<1,$ in particular even for $\lambda =\frac{x-a}{b-a},$ or $\lambda=\frac{b-x}{b-a}.$

Maxim Gilula
  • 1,485