Stewart Notes
Stewart Notes
These notes were written to outline the major topics covered in Auburn Univer-
sity’s Calculus III course based on Stewart’s 7th Edition Calculus text. It progresses
through most of the sections in Chapters 12 through 16, but Chapter 15 is reorganized
slightly to introduce the Jacobian before introducing alternate coordinate systems.
In addition, sections 15.5 and 15.6 are omitted entirely to match Auburn’s course
syllabus.
The purpose of these notes is not to replace any calculus or analysis textbook, but
rather to be used as a guide/outline for students and instructors covering the topics
in a Calculus III course.
As such, when deemed necessary, mathematical rigor is abandoned for the sake of
simplicity or brevity. (Many theorems actually only apply to “nice” functions, usually
requiring some level of continuity or differentiability.) Since for many applications of
interest the relevant functions are “nice”, students should be able to use these notes
as a “good-enough” resource for working on computational problems, particularly the
accompanying study problems.
• Spheres in 3D Space
(x − x0 )2 + (y − y0 )2 + (z − z0 )2 = a2
12.2 Vectors
• Definition of a Vector
– A vector v = →−
v is a mathematical object which stores length (magnitude)
and direction, and can be thought of as a directed line segment.
– Two vectors with the same length and direction are considered equal, even
if they aren’t in the same position.
– We often assume the initial point lays at the origin.
• Component Form
The vector with initial point at (0, 0, 0) and terminal point at (vx , vy , vz ) is
represented by
hvx , vy , vz i
• 2D and 3D Vectors
ha, bi = ha, b, 0i
• Position Vector
If P = (a, b, c) is a point, then P = ha, b, ci is its position vector.
We assume (a, b, c) = ha, b, ci.
• Vector Between Points
The vector from P1 = (x1 , y1 , z1 ) to P2 = (x2 , y2 , z2 ) is
−−→
P1 P2 = P1 P2 = hx2 − x1 , y2 − y1 , z2 − z1 i
• Length of a Vector
q
|v| = | hv1 , v2 , v3 i | = v12 + v22 + v32
→
−
0 = 0 = h0, 0, 0i
• Vector Operations
– Addition
– Scalar Multiplication
1. u + v = v + u
2. (u + v) + w = u + (v + w)
3. u + 0 = u
4. u + (−u) = 0
5. 0u = 0
6. 1u = u
7. a(bu) = (ab)u
8. a(u + v) = au + av
9. (a + b)u = au + bu
• Unit Vectors
• Dot Product
u · v = hu1 , u2 , u3 i · hv1 , v2 , v3 i = u1 v1 + u2 v2 + u3 v3
• Orthogonal Vectors
– u, v are orthogonal if u · v = 0
– u, v are orthogonal if the angle between them is π
2
= 90◦
– 0 is orthogonal to every vector
• Dot Product Properties
1. u · v = v · u
2. (cu) · v = u · (cv) = c(u · v)
3. u · (v + w) = u · v + u · w
4. u · u = |u|2
5. 0 · u = 0
• Projection Vector
u·v v
projv (u) =
|v| |v|
• Work
W = F · D = |F||D| cos θ
• Determinants
– 2x2 Determinant
a b
= ad − bc
c d
– 3x3 Determinant
a1 a2 a3
b2 b3 b b b b
b1 b2 b3 = a1 − a2 1 3 + a3 1 2
c2 c3 c1 c3 c1 c2
c1 c2 c3
b2 b3 b b b b
= a1 + a2 3 1 + a3 1 2
c2 c3 c3 c1 c1 c2
= (a1 b2 c3 + a2 b3 c1 + a3 b1 c2 ) − (a3 b2 c1 + a1 b3 c2 + a2 b1 c3 )
• Cross Product
i j k
u2 u3 u3 u1 u1 u2
u × v = u1 u2 u3 = , ,
v2 v3 v3 v1 v1 v2
v1 v2 v3
= hu2 v3 − u3 v2 , u3 v1 − u1 v3 , u1 v2 − u2 v1 i
h u1 , u2 , u3 i
×h v1 , v2 , v3 i
h u2 v3 − u3 v2 , u3 v1 − u1 v3 , u1 v2 − u2 v1 i
• Right-Hand Rule
→
−τ =r×F
→
−
| τ | = |r||F| sin θ
• Triple Scalar (or “Box”) Product
u1 u2 u3
(u × v) · w = v1 v2 v3
w1 w2 w3
Its absolute value |(u × v) · w| gives the volume of a parallelpiped determined
by the three vectors.
r(t) = P0 + tv
x = x0 + At, y = y0 + Bt, z = z0 + Ct
for −∞ < t < ∞
• Symmetric Equations for a Line
x − x0 y − y0 z − z0
= =
A B C
for 0 ≤ t ≤ 1
• Distance from a Point to a Line
|PS × v|
d=
|v|
Ax + By + Cz = D
r(t) = P0 + t(n1 × n2 )
• Sketching surfaces
• Cylinders
• Quadric Surfaces
• Ellipsoids
• Elliptical Cone
• Elliptical Paraboloid
• Hyperbolic Paraboloid
• Definite Integrals
Z b Z b Z b Z b
r(t) dt = x(t) dt, y(t) dt, z(t) dt
a a a a
Z b
r(t)dt = [R(t)]ba = R(b) − R(a)
a
• Arclength Parameter Z t
s(t) = |r0 (u)|du
0
ds
= |r0 (t)|
dt
• Unit Tangent Vector
dr
T(s) =
ds
dr/dt
T(t) =
|dr/dt|
• Curvature
dT
κ(s) =
ds
2
|dT/dt| | dr × d 2r |
κ(t) = = dt dr 3dt
|dr/dt| | dt |
For y = f (x):
|f 00 (x)|
κ(x) =
[1 + (f 0 (x))2 ]3/2
• Principal Unit Normal Vector
dT/ds
N(s) =
|dT/ds|
dT/dt
N(t) =
|dT/dt|
• Binormal Unit Vector
B=T×N
The triple T, N, B forms a right-handed frame.
– Position: r(t)
– Velocity: v(t) = r0 (t) = dr
dt
ds
– Speed: v(t) = |v(t)| = dt
v(t)
– Direction: T(t) = |v(t)|
– Tangental component
d2 s
aT = = v0
dt2
– Normal component
2
ds
q
aN = κ = κv 2 = |a|2 − a2T
dt
dom(f ) ⊆ R2
f (x, y) = k
dom(f ) ⊆ R3
f (x, y, z) = k
• Alternate Forms
• Limits
lim f (P ) = L
P →P0
lim f (x, y) = L
(x,y)→(x0 ,y0 )
lim f (x, y, z) = L
(x,y,z)→(x0 ,y0 ,z0 )
– In order for a limit limP →P0 f (x, y) to exist, the values of f must approach
L no matter which direction we approach P0 .
– Choose y = g(x) and y = h(x) where P0 lays on both graphs. If
• Limit Laws
lim f (P )
f (P ) P →P0
lim =
P →P0 g(P ) lim g(P )
P →P0
r/s
r/s
lim (f (P )) = lim f (P )
P →P0 P →P0
• Computing Limits
– Due to the Limit Laws, many limits follow the “just plug it in” rule.
– If plugging in results in a zero in a denominator, use factoring, perhaps
with conjugates.
– L’Hopital’s Rule does not apply for multiple variable limits.
• Continuity
• Partial Derivatives
∂f f (x + h, y) − f (x, y)
= fx (x, y) = lim
∂x h→0 h
∂f f (x, y + h) − f (x, y)
= fy (x, y) = lim
∂y h→0 h
– To compute partial derivatives with respect to a variable, treat all other
variables as constants and differentiate as normal.
– Functions of more than two variables behave similarly. For T (x, y, z):
∂T T (x, y, z + h) − T (x, y, z)
= Tz (x, y, z) = lim
∂z h→0 h
∂ 2f
∂ ∂f
= = (fy )x = fyx
∂x∂y ∂x ∂y
∂ 2g
∂ ∂g
= = (gz )z = gzz
∂z 2 ∂z ∂z
fxy = fyx
• Linear Approximation
If f is differentiable at (a, b), then
• Nested Functions
• Chain Rule
df dr ∂f dx ∂f dy ∂f dz
= ∇f · = + +
dt dt ∂x dt ∂y dt ∂z dt
– For functions of the form f (r(s)) = f (x(t, u, v), y(t, u, v), z(t, u, v)):
∂f ∂r ∂f ∂x ∂f ∂y ∂f ∂z
= ∇f · = + +
∂t ∂t ∂x ∂t ∂y ∂t ∂z ∂t
• Differentiation by Substitution
• Total Derivative
• Implicit Differentiation
dy ∂f /∂x fx
=− =−
dx ∂f /∂y fy
– The tree diagram for the chain rule can be used to generate the chain rule.
– It also holds for multiple levels of intermediate variables.
• Directional Derivative
Du f = ∇f · u
– The maximum value of Du f at a fixed point P0 is |∇f (P0 )|, which occurs
∇f (P0 )
when u = |∇f (P0 )|
.
– The gradient vectors ∇f are normal vectors to the level curves f (x, y) = k
for every (x, y) in the domain of f .
– The gradient vectors ∇f are normal vectors to the level surfaces f (x, y, z) =
k for every (x, y, z) in the domain of f .
• Critical Points
– If P0 is a point in the domain of f and
∇f (P0 ) = 0 or ∇f (P0 ) DNE
then P0 is called a critical point.
– Critical points occur when the tangent plane is horizontal or DNE.
– The local maximum and minimum values of a function always occur at
critical points.
• Saddle Points
• Discriminant Function
– The discriminant of f with variables x, y is the function
fxx fxy 2
fD = = fxx fyy − fxy
fyx fyy
– The following points are candidates for giving the absolute extrema:
∗ Critical points of f within D.
∗ Critical points for a function which gives part of the boundary of D.
∗ Corners of D.
– Plug each of these into f (x, y). The largest of these is the absolute maxi-
mum, and the smallest of these is the absolute minimum.
• Double Integral
where for each positive integer n we’ve defined a way to partition R into
n pieces
∆Rn,1 , ∆Rn,2 , . . . , ∆Rn,n
where ∆Rn,i has area ∆An,i , contains the point (xn,i , yn,i ), and
lim max(∆An,i ) = 0
n→∞
R : a ≤ x ≤ b, c ≤ y ≤ d
R : a ≤ x ≤ b, g1 (x) ≤ y ≤ g2 (x)
R : h1 (y) ≤ x ≤ h2 (y), a ≤ y ≤ b
– You can only swap the order of integration of an iterated integral by draw-
ing the region and reinterpreting it as a region of the opposite Type.
• Additivity
If R can be split into two regions R1 , R2 , then
x x x
f (x, y) dA = f (x, y) dA + f (x, y) dA
R R1 R2
• Triple Integral
where for each positive integer n we’ve defined a way to partition D into
n pieces
∆Dn,1 , ∆Dn,2 , . . . , ∆Dn,n
where ∆Dn,i has volume ∆Vn,i , contains the point (xn,i , yn,i , zn,i ), and
lim max(∆Vn,i ) = 0
n→∞
D : a1 ≤ x ≤ a2 , b1 ≤ y ≤ b2 , c1 ≤ z ≤ c2
Z b2 Z c2 Z a2 Z a2 Z c2 Z b2
= f (x, y, z) dx dz dy = f (x, y, z) dy dz dx = . . .
b1 c1 a1 a1 c1 b1
h1 (x, y) ≤ z ≤ h2 (x, y)
and has shadow R in the xy-plane, then a triple integral over D can be
expressed as:
y x Z h2 (x,y)
" #
f (x, y, z) dV = f (x, y, z) dz dA
D R h1 (x,y)
– In general:
y x Z top surface
f (x, y, z) dV = f (x, y, z) d dA
D R bottom surface
• Additivity
If D can be split into two regions D1 , D2 , then
x x x
f (x, y, z) dV = f (x, y, z) dV + f (x, y, z) dV
D D1 D2
• Transformations
r(u, v, w) = r(s) = hx(s), y(s), z(s)i = hx(u, v, w), y(u, v, w), z(u, v, w)i
• The Jacobian
• 2D Substitution
– Suppose that the region R in the xy-plane is the result of applying the
transformation r(u, v) to the region G in the uv-plane.
– Then it follows that
x x
f (x, y) dx dy = f (x(u, v), y(u, v))|rJ (u, v)| du dv
R G
– The unit square in the uv plane with vertices (0, 0), (1, 0), (1, 1), and (0, 1)
is useful for substitution problems involving parallelograms.
– The unit triangle in the uv plane with vertices (0, 0), (1, 0), and (1, 1) is
useful for substitution problems involving triangles.
• 3D Substitution
– Suppose that the solid D in xyz space is the result of applying the trans-
formation r(u, v, w) to the region H in uvw space.
– Then it follows that y
f (x, y, z) dx dy dz
D
y
= f (x(u, v, w), y(u, v, w), z(u, v, w))|rJ (u, v, w)| du dv dw
H
• Cylindrical Coordinates
• Spherical Coordinates
• Vector Fields
– The gradient vector field ∇f (x, y) = hfx (x, y), fy (x, y)i assigns vectors
whose directions are normal to level curves and whose magnitudes are
equal to the maximal directional derivative at the point.
– The gradient vector field ∇f (x, y, z) = hfx (x, y, z), fy (x, y, z), fz (x, y, z)i
assigns vectors whose directions are normal to level surfaces and whose
magnitudes are equal to the maximal directional derivative at the point.
r(t) = P0 + t(P1 − P0 ), 0 ≤ t ≤ 1
where for each positive integer n we’ve defined a way to partition C into
n pieces
∆Cn,1 , ∆Cn,2 , . . . , ∆Cn,n
where ∆Cn,i has length ∆sn,i , contains the position vector rn,i , and
lim max(∆sn,i ) = 0
n→∞
– Similarly, we can find the line integral with respect to a variable for
a function of many variables f (r) along a curve C:
Z Z t=b
dx
f (r) dx = f (r(t)) dt
t=a dt
C
– There are several ways to write and evaluate line integrals of vector fields:
Z Z Z
F · T ds = F · dr = hP, Q, Ri · h dx, dy, dzi
C C C
Z Z b
dx dy dz
= P dx + Q dy + R dz = P (r(t)) + Q(r(t)) + R(r(t)) dt
C a dt dt dt
Z b
dr
= F(r(t)) · dt
a dt
• Additivity
Let C1 + C2 represent the curve taken by moving along C1 followed by moving
along C2 .
Z Z Z
f (r) ds = f (r) ds + f (r) ds
C1 +C2 C1 C2
Z Z Z
f (r) dx = f (r) dx + f (r) dx
C1 +C2 C1 C2
Z Z Z
F · dr = F · dr + F · dr
C1 +C2 C1 C2
• Work
– If C is any smooth curve beginning at the point A and ending at the point
B, then Z
∇f · dr = [f ]B
A = f (B) − f (A)
C
– If C is any smooth curve which is closed (begins and ends at the same
point), then Z
∇f · dr = 0
C
• Conservative Fields
• Green’s Theorem
– Due to Green’s Theorem, we can find the area of R using a line integral:
x Z
A= 1 − 0 dA = x dy
R C
x Z
A= 0 − (−1) dA = −y dx
R C
x 1 1 Z
1 1
A= − − dA = x dy − y dx
2 2 C 2 2
R
• Gradient Operator
∂ ∂ ∂
∇= , ,
∂x ∂y ∂z
• Curl
• Divergence
div curl F = 0
• Surface Area
– If G is the region in the uv plane which maps onto the surface S by the
parametric equations r(u, v), then the surface area of S is:
x
|ru × rv | dA
G
• Surface Integral
– If G is the region in the uv plane which maps onto the surface S by the
parametric equations r(u, v), then the surface integral of f (r) along S is:
x x
f (r) dσ = f (r(u, v))|ru × rv | dA
S G
• Surface Orientation
– If G is the region in the uv plane which maps onto the surface S by the
parametric equations r(u, v), and n is the unit normal vector field giving
the orientation of S, then the surface integral of the vector field F along
S is: x x x
F · d~σ = F · n dσ = F · (ru × rv ) dA
S S G
• Stokes’ Theorem
• Divergence Theorem