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

First-variation hinge derivative formula

Statement

Assume the inherited Axiom of Countable Choice ACω, carried through the distance and first-variation suppliers named below. Let (M,g) be a complete, connected, boundaryless Riemannian manifold.

(a) Smooth family form. Let ε>0, L>0, and let α:(−ε,ε)×[0,L]→M be smooth with each t↦α(s,t) an affinely parametrized geodesic whose velocity ∂tα(s,⋅) never vanishes. Write γ(t):=α(0,t), V:=∂sα(0,⋅) and let u(t) be the unit tangent of γ. Then s↦L(s):=Length⁡(α(s,⋅)) is differentiable at 0 and L′(0)=gM(V(L),u(L))−gM(V(0),u(0)). If moreover each member α(s,⋅) is minimizing between its own endpoints x(s):=α(s,0) and y(s):=α(s,L), then L(s)=dg(x(s),y(s)) for all s, so the same formula is the derivative of the distance between the two moving endpoints.

(b) Hinge form. Let o,p∈M with p≠o and p not a cut point of o, let σ:[0,ρ]→M be the unit-speed minimizing geodesic from o to p (so σ(0)=o, σ(ρ)=p, ρ>0), and let γ:[0,a]→M, a>0, be a unit-speed geodesic with γ(0)=p. Then t↦dg(o,γ(t)) has a right derivative at 0 and ddt∣0+dg(o,γ(t))=gp(γ˙(0),σ˙(ρ))=−cos⁡θ, where θ∈[0,π] is the angle at the hinge vertex p between the two legs, characterized by cos⁡θ:=−gp(σ˙(ρ),γ˙(0)) (the legs are unit speed, so −σ˙(ρ) is the unit direction from p back to o and γ˙(0) the unit direction from p along the other leg).

Facts & Assumptions

Given: The complete connected boundaryless Riemannian manifold (M,g), the smooth family α of part (a) with its geodesics and moving endpoints, and the hinge configuration (o,p,σ,γ) of part (b) with p∉Cut⁡(o).

[A1]

The countable-choice premise is the inherited ACω of the distance and first-variation suppliers used below (The Axiom of Countable Choice (ACω)); the computations add no selection.

[F1]

First variation of length: for a piecewise smooth variation α:(−ε,ε)×[a,b]→M with regular central curve γ=α(0,⋅), unit tangent U=T/∣T∣ on each smooth piece and variation field V=∂sα(0,⋅), dds∣s=0L(γs)=g(V(b),U(b−))−g(V(a),U(a+))−∑jg(V(tj),U(tj+)−U(tj−))−∑j∫tj−1tjg(V,DtU) dt with the corner sum empty for a smooth variation (First variation formula for length).

[F2]

The distance function ro:=dg(o,⋅) is smooth on the open set M∖({o}∪Cut⁡(o)), which contains p (Distance from p is smooth off p and the cut locus).

[F3]

At a point q=σ(ρ) before the cut time of the radial direction, grad⁡ro(q)=σ˙(ρ) is the outward unit radial field (Gradient of the distance is the outward unit radial field off the base point and the cut locus).

[F4]

The gradient is the metric dual of the differential: for smooth f, grad⁡f=(df)♯, so for a smooth curve t↦x(t), ddtf(x(t))=g(grad⁡f(x(t)),x˙(t)) (Gradient hessian and divergence connection formulas).

Proof

1.1F1given

The smooth family form. [F1, given] Apply [F1] to the variation α on the fixed interval [0,L], which is smooth and hence has no corner terms. The central curve γ=α(0,⋅) is an affinely parametrized geodesic with nowhere vanishing velocity, so Dtγ˙=0 and ∣γ˙∣ is constant; its unit tangent u=γ˙/∣γ˙∣ therefore satisfies Dtu=0 on [0,L]. Hence each integrand g(V,Dtu) in [F1] vanishes and the corner sum is empty, so the formula of part (a) follows. If each member is minimizing between its endpoints, then its length equals the distance of those endpoints, which is the stated interpretation.

1.2F2given

The hinge setting and the smooth locus. [F2, given] Since p∉({o}∪Cut⁡(o)) and [F2] makes ro smooth on the open complement of that set, there is δ>0 with γ(t)∉{o}∪Cut⁡(o) for every t∈[0,δ] (the curve γ is continuous at t=0 with γ(0)=p). On [0,δ] the composition t↦ro(γ(t))=dg(o,γ(t)) is smooth, hence its right derivative at 0 exists and equals the ordinary derivative at 0 of the restriction to [0,δ].

1.3F3given

The gradient at the terminal point. [F3, given] The segment σ∣[0,ρ] is the minimizing radial segment from o to p in the unit direction σ˙(0), and ρ>0; by [F3] its terminal velocity is the unit radial gradient, grad⁡ro(p)=σ˙(ρ) and ∣σ˙(ρ)∣=1.

2.1F3F4step 1.2step 1.3

Chain rule at the vertex. [F3, F4, step 1.2, step 1.3] By [F4] applied to f=ro and the curve γ on [0,δ], ddtdg(o,γ(t))=gγ(t)(grad⁡ro(γ(t)),γ˙(t)) for t∈(0,δ], and evaluating the right-hand side at t=0 by continuity with step 1.3 gives ddt∣0+dg(o,γ(t))=gp(σ˙(ρ),γ˙(0))=gp(γ˙(0),σ˙(ρ)), the metric being symmetric.

3.1step 2.1

Identification with the included angle. [step 2.1] Both legs are unit speed, so −σ˙(ρ) and γ˙(0) are unit vectors; the angle θ∈[0,π] at the vertex between the direction back along the first leg and the direction along the second leg is defined by cos⁡θ=gp(−σ˙(ρ),γ˙(0))=−gp(σ˙(ρ),γ˙(0)). Step 2.1 therefore reads ddt∣0+dg(o,γ(t))=−gp(−σ˙(ρ),γ˙(0))=−cos⁡θ, which is the formula of part (b). Since the metric is positive definite, ∣gp(σ˙(ρ),γ˙(0))∣≤1, so the derivative lies in [−1,1]. This proves both parts.

4.1A1F1F2F3F4step 1.1step 3.1∎

Boundary and choice audit. The hypotheses L>0 and "velocity never vanishes" are exactly the regularity requirement of [F1]; a>0 and ρ>0 keep both legs nondegenerate, and p≠o with p∉Cut⁡(o) is exactly what makes ro smooth at p in step 2.1 and the radial segment σ minimizing in step 1.3. For t=0 the derivative is one-sided, as stated. In dimension one the hinge angle is 0 or π and the formula reads ∓1, consistent with the fact that the opposite-side distance is locally the sum or difference of lengths. No step divides by the hinge angle or by the length of the second leg, and no minimality of γ is used. Exactly [A1] is inherited; no family is selected at any step.

Depends on

Used by

Dependency tree · two levels

57 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