This shouldn't be too hard, but I'm stuck. Suppose $f$ is a concave function on the interval $[a,b]$, meaning $$\lambda f(x) + (1-\lambda) f(y) \leq f(\lambda x + (1-\lambda) y)$$ for every $x,y \in [a,b]$ and every $\lambda \in [0,1]$. I want to prove that for any $p, q, r \in [a,b]$ with $q \geq r \geq 0$ we have: $$f(p + q) + f(p - q) \leq f(p + r) + f(p - r)$$
This inequality comes up in a paper that I'm reading on random walks, and in that context the function $f$ is piecewise linear. So I'm not willing to assume that $f$ is differentiable, but piecewise smooth is fine if it helps (I don't think it will).