For smooth compactly supported , multiply by . The removed term has norm , while its gradient terms are in dimension three. Thus it tends to zero in . Density then proves .
Gradient boosting initializes a constant score and iterates: compute logistic negative gradients (for loss ), fit the base regressor to these pseudo-responses, choose a line-search step, and set . For a stump , sort each coordinate once. Sweeping the split positions while maintaining left and right sums gives the optimal and squared error in per coordinate, hence overall.
The gradient of the given polynomial is
Its second component vanishes when or . The first component then gives exactly three critical points:
The Hessian matrix and its determinant are
At the Hessian matrix is , whose positive definiteness proves a strict local minimum by the second-derivative test. At its determinant is , so both points are saddle points of a scalar function. Their values and classifications are
There are no local maxima.
At a regular point of the optimization constraint, meaning , the necessary Lagrange multiplier condition is
Indeed, every allowed tangent vector to the level set satisfies . At a constrained extremum, the directional derivative must vanish too. Thus both gradients are normal to the same tangent line and are parallel. This includes . At a singular point with , the displayed condition need not be necessary; those points require a separate examination.
For , the gradient never vanishes on the circle. The Lagrange multiplier equations are
If , the two possibilities are . If , then , and the first equation gives . Combining this with yields
Put
Both and are positive, giving the other four points and . To classify all six, restrict to the circle by eliminating :
Its derivatives are and . In the interior, and . At either endpoint ; along the circle, has a strict local minimum at the left endpoint and a strict local maximum at the right endpoint. Consequently the six constrained extrema are
The circle is a compact set, so the extreme value theorem guarantees that its global minimum and global maximum occur among these six points. Their values give the corrected sharp bound
The printed lower bound is false. A particularly short counterexample is
The sole local minimum in part (a), , has value , larger than values on this circle; it is therefore not a global minimum. In fact , so has no global minimum on the plane.
Figure 1.
All six extrema on the constraint circle and the corrected minimum of the restricted polynomial
. Details.
Choose in the preceding product rule and apply the divergence theorem. Since , this gives the first of Green's identities:
Here is the outward normal derivative. Interchange and , then subtract. The gradient dot products cancel, yielding the second of Green's identities:
For example, with the needed extensions suffice for these applications of the divergence theorem.
Apply the product rule to each vector component and sum:
Thus the divergence of a scalar field times a vector field contains a divergence term and a dot product with the gradient of the scalar field.
Here is a scalar field: the source's description as a vector field is a typographical slip, since the displayed formula is for its gradient. For cylindrical coordinates, write , . Away from , a local choice of gives the partial derivatives
The chain rule therefore gives
Use the Cartesian coordinates definition and the unit vectors
Collecting their coefficients proves
This is the gradient in cylindrical coordinates. The factor converts a change in angle into a change per unit arc length.
In Cartesian coordinates, write the constant vector as . The product rule and constancy of its components give
The last expression is the dot product with the gradient, so
Write , , and let , and be evaluated at the critical point. Assuming is twice continuously differentiable nearby, the Taylor expansion is
The linear terms vanish because the gradient is zero. For , completing the square gives
Consequently the requested constant is the Hessian determinant
The displayed identity in the question is an identity for the quadratic part; for a general , its right-hand side needs the remainder .
If , the quadratic form is positive for every nonzero . On the unit circle it has a positive minimum, so it dominates the remainder sufficiently near the critical point. Hence the point is a strict local minimum.
If , along the quadratic term is , whereas along it is . Along each line the remainder is of smaller order. Thus values both above and below occur arbitrarily nearby, giving a saddle point.
The ellipsoid is the level set . Its gradient is , which never vanishes on the ellipsoid. Half this gradient gives the outward normal vector
This normal vector remains valid at , where the given parametrization is singular.
Expanding and taking partial derivatives gives the gradient and Hessian matrix
At , these are and
Thus the Newton step solves
The second equation gives ; substituting into the first gives . Hence
At , however,
The eigenvalues of this Hessian matrix are in direction and in direction . It is invertible but indefinite. Thus the Newton step is zero, and
This illustrates that stationary points are fixed points of Newton's method. Here the fixed point is a saddle point of a scalar function, not a local minimum. Indeed, direct substitution along the two eigenvector directions gives
For sufficiently small nonzero , one direction decreases and the other increases it. The global minimum is instead zero: the sum of squares vanishes at and . These are the only real zeros, since and imply . Thus a zero gradient is an insufficient stopping certificate for minimization problem without classifying the stationary point.
For an unconstrained differentiable function of two real variables, an interior local minimum must solve the simultaneous stationary point equations
Apply Newton's method in optimization to this gradient equation. The Jacobian matrix of the gradient is the Hessian matrix
At , solve the linear system , then set . When the Hessian matrix is invertible, this is
This follows by setting the first order Taylor expansion equal to zero. Solving the linear system avoids explicitly computing a matrix inverse. A stationary point need not be a local minimum: for example, a positive-definite matrix suffices to classify a stationary point as a strict local minimum, whereas an indefinite Hessian matrix identifies a saddle point of a scalar function.
The mass density depends only on , so it has spherical symmetry. For this isolated planet, choose the Newtonian gravitational potential to vanish at infinity, or equivalently choose to do so. There is no imposed external gravitational field. Rotating the mass distribution therefore leaves unchanged: .
The gradient in spherical coordinates consequently has no angular components, and the paper's gravitational potential sign conventions give
At the centre there is no distinguished radial direction, and spherical symmetry makes .
Apply the product rule inside the Cartesian expression for the curl:
The first sum is the gradient of the scalar field and the second is the curl of the vector field. Thus the curl product rule for a scalar field is
The trigonometric identity
shows that only angular Fourier modes and are required. Differentiating the harmonic expansion on a disk at multiplies the coefficient of each nonconstant Fourier mode by . Thus and , giving
Each term is a regular harmonic function, and the radial derivative is
The Neumann compatibility condition for Laplace's equation holds because
as is necessary by the divergence theorem applied to the gradient of a harmonic function.
The additive constant is undetermined. This Neumann boundary condition is unchanged by , so the paper's blanket uniqueness assertion requires a normalization in this case. The uniqueness of the Neumann problem gives uniqueness up to a constant; prescribing , or zero mean temperature, selects the displayed answer with .
To find a critical point, apply multivariable Newton iteration to the gradient, rather than to the scalar value . The gradient and Hessian matrix are
Write the correction as . At , Newton's method in optimization requires
Subtracting the second equation from the first gives , so and . Hence
The gradient there is
A critical point has not been found after one iteration.
At the alternative starting point , the Hessian matrix and gradient are
The correction would need to satisfy and simultaneously. This linear system is inconsistent. The standard iteration cannot take even its first step: the Hessian matrix is a singular matrix, and the required correction does not exist. This is a Newton correction compatibility condition failure, not merely an ambiguity between several corrections.
Apply the divergence theorem to . The product rule gives
because the two gradient inner products cancel. Also . Thus
This is Green's second identity, under the usual regularity assumptions permitting these derivatives and boundary integrals.
For each of the three constant Cartesian unit vectors , apply the divergence theorem to the vector field . Its divergence is , so
These are precisely the three components of
Thus the volume integral of the gradient is the boundary surface integral weighted by the vector surface element . The regularity needed here is that be continuously differentiable on a neighbourhood of the closure of .
The curl is
To establish that is a conservative vector field, construct a potential of a conservative vector field directly:
This gradient calculation is valid on all of , and hence also on the cone. The explicit potential of a conservative vector field supplies the required global justification.