Show $f(x)=\|x\|^2 = x^Tx$ is strictly convex by proving:
For distinct $x,y \in \mathbb{R}$ and $0<\lambda <1$, $f(\lambda x+(1-\lambda) y) < \lambda f(x)+(1-\lambda)f(y)$
I have tried to expand and simplify both sides (taking up a full page each try) but I am having trouble exactly relating the two. It would be too much to show all my work here but I will show the point that I have gotten to.
\begin{align} \text{LHS:} \quad & \lambda^2\sum_{i=1}^n x_i^2+(1-\lambda)^2\sum_{i=1}^n y_i^2 +2\lambda(1-\lambda)\sum_{i=1}^n x_iy_i \\[10pt] \text{RHS:} \quad & \lambda\sum_{i=1}^n x_i^2+(1-\lambda)\sum_{i=1}^n y_i^2 \end{align}
I think I have to use the fact that $\lambda^2<\lambda$ so I have that $$\lambda^2\sum_{i=1}^n x_i^2+(1-\lambda)^2\sum_{i=1}^n y_i^2 < \lambda\sum_{i=1}^n x_i^2+(1-\lambda)\sum_{i=1}^n y_i^2$$
But how can I show that the difference between the two sides of the inequality is greater than $2\lambda(1-\lambda)\sum_{i=1}^n x_iy_i$