Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

A finite endpoint of a maximal unit-speed geodesic produces a Cauchy curve

Statement

Let M be a Riemannian manifold, let I=(a,b) be a nonempty open interval with b<, and let γ:IM be a unit-speed geodesic. Let C be the connected component containing its image, and let dC be the Riemannian distance of the restricted metric on C. Then γ is Cauchy as tb, in the explicit sense that for every ε>0 there is TI such that T<s,t<bdC(γ(s),γ(t))<ε.

In particular this holds at a finite right endpoint of the maximal interval of a maximal unit-speed geodesic. By reversing the parameter, the analogous statement holds as ta when a>.

Facts & Assumptions

Given: The manifold, interval, component, and unit-speed geodesic in the statement.

[F1]

Connected components of a manifold are open (Components of a topological manifold are open and at most countable), so C inherits a connected Riemannian-manifold structure. A path component lies in a connected component (Every path-connected space is connected, and every path component lies inside a component).

[F2]

Riemannian distance on a connected manifold defines dC as the infimum of lengths of piecewise-C1 curves in C, Riemannian distance is a metric makes it symmetric, and Length dominates endpoint distance gives endpoint distance at most the length of any such curve.

[F3]

For a C1 curve, Riemannian speed and length gives Lg(γ[s,t])=stγ(u)gdu.

Proof

1.1

Fix rI. For every tI, the restriction of γ between r and t, affinely reparametrized to [0,1], is a path from γ(r) to γ(t). Thus the image of γ lies in the path component of γ(r) and hence in the single connected component C; openness from [F1] makes every restricted segment a curve in the Riemannian manifold C.

F1given
2.1

If s<t are in I, the unit-speed hypothesis and [F3] give Lg(γ[s,t])=st1du=ts. Applying [F2] in C therefore yields dC(γ(s),γ(t))ts=ts. The same inequality for t<s follows by interchanging the two parameters, and equality of the parameters gives distance zero.

F2F3step 1.1algebra
3.1

Let ε>0 and put T=max{r,bε/2}. Both entries of the maximum are less than b, so TI. If T<s,t<b, then st<bTε/2<ε; step 2.1 gives dC(γ(s),γ(t))<ε. This is exactly the displayed Cauchy condition.

step 2.1algebra
4.1

Maximality was not needed, so the special case for a maximal geodesic is immediate. If a>, the curve uγ(u) is again unit speed on (b,a), and step 3.1 at its finite right endpoint a gives the stated left-endpoint version. The empty manifold admits no curve with nonempty domain; in dimension zero there is no unit-speed curve, while dimension one is covered unchanged. The assumptions I and b< exclude an empty source and an infinite endpoint; arbitrarily small positive ε is handled explicitly. No choice principle is used: r is one fixed witness from the given nonempty interval and T is a formula.

step 3.1givenalgebra

Remarks

  • Andrews writes the estimate d(γ(s),γ(t))st and immediately concludes that γ(t) is Cauchy as t approaches the finite endpoint in the proof of Theorem 11.5.1. The proof above spells out its quantifiers and makes distance well defined even when the ambient manifold is disconnected.
  • The original scaffold listed constant speed as a dependency, but unit speed is already a hypothesis. No constant-speed theorem is used here.

Depends on

Used by

Dependency tree · two levels

27 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