When I read about convex functions, I often encounter theorems of the following form: For a continuous function $f$ on the interval $[a;b]$ satisfying $f''(x) \geq 0$ for all $x \in [a;b]$, then $f$ is a convex function on $[a;b]$.
I think it is possible to relax the sufficient condition at both endpoints while maintaining continuity. Specifically:
For a continuous function $f$ on the interval $[a;b]$ satisfying $f''(x) \geq 0$ for all $x \in (a;b)$, prove that $f$ is a convex function on $[a;b]$.
I see that functions like $f(x)=-\sqrt{x}$ satisfy this condition. However, I don't yet know how to prove it. Thank you!