Discussion Topics covered: The gradient vector in 2D and 3D, differentiate-first rule, geometric orthogonality to level curves and level surfaces, tangent planes to implicit surfaces, directional derivatives along arbitrary vectors, unit vector normalization, bounds on rates of change (steepest ascent, steepest descent, zero change), unconstrained critical points, Hessian matrix and discriminant, local extrema and saddle point classification, Extreme Value Theorem on closed and bounded domains, 3-tier boundary search, Lagrange multipliers, geometric tangency, constraint sensitivity and shadow pricing, single-variable definite integrals, u-substitution, area between curves and planar slicing, integration by parts
Part A: Review This Week's Lecture Topics (~30 mins)
The Gradient Vector () & Surface Normal Geometry
- Formulating general gradient vectors for two-variable functions and three-variable functions
- Enforcing the differentiate-first rule: always compute symbolic partial derivatives across the entire domain before substituting specific numerical coordinates to avoid collapsing variable dependencies prematurely
- Interpreting the geometric orthogonality of the gradient:
- In 2D, is strictly perpendicular to the tangent vector of the level curve passing through
- In 3D, acts directly as the surface normal vector orthogonal to the tangent plane of the implicit level surface
- Constructing tangent planes to implicit surfaces using the gradient normal :
Directional Derivatives () & Extremal Rates of Change
- Computing the instantaneous rate of change of a scalar function along an arbitrary trajectory using the gradient dot product:
- Strictly enforcing unit vector normalization: if given an arbitrary direction vector , always construct the unit direction vector ; when given an angle measured counterclockwise from the positive -axis, express
- Determining the extremal bounds of directional change from the geometry of the dot product:
- Maximum Rate of Increase (Steepest Ascent): Occurs when is aligned with (). The direction is and the maximum rate equals
- Maximum Rate of Decrease (Steepest Descent): Occurs when points opposite to (). The direction is and the minimum rate equals
- Zero Instantaneous Change: Occurs when is perpendicular to (), corresponding to trajectories tangential to the local contour level curve
Unconstrained Local Extrema & The Second Derivative Test (Hessian Matrix)
- Locating candidate critical points across open domains where the gradient vanishes simultaneously:
or where either first-order partial derivative fails to exist (points with horizontal tangent planes )
- Computing second-order partial derivatives () and applying Clairaut's Theorem () for smooth surfaces to construct the symmetric Hessian matrix:
- Rigorously classifying stationary points via the Second Derivative Test:
- Local Minimum: and (surface curves upward in all directions like a bowl)
- Local Maximum: and (surface curves downward in all directions like a dome)
- Saddle Point: (principal curvatures have opposite signs; surface bends upward in one cross-section and downward in another)
- Inconclusive Test: (higher-order analysis or algebraic inspection required)
- Verifying the same-sign condition: when , the inequality guarantees that and always share the exact same algebraic sign
Global Extrema on Compact Domains & Constrained Optimization (Lagrange Multipliers)
- Applying the Extreme Value Theorem (EVT) on compact (closed and bounded) planar regions : every continuous function is guaranteed to achieve an absolute maximum and absolute minimum on
- Executing the systematic 3-tier candidate search strategy:
- Tier 1 (Interior Critical Points): Solve within the strict interior of and discard any roots lying outside the boundary
- Tier 2 (Boundary Edge Parameterization): Parameterize each perimeter segment as a 1D function (e.g., ), find 1D critical points along the edges, or employ Lagrange multipliers on curved perimeter boundaries
- Tier 3 (Corner Vertices): Identify all structural intersections and corner points where boundary curves meet
- Synthesis: Evaluate at all assembled candidate points to identify the largest (global maximum) and smallest (global minimum) values
- Formulating constrained optimization models using the Method of Lagrange Multipliers:
- For an objective function subject to a constraint , extreme values along the constraint occur where level sets of are tangent to the constraint curve:
- Extending to 3D surfaces: subject to
- Resolving non-linear coordinate systems by eliminating or factoring proportional relationships between variables (avoiding division by zero)
- Interpreting the Lagrange multiplier as a quantitative metric of physical system sensitivity and marginal rate of return (shadow pricing):
- For an objective function subject to a constraint , extreme values along the constraint occur where level sets of are tangent to the constraint curve:
Part B: Next Week's Prerequisite Refresher (~30 mins)
Review the following prerequisite single-variable integration and planar geometry skills required for Double Integrals (Session 14):
- Definite Integrals & The Fundamental Theorem of Calculus
- Evaluating single-variable definite integrals using power, exponential, and trigonometric antiderivatives
- Holding inactive variables strictly constant during partial integration (e.g., evaluating while treating as an inert scalar)
- The Substitution Rule (-Substitution for Definite Integrals)
- Recognizing composite integrands where an outer factor is proportional to the inner derivative:
- Transforming upper and lower integration limits to the -domain ( and ) for clean evaluation in iterated integrals
- Area Between Curves & Planar Region Slicing (Type I & Type II Integration)
- Partitioning 2D regions into vertical strips (: ) vs. horizontal strips (: )
- Determining outer constant integration limits by solving simultaneous boundary curve intersections
- Establishing the geometric foundation for Type I () and Type II () double integral setups and order-switching protocols
- Integration by Parts (Single-Variable Mechanics for Iterated Integrals)
- Applying using the LIATE selection hierarchy to evaluate algebraic-transcendental products (such as and ) encountered in outer iterated integrals
Part C: General Q/A
Open the floor to questions from students regarding any topic