Alphabeta Math
TheoremStatement: 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 minimize length in a normal neighborhood

Statement

Assume ACω. Suppose exp⁡p:Bρ(0p)→U is a diffeomorphism, where ρ>0, and let v∈Bρ(0p). The radial geodesic γv(t)=exp⁡p(tv), 0≤t≤1, has length ∣v∣gp and minimizes length among all piecewise smooth curves in U from p to exp⁡p(v).

If v≠0, equality holds precisely for the monotone radial reparametrizations c(t)=exp⁡p(r(t)v∣v∣gp), where r is continuous, piecewise smooth, nondecreasing, and has endpoint values 0 and ∣v∣gp. For v=0, equality holds precisely for the constant curve.

Facts & Assumptions

Given: The normal ball, vector, and competitor curves in the statement.

[A1]
[F1]

Under [A1], Gauss lemma gives unit radial speed, and Polar form of the metric in normal coordinates gives ∣c′∣g2=(r′)2+∣c⊥′∣g2 wherever c≠p. Riemannian speed and length defines length by finitely many speed integrals.

Proof

technique · direct
1.1F1given

Write R=∣v∣gp. By radial norm preservation in [F1], ∣γ˙v(t)∣g=R, so L(γv)=∫01R dt=R.

1.2F2given

Let c:[a,b]→U be piecewise smooth with c(a)=p, c(b)=exp⁡p(v), and put r(t)=∣exp⁡p−1(c(t))∣gp. Assume first R>0 and fix 0<δ<R. By [F2], the set Kδ={t:r(t)=δ} is nonempty; it is closed in the compact interval and hence compact, so [F2] gives its greatest element τδ. Then r(t)>δ for t>τδ: otherwise continuity and r(b)=R>δ would produce a later point of Kδ. Thus c avoids p on [τδ,b].

2.1F1F3step 1.1step 1.2

On every smooth piece of [τδ,b], [F1] gives ∣c′∣g≥∣r′∣. Summing the monotone integral inequalities and using [F3] gives L(c)≥L(c∣[τδ,b])≥∫τδb∣r′∣ dt≥R−δ. Since this holds for every 0<δ<R, L(c)≥R. If R=0, nonnegativity already gives L(c)≥0=L(γv). This proves minimality without differentiating r at a visit to p.

2.2F1F3step 1.1

Conversely, for a curve of the displayed form, [F1] gives ∣c′∣g=∣r′∣=r′ on each smooth piece. Newton--Leibniz and finite additivity in [F3] give L(c)=R, including any constant pauses. If R=0, equality means L(c)=0; [F3] forces the continuous speed to vanish on each smooth piece, so c is constant.

3.1F1F3step 2.1

The same argument proves the auxiliary estimate L(d)≥∣r(d1)−r(d0)∣ for any piecewise smooth d:[d0,d1]→U: if d avoids p, integrate the polar inequality directly; if it meets p, split there and apply step 2.1 to the reversed first part and the second part.

4.1F1step 2.1step 3.1

Suppose now R>0 and L(c)=R. For any t, step 2.1 on the prefix and step 3.1 on the suffix give R=L(c∣[a,t])+L(c∣[t,b])≥r(t)+∣R−r(t)∣. Hence r(t)≤R, and equality forces the two lower bounds to be equal. If a<u<w<b and c avoids p on [u,w], applying the prefix, middle, and suffix bounds gives R≥r(u)+∣r(w)−r(u)∣+R−r(w). Therefore r(w)≥r(u) and equality holds in the middle polar length estimate.

5.1F1F3step 4.1

On a closed subinterval of one smooth piece on which c≠p, step 4.1 and Newton--Leibniz give zero integral for the continuous nonnegative function ∣c′∣g−r′. By [F3] it vanishes identically. The polar identity in [F1] then gives c⊥′=0 and r′≥0. Writing exp⁡p−1(c)=rθ with ∣θ∣=1, invertibility of dexp⁡p gives rθ′=0; hence [F3] makes θ constant on every nonzero component. A component that later returned to p would have positive nondecreasing r tending to zero, which is impossible. Thus c is constant at p until its final nonzero component, and there θ=v/R and r is nondecreasing. This proves the stated necessary form.

6.1A1F1F2F3step 2.1step 5.1step 2.2∎

Steps 2.1, 5.1, and 2.2 prove minimality and both equality directions. In dimension zero only v=0 occurs; dimension one permits the two radial directions and the proof fixes the one containing v. Empty M has no centre. The open-ball condition excludes ∣v∣=ρ, while v=0, visits to the centre, subdivision endpoints, and constant pauses were treated explicitly. Assumption [A1] is used exactly through [F1] for the exponential and polar structures; last hitting times are unique maxima, and no further choice is made.

Depends on

Dependency tree · 2 levels

Sources