hmparticle9
- 157
- 26
There are probably loads of proofs of this online, but I do not want to cheat. Here is my attempt:
Convexity says that
$$f(\lambda a + (1-\lambda)b) \leq \lambda f(a) + (1-\lambda) f(b)$$
$$f(b + \lambda(a-b)) \leq f(b) + \lambda (f(a) - f(b))$$
We know from the intermediate value theorem that there exists a ##c \in (b,a)## such that
$$\frac{f(a) - f(b)}{a-b} = f'(c).$$
Hence
$$f(b + \lambda(a-b)) \leq f(b) + \lambda (a - b) f'(c))$$
$$\frac{f(b + \lambda(a-b)) - f(b)}{\lambda(a-b)} \leq f'(c))$$
taking the limit ##\lambda \rightarrow 0##
$$f'(b) \leq f'(c)$$
This is not enough. I need to show that the above holds for all ##c##. I have shown that there exists one such c. Could I have some hints please? What I am getting at is that a function ##f## such that ##f''(x)>0## for all ##x## has the property that ##f'(x) > f'(y)## if ##x>y##
Convexity says that
$$f(\lambda a + (1-\lambda)b) \leq \lambda f(a) + (1-\lambda) f(b)$$
$$f(b + \lambda(a-b)) \leq f(b) + \lambda (f(a) - f(b))$$
We know from the intermediate value theorem that there exists a ##c \in (b,a)## such that
$$\frac{f(a) - f(b)}{a-b} = f'(c).$$
Hence
$$f(b + \lambda(a-b)) \leq f(b) + \lambda (a - b) f'(c))$$
$$\frac{f(b + \lambda(a-b)) - f(b)}{\lambda(a-b)} \leq f'(c))$$
taking the limit ##\lambda \rightarrow 0##
$$f'(b) \leq f'(c)$$
This is not enough. I need to show that the above holds for all ##c##. I have shown that there exists one such c. Could I have some hints please? What I am getting at is that a function ##f## such that ##f''(x)>0## for all ##x## has the property that ##f'(x) > f'(y)## if ##x>y##
Last edited: