j-devlog
KO
~/nav

// categories

// tags

[Calculus Bible]

Calculus Bible Chapter 3: Applications of Differentiation

·16 min read·

This post summarizes Chapter 3 of James Stewart's Calculus.

3.1 Maximum and Minimum Values#

Optimization problems ultimately reduce to finding the maximum or minimum value of a function. (p.150)

Let cc be a number in the domain DD of ff. Then for all xx in DD:

  • If f(c)f(x)f(c) \ge f(x), then f(c)f(c) is the absolute maximumabsolute maximum^{absolute\ maximum} of ff on DD.
  • If f(c)f(x)f(c) \le f(x), then f(c)f(c) is the absolute minimumabsolute minimum^{absolute\ minimum} of ff on DD.

The maximum and minimum values of ff are called the extreme valuesextreme values^{extreme\ values} of ff.

When xx is near cc:

  • If f(c)f(x)f(c) \ge f(x), then f(c)f(c) is a local maximumlocal maximum^{local\ maximum} of ff.
  • If f(c)f(x)f(c) \le f(x), then f(c)f(c) is a local minimumlocal minimum^{local\ minimum} of ff.

Fermat's TheoremFermats Theorem^{Fermat's\ Theorem} (p.152)

If ff has a local maximum or minimum at cc and f(c)f'(c) exists, then f(c)=0f'(c) = 0. (The converse does not hold.)

Critical Numbers (p.154)

A critical numbercritical number^{critical\ number} of a function ff is a number cc in the domain of ff such that either f(c)=0f'(c) = 0 or f(c)f'(c) does not exist.

3.2 The Mean Value Theorem#

Rolle's TheoremRolles Theorem^{Rolle's\ Theorem} (p.157)

Suppose ff satisfies the following three conditions:

  • ff is continuous on the closed interval [a,b][a, b].
  • ff is differentiable on the open interval (a,b)(a, b).
  • f(a)=f(b)f(a) = f(b)

Then there exists a number cc in (a,b)(a, b) such that f(c)=0f'(c) = 0.

The Mean Value Theorem (p.159)

Suppose ff satisfies the following conditions:

  1. ff is continuous on the closed interval [a,b][a, b].
  2. ff is differentiable on the open interval (a,b)(a, b).

Then there exists a number cc in (a,b)(a, b) such that:


f(c)=f(b)f(a)baf'(c)=\frac{f(b)-f(a)}{b-a}


or equivalently:


f(b)f(a)=f(c)(ba)f(b)-f(a)= f'(c)(b-a)


In plain terms: "There is always a point where the instantaneous rate of change equals the average rate of change over the interval."

The Mean Value Theorem can be used to prove several fundamental facts in calculus. (See corollaries on p.162.)

3.3 How Derivatives Affect the Shape of a Graph#

Most applications of calculus depend on the ability to deduce information about a function ff from information about its derivatives. (p.164)

What ff' tells us about ff

Increasing/Decreasing Test

(a) If f(x)>0f'(x) > 0 on an interval, then ff is increasing on that interval. (b) If f(x)<0f'(x) < 0 on an interval, then ff is decreasing on that interval.

The First Derivative Test

Let cc be a critical number of a continuous function ff. (a) If ff' changes from positive to negative at cc, then ff has a local maximum at cc. (b) If ff' changes from negative to positive at cc, then ff has a local minimum at cc. (c) If ff' does not change sign at cc, then ff has neither a local maximum nor a local minimum at cc.

What ff'' tells us about ff (p.167)

If the graph of ff lies above all of its tangents on an interval II, then ff is concave upwardConcave Upward^{Concave\ Upward} on II. If the graph of ff lies below all of its tangents on an interval II, then ff is concave downwardConcave Downward^{Concave\ Downward} on II.

Inflection Points (p.168)

A point PP on the curve y=f(x)y = f(x) is called an inflection pointinflection point^{inflection\ point} if ff is continuous at PP and the curve changes concavity (from upward to downward, or from downward to upward) at PP.

Concavity Test (p.168)

(a) If f(x)>0f''(x) > 0 for all xx in II, then the graph of ff is concave upward on II. (b) If f(x)<0f''(x) < 0 for all xx in II, then the graph of ff is concave downward on II.

The Second Derivative Test (p.169)

Suppose ff'' is continuous near cc. (a) If f(c)=0f'(c) = 0 and f(c)>0f''(c) > 0, then ff has a local minimum at cc. (b) If f(c)=0f'(c) = 0 and f(c)<0f''(c) < 0, then ff has a local maximum at cc.

3.4 Curve Sketching#

SKIP (p.172)

3.5 Optimization Problems#

We can apply the methods for finding extreme values to solve optimization problems. (p.180) These include problems that maximize area, volume, or profit, and problems that minimize distance, time, or cost.

Steps for Solving Optimization Problems

  1. Understand the problem. Read it carefully until you understand it. Identify: what you want to find, what is given, and what conditions are imposed.
  2. Draw a diagram.
  3. Introduce notation. Assign a symbol to the quantity to be maximized or minimized (call it QQ). Also assign symbols to other unknown quantities and label them on the diagram (e.g., area AA, height hh, time tt, etc.).
  4. Express QQ in terms of the symbols from Step 3.
  5. If QQ is expressed as a function of more than one variable, use the given information to find equations relating those variables. Eliminate variables to express QQ as a function of a single variable: Q=f(x)Q = f(x). Determine the domain of this function.
  6. Find the absolute maximum or minimum of ff using the methods from Sections 3.1 and 3.3.

See worked examples on p.181 and beyond.

3.6 Newton's Method#

There is no general formula for the exact roots of polynomial equations of degree five or higher, or for transcendental equations involving trigonometric functions. (p.190)

For example, suppose we want to solve:


48x(1+x)60(1+x)60+1=048x(1+x)^{60}-(1+x)^{60}+1=0


Numerical roots are most commonly found using the Newton-Raphson methodNewton-Raphson method^{Newton\text{-}Raphson\ method}, or simply Newton's methodNewtons method^{Newton's\ method}:


xn+1=xnf(xn)f(xn)x_{n+1}=x_n-\frac{f(x_n)}{f'(x_n)}


If the sequence xnx_n converges to rr as nn grows large, we say the sequence converges to rr and write:


limnxn=r\lim_{n \to \infty} x_n = r


Note, however, that Newton's method does not work for every function. For some functions the successive approximations may diverge, or the method may converge very slowly.

3.7 Antiderivatives#

A function FF is called an antiderivativeantiderivative^{antiderivative} of ff on an interval II if F(x)=f(x)F'(x) = f(x) for all xx in II. (p.196)

If FF is an antiderivative of ff on an interval II, then the most general antiderivative of ff on II is F(x)+CF(x) + C, where CC is an arbitrary constant.


Summary#

  • Absolute extrema: extreme values over the entire domain — candidates are found at critical numbers
  • Fermat's Theorem: if an extreme value exists, then f(c)=0f'(c) = 0 (converse fails)
  • Rolle's Theorem: if f(a)=f(b)f(a) = f(b), there must exist cc with f(c)=0f'(c) = 0
  • Mean Value Theorem: there always exists a point where the instantaneous rate equals the average rate of change
  • Increasing/Decreasing: f>0f' > 0 means increasing; f<0f' < 0 means decreasing
  • Concavity: f>0f'' > 0 means concave up; f<0f'' < 0 means concave down
  • Optimization: define variables → build objective function → find extrema via derivatives
  • Newton's Method: numerically approximates roots of equations using tangent lines
  • Antiderivatives: F(x)F(x) satisfying F(x)=f(x)F'(x) = f(x) — general solution is F(x)+CF(x) + C

// Related Posts