Alphabeta Math
TheoremStatement: 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.

Laplacian comparison for distance under a ricci lower bound

Statement

Assume the inherited Axiom of Countable Choice ACω. Let (M,g) be a complete, connected, boundaryless Riemannian manifold of dimension n≥2 whose Ricci curvature satisfies the lower bound Ric⁡x(X,X)≥(n−1)k ∣X∣2for all x∈M, X∈TxM, for a real number k; equivalently Ric⁡≥(n−1)k g in the bilinear-form sense. Let p∈M, let r:=rp=dg(p,⋅) be the distance from p, and let q∈M∖({p}∪Cut⁡(p)) be a point off p and off the cut locus of p. Assume in addition that r(q)<π/kwhen k>0. Then the Laplace–Beltrami operator of g satisfies Δgr(q)≤(n−1)ct⁡k(r(q)). The estimate is pointwise at q, a point of smoothness of r; the cut locus and p itself are excluded because Hess⁡r, hence Δgr, is not defined there. For k>0 the restriction r(q)<π/k keeps r(q) inside the domain of ct⁡k; for k≤0 the function ct⁡k is defined on all of (0,∞) and no restriction on r(q) is imposed. The sign convention is the positive-divergence convention of Laplace–Beltrami operator as the trace of the Hessian, and in dimension n=2 the inequality reads Δgr(q)≤ct⁡k(r(q)), the trace being a single normal eigenvalue. No compactness of M is assumed and no choice beyond the inherited ACω is used.

Facts & Assumptions

Given: The inherited ACω of [A1]; a complete, connected, boundaryless Riemannian manifold (M,g) of dimension n≥2 with Ric⁡≥(n−1)k g; a point p∈M; the distance function r=rp; a point q∈M∖({p}∪Cut⁡(p)) with r(q)<π/k when k>0.

[A1]

The countable-choice premise is the inherited ACω (The Axiom of Countable Choice (ACω)), carried by the cut-time, curvature and distance-Hessian interfaces used by the suppliers below; the Jacobi and parallel initial-value constructions require no choice; no further selection is made.

[F1]

Laplace–Beltrami operator (Laplace–Beltrami operator as the trace of the Hessian): Δgf(p)=tr⁡g(Hess⁡f)p=∑iHess⁡f(ei,ei) for any gp-orthonormal basis e1,…,en of TpM; the value is basis-independent.

[F2]

Trace Riccati inequality (Trace riccati inequality): for a unit-speed geodesic γ with radial Jacobi tensor A and radial Riccati operator S=DtA∘A−1, the function h:=tr⁡S is differentiable on 0<t<τ (τ the first conjugate instant) and satisfies h′(t)+h(t)2n−1+Ric⁡γ(t)(γ˙(t),γ˙(t))≤0(0<t<τ).

[F3]

Distance Hessian (Hessian of distance in terms of radial jacobi fields): for a unit v∈SpM and 0<t<cp(v), with γ=γp,v, q=γ(t), T=γ˙(t), the endomorphism H:=∇grad⁡r satisfies H(T)=0, and for X⊥T one has H(X)=DtJX(t) for the Jacobi field with JX(0)=0, JX(t)=X; on T⊥ the operator H equals DtJ(t)∘J(t)−1 and is g-self-adjoint, and (∇2r)q(X,Y)=gq(DtJX(t),Y)=Hess⁡r(X,Y).

[F4]

Cut-locus parametrisation (The exponential map is a diffeomorphism on the open tangent cut domain, Gradient of the distance is the outward unit radial field off the base point and the cut locus): q∈M∖({p}∪Cut⁡(p)) has a unique representation q=exp⁡p(t0v) with v∈SpM, 0<t0<cp(v); then t0=dg(p,q)=r(q), the segment is minimizing, grad⁡r(q)=γ˙(t0)=:T has norm one, and N=T⊥={grad⁡r(q)}⊥.

[F5]

Radial theory (Radial Jacobi tensor, Radial riccati operator, Radial riccati equation): the endpoint map A(t)=J(t):N0→Nt is a linear isomorphism for 0<t<cp(v)≤τ, the Riccati operator satisfies S=Aˉ′Aˉ−1 with Aˉ=P−1A, S is self-adjoint and S(t)=t−1id⁡+O(t) as t↓0; hence h(t)=tr⁡S(t)=n−1t+O(t)(t↓0), for every t at which S is defined.

[F6]

Ricci curvature (Ricci curvature): Ric⁡x(X,Y)=tr⁡(Z↦R(Z,X)Y); the assumed lower bound gives Ric⁡γ(t)(γ˙(t),γ˙(t))≥(n−1)k.

[F7]

Model functions (Model functions solve the constant curvature jacobi equation, Comparison sine, cosine and cotangent functions): sn⁡k′′+ksn⁡k=0 with sn⁡k(0)=0, sn⁡k′(0)=1, cs⁡k=sn⁡k′, cs⁡k′′+kcs⁡k=0, cs⁡k(0)=1, cs⁡k′(0)=0; the comparison cotangent ct⁡k=cs⁡k/sn⁡k is defined where sn⁡k≠0, in particular on (0,π/k) for k>0 and on (0,∞) for k≤0.

[F8]

Taylor expansion (Peano's form: the normalized Taylor remainder tends to zero): a function that is m times differentiable at 0 satisfies f(t)=∑j=0mf(j)(0)tj/j!+o(tm) as t→0.

Proof

technique · direct: identify $\Delta_gr(q)$ with the trace $h(t_0)$ of the radial Riccati operator, use the trace Riccati inequality of the page to reduce to the scalar inequality $a'+a^2\le-k$ for $a=h/(n-1)$, and compare $a$ with the model $\operatorname{ct}_k$ by the integrating-factor argument with matched asymptotics at $t=0$
1.1F1F3F4F5A1given

Setup: Δgr(q)=h(t0). [F1, F3, F4, F5, A1, given] By [F4] fix the unique v∈SpM and t0=r(q)∈(0,cp(v)) with q=exp⁡p(t0v); then γ=γp,v, T=γ˙(t0), and t0<τ by [F5]. By [F3] the operator H=∇grad⁡r satisfies H(T)=0 and H=DtA(t0)∘A(t0)−1 on N=T⊥, so H maps N into N and annihilates T. Choosing a gq-orthonormal basis of TqM whose first vector is T and whose remaining n−1 vectors form an orthonormal basis e1,…,en−1 of N, the trace formula of [F1] gives Δgr(q)=Hess⁡r(T,T)+∑i=1n−1Hess⁡r(ei,ei)=0+∑i=1n−1gq(DtA(t0)A(t0)−1ei,ei), the vanishing of Hess⁡r(T,T)=gq(H(T),T) by [F3]. Since Pt0 is an isometry and S(t0)=Pt0−1∘(DtA(t0)A(t0)−1)∘Pt0 by [F5], the sum is the trace of S(t0) over the orthonormal basis Pt0−1e1,…,Pt0−1en−1 of N0: Δgr(q)=tr⁡S(t0)=h(t0).

1.2F2F5F6given

The scalar Riccati inequality and its asymptotics. [F2, F5, F6, given] By [F2] the function h=tr⁡S is differentiable on (0,τ) and satisfies h′+h2n−1+Ric⁡γ(γ˙,γ˙)≤0. By [F6] the Ricci lower bound gives Ric⁡γ(t)(γ˙(t),γ˙(t))≥(n−1)k at every t∈(0,t0], so h′(t)+h(t)2n−1≤−(n−1)k(0<t≤t0). Put a:=h/(n−1), a differentiable function on (0,τ) with a′=h′n−1 and a2=h2/(n−1)2; dividing the inequality by the positive number n−1>0 gives the scalar Riccati inequality a′(t)+a(t)2≤−k(0<t≤t0). Moreover h(t)=(n−1)t−1+O(t) by [F5], so a(t)=1t+O(t)(t↓0).

1.3given∎

The scalar comparison lemma. We use the following elementary fact, the integrating-factor comparison for Riccati inequalities with matched asymptotics at the singular endpoint. Let 0<T≤t0 and let a,c:(0,T]→R be differentiable with a′+a2≤−k,c′+c2=−kon (0,T], both a(t)=1/t+O(t) and c(t)=1/t+O(t) as t↓0. Then a≤c on (0,T]. Proof. Put φ:=a−c. Subtracting the two equations, φ′=a′−c′≤(−a2−k)−(−c2−k)=−(a+c)φ. Fix 0<ε0<t≤T and define Φ(s):=φ(s)exp⁡(−∫st(a+c)) for s∈[ε0,t]. Since (a+c) is continuous, Φ is differentiable with Φ′(s)=exp⁡(−∫st(a+c))(φ′(s)+(a(s)+c(s))φ(s))≤0, so Φ is nonincreasing and φ(t)≤φ(ε0)exp⁡(−∫ε0t(a+c)). By the two asymptotics, choose δ∈(0,T] so that a+c≥1/t on (0,δ). Put δ′:=min⁡(δ,t) and K:=(t−δ′)max⁡[δ′,t]∣a+c∣; then ∫ε0t(a+c)≥∫ε0δ′duu−K=log⁡δ′ε0−K(0<ε0<δ′), and hence φ(t)≤eKδ′−1ε0∣φ(ε0)∣⟶0(ε0↓0), using ε0∣φ(ε0)∣→0; therefore φ(t)≤0.

2.1step 1.1step 1.2step 1.3F7given

The distance Laplacian is bounded by the model trace. [step 1.1, step 1.2, step 1.3, F7, given] On the positive domain of [F7] the comparison cotangent satisfies the model Riccati equation ct⁡k′+ct⁡k2=−k: indeed cs⁡k′=sn⁡k′′=−ksn⁡k and sn⁡k′=cs⁡k, so ct⁡k′=cs⁡k′sn⁡k−cs⁡ksn⁡k′sn⁡k2=−ksn⁡k2−cs⁡k2sn⁡k2=−k−ct⁡k2. Moreover, by [F8] with order 3 for sn⁡k and order 2 for cs⁡k, using sn⁡k′′′(0)=−k and cs⁡k′′(0)=−k together with the values sn⁡k(0)=0, sn⁡k′(0)=1, sn⁡k′′(0)=−ksn⁡k(0)=0 and cs⁡k(0)=1, cs⁡k′(0)=0, sn⁡k(t)=t(1+O(t2)),cs⁡k(t)=1+O(t2),ct⁡k(t)=1t+O(t),ct⁡k(t)≥12t for 0<t<δ0 and some δ0>0. By step 1.2 the function a=h/(n−1) satisfies a′+a2≤−k on (0,t0] and a(t)=t−1+O(t); the model c:=ct⁡k satisfies c′+c2=−k on (0,t0] (the interval (0,t0] lies in the positive domain of ct⁡k by [F7] and the hypothesis on t0), c≥1/(2t) near 0, and ∣a−c∣=O(t)=o(1/t). Step 1.3 with T:=t0 therefore gives a(t)≤ct⁡k(t)(0<t≤t0),hence h(t0)≤(n−1)ct⁡k(t0).

3.1step 1.1step 2.1given∎

Conclusion and boundary cases. [step 1.1, step 2.1, given] Combining Δgr(q)=h(t0) of step 1.1 with the bound of step 2.1 gives Δgr(q)≤(n−1)ct⁡k(r(q)), which is the assertion. The computation takes place on the interval (0,t0], so the singular initial point t=0 is excluded and the first conjugate instant τ>t0 is not reached; the cut locus is excluded by the hypothesis on q, and the model pole at π/k is excluded for k>0 by t0<π/k. For k≤0 the model ct⁡k is defined on all of (0,∞) and no restriction on t0 is imposed. In dimension n=2 the normal space is one-dimensional and h=S is the scalar Riccati function, so the trace Riccati inequality of [F2] reduces to S′+S2+Ric⁡(γ˙,γ˙)≤0 and step 2.1 bounds h=S by ct⁡k itself, as displayed. If Ric⁡=(n−1)k g, the differential inequality of step 1.2 is an equality where the traced Cauchy–Schwarz step Trace riccati inequality is an equality; equality in the final comparison additionally depends on the preceding radial segment. The proof uses no information about r other than the single point q and requires neither completeness of M beyond the results quoted, nor compactness; the only choice is the inherited [A1].

Source locator

Eschenburg §4, equation (4.1) and the following paragraph (printed p.15), traces the Riccati equation to trace⁡(A)′+trace⁡(A2)+Ric⁡(V)=0 and compares the average a=trace⁡(A)/(n−1) with the scalar model ak having the same pole, which is precisely the passage carried out in steps 1.2–2.1 above, with the singular-matched comparison done by an integrating factor. Datar §§26.1–26.2 and 28.1, pp.191–197 and 205–209, contains the same traced Riccati calculus and the comparison for the logarithmic derivative of the volume density. The proof above is carried out from the in-run trace Riccati inequality and model-function suppliers and the published distance-Hessian formula; the trace tr⁡gHess⁡r=Δgr is the in-run definition of the Laplace–Beltrami operator.

Depends on

Used by

Dependency tree · two levels

121 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