Math 2.0

statement theorem

Gradient theorem

Statement

Let U⊆RnU \subseteq \mathbb{R}^n be open, let ϕ ⁣:U→R\phi \colon U \to \mathbb{R} be of class C1C^1, and let γ ⁣:[a,b]→U\gamma \colon [a, b] \to U be a piecewise C1C^1 curve. Then ∫γ∇ϕ⋅dr=ϕ(γ(b))−ϕ(γ(a)).\int_\gamma \nabla \phi \cdot d\mathbf{r} = \phi(\gamma(b)) - \phi(\gamma(a)).

Remarks

Proof for a C1C^1 curve: by the chain rule along a curve, (ϕ∘γ)′(t)=∇ϕ(γ(t))⋅γ′(t)(\phi \circ \gamma)'(t) = \nabla \phi(\gamma(t)) \cdot \gamma'(t). Then the parametric formula and the fundamental theorem of calculus give the result. For a piecewise C1C^1 curve, add the pieces. So the line integral of a gradient field depends only on the end points. Around a closed curve it is 00. Example: for ϕ(x,y)=x2y\phi(x, y) = x^2 y and any path from (0,0)(0, 0) to (1,2)(1, 2), ∫γ(2xy,x2)⋅dr=2\int_\gamma (2 x y, x^2) \cdot d\mathbf{r} = 2. This is the case of curves in the generalised Stokes theorem: the boundary of a curve consists of its two end points.

Explanations

L1 human

This is the fundamental theorem of calculus for curves. To integrate the gradient of ϕ\phi along a path, you only need the values of ϕ\phi at the end and at the start.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

16 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Gradient_theorem, Proof
  2. Web https://en.wikipedia.org/wiki/Gradient_theorem, lead section