Concave function

Source: Wikipedia, the free encyclopedia.

In mathematics, a concave function is one for which the value at any convex combination of elements in the domain is greater than or equal to the convex combination of the values at the endpoints. Equivalently, a concave function is any function for which the hypograph is convex. The class of concave functions is in a sense the opposite of the class of a convex functions. A concave function is also synonymously called concave downwards, concave down, convex upwards, convex cap, or upper convex.

Definition

A real-valued function on an interval (or, more generally, a convex set in vector space) is said to be concave if, for any and in the interval and for any ,[1]

A function is called strictly concave if

for any and .

For a function , this second definition merely states that for every strictly between and , the point on the graph of is above the straight line joining the points and .

A function is quasiconcave if the upper contour sets of the function are convex sets.[2]

Properties

A cubic function is concave (left half) when its first derivative (red) is monotonically decreasing i.e. its second derivative (orange) is negative, and convex (right half) when its first derivative is monotonically increasing i.e. its second derivative is positive

Functions of a single variable

  1. A
    monotonically decreasing on that interval, that is, a concave function has a non-increasing (decreasing) slope.[3][4]
  2. Points where concavity changes (between concave and convex) are inflection points.[5]
  3. If f is twice-
    negative
    then f is strictly concave, but the converse is not true, as shown by f(x) = −x4.
  4. If f is concave and differentiable, then it is bounded above by its first-order
    Taylor approximation:[2]
  5. A
    Lebesgue measurable function on an interval C is concave if and only if
    it is midpoint concave, that is, for any x and y in C
  6. If a function f is concave, and f(0) ≥ 0, then f is subadditive on . Proof:
    • Since f is concave and 1 ≥ t ≥ 0, letting y = 0 we have
    • For :

Functions of n variables

  1. A function f is concave over a convex set if and only if the function −f is a convex function over the set.
  2. The sum of two concave functions is itself concave and so is the
    pointwise minimum of two concave functions, i.e. the set of concave functions on a given domain form a semifield
    .
  3. Near a strict
    local maximum
    in the interior of the domain of a function, the function must be concave; as a partial converse, if the derivative of a strictly concave function is zero at some point, then that point is a local maximum.
  4. Any
    global maximum
    . A strictly concave function will have at most one global maximum.

Examples

Applications

See also

References

  1. .
  2. ^ .
  3. ^ Rudin, Walter (1976). Analysis. p. 101.
  4. ISSN 0022-2305
    .
  5. OCLC 965446428.{{cite book}}: CS1 maint: location missing publisher (link
    )
  6. .
  7. .

Further References