![]() | This article includes a list ofgeneral references, butit lacks sufficient correspondinginline citations. Please help toimprove this article byintroducing more precise citations.(January 2015) (Learn how and when to remove this message) |
Inmathematics, acritical point is theargument of a function where the functionderivative is zero (or undefined, as specified below).The value of the function at a critical point is acritical value.[1]
More specifically, when dealing withfunctions of a real variable, a critical point is a point in the domain of the function where the function derivative is equal to zero (also known as astationary point) or where the function is notdifferentiable.[2] Similarly, when dealing withcomplex variables, a critical point is a point in the function's domain where its derivative is equal to zero (or the function is notholomorphic).[3][4] Likewise, for afunction of several real variables, a critical point is a value in its domain where thegradientnorm is equal to zero (or undefined).[5]
This sort of definition extends todifferentiable maps between and acritical point being, in this case, a point where therank of theJacobian matrix is not maximal. It extends further to differentiable maps betweendifferentiable manifolds, as the points where the rank of the Jacobian matrix decreases. In this case, critical points are also calledbifurcation points.In particular, ifC is aplane curve, defined by animplicit equationf (x,y) = 0, the critical points of the projection onto thex-axis, parallel to they-axis are the points where the tangent toC are parallel to they-axis, that is the points where. In other words, the critical points are those where theimplicit function theorem does not apply.
Acritical point of a function of a singlereal variable,f (x), is a valuex0 in thedomain off wheref is notdifferentiable or itsderivative is 0 (i.e.).[2] Acritical value is the image underf of a critical point. These concepts may be visualized through thegraph off: at a critical point, the graph has a horizontaltangent if one can be assigned at all.
Notice how, for adifferentiable function,critical point is the same asstationary point.
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 acurve (seebelow for a detailed definition). Ifg(x,y) is a differentiablefunction of two variables, theng(x,y) = 0 is theimplicit equation of a curve. Acritical point of such a curve, for the projection parallel to they-axis (the map(x,y) →x), is a point of the curve where This means that the tangent of the curve is parallel to they-axis, and that, at this point,g does not define an implicit function fromx toy (seeimplicit function theorem). If(x0,y0) is such a critical point, thenx0 is the correspondingcritical value. Such a critical point is also called abifurcation point, as, generally, whenx varies, there are two branches of the curve on a side ofx0 and zero on the other side.
It follows from these definitions that adifferentiable functionf (x) has a critical pointx0 with critical valuey0, if and only if(x0,y0) is a critical point of its graph for the projection parallel to thex-axis, with the same critical valuey0. Iff is not differentiable atx0 due to the tangent becoming parallel to they-axis, thenx0 is again a critical point off, but now(x0,y0) is a critical point of its graph for the projection parallel to they-axis.
For example, the critical points of theunit circle of equation are(0, 1) and(0, -1) for the projection parallel to thex-axis, and(1, 0) and(-1, 0) for the direction parallel to they-axis. If one considers the upper half circle as the graph of the function, thenx = 0 is a critical point with critical value 1 due to the derivative being equal to 0, andx = ±1 are critical points with critical value 0 due to the derivative being undefined.
By theGauss–Lucas theorem, all of a polynomial function's critical points in thecomplex plane are within theconvex hull of theroots 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 theunit disk in the complex plane, then there is at least one critical point within unit distance of any given root.
Critical points play an important role in the study ofplane curves defined byimplicit equations, in particular forsketching them and determining theirtopology. 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 givenbelow.
Thus, we consider a curveC defined by an implicit equation, wheref is adifferentiable function of two variables, commonly abivariate polynomial. The points of the curve are the points of theEuclidean plane whoseCartesian coordinates satisfy the equation. There are two standardprojections and, defined by and that map the curve onto thecoordinate axes. They are called theprojection parallel to the y-axis and theprojection parallel to the x-axis, respectively.
A point ofC iscritical for, if thetangent toC exists and is parallel to they-axis. In that case, theimages by of the critical point and of the tangent are the same point of thex-axis, called thecritical value. Thus a point ofC is critical for if its coordinates are a solution of thesystem of equations:
This implies that this definition is a special case of the general definition of a critical point, which is givenbelow.
The definition of a critical point for is similar. IfC is thegraph of a function, then(x,y) is critical for if and only ifx is a critical point ofg, and that the critical values are the same.
Some authors define thecritical points ofC as the points that are critical for either or, although they depend not only onC, but also on the choice of the coordinate axes. It depends also on the authors if thesingular 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 theimplicit function theorem does not apply.
When the curveC is algebraic, that is when it is defined by a bivariate polynomialf, then thediscriminant is a useful tool to compute the critical points.
Here we consider only the projection; Similar results apply to by exchangingx andy.
Letbe thediscriminant off viewed as a polynomial iny with coefficients that are polynomials inx. This discriminant is thus a polynomial inx 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 thex-coordinate of anasymptote which is parallel to they-axis and is tangent "at infinity" to aninflection 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 afunction of several real variables, a pointP (that is a set of values for the input variables, which is viewed as a point in) iscritical if it is a point where thegradient is zero or undefined.[5] The critical values are the values of the function at the critical points.
A critical point (where the function is differentiable) may be either alocal maximum, alocal minimum or asaddle point. If the function is at least twice continuously differentiable the different cases may be distinguished by considering theeigenvalues of theHessian matrix of second derivatives.
A critical point at which the Hessian matrix isnonsingular is said to benondegenerate, and the signs of theeigenvalues of the Hessian determine the local behavior of the function. In the case of a function of a single variable, the Hessian is simply thesecond 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 aninflection point, but may also be anundulation point, which may be a local minimum or a local maximum.
For a function ofn variables, the number of negative eigenvalues of the Hessian matrix at a critical point is called theindex of the critical point. A non-degenerate critical point is a local maximum if and only if the index isn, or, equivalently, if the Hessian matrix isnegative definite; it is a local minimum if the index is zero, or, equivalently, if the Hessian matrix ispositive definite. For the other values of the index, a non-degenerate critical point is asaddle point, that is a point which is a maximum in some directions and a minimum in others.
ByFermat's theorem, all localmaxima 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 requires the solution of asystem of equations, which can be a difficult task. The usualnumerical algorithms are much more efficient for finding local extrema, but cannot certify that all extrema have been found.In particular, inglobal optimization, these methods cannot certify that the output is really the global optimum.
When the function to minimize is amultivariate polynomial, the critical points and the critical values are solutions of asystem of polynomial equations, and modern algorithms for solving such systems provide competitive certified methods for finding the global minimum.
Given adifferentiable map thecritical points off are the points of where therank of theJacobian matrix off is not maximal.[6] The image of a critical point underf is a called a critical value. A point in the complement of the set of critical values is called aregular value.Sard's theorem states that the set of critical values of a smooth map hasmeasure zero.
Some authors[7] give a slightly different definition: acritical point off is a point of where the rank of theJacobian matrix off is less thann. With this convention, all points are critical whenm <n.
These definitions extend to differential maps betweendifferentiable manifolds in the following way. Let be a differential map between two manifoldsV andW of respective dimensionsm andn. In the neighborhood of a pointp ofV and off (p),charts arediffeomorphisms and The pointp iscritical forf 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 IfM is aHilbert manifold (not necessarily finite dimensional) andf is a real-valued function then we say thatp is a critical point off iff isnot asubmersion atp.[8]
Critical points are fundamental for studying thetopology ofmanifolds andreal algebraic varieties.[1] In particular, they are the basic tool forMorse theory andcatastrophe theory.
The link between critical points and topology already appears at a lower level of abstraction. For example, let be a sub-manifold of andP be a point outside The square of the distance toP 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 withBé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.
{{cite book}}
:ISBN / Date incompatibility (help){{cite book}}
:ISBN / Date incompatibility (help)CS1 maint: others (link)