© 2026 NeckPinch · www.neckpinch.com · All rights reserved.
Course 9Book 9B: Comparison, Convergence and Heat on ManifoldsChapter 4
Convergence of Manifolds
Gromov–Hausdorff and Cheeger–Gromov convergence, and the compactness theorem.
Read with Petersen's Riemannian Geometry, the convergence chapter (Gromov–Hausdorff distance, Gromov's precompactness, and smooth convergence with bounded curvature and injectivity radius). Burago, Burago and Ivanov's A Course in Metric Geometry, chapter 7, is the reference for Gromov–Hausdorff convergence; Topping's Lectures on the Ricci Flow gives the Cheeger–Gromov–Hamilton compactness theorem in the form used for flows.
In this chapter · 5 sections
Analysis extracts convergent subsequences from bounded sequences: Bolzano–Weierstrass in , Arzelà–Ascoli for functions (2B.5 Uniform Convergence and Arzelà–Ascoli). The Ricci flow needs the same for manifolds. Blow up a flow near a singularity, rescaling time after time so that the curvature stays bounded, and you get a sequence of Riemannian manifolds. To study the singularity you need a limit of that sequence. Two notions of convergence do this. Gromov–Hausdorff convergence treats manifolds as metric spaces and needs very little to apply, but its limits can be singular and of lower dimension. Cheeger–Gromov convergence is smooth convergence up to diffeomorphism, and its compactness theorem needs bounded curvature and a lower bound on the injectivity radius, exactly the two pieces of 9B.3 Collapsing and Noncollapsing.
This chapter also states, in geometric form, the argument that the rest of the Path uses again and again: suppose an estimate fails, take a sequence of counterexamples, rescale, extract a limit, and reach a contradiction in the limit.
By the end of this chapter you will be able to:
- define the Hausdorff and Gromov–Hausdorff distances, and compute simple examples;
- state Gromov's precompactness theorem and explain why packing proves it;
- define pointed smooth (Cheeger–Gromov) convergence and state the compactness theorem;
- explain why both hypotheses of the compactness theorem are needed;
- run the compactness–contradiction argument in a geometric setting.
Comparing shapes
A laser scanner or a structured-light camera samples a surface as a cloud of points. Two scans of the same object, taken in different positions, are related by an unknown rigid motion, and an object that bends (a hand, a body) is related to itself by an unknown near-isometry. To decide whether two scans show the same shape, one wants a distance between metric spaces that ignores how they are placed and depends only on their intrinsic distances. Facundo Mémoli and Guillermo Sapiro ("A theoretical and computational framework for isometry invariant recognition of point cloud data", Foundations of Computational Mathematics, 2005) proposed the Gromov–Hausdorff distance for this, using geodesic distances computed on the point clouds. They showed how sampling at increasing density approximates the distance between the underlying surfaces. Computing the distance exactly is hard in general, and practical methods use approximations, but the idea has shaped the field of shape analysis.
Hausdorff and Gromov–Hausdorff distance
For subsets of a metric space , the Hausdorff distance is the infimum of such that each set lies within of the other. For compact metric spaces , the Gromov–Hausdorff distance is
the infimum over all metric spaces and isometric embeddings , (Figure 4.1). It is zero exactly when and are isometric, and it is a metric on isometry classes of compact metric spaces. A practical description uses correspondences. A relation that relates every point of each space to some point of the other has distortion
and (Burago–Burago–Ivanov, chapter 7). For example, a point and a space are at distance (Exercise 4.4).
For noncompact spaces one uses pointed convergence: if the balls converge to for every (with a small technical adjustment at the boundary). A collapsing sequence converges in this sense to something lower-dimensional: thin flat tori to a circle (Exercise 4.5), Berger spheres to , the thin cylinder to a line (9B.3 Collapsing and Noncollapsing).
For every , and , the class of closed Riemannian -manifolds with and is precompact in the Gromov–Hausdorff distance: every sequence in it has a subsequence converging to a compact metric space.
The proof rests on a criterion of Gromov: a class of compact metric spaces is precompact if, for each , every space in the class can be covered by at most balls of radius , with independent of the space. Packing (9B.2 Volume Comparison) supplies exactly this: a maximal set of points at mutual distance at least has the -balls around it covering, and the disjoint -balls are at most in number by relative volume comparison (with the volume of balls in the model space of curvature ). The limits can be singular. Characterising them is a deep theory, begun by Cheeger and Colding in the 1990s.
Smooth convergence
A sequence of complete pointed Riemannian manifolds converges smoothly to if there are an exhaustion of by open sets containing , and smooth embeddings with , such that smoothly on every compact subset of : uniformly with all derivatives.
The diffeomorphisms are part of the definition, because a metric is only defined up to diffeomorphism (8A.6 Flows and the Lie Derivative). Smooth limits are smooth manifolds of the same dimension, so they exclude collapse.
Let be complete pointed Riemannian -manifolds such that, for every , on with independent of , and . Then a subsequence converges smoothly, in the sense of Definition 4.2, to a complete pointed Riemannian manifold .
The architecture of the proof. (1) The injectivity radius bound at spreads to every point at bounded distance, with a smaller constant. Bishop–Gromov (9B.2 Volume Comparison) moves the volume lower bound from to nearby balls, and Cheeger–Gromov–Taylor (9B.3 Collapsing and Noncollapsing) turns volume back into injectivity radius. (2) Around every point there is then a chart of uniform size in which the metric coefficients and all their derivatives are bounded: normal coordinates, or better, harmonic coordinates. (3) Arzelà–Ascoli (2B.5 Uniform Convergence and Arzelà–Ascoli), applied chart by chart, with a diagonal argument over and over , gives limits of the metric coefficients. (4) The charts are glued into a limit manifold and maps , with a centre-of-mass construction smoothing the transition maps. Hamilton proved the version for sequences of Ricci flows in 1995 (11B.3 Compactness of Ricci Flows), where the curvature bounds on derivatives come for free from Shi's estimates.
Both hypotheses are necessary. Without the curvature bounds, smooth surfaces can converge to a cone or develop a corner. Without the injectivity radius bound, thin tori have zero curvature and no smooth two-dimensional limit.
Suppose we want an estimate that holds uniformly over a class of manifolds or flows. Suppose it fails. Then there is a sequence of examples on which it fails worse and worse. Rescale each so that the relevant quantity (usually curvature at a chosen point) is . Check the hypotheses of the compactness theorem: curvature bounds, from the normalisation and from the choice of points, and an injectivity radius bound, from noncollapsing. Extract a smooth limit. The limit inherits properties that no manifold of its kind can have, a contradiction. Every theorem in 11B.3 Compactness of Ricci Flows, 11B.4 Singularities, 12B.2 The Structure of κ-Solutions and 12B.3 The Canonical Neighbourhood Theorem has this shape. The template was first met for functions in 2B.3 Compactness.
Hamilton's compactness theorem for flows (11B.3 Compactness of Ricci Flows) is this theorem with time added: a sequence of Ricci flows with uniformly bounded curvature on a time interval and an injectivity radius bound at one point at one time has a subsequence converging to a Ricci flow. In 1995 the injectivity radius was the hypothesis nobody could verify at singularities. Perelman's noncollapsing theorem (12A.4 κ-Noncollapsing) supplied it.
History
Felix Hausdorff defined his distance in 1914. David Edwards introduced the distance between metric spaces in 1975, and Mikhail Gromov independently developed it, with precompactness and its first uses in geometry, in 1981. Jeff Cheeger's finiteness theorem (1970) contained the first smooth compactness argument; the smooth compactness theorem in its modern form is due to Gromov, with refinements by Stefan Peters (1987) and by Robert Greene and Hung-Hsi Wu (1988). Richard Hamilton proved the compactness theorem for Ricci flows in 1995. Cheeger and Colding's structure theory for limits with lower Ricci bounds dates from 1996–2000.
The Gromov–Hausdorff distance compares compact metric spaces up to isometry, through common embeddings or through correspondences (). Lower Ricci bounds and bounded diameter give Gromov precompactness, via packing; limits may be singular or lower-dimensional (collapse). Cheeger–Gromov convergence is smooth convergence after pulling back by embeddings, and the compactness theorem gives it from bounds on all derivatives of curvature plus a lower injectivity radius bound at the base points. The compactness–contradiction template turns failure of an estimate into a limit with impossible properties. 9B.5 Splitting and Soul Theorems studies what limits with or can look like.
Exercises
Using correspondences, show that . Deduce that the circle of length , with its intrinsic metric, is at distance from a point.
Solution
The only correspondence relates to every , with distortion , so . The circle of length has intrinsic diameter .
Let and the circle . For the correspondence relating to , show the distortion is at most , so .
Solution
with in . So .
Show that the inscribed regular -gon of the unit circle is at Hausdorff distance from the circle in the plane. Is the Gromov–Hausdorff distance between the polygon (with the metric of the plane) and the circle (with the metric of the plane) at most this? What changes if both carry their intrinsic (path-length) metrics?
Solution
The farthest point of the polygon from the circle is the midpoint of a side, at distance from the centre; every point of the circle is within of the polygon too (the nearest side's midpoint direction). Since both sit in the plane isometrically, . With intrinsic metrics the spaces change (the polygon has perimeter , the circle ), but the polygons still converge to the circle, as one checks with the correspondence matching points at the same angle.
Let be the round metric of radius on , and a point. Describe the limit of (a) in the Gromov–Hausdorff sense, (b) , (c) in the pointed smooth sense.
Solution
(a) The diameter , so the limit is a point. (b) is the unit round sphere for every : a constant sequence. (c) is the round sphere of radius ; its curvature and its injectivity radius , and the pointed limit is . Which limit you see depends on the scale you choose, and choosing it well is the art of blow-up arguments.
Explain why the sequence of thin flat tori satisfies every hypothesis of Theorem 4.3 except one, and why it has no smooth limit of dimension (look at the volume of unit balls).
Solution
All derivatives of vanish, so the curvature hypotheses hold with , but . In a smooth limit, on compact sets, so volumes of unit balls would converge to a positive number (the limit is a smooth surface), but .
Assume that if closed manifolds converge smoothly to a closed , then is diffeomorphic to for all large (with the diameters bounded, the exhaustion eventually covers , and becomes a diffeomorphism). Use the compactness theorem to prove: for given , , and constants , there are only finitely many diffeomorphism types of closed -manifolds with , and . Identify each step of the template. (Cheeger's 1970 theorem needs only , with a volume lower bound in place of the injectivity radius bound, and a finer argument.)
Solution
Suppose infinitely many diffeomorphism types occur; choose pairwise non-diffeomorphic (failure of the uniform statement). Pick any (the normalisation is already uniform). The compactness theorem gives a subsequence converging smoothly to a complete (extraction); , so is closed. By the assumption, for all large in the subsequence, so two of them are diffeomorphic to each other: a contradiction.
© 2026 NeckPinch (www.neckpinch.com). All content in the guidebook (text, mathematics, figures and exercises) is protected by copyright. All rights reserved. No part may be copied, republished or redistributed without written permission.