![]() | ||
In mathematics, a critical point or stationary point of a differentiable function of a real or complex variable is any value in its domain where its derivative is 0. Some authors include in the critical points the limit points where the function may be prolongated by continuity and where the derivative is not defined. For a differentiable function of several real variables, a critical point is a value in its domain where all partial derivatives are zero. The value of the function at a critical point is a critical value.
Contents
- Critical point of a single variable function
- Examples
- Location of critical points
- Critical points of an implicit curve
- Use of the discriminant
- Several variables
- Application to optimization
- Critical point of a differentiable map
- Application to topology
- References
The interest of this notion lies in the fact that the points where the function has local extrema are critical points.
This definition extends to differentiable maps between Rm and Rn, a critical point being, in this case, a point where the rank of the Jacobian matrix is not maximal. It extends further to differentiable maps between differentiable manifolds, as the points where the rank of the Jacobian matrix decreases. In this case, critical points are also called bifurcation points.
In particular, if C is a plane curve, defined by an implicit equation f(x,y) = 0, the critical points of the projection onto the x-axis, parallel to the y-axis are the points where the tangent to C are parallel to the y-axis, that is the points where
The notion of a critical point allows the mathematical description of an astronomical phenomenon that was unexplained before the time of Copernicus. A stationary point in the orbit of a planet is a point of the trajectory of the planet on the celestial sphere, where the motion of the planet seems to stop before restarting in the other direction. This occurs because of a critical point of the projection of the orbit into the ecliptic circle.
Critical point of a single variable function
A critical point or stationary point of a differentiable function of a single real variable, f(x), is a value x0 in the domain of f where its derivative is 0: f ′(x0) = 0. A critical value is the image under f of a critical point. These concepts may be visualized through the graph of f: at a critical point, the graph has a horizontal tangent and the derivative of the function is zero.
Although it is easily visualized on the graph (which is a curve), the notion of critical point of a function must not be confused with the notion of critical point, in some direction, of a curve (see below for a detailed definition). If g(x,y) is a differentiable function of two variables, then g(x,y) = 0 is the implicit equation of a curve. A critical point of such a curve, for the projection parallel to the y-axis (the map (x, y) → x), is a point of the curve where
It follows from these definitions that the function f(x) has a critical point x0 with critical value y0, if and only if (x0, y0) is a critical point of its graph for the projection parallel to the x-axis, with the same critical value y0.
For example, the critical points of the unit circle of equation x2 + y2 - 1 = 0 are (0, 1) and (0, -1) for the projection parallel to the y-axis, and (1, 0) and (-1, 0) for the direction parallel to the x-axis. If one considers the upper half circle as the graph of the function
Some authors define the critical points of a function f as the x-values for which the graph has a critical point for the projection parallel to either axis. In the above example of the upper half circle, the critical points for this enlarged definition are -1, 0 and -1. Such a definition appears, usually, only in elementary textbooks, when the critical points are defined before any definition of other curves than graphs of functions, and when functions of several variables are not considered (the enlarged definition does not extend to this case).
Examples
Location of critical points
By the Gauss-Lucas theorem, all of a polynomial function's critical points in the complex plane are within the convex hull of the roots of the function. Thus for a polynomial function with only real roots, all critical points are real and are between the greatest and smallest roots.
Sendov's conjecture asserts that, if all of a function's roots lie in the unit disk in the complex plane, then there is at least one critical point within unit distance of any given root.
Critical points of an implicit curve
Critical points play an important role in the study of plane curves defined by implicit equations, in particular for sketching them and determining their topology. The notion of critical point that is used in this section, may seem different from that of previous section. In fact it is the specialization to a simple case of the general notion of critical point given below.
Thus, we consider a curve C defined by an implicit equation
A point of C is critical for
This implies that this definition is a special case of the general definition of a critical point, which is given below.
The definition of a critical point for
Some authors define the critical points of C as the points that are critical for either
and are thus solutions of either system of equations characterizing the critical points. With this more general definition, the critical points for
Use of the discriminant
When the curve C is algebraic, that is when it is defined by a bivariate polynomial f, then the discriminant is a useful tool to compute the critical points.
Here we consider only the projection
Let
More precisely, a simple root of
A multiple root of the discriminant correspond either to several critical points or inflection asymptotes sharing the same critical value, or to an critical point which is also an inflection point, or to a singular point.
Several variables
For a continuously differentiable function of several real variables, a point P (that is a set of values for the input variables, which is viewed as a point in Rn) is critical if all of the partial derivatives of the function are zero at P, or, equivalently, if its gradient is zero. The critical values are the values of the function at the critical points.
If the function is smooth, or, at least twice continuously differentiable, a critical point may be either a local maximum, a local minimum or a saddle point. The different cases may be distinguished by considering the eigenvalues of the Hessian matrix of second derivatives.
A critical point at which the Hessian matrix is nonsingular is said to be nondegenerate, and the signs of the eigenvalues of the Hessian determine the local behavior of the function. In the case of a function of a single variable, the Hessian is simply the second derivative, viewed as a 1×1-matrix, which is nonsingular if and only if it is not zero. In this case, a non-degenerate critical point is a local maximum or a local minimum, depending on the sign of the second derivative, which is positive for a local minimum and negative for a local maximum. If the second derivative is null, the critical point is generally an inflection point, but may also be an undulation point, which may be a local minimum or a local maximum.
For a function of n variables, the number of negative eigenvalues of the Hessian matrix at a critical point is called the index of the critical point. A non-degenerate critical point is a local maximum if and only if the index is n, or, equivalently, if the Hessian matrix is negative definite; it is a local minimum if the index is zero, or, equivalently, if the Hessian matrix is positive definite. For the other values of the index, a non-degenerate critical point is a saddle point, that is a point which is a maximum in some directions and a minimum in others.
Application to optimization
By Fermat's theorem, all local maxima and minima of a differentiable function occur at critical points. Therefore, to find the local maxima and minima, it suffices, theoretically, to compute the zeros of the gradient and the eigenvalues of the Hessian matrix at these zeros. This does not work well in practice because it requires the solution of a nonlinear system of simultaneous equations, which is a difficult task. The usual numerical algorithms are much more efficient for finding local extrema, but cannot certify that all extrema have been found. In particular, in global optimization, these methods cannot certify that the output is really the global optimum.
When the function to minimize is a multivariate polynomial, the critical points and the critical values are solutions of a system of polynomial equations, and modern algorithms for solving such systems provide competitive certified methods for finding the global minimum.
Critical point of a differentiable map
Given a differentiable map f from Rm into Rn, the critical points of f are the points of Rm, where the rank of the Jacobian matrix of f is not maximal. The image of a critical point under f is a called a critical value. A point in the complement of the set of critical values is called a regular value. Sard's theorem states that the set of critical values of a smooth map has measure zero. In particular, if n = 1, there is a finite number of critical values in each bounded interval.
Some authors give a slightly different definition: a critical point of f is a point of Rm where the rank of the Jacobian matrix of f is less than n. With this convention, all points are critical when m < n.
These definitions extend to differential maps between differentiable manifolds in the following way. Let
Application to topology
Critical points are fundamental for studying the topology of manifolds and real algebraic varieties. In particular, they are the basic tool for Morse theory and catastrophe theory.
The link between critical points and topology already appears at a lower level of abstraction. For example, let
In the case of real algebraic varieties, this observation associated with Bézout's theorem allows us to bound the number of connected components by a function of the degrees of the polynomials that define the variety.