Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

H-one local length comparison for a conjugate-free geodesic

Statement

Assume Countable Choice. Let (M,g) be a connected finite-dimensional Riemannian manifold without boundary and let γ:[a,b]→M, a<b, be an affinely parametrized Levi-Civita geodesic with no point conjugate to γ(a) along γ∣[a,t] for a<t≤b. There is ε>0 such that each fixed-endpoint H1 Riemannian curve α:[a,b]→M with sup⁡tdg(α(t),γ(t))<ε obeys Lg(α)≥Lg(γ). If equality holds and γ is nonconstant, there is an absolutely continuous nondecreasing surjection τ:[a,b]→[a,b], with τ(a)=a, τ(b)=b and τ′∈L2, such that α=γ∘τ. If γ is constant, equality forces α=γ.

Facts & Assumptions

Given: The manifold, conjugate-free geodesic and fixed-endpoint H1 competitor in the statement. Put p=γ(a), v=γ˙(a) and X=(b−a)v.

[F1]

Under Countable Choice, an H1 manifold curve is continuous, has finitely many coordinate primitives with L2 derivatives, and smooth compositions obey the a.e. chain rule; its length is the integral of its metric speed (The Axiom of Countable Choice (ACω), H-one Riemannian curves and their half-energy).

[F2]

The proof of Local length comparison for a conjugate-free geodesic constructs a positive radius and a finite partition a=t0<⋯<tN=b, open tangent balls Vi⊂TpM on which exp⁡p is a diffeomorphism, and smooth inverse branches βi on their images. Its steps 3.1--6.1 show, using only continuity and uniform closeness before the regularity assertion, that any continuous curve within that radius has a continuous pullback φ:[a,b]→TpM with φ∣[ti−1,ti]=βi∘α, exp⁡p∘φ=α, φ(a)=0, and φ(b)=X. The same lemma's step 1.1 shows γ(t)=exp⁡p((t−a)v).

[F3]

Gauss lemma says radial and tangential images under dexp⁡p are orthogonal and the radial image has its original radial norm (Gauss lemma). A Levi-Civita geodesic has constant speed, so Lg(γ)=(b−a)∣v∣g=∣X∣g (Geodesics have constant speed for a metric-compatible connection).

[F4]

Dominated convergence passes an a.e. convergent sequence bounded by an integrable function through the Lebesgue integral (Dominated convergence).

Proof

1.1F1F2

The square-integrable inverse-branch pullback. [F1, F2, given] Take the radius, partition and branches of [F2]. Their domain and gluing arguments use the continuity of α, which follows from [F1]; no piecewise-C1 hypothesis is used in that part. On each closed strip, φi=βi∘α is a smooth composition of an H1 curve and hence a vector-valued primitive with L2 derivative by [F1]. The finitely many φi agree at strip boundaries by [F2], and so glue to one H1 vector primitive φ with φ(a)=0, φ(b)=X and α=exp⁡p∘φ. The a.e. chain rule gives α˙=d(exp⁡p)φφ′ on each strip.

2.1F1F3step 1.1

Radial comparison on every subinterval. [F1, F3, step 1.1, given] For σ>0 set fσ(t)=∣φ(t)∣g2+σ2. This is a primitive with L2 derivative fσ′=⟨φ,φ′⟩/fσ a.e. by [F1]. At a point where φ≠0, decompose φ′=cφ+w with w⊥φ. Gauss lemma [F3] and step 1.1 give ∣α˙∣g2=c2∣φ∣g2+∣d(exp⁡p)φw∣g2≥∣fσ′∣2. At φ=0, fσ′=0, so the inequality remains true. Thus on every [u,z]⊂[a,b], integration of the nonnegative speed and the primitive identity on the finite strips yield Lg(α∣[u,z])≥∫uz∣fσ′∣ dt≥∣fσ(z)−fσ(u)∣. Letting σ↓0 proves the subinterval bound Lg(α∣[u,z])≥∣∣φ(z)∣g−∣φ(u)∣g∣ and, at the endpoints, Lg(α)≥∣X∣g=Lg(γ) by [F3].

3.1F1step 1.1step 2.1

Equality makes the radius monotone. [F1, step 1.1, step 2.1, given] Suppose Lg(α)=∣X∣g and put r=∣φ∣g. Because length is an integral, it is additive across any finite subdivision. If r(s)>r(z) for some s<z, first r(z)≤∣X∣g: otherwise the subinterval bounds on [a,z] and [z,b] give Lg(α)≥r(z)+(r(z)−∣X∣g)>∣X∣g. Then step 2.1 on [a,s], [s,z], and [z,b] gives Lg(α)≥r(s)+(r(s)−r(z))+(∣X∣g−r(z))>∣X∣g, a contradiction. Hence r is nondecreasing. If X=0, then the same bound gives r=0; step 1.1 gives α=exp⁡p(0)=γ. If X≠0, continuity and monotonicity imply {r>0}=(c,b] for some c∈[a,b), with r=0 before c.

4.1F1F3F4step 1.1step 3.1

The radial primitive and a.e. equality. [F1, F3, F4, step 1.1, step 3.1, given] The function r is itself a primitive. Indeed fσ→r uniformly, while fσ′ is dominated by ∣φ′∣∈L1 and converges a.e. as σ↓0 to h=⟨φ,φ′⟩/r on {r>0} and h=0 on {r=0}. Dominated convergence [F4] in the primitive identities gives r(t)=r(a)+∫ath, so r′=h a.e. and r′≥0 a.e. On {r>0} Gauss lemma gives, with w=φ′−(r′/r)φ⊥φ, ∣α˙∣g2=(r′)2+∣d(exp⁡p)φw∣g2. On {r=0} the comparison ∣α˙∣g≥r′=0 is trivial. Thus ∣α˙∣g−r′≥0 a.e.; its integral is Lg(α)−(r(b)−r(a))=∣X∣g−∣X∣g=0. It follows that ∣α˙∣g=r′ a.e. Each inverse branch is a diffeomorphism, so d(exp⁡p)φ is injective on its strip; the displayed identity then gives w=0 a.e. on {r>0}.

5.1F1F2step 1.1step 3.1step 4.1∎

Constant direction and reparametrization. [F1, F2, step 1.1, step 3.1, step 4.1, given] On each compact subinterval of (c,b], the map e=φ/r is an H1 primitive by smooth superposition [F1], and step 4.1 gives e′=w/r=0 a.e. Its primitive identity makes e constant there; overlapping subintervals make the constant common. Since φ(b)=X, it is e0=X/∣X∣g=v/∣v∣g. Thus φ(t)=r(t)e0 for all t, including [a,c] where both sides vanish. Define τ(t)=a+r(t)/∣v∣g. By step 4.1 it is an absolutely continuous nondecreasing function with L2 derivative; its endpoint values are a,b, hence it is a surjection. The radial exponential identity in [F2] now gives α(t)=exp⁡p(r(t)e0)=γ(τ(t)) for every t. Together with step 3.1 this proves both equality cases.

Depends on

Used by

Dependency tree · two levels

63 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