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.
Radial Jacobi tensor
Definition
Let be a Riemannian manifold of dimension and let be a unit-speed geodesic on an interval with nonempty interior and ; write and , so that and . The normal space at time is an -dimensional subspace, and is its initial model.
For , let be the unique Jacobi field along with as supplied by Existence and uniqueness of jacobi fields from initial data; the derivative at the included endpoint is one-sided when has as an endpoint, and solves in the conventions of Jacobi field. Then is normal, for every : the function has and by metric compatibility of the Levi-Civita connection (Levi civita connection, Covariant derivative along a curve), the curvature convention (Riemann curvature four-tensor) and the following local metric-compatibility calculation. For smooth local fields , expand twice by metric compatibility. The mixed first-derivative terms cancel, leaving with the curvature commutator of Curvature of an affine connection. Taking gives , without invoking the countable-choice-dependent full curvature-symmetry theorem. Thus , while and because ; hence .
The radial Jacobi tensor of is the family of linear maps defined for . It is well defined by the existence and uniqueness of , it is linear in because is a Jacobi field with both initial data zero and therefore vanishes by uniqueness, and it is smooth in because the coefficients of the Jacobi equation depend smoothly on . Its initial values are and, in the parallel identification introduced next, .
Parallel identification. Let be an orthonormal basis of and let be parallel transport along , which exists uniquely for every by Existence and uniqueness of parallel sections and maps onto , because for is constant in by metric compatibility. Composing with represents by the smooth matrix family with and : differentiating at gives for every . In the parallel orthonormal frame the tensor is recovered from , and the matrix satisfies the Jacobi equation , where is defined by . This matrix description is a representation of the same tensor, not a second definition: it depends on the chosen parallel frame only through conjugation by the (constant) change of orthonormal basis of , so invariance under conjugation transports statements about invertibility, self-adjointness, positivity and trace of to .
The tensor is used only up to the first conjugate instant in the results that follow; no claim about beyond such an instant is part of this definition.
Depends on
Used by
- Lower positive sectional curvature forces conjugate points Corollary
- Radial riccati operator Definition
- Radial volume jacobian Definition
- Bishop gromov ratio is constant in the model space Example
- Model jacobi fields in positive zero and negative curvature Example
- Volume growth in euclidean and hyperbolic space Example
- Radial jacobi tensor is invertible before the first conjugate point Lemma
- Trace riccati inequality Lemma
- Rigidity in bishop gromov on an interval Proposition
- Rigidity in rauch comparison Proposition
- Bonnet conjugate radius theorem Theorem
- Hessian comparison for distance under sectional curvature bounds Theorem
- Laplacian comparison for distance under a ricci lower bound Theorem
- Radial riccati equation Theorem
- Rauch comparison theorem first form Theorem
- Rauch comparison theorem second form Theorem
- Relative volume density comparison Theorem
Dependency tree · two levels
23 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
- Ved Datar, Lectures on Riemannian Geometry (2025) (standard reference, not scraped)
- J.-H. Eschenburg, Comparison Theorems in Riemannian Geometry (standard reference, not scraped)