4.4.14Multivariable Calculus

Absolute extrema on closed bounded regions

1,695 words8 min readdifficulty · medium

WHY this works at all

WHY do we need both "closed" AND "bounded"?

  • Drop bounded: on D=R2D=\mathbb{R}^2, f=xf=x has no max — it runs off to ++\infty.
  • Drop closed: on the open disk x2+y2<1x^2+y^2<1, f=xf=x never reaches its sup 11 (the boundary point is excluded).

Both conditions plug the "escape routes" — value can't run to infinity, and can't sneak toward a missing edge.


HOW: the algorithm

WHY no second-derivative test here? Because we have a finite list of candidate points and we just compare actual values. We never need to classify saddle vs. extremum — direct comparison wins.

Figure — Absolute extrema on closed bounded regions

Worked Example 1 — over a rectangle

Find the absolute extrema of f(x,y)=x22xy+2yf(x,y)=x^2-2xy+2y on D={0x3, 0y2}D=\{0\le x\le 3,\ 0\le y\le 2\}.

Step 1 — interior. fx=2x2y=0,fy=2x+2=0.f_x = 2x-2y=0,\qquad f_y=-2x+2=0. Why this step? Interior extrema need a flat tangent plane, so set both partials to 00. From fyf_y: x=1x=1. From fxf_x: y=x=1y=x=1. Point (1,1)(1,1) is inside DD. ✓ f(1,1)=12+2=1f(1,1)=1-2+2=1.

Step 2 — boundary (4 edges). Why? The fence may hold the extremum even if interior is flat-free.

  • Bottom y=0, 0x3y=0,\ 0\le x\le 3: f=x2f=x^2. Increasing → check ends: f(0,0)=0f(0,0)=0, f(3,0)=9f(3,0)=9.
  • Top y=2, 0x3y=2,\ 0\le x\le 3: f=x24x+4=(x2)2f=x^2-4x+4=(x-2)^2. Critical x=2x=2: f=0f=0. Ends: f(0,2)=4, f(3,2)=1f(0,2)=4,\ f(3,2)=1.
  • Left x=0, 0y2x=0,\ 0\le y\le 2: f=2yf=2y. Ends: f(0,0)=0, f(0,2)=4f(0,0)=0,\ f(0,2)=4.
  • Right x=3, 0y2x=3,\ 0\le y\le 2: f=96y+2y=94yf=9-6y+2y=9-4y. Decreasing → ends: f(3,0)=9, f(3,2)=1f(3,0)=9,\ f(3,2)=1.

Step 3 — compare. Candidate values: {1, 0, 9, 0, 4, 0, 4, 9, 1}\{1,\ 0,\ 9,\ 0,\ 4,\ 0,\ 4,\ 9,\ 1\}. abs max=9 at (3,0);abs min=0 at (0,0) and (2,2).\boxed{\text{abs max}=9 \text{ at }(3,0);\qquad \text{abs min}=0 \text{ at }(0,0)\text{ and }(2,2).} Why this step? We just pick biggest and smallest from the finite candidate list.


Worked Example 2 — over a disk (use Lagrange / parametrize)

Find absolute extrema of f(x,y)=x2+y2xy+1f(x,y)=x^2+y^2-x-y+1 on the disk x2+y21x^2+y^2\le 1.

Step 1 — interior. fx=2x1=0x=12,fy=2y1=0y=12.f_x=2x-1=0\Rightarrow x=\tfrac12,\qquad f_y=2y-1=0\Rightarrow y=\tfrac12. Is (12,12)(\tfrac12,\tfrac12) inside? 14+14=12<1\tfrac14+\tfrac14=\tfrac12<1 ✓. f(12,12)=14+141212+1=12.f(\tfrac12,\tfrac12)=\tfrac14+\tfrac14-\tfrac12-\tfrac12+1=\tfrac12.

Step 2 — boundary x2+y2=1x^2+y^2=1. Substitute x2+y2=1x^2+y^2=1: f=1xy+1=2(x+y).f = 1 - x - y + 1 = 2-(x+y). Why this step? The constraint kills the quadratic terms, leaving a clean linear thing. Parametrize x=cost, y=sintx=\cos t,\ y=\sin t: f=2(cost+sint)=22sin(t+π4)f=2-(\cos t+\sin t)=2-\sqrt2\sin(t+\tfrac\pi4). Since sin\sin ranges in [1,1][-1,1]: fmaxbdry=2+2  (at x=y=12),fminbdry=22.f_{\max}^{bdry}=2+\sqrt2\ \ (\text{at }x=y=-\tfrac1{\sqrt2}),\qquad f_{\min}^{bdry}=2-\sqrt2.

Step 3 — compare. Values: interior 0.50.5, boundary 220.5862-\sqrt2\approx 0.586, 2+23.4142+\sqrt2\approx 3.414. abs max=2+2;abs min=12 at (12,12).\boxed{\text{abs max}=2+\sqrt2;\qquad \text{abs min}=\tfrac12 \text{ at }(\tfrac12,\tfrac12).}


Common Mistakes


Recall Feynman: explain to a 12-year-old

Imagine a bumpy trampoline stretched over a fenced backyard. You want the highest and lowest points of the trampoline. There are only two kinds of spots that can be highest/lowest: a flat dimple inside the yard, or somewhere along the fence. So you mark all the flat dimples, then walk all the way around the fence marking the bumps there, and finally you stand back and point at the very top and very bottom of everything you marked. Done!


Flashcards

Which theorem guarantees an absolute max & min exists?
Extreme Value Theorem — for ff continuous on a closed and bounded set DD.
What two properties must DD have for guaranteed extrema?
Closed (contains boundary) and bounded (fits in a disk).
Why does an interior extremum force f=0\nabla f=0?
If f0\nabla f\neq 0 you could move along +f+\nabla f to increase ff, so it wasn't a max (similarly for min).
The 3-step recipe for absolute extrema?
(1) Interior critical points f=0\nabla f=0 inside DD; (2) reduce ff on boundary to 1-var, find crit pts + endpoints/corners; (3) compare all values.
Do we use the Hessian second-derivative test for absolute extrema?
No — we just compare actual function values at a finite candidate list.
On the boundary of a disk x2+y2=1x^2+y^2=1, what trick simplifies ff?
Substitute the constraint and/or parametrize x=cost, y=sintx=\cos t,\ y=\sin t to make it 1-variable.
Why must corners/endpoints be included as candidates?
A 1-var function on a closed interval can attain extrema at its endpoints, not only where the derivative is zero.
In Example 1, where was the absolute max and what value?
99 at (3,0)(3,0), on the boundary (not the interior critical point).

Connections

  • Critical points and gradient — interior step solves f=0\nabla f=0.
  • Second derivative test (Hessian) — used for local classification, not here.
  • Lagrange multipliers — alternative way to handle the boundary constraint.
  • Extreme Value Theorem (1D) — the single-variable ancestor of this method.
  • Closed and bounded sets (topology) — why the guarantee needs both.
  • Parametrization of curves — turning a boundary into a 1-var problem.

Concept Map

guarantees

required by

required by

located in

located on

found by solving

justified by

reduced to

check

candidates for

candidates for

largest is

smallest is

Extreme Value Theorem 2D

Abs max and min exist

Closed contains boundary

Bounded fits in disk

Interior critical points

Boundary

grad f = 0

Nonzero gradient increases f

Single-variable problem

Critical points and corners

Compare all values

Absolute maximum

Absolute minimum

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Dekho, idea bahut simple hai. Jab function f(x,y)f(x,y) continuous ho aur region DD closed aur bounded ho (matlab fence band hai aur infinitely bada nahi hai), to ek absolute maximum aur ek absolute minimum zaroor milega — Extreme Value Theorem guarantee deta hai. Socho ek bumpy chaadar ek fenced maidan ke upar tani hui hai; sabse uncha point aur sabse neecha point kahin na kahin hoga hi.

Ab woh point kahan chhup sakta hai? Sirf do jagah: ya to interior ke andar koi flat dimple (jahan f=0\nabla f=0, dono partial derivatives zero), ya phir boundary (fence) pe. Isliye trick yeh hai — pehle andar ke critical points nikaalo (fx=0,fy=0f_x=0, f_y=0) aur dekho woh region ke andar hain ya nahi. Phir boundary ko ek-ek karke single variable problem bana lo (rectangle ke edges pe substitute karo, ya circle pe x=cost,y=sintx=\cos t, y=\sin t daal do) aur uske critical points + corners/endpoints bhi nikaalo. Yeh corner wala part log bhool jaate hain — yahin se marks katte hain!

Last step sabse aasaan: saare candidate points pe ff ki value nikaalo aur compare karo. Sabse badi value = absolute max, sabse choti = absolute min. Yahan Hessian / second derivative test ki zaroorat nahi — woh sirf local classification ke liye hota hai. Yahan to seedha values compare karke winner choose kar lete hain. Mnemonic yaad rakho: IBC — Interior, Boundary, Compare. Bas itna hi.

Go deeper — visual, from zero

Test yourself — Multivariable Calculus

Connections