A function is convex if $(1-t)f(x_1)+tf(x_2)\ge f((1-t)x_1+tx_2)$ for $t \in [0,1]$, which is odd because I was taught (very young age) that concave shapes were like caves, they go inwards. Convex was the other one.
A bucket shaped curve, say $x^2$, is convex by this definition.
Now I remember reading a combinatorial optimisation book and that had a good reason for convex functions looking concave but I have forgotten what it was, can someone remind me, or give an alternative reason?
I am looking this up because a proof I saw used the "fact $y=\ln(x)$ is concave" and I cannot prove this. I've tried but I can't get anywhere meaningful (for example $(1-t)\ln(x_1)+t\ln(x_2)=\ln(x_1^{1-t}x_2^t)$ not sure how to get from there to $\le\ln((1-t)x_1+tx_2)$
There is a condition: $f$ is convex iff $f''(x)\ge0$ and $f$ is concave iff $f''(x)\le0$. So, if $f(x)=\ln x$, then $f'(x)=\frac{1}{x}$ and $f''(x)=-\frac{1}{x^{2}}\le0$. Therefore $\ln x$ is a concave function.