Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Hopf–Rinow theorem

Statement

Assume ACω. Let (M,g) be a nonempty, connected, boundaryless Riemannian manifold, and let d=dg be its Riemannian distance. The following conditions are equivalent.

  1. The metric space (M,d) is complete.
  2. The Riemannian manifold (M,g) is geodesically complete.
  3. For every p∈M, the fibre exponential domain is all of the tangent space: Ep=TpM.
  4. There is a point p0∈M for which Ep0=Tp0M.
  5. Every closed bounded subset of the metric space (M,d) is compact.

Whenever these conditions hold, every x,y∈M are joined by a minimizing geodesic. More exactly, there is v∈TxM with

exp⁡x(v)=y,∣v∣gx=d(x,y),

and t↦exp⁡x(tv) on [0,1] has length d(x,y).

The nonemptiness hypothesis is essential for this formulation: on the empty manifold conditions 1--3 and 5 are vacuous, whereas condition 4 is false.

Facts & Assumptions

Given: The manifold and distance in the statement.

[A1]

The Axiom of Countable Choice (ACω) is the assumed ACω. Boundaryless convention for geodesic flow and Hopf–Rinow explains why the boundaryless hypothesis is required.

[F1]

Riemannian distance on a connected manifold defines the finite distance d, and Riemannian distance is a metric supplies its metric axioms.

[F2]

Under [A1], Geodesically complete Riemannian manifold says that every maximal geodesic has domain R, while Domain and exponential map of a connection says that v∈Ep exactly when the maximal geodesic with initial vector v is defined at time 1.

[F3]

Under [A1], Metric completeness implies geodesic completeness proves condition 1 implies condition 2. Under the same assumption, Radial geodesics from one point reach every point under global exponential domain says that a global fibre exponential map reaches each point of the basepoint's component by a radial minimizing geodesic whose initial norm equals the Riemannian distance.

[F7]

Every Cauchy sequence in a metric space is bounded puts the range of a Cauchy sequence inside an open ball. For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide identifies topological compactness with metric compactness for a metric subspace, and A compact metric space is complete and totally bounded, and neither implication uses any choice principle makes that subspace complete, without any additional choice principle.

Proof

technique · equivalence cycle
1.1F3

Condition 1 implies condition 2 by [F3].

1.2F2

Suppose condition 2 holds. For p∈M and v∈TpM, [F2] gives Ip,v=R, so in particular 1∈Ip,v and hence v∈Ep. Thus TpM⊆Ep; the reverse inclusion is part of the definition, so Ep=TpM. Since p was arbitrary, condition 3 holds.

1.3given

Suppose condition 3 holds. Nonemptiness supplies one point p0∈M, and condition 3 at that one point gives Ep0=Tp0M. Thus condition 4 holds. This instantiates one existential statement and makes no family of choices.

1.4F1F4

Suppose condition 4, and fix such a p0. Let S⊆M be closed and bounded. If S=∅, every open cover has the empty finite subcover, so S is compact. Suppose instead that S≠∅. By [F4] there are a∈M and r>0 such that S⊆B(a,r), and put R=d(p0,a)+r>0,KR={v∈Tp0M:∣v∣gp0≤R}. For q∈S, the triangle inequality gives d(p0,q)≤d(p0,a)+d(a,q)<R.

1.5F5

If dim⁡M>0, identify Tp0M with Rn by one orthonormal basis from [F5]. The identity ∣∑iuiei∣2=∑i(ui)2 identifies KR with the Euclidean closed ball of radius R, which is closed and bounded and therefore compact by [F5]. If dim⁡M=0, then Tp0M={0p0} and KR is a singleton; given an open cover, any member containing its sole point is a one-member finite subcover. Thus KR is compact in every dimension.

1.6F4F7

Suppose condition 5, and let (xk) be a Cauchy sequence in (M,d). By [F7] there are c∈M and r>0 such that every xk lies in B(c,r). Put C=Bˉ(c,r). It is closed by [F4], and it is bounded because C⊆B(c,r+1). Hence condition 5 makes C compact.

1.7A1F2F3

The theorem assumes ACω because the maximal-geodesic and radial-minimizer facts [F2] and [F3] use the global geodesic construction under that assumption.

1.8A1F6

The smooth exponential-map fact [F6] inherits the same ACω assumption and introduces no stronger choice principle.

2.1F3step 1.4

For this fixed q, [F3] supplies a vector vq∈Tp0M with exp⁡p0(vq)=q and ∣vq∣gp0=d(p0,q)<R. Hence q∈exp⁡p0[KR]. Since q was arbitrary, S⊆exp⁡p0[KR]. This pointwise use of an existential theorem proves an inclusion; it does not construct or use a choice function q↦vq.

2.2F7step 1.6

By [F7], the metric subspace (C,d∣C×C) is a compact metric space and therefore complete. The sequence (xk) is Cauchy in this subspace, because all its terms lie in C and the subspace distance is the same d. It consequently converges to some x∈C in the subspace metric, hence also in (M,d). Every Cauchy sequence in M converges in M, so condition 1 holds.

3.1F6step 2.1step 1.5

The map exp⁡p0 is continuous on all of Tp0M by condition 4 and [F6], so HR:=exp⁡p0[KR] is compact. Since S is closed in M, it is closed in the subspace HR; steps 2.1 and 1.5 and [F6] therefore make S compact. The closed bounded set S was arbitrary, so condition 5 holds.

4.1step 1.1step 1.2step 1.3step 1.4step 1.5step 1.6step 2.1step 2.2step 3.1

Steps 1.1--3.1 and 1.6--2.2 prove the cycle 1⟹2⟹3⟹4⟹5⟹1, so all five conditions are equivalent.

5.1F3step 4.1

Assume any one of the equivalent conditions and fix x,y∈M. Condition 3 then holds, so Ex=TxM. Because M is connected, the component of x is all of M, and [F3] supplies v∈TxM with the stated endpoint, norm, length, and global minimizing properties. This proves the final assertion.

5.2F4F5step 1.4step 1.5step 4.1

Step 1.4 treats the empty closed bounded subset separately and keeps every ball radius positive; step 1.5 uses the closed tangent-ball endpoint. Both directions of the equivalence are present in the cycle.

6.1F2F3step 1.3step 5.1

Nonemptiness was used exactly at step 1.3 and is indispensable for the displayed equivalence, as the statement's empty-manifold comparison shows. A nonempty connected zero-manifold is a singleton: its zero-dimensional charts make points open, and a discrete connected nonempty space has one point. All five conditions then hold and step 5.1 gives the constant minimizing geodesic. The proof in dimension one is unchanged. At x=y, [F3] supplies v=0x, so no division by a distance occurs.

7.1F5F6F7step 1.4step 1.5step 2.1step 2.2step 3.1∎

The finite-dimensional and topological compactness facts in [F5]--[F7] require no additional choice. The constructions in steps 1.4--3.1 use only fixed existential witnesses or pointwise existential elimination, as step 2.1 makes explicit, and therefore add no countable or arbitrary selection.

Source locators

  • Datar, Theorem 19.2.1 and its proof, pp.141--144: the five conditions, metric-to-geodesic completeness, radial minimizers from a global exponential fibre, and compactness of closed bounded sets.
  • Andrews, Theorem 11.5.1 and its proof, printed pp.106--108: completeness, global exponential domains, and existence of minimizing radial geodesics. The properness clauses and the explicit empty-manifold qualification above are verified locally.

Depends on

Used by

…and 20 more results.

Dependency tree · two levels

109 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