4.1.32 · D5Calculus I — Limits & Derivatives
Question bank — Linear approximation and differentials
Link back to the parent: Linear approximation.
True or false — justify
and always agree exactly at .
True. , the run is zero, so the line and curve touch. The approximation is exact only at the base point.
The approximation gets worse the further is from .
True in general. The leftover error is ; as moves away, grows and stops being tiny, so the straight line drifts off the curving graph.
If is itself a straight line, then for all , not just near .
True. A line's tangent is the line itself; the error term is exactly everywhere because a line has no curvature to peel away.
and are the same number.
False. is the rise along the tangent; is the true rise of the curve. They coincide only for a straight ; otherwise their gap is the curvature error.
You can make the linearization error zero by choosing a smart base point .
False (for a genuinely curved ). A better shrinks the error, but as long as the curve bends between and , a straight line cannot match it exactly.
If , linear approximation is useless.
False. It gives , a flat estimate — perfectly valid, just says " is roughly constant here." It's only crude, because the leading behaviour near a flat point is quadratic, handled by Concavity and second derivative.
Doubling the step roughly doubles the approximation error.
False. The error behaves like (the next Taylor term), so doubling the step roughly quadruples the error. See Taylor series.
must be positive.
False. is any chosen change in ; it can be negative (target to the left of ) or zero. A negative just gives a negative run and a downhill/uphill rise accordingly.
The formula holds only when is increasing.
False. It holds near any point where is differentiable, increasing or decreasing. The sign of only sets whether the tangent rises or falls.
Spot the error
"."
Error: dropped the run. The rise is slope × run , giving . Multiplying the slope by instead of inflates the answer.
", so I just add the slope to the value."
Error: units/dimensions mismatch. You must multiply slope by the run . Slope has units of rise-per-run; alone it isn't a rise. The correct form is .
"To estimate I'll linearize at because is easy."
Error: bad base point. is undefined (infinite slope), and is far from . Choose the nearest easy exact point, .
", and since the true volume error is exactly ."
Error: 'exactly'. is the tangent-line estimate of the error, so , not . The genuine change carries extra and terms.
" works for any ."
Error: only for small . It's the linearization at ; away from the neglected term matters. Try : formula gives , truth is .
"Since , I can use it to estimate ."
Error: isn't small. The approximation is the tangent at ; radians is far away where has curved right past. , not .
" is a great estimate."
Error: overclaimed accuracy. It's the tangent-at-0 value; , so it's off by about — usable but not "great," because isn't tiny. The quadratic term adds .
Why questions
Why do we split the difference quotient as rather than just say it "equals" ?
Because for the quotient is only close to , not equal; the term names that gap, and it as by the limit definition.
Why does the error shrink faster than itself?
The error is — a small factor times a small run — so it's a product of two shrinking things, vanishing faster than either alone.
Why choose the nearest base point where is exact?
Nearest keeps the run tiny, which shrinks the -sized error; exactness keeps and from contributing their own errors.
Why is the tangent line the best straight-line approximation, not just a good one?
It's the unique line matching both (value) and (slope); any other line disagrees in slope, giving error growing linearly in instead of quadratically.
Why write instead of just using directly in error propagation?
Because in a lab you don't know the true error, only a small bound on the input; converts that known input tolerance into an output tolerance via the slope. See Error propagation.
Why does linearizing at give such a clean formula?
Setting collapses the run to just , and , so with nothing to carry.
Why can Newton's method be seen as repeated linear approximation?
Each step replaces by its tangent line and solves the line ; the root of the line is the next guess, so Newton's method is linear approximation iterated toward a zero.
Edge cases
What does linear approximation give when has a vertical tangent at (slope infinite)?
It fails — doesn't exist, so is undefined. Example: at . Pick a base point where the slope is finite.
What happens if is not differentiable at (e.g. a corner like at )?
No single tangent line exists, so there's no linearization at that point. Left and right slopes disagree; you'd need to pick a base point on a smooth stretch.
If the target equals the base point (, so ), what does the estimate give?
Exactly , with zero error — the run is zero, so line and curve coincide. A degenerate but perfectly correct case.
For a concave-up function, is an over- or under-estimate near ?
Under-estimate: a concave-up curve bends above its tangent, so the line sits below the true value. Concave-down flips this — the line over-estimates. Governed by Concavity and second derivative.
If doesn't go to zero as , what has gone wrong?
Then wasn't actually the derivative — the difference quotient isn't converging to it. is precisely the statement that the limit defining exists.
What if you take enormous — is still meaningful?
is always defined (rise on the tangent), but it stops approximating : for large the curve has bent far from the line, so .
Connections
- Derivative as a limit — the statement these traps hinge on.
- Tangent line — the geometric object every "line vs curve" question is about.
- Concavity and second derivative — decides over- vs under-estimate.
- Taylor series — the error term named in several answers.
- Newton's method — repeated linearization.
- Error propagation — why beats using directly.