Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Gradient of the distance is the outward unit radial field off the base point and the cut locus

Statement

Assume the inherited Axiom of Countable Choice ACω. Let (M,g) be a complete, connected, boundaryless, finite-dimensional Riemannian manifold, let p∈M, let v∈SpM be a unit tangent vector and let 0<t<cp(v) be a time before the cut time. Write γ:=γp,v for the geodesic with γ(0)=p and γ˙(0)=v, and put q:=γ(t)=exp⁡p(tv). Then grad⁡rp(q)=γ˙(t)=d(exp⁡p)tv(v), the terminal velocity of the radial segment γ∣[0,t], and this vector has pointwise norm one: ∣grad⁡rp(q)∣g=1. Since 0<t<cp(v) the segment γ∣[0,t] is the minimizing radial geodesic from p to q, so along it the gradient of the distance from p is the outward unit radial field. In dimension zero SpM=∅ and the assertion is vacuous; no compactness of M is assumed.

Facts & Assumptions

Given: The Axiom of Countable Choice; a complete, connected, boundaryless, finite-dimensional Riemannian manifold (M,g); a point p∈M; a unit vector v∈SpM; a time 0<t<cp(v); the geodesic γ=γp,v with γ(0)=p, γ˙(0)=v; the point w0:=tv∈TpM; the point q:=γ(t)=exp⁡p(tv); the vector u:=d(exp⁡p)tv(v)∈TqM; the distance rp:M→R, rp(x):=dg(p,x); and the pointwise norm Np(w)=∣w∣g on TpM.

[A1]

The Axiom of Countable Choice ACω is the standing assumption (The Axiom of Countable Choice (ACω)).

[F1]

Under [A1], rp is smooth on the open set M∖({p}∪Cut⁡(p)) and rp(exp⁡p(w))=∣w∣g for every w in the tangent cut domain Dp={sv:v∈SpM, 0<s<cp(v)} (Distance from p is smooth off p and the cut locus).

[F2]

Under [A1], Dp is open in TpM, the set M∖({p}∪Cut⁡(p)) is an open submanifold of M, and exp⁡p∣Dp is a diffeomorphism of Dp onto it (The exponential map is a diffeomorphism on the open tangent cut domain).

[F3]

Under [A1], for a Riemannian manifold without boundary, w∈Ep and X∈TpM one has gexp⁡p(w)(d(exp⁡p)w(w),d(exp⁡p)w(X))=gp(w,X), and d(exp⁡p)w carries radial directions to geodesic velocities (Gauss lemma).

[F4]

Under [A1], a complete connected boundaryless Riemannian manifold has fibre exponential domain Ep=TpM at every point (Hopf–Rinow theorem).

[F5]

Under [A1], Ep is open in TpM and exp⁡p:Ep→M is smooth (The exponential domain is open and the exponential map is smooth).

[F6]

Under [A1], for v∈TpM and s∈R one has s∈Ip,v⇔sv∈Ep, and then exp⁡p(sv)=γp,v(s) (The exponential map scales geodesic time).

[F7]

Under [A1], every (p,v)∈TM has a unique maximal geodesic γp,v:Ip,v→M with γp,v(0)=p and γp,v′(0)=v, and (s,p,v)↦γp,v(s) is smooth on its open domain (Existence uniqueness and smooth dependence of geodesics).

[F8]

Np is smooth on TpM∖{0p} (The pointwise norm on a tangent space is smooth off the zero vector).

[F9]

The pointwise norm is ∣w∣g=gp(w,w), the norm of the zero vector is zero, and ∣w∣g>0 for nonzero w (Pointwise norm and angle from a riemannian metric).

[F10]

If F:M→N and G:N→P are smooth, then d(G∘F)x=dGF(x)∘dFx for every x∈M (The chain rule for differentials of smooth maps).

[F11]

If c is a smooth curve with c(0)=x and F is smooth, then dFx(c˙(0)) is the velocity of F∘c at 0 (The differential sends curve velocities to composite curve velocities).

[F12]

For real α, the function x↦xα is differentiable on (0,∞) with derivative (xα)′=αxα−1 (Continuity and derivatives of positive-base real powers).

[F16]

The differential of a diffeomorphism at every point is a linear isomorphism (The differential of a diffeomorphism is an isomorphism).

[F17]

dFx:TxM→TF(x)N is linear, for every smooth F:M→N (The differential sends derivations to derivations and is linear).

[F18]

A Riemannian metric is a smooth symmetric covariant two-tensor with gp(w,w)>0 for every nonzero w∈TpM; in particular gp is a symmetric positive definite bilinear form on TpM (Riemannian metric and riemannian manifold).

[F19]

For every smooth real function f on a Riemannian manifold, its gradient is characterized by gx((grad⁡f)x,Y)=dfx(Y) for every x and every Y∈TxM; this is the defining identity for the gradient used here.

[F20]

On an inner product space, ∥w∥=⟨w,w⟩ satisfies ∥λw∥=∣λ∣ ∥w∥ (The induced length is a norm).

[F21]
[F22]

Rational powers satisfy a−r=(ar)−1 and (ar)s=ars for a>0 (Laws of rational exponents).

[F23]

Integer powers satisfy a1=a (Integer powers am).

[F24]

For the unit direction v∈SpM and its geodesic γv(s)=exp⁡p(sv), every 0≤s<cp(v) is a minimizing time, and if cp(v)=+∞ every finite radial segment minimizes (Cut point and cut locus of a point).

[F25]

For a smooth curve γ with γ(0)=x, its velocity derivation at 0 is γ˙(0)([f])=(f∘γ)′(0) (The velocity derivation of a smooth curve).

Proof

Proof technique: direct. The differential of the composite rp∘exp⁡p=Np is computed from the derivative of the pointwise norm along lines, and Gauss's lemma identifies the resulting pairing with g(γ˙(t),⋅); surjectivity of d(exp⁡p)tv upgrades the pairing identity on the image to the characterizing identity of the gradient.

1.1

Setup, and the identification of u with γ˙(t). [A1, F1, F2, F4, F5, F6, F7, F11, F24, F25] By [F4] and [F5], Ep=TpM and exp⁡p:TpM→M is smooth. By [F6], t∈Ip,v and exp⁡p(tv)=γ(t); by [F7], γ is the unique maximal geodesic with γ(0)=p and γ˙(0)=v, and it is smooth. Since v∈SpM and 0<t<cp(v), the vector w0=tv lies in Dp, so [F2] puts q=exp⁡p(w0) in the open submanifold U:=M∖({p}∪Cut⁡(p)), on which rp is smooth by [F1]; hence grad⁡rp(q) is defined by [F19]. The segment γ∣[0,t] is minimizing by [F24]. For the velocity, consider the smooth curve c(s):=w0+sv in the vector space TpM, so that c(0)=w0 and c˙(0)=v under the canonical identification Tw0(TpM)≅TpM [F25]. Since exp⁡p(c(s))=exp⁡p((t+s)v)=γ(t+s) by [F6], [F11] gives d(exp⁡p)w0(v)=(d/ds)∣0 (exp⁡p∘c)(s)=γ˙(t), that is, u=γ˙(t) [F25].

1.2

The composite and its differential. [F1, F2, F5, F8, F9, F10, F25] By [F1], rp(exp⁡p(w))=∣w∣g for every w∈Dp, and by [F2] the set Dp is open with w0∈Dp and exp⁡p(w0)=q. Both exp⁡p (smooth on TpM by [F5] and [F4]) and rp (smooth on U by [F1]) are smooth, so [F10] applies at w0 and gives d(rp∘exp⁡p)w0=d(rp)q∘d(exp⁡p)w0. Because rp∘exp⁡p agrees on the open set Dp with the function Np of [F9], which is smooth on TpM∖{0p} by [F8] and defined at the nonzero vector w0 (as t>0 and v≠0), we obtain the identity of linear maps d(rp)q∘d(exp⁡p)w0=d(Np)w0:TpM→R, where both sides are read through the canonical identification Tw0(TpM)≅TpM [F25].

1.3

The derivative of the squared norm along a line. [F14, F15, F18] Fix X∈TpM and put Q(w):=gp(w,w), so that Q is a quadratic form on TpM [F18]. Along c(s)=w0+sX, bilinearity and symmetry of gp [F18] give Q(c(s))=gp(w0,w0)+2s gp(w0,X)+s2gp(X,X); the right-hand side is a polynomial in s with constant term Q(w0), linear coefficient 2gp(w0,X) and quadratic coefficient Q(X), so by the sum, scalar and product rules [F14] together with the power derivatives p0′=0, p1′=1, p2′(0)=0 [F15] its derivative at 0 is 2gp(w0,X). Since Q∘c is that polynomial, (Q∘c)′(0)=2gp(w0,X); this is a statement about one real function of s and needs no smoothness of Q beyond the polynomial displayed.

2.1

The differential of the pointwise norm. [F8, F9, F11, F12, F13, F18, F20, F21, F22, F23, step 1.3] Fix X∈TpM and let c(s)=w0+sX as in step 1.3. Since c(0)=w0≠0, the vector c(s) is nonzero for all sufficiently small s; for those s the pointwise norm is positive and, by [F9] and [F21], Np(c(s))=gp(c(s),c(s))1/2=(Q(c(s)))1/2. Write ψ:=Q∘c, a real function differentiable at 0 with ψ(0)=Q(w0)=∣w0∣g2=(t ∣v∣g)2=t2>0, the homogeneity ∣tv∣g=t ∣v∣g being [F20], and with ψ′(0)=2gp(w0,X) by step 1.3. The real chain rule [F13] applied to Np∘c=ψ1/2 and the power derivative [F12] with exponent α=1/2 give (Np∘c)′(0)=12 ψ(0)−1/2 ψ′(0)=gp(w0,X)ψ(0)1/2. Here ψ(0)1/2=(t2)1/2=t2⋅(1/2)=t1=t by [F22] and [F23], and gp(w0,X)=t gp(v,X) by bilinearity [F18] with w0=tv, so (Np∘c)′(0)=gp(v,X). By [F11], d(Np)w0(X)=gp(v,X).

3.1

The pairing identity and the conclusion. [F3, F16, F17, F18, F19, step 1.2, step 2.1] Fix X∈TpM and put Y:=d(exp⁡p)w0(X)∈TqM. Gauss's lemma [F3] applied at the base vector w0∈Ep=TpM with the vector X gives gq(d(exp⁡p)w0(w0),d(exp⁡p)w0(X))=gp(w0,X). Since w0=tv, linearity of the differential [F17] gives d(exp⁡p)w0(w0)=t d(exp⁡p)w0(v)=t u, so bilinearity of gq [F18] yields gq(u,Y)=1t gq(d(exp⁡p)w0(w0),Y)=gp(w0,X)t=gp(v,X). On the other hand steps 1.2 and 2.1 give d(rp)q(Y)=d(Np)w0(X)=gp(v,X). Hence gq(u,Y)=d(rp)q(Y) for every Y in the image of d(exp⁡p)w0, and that image is all of TqM because exp⁡p∣Dp is a diffeomorphism onto its image [F2] and the differential of a diffeomorphism is a linear isomorphism [F16]; so gq(u,Y)=d(rp)q(Y)for every Y∈TqM. Taking X:=v in the same computation gives Y=u and gq(u,u)=gp(v,v)=1; hence ∣u∣g=gq(u,u)=1 by [F9] and [F21]. Finally, [F19] says that (grad⁡rp)(q) is the vector with gq((grad⁡rp)(q),Y)=d(rp)q(Y) for every Y; if two vectors u,u′ have this property then gq(u−u′,Y)=0 for every Y by bilinearity [F18], and Y:=u−u′ gives gq(u−u′,u−u′)=0, so u=u′ by positive definiteness [F18]. Therefore grad⁡rp(q)=u=γ˙(t)=d(exp⁡p)tv(v) [step 1.1], a unit vector.

4.1A1F1F2F3F4F8F24step 1.1step 3.1∎

Boundary, endpoint and choice audit. [A1, F1, F2, F3, F4, F24, step 1.1, step 3.1] In dimension zero SpM=∅, there is no unit direction v, and the assertion is vacuous; the empty manifold carries no base point p. The parameter range 0<t<cp(v) is open, and both endpoints are genuinely excluded: at t=0 the point is q=p, where rp is not smooth and grad⁡rp is not defined, while at t=cp(v)<+∞ the point q lies in Cut⁡(p) and tv∉Dp, so the restricted diffeomorphism exp⁡p∣Dp of [F2] does not include q; the infinite cut time cp(v)=+∞ is allowed, and then every t>0 is covered by [F24] and [F2]. The unit hypothesis ∣v∣g=1 is exactly what makes u unit, while t>0 permits division by t. For any W∈Dp (including nonunit W), set v=W/∣W∣g and t=∣W∣g; then 0<t<cp(v) and the same computation gives grad⁡rp(exp⁡p(W))=d(exp⁡p)W(W)/∣W∣g, the radial unit field. Degenerate directions X=0 are harmless: then Y=0, both sides vanish, and step 1.3's polynomial has B=C=0. The zero vector is never used, because w0≠0 and Np is smooth off zero [F3, F8]. Assumption [A1] is inherited exactly through the exponential, cut-time, Hopf-Rinow, Gauss and distance suppliers, and no further selection is made: X is fixed, the inverse of the linear isomorphism in step 3.1 is a function, and no choice function is invoked. The statement is an equality of vectors with a norm assertion; it contains no biconditional, and the only equivalence invoked, [F6], is used in both directions of its stated formula for the single pair (p,v). Compactness of M and positivity of the injectivity radius are never used.

Source locator

Lee, Riemannian Manifolds: An Introduction to Curvature, Chapter 10, printed pp.173-190, treats geodesics and the distance function up to the cut point; Datar, Lectures on Riemannian Geometry, Section 18.1, printed pp.134-136, records that the gradient of the distance in polar normal coordinates is the radial unit field, and Section 23.2, printed pp.167-169, fixes the radial domain before the cut locus. The proof above derives the identity from the library's Gauss lemma, chain rule and norm-gradient suppliers; no source text is quoted.

Depends on

Used by

Dependency tree · two levels

141 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