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.
Geodesic completeness means compactness
Statement
False claim: every geodesically complete Riemannian manifold is compact. Thus any stronger reading of “geodesic completeness means compactness” as an equivalence is false as well.
Assume for the current library interfaces used below. The counterexample is the Euclidean line: it is a nonempty connected boundaryless geodesically complete Riemannian manifold, but it is unbounded and noncompact.
Facts & Assumptions
Given: with its standard smooth structure and Riemannian metric .
The Axiom of Countable Choice () is the assumed .
Open subsets of Euclidean space have the standard smooth structure makes a smooth boundaryless -manifold; Riemannian metric and riemannian manifold makes the constant positive tensor a Riemannian metric; and is polygonally connected, connected, locally path-connected and locally connected makes connected directly from its line-segment paths.
Riemannian speed and length defines the length of a piecewise- curve, and Riemannian distance on a connected manifold defines as the infimum of such lengths. The endpoint formula in The gradient theorem: the line integral of a gradient is the endpoint increment and the constant-unit-field bound in Line-integral estimates by arc length and the supremum of the field compare Euclidean chord length with curve length.
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in says that the real line with its usual metric is complete.
Under [A1], Hopf–Rinow theorem makes metric completeness equivalent to geodesic completeness for a nonempty connected boundaryless Riemannian manifold, and says equivalently that every closed bounded subset is compact.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line says, without a choice principle, that a subset of the real line is compact exactly when it is closed and bounded.
Refutation
The identity chart and the constant coefficient make a nonempty smooth boundaryless Riemannian -manifold by [F1]. Since is convex, [F1] also makes it connected.
Fix . If , the constant curve has length zero. If , let . For any piecewise- curve from to , the constant unit field is the gradient of , so [F2] evaluates its line integral as and bounds this by the Euclidean length of , which equals its -length because . Conversely the segment on has constant speed and length . Taking the infimum in [F2] therefore gives in both cases.
By step 1.2, the Riemannian metric space is exactly the usual metric real line, so [F3] makes it complete. The hypotheses checked in step 1.1 let [F4] apply under [A1], and metric completeness then makes geodesically complete. In particular every maximal geodesic, including the constant one, has domain all of .
The whole space is closed in itself but is not bounded: for any centre and radius , the point has by step 1.2. Hence [F5] says that is not compact. Together with step 2.1, this is the required geodesically complete noncompact counterexample.
The exact failed inference is now visible in [F4]: completeness makes every closed bounded subset compact, but the whole Euclidean line is not bounded, so that clause cannot be applied to itself. Andrews proves the completeness equivalences and the minimizing-geodesic conclusion in the cited Hopf--Rinow theorem, printed pp. 106--108; it does not assert compactness of the whole manifold and does not supply this Euclidean-line counterexample.
The empty manifold is compact and supplies no noncompact witness; a connected nonempty zero-manifold is a compact singleton. The Euclidean-line witness is genuinely one-dimensional, nonempty and boundaryless. Its distance calculation includes , its unboundedness uses positive radii, and the completeness conclusion covers zero-velocity as well as nonconstant geodesics with full parameter domain , so there is no finite endpoint or degenerate-interval omission. Every displayed witness is explicit. The direct distance calculation [F2], Euclidean completeness [F3], Heine--Borel [F5] and the unboundedness calculation are choice-free. Assumption [A1] is used only when invoking the current Hopf--Rinow interface [F4] to pass from metric to geodesic completeness; no full choice axiom is used. The proof refutes the forward implication; no converse is asserted here.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Open subsets of Euclidean space have the standard smooth structure
- Riemannian metric and riemannian manifold
- $\mathbb{R}^n$ is polygonally connected, connected, locally path-connected and locally connected
- Riemannian speed and length
- Riemannian distance on a connected manifold
- The gradient theorem: the line integral of a gradient is the endpoint increment
- Line-integral estimates by arc length and the supremum of the field
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- Hopf–Rinow theorem
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
93 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
- Ben Andrews, Geodesics and Completeness, Theorem 11.5.1 and proof, printed pp. 106--108 (standard reference, not scraped)