Convex functions play an important role in many areas of mathematics. They are especially important in the study of optimization problems where they are distinguished by a number of convenient properties. For instance, a strictly convex function on an open set has no more than one minimum. Even in infinite-dimensional spaces, under suitable additional hypotheses, convex functions continue to satisfy such properties and as a result, they are the most well-understood functionals in the calculus of variations. In probability theory, a convex function applied to the expected value of a random variable is always bounded above by the expected value of the convex function of the random variable. This result, known as Jensen's inequality, can be used to deduce inequalities such as the arithmetic–geometric mean inequality and Hölder's inequality.
Visualizing a convex function and Jensen's Inequality
Then is called convex if and only if any of the following equivalent conditions hold:
For all and all :
The right hand side represents the straight line between and in the graph of as a function of increasing from to or decreasing from to sweeps this line. Similarly, the argument of the function in the left hand side represents the straight line between and in or the -axis of the graph of So, this condition requires that the straight line between any pair of points on the curve of to be above or just meets the graph.
For all and all such that :
The difference of this second condition with respect to the first condition above is that this condition does not include the intersection points (for example, and ) between the straight line passing through a pair of points on the curve of (the straight line is represented by the right hand side of this condition) and the curve of the first condition includes the intersection points as it becomes or at or or In fact, the intersection points do not need to be considered in a condition of convex using
because and are always true (so not useful to be a part of a condition).
The second statement characterizing convex functions that are valued in the real line is also the statement used to define convex functions that are valued in the extended real number line where such a function is allowed to (but is not required to) take as a value. The first statement is not used because it permits to take or as a value, in which case, if or respectively, then would be undefined (because the multiplications and are undefined). The sum is also undefined so a convex extended real-valued function is typically only allowed to take exactly one of and as a value.
The second statement can also be modified to get the definition of strict convexity, where the latter is obtained by replacing with the strict inequality
Explicitly, the map is called strictly convex if and only if for all real and all such that :
A strictly convex function is a function that the straight line between any pair of points on the curve is above the curve except for the intersection points between the straight line and the curve.
The function is said to be concave (resp. strictly concave) if ( multiplied by -1) is convex (resp. strictly convex ).
The term convex is often referred to as convex down or concave upward, and the term concave is often referred as concave down or convex upward. If the term "convex" is used without an "up" or "down" keyword, then it refers strictly to a cup shaped graph . As an example, Jensen's inequality refers to an inequality involving a convex or convex-(up), function.
Many properties of convex functions have the same simple formulation for functions of many variable as for functions of one variable. See below the properties for the case of many variables, as some of them are not listed for functions of one variable.
Functions of one variable
Suppose is a function of one real variable defined on an interval, and let
(note that is the slope of the purple line in the above drawing; the function is symmetric in means that does not change by exchanging and ). is convex if and only if is monotonically non-decreasing in for every fixed (or vice versa). This characterization of convexity is quite useful to prove the following results.
A differentiable function of one variable is convex on an interval if and only if its graph lies above all of its tangents:: 69
for all and in the interval.
A twice differentiable function of one variable is convex on an interval if and only if its second derivative is non-negative there; this gives a practical test for convexity. Visually, a twice differentiable convex function "curves up", without any bends the other way (inflection points). If its second derivative is positive at all points then the function is strictly convex, but the converse does not hold. For example, the second derivative of is , which is zero for but is strictly convex.
This property and the above property in terms of "...its derivative is monotonically non-decreasing..." are not equal since if is non-negative on an interval then is monotonically non-decreasing on while its converse is not true, for example, is monotonically non-decreasing on while its derivative is not defined at some points on .
If is a convex function of one real variable, and , then is superadditive on the positive reals, that is for positive real numbers and .
Since is convex, by using one of the convex function definitions above and letting it follows that for all real
From this it follows that
A function is midpoint convex on an interval if for all
This condition is only slightly weaker than convexity. For example, a real-valued Lebesgue measurable function that is midpoint-convex is convex: this is a theorem of Sierpinski. In particular, a continuous function that is midpoint convex will be convex.
It is not necessary for a function to be differentiable in order to be strongly convex. A third definition for a strongly convex function, with parameter is that, for all in the domain and
Notice that this definition approaches the definition for strict convexity as and is identical to the definition of a convex function when Despite this, functions exist that are strictly convex but are not strongly convex for any (see example below).
If the function is twice continuously differentiable, then it is strongly convex with parameter if and only if for all in the domain, where is the identity and is the Hessian matrix, and the inequality means that is positive semi-definite. This is equivalent to requiring that the minimum eigenvalue of be at least for all If the domain is just the real line, then is just the second derivative so the condition becomes . If then this means the Hessian is positive semidefinite (or if the domain is the real line, it means that ), which implies the function is convex, and perhaps strictly convex, but not strongly convex.
Assuming still that the function is twice continuously differentiable, one can show that the lower bound of implies that it is strongly convex. Using Taylor's Theorem there exists
by the assumption about the eigenvalues, and hence we recover the second strong convexity equation above.
A function is strongly convex with parameter m if and only if the function
The distinction between convex, strictly convex, and strongly convex can be subtle at first glance. If is twice continuously differentiable and the domain is the real line, then we can characterize it as follows:
convex if and only if for all
strictly convex if for all (note: this is sufficient, but not necessary).
strongly convex if and only if for all
For example, let be strictly convex, and suppose there is a sequence of points such that . Even though , the function is not strongly convex because will become arbitrarily small.
A twice continuously differentiable function on a compact domain that satisfies for all is strongly convex. The proof of this statement follows from the extreme value theorem, which states that a continuous function on a compact set has a maximum and minimum.
Strongly convex functions are in general easier to work with than convex or strictly convex functions, since they are a smaller class. Like strictly convex functions, strongly convex functions have unique minima on compact sets.
Uniformly convex functions
A uniformly convex function, with modulus , is a function that, for all in the domain and satisfies
where is a function that is non-negative and vanishes only at 0. This is a generalization of the concept of strongly convex function; by taking we recover the definition of strong convexity.
It is worth noting that some authors require the modulus to be an increasing function, but this condition is not required by all authors.
Functions of one variable
The function has , so f is a convex function. It is also strongly convex (and hence strictly convex too), with strong convexity constant 2.
The function has , so f is a convex function. It is strictly convex, even though the second derivative is not strictly positive at all points. It is not strongly convex.
The exponential function is convex. It is also strictly convex, since , but it is not strongly convex since the second derivative can be arbitrarily close to zero. More generally, the function is logarithmically convex if is a convex function. The term "superconvex" is sometimes used instead.
The function with domain [0,1] defined by for is convex; it is continuous on the open interval but not continuous at 0 and 1.
The function has second derivative ; thus it is convex on the set where and concave on the set where