Loading…
Loading…
Three variable Jacobians Taylor approximation and extrema
A planar Hessian determinant test is not automatically a three-dimensional test. In three variables, vector-output Jacobians compose coordinate changes, the Hessian controls all spatial directions, and constrained extrema require every feasible boundary case. We work through these tools with explicit three-dimensional examples.
For defined on an open set, the Jacobian is the matrix whose entry is . For maps it is the derivative in
Composing with a differentiable map gives . The proof substitutes one linear approximation into the other, using that the intermediate increment is . Dimensions specify the correct matrix order.
For a scalar field and trajectory ,
Direct substitution gives , confirming the derivative. The rate along the moving trajectory is not a single partial derivative.
For near , its Hessian has entries and is symmetric. Restricting to and integrating twice gives
If the Hessian operator norm is bounded by along the segment, the first-order error is at most . The proof uses the integral remainder , so all directions are controlled together.
For the quadratic field above at , the value is 6, gradient and Hessian . The increment is exactly
There is no higher-order remainder because the function is quadratic. For displacement , the linear prediction is 0.12 and the quadratic correction is 0.0036, giving exact change 0.1236.
At an interior differentiable extremum, all three partial derivatives vanish. At a stationary point of a function, with , if the symmetric Hessian is positive definite, its quadratic form has a positive minimum on the unit sphere; Taylor's small-o remainder is eventually smaller than that positive quadratic term. This proves a strict local minimum. Negative definite gives a strict local maximum; directions of both signs give a saddle. A semidefinite Hessian is inconclusive.
Positive definiteness can be checked by eigenvalues, completing squares, or Sylvester's criterion: all leading principal minors are positive. The criterion follows from successive square completion, equivalently a positive-diagonal triangular factorization. A positive determinant alone is insufficient in three dimensions: has positive determinant but is indefinite.
For , the unique global minimum is zero at . Its positive-definite Hessian is an independent local check, while the explicit sum of nonnegative squares proves the global result.
Maximize and minimize on , . The feasible set is compact and continuous, so extrema exist. On its boundary, at least one coordinate is zero and ; thus the minimum is zero, attained on all boundary arcs.
At an interior point with positive coordinates, the regular sphere constraint has nonzero gradient. A Lagrange point satisfies
The multiplier condition can be justified directly for this sphere: every vector perpendicular to is tangent to the normalized curve , whose derivative at zero is . An extremum has zero objective derivative in every such direction, so its gradient is parallel to , the constraint normal.
Multiplying the three equations by gives . Since all coordinates and are positive, , so the squared coordinates agree. Nonnegativity and the constraint force , with volume 1. Comparing with the boundary values proves this is the global maximum. The multiplier equations alone would not have supplied the minimum on boundary arcs.
Let be a real symmetric matrix and let be its leading determinant. Assume first and set with . Completing the first square gives
Direct expansion gives ; subtracting multiples of the first row in the determinant gives . If also , complete one more square:
where is the first linear expression above. These triangular linear coordinates are invertible. Therefore all three positive minors imply positive definiteness. Conversely, positive definiteness first gives . Restrict to and choose to make ; positivity for gives . Finally take and choose successively to kill the first two squares. Positivity gives . This proves necessity as well as sufficiency in the stated real symmetric three-dimensional setting.
The Taylor formula and its uniform little-o bound are exactly the general finite-dimensional estimate proved in the earlier optimization chapter, with . Its first-order error bound follows there from the same integral identity. Neither statement needs a third derivative.
E1 Jacobian. For , find its Jacobian and the gradient of at .
E2 Sphere. Maximize and minimize on .
E3 Saddle. Classify the origin for using explicit directional changes rather than only a determinant.
E4 Simplex. Find maximum and minimum of on , , including all boundary possibilities.
S1. . Since the gradient is , at the point it is . Expanding the squared norm verifies the result.
S2. Cauchy–Schwarz gives absolute value at most . Maximum 3 occurs at and minimum at its negative. These vectors lie on the unit sphere, so the bound is attained.
S3. Along the value is for nonzero ; along it is . Both approaches tend to the origin, so it is a saddle despite the nonnegative term.
S4. Boundary values are zero. In the positive interior, Lagrange gives , hence and value 8. Compactness ensures extrema exist, so comparison gives maximum 8 at that point and minimum 0 on the boundary. No unexamined negative-coordinate candidates are feasible.
Three-variable calculus requires matrix shapes and quadratic directions appropriate to three dimensions. Taylor controls simultaneous spatial changes, while Hessian definiteness—not determinant alone—classifies regular critical points. Compactness, regular constraints and explicit boundary comparison complete a global optimization argument.
This section can be read on its own.