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

Squared distance is strictly convex along geodesics in a hadamard manifold

Statement

Assume the inherited Axiom of Countable Choice ACω. Let (M,g) be a Hadamard manifold: a complete, connected, boundaryless, finite-dimensional Riemannian manifold that is simply connected and whose sectional curvature satisfies K≤0 at every tangent two-plane (Sectional curvature). Fix a point p∈M and put f:M→R,f(x):=12 dg(p,x)2. Then:

  1. f is smooth on all of M, its covariant Hessian Hess⁡f is a smooth symmetric two-tensor field, and the operator inequality Hess⁡f≥gon M holds, meaning Hess⁡f(X,X)≥g(X,X) for every x∈M and every X∈TxM. At the base point there is equality: Hess⁡f(p)=gp.
  2. For every nonconstant affinely parametrized geodesic γ:I→M — that is, ∇γ˙γ˙=0 on the open interval I — the function I∋t⟼dg(p,γ(t))2=2f(γ(t)) is strictly convex in the sense of Convex and strictly convex functions on Euclidean convex sets: for s,t∈I with s≠t and every λ∈(0,1), dg(p,γ((1−λ)s+λt))2<(1−λ) dg(p,γ(s))2+λ dg(p,γ(t))2.

Constant geodesics are excluded from assertion 2, and are the only excluded case: for a constant γ the restricted function is constant, so it is convex but not strictly convex. Affine parametrization is essential; the assertion need not survive reparametrization. The manifold is not assumed to be noncompact or of dimension n≥2: the case n=1 is covered by a separate computation inside the proof, and for n=0 there is no nonconstant geodesic and assertion 2 is vacuous. The only choice used is the inherited ACω; no completeness hypothesis is added beyond the one already contained in the word Hadamard.

Facts & Assumptions

Given: The inherited ACω of [A1]; a Hadamard manifold (M,g); a point p∈M; the function f=12rp2 with rp=dg(p,⋅); and a nonconstant affinely parametrized geodesic γ:I→M.

[A1]

The countable-choice premise is the inherited ACω (The Axiom of Countable Choice (ACω)), carried by the Hopf–Rinow, exponential, cut-locus and geodesic-existence suppliers quoted below; no further selection is made.

[F1]

Cartan–Hadamard (Cartan hadamard): since (M,g) is complete, connected, simply connected and has K≤0, for every point x∈M the exponential map exp⁡x:TxM→M is a diffeomorphism. In particular exp⁡p is bijective and smooth with smooth inverse.

[F2]

Unique minimizing segments (Simply connected complete nonpositively curved manifolds have unique geodesics between points): every two points x,y∈M are joined by exactly one affinely parametrized geodesic segment [0,1]→M sending 0 to x and 1 to y; that segment minimizes length and dg(x,y) equals its length. Consequently, for every w∈TpM, the affinely parametrized geodesic segment [0,1]∋t↦exp⁡p(tw) is the unique such segment from p to exp⁡p(w) and is minimizing, so dg(p,exp⁡p(w))=∣w∣p(w∈TpM), where ∣w∣p=gp(w,w).

[F3]

No conjugate points under K≤0 (No conjugate points under nonpositive sectional curvature): no unit-speed geodesic of M contains a pair of conjugate points; equivalently, there is no nonzero Jacobi field along a geodesic vanishing at two distinct parameters.

[F4]

Characterization of cut points (Characterization of a cut point): for v∈SpM with finite cut time cp(v)<+∞, either γp,v(0) and γp,v(cp(v)) are conjugate along the segment, or two distinct minimizing unit-speed geodesics join p to γp,v(cp(v)). Hence, if neither alternative can occur, the cut time is +∞.

[F5]

Gradient of distance (Gradient of the distance is the outward unit radial field off the base point and the cut locus): for 0<t<cp(v) one has grad⁡rp(γp,v(t))=γ˙p,v(t), a unit vector; along the minimizing radial segment the gradient of the distance is the outward unit radial field.

[F6]

Hessian comparison in the nonpositive direction (Hessian comparison for distance under sectional curvature bounds): let q∈M∖({p}∪Cut⁡(p)), put t0:=rp(q)>0, let γq be the minimizing unit-speed geodesic from p to q and N:={γ˙q(t0)}⊥={grad⁡rp(q)}⊥. Then (a) Hess⁡rp(grad⁡rp,⋅)=0 at q, and (b) if Rm⁡(X,γ˙q(s),γ˙q(s),X)≤k∣X∣2 for every s∈(0,t0] and every X⊥γ˙q(s), then Hess⁡rp(X,X)≥ct⁡k(t0) gq(X,X) for all X∈N. Here the sectional curvature of M satisfies K≤0, so the hypothesis of (b) holds with k=0, where ct⁡0(t0)=1/t0.

[F7]

Covariant Hessian (Gradient hessian and divergence connection formulas, The riemannian hessian is symmetric, Levi civita connection): for smooth u the Hessian Hess⁡u(X,Y)=g(∇Xgrad⁡u,Y)=X(Yu)−(∇XY)u is a smooth two-tensor field and is symmetric, Hess⁡u(X,Y)=Hess⁡u(Y,X), and the Levi–Civita connection is metric compatible, Xg(Y,Z)=g(∇XY,Z)+g(Y,∇XZ).

[F8]

Constant speed (Geodesics have constant speed for a metric-compatible connection): along a geodesic of the Levi–Civita connection the speed t↦∣γ˙(t)∣g is constant, so for a nonconstant geodesic c:=∣γ˙(t)∣g2 is a positive constant independent of t.

[F9]

Strict convexity of quadratic functions (Convex and strictly convex functions on Euclidean convex sets, A twice-differentiable function on an open interval is convex if and only if its second derivative is nonnegative): a twice-differentiable function ψ on an open interval with ψ′′≥0 is convex; and for c>0 the function t↦c2t2 is strictly convex, because for x≠y and λ∈(0,1), (1−λ)x2+λy2−((1−λ)x+λy)2=λ(1−λ)(x−y)2>0.

Proof

technique · direct: identify $f$ in exponential coordinates using the uniqueness of minimizing segments, verify the product rule for Hessians of squares of smooth functions, apply the Hessian comparison in the nonpositive direction to obtain $\operatorname{Hess}f\ge g$, and integrate the resulting second-derivative bound along the geodesic
1.1F1F2F3F4

The distance formula and the absence of cut points. By [F2], for every w∈TpM the segment t↦exp⁡p(tw), t∈[0,1], is the unique affinely parametrized geodesic segment from p to exp⁡p(w), and it minimizes; hence dg(p,exp⁡p(w))=∣w∣p. Suppose now that v∈SpM has finite cut time c:=cp(v)<+∞. By [F4] either γp,v(0) and γp,v(c) are conjugate along γp,v, which [F3] forbids, or two distinct minimizing unit-speed geodesics join p to γp,v(c), which contradicts the uniqueness in [F2] (a minimizing unit-speed geodesic on [0,c] reparametrized affinely to [0,1] is an affinely parametrized geodesic segment from p to the same point, and there is exactly one). Both alternatives are impossible, so cp(v)=+∞ for every unit v: the cut locus of p is empty, and rp(exp⁡pw)=∣w∣p for every w∈TpM.

1.2F7algebra

The product rule for a squared smooth function. Let u>0 be smooth near a point x and set F:=12u2. Then grad⁡F=ugrad⁡u, so for vector fields X,Y, Hess⁡F(X,Y)=g(∇X(ugrad⁡u),Y)=X(u) g(grad⁡u,Y)+u g(∇Xgrad⁡u,Y), i.e. Hess⁡(12u2)(X,Y)=du(X)du(Y)+uHess⁡u(X,Y), both sides being smooth and symmetric by [F7].

1.3F7F8

The second derivative of a smooth function along a geodesic. Let h be smooth and let σ be a geodesic with ∇σ˙σ˙=0. Then (h∘σ)′=dh(σ˙)=g(grad⁡h,σ˙), and differentiating again with metric compatibility and ∇σ˙σ˙=0 gives (h∘σ)′′=g(∇σ˙grad⁡h,σ˙)=Hess⁡h(σ˙,σ˙). The identity is local in the parameter and holds at every time of I.

2.1F1F7step 1.1step 1.3

Smoothness of f and its Hessian at the base point. By step 1.1, (f∘exp⁡p)(w)=12∣w∣p2 for every w∈TpM, a smooth quadratic form on the vector space TpM; since exp⁡p is a diffeomorphism by [F1], f is smooth on M. For X∈TpM the curve s↦exp⁡p(sX) is an affinely parametrized geodesic, so step 1.1 and step 1.3 give Hess⁡f(p)(X,X)=(f∘γX)′′(0)=d2ds2∣s=012s2∣X∣p2=∣X∣p2=gp(X,X). As Hess⁡f(p) is symmetric ([F7]), the polarization identity recovers all mixed values, so Hess⁡f(p)=gp.

2.2F5F6step 1.1step 1.2

The lower bound Hess⁡f≥g off the base point, in dimension n≥2. Fix q≠p and let t0:=rp(q)>0. By step 1.1 the cut locus of p is empty, so q∉{p}∪Cut⁡(p): rp is smooth near q, ∣grad⁡rp∣=1 and grad⁡rp is the terminal velocity of the minimizing geodesic from p to q ([F5]). By step 1.2 applied to u=rp, Hess⁡f=Hess⁡(12rp2)=drp⊗drp+rpHess⁡rpnear q. Write an arbitrary X∈TqM as X=agrad⁡rp+X⊥ with a:=drp(X) and X⊥⊥grad⁡rp. By F6 Hess⁡rp(grad⁡rp,⋅)=0, so Hess⁡rp(X,X)=Hess⁡rp(X⊥,X⊥). Since K≤0 everywhere, the hypothesis of F6 holds with k=0 along the minimizing geodesic from p to q, and F6 yields Hess⁡rp(X⊥,X⊥)≥(1/t0)∣X⊥∣2. Therefore Hess⁡f(X,X)=a2+t0Hess⁡rp(X⊥,X⊥)≥a2+∣X⊥∣2=gq(X,X), using that X↦(a,X⊥) is a gq-orthogonal decomposition.

2.3F5F7step 1.1step 1.2

The lower bound in dimension n=1. If dim⁡M=1 then at every q≠p the tangent space is spanned by the unit vector grad⁡rp, so X⊥=0 and the bound Hess⁡rp(X⊥,X⊥)≥(1/t0)∣X⊥∣2 holds with both sides equal to 0; the gradient is a unit geodesic field by [F5], so ∇grad⁡rpgrad⁡rp=0 and Hess⁡rp(grad⁡rp,grad⁡rp)=12grad⁡rp(∣grad⁡rp∣2)=0 by [F7]. Hence, by step 1.2, Hess⁡f=drp⊗drp=g off p, and the computation of step 2.2 applies verbatim without invoking the dimension-n≥2 comparison bound.

3.1step 2.1step 2.2step 2.3

The bound Hess⁡f≥g on all of M. Off p the pointwise inequality was proved in step 2.2 for n≥2 and in step 2.3 for n=1, and at p the equality Hess⁡f(p)=gp of step 2.1 gives the bound as well. In dimension zero M is a point and the tensor inequality is vacuous. In positive dimension the inequality was checked on a decomposition spanning each tangent space, so Hess⁡f≥g holds on M.

4.1F8step 1.3step 3.1

The second-derivative bound along a geodesic. For the nonconstant affinely parametrized geodesic γ, put φ(t):=f(γ(t))=12dg(p,γ(t))2. By step 1.3, φ′′(t)=Hess⁡f(γ˙(t),γ˙(t))≥g(γ˙(t),γ˙(t))=c>0, where c=∣γ˙∣2 is a positive constant by [F8]. In particular φ is twice differentiable on the open interval I with φ′′≥c everywhere.

5.1F9step 4.1∎

Strict convexity. Define ψ(t):=φ(t)−c2t2 on I. Then ψ′′=φ′′−c≥0, so ψ is convex by [F9]; and t↦c2t2 is strictly convex by [F9], since c>0. For distinct s,t∈I and λ∈(0,1), put m:=(1−λ)s+λt and q(z):=c2z2; convexity of ψ and strict convexity of q give, one of the two summed inequalities being strict, φ(m)=ψ(m)+q(m)<[(1−λ)ψ(s)+λψ(t)]+[(1−λ)q(s)+λq(t)]=(1−λ)φ(s)+λφ(t), the strict inequality because s≠t in [F9]. Multiplying by 2, the function t↦dg(p,γ(t))2 is strictly convex on I, as claimed. A constant geodesic has φ′′=0 and φ constant, so no strict convexity can be asserted there; this is the only case excluded, and the affine parametrization was used only to identify c=∣γ˙∣2 as a positive constant in step 4.1. The proof selects no object of its own: the geodesics and the minimizing segments it uses are those supplied one pair at a time by the cited consequences of completeness, and the inherited ACω of [A1] is consumed exactly through them.

Source locator

Datar §20.1 (printed pp.147–149) contains the Hessian of the squared distance and §24.3 (printed pp.178–179) the Cartan–Hadamard consequences; the proof above realizes the route through the in-run Hessian comparison (Hessian comparison for distance under sectional curvature bounds) in the K≤0 direction k=0, whose model cotangent is ct⁡0(t0)=1/t0. Eschenburg §5 (printed pp.17–19) uses the same Cartan–Hadamard setup; the pointwise inequality Hess⁡(12rp2)≥g and the resulting strict convexity along nonconstant geodesics are the standard convexity theorem for Hadamard manifolds. The cut-locus emptiness in step 1.1 is proved inside the item from the in-run characterization of cut points and the uniqueness of minimizing segments.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

102 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