# rectifiable curve

## Definitions

Let $f:[a,b]\to {\mathbb{R}}^{k}$ be a simple curve in ${\mathbb{R}}^{k}$ and let $P=({s}_{0},\mathrm{\dots},{s}_{n})$ with $$ be a partition^{} of the interval^{} $[a,b]$; then the points in the set

$$\{f({s}_{0}),f({s}_{1}),\mathrm{\dots},f({s}_{n})\}$$ |

are called the *vertices of the inscribed ^{} polygonal path* $\mathrm{\Pi}(P)$ determined by $P$.
The

*length*of the inscribed polygonal path is defined to be ${\sum}_{m=1}^{n}|f({s}_{m})-f({s}_{m-1})|$. The simple curve is said to be

*rectifiable*if there exists a positive number $M$ such that the length of the inscribed polygonal path $\mathrm{\Pi}(P)$ is less than $M$ for all possible partitions $P$ of $[a,b]$. If the simple curve is rectifiable then its

*length*is defined as the least upper bound of the lengths of inscribed polygonal paths taken over all possible partitions.

## Notes

The intuition underlying this definition is that, to measure the length of a curve, one could approximate the curve by an inscribed polygonal path. As one increases the number of vertices of the polygonal path, one expects to obtain better approximations to the curve, and hence one would expect the length of the curve to be the limit of the length of these polygonal paths. Since the length of a polygonal path increases as one adds vertices, this means we are dealing with the limit of an increasing quantity, which will equal its supremum.

If one does not demand the curve to be simple (that is, that $f$ be injective), then one may still proceed as above, taking the supremum of the lengths of all possible inscribed polygonal paths. However, what one will obtain is not necessarily the length of the curve, but the total distance^{} travelled along the curve. For instance, if a portion of the curve is traced more than once, then the length of that portion of the curve will be counted more than once.

Although this definition mentions a parameterization of the (simple) curve, what is being defined actually is independent of the choice of parameterization. In fact, all the information that is used is the ordering of points along the curve, which is invariant under reparameterization. Also, because the length of a line segment^{} does not depend on how one might choose to orient the line segment, what is being defined here is invariant under reversing the parameterization of the curve. Hence, this is a geometrical property of the curve.

Title | rectifiable curve |

Canonical name | RectifiableCurve |

Date of creation | 2013-03-22 12:53:23 |

Last modified on | 2013-03-22 12:53:23 |

Owner | yark (2760) |

Last modified by | yark (2760) |

Numerical id | 22 |

Author | yark (2760) |

Entry type | Definition |

Classification | msc 51N05 |

Related topic | ArcLength |

Related topic | PiecewiseSmooth |

Related topic | StraightLineIsShortestCurveBetweenTwoPoints |

Related topic | IntegralRepresentationOfLengthOfSmoothCurve |

Defines | rectifiable |

Defines | length |