A concave function is a real-valued function whose value at any weighted average of two points is at least the same weighted average of its values at those points. Geometrically, its graph lies on or above every line segment joining two points on the graph. Concavity is the sign-reversed counterpart of convexity: is concave exactly when is a convex function. It is a central concept in optimization, probability, economics, and mathematical analysis.
Definition
Let be a convex subset of a real vector space. A function is concave if, for every and every ,
The requirement that be convex ensures that belongs to the domain.
More generally, the two-point inequality implies that for any finite collection and nonnegative weights satisfying ,
The argument on the left is a convex combination of the points. Thus concavity means that taking an average before applying the function produces a value no smaller than averaging afterward.
Concavity concerns the shape of a function, not whether it increases or decreases. A concave function may be increasing, decreasing, or increasing on one part of its domain and decreasing on another.
Strict concavity
The function is strictly concave if
whenever and .
Strict concavity rules out every nontrivial straight segment in the graph. An affine function, such as , is both concave and convex, but is not strictly concave on any domain containing two distinct points.
Strong concavity
On a convex subset of a Euclidean space, is strongly concave with parameter if
for all admissible , where is the Euclidean norm.
Equivalently,
is concave. Strong concavity supplies a uniform quadratic lower bound on the gap between the graph and its chords. It implies strict concavity, but strict concavity need not imply strong concavity.
Geometric characterizations
Chords and hypographs
For a function of one variable, concavity means that each chord of the graph lies on or below the graph between its endpoints.
In any dimension, the hypograph of is
A function is concave if and only if its hypograph is a convex set. This characterization expresses concavity entirely in terms of set geometry and does not require differentiability.
Tangent upper bounds
Suppose is differentiable on an open convex subset of . Then is concave if and only if
for every in its domain, where is its gradient.
Thus the tangent affine function at any point is a global upper bound. This is the reverse of the tangent lower-bound property of convex functions.
For a function that is not differentiable, a vector satisfying
is called a supergradient at . For a finite concave function on a finite-dimensional convex domain, a supporting affine upper bound exists at every point in the relative interior of the domain; existence at boundary points requires additional care.
Derivative criteria
Functions of one variable
A differentiable function on an open interval is concave if and only if its derivative is nonincreasing. If it is twice differentiable, this is equivalent to
throughout the interval.
The stronger condition
throughout the interval guarantees strict concavity, but is not necessary for it. For example, is strictly concave on , although .
Concavity can also be described without derivatives. For in the domain,
These inequalities express the decrease of secant slopes as the interval moves to the right.
Functions of several variables
For a twice continuously differentiable function on an open convex subset of , concavity is equivalent to the Hessian matrix being negative semidefinite everywhere:
Equivalently, every eigenvalue of the Hessian is nonpositive.
A negative definite Hessian everywhere guarantees strict concavity. As in one dimension, this condition is sufficient but not necessary.
Under the same smoothness assumptions, strong concavity with parameter is equivalent to
for every and . If the domain lies in a lower-dimensional affine subspace, the relevant curvature conditions apply only along directions parallel to that subspace.
Examples
Logarithm. The natural logarithm is strictly concave on , since
It is not strongly concave on the entire positive half-line because this curvature approaches zero as .
Fractional powers. For , the function is strictly concave on . The square-root function is a familiar example.
Negative quadratic functions. If is symmetric and positive semidefinite, then
is concave. If is positive definite, the function is strongly concave, with parameter equal to the smallest eigenvalue of .
Negative absolute value. The function is concave on , but is neither differentiable at zero nor strictly concave on the whole domain.
Minimum of coordinates. The function
is concave and generally nondifferentiable where several coordinates attain the minimum.
Entropy. For a finite probability vector , Shannon entropy
with , is strictly concave on the probability simplex.
Preservation and regularity properties
Several operations preserve concavity:
- A sum of concave functions with nonnegative coefficients is concave.
- Adding an affine function preserves concavity.
- Composing a concave function with an affine map preserves concavity on the resulting convex domain.
- If is concave and nondecreasing, and is concave, then is concave wherever the composition is defined.
- The pointwise infimum of a family of concave functions on a common convex domain is concave, provided it is finite-valued there.
By contrast, the pointwise maximum of concave functions need not be concave. For example, and are concave, but their maximum is not. Products of concave functions also do not generally preserve concavity.
A finite concave function on a finite-dimensional convex domain is continuous on the relative interior of its domain and is locally Lipschitz there. Continuity at boundary points does not follow from concavity alone. For example, the function on defined by
is concave but discontinuous at zero.
Jensen’s inequality
Jensen’s inequality extends the finite weighted-average inequality to probability distributions. If is an integrable random vector taking values in a convex domain, and the relevant expectations are finite, then
Here denotes expectation. The inequality compares the function evaluated at the mean with the mean of the function’s values.
If is strictly concave, equality holds only when is constant almost surely. For a general concave function, equality may also occur when the distribution is supported on a region where the function is affine.
For the logarithm, the finite form gives
which, after exponentiation, yields the weighted arithmetic–geometric mean inequality.
Role in optimization
Maximizing a concave objective function over a convex feasible set is a standard form of convex optimization, because it is equivalent to minimizing the convex function .
Concavity gives several important guarantees:
- Every local maximum is a global maximum.
- The set of maximizers is convex.
- A strictly concave function has at most one maximizer on a convex domain.
- For a differentiable concave function, an interior point with zero gradient is a global maximizer.
More generally, a feasible point is a global maximizer if
These statements do not guarantee that a maximizer exists. For example, is concave on but unbounded above. A continuous function on a nonempty compact feasible set attains a maximum by the extreme value theorem.
Strong concavity additionally gives a quantitative bound. At an unconstrained maximizer of a differentiable, -strongly concave function,
Thus a small objective-value gap bounds the distance to the optimizer.
Applications and related concepts
In economics, concave utility functions model diminishing marginal utility: where derivatives exist, marginal utility does not increase as consumption rises. In expected-utility models, concavity also produces the inequality underlying risk aversion through Jensen’s inequality.
In maximum likelihood estimation, some statistical models have concave log-likelihood functions. When this property holds on a convex parameter domain, it simplifies optimization and rules out nonglobal local maxima. Concavity of a log-likelihood is a model-dependent property, not a general property of likelihoods.
In information theory, entropy concavity describes the effect of mixing probability distributions: the entropy of a mixture is at least the corresponding average of the component entropies.
A related but weaker property is quasiconcavity. A function is quasiconcave if
Equivalently, all of its upper level sets are convex. Every concave function is quasiconcave, but the converse fails. For example, the exponential function on is quasiconcave because it is increasing, yet it is strictly convex rather than concave. Concavity imposes quantitative restrictions on function values along segments, whereas quasiconcavity constrains only the geometry of upper level sets.