How can I prove that f + g is convex?

  • Thread starter Thread starter mohdhm
  • Start date Start date
  • Tags Tags
    Function Proofs
Click For Summary
SUMMARY

The discussion centers on proving that the sum of two functions, f + g, is convex under the condition that both f and g are convex functions. A convex function is defined by the inequality t f(x) + (1-t) f(y) ≥ f(t x + (1-t) y) for any two points x and y in its domain. Participants clarify that without the assumption of convexity for both functions, the statement is false. The proof involves algebraic manipulation of the convexity definitions for f and g.

PREREQUISITES
  • Understanding of convex functions and their properties
  • Familiarity with algebraic manipulation of inequalities
  • Knowledge of function notation and definitions
  • Basic understanding of mathematical proofs
NEXT STEPS
  • Study the definition and properties of convex functions in depth
  • Learn about the implications of the Minkowski inequality in convex analysis
  • Explore examples of convex functions and their graphical representations
  • Investigate the conditions under which the sum of functions retains convexity
USEFUL FOR

Mathematicians, students studying calculus or optimization, and anyone interested in the properties of convex functions and their applications in analysis.

mohdhm
Messages
42
Reaction score
0
hey everyone:

Use a definition to work forward from each of the following statements.

b. for functions f anf g the function f + g is convex, where f + g is the function whoes value at any point x is f(x) + g(x).

Definition of a convex function: http://en.wikipedia.org/wiki/Convex_function (the equation)

So guys, I'm really stumped, what are we asked to do here. I have a hunch that we have to add g(x) of a convex function to the f(x) of one, but we only have the function of f to work with, and also in the definition we get a y variable, that was not even mentioned in the question... what is up with that. If someone can at least guide me in the right direction, i'd be eternally grateful
 
Physics news on Phys.org
No wonder you are stumped! The "theorem" as you state it is false. Did you not include the condition that f(x) and g(x) are convex themselves?

I have absolutely no idea what you mean by "g(x) of a convex function"- either g(x) itself is a convex function or it is not, but there is no "g(x) of a convex function".

A function is convex if and only if, for x and y any two points in its domain, [itex]tf(x)+ (1-t)f(y)\ge f(tx+ (1-t)y)[/itex]. In other words, the straight line between (x,f(x)) and (y, f(y)) is above the point on the graph (tx+ (1-t)y, f(tx+ (1-t)y)).

Okay, if the function is f(x)+ g(y) that means you want to prove that
[tex]t(f(x)+ g(x))+ (1-t)(f(y)+ g(y))\ge f(tx+ (1-t)y)+ g(tx+ (1-t)y[/tex]
and you can assume that is true of f(x) and g(x) separately. Looks like straightforward algebra to me.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
4
Views
4K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 17 ·
Replies
17
Views
4K