This article includes a list of general references, but it remains largely unverified because it lacks sufficient corresponding inline citations. (January 2015) (Learn how and when to remove this template message)
Critical point is a wide term used in many branches of mathematics.
When dealing with functions of a real variable, a critical point is a point in the domain of the function where the function is either not differentiable or the derivative is equal to zero. When dealing with complex variables, a critical point is, similarly, a point in the function's domain where it is either not holomorphic or the derivative is equal to zero. Likewise, for a function of several real variables, a critical point is a value in its domain where the gradient is undefined or is equal to zero.
The value of the function at a critical point is a critical value.
This sort of 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 . In other words, the critical points are those where the implicit function theorem does not apply.
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.
A critical point of a function of a single real variable, f(x), is a value x0 in the domain of f where it is not differentiable or 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 if you can assign one at all.
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 . This means that the tangent of the curve is parallel to the y-axis, and that, at this point, g does not define an implicit function from x to y (see implicit function theorem). If (x0, y0) is such a critical point, then x0 is the corresponding critical value. Such a critical point is also called a bifurcation point, as, generally, when x varies, there are two branches of the curve on a side of x0 and zero on the other side.
It follows from these definitions that a differentiable 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. If f is not differentiable at x0 due to the tangent becoming parallel to the y-axis, then x0 is again a critical point of f, but now (x0, y0) is a critical point of its graph for the projection parallel to y-axis.
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 x-axis, and (1, 0) and (-1, 0) for the direction parallel to the y-axis. If one considers the upper half circle as the graph of the function , then x = 0 is a critical point with critical value 1 due to the derivative being equal to 0, and x=-1 and x=1 are critical points with critical value 0 due to the derivative being undefined.
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.
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 , where f is a differentiable function of two variables, commonly a bivariate polynomial. The points of the curve are the points of the Euclidean plane whose Cartesian coordinates satisfy the equation. There are two standard projections and , defined by and that map the curve onto the coordinate axes. They are called the projection parallel to the y-axis and the projection parallel to the x-axis, respectively.
A point of C is critical for , if the tangent to C exists and is parallel to the y-axis. In that case, the images by of the critical point and of the tangent are the same point of the x-axis, called the critical value. Thus a point is critical for if its coordinates are solution of the system of equations:
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 is similar. If C is the graph of a function , then (x, y) is critical for if and only if x is a critical point of g, and that the critical values are the same.
Some authors define the critical points of C as the points that are critical for either or , although they depend not only on C, but also on the choice of the coordinate axes. It depends also on the authors if the singular points are considered as critical points. In fact the singular points are the points that satisfy
and are thus solutions of either system of equations characterizing the critical points. With this more general definition, the critical points for are exactly the points where the implicit function theorem does not apply.
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 ; Similar results apply to by exchanging x and y.
Let be the discriminant of f viewed as a polynomial in y with coefficients that are polynomials in x. This discriminant is thus a polynomial in x which has the critical values of among its roots.
More precisely, a simple root of is either a critical value of such the corresponding critical point is a point which is not singular nor an inflection point, or the x-coordinate of an asymptote which is parallel to the y-axis and is tangent "at infinity" to an inflection point (inflexion asymptote).
A multiple root of the discriminant correspond either to several critical points or inflection asymptotes sharing the same critical value, or to a critical point which is also an inflection point, or to a singular point.
For a 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 it is a point where the gradient is undefined or the gradient is zero. The critical values are the values of the function at the critical points.
A critical point may be either a local maximum, a local minimum or a saddle point. If the function is at least twice continuously differentiable 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.
By Fermat's theorem, all local maxima and minima of a continuous function occur at critical points. Therefore, to find the local maxima and minima of a differentiable function, 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.
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 be a differential map between two manifolds V and W of respective dimensions m and n. In the neighborhood of a point p of V and of f(p), charts are diffeomorphisms and The point p is critical for f if is critical for This definition does not depend on the choice of the charts because the transitions maps being diffeomorphisms, their Jacobian matrices are invertible and multiplying by them does not modify the rank of the Jacobian matrix of If M is a Hilbert manifold (not necessarily finite dimensional) and f is a real-valued function then we say that p is a critical point of f if f is not a submersion at p.
The link between critical points and topology already appears at a lower level of abstraction. For example, let be a sub-manifold of and P be a point outside The square of the distance to P of a point of is a differential map such that each connected component of contains at least a critical point, where the distance is minimal. It follows that the number of connected components of is bounded above by the number of critical points.
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.