{
  "id": "arc-length",
  "title": "Arc Length",
  "lang": "en",
  "source_lang": "en",
  "summary": "Arc length measures the distance along a curve, defined through polygonal approximations and calculated for sufficiently regular curves by integrating speed.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "Length of a curve",
    "Curve length"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/arc-length/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/arc-length/",
      "json": "https://aiwiki.page/zh/arc-length.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Arc length is the distance measured along a curve, rather than directly between its endpoints. It extends the familiar length of a line segment to curved paths in Euclidean space and, more generally, in spaces equipped with a notion of distance. Its fundamental definition uses the supremum of the lengths of inscribed polygonal paths. For sufficiently regular curves, this definition leads to an integral of speed. A curve of finite length is called rectifiable."
    },
    {
      "heading": "Definition by polygonal approximation",
      "text": "Let \\(\\gamma:[a,b]\\to\\mathbb{R}^n\\) be a continuous parametrized curve. Choose a partition\n\n\\[P:\\qquad a=t_0<t_1<\\cdots<t_m=b.\\]\n\nJoining successive points \\(\\gamma(t_i)\\) by straight line segments gives a polygonal path of length\n\n\\[L_P(\\gamma)=\\sum_{i=1}^{m} \\|\\gamma(t_i)-\\gamma(t_{i-1})\\|,\\]\n\nwhere \\(\\|\\cdot\\|\\) is the Euclidean norm. The arc length of \\(\\gamma\\) is\n\n\\[L(\\gamma)=\\sup_P L_P(\\gamma).\\]\n\nThis definition does not require a derivative. By the triangle inequality, adding partition points cannot decrease the polygonal length. Taking the supremum captures the length revealed by arbitrarily fine subdivision.\n\nIf \\(L(\\gamma)<\\infty\\), the curve is rectifiable; otherwise its length is infinite. For every such curve,\n\n\\[L(\\gamma)\\geq \\|\\gamma(b)-\\gamma(a)\\|.\\]\n\nThus distance along a curve is at least the straight-line distance between its endpoints.\n\nLength is a property of the parametrized traversal, not merely of the set of points visited. A circle traced twice has twice the length of the same circle traced once. Self-intersections cause no difficulty: each portion of the traversal contributes to the total.\n\nBasic properties\n\nArc length has several fundamental properties:\n\n- Additivity: for \\(a<c<b\\),\n\n\\[L(\\gamma|_{[a,b]}) = L(\\gamma|_{[a,c]})+L(\\gamma|_{[c,b]}).\\]\n- Invariance under rigid motions: translations, rotations, and reflections preserve length.\n- Scaling: multiplying all spatial coordinates by a scalar \\(c\\) multiplies length by \\(|c|\\).\n- Reversal invariance: traversing a curve in the opposite direction leaves its length unchanged.\n- Reparameterization invariance: composing \\(\\gamma\\) with a continuous, strictly monotone bijection between parameter intervals preserves length.\n\nThe last property distinguishes the shape and traversal of a path from the rate at which its parameter runs."
    },
    {
      "heading": "Integral formulas",
      "text": "Parametric curves\n\nIf \\(\\gamma:[a,b]\\to\\mathbb{R}^n\\) is continuously differentiable, then\n\n\\[L(\\gamma)=\\int_a^b\\|\\gamma'(t)\\|\\,dt.\\]\n\nThe same formula applies to piecewise continuously differentiable curves by adding the lengths of their smooth pieces.\n\nFor a plane curve \\(\\gamma(t)=(x(t),y(t))\\),\n\n\\[L=\\int_a^b \\sqrt{\\left(\\frac{dx}{dt}\\right)^2+ \\left(\\frac{dy}{dt}\\right)^2}\\,dt.\\]\n\nFor a space curve \\(\\gamma(t)=(x(t),y(t),z(t))\\),\n\n\\[L=\\int_a^b \\sqrt{x'(t)^2+y'(t)^2+z'(t)^2}\\,dt.\\]\n\nThe quantity \\(\\|\\gamma'(t)\\|\\) is the speed when \\(t\\) represents time. Arc length is therefore accumulated speed, whereas displacement depends only on the initial and final positions.\n\nThe formula is motivated by the local approximation\n\n\\[\\gamma(t+\\Delta t)-\\gamma(t) \\approx \\gamma'(t)\\Delta t.\\]\n\nThe corresponding short segment has length approximately\n\\(\\|\\gamma'(t)\\|\\,|\\Delta t|\\). Summing these contributions leads to the integral; a rigorous derivation uses control of the approximation error.\n\nGraphs of functions\n\nFor the graph of a continuously differentiable function \\(y=f(x)\\), with \\(a\\leq x\\leq b\\), the parametrization \\(\\gamma(x)=(x,f(x))\\) gives\n\n\\[L=\\int_a^b\\sqrt{1+[f'(x)]^2}\\,dx.\\]\n\nSimilarly, a graph expressed as \\(x=g(y)\\) has length\n\n\\[L=\\int_c^d\\sqrt{1+[g'(y)]^2}\\,dy.\\]\n\nNeither formula requires the graph to be monotone. The first, however, cannot describe an entire curve that has several different \\(y\\)-values for the same \\(x\\); such a curve must be divided into suitable pieces or described parametrically.\n\nPolar coordinates\n\nFor a curve given in polar coordinates by \\(r=r(\\theta)\\),\n\n\\[x=r(\\theta)\\cos\\theta,\\qquad y=r(\\theta)\\sin\\theta,\\]\n\nthe length is\n\n\\[L=\\int_\\alpha^\\beta \\sqrt{r(\\theta)^2+ \\left(\\frac{dr}{d\\theta}\\right)^2}\\,d\\theta,\\]\n\nprovided the parametrization is sufficiently regular. As with every parametric formula, repeated tracing is counted repeatedly."
    },
    {
      "heading": "Examples",
      "text": "Circular arc\n\nFor a circle of radius \\(R\\),\n\n\\[\\gamma(\\theta)=(R\\cos\\theta,R\\sin\\theta), \\qquad \\|\\gamma'(\\theta)\\|=R.\\]\n\nAn arc swept through an angle \\(\\Delta\\theta\\), measured in radians, therefore has length\n\n\\[L=R|\\Delta\\theta|.\\]\n\nA complete revolution has length \\(2\\pi R\\).\n\nParabolic arc\n\nFor the parabola \\(y=x^2\\), between \\(x=0\\) and \\(x=A\\), where \\(A\\geq0\\),\n\n\\[L=\\int_0^A\\sqrt{1+4x^2}\\,dx =\\frac{A}{2}\\sqrt{1+4A^2} +\\frac14\\ln\\!\\left(2A+\\sqrt{1+4A^2}\\right).\\]\n\nCircular helix\n\nFor the space curve\n\n\\[\\gamma(t)=(R\\cos t,R\\sin t,ct), \\qquad a\\leq t\\leq b,\\]\n\nthe speed is constant:\n\n\\[\\|\\gamma'(t)\\|=\\sqrt{R^2+c^2}.\\]\n\nHence\n\n\\[L=(b-a)\\sqrt{R^2+c^2}.\\]\n\nEllipse\n\nAn ellipse with semiaxes \\(A\\geq B>0\\) can be parametrized by\n\n\\[\\gamma(t)=(A\\cos t,B\\sin t).\\]\n\nIts perimeter is\n\n\\[L=4A\\,E(e),\\qquad e=\\sqrt{1-\\frac{B^2}{A^2}},\\]\n\nwhere\n\n\\[E(e)=\\int_0^{\\pi/2}\\sqrt{1-e^2\\sin^2\\theta}\\,d\\theta\\]\n\nis the complete elliptic integral of the second kind. Except in special cases, such as the circle, this integral has no elementary closed form. A simple geometric curve need not have an elementary expression for its length."
    },
    {
      "heading": "Arc-length parametrization",
      "text": "For a continuously differentiable curve, define the accumulated length from its initial point by\n\n\\[s(t)=\\int_a^t\\|\\gamma'(u)\\|\\,du.\\]\n\nIf \\(\\|\\gamma'(t)\\|>0\\) throughout the interval, \\(s(t)\\) is strictly increasing and has an inverse function \\(t=t(s)\\). The reparameterized curve\n\n\\[\\widetilde{\\gamma}(s)=\\gamma(t(s))\\]\n\nsatisfies\n\n\\[\\left\\|\\frac{d\\widetilde{\\gamma}}{ds}\\right\\|=1.\\]\n\nIt is called a unit-speed or arc-length parametrization.\n\nThis parametrization is central to differential geometry because it removes changes caused merely by varying the traversal speed. For a twice differentiable unit-speed curve, the magnitude of its second derivative gives its curvature:\n\n\\[\\kappa(s)= \\left\\|\\frac{d^2\\widetilde{\\gamma}}{ds^2}\\right\\|.\\]\n\nA continuous rectifiable curve of positive length also admits an arc-length representation, though the resulting unit-speed property generally holds only almost everywhere, rather than at every point."
    },
    {
      "heading": "Regularity and infinite length",
      "text": "Continuity alone does not imply finite length. Some continuous curves oscillate so strongly that their polygonal lengths have no finite upper bound. The Koch curve is a standard fractal example: at each construction stage, the polygonal length is multiplied by \\(4/3\\), and the limiting curve has infinite length.\n\nConversely, differentiability everywhere is unnecessary. Polygonal paths are rectifiable despite their corners.\n\nAn important general condition is absolute continuity. If \\(\\gamma:[a,b]\\to\\mathbb{R}^n\\) is absolutely continuous, then its derivative exists almost everywhere, is integrable, and\n\n\\[L(\\gamma)=\\int_a^b\\|\\gamma'(t)\\|\\,dt,\\]\n\nwith the integral interpreted as a Lebesgue integral.\n\nThe existence of an integrable derivative almost everywhere is not, by itself, sufficient. Singular continuous functions can change value despite having derivative zero almost everywhere. Absolute continuity rules out this type of change and makes the integral formula valid. In particular, every curve satisfying a Lipschitz condition on a compact interval is absolutely continuous and rectifiable."
    },
    {
      "heading": "Generalizations",
      "text": "Metric spaces\n\nFor a curve in a metric space \\((X,d)\\), the definition becomes\n\n\\[L(\\gamma)= \\sup_P\\sum_{i=1}^{m} d\\bigl(\\gamma(t_i),\\gamma(t_{i-1})\\bigr).\\]\n\nNo coordinates or vector operations are needed.\n\nTaking the infimum of lengths of curves joining two points defines an intrinsic path distance, which may differ from the original metric. On a sphere, for example, straight-line distance through the surrounding space differs from the shortest surface-path distance.\n\nRiemannian manifolds\n\nOn a Riemannian manifold, a metric tensor \\(g\\) specifies the lengths of tangent vectors. A piecewise smooth curve has length\n\n\\[L(\\gamma)= \\int_a^b \\sqrt{g_{\\gamma(t)}\\bigl(\\dot\\gamma(t),\\dot\\gamma(t)\\bigr)}\\,dt.\\]\n\nIn local coordinates,\n\n\\[L= \\int_a^b \\sqrt{\\sum_{i,j} g_{ij}(x(t))\\dot x^i(t)\\dot x^j(t)}\\,dt.\\]\n\nThis formula underlies Riemannian distance and the study of geodesics. Geodesics locally minimize length over sufficiently short segments, but a long geodesic segment need not be the globally shortest path between its endpoints."
    },
    {
      "heading": "Computation and applications",
      "text": "In numerical analysis, arc length is commonly approximated either by summing chord lengths from sampled points or by numerically integrating speed. Chord sums do not exceed the true length, and nested refinements give nondecreasing estimates. Sparse samples can nevertheless miss substantial oscillation; without assumptions about the curve between samples, they provide no reliable upper bound.\n\nArc length also supplies the element \\(ds\\) in a scalar line integral:\n\n\\[\\int_\\gamma f\\,ds = \\int_a^b f(\\gamma(t))\\|\\gamma'(t)\\|\\,dt.\\]\n\nFor example, integrating a wire's linear mass density against \\(ds\\) gives its mass. Arc-length parametrization is also used to describe constant-speed motion and to space points evenly along modeled paths."
    },
    {
      "heading": "Historical development",
      "text": "Determining a curve's length was traditionally called rectification. Ancient Greek work on circular length used inscribed and circumscribed polygons; Archimedes used such constructions to bound the ratio of a circle's circumference to its diameter.\n\nThe development of calculus in the seventeenth century made rectification part of a systematic theory of integration. Later analysis clarified which curves have finite length and why integral formulas require regularity assumptions. The polygonal-supremum definition remains the foundation because it applies even when derivatives are unavailable."
    }
  ],
  "links": [
    "euclidean-space",
    "integral",
    "norm-mathematics",
    "derivative",
    "triangle-inequality",
    "graph-of-a-function",
    "polar-coordinates",
    "circle",
    "radian",
    "parabola",
    "ellipse",
    "inverse-function",
    "differential-geometry",
    "almost-everywhere",
    "fractal",
    "absolute-continuity",
    "lebesgue-integral",
    "lipschitz-continuity",
    "metric-space",
    "metric-tensor",
    "geodesic",
    "numerical-analysis",
    "line-integral",
    "archimedes",
    "calculus"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}