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.

Radial geodesics from one point reach every point under global exponential domain

Statement

Assume ACω. Let (M,g) be a boundaryless Riemannian manifold, let pM, and write Cp for the connected component of p. Suppose the fibre exponential map is defined on every tangent vector at p, so Ep=TpM.

For every qCp there is a vector vTpM such that expp(v)=q,vgp=dgCp(p,q), and the radial geodesic texpp(tv), 0t1, has length vgp and globally minimizes length from p to q inside Cp (equivalently, among all piecewise-C1 curves in M with those endpoints).

More precisely, if qp, put =dgCp(p,q). The vector can be written v=u with ugp=1, and the unit-speed radial geodesic γ(s)=expp(su) satisfies dgCp(γ(s),q)=s(0s).

Facts & Assumptions

Given: The boundaryless Riemannian manifold, point p, global fibre exponential domain, and target qCp in the statement.

[A1]
[F1]

Components of a topological manifold are open and at most countable makes Cp an open connected boundaryless Riemannian manifold after restriction. Riemannian distance on a connected manifold defines its finite distance d, Riemannian distance is a metric supplies the triangle inequality and separation, and The riemannian distance topology is the manifold topology identifies its metric and manifold topologies.

[F2]

Riemannian speed and length computes the length of a unit-speed segment. Length dominates endpoint distance bounds endpoint distance by curve length, and Length is additive under concatenation and invariant under reversal gives the corresponding prefix--suffix calculation.

[F3]

Under [A1], Existence of normal neighborhoods supplies a normal exponential neighbourhood at any fixed point. Local formula for distance from the centre of a normal neighbourhood identifies tangent radius with global Riemannian distance there.

[F5]

Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b) applies to the continuous function td(x,c(t)) along a competitor curve. Its continuity follows directly from the triangle inequality in [F1].

[F6]

Under [A1], The exponential map scales geodesic time identifies exponential rays with the corresponding geodesics, Geodesics have constant speed for a metric-compatible connection gives their speed, and Existence uniqueness and smooth dependence of geodesics gives initial-value uniqueness.

[F7]

Under [A1], Length minimizers are constant-speed geodesics up to reparametrization says that at a breakpoint of a global piecewise-smooth minimizer, its two nonzero one-sided velocities are positive multiples of the same tangent vector.

[F8]

The Cauchy-sequence reals have the least-upper-bound property supplies a supremum for a nonempty set of real parameters bounded above.

Proof

technique · direct
1.1

We first prove the local sphere step used at both frontiers. Fix x,yCp with D=d(x,y)>0. Their component is positive-dimensional. Choose a coordinate basis of TxM and orthonormalize it by [F4]. By [F3], expx is a diffeomorphism from an open neighbourhood of 0x onto an open neighbourhood of x. In the orthonormal coordinates, [F4] supplies ρ>0 whose open norm ball Bρ(0x) lies in that source; after restriction, put U=expx(Bρ(0x)). Thus expx:Bρ(0x)U is a diffeomorphism and U is open. By [F1], choose a>0 with the metric ball Bd(x,a)U, and fix 0<δ<min{ρ,a,D}.

F1F3F4given
2.1

Put Σδ={wTxM:wgx=δ} and Sδ(x)=expx(Σδ). Since D>0, the component is not zero-dimensional, so Σδ is nonempty. It is closed and bounded in the orthonormal coordinates and hence compact by [F4]; the normal exponential is continuous, so [F4] makes Sδ(x) compact. The local distance formula in [F3], together with Bd(x,a)U, gives the exact equality Sδ(x)={zCp:d(x,z)=δ}.

F1F3F4step 1.1
3.1

The function h:Sδ(x)R, h(z)=d(z,y), is continuous because the triangle inequality gives h(z)h(z)d(z,z). By [F4] it attains a minimum at some z0Sδ(x). The triangle inequality and step 2.1 give D=d(x,y)d(x,z0)+d(z0,y)=δ+h(z0), so h(z0)Dδ.

F1F4step 2.1
4.1

Suppose h(z0)>Dδ and put κ=(h(z0)D+δ)/2>0. The infimum definition of D in [F1] supplies one piecewise C1 curve c:[b0,b1]Cp from x to y with L(c)<D+κ. By [F5], the continuous function td(x,c(t)), whose endpoint values are 0 and D, takes the value δ at some τ. Step 2.1 puts c(τ) in Sδ(x). By [F2], L(c[b0,τ])δ,d(c(τ),y)L(c[τ,b1])=L(c)L(c[b0,τ])<Dδ+κ<h(z0), contradicting the minimality of z0. Therefore d(x,y)=δ+d(z0,y). This proves the local sphere step without choosing a sequence of approximate minimizers.

F1F2F5step 2.1step 3.1assume-contradischarge-contradiction
5.1

Return to p,q. If q=p, take v=0p; the radial curve is constant, has length and distance zero, and is minimizing. Suppose qp and put =d(p,q)>0. Apply steps 1.1--4.1 with x=p, y=q, and a sufficiently small ε in place of δ. There are zεSε(p) and a unit vector uTpM with zε=expp(εu),=ε+d(zε,q).

F1F3step 1.1step 2.1step 4.1
6.1

Because Ep=TpM, every su belongs to Ep. By [F6], γ(s)=expp(su) is therefore defined for every real s and is the geodesic with initial velocity u. Its image is connected and contains p, so it lies in Cp and the distance d used below is defined on it. Its speed is constantly one, so [F2] gives L(γ[r,s])=sr whenever 0rs.

F1F2F6givenstep 5.1
7.1

Define A={t[0,]:=t+d(γ(t),q)}. Step 5.1 says εA. If tA and 0st, then [F1]--[F2] give s+d(γ(s),q)s+d(γ(s),γ(t))+d(γ(t),q)t+d(γ(t),q)=, whereas =d(p,q)d(p,γ(s))+d(γ(s),q)s+d(γ(s),q). Thus equality holds throughout, sA, and d(p,γ(s))=s; in particular every prefix ending at a parameter in A is minimizing.

F1F2step 5.1step 6.1
8.1

By [F8], T=supA exists and εT. We claim TA. Given η>0, the definition of supremum supplies tA with Tη<tT; otherwise Tη would be a smaller upper bound. The triangle inequality and step 6.1 give d(γ(T),q)d(γ(t),q)d(γ(T),γ(t))Tt<η. Since d(γ(t),q)=t, the difference between d(γ(T),q) and T has absolute value less than 2η. If that difference were nonzero, taking η smaller than one third of its absolute value would be impossible. Hence d(γ(T),q)=T and TA.

F1F2F8step 6.1step 7.1
9.1

Suppose, for contradiction, that T<, and put x=γ(T). Carry out steps 1.1--4.1 for x,q, choosing 0<δ<min{T,T} as well as smaller than the local normal and metric radii there. We obtain z0=expx(δw) for a unit wTxM, with radial segment σ(s)=expx(sw), 0sδ, and d(x,q)=δ+d(z0,q)=T.

F3F4step 1.1step 2.1step 4.1step 8.1assume-contra
10.1

Concatenate γ[0,T] with σ. By [F2], [F3], and step 6.1 its length is T+δ. On the other hand, the triangle inequality and step 9.1 give =d(p,q)d(p,z0)+d(z0,q)=d(p,z0)+Tδ, so d(p,z0)T+δ. The concatenated curve therefore has length exactly d(p,z0)=T+δ and is globally minimizing. Every one of its subarcs is also minimizing, since a shorter replacement would shorten the full curve by finite additivity.

F1F2F3step 6.1step 9.1
11.1

The entire concatenation in step 10.1 is a piecewise smooth global minimizer, with the unit vectors γ(T) and w as its nonzero one-sided velocities at its sole possible corner x. By [F7] these vectors are positive multiples of the same tangent vector; because both have norm one, they are equal. Initial-value uniqueness in [F6] now gives σ(s)=γ(T+s)(0sδ).

F6F7step 6.1step 9.1step 10.1
12.1

Thus z0=γ(T+δ), and step 9.1 becomes =(T+δ)+d(γ(T+δ),q). So T+δA, contradicting that T is an upper bound of A. Therefore T=. Since TA, [F1] gives d(γ(),q)=0 and hence γ()=q.

F1F8step 8.1step 9.1step 11.1discharge-contradiction
13.1

Step 7.1 and T= show d(γ(s),q)=s and d(p,γ(s))=s for every s[0,]. Hence the unit-speed radial curve γ[0,] has length =d(p,q) and is minimizing. Put v=u. By [F6], expp(v)=γ()=q, and texpp(tv)=γ(t) has length =vgp.

F1F2F6step 5.1step 6.1step 7.1step 12.1
14.1

Every piecewise-C1 curve from p has connected image and therefore stays in Cp, so minimizing inside Cp is equivalent to minimizing among such curves in M with these endpoints. Empty M supplies no p. In dimension zero each component is an open singleton, so only the constant case of step 5.1 occurs; dimension one is covered because its positive-radius tangent sphere has two points. Zero distance and zero velocity were handled in step 5.1, all normal and metric radii were chosen strictly below their open endpoints, and the parameter endpoints 0, were included in steps 8.1 and 12.1. No converse is claimed. Assumption [A1] is used exactly through [F3], [F6], and [F7] for the already-constructed normal/exponential, global-geodesic, and minimizer-regularity results. Each compact minimum, basis, radius, and near-minimizing curve is instantiated only at one of finitely many fixed stages; the sphere-crossing and supremum arguments select no sequence or arbitrary family, so no further choice is used.

A1F1F3F4F5F6F7F8step 4.1step 5.1step 8.1step 12.1step 13.1

Source locator

Datar, Theorem 19.2.1, implication (3) to (5), printed pp.142--144, supplies the compact first sphere, its distance-minimizing point, the additive distance identity, and the maximal radial endpoint argument. Andrews, Theorem 11.5.1, implication (3) to (*p), printed pp.107--108 (PDF pp.7--8), independently supplies the fixed-target set A, its downward closure, and the local continuation. The proof above makes their abbreviated assertions that every competitor crosses the small sphere and that the concatenated minimizer has no corner explicit, and it replaces both sequential limit choices by one attained compact minimum and a supremum argument.

Depends on

Used by

Dependency tree · two levels

121 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