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.
Existence of geodesically convex neighborhoods
Statement
Assume . Let be a boundaryless Riemannian manifold. An open set is called strongly geodesically convex here when, for every ordered pair , there is a unique affinely parametrized geodesic that globally minimizes length from to , its image lies in , and is smooth.
Every point of has a strongly geodesically convex neighbourhood. More precisely, the neighbourhood may be chosen inside any prescribed open neighbourhood of the point, and it may be chosen so that every piecewise smooth curve attaining the global minimum between two of its points is a monotone reparametrization of the displayed connector. Every nonempty intersection of a positive finite family of strongly geodesically convex open sets is again strongly geodesically convex.
Facts & Assumptions
Given: A point of the boundaryless Riemannian manifold and, for the relative form, an open neighbourhood of .
The Axiom of Countable Choice () is the assumed .
Under [A1], Existence of normal neighborhoods, Normal neighborhood and normal coordinate chart, and Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans give an orthonormal normal coordinate chart centred at , which may be restricted into . Properties of normal coordinates at the center gives and .
Under [A1], The exponential domain is open and the exponential map is smooth makes the total exponential map smooth on an open neighbourhood of the zero section, and The differential of exp at zero is the identity gives its vertical differential at . The coordinate Choice-free smooth inverse function theorem in Euclidean space turns an invertible coordinate derivative into a local diffeomorphism; Existence uniqueness and smooth dependence of geodesics supplies the same unique geodesic evaluation used by the exponential map.
A subset of with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology makes a closed coordinate ball compact, A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism preserves compactness under its coordinate inverse, and Local comparison of a riemannian metric with the euclidean metric gives uniform constants comparing the Riemannian and Euclidean tangent norms above that compact ball.
Coordinate geodesic equation is the coordinate geodesic equation. Geodesics have constant speed for a metric-compatible connection gives constant Riemannian speed. Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value gives an attained maximum of a continuous real function on .
Under [A1], Sufficiently short geodesic segments are uniquely minimizing says that every radial segment inside a normal exponential ball is globally minimizing and characterizes every equal-length piecewise smooth competitor as a monotone radial reparametrization. The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space supplies product neighbourhoods inside an open subset of .
Proof
If , take from [F1] an orthonormal normal chart centred at and restricted so that . Define . At this smooth symmetric matrix is the identity by [F1]. By continuity, after shrinking , one has for every and every . Thus, for , where the last inequality is the finite Cauchy--Schwarz calculation . Hence is positive definite throughout .
Let be the total exponential domain and set by . In tangent-bundle and product coordinates at , [F2] and the identity give , whose inverse is . Applying the Euclidean inverse theorem in those charts gives an open neighbourhood of on which is a diffeomorphism onto an open neighbourhood of . Intersecting with the inverse images of under the base and exponential projections preserves these properties and ensures that implies .
Let be a positive finite family of strongly geodesically convex open sets with nonempty intersection . It is open. For , every supplies a normalized globally minimizing geodesic from to . The uniqueness clause for makes all these geodesics equal, so their common image lies in every and hence in . The connector on is the restriction of the smooth connector for , and its global uniqueness is unchanged. Hence is strongly geodesically convex.
In the tangent-bundle coordinates used in step 1.2, choose an open coordinate ball about , with compact closure , and such that . The compactness assertions in [F3] apply to . Take their constants . Choose , then choose with , and put . For , the Riemannian ball lies in the fibre of , whereas the fibre of lies in . Restricting the diffeomorphism therefore shows that is a normal-ball diffeomorphism.
Since is open, is an open neighbourhood of . By [F5], choose a positive coordinate radius so small that satisfies . For , write and put . The inverse and exponential maps are smooth, so this curve depends smoothly on . Step 2.1 gives and . Moreover for , so the entire connector lies in even before the sharper conclusion below.
Fix . If , injectivity of gives and the connector is constant. Suppose , and set . With , differentiating twice and using the coordinate geodesic equation [F4] gives The geodesic has nonzero constant speed by [F4], so and step 1.1 gives for .
If the connector left , [F4] would give a point where attains its maximum, because while some value is at least . At an interior maximum, for small , , and passage to the limit gives , contradicting step 4.1. Thus , including the possibility that it merely touches the coordinate sphere.
For fixed , step 2.1 supplies the normal exponential ball and step 3.1 puts the endpoint vector inside it. By [F5], globally minimizes length from to . Any other globally minimizing affinely parametrized geodesic on is an equal-length piecewise smooth competitor, so [F5] makes it a monotone radial reparametrization of . Constant speed from [F4] and the endpoint values force that radial parameter to be when ; when , zero length forces zero speed and the constant curve. Thus the normalized minimizing geodesic is unique. Together with steps 3.1 and 5.1, is strongly geodesically convex and lies in the prescribed .
If is empty there is no point and the existence assertion is vacuous. In dimension zero, every point is an open singleton, and that singleton is strongly convex with its constant connector; a nonempty finite intersection of such sets is again a singleton. Dimension one is included in steps 1.1--6.1. Coincident endpoints and zero tangent vector were treated in steps 4.1 and 6.1; the closed parameter endpoints are included, whereas every tangent ball and coordinate ball used in the construction is open. The intersection assertion excludes the empty family, whose intersection would be all of , and assumes the resulting intersection is nonempty. Assumption [A1] is used exactly through [F1], [F2], and [F5] for the existing global geodesic/exponential constructions; the one fixed chart, finite coefficient shrink, uniquely defined inverse, finite intersection, and compact extrema add no choice.
Source locator
Datar, Theorem 18.0.1 and proof, printed pp.133--137, supplies the endpoint-map and normal-ball minimality argument but only remarks that a refinement keeps the connector inside the chosen neighbourhood. Steinbauer, Theorem 2.2.7 and equations (2.2.8)--(2.2.11), printed pp.49--50 (PDF pp.52--53), supplies that refinement: the squared normal-coordinate radius has positive second derivative along every nonconstant local connector, contradicting an interior maximum. The global-minimizer formulation then makes the finite-intersection clause immediate.
Depends on
- Existence of normal neighborhoods
- Normal neighborhood and normal coordinate chart
- Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans
- Existence uniqueness and smooth dependence of geodesics
- The exponential domain is open and the exponential map is smooth
- The differential of exp at zero is the identity
- Choice-free smooth inverse function theorem in Euclidean space
- Properties of normal coordinates at the center
- Coordinate geodesic equation
- Geodesics have constant speed for a metric-compatible connection
- Local comparison of a riemannian metric with the euclidean metric
- A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism
- A subset of $\mathbb{R}^n$ with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology
- Extreme value theorem: a continuous real function on a nonempty compact subset of $\mathbb{R}$ attains a greatest and a least value
- Sufficiently short geodesic segments are uniquely minimizing
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
100 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, Theorem 18.0.1 and proof, pp.133--137 (standard reference, not scraped)
- Roland Steinbauer, Riemannian Geometry, Theorem 2.2.7 and proof, printed pp.49--50 (PDF pp.52--53) (standard reference, not scraped)