Sign in to save your mistake log, flashcard schedule, and streaks across every device — and to use the AI tutor and question generator.
Also unlocks Google Forms export for generated quizzes.
or use email
🏫 Classes
Create a class to get a code you can share with students, or join one with a code your teacher gave you. You can do both.
Join a class
Create a class
🔗 Connect Google Account
Active Recall Deck 0
Active Recall Question
Click to show flashcard
Back side
FLASHCARDS
Multivariable Calculus
Level · University · builds on Linear AlgebraChapters · 4Feeds into · Differential Equations · Physics · Machine Learning
1
Functions of Several Variables & Partial Derivatives
A function of two variables f(x,y) assigns a number to every point of a region in the plane — think of it as a surface, or a landscape with f as elevation. A partial derivative measures how that surface tilts if you walk in only one coordinate direction at a time, holding the other fixed. Everything in this track builds from that one idea.
● Definition 1.1 — Function of two variables
A function f:D→R with D⊆R2 assigns a real number f(x,y) to each point (x,y)∈D. Its graph z=f(x,y) is a surface in R3. Fixing y=b and letting x vary traces a curve on that surface — the "trace" in the direction of x — and similarly for fixing x=a.
● Definition 1.2 — Partial derivative
The partial derivative of f with respect to x at (a,b) is fx(a,b)=∂x∂f(a,b)=h→0limhf(a+h,b)−f(a,b), and similarly fy(a,b)=limh→0hf(a,b+h)−f(a,b). In practice: to find fx, differentiate with respect to x treating y as a constant; for fy, treat x as a constant.
Reading partial derivatives
Geometric meaning
fx(a,b) is the slope, in the x-direction, of the tangent line to the trace curve through (a,b,f(a,b))
The two "mixed" second partials, fxy and fyx, are computed in opposite orders — yet for every function you'll meet in this course they come out equal. That's not a coincidence; it's a theorem, and it's what makes multivariable calculus's bookkeeping (Hessians in Chapter 3, curl and divergence beyond this track) manageable.
▲ Theorem 1.1 — Clairaut's Theorem (equality of mixed partials)
If fxy and fyx both exist near (a,b) and are continuous at (a,b), then fxy(a,b)=fyx(a,b).
Proof
Fix (a,b), and for small nonzero h,k consider the mixed second difference Δ(h,k)=f(a+h,b+k)−f(a+h,b)−f(a,b+k)+f(a,b).
Route 1: x first, then y. Let g(t)=f(t,b+k)−f(t,b), so Δ(h,k)=g(a+h)−g(a). Since fx exists, g is differentiable with g′(t)=fx(t,b+k)−fx(t,b); by the Mean Value Theorem, Δ(h,k)=hg′(a+θh)=h[fx(a+θh,b+k)−fx(a+θh,b)] for some θ∈(0,1). Since fxy exists, apply the Mean Value Theorem again — this time in y, to the function s↦fx(a+θh,s) — to get Δ(h,k)=hkfxy(a+θh,b+ψk) for some ψ∈(0,1).
Route 2: y first, then x. The identical argument with the roles of x and y swapped — starting from Δ(h,k)=[f(a+h,b+k)−f(a,b+k)]−[f(a+h,b)−f(a,b)] — gives Δ(h,k)=hkfyx(a+θ′h,b+ψ′k) for some θ′,ψ′∈(0,1), using that fy and fyx exist.
Both routes compute the same quantity Δ(h,k), so dividing by hk=0: fxy(a+θh,b+ψk)=fyx(a+θ′h,b+ψ′k) for every small nonzero h,k. As h,k→0, both evaluation points approach (a,b), so continuity of fxy and fyx at (a,b) gives fxy(a,b)=h,k→0limfxy(a+θh,b+ψk)=h,k→0limfyx(a+θ′h,b+ψ′k)=fyx(a,b).
Worked example 1.B — Checking Clairaut's theorem
Verify fxy=fyx for f(x,y)=x3y2+sin(xy).
fx=3x2y2+ycos(xy), so fxy=∂y∂[3x2y2+ycos(xy)]=6x2y+cos(xy)−xysin(xy).
fy=2x3y+xcos(xy), so fyx=∂x∂[2x3y+xcos(xy)]=6x2y+cos(xy)−xysin(xy).
Identical, exactly as Theorem 1.1 guarantees — both fxy and fyx are continuous everywhere here (polynomials and sin,cos of polynomials), so the theorem applies at every point.
📝 Chapter Quiz
2
The Chain Rule & Directional Derivatives
Chapter 1 measured how f changes along the two coordinate directions. This chapter does two things with that: differentiates f along a path that moves through both x and y at once (the chain rule), and measures the rate of change along any direction at all (the directional derivative) — which turns out to be answered completely by a single vector, the gradient.
● Definition 2.1 — Multivariable chain rule
If z=f(x,y) is differentiable and x=x(t), y=y(t) are differentiable functions of t, then z(t)=f(x(t),y(t)) is differentiable with dtdz=∂x∂fdtdx+∂y∂fdtdy=fxx′(t)+fyy′(t). Each term accounts for the change coming from one input variable, holding the other's contribution separate.
Worked example 2.A — Applying the chain rule
For z=x2y with x=t2, y=t3, find dz/dt two ways.
Direct substitution:z=(t2)2(t3)=t7, so dz/dt=7t6.
Chain rule:zx=2xy, zy=x2, x′=2t, y′=3t2, so dtdz=(2xy)(2t)+(x2)(3t2)=2(t2)(t3)(2t)+(t2)2(3t2)=4t6+3t6=7t6.
Both routes agree.
● Definition 2.2 — Gradient and directional derivative
The gradient of f at (a,b) is the vector ∇f(a,b)=(fx(a,b),fy(a,b)). For a unit vector u=(u1,u2), the directional derivative of f at (a,b) in the direction u is Duf(a,b)=∇f(a,b)⋅u=fx(a,b)u1+fy(a,b)u2, the instantaneous rate of change of f as you move from (a,b) at unit speed in the direction u. Taking u=(1,0) or (0,1) recovers fx and fy as the special cases they always were.
Why the gradient
It's a vector
∇f lives in R2, so everything from Linear Algebra Chapter 1 — dot products, norms, Cauchy–Schwarz — applies to it directly
It answers every direction at once
One vector ∇f(a,b) determines Duf(a,b) for every unit u, via a single dot product
Which direction makes f increase fastest? The dot-product formula for Duf makes this a question Linear Algebra already answered.
▲ Theorem 2.1 — The gradient points in the direction of steepest ascent
If ∇f(a,b)=0, then among all unit vectors u, the directional derivative Duf(a,b) is maximized exactly when u=∥∇f(a,b)∥∇f(a,b), and that maximum value is ∥∇f(a,b)∥.
Proof
Write g=∇f(a,b). By the Cauchy–Schwarz inequality (Linear Algebra, Theorem 1.1), for any unit vector u (so ∥u∥=1): Duf(a,b)=g⋅u≤∣g⋅u∣≤∥g∥∥u∥=∥g∥. So no direction can push Duf(a,b) past ∥g∥.
That bound is actually attained: since g=0, the unit vector u∗=g/∥g∥ is well-defined, and Du∗f(a,b)=g⋅∥g∥g=∥g∥g⋅g=∥g∥∥g∥2=∥g∥. So ∥g∥ is both an upper bound for Duf(a,b) over all unit u, and a value it actually reaches at u=u∗ — making it the maximum, attained exactly there.
Worked example 2.B — Directional derivative and steepest ascent
For f(x,y)=x2+xy at (1,2), find the directional derivative toward v=(3,4), and the maximum possible rate of increase in any direction.
∇f=(2x+y,x), so ∇f(1,2)=(4,1). The unit vector toward v is u=v/∥v∥=(3,4)/5=(3/5,4/5) (since ∥v∥=32+42=5). So Duf(1,2)=(4)(3/5)+(1)(4/5)=512+4=516=3.2.
By Theorem 2.1, the maximum rate of increase in any direction is ∥∇f(1,2)∥=42+12=17≈4.12 — larger than 3.2, since v doesn't point exactly along ∇f(1,2).
Finding a maximum or minimum of f(x,y) starts the same way it did in single-variable calculus — at a smooth extremum, the derivative vanishes. The difference is that now "the derivative" is a vector, and once it vanishes, you need a second test to tell a peak from a valley from a saddle. That test turns out to be a 2×2 determinant, straight out of Linear Algebra Chapter 4.
● Definition 3.1 — Critical point
(a,b) is a critical point of f if ∇f(a,b)=0 — that is, fx(a,b)=fy(a,b)=0 — or if a partial derivative fails to exist there. Every local max or min where f is differentiable occurs at a critical point (if some direction had Duf=0, moving that way would increase or decrease f, so the point couldn't be extremal).
● Definition 3.2 — Hessian and discriminant
At a point where the second partials exist, the Hessian matrix is H=(fxxfyxfxyfyy), and (using fxy=fyx from Clairaut's theorem) its discriminant is D=det(H)=fxxfyy−fxy2.
The sign of D, together with the sign of fxx, classifies every non-degenerate critical point.
▲ Theorem 3.1 — The Second Derivative Test
Let (a,b) be a critical point of f, with f's second partials continuous near (a,b), and let D=D(a,b) as in Definition 3.2.
If D>0 and fxx(a,b)>0: f has a local minimum at (a,b).
If D>0 and fxx(a,b)<0: f has a local maximum at (a,b).
If D<0: (a,b) is a saddle point (neither a local max nor min).
If D=0: the test is inconclusive.
Proof
Write h,k for small displacements and drop the argument (a,b) from fxx,fxy,fyy. Since (a,b) is critical, the first-order terms of f's Taylor expansion vanish, and — provided D=0 — the quadratic term dominates the remainder for (h,k) small, so the sign of f(a+h,b+k)−f(a,b) matches the sign of the quadratic form Q(h,k)=fxxh2+2fxyhk+fyyk2.
Case fxx=0. Completing the square in h: Q(h,k)=fxx(h+fxxfxyk)2+(fyy−fxxfxy2)k2=fxx(h+fxxfxyk)2+fxxDk2, using fyy−fxy2/fxx=(fxxfyy−fxy2)/fxx=D/fxx.
If D>0 and fxx>0, both fxx and D/fxx are positive, so Q(h,k) is a sum of two nonnegative terms, zero only when both squared terms vanish — which (since D/fxx=0) forces k=0, then h=0. So Q(h,k)>0 for every (h,k)=(0,0): a local minimum. If D>0 and fxx<0, both coefficients are negative by the same reasoning, so Q(h,k)<0 away from the origin: a local maximum. If D<0, then fxx and D/fxx have opposite signs: along k=0, Q=fxxh2 has the sign of fxx; along h=−(fxy/fxx)k, Q=(D/fxx)k2 has the opposite sign. Q takes both signs arbitrarily close to (0,0): a saddle point.
Case fxx=0. Then D=−fxy2≤0 automatically, so only the D≤0 rows of the theorem are reachable here, and only D<0 (i.e. fxy=0) is claimed. Here Q(h,k)=2fxyhk+fyyk2. Taking (h,k)=(1,ε) for small ε=0 gives Q≈2fxyε, whose sign flips with the sign of ε; so Q again takes both signs arbitrarily close to the origin — a saddle point, matching the theorem.
Worked example 3.A — Classifying critical points
Classify the critical points of f(x,y)=x3−3x+y2.
fx=3x2−3=0⇒x=±1; fy=2y=0⇒y=0. Critical points: (1,0) and (−1,0).
fxx=6x, fyy=2, fxy=0, so D=12x.
At (1,0): D=12>0 and fxx=6>0 — local minimum, value f(1,0)=1−3=−2.
At (−1,0): D=−12<0 — saddle point.
The second derivative test optimizes f freely over the whole plane. Often, though, you need the best value of f only among points satisfying some constraint g(x,y)=c — walking along a fixed curve rather than roaming the plane.
▲ Theorem 3.2 — Lagrange Multipliers
Suppose f has a local extremum, subject to the constraint g(x,y)=c, at a point (a,b) where ∇g(a,b)=0. Then there exists a scalar λ with ∇f(a,b)=λ∇g(a,b).
Proof
Since ∇g(a,b)=0, the level curve g(x,y)=c has a smooth parametrization r(t)=(x(t),y(t)) near (a,b), with r(t0)=(a,b) and r′(t0)=0 tangent to the curve.
Because g(r(t))=c is constant along this curve, the chain rule (Definition 2.1) gives ∇g(a,b)⋅r′(t0)=0: the gradient ∇g(a,b) is orthogonal to r′(t0).
Since (a,b) is a local extremum of f restricted to the constraint, h(t)=f(r(t)) has a local extremum at t=t0, so h′(t0)=0. By the chain rule again, h′(t0)=∇f(a,b)⋅r′(t0)=0: the gradient ∇f(a,b) is also orthogonal to r′(t0).
So both ∇f(a,b) and ∇g(a,b) are orthogonal to the same nonzero vector r′(t0) in R2. In the plane, the set of vectors orthogonal to a given nonzero vector is a single line through the origin (a 1-dimensional subspace) — so any two vectors orthogonal to r′(t0) are scalar multiples of each other. Hence ∇f(a,b)=λ∇g(a,b) for some scalar λ (taking λ=0 if ∇f(a,b)=0).
Worked example 3.B — Using a Lagrange multiplier
Maximize f(x,y)=xy subject to x+y=10.
Here g(x,y)=x+y, so ∇g=(1,1) — never 0, so Theorem 3.2 applies at any extremum. ∇f=(y,x). Setting ∇f=λ∇g: y=λ,x=λ⟹x=y. Combined with x+y=10: x=y=5, so f(5,5)=25 is the constrained maximum (checking nearby constrained points, e.g. (9,1) gives f=9 and (6,4) gives f=24, both less than 25, consistent with a maximum here).
📝 Chapter Quiz
4
Double Integrals
A single integral ∫abf(x)dx sums up f over an interval; a double integral ∬Rf(x,y)dA sums f over a whole region R of the plane, and (for f≥0) gives the volume under the surface z=f(x,y). The one new practical question is how to actually compute one — and the answer is to reduce it to two ordinary, single-variable integrals, done one after the other.
● Definition 4.1 — Double integral over a rectangle
For f continuous on R=[a,b]×[c,d], partition R into an m×n grid of sub-rectangles Rij, each of area ΔA=ΔxΔy, and pick a sample point (xi∗,yj∗)∈Rij. The double integral is the limit of the Riemann sum as the grid is refined: ∬RfdA=m,n→∞limi=1∑mj=1∑nf(xi∗,yj∗)ΔA.
● Definition 4.2 — Iterated integral
An iterated integral computes one variable at a time: ∫ab∫cdf(x,y)dydx means: first integrate f(x,y) with respect to y (treating x as a constant) from c to d, producing a function of x alone, then integrate that result with respect to x from a to b.
The double integral (Definition 4.1) and the iterated integral (Definition 4.2) are computed completely differently — one is a genuine two-dimensional limit, the other is two ordinary one-dimensional integrals in sequence. The theorem that makes double integrals practical to compute is that, for continuous f, they always agree.
▲ Theorem 4.1 — Fubini's Theorem
If f is continuous on R=[a,b]×[c,d], then ∬RfdA=∫ab∫cdf(x,y)dydx=∫cd∫abf(x,y)dxdy. This holds for every continuous f on a rectangle — the fully general proof (which needs the uniform continuity of f on the compact rectangle R) belongs to a real analysis course. Below we prove it in full for the case that actually drives how you'll split integrals apart in practice: a separable integrand f(x,y)=g(x)h(y).
Proof (separable case f(x,y)=g(x)h(y))
Fix any partition of R into sub-rectangles Rij with sample points (xi∗,yj∗), as in Definition 4.1. Because f(xi∗,yj∗)=g(xi∗)h(yj∗), the double Riemann sum factors exactly — for every partition, not just in a limit — by distributivity: i=1∑mj=1∑nf(xi∗,yj∗)ΔxΔy=i=1∑mj=1∑ng(xi∗)h(yj∗)ΔxΔy=(i=1∑mg(xi∗)Δx)(j=1∑nh(yj∗)Δy).
As the grid is refined (m,n→∞), the two factors on the right are ordinary single-variable Riemann sums, converging (since g,h are continuous, hence Riemann integrable) to ∫abg(x)dx and ∫cdh(y)dy respectively. Since both factors converge, their product converges to the product of the limits: ∬RfdA=(∫abg(x)dx)(∫cdh(y)dy).
This is exactly the value of either iterated integral: ∫ab∫cdg(x)h(y)dydx=∫abg(x)[∫cdh(y)dy]dx=(∫cdh(y)dy)∫abg(x)dx, since ∫cdh(y)dy is a constant with respect to x and pulls out of the outer integral — and symmetrically for the other order. All three quantities are equal.
Worked example 4.A — Order of integration doesn't matter
Compute ∬R(x2+y)dA for R=[0,2]×[0,1], both orders.
Same value either way, as Theorem 4.1 guarantees — x2+y isn't separable, but it's still continuous on R, so the general (unproved-here) case of Fubini applies.
Polar coordinates: dA=rdrdθ
When a region is naturally circular, switch to polar coordinates x=rcosθ, y=rsinθ. A small polar "rectangle" spanning [r,r+Δr]×[θ,θ+Δθ] has one pair of sides of length Δr (radial) and the other pair of approximate length rΔθ (arc length at radius r), so its area is approximately rΔrΔθ rather than ΔrΔθ — the extra factor of r is exactly why dA=rdrdθ, not drdθ, and why x2+y2 becomes the clean r2.
Worked example 4.B — A double integral in polar coordinates
Compute ∬D(x2+y2)dA where D is the disk x2+y2≤4.
In polar coordinates, D is 0≤r≤2, 0≤θ≤2π, and x2+y2=r2, dA=rdrdθ: ∬D(x2+y2)dA=∫02π∫02r2⋅rdrdθ=∫02π[4r4]02dθ=∫02π4dθ=8π.
The integrand is separable in polar form (r3 times 1), which is exactly why the r- and θ-integrals split apart so cleanly — the same factoring idea proved in Theorem 4.1.
📝 Chapter Quiz
§
Practice set
Sixteen free-response problems spanning all four chapters — four per chapter, Basic to Advanced. Try each one, then reveal the worked solution.
M1
Find fx(2,1) for f(x,y)=3x2y−y3.
Basic
fx=6xy,fx(2,1)=6(2)(1)=12.
M2
Find fy(1,3) for f(x,y)=x2+y2.
Basic
fy=2y,fy(1,3)=2(3)=6.
M3
Find fxy for f(x,y)=exy.
Intermediate
fx=yexy, so fxy=∂y∂[yexy]=exy+xyexy=(1+xy)exy.
M4
Verify Clairaut's theorem for f(x,y)=x2siny+y2cosx by computing fxy and fyx directly.
Advanced
fx=2xsiny−y2sinx, so fxy=2xcosy−2ysinx. fy=x2cosy+2ycosx, so fyx=2xcosy−2ysinx. Identical, as Theorem 1.1 guarantees.
M5
Find ∇f(2,1) for f(x,y)=x2y.
Basic
∇f=(2xy,x2),∇f(2,1)=(4,4).
M6
For z=x2+y2 with x=t, y=t2, find dz/dt at t=1, using the chain rule.
Intermediate
zx=2x, zy=2y, x′=1, y′=2t. At t=1: x=1,y=1, so dtdz=2x(1)+2y(2t)=2(1)+2(1)(2)=6. (Check: z=t2+t4, dz/dt=2t+4t3, at t=1: 2+4=6.)
M7
Find the directional derivative of f(x,y)=x2−y2 at (2,−1) in the direction of v=(1,1).
Intermediate
∇f=(2x,−2y), so ∇f(2,−1)=(4,2). Unit vector u=(1,1)/2. Duf=24+2=26=32.
M8
Find the direction of steepest ascent and the maximum rate of increase of f(x,y)=ln(x2+y2) at (3,4).
Advanced
∇f=(x2+y22x,x2+y22y). At (3,4), x2+y2=25, so ∇f(3,4)=(6/25,8/25), with ∥∇f(3,4)∥=(6/25)2+(8/25)2=10/25=2/5. By Theorem 2.1: steepest ascent is in the direction ∇f/∥∇f∥=(3/5,4/5), at maximum rate 2/5.
Compute ∬De−(x2+y2)dA where D is the unit disk x2+y2≤1, using polar coordinates.
Advanced
∬De−(x2+y2)dA=∫02π∫01e−r2rdrdθ. With u=r2, du=2rdr: ∫01e−r2rdr=21(1−e−1). So the integral is 2π⋅21(1−e−1)=π(1−e1)≈1.986.
M16
Find the area enclosed by the polar curve r=2cosθ (a circle) using a double integral in polar coordinates.
Advanced
The curve is traced once for θ∈[−π/2,π/2]. Area=∫−π/2π/2∫02cosθrdrdθ=∫−π/2π/2[2r2]02cosθdθ=∫−π/2π/22cos2θdθ=π. Matches the known geometry: r=2cosθ is a circle of radius 1 (centered at (1,0)), area π(1)2=π.
✎
Test generator
Build a randomised test from this subject’s question bank. Pick the number of questions and a difficulty, generate, then reveal the worked answers when you’re ready — or print a clean copy to hand out.
↓
Downloads
Take Multivariable Calculus offline. The PDF packet prints straight from your browser; native Word versions with editable equation-editor math are available on request.
PDF · ready now
Multivariable Calculus notes & practice
All four chapters plus every worked solution and proof, formatted as a clean print document.
DOCX · on request
Native Word packet
Editable .docx with real Word equations (OMML) — ready for a worksheet or quiz.
Worksheet Library
Practice worksheets are being added chapter by chapter — check back as this track grows.
Loading worksheet library…
Privacy Policy
Last updated July 14, 2026
ClipSAT is a static study site with no user accounts and no server-side database of your personal information. This page explains what little data does exist and how it's handled.
What's stored on your device
Progress, streaks, mistake log, and dark-mode preference are saved in your browser's local storage. They never leave your device and are not visible to us.
If you use "Ask Mr. Mohamed," your questions are sent directly to a third-party AI provider to generate a reply; they are not stored on any ClipSAT server.
Advertising & cookies
ClipSAT may show ads served by Google and other third-party vendors. These vendors, including Google, use cookies to serve ads based on a user's prior visits to this or other websites. Google's use of advertising cookies enables it and its partners to serve ads based on your visit to this site and/or other sites on the Internet. You may opt out of personalized advertising by visiting Google Ads Settings. You can also control cookies through your browser settings; disabling cookies may affect some site features.
Google Forms integration
Teachers can optionally connect a Google account to turn a ClipSAT-generated quiz or worksheet into a Google Form, with a shareable link they can post anywhere — Google Classroom, Canvas, Moodle, or any other LMS. This is entirely opt-in — nothing is sent to Google unless a teacher clicks "Connect Google Account" and approves the specific permissions requested. Key points:
ClipSAT requests only the permissions needed to create a Form, read its own responses, and save the question images it renders to a teacher's Google Drive (a permission scoped only to files ClipSAT itself creates — it cannot see or touch anything else already in that Drive). ClipSAT never reads or changes anything else in a connected Google account, and never requests access to a teacher's Google Classroom courses or roster.
Questions and answer choices containing complex math are rendered into an image (so they display correctly in Forms, which cannot show math notation) and uploaded to that teacher's own Google Drive, set to "anyone with the link can view" so the Form can display it. These images are not stored anywhere by ClipSAT — only in the teacher's own Drive.
This connection happens entirely in your browser. ClipSAT has no backend server, so no quiz content, response data, or access token passes through or is stored on any ClipSAT server — each Google API call is made directly from the teacher's browser to Google, using a token that Google itself issues and that ClipSAT never persists beyond the current browser tab.
Any results shown inside ClipSAT (a per-student score summary) are fetched live from Google each time the page is viewed, not stored anywhere by ClipSAT.
Google's own Privacy Policy governs how Google handles data once ClipSAT's requests reach it — see policies.google.com/privacy.
Links to WhatsApp, Telegram, YouTube, Instagram, TikTok, Facebook, and PayPal take you to those companies' own sites, each governed by its own privacy policy.
Contact
Questions about this policy can be sent via WhatsApp or Telegram.
Notes, explorers, and practice questions are provided for personal study. Downloaded packets may be used for your own review; please don't redistribute or resell them.
No guarantee of results
ClipSAT is a study aid, not a guarantee of any particular exam score. Always check official curriculum documents (e.g. Cambridge, IB, College Board, Qiyas) for the authoritative syllabus.
AI tutor
"Ask Mr. Mohamed" is an AI assistant, not Mr. Mohamed Abdallah himself. Double-check important steps and final answers yourself.
ClipSAT's AI tutor and question generator work for free once you're signed in (☁️ Sign in, top of the page). Paste your own Groq key here instead if you'd rather not sign in, or want a private, higher-limit key — leave it blank and save to go back to the shared sign-in-based one.