What does circulation measure?
Circulation is the line integral , measuring the field’s tangential accumulation around an oriented curve.
Study 11 Theorems of Vector Calculus with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What does circulation measure?
Circulation is the line integral ∮CF⋅dr, measuring the field’s tangential accumulation around an oriented curve.
What does flux measure?
Flux is ∬SF⋅ndS, measuring how much of a vector field crosses an oriented surface.
How is divergence computed?
For F=⟨P,Q,R⟩, ∇⋅F=Px+Qy+Rz.
What is curl’s local meaning?
The curl component (∇×F)⋅n is the limiting circulation per unit area for small surfaces normal to n.
State Stokes’ theorem.
Stokes’ theorem: ∮CF⋅dr=∬S(∇×F)⋅dS, where C=∂S has compatible orientation.
How is Stokes orientation determined?
The right-hand rule sets the positive orientation: curl your right-hand fingers in the traversal direction; your thumb points along the surface normal.
When may a Stokes surface change?
A Stokes surface can be replaced by any easier spanning surface with the same oriented boundary, provided the hypotheses are satisfied.
State the divergence theorem.
The divergence theorem states ∬SF⋅dS=∭E∇⋅FdV, for a closed surface S=∂E oriented outward.
Can divergence theorem use an open surface?
No. The divergence theorem requires a closed surface. An open surface must be completed, and the added boundary’s flux must be handled separately.
Find the outward flux of ⟨x,y,z⟩ on a sphere.
For F=⟨x,y,z⟩ on a sphere of radius R, ∇⋅F=3, so the outward flux is 3⋅34πR3=4πR3.
What does a gradient field imply about circulation?
If F=∇f and the relevant derivatives are continuous, then ∇×F=0, so circulation around every suitable closed curve is zero.
What is the local conservation law?
The local conservation law is ∂t∂ρ+∇⋅J=0, expressing that density changes through net flux.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to defining sequences, evaluating their limits, and proving convergence or divergence using limit laws, bounds, monotonicity, the Squeeze Theorem, and recursive methods.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A 14-question assessment on power series, convergence, term-by-term operations, Taylor and Maclaurin series, polynomial approximation, and error bounds. The questions progress from foundational interpretation to applied convergence and approximation problems.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.