Math 2.0

statement theorem

Mean value inequality

Statement

Let U⊆RnU \subseteq \mathbb{R}^n be open, let f ⁣:U→Rmf \colon U \to \mathbb{R}^m be differentiable on UU, and let x,y∈Ux, y \in U be points such that the segment [x,y]={x+t(y−x):0≤t≤1}[x, y] = \{x + t (y - x) : 0 \le t \le 1\} lies in UU. Suppose that M≥0M \ge 0 and ∥Df(z)∥≤M\|Df(z)\| \le M for each z∈[x,y]z \in [x, y], where ∥Df(z)∥=sup⁡∥h∥≤1∥Df(z)h∥\|Df(z)\| = \sup_{\|h\| \le 1} \|Df(z) h\| is the operator norm. Then ∥f(y)−f(x)∥≤M ∥y−x∥.\|f(y) - f(x)\| \le M \, \|y - x\|.

Remarks

For m=1m = 1, the inequality follows from the mean value theorem in several variables. For m≥2m \ge 2 there is in general no equality form, but the inequality still holds. A standard proof applies the one-variable mean value theorem to φ(t)=(f(y)−f(x))⋅f(x+t(y−x))\varphi(t) = (f(y) - f(x)) \cdot f(x + t(y - x)). On a convex set C⊆UC \subseteq U with ∥Df∥≤M\|Df\| \le M on CC, the inequality holds for all x,y∈Cx, y \in C, so ff is Lipschitz on C.

Explanations

L1 human

Suppose that the speed of change of ff is at most MM everywhere on a straight path. Then ff changes by at most MM times the length of the path. This is like saying that a car that never goes faster than 100100 km/h cannot cover more than 200200 km in two hours.

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.

What this needs

To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Euclidean space object
  2. Function concept
  3. Function of several variables concept
  4. Limit of a function of several variables concept
  5. Differentiable function of several variables definition
  6. Mean value inequality statement

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Mean_value_theorem, Mean value inequality
  2. Web https://en.wikipedia.org/wiki/Mean_value_theorem, Mean value theorem for vector-valued functions