Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-13
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Length minimizers are constant-speed geodesics up to reparametrization

Statement

Assume ACω. Let (M,g) be a smooth boundaryless Riemannian manifold, let a<b, and let c:[a,b]M be a piecewise smooth curve that minimizes length among all piecewise-C1 curves with the same endpoints. Put L=Lg(c). If c is nonconstant, then L>0 and there are a unique continuous nondecreasing surjection s:[a,b][0,L],s(t)=Lg(c[a,t]), and a unique curve cˉ:[0,L]M such that c=cˉs. The curve cˉ is a unit-speed affinely parametrized geodesic. Consequently c~(t)=cˉ ⁣(L(ta)ba) is a constant-speed geodesic on [a,b] with the same oriented trace as c.

Thus the precise ``no corners'' conclusion is that the constant-speed representative cˉ is smooth and unbroken. At a breakpoint of the original parametrization, any two nonzero one-sided velocities are positive multiples of the same tangent vector. A jump involving a zero velocity may remain in the original parametrization, whether the zero-speed points are isolated, accumulate, or occupy a pause interval; the arclength factorization regularizes the parametrization and collapses every pause interval.

Facts & Assumptions

Given: The manifold, interval, curve, and minimizing hypothesis in the statement; C denotes the connected component of c(a).

[A1]
[F1]

Piecewise c one curve on a manifold, Riemannian speed and length, and Riemannian length is independent of piecewise c one subdivision make the piecewise speed integrable, allow pauses, and make every restricted length independent of a refined subdivision. Length is additive under concatenation and invariant under reversal gives additivity under finite concatenation.

[F2]

Components of a topological manifold are open and at most countable makes C an open connected Riemannian submanifold. By Every path-connected space is connected, and every path component lies inside a component, the trace of every path beginning in C stays in C. Thus Riemannian distance on a connected manifold and Riemannian distance is a metric give a finite genuine metric dC whose competitors are exactly the ambient piecewise-C1 paths between points of C.

[F4]

The riemannian distance topology is the manifold topology identifies the dC-topology with the submanifold topology.

[F5]

Under [A1], Existence of geodesically convex neighborhoods gives each point a strongly geodesically convex open neighbourhood and says that every piecewise smooth global minimizer between two points of that neighbourhood is a monotone reparametrization of its unique normalized minimizing geodesic.

[F6]

Riemannian length is invariant under orientation preserving piecewise c one reparametrization includes nondecreasing reparametrizations with constant intervals. Geodesics have constant speed for a metric-compatible connection gives constant speed, and Affine reparametrization of a geodesic is a geodesic preserves the geodesic equation under affine changes of parameter.

[F7]

On every smooth piece, The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F(c)=f(c); in particular a continuous f has F as a primitive differentiates its cumulative speed integral, and The chain rule for differentials of smooth maps is the intrinsic chain rule. Geodesic of an affine connection makes smoothness and the local equation Dtγ=0 the defining geodesic conditions.

Proof

technique · direct
1.1

Every path beginning at c(a) has path-connected, hence connected, trace and therefore lies in C by [F2]. In particular c([a,b])C, and the ambient minimizing hypothesis is equivalent to L=dC(c(a),c(b)). If auvb, then c[u,v] also minimizes between its endpoints: otherwise concatenating c[a,u], a shorter competitor, and c[v,b] would, by [F1], give a curve from c(a) to c(b) of length less than L. Hence Lg(c[u,v])=dC(c(u),c(v)).

F1F2givencontradiction
2.1

Fix an admissible finite smooth subdivision and let w(t)=c˙(t)g on each piece, assigning arbitrary one-sided values at the finitely many breakpoints. By [F1], w is bounded, nonnegative and Riemann integrable, and s(t):=atw=Lg(c[a,t]),s(v)s(u)=Lg(c[u,v])(uv). Thus s is nondecreasing, while [F3] makes it continuous; moreover s(a)=0 and s(b)=L. If L=0, the displayed identity and step 1.1 give dC(c(a),c(t))=s(t)=0 for every t, so the metric property in [F2] makes c constant. Therefore the assumed nonconstant curve has L>0, and [F3] makes s surjective onto [0,L].

F1F2F3step 1.1
3.1

For r[0,L], define cˉ(r)=c(t) for any t satisfying s(t)=r. This is well defined: if uv are two such parameters, then step 2.1 gives Lg(c[u,v])=0, and step 1.1 plus the metric property gives c(u)=c(v). Existence of a parameter is step 2.1, so this unique-value definition makes no selection. It gives c=cˉs, and uniqueness follows from surjectivity of s.

F2F3step 1.1step 2.1
4.1

If 0rqL, take u,v with s(u)=r and s(v)=q. Monotonicity gives uv unless r=q, and steps 1.1--2.1 give dC(cˉ(r),cˉ(q))=Lg(c[u,v])=s(v)s(u)=qr. The case r=q is the metric diagonal. Thus cˉ is distance preserving and therefore dC-continuous; by [F4] it is continuous as a manifold-valued curve.

F2F4step 1.1step 2.1step 3.1
5.1

Fix r0[0,L]. By [F5], choose a strongly geodesically convex open neighbourhood W of cˉ(r0). Step 4.1 and [F4] give a positive relative interval J[0,L] about r0 with cˉ(J)W. Choose α<β in J so that r0[α,β], using a one-sided choice when r0 is 0 or L. Take uv with s(u)=α and s(v)=β. By step 1.1, c[u,v] is a global minimizer from x=cˉ(α) to y=cˉ(β), so [F5] supplies its unique normalized minimizing geodesic γ:[0,1]W and a continuous nondecreasing piecewise-smooth surjection h:[u,v][0,1] with c(t)=γ(h(t)).

A1F2F4F5step 1.1step 2.1step 3.1step 4.1
6.1

The connector γ has constant speed by [F6], and its length is dC(x,y)=βα by step 4.1, so that speed is βα. Applying [F6] to h[u,t]:[u,t][0,h(t)] gives s(t)α=Lg(c[u,t])=Lg(γ[0,h(t)])=(βα)h(t). For each r[α,β], continuity of s[u,v] supplies t[u,v] with s(t)=r. Hence step 3.1 yields cˉ(r)=γ ⁣(rαβα). By [F6], this is a unit-speed affinely parametrized geodesic on [α,β].

F3F6step 2.1step 3.1step 4.1step 5.1
7.1

Since r0 was arbitrary, step 6.1 represents cˉ near every point of [0,L] by an affine reparametrization of a smooth geodesic. Smoothness and the equation Drcˉ=0 are local, so [F7] makes cˉ a unit-speed geodesic on all of [0,L], with the prescribed one-sided endpoint interpretation. The affine map tL(ta)/(ba) is increasing and onto; [F6] therefore makes c~ a geodesic of constant speed L/(ba) with the same oriented trace as cˉ, hence as c.

F6F7step 3.1step 6.1
8.1

On the interior of each smooth piece of c, [F7] gives s(t)=w(t)=c˙(t)g, and the chain rule applied to c=cˉs gives c˙(t)=c˙(t)gcˉ(s(t)). The same formula holds for each one-sided derivative at a breakpoint. Since cˉ is continuous and has unit norm, two nonzero one-sided velocities there are positive multiples of the same vector. If one speed is zero, a derivative jump may remain in c regardless of whether zeros of speed are isolated, accumulate at the breakpoint, or include a pause interval. The map s collapses each interval on which no length is accumulated; in every case the unit-speed representative cˉ has no corner. This proves exactly the qualified no-corners assertion.

F1F7step 2.1step 3.1step 7.1
9.1

The empty manifold admits no such nonconstant curve. On a zero-dimensional manifold every interval-valued curve is locally constant, so the nonconstant case is again empty; dimension one is covered without change. Coincident endpoints force L=0 and hence constancy by step 2.1. The hypothesis a<b prevents a singleton source; both included endpoints were handled one-sidedly. Assumption [A1] is used exactly through [F5], whose convex-neighbourhood construction inherits ACω from the exponential-map development. The component, cumulative integral, unique-value factorization, two preimages at one proof instance, and finite local choices introduce no additional choice principle. There is one implication, not an iff claim.

A1F2F3F5F7step 2.1step 3.1step 5.1step 7.1step 8.1

Source locator

Steinbauer, Remark 2.3.10 and Corollary 2.3.11 with proof, printed pp.59--60, proves that subsegments of a minimizer minimize, covers the curve by convex neighbourhoods, reparametrizes the resulting pieces as geodesics, and removes every genuine break by uniqueness in a convex neighbourhood. Datar, Theorem 18.0.1 and Corollary 18.1.3 with proofs, printed pp.133--137, supplies the normal-neighbourhood uniqueness and minimizing ingredients. The cumulative-arclength argument here additionally treats zero-speed pauses explicitly instead of silently deleting constant parameter intervals.

Depends on

Used by

Dependency tree · two levels

106 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources