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.
Simple Riemannian background
Definition
Let and let be a compact, connected, nonempty smooth -dimensional Riemannian manifold with smooth boundary. Let be the outward unit normal and let be the Levi–Civita connection of . The boundary is strictly convex when
for every boundary point and every nonzero boundary-tangent vector . Use the curvature convention
A Jacobi field along a unit-speed geodesic is a smooth vector field satisfying , where . The manifold has no conjugate points if every positive-length unit-speed geodesic segment has no nonzero Jacobi field with . It is nontrapping if every maximal unit-speed geodesic starting in reaches in finite forward and backward time. The pair is a simple Riemannian background if its boundary is strictly convex, it has no conjugate points, and it is nontrapping.
When , this is the simple-surface convention used for the scalar geodesic X-ray transform on the required inverse-problems page.
Depends on
Used by
- Static wave coefficients are determined on a simple surface with adequate observation time Corollary
- A complete no-return extension of a strictly convex manifold Lemma
- Finite-order geometric optics along a maximal ray in simple geometry Lemma
- Global geodesic-polar coordinates from a boundary point on a simple manifold Lemma
- Wave boundary data determine integrals along maximal geodesics shorter than T Theorem
Dependency tree · two levels
16 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
- Mikko Salo, On geometric inverse problems and microlocal analysis, full author lecture notes (standard reference, not scraped)
- Gabriel P. Paternain, Mikko Salo, and Gunther Uhlmann, Geometric inverse problems, with emphasis on two dimensions (standard reference, not scraped)