AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
Personal tools

Convex function

From AoPSWiki

A function for some interval \displaystyle I \subseteq \mathbb{R} is convex (sometimes written concave up) over if and only if the set of all points such that is convex. Equivalently, is convex if for every and every ,

\displaystyle \lambda f(x) + (1-\lambda)f(y) \ge f\left( \lambda x + (1-\lambda) y \right).

We say that is strictly convex if equality occurs only when or .

Usually, when we do not specify , we mean .

We say that is (strictly) concave (or, occasionally, that it is concave down) if is (strictly) convex.

If is differentiable on an interval , then it is convex on if and only if is non-decreasing on . Similarly, if is twice differentiable over an interval , we say it is convex over if and only if for all .

Note that in our previous paragraph, our requirements that is differentiable and twice differentiable are crucial. For a simple example, consider the function

f(x) = \lfloor x \rfloor (x - \lfloor x \rfloor ) + {\lfloor x \rfloor \choose 2},

defined over the non-negative reals. It is piecewise differentiable, but at infinitely many points (for all natural numbers , to be exact) it is not differentiable. Nevertheless, it is convex. More significantly, consider the function

f(x) = \left( |x| - 1 \right)^2

over the interval . It is continuous, and twice differentiable at every point except . Furthermore, its second derivative is greater than 0, wherever it is defined. But its graph is shaped like a curvy W, and it is not convex over , although it is convex over and over .


This article is a stub. Help us out by expanding it.

Resources

Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us