Visual walkthrough — Absolute extrema on closed bounded regions
Our terrain for the whole page:
Let me name every symbol before we use it.
Step 1 — See the terrain and the fence
WHAT. Before any algebra, look at what we're standing on. The rectangle is a flat floor plan; above it sits a curved surface whose height is .
WHY. The Extreme Value Theorem's 2D cousin promises that a continuous height on a closed, bounded field must hit a genuine highest and lowest value somewhere. Our is a polynomial, so it's smooth everywhere — no gaps, no cliffs — so the promise holds. We are allowed to go hunting; a treasure is guaranteed to exist.
PICTURE. The floor is the rectangle; the coloured surface is the height. Notice it dips and rises — our job is to find the extreme dips and rises without checking infinitely many points.

The whole strategy: the top/bottom can only hide in two kinds of place — a flat dimple inside the fence, or somewhere on the fence. So we search those two, and nowhere else.
Step 2 — Hunt the flat spots inside (the gradient)
WHAT. Inside the field, at a highest or lowest point the ground must be locally flat — the surface has a level tangent plane there. "Flat in both directions" means the two partial slopes are zero.
WHY the gradient? If the gradient arrow were not zero at a spot, you could take a tiny step along it and climb higher — so that spot could not have been the summit. Flat interior extrema therefore force . (See Critical points and gradient.)
For our :
Solve. The second equation gives . Put that in the first: . One flat spot: .
Is it inside the fence? and — yes, strictly inside. ✓ Its height:
PICTURE. The gradient arrows all flow away from the flat point; right at the arrow shrinks to nothing.

Step 3 — Walk the bottom edge
WHAT. Now we walk the fence. On the bottom edge, is stuck at , and only is free to move from to . Freezing one variable turns the surface into a plain 1-variable curve (see Parametrization of curves).
WHY. The boundary is a whole curve of points where the interior "flat" rule doesn't apply — the fence can pin an extreme even when the ground there is sloped. So we must reduce on each edge to a single-variable function and use ordinary 1-D max/min (from Extreme Value Theorem (1D)).
Substitute :
only ever increases on (its slope is positive). So no interior critical point on this edge — the extremes sit at the two endpoints:
PICTURE. The bottom edge lifted into a rising parabola; the max is the right corner.

Step 4 — Walk the top edge
WHAT. Freeze ; slide from to .
WHY. Same reason — reduce to 1-D. This edge is more interesting because the reduced curve actually has a low point inside the interval.
Substitute :
The tidy form says: a bowl bottoming out at , height . Check that it's an interior critical point of the edge: derivative , and ✓. Then the endpoints:
PICTURE. The top edge lifted into a bowl; its lowest touch is at , height .

Step 5 — Walk the left and right edges
WHAT. Two vertical edges left. On the left edge , only moves; on the right edge , only moves.
WHY. Same 1-D reduction; now the other variable is frozen.
Left, :
A straight climbing line — extremes at the ends: , .
Right, :
A straight descending line (slope ) — extremes at the ends: , .
PICTURE. Left edge rises, right edge falls — both are straight ramps, so only their endpoints matter.

Step 6 — Compare every candidate
WHAT. Gather all heights we recorded and simply read off the biggest and smallest.
WHY. We now hold a finite list of suspects. No classifying, no Hessian — direct comparison decides everything. (Comparing beats classifying: the winner might be a boundary corner the Hessian can't even score.)
| Where | Point | Height |
|---|---|---|
| interior flat | ||
| bottom ends | ||
| top | ||
| left end | ||
| right end |
The largest height is ; the smallest is (achieved twice).
PICTURE. The floor plan with every candidate dotted; the winner (max) and the two lowest (min) circled.

Step 7 — The degenerate cases (so you're never surprised)
WHAT. What if the field or function is unusual? Three quick pictures of the edge behaviours.
WHY. The contract: every scenario must be shown, so you never hit one you weren't warned about.
- Flat spot lands outside the fence. If solving gave, say, , you'd discard it — it's not in . The extrema then live entirely on the boundary.
- No interior flat spot at all. Some have everywhere (e.g. ). Then Step 2 yields nothing and all candidates come from the fence.
- Ties. Our min happens at two points, and . That's allowed — "the" minimum is a value; it can be attained in several places.
PICTURE. Left: an outside critical point crossed out. Middle: a tilted plane with no flat spot. Right: two separate spots at the same lowest height.

The one-picture summary
Everything above in a single frame: the field, the one interior flat spot, the four edges each reduced to a 1-D curve, the star on the winner () and dots on the tied minima ().

Recall Feynman: the whole walk in plain words
We had a bumpy sheet stretched over a rectangular fenced yard, and we wanted its highest and lowest points. First we found where the sheet is flat inside the yard by asking "which way is uphill?" — the gradient — and finding the one spot where uphill points nowhere: , height . Then we walked all four sides of the fence. On each side one coordinate is frozen, so the sheet becomes a simple 1-D curve: the bottom was a rising parabola (peaks at the corner , height ), the top was a bowl (touches at ), the left was a rising ramp, the right a falling ramp — ramps only matter at their ends. We wrote down the height at every flat spot and every corner and every edge-dip. Finally we just looked at the list and pointed: highest is at ; lowest is , and it happens at two places, and . No fancy tests — just search inside, walk the fence, and compare.
Connections
- Critical points and gradient — Step 2's flat-spot hunt.
- Extreme Value Theorem (1D) — the 1-D max/min used on every edge.
- Parametrization of curves — freezing one variable per edge.
- Second derivative test (Hessian) — deliberately not used here.
- Lagrange multipliers — an alternative for curved boundaries.
- Closed and bounded sets (topology) — why the whole hunt is guaranteed to succeed.