Proving that convexity implies second order derivative being positive

  • Context: Undergrad 
  • Thread starter Thread starter hmparticle9
  • Start date Start date
  • Tags Tags
    Calculus
Click For Summary
SUMMARY

This discussion focuses on proving that convexity of a function implies that its second derivative is positive. The user presents an initial proof attempt using the definition of convexity and the intermediate value theorem, leading to the conclusion that if a function \( f \) is convex, then \( f'(x) > f'(y) \) for \( x > y \). The conversation reveals the need for clarity in the proof structure, particularly regarding the limits and the behavior of the first derivative as \( a \) approaches \( b \).

PREREQUISITES
  • Understanding of convex functions and their properties
  • Familiarity with calculus concepts such as derivatives and limits
  • Knowledge of the intermediate value theorem
  • Basic proficiency in mathematical notation and inequalities
NEXT STEPS
  • Study the properties of convex functions in detail
  • Learn about the implications of the second derivative test in calculus
  • Explore various proofs of the relationship between convexity and the positivity of the second derivative
  • Investigate the role of the intermediate value theorem in calculus proofs
USEFUL FOR

Mathematicians, students studying calculus, and anyone interested in the properties of convex functions and their derivatives.

hmparticle9
Messages
157
Reaction score
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##
 
Last edited:
Physics news on Phys.org
hmparticle9 said:
taking the limit ##\lambda \rightarrow 0##
Why do you take the limit ##\lambda \rightarrow 0##, instead of letting the difference ##h \equiv b-a## go to zero?
 
What difference would that make?
 
I just realized that my proof is even more wrong. I need to show that ##f'(x) > f'(y)## for ##x > y##. Sorry guys. I am well off.
 
I think I understand where you are coming from now. If we let ##a## tend to ##b## then since ##c## is in ##(b,a)## we must have ##f'(b) < f'(c)##. But is that enough?
 
We can say
$$f'(b) < f'(b+\epsilon) < f'(b+2\epsilon) < ... < f'(c)$$
for some ##b < c##.
 
hmparticle9 said:
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))$$

It's a bit confusing to take ##b < a##; usually we have ##a < b##.

My approach would be to define $$
g : [0,1]\to\mathbb{R} : x \mapsto f(b) + x(f(a) - f(b)) - f(b+ x(a - b)) \geq 0.$$ Now ##g(0) = g(1) = 0## and the constraint on the sign of ##g## allows you to say something about the signs of ##g'(0)## and ##g'(1)##, and hence about ##f'(b)## and ##f'(a)##.
 
  • Like
Likes   Reactions: bhobba

Similar threads

  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K