Math 2.0

definition

Arc length

Definition

Let γ ⁣:[a,b]→Rn\gamma \colon [a, b] \to \mathbb{R}^n be continuous. The arc length of γ\gamma is L(γ)=sup⁡P∑i=1k∥γ(ti)−γ(ti−1)∥,L(\gamma) = \sup_{P} \sum_{i=1}^{k} \| \gamma(t_i) - \gamma(t_{i-1}) \|, where the supremum runs over all partitions P=(t0,…,tk)P = (t_0, \dots, t_k) of [a,b][a, b]. The curve γ\gamma is rectifiable if L(γ)<∞L(\gamma) < \infty.

Remarks

Each sum is the length of a polygonal path through points of the curve. Adding points does not decrease this length. If γ\gamma is continuously differentiable, then L(γ)=∫ab∥γ′(t)∥ dtL(\gamma) = \int_a^b \| \gamma'(t) \| \, dt. For the graph of a C1C^1 function ff on [a,b][a, b], this gives L=∫ab1+f′(x)2 dxL = \int_a^b \sqrt{1 + f'(x)^2} \, dx. Some continuous curves are not rectifiable, for example the graph of the Weierstrass function.

Explanations

L1 human

The arc length of a curve is the length of a string laid along it. We approximate the curve by straight segments and take the best approximation.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 2 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. Partition of an interval definition
  2. Arc length definition

Sources

  1. Web https://en.wikipedia.org/wiki/Arc_length, Definition