Given strongly convex $f(x)$ definded on $[a, b]$. I'm trying to prove that $\forall x \in (a, b)$ correct this strong inequality: $$f(x) < \max \{f(a), f(b) \}. $$ I can understand this fact on intuition level - from geometric side of convexity - every point under the chord, connecting any two points in interval, in which function defined. So each point is under the chord and under the $\max \{ f(a), f(b) \}$.
But how can i formalize it?
UPD: there was an misspell: i need it for strict, not strong convexity.