The contour plot is symmetric under either or , because depends only on their squares. Denote the three critical heights by , and , where .
For , the level set consists of separate closed curves around the two minima. At the branches meet at the two saddle points. For , there is an inner closed curve surrounding the local maximum and an outer closed curve surrounding all five stationary points. At the inner curve shrinks to the origin; for only the outer closed curve remains. At each saddle point the critical level set crosses in the two directions determined byThe figure plots representative level sets, including the critical saddle height; its second panel adds the gradient directions requested below.
The gradient is orthogonal to each regular level set and points towards increasing . Near either minimum, the linear approximation is , so arrows point away from the point. Near the maximum at the origin it is , so arrows point inwards. Near either saddle point it is : arrows point towards the vertical axis horizontally and away from the saddle vertically.
On the horizontal axis the gradient is . Its arrows point left on , right on , left on , and right on . On the vertical axis it isConsequently its arrows point down on , up on , down on , and up on . These directions, and representative arrows near each stationary point, appear in the right-hand panel. The gradient itself is zero at all five stationary points.
For a differentiable objective and regular constraint , a constrained stationary point satisfieswhere is a Lagrange multiplier. Solve these equations for both the coordinates and .
Geometrically, the gradient is normal to the constraint level set when . Every feasible infinitesimal displacement is tangent to that level set, so . At a constrained stationary point, the directional change must also vanish for every such tangent displacement. Thus is normal to the same tangent plane and is a scalar multiple of . This is the geometric basis of the Lagrange multiplier method.
For a second constraint , with linearly independent vectors and , the feasible tangent directions are perpendicular to both. Their normal space is the linear span of these two gradients, so introduce a second Lagrange multiplier:These equations find candidates; deciding whether they are maxima, minima or saddle points requires further analysis. Constraint points where the required gradient independence fails must be examined separately.
In the translated coordinates , , the zero level set is the pair of lines and . The function is positive in the quadrants and negative in those with , and tends to zero as . Thus its nonzero contours form closed curves around the four off-centre stationary points.
For an explicit description of the contour plot, use polar coordinates , :At fixed direction within a quadrant, the magnitude increases until and then decreases towards zero. Also , with equality exactly when , and similarly for . Consequently ; each positive level below encloses a positive peak in each positive quadrant, with the analogous negative contours in the negative quadrants.
To classify the stationary points, the Hessian matrix isAt it is , with eigenvalues and , so is a saddle point. At it is . Therefore and are strict local maxima, and and are strict local minima. These are also global maxima and minima by the bound just proved.
Contours and gradient directions near all five stationary points in Question 16
. Details. The gradient isIt is perpendicular to each nonzero level set and points towards increasing . Near the two positive local maxima, the Hessian matrix is , so the gradient arrows point inward. Near the two negative local minima, the Hessian matrix is , so they point outward. These arrows are shown on the figure in part (c).
At the saddle point, . Along , the arrows point away from the centre on both sides; along , they point towards the centre on both sides. On the positive axis they point up, on the negative axis down, on the positive axis right, and on the negative axis left. This specifies the four intervening sectors of the gradient pattern.
For a harmonic function, put and . Since , its Hessian matrix isA nonzero determinant is therefore negative, and the two real Hessian eigenvalues are . At a stationary point the quadratic term of the Taylor expansion has both signs. Consequently every such nondegenerate stationary point is a saddle point. This is the nondegenerate stationary points of a planar harmonic function criterion. The same argument applies to , whose stationary points coincide with those of . A zero Hessian determinant is outside this second-order classification.
A saddle point of the exponential phase occurs where . Hence the only saddle isIt is degenerate: the second phase derivative vanishes there, while the third is . This cubic degeneracy produces the scale. The other endpoint is not a saddle, since the phase derivative there is .
The constant term in the spin sum cancels. Linearizing the saddle point equation givesThe paramagnetic auxiliary-field curvature isConsequently the Stoner criterion for the loss of local paramagnetic stability isThe printed uses energy measured from the Fermi level. For a smooth density of states, becomes a narrow unit-area peak at ; a singular density of states or appreciable temperature requires the integral form. The curvature establishes local instability, not the order or location of every possible thermodynamic transition.
With exact spin-rotation symmetry, itinerant ferromagnetism selects a magnetization direction. The two broken transverse generators form one quadratic type-B Goldstone boson, a long-wave ferromagnetic magnon with . Longitudinal amplitude motion is not symmetry-protected to be gapless. In a metallic ordered state, particle-hole excitations remain near each surviving exchange-split Fermi surface; these are distinct from the collective magnon. The itinerant spin-flip particle-hole continuum starts at exchange scale at in this simple mean-field spectrum, while its finite- boundaries differ. Spin anisotropy, spin-orbit coupling or an external field can gap the transverse mode; none is present in the stated model.
Under , , , the thresholds are ordered . As decreases from one, first becomes stable atFor , both boundary equilibria are stable, and the positive coexistence point is a saddle point. Its stable manifold is the separatrix between their basins of attraction. For every fixed , a sufficiently small positive lies in the red-survival basin. To justify the quantifier beyond a neighborhood of , start on the red-only axis: its logistic equation approaches . Continuous dependence over the finite time needed to enter a stable neighborhood shows that sufficiently small positive initial grey populations do so as well.
At the second threshold, meets . For , is a saddle point, its stable manifold is the grey-only axis, and there is no positive coexistence equilibrium. Boundedness and the same Bendixson-Dulac theorem argument rule out an interior cycle. Consequently every initial state with and approaches . This is the removal regime that eliminates grey squirrels regardless of their initial abundance. At threshold equality linearization is nonhyperbolic; the strict parameter intervals above avoid inferring stability from a zero eigenvalue.
The non-axis nullclines are and . For , , the first has intercepts and the second has . Their axis intercept order rules out a positive intersection. Below the first line increases and above it decreases; below the second increases and above it decreases. Thus is a saddle point and is stable.
For strictly positive initial populations, both coordinates stay positive and are bounded above by their individual logistic equations. There are no interior periodic orbits: the Dulac function makes the divergence of the multiplied vector field , so the Bendixson-Dulac theorem applies. The stable manifold of is the invariant red-only axis, and is repelling. The phase portrait, or the Poincaré-Bendixson theorem with these boundary directions, therefore givesThe qualification matters: a grey population identically absent cannot drive extinction. In dimensional variables, positive grey presence leads to , in this no-hunting case.
Abbreviate , . The coordinate factors immediately give the three boundary equilibria . The Jacobian matrix isAt , the eigenvalues are , so it is a repelling equilibrium. At the other two points, triangularity givesTherefore is asymptotically stable for and a saddle point for ; is asymptotically stable for and a saddle point for . Equality gives a zero eigenvalue, so linearization alone is inconclusive there.
For later use, the coexistence point is physically positive exactly when if , or if . Its stability is as supplied in the question. If the displayed formula for does not apply: when also , the coincident non-axis nullclines give a whole segment of equilibria.
Write . The physically nonnegative branches, omitting , areOn both bifurcation diagrams, draw solid for and dashed for ; draw dashed for and solid for . The coexistence branch is dashed throughout its interior because it is a saddle point. It connects at to at , through two transcritical bifurcations when the branches are continued mathematically beyond the nonnegative quadrant.
Stable boundary populations and the unstable coexistence threshold
. Original bifurcation diagrams for , . Solid branches are asymptotically stable, dashed branches unstable. The physically admissible coexistence branch joins the grey-only branch at to the red-only branch at . Details.A critical point requires . Since for every real , the first partial derivative forces . The second then reduces to , so the only critical points are and .
At these points the Hessian matrix is diagonal:The first is a positive-definite matrix, giving a strict local minimum; the second is an indefinite matrix, giving a saddle point. Their values are and . HenceThe minimum is local: along , is unbounded below as .
The gradient vanishes when and . Subtracting these equations gives , so the unique critical point is , with .
The Hessian matrix isIt is indefinite, so the critical point is a saddle point. Explicitly, around that point the change is exactly : it is positive for and negative for . Thus arbitrarily close points have both larger and smaller values.
The critical points satisfy both first partial derivatives equal to zero:Substitute into the second equation to get . Thus the candidates are and .
The Hessian matrix and its determinant areAt the determinant is , so the Hessian matrix is indefinite and the point is a saddle point. At the determinant is and , so the Hessian matrix is positive definite and the point is a strict local minimum, with valueThere is no local maximum. Along , is unbounded above and below, so there are no global extrema either.
The gradient equations areThus gives , while gives . The Hessian matrix isAt both critical points the determinant is , so the Hessian is indefinite and the second-derivative test classifies both as saddle points. Direct substitution givesThe factorization also shows the crossing level-set branches through each saddle.
The gradient vanishes exactly when and , giving the four points . The Hessian matrix is . It is positive definite at , negative definite at , and indefinite at the two mixed-sign points. Thus is a strict local minimum, a strict local maximum, and are saddle points by the second-derivative test. Their respective function values are , , and zero at both saddle points.
Let , so . Its gradient is , andThus a stationary point must have and , giving and . To classify them, useAt either stationary point, and . Hence . The Hessian has one positive and one negative eigenvalue, so both are saddle points. There are no other stationary points.
The stationary point equations give and , hence . At the Hessian matrix has negative determinant , so is a saddle point. At each of and , the Hessian matrix has positive leading minors and , proving a strict local minimum. More strongly,Thus and are exactly the global minima, with value . There are no local maxima, since any differentiable interior local maximum would be a stationary point, and all three have been classified.
The matrix is an invertible matrix. Indeed, on the line spanned by it has eigenvalue , and on it agrees with the positive-definite restriction of . Therefore the full Newton step is well defined and givesThis is the unique stationary point because is an invertible matrix. The algebra applies to every starting point, but it does not make the answer a minimum: for it is the saddle point just classified, and for it is a maximum. A safeguarded minimization algorithm that replaces an indefinite matrix used as its Hessian matrix or damps the step need not take this exact step; the assertion concerns the ordinary full Newton step formula.



