Math 2.0

statement theorem

Mean value theorem in several variables

Statement

Let U⊆RnU \subseteq \mathbb{R}^n be open, let f ⁣:U→Rf \colon U \to \mathbb{R} be differentiable on UU, and let x,y∈Ux, y \in U be points such that the segment {x+t(y−x):0≤t≤1}\{x + t (y - x) : 0 \le t \le 1\} lies in UU. Then there is a number c∈(0,1)c \in (0, 1) such that f(y)−f(x)=∇f(x+c(y−x))⋅(y−x).f(y) - f(x) = \nabla f\big(x + c (y - x)\big) \cdot (y - x).

Remarks

The proof applies the one-variable mean value theorem to g(t)=f(x+t(y−x))g(t) = f(x + t(y - x)) on [0,1][0, 1], with g′(t)=∇f(x+t(y−x))⋅(y−x)g'(t) = \nabla f(x + t(y - x)) \cdot (y - x) by the chain rule for a curve. The theorem is false for maps into Rm\mathbb{R}^m with m≥2m \ge 2. For f(t)=(cos⁡t,sin⁡t)f(t) = (\cos t, \sin t) on [0,2π][0, 2\pi], f(2π)−f(0)=0f(2\pi) - f(0) = 0, but f′(t)≠0f'(t) \ne 0 for each tt. The mean value inequality replaces it. By the Cauchy–Schwarz inequality, it gives ∣f(y)−f(x)∣≤sup⁡z∥∇f(z)∥ ∥y−x∥|f(y) - f(x)| \le \sup_{z} \|\nabla f(z)\| \, \|y - x\|, with zz on the segment.

Explanations

L1 human

On a straight path from xx to yy, the average slope of ff equals the actual slope at some point between them. This reduces the problem to one variable, by looking at ff only along the segment.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

Sources

  1. Web https://en.wikipedia.org/wiki/Mean_value_theorem, Mean value theorem in several variables