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.

Logarithmic derivative of the radial volume jacobian is the distance laplacian

Statement

Assume the inherited Axiom of Countable Choice ACω. Let (M,g) be a complete, connected, boundaryless Riemannian manifold of dimension n≥2, let p∈M and let v∈SpM be a unit tangent vector with cut time cp(v). For every t with 0<t<cp(v), ddtlog⁡Jp(t,v)=tr⁡Sv(t)=Δgrp(exp⁡p(tv)), where Jp(t,v) is the radial volume Jacobian of Radial volume jacobian, Sv(t) is the radial Riccati operator of Radial riccati operator along γv, and rp(x)=dg(p,x) is the distance from p.

Facts & Assumptions

Given: The inherited ACω of [A1], a complete connected boundaryless Riemannian manifold (M,g) of dimension n≥2, a point p∈M, a unit vector v∈SpM with cut time cp(v), the radial geodesic γv(t)=exp⁡p(tv), the radial Jacobi tensor Av with parallel-frame matrix Aˉv, the radial volume Jacobian Jp(t,v) and the Riccati operator Sv(t), and the distance function rp.

[A1]

The countable-choice premise is the inherited ACω (The Axiom of Countable Choice (ACω)), carried by the cut-time, geodesic and exponential interfaces of Cut time in a unit tangent direction and Radial volume jacobian.

[F1]

Radial volume Jacobian: Jp(t,v)=det⁡Aˉv(t)>0 for 0<t<cp(v), the determinant being taken in a compatible oriented orthonormal frame; Aˉv is smooth there, and Aˉv(t) is invertible because its determinant is nonzero (Radial volume jacobian, Radial jacobi tensor is invertible before the first conjugate point).

[F2]

Riccati operator: on the interval where it is defined, Sv(t)=Aˉv′(t)Aˉv(t)−1, equivalently the endomorphism DtAv∘Av−1 of the normal space at time t, transported back to N0 by parallel transport; its trace is therefore independent of which of these two representations is used (Radial riccati operator).

[F3]

Hessian of the distance: with q=γv(t), 0<t<cp(v), the distance function rp is smooth near q, and for every X∈TqM orthogonal to T=γ˙v(t) the Levi-Civita Hessian satisfies (∇2rp)q(X,Y)=gq(DtJX(t),Y), where JX is the normal Jacobi field along γv with JX(0)=0 and JX(t)=X; moreover (∇2rp)q(T,⋅)=0 and on T⊥ the shape endomorphism S=∇grad⁡rp is DtJ(t)∘J(t)−1 (Hessian of distance in terms of radial jacobi fields).

[F4]

Laplace–Beltrami operator: for smooth f, Δgf(p)=tr⁡g(Hess⁡f)p=∑iHess⁡f(ei,ei) in any orthonormal basis (Laplace–Beltrami operator as the trace of the Hessian).

[F5]

Jacobi's formula: for a differentiable family of invertible matrices A(t), ddtdet⁡A(t)=det⁡A(t)tr⁡(A(t)−1A′(t)), the differential of the determinant being Ddet⁡(A)[H]=det⁡(A)tr⁡(A−1H) (The determinant differential is Ddet⁡(A)[H]=tr⁡(adj⁡(A)H) at every matrix, and Jacobi's formula holds on the invertible locus).

Proof

Proof technique: direct: differentiate the determinant of the radial Jacobi matrix with Jacobi's formula, identify the trace of Aˉ′Aˉ−1 with the trace of the shape operator of the distance sphere, and use that the Laplace–Beltrami operator is the trace of the Hessian.

1.1F1F2F5

The logarithmic derivative of the radial volume Jacobian is the trace of Sv. [F1, F2, F5] On 0<t<cp(v) the matrix family Aˉv is smooth and invertible by [F1]. Jacobi's formula of [F5], applied to A(t)=Aˉv(t) and divided by the nonvanishing determinant, gives ddtlog⁡Jp(t,v)=1det⁡Aˉv(t)ddtdet⁡Aˉv(t)=tr⁡(Aˉv(t)−1Aˉv′(t)). The trace is invariant under cyclic permutation of a product, so tr⁡(Aˉv−1Aˉv′)=tr⁡(Aˉv′Aˉv−1)=tr⁡Sv(t) by the definition of the Riccati operator in [F2].

2.1F2F3step 1.1

The trace of the Hessian of the distance equals the trace of Sv. [F2, F3, step 1.1] Put q=γv(t) with 0<t<cp(v) and T=γ˙v(t). Choose an orthonormal basis of TqM consisting of T together with an orthonormal basis e1,…,en−1 of T⊥. By [F3] the Hessian entries in the radial direction vanish, (∇2rp)q(T,⋅)=0, and on T⊥ the endomorphism representing the Hessian is DtJ(t)∘J(t)−1. In the parallel frame of [F2] this endomorphism is exactly Sv(t), and conjugation by the isometry Pt preserves the trace, so tr⁡g(Hess⁡rp)q=∑i=1n−1gq(DtJei(t),ei)=tr⁡Sv(t).

3.1F4step 1.1step 2.1

Conclusion. [F4, step 1.1, step 2.1] By [F4] the Laplace–Beltrami operator of rp at q is the trace of the Hessian, and by step 2.1 this trace equals tr⁡Sv(t); by step 1.1 the logarithmic derivative of Jp(t,v) equals the same trace. Therefore ddtlog⁡Jp(t,v)=tr⁡Sv(t)=Δgrp(exp⁡p(tv)) for every 0<t<cp(v).

4.1F1F2F3step 1.1step 2.1step 3.1∎

Boundary cases. [F1, F2, F3, step 1.1, step 2.1, step 3.1] The identity is asserted on the open interval 0<t<cp(v): at t=0 the Jacobian vanishes, log⁡Jp is not defined at 0 and rp is not differentiable at p; at t=cp(v) (when the cut time is finite and attained) the distance function need not be smooth, and [F3] does not apply. If cp(v)=+∞ the identity holds on all of (0,∞). In dimension n=2 the normal space is one-dimensional, Sv(t) is a scalar and tr⁡Sv(t) is that scalar; the argument above already covers this case because the basis e1,…,en−1 then has one element. The statement is for unit v; for a general w≠0 one applies it to v=w/∣w∣ and the affine reparametrization t↦∣w∣t, while w=0 has no radial direction. No choice beyond the inherited [A1] is used.

Source locator

Datar §27.2 and §28.1, pp.200–209, and Eschenburg §4–5, pp.15–20, derive the identity ddtlog⁡J=tr⁡S=Δr for the radial jacobian before the cut locus. The proof above is assembled from the in-run radial Jacobian, Riccati and Hessian items and Jacobi's formula.

Depends on

Used by

Dependency tree · two levels

69 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