Applications of Differentiation
With the differentiation rules in hand, the derivative becomes a tool for understanding the behavior of functions: where they rise and fall, where they bend, and where they reach their largest or smallest values. This chapter develops the theory that locates extreme values, relates a function's shape to its first and second derivatives, evaluates stubborn limits, sketches curves, solves practical optimization problems, approximates roots numerically, and reverses differentiation through antiderivatives.
Maximum and Minimum Values
Many practical problems reduce to finding the best possible outcome: the cheapest can, the greatest area, the fastest route. Each of these is an optimization problem, and each comes down to locating the maximum or minimum value of a function. We begin by defining precisely what those extreme values are.
Absolute (Global) Extrema
A function \(f\) has an absolute maximum at \(c\) if \(f(c)\ge f(x)\) for every \(x\) in the domain; the number \(f(c)\) is the maximum value. It has an absolute minimum at \(c\) if \(f(c)\le f(x)\) for every \(x\) in the domain. Together these are the extreme values of \(f\).
Local (Relative) Extrema
A function \(f\) has a local maximum at \(c\) if \(f(c)\ge f(x)\) for all \(x\) in some open interval containing \(c\), and a local minimum at \(c\) if \(f(c)\le f(x)\) nearby. A local extreme value is "best" only in its immediate neighborhood, not necessarily over the whole domain.
Figure 4.1.1 A function whose absolute minimum occurs at the endpoint \(a\) and whose absolute maximum occurs at the interior point \(d\). Interior peaks and valleys (at \(b\) and \(e\)) are local extrema.
If \(f\) is continuous on a closed interval \([a,b]\), then \(f\) attains an absolute maximum value \(f(c)\) and an absolute minimum value \(f(d)\) at some numbers \(c\) and \(d\) in \([a,b]\).
Both hypotheses matter. A discontinuous function on a closed interval, or a continuous function on an open interval, may fail to attain an extreme value, so neither continuity nor closedness can be dropped.
If \(f\) has a local maximum or minimum at \(c\), and if \(f'(c)\) exists, then \(f'(c)=0\).
The converse is false: \(f'(c)=0\) does not guarantee an extreme value (consider \(f(x)=x^3\) at the origin), and an extreme value can occur where \(f'\) fails to exist (consider \(f(x)=|x|\) at the origin). Fermat's Theorem therefore tells us only where to look.
Critical Number
A critical number of \(f\) is a number \(c\) in the domain of \(f\) at which either \(f'(c)=0\) or \(f'(c)\) does not exist. By Fermat's Theorem, every local extremum occurs at a critical number — though not every critical number produces an extremum.
To find the absolute extrema of a continuous function on a closed interval, we need only compare values at the critical numbers and at the endpoints.
To find the absolute maximum and minimum of a continuous \(f\) on \([a,b]\):
- Evaluate \(f\) at every critical number in \((a,b)\).
- Evaluate \(f\) at the endpoints \(a\) and \(b\).
- The largest of these values is the absolute maximum; the smallest is the absolute minimum.
In every real design problem, check the endpoints first — students lose marks by hunting only for \(f'(x)=0\) and forgetting that the global optimum of a bounded design (a beam length, a tank radius constrained to a range) very often sits right on the boundary, exactly as the maximum did in Example 2.
The Mean Value Theorem
Much of this chapter rests on a single central result that connects a function's average rate of change to its instantaneous rate of change. To reach it we first need a special case due to Rolle.
Let \(f\) satisfy three hypotheses: (1) \(f\) is continuous on \([a,b]\); (2) \(f\) is differentiable on \((a,b)\); (3) \(f(a)=f(b)\). Then there exists a number \(c\) in \((a,b)\) with \(f'(c)=0\).
Geometrically, if a smooth curve returns to its starting height, it must level off somewhere between — there is at least one horizontal tangent.
Let \(f\) be continuous on \([a,b]\) and differentiable on \((a,b)\). Then there exists a number \(c\) in \((a,b)\) such that
The slope of the secant line through \(\big(a,f(a)\big)\) and \(\big(b,f(b)\big)\) equals the slope of the tangent at some interior point — the tangent there is parallel to the secant.
Figure 4.2.1 The Mean Value Theorem guarantees an interior point \(c\) where the tangent line is parallel to the secant joining the endpoints.
If \(f'(x)=0\) for all \(x\) in an interval \((a,b)\), then \(f\) is constant on \((a,b)\).
Corollary. If \(f'(x)=g'(x)\) for all \(x\) in \((a,b)\), then \(f-g\) is constant; that is, \(f(x)=g(x)+c\). This corollary underlies the entire theory of antiderivatives in Section 4.9.
The MVT is the engineer's bridge between data and rates. If a vehicle covers 180 km in 2 hours, the speedometer must have read 90 km/h at some instant. Whenever you only know endpoints but need to argue about an instantaneous rate, this is the theorem to reach for.
How Derivatives Affect the Shape of a Graph
The sign of \(f'\) tells us whether a function rises or falls; the sign of \(f''\) tells us how it bends. Together they reveal the complete shape of a graph.
What \(f'\) says about \(f\)
If \(f'(x)>0\) on an interval, then \(f\) is increasing there. If \(f'(x)<0\) on an interval, then \(f\) is decreasing there.
Suppose \(c\) is a critical number of a continuous function \(f\).
- If \(f'\) changes from positive to negative at \(c\), then \(f\) has a local maximum at \(c\).
- If \(f'\) changes from negative to positive at \(c\), then \(f\) has a local minimum at \(c\).
- If \(f'\) does not change sign at \(c\), then \(f\) has no local extremum there.
What \(f''\) says about \(f\)
Concavity
A graph is concave upward on an interval if it lies above all of its tangent lines there, and concave downward if it lies below them. Equivalently, concave upward means the slope \(f'\) is increasing; concave downward means \(f'\) is decreasing.
Inflection Point
A point \(P\) on a curve is an inflection point if the curve is continuous there and changes its direction of concavity at \(P\) (from up to down or down to up). Candidate inflection points occur where \(f''=0\) or where \(f''\) fails to exist.
If \(f''(x)>0\) for all \(x\) in an interval, the graph of \(f\) is concave upward there. If \(f''(x)<0\) throughout an interval, the graph is concave downward there.
Suppose \(f''\) is continuous near \(c\).
- If \(f'(c)=0\) and \(f''(c)>0\), then \(f\) has a local minimum at \(c\).
- If \(f'(c)=0\) and \(f''(c)<0\), then \(f\) has a local maximum at \(c\).
The test is inconclusive when \(f''(c)=0\) or \(f''(c)\) does not exist; fall back on the First Derivative Test.
Figure 4.3.1 The quartic \(y=x^4-4x^3\): a local minimum at \((3,-27)\) and inflection points at \((0,0)\) and \((2,-16)\) where concavity reverses.
When \(f''(c)=0\) the Second Derivative Test is silent — it does not mean "no extremum." Switch to the First Derivative Test (the sign change of \(f'\)) rather than guessing. In practice the First Derivative Test is more reliable and often faster, even where both apply.
Indeterminate Forms and l'Hospital's Rule
A limit of a quotient where both parts approach 0, or both approach \(\infty\), cannot be evaluated by the quotient law — the outcome is a genuine contest between numerator and denominator. l'Hospital's Rule resolves these indeterminate forms systematically.
Indeterminate Forms of Type \(\tfrac{0}{0}\) and \(\tfrac{\infty}{\infty}\)
A limit \(\displaystyle\lim_{x\to a}\frac{f(x)}{g(x)}\) is an indeterminate form of type \(\tfrac{0}{0}\) if both \(f(x)\to 0\) and \(g(x)\to 0\), and of type \(\tfrac{\infty}{\infty}\) if both grow without bound. The value, if it exists, is not determined by the form alone.
Suppose \(f\) and \(g\) are differentiable with \(g'(x)\ne 0\) near \(a\) (except possibly at \(a\)), and the quotient is of type \(\tfrac{0}{0}\) or \(\tfrac{\infty}{\infty}\). Then
provided the limit on the right exists (or is \(\pm\infty\)). The rule also holds for one-sided limits and limits at \(\pm\infty\). Differentiate numerator and denominator separately — this is not the Quotient Rule.
Other Indeterminate Forms
Products of type \(0\cdot\infty\), differences of type \(\infty-\infty\), and powers of type \(0^0\), \(\infty^0\), and \(1^\infty\) are first rewritten — as a quotient, over a common denominator, or via the identity \(\big[f(x)\big]^{g(x)}=e^{\,g(x)\ln f(x)}\) — to produce a \(\tfrac{0}{0}\) or \(\tfrac{\infty}{\infty}\) form to which the rule applies.
Always confirm the form before differentiating. A classic trap: \(\displaystyle\lim_{x\to\pi^-}\frac{\sin x}{1-\cos x}\) looks like a candidate, but the denominator approaches \(2\), not \(0\) — the limit is simply \(0/2=0\). Blindly applying the rule gives the wrong answer. Check, then differentiate.
Summary of Curve Sketching
Sketching a curve by hand assembles everything from earlier chapters and sections — domain, symmetry, asymptotes, increase and decrease, concavity — into one disciplined checklist. Calculus reveals features (exact extrema, inflection points) that a graphing device alone can easily hide.
- Domain. Determine the set of \(x\) for which \(f\) is defined.
- Intercepts. The \(y\)-intercept is \(f(0)\); find \(x\)-intercepts by solving \(f(x)=0\).
- Symmetry. Test for even (\(f(-x)=f(x)\)), odd (\(f(-x)=-f(x)\)), or periodic behavior.
- Asymptotes. Horizontal from \(\lim_{x\to\pm\infty}f\); vertical where \(f\to\pm\infty\); slant when the numerator degree exceeds the denominator by one.
- Intervals of increase/decrease. Use the sign of \(f'\) (I/D Test).
- Local extrema. Apply the First (or Second) Derivative Test at critical numbers.
- Concavity and inflection points. Use the sign of \(f''\).
- Sketch. Draw asymptotes, plot key points, and connect respecting all of the above.
Slant (Oblique) Asymptote
The line \(y=mx+b\) is a slant asymptote of \(y=f(x)\) if \(\displaystyle\lim_{x\to\infty}\big[f(x)-(mx+b)\big]=0\). For a rational function whose numerator has degree exactly one more than the denominator, long division produces the equation of the slant asymptote directly.
Run the checklist in order and resist the urge to skip steps you "already see." Symmetry, in particular, halves your work: spotting that a function is even or odd means you only analyze half the domain and reflect. Calculators miss the small, exact features — that is precisely why we sketch by hand first.
Graphing with Calculus and Calculators
Here the order is reversed: we begin with a machine-produced graph and then use calculus to refine it, choosing viewing rectangles intelligently and confirming the features the device suggests. Calculus and the calculator work best in tandem.
The Role of the Viewing Rectangle
A single viewing window rarely shows everything. A window wide enough to capture end behavior often hides fine detail near the origin, while a close-up may miss large-scale structure. The strategy is to combine several windows, guided by calculus, rather than trusting any one automatic plot.
Confirming Features with Derivatives
Graphs of \(f'\) and \(f''\) pin down the exact locations of maxima, minima, and inflection points that a raw plot only hints at. Where \(f'\) changes sign, \(f\) has an extremum; where \(f''\) changes sign, the concavity reverses. These derivative graphs make small or hidden features unmistakable.
Families of Functions
When a formula contains a parameter, graphing several members reveals how the graph evolves and exposes transitional values — values of the parameter at which the basic shape changes (for example, where the number of asymptotes, critical numbers, or inflection points jumps). Studying \(f(x)=\dfrac{1}{x^2+2x+c}\) shows a transition at \(c=1\): two vertical asymptotes for \(c<1\), one at \(c=1\), and none for \(c>1\).
Treat the calculator as a fast first draft, never the final word. The bullet points it shows can be off by whole features. Differentiate, find where \(f'\) and \(f''\) vanish, and you turn an approximate picture into exact, defensible results — which is what you'll be graded on and what a design review will demand.
Optimization Problems
The extreme-value methods of this chapter shine in applied problems: minimizing cost, maximizing area or profit, finding the quickest route. The hard part is usually translation — turning a verbal description into a function of one variable to be optimized.
- Understand the problem: identify the unknown, the given data, and the conditions.
- Draw a diagram and label it.
- Introduce notation: name the quantity \(Q\) to be optimized and the other variables.
- Express \(Q\) in terms of those variables.
- Reduce to one variable using the constraints, then state the domain.
- Optimize with the methods of Sections 4.1 and 4.3 (Closed Interval Method when the domain is closed).
Let \(c\) be a critical number of a continuous \(f\) on an interval. If \(f'(x)>0\) for all \(x
Step 5 — reducing to one variable using the constraint — is where most of the marks live. Write the constraint equation explicitly before optimizing, and always state the domain. The "can with height equal to diameter" result in Example 2 is the classic engineering benchmark; real cans differ because manufacturing and material-waste costs add terms the pure-geometry model ignores.
Newton's Method
Most equations cannot be solved by formula. Newton's method (the Newton–Raphson method) approximates a root by repeatedly following the tangent line down to the axis — the engine inside most numerical root-finders.
The Idea
Starting from an approximation \(x_n\), replace the curve by its tangent line at \(\big(x_n,f(x_n)\big)\). Because a line is easy to solve, its \(x\)-intercept \(x_{n+1}\) is taken as the next, usually better, approximation. Iterating produces a sequence that, under favorable conditions, converges rapidly to a root.
Figure 4.8.1 Each step follows the tangent at \(\big(x_n,f(x_n)\big)\) to its \(x\)-intercept \(x_{n+1}\), driving the approximation toward the true root \(r\).
The method is powerful but not foolproof. It can fail or stall when \(f'(x_n)\) is near zero (a nearly flat tangent throws the next guess far away) or when a poor starting point sends iterates outside the domain. Always sketch or plot first to choose a sensible \(x_1\), and verify convergence by watching successive values settle.
Antiderivatives
Differentiation has an inverse problem: given a rate, recover the quantity. A physicist with a velocity wants position; an engineer with a leak rate wants total volume lost. The function whose derivative is the given one is its antiderivative — the gateway to integration.
Antiderivative
A function \(F\) is an antiderivative of \(f\) on an interval \(I\) if \(F'(x)=f(x)\) for all \(x\) in \(I\). Antiderivatives are not unique: adding any constant gives another.
If \(F\) is an antiderivative of \(f\) on an interval \(I\), then the most general antiderivative on \(I\) is \(F(x)+C\), where \(C\) is an arbitrary constant. This follows from the Constant Function Corollary of Section 4.2: any two antiderivatives of \(f\) differ by a constant.
Differential Equation and Initial Condition
An equation involving a function's derivatives is a differential equation; its general solution carries arbitrary constants. An initial condition — a known value such as \(f(0)\) — fixes those constants and selects the one particular solution that fits.
Never drop the constant of integration — it is not optional. In motion problems each antidifferentiation introduces one constant, and you need exactly as many initial conditions as constants to pin down the answer (two integrations of acceleration require both \(v(0)\) and \(s(0)\)). This is the conceptual seed of the definite integral in the next chapter.