4.4.10 · D5Multivariable Calculus
Question bank — Gradient as direction of steepest ascent
These items probe the ideas in the parent note: the meaning of (the gradient, the vector of partial derivatives), the directional derivative (valid only for a unit vector , meaning ), its link to the dot product, and how sits against level curves.
True or false — justify
The gradient always points toward the maximum (highest peak) of the function.
False. It points in the direction of locally fastest increase at that one point; it knows nothing about far-away peaks. It's a local slope arrow, not a GPS to the summit.
If at a point, then has a maximum there.
False. A zero gradient means a critical point — could be a max, a min, or a saddle. All you know is that every directional derivative is there, so the surface is momentarily flat.
For a unit , the maximum value of over all such equals .
True. Since (using ) and , the largest value is , hit when aligns with ().
The gradient is tangent to the level curve through a point.
False. It is perpendicular to the level curve. Along the curve doesn't change, so .
If two directions give the same directional derivative, they must be the same direction.
False. is symmetric, so two unit vectors making equal angles on either side of give the same . They're mirror images across the gradient line.
Steepest descent is a different, independent direction that you must compute separately.
False. It is simply , the exact opposite arrow (, ). One computation gives you both.
Doubling every input weight scaling of (replacing by ) changes the direction of steepest ascent.
False. — same direction, twice the length. Direction of steepest ascent is unchanged; only the rate doubles.
(for a unit ) can be negative.
True. If you step "downhill", so ; the most negative it gets is (steepest descent).
Spot the error
" where points the way I want."
Error: isn't a unit vector (). The formula needs , so normalise first: . Otherwise the rate is inflated by a factor of .
"Since points uphill, walking along keeps me on the same contour line."
Error: contour lines are level sets where is constant; walking along maximally changes . The gradient is perpendicular to contours, not along them.
"The directional derivative depends only on the direction, not the point."
Error: is evaluated at the point , so changes as you move . Both the point and the direction matter.
" is the slope in the -direction."
Error: the slope in the -direction is the partial . The magnitude is the maximum slope over all directions, which is generally larger than .
"I found (unit ) but — great."
Error: impossible. No directional derivative from a unit direction can exceed , since . A recomputation is needed.
"The gradient of is a scalar giving the overall steepness."
Error: the gradient is a vector . Its magnitude is the scalar steepness; the vector also carries the direction.
"To get steepest descent I take ."
Error: you can't divide by a vector. Steepest descent is (negate it), and the unit descent direction is .
Why questions
Why must be a unit vector in ?
So the rate is measured per unit of distance travelled. If , the dot product also scales by , mixing "how far" into "how fast".
Why is the steepest ascent direction rather than itself?
The direction is the unit-length version; dividing by strips off the magnitude so you keep only "which way". points the same way but isn't unit length.
Why does perpendicularity to level curves follow from the dot-product formula?
Along a level curve is constant, so its rate of change . A zero dot product (with nonzero vectors) means a angle.
Why do we use the chain rule to derive instead of the limit each time?
The limit would have to be recomputed for every direction. The chain rule expresses once, in terms of partials we already have, valid for all directions.
Why does the gradient descent algorithm step in ?
Because is the direction of fastest decrease, letting the algorithm reduce a loss as quickly as possible per step — see Gradient Descent (Machine Learning).
Why is the maximum rate the magnitude of the gradient, a purely geometric fact?
Because and the biggest can be is ; the direction detail vanishes, leaving just the length .
Edge cases
At a critical point where , what is the direction of steepest ascent?
Undefined. Every direction gives , and is meaningless — the surface is flat to first order in all directions.
For a linear field , how does change from point to point?
It doesn't: everywhere. The steepness and steepest direction are constant across the whole plane (a tilted flat sheet).
If is tiny but nonzero, what does that say about the terrain?
The slope is nearly flat — even the steepest uphill direction rises very slowly. The gradient direction is still well-defined, just short.
Can two perpendicular directions both give positive directional derivatives?
Yes, as long as neither is along a level curve. If lies strictly between them, both make an angle under with , so both .
At a point on a level curve, is zero for the tangent direction only, or for a whole range?
Only for the two tangent directions ( along the curve). Every other direction has , giving a nonzero rate — positive on the uphill side, negative on the downhill side.
What happens to steepest ascent on a perfectly flat region ( everywhere)?
throughout, so there is no direction of increase — every step keeps the same. "Steepest ascent" is vacuous there.
If makes a angle with , what fraction of the maximum rate do you get?
, so exactly half of . Angle alone determines the fraction, independent of how large the gradient is.
Recall One-line self-test
The gradient's direction answers "which way up?"; its length answers "how steep?"; its dot with a unit direction answers "how fast along this way?".
Connections
- Gradient as direction of steepest ascent
- Directional Derivative
- Partial Derivatives
- Multivariable Chain Rule
- Dot Product and Angle
- Level Curves and Contour Maps
- Gradient Descent (Machine Learning)
- Tangent Plane and Linearization