Equivalence of finite word metrics Created 2026-10-05 Updated 2026-10-14
Changing a finite generating set of a group changes individual distances, but it cannot introduce arbitrarily large relative distortion. For two finite symmetric generating sets of a group of the same group, set
Each -letter can be replaced by at most -letters, and conversely each -letter by at most -letters. Applying these substitutions to shortest representatives of gives
Thus the identity map is a bilipschitz equivalence between the two word metrics, and hence a quasi-isometry. The constants depend on the chosen generating sets of a group.[ref]
In the Cayley graphs of the integers example, and give and : a unit move costs one in either alphabet, and a move of size two costs two unit moves. This recovers . The diamond and square in word metric balls in the integer lattice obey the same comparison, because .
Finiteness cannot simply be dropped from this universal statement. For the additive integers, take the infinite symmetric generating set of a group . Every nonzero displacement is a single allowed move, so whenever , whereas for . There is no finite with : choosing an integer violates it. This is a counterexample to unrestricted equivalence, not a claim that every infinite generating set of a group fails; two such sets with uniformly bounded generator lengths can still satisfy the same substitution bounds.[ref]
The contraction mapping theorem states that a self-map of a nonempty complete metric space satisfying for a fixed has a unique fixed point. Its iterates converge to that point from every starting point.
To prove it, set . Induction gives . Hence for , the triangle inequality yields
Thus the iterates are a Cauchy sequence, with limit by completeness. The contraction inequality gives , so . For any two fixed points , forces equality of the points. This proves existence, uniqueness and convergence; passing also gives the displayed error bound.
For the three-point example, positivity and symmetry of are immediate. For three distinct points, the largest side has length two, no more than the sum of the other two; repeated-point triangle inequalities are trivial. Thus is a metric. The discrete metric satisfies
which proves bilipschitz equivalence of the two metrics. Define
The ratios of output to input distances for the three distinct pairs are in , so it is a contraction with . In , the pair has input and output distance one, precluding any . This illustrates the contraction property under equivalent metrics.
False. On the additive topological group , put and . Both are invariant under left and right translations and induce the usual topology. The triangle inequality for follows from for . But
can be arbitrarily close to zero and arbitrarily large. Consequently no can satisfy both proposed inequalities. Compatibility of the two invariant metrics is topological equivalence, which need not be bilipschitz equivalence.
Use the unique curvature hyperbolic metric on a closed Riemann surface of genus , supplied by the uniformization theorem. This is the implicit setting for the partition and spectral theorems; a genus-zero or genus-one surface does not have this hyperbolic metric.
A partition is a pants decomposition by disjoint essential simple closed geodesics, whose complement is a union of pairs of pants. A pair of pants is a sphere with three disks removed, furnished here with geodesic boundary. Its Euler characteristic is , so there must be pants. Every pant has three boundaries and every cutting curve occurs twice, giving cutting curves. The Bers pants decomposition theorem asserts that a constant depending only on bounds the lengths of all cuffs in some such pants decomposition of every closed genus- hyperbolic surface.
To see what geometry the cuffs determine, cut each pair of pants along its three perpendicular seams into two congruent right-angled hyperbolic hexagons. The three alternate sides are , where the are its boundary lengths. The right-angled hyperbolic hexagon identity determines the seam opposite the half-cuff by
We use the standard existence and uniqueness theorem for a right-angled hyperbolic hexagon with prescribed positive alternating side lengths. Thus the three boundary lengths determine the pair of pants up to isometry.
Fix a topological pants decomposition, label its cuffs, and choose reference seam endpoints and orientations. Gluing two boundaries of the same length requires a translation along that boundary; its signed distance is a twist . The gluing graph, the positive cuff lengths, and the twists therefore determine the unmarked hyperbolic surface up to isometry. A full boundary translation has period , so for an unmarked gluing one may take , with endpoints identified. For a marked surface the whole real twist records the number of Dehn twists, and the Fenchel–Nielsen coordinates are
The topological gluing data are necessary when the decomposition is not fixed. Different markings or decomposition graphs can describe the same unmarked surface.
Teichmüller space consists of pairs , where is a closed genus- Riemann surface and is an orientation-preserving marking, modulo the equivalence when a conformal orientation-preserving map has homotopic to . The Fenchel–Nielsen coordinates identify it with , of real dimension . The moduli space of Riemann surfaces forgets the marking by quotienting by the mapping class group.
The Wolpert generic spectral rigidity theorem says that the locus of closed genus- hyperbolic surfaces possessing an isospectral but nonisometric partner lies in a locally real-analytic exceptional locus of lower dimension in Teichmüller space. Thus a generic surface is determined, up to isometry, by its unmarked length spectrum, equivalently by its Laplacian spectrum. Here an isometry may reverse orientation; the length spectrum cannot distinguish the two orientations of the same metric. The equivalence of the two spectra is the compact hyperbolic Selberg trace formula.
The simplifying result is the Buser finite length spectrum theorem: for every and there is such that two closed genus- hyperbolic surfaces with hyperbolic systoles at least have the same entire unmarked length spectrum if their length multisets up to agree. Multiplicities are included. We will count primitive unoriented closed geodesics; counting all iterates is equivalent by successively removing shorter iterates. The theorem is uniform on the thick part of moduli space, not merely a cutoff chosen separately for a particular pair.
Here is a proof using compactness and polynomial trace equations. We state the subsidiary facts and explain their role. First, Mumford's compactness theorem makes the genus- thick moduli space compact. It can also be seen from the Bers pants decomposition theorem: cuffs in a Bers decomposition lie in , there are finitely many pants decomposition graphs, and unmarked twists may be reduced modulo their cuff lengths. These data lie in finitely many compact boxes of Fenchel–Nielsen coordinates and cover the thick moduli space.
Second, these finite compact boxes give a compact family of marked hyperbolic structures on a fixed smooth surface representing every member of the thick moduli space. We use the standard smooth dependence of the glued metrics and their hyperbolic holonomy representations on Fenchel–Nielsen coordinates. Choose smooth representatives over finitely many parameter neighborhoods and conjugate the hyperbolic holonomy representation using a fixed lifted Riemannian orthonormal frame. Passing to finite compact subboxes gives a compact set of representations, together with a compact family of representative smooth metrics. Changing the markings between boxes causes no problem: all are markings from the same fixed , and the union is finite.
Third, uniformization theorem identifies each marked hyperbolic surface with for a faithful discrete hyperbolic holonomy representation into . We use the standard lifting fact that a closed orientable hyperbolic holonomy representation admits a lift to , and lifts may be chosen continuously on small parameter neighborhoods. Choose lifts on finitely many such neighborhoods, allowing the finitely many possible sign choices. A representation is described by the matrices of standard fundamental group generators. The polynomial encoding of hyperbolic geodesic lengths uses, for each fixed group word , its squared matrix trace
is a polynomial in their entries: products are polynomial, and the inverse of a determinant-one matrix is its polynomial adjugate. For a nontrivial hyperbolic word, the hyperbolic translation length obeys
Thus equality of the positive lengths is exactly equality of these trace polynomials, independent of lift signs.
Fourth, the length spectrum of a closed hyperbolic surface is locally finite with finite multiplicities. We need the uniform finiteness of short geodesic classes across the compact marked family. More uniformly, for each finite , only finitely many unoriented primitive conjugacy classes can have length at most in any metric of . To justify uniformity, compactness of the smooth metrics gives a common bilipschitz equivalence comparison with one fixed metric on . If , the minimizing geodesic has length at most , so . Local finiteness for then gives a finite list. Local finiteness itself follows from proper discontinuity of the cocompact group of the hyperbolic holonomy representation: conjugate a geodesic axis to meet a fixed compact fundamental set, and a bounded-length axis gives a group element moving that compact set a bounded distance, of which there are only finitely many.
Finally, the Hilbert basis theorem says that a polynomial ring in finitely many real variables is Noetherian. Consequently a decreasing sequence of sets cut out by polynomial equations eventually stabilizes. Indeed, their vanishing ideals form an increasing chain and stabilize. Finite unions of such sets are still algebraic: one can take all products of one defining polynomial from each component. This finiteness fact is the engine that turns arbitrarily many spectral comparisons into finitely many.
Enumerate the primitive unoriented conjugacy classes as . For each let
and let be the finite set of primitive classes that can have length at most anywhere in . Define in the finite-dimensional space of pairs of generator matrices as follows: it consists of pairs for which there exists an injection
and also an injection satisfying the analogous equations with and interchanged. There are only finitely many injections. Each choice imposes finitely many polynomial equations; taking their finite unions and then intersecting the two directions proves that is a real affine algebraic set. On determinant-one representations these equations are exactly the desired matching of lengths. Defining the polynomials on the ambient matrix-entry space is harmless; the argument will only apply them to representations in .
Put . The sets form a decreasing chain of affine algebraic sets, hence for some ,
For representations in , membership in this intersection is equivalent to equality of the full length spectra. One direction follows by matching equal lengths, including their multiplicities. For the other, fix a length . All primitive classes of length on the first surface occur in some finite initial segment. Its injective matching shows that the second surface has at least that multiplicity at ; the reverse injection gives the reverse inequality. Local finiteness makes both multiplicities finite. Doing this for every proves multiset equality.
Take
If two surfaces in have equal length multisets up to , each initial segment through can be matched injectively on the other surface. Its matching classes lie in , since the matched lengths are at most . The reverse matching is available as well. Thus the pair belongs to , hence to every , and the preceding paragraph yields
All choices of the compact family were made using only and , so the resulting cutoff has the asserted dependence. If the thick family is empty the assertion is vacuous. This proves Buser's finite length spectrum theorem without claiming that equal full length spectra always force isometry; exceptional isospectral pairs are compatible with the theorem and are precisely why Wolpert's theorem is a generic statement.
A map is a quasi-isometry if there are and such that
for all , and every point of lies within distance of . The Milnor–Švarc lemma says that a group acting properly discontinuously, cocompactly and isometrically on a proper geodesic metric space is finitely generated, and each orbit map from a word metric is a quasi-isometry.
Now let be finite generating sets of . Put
Replacing each letter in an -word by a -word and conversely gives
Thus the identity map is a bilipschitz equivalence, hence a quasi-isometry. All finite generating sets of a finitely generated group give quasi-isometric Cayley graphs.
Any two word metrics from finite generating sets on the same group are bilipschitz equivalent. Indeed, if are finite, let ; then , and the reverse inequality follows symmetrically. Apply this once to the two finite generating sets of and once to those of . Composing these bilipschitz identity maps with the inclusion changes only the multiplicative and additive constants in the quasi-isometric embedding inequalities. Thus being a quasi-isometrically embedded subgroup is independent of and .
Fix a hyperbolicity constant for . For a prescribed , scale its distance by
All distances in every geodesic triangle, including its thinness constant, scale by . Hence
is -hyperbolic. Multiplication of a metric by a fixed positive constant is a bilipschitz equivalence and hence a quasi-isometry. Therefore is quasi-isometric to and cannot be a quasi-tree. This supplies an example for every .
Uniform finiteness of short geodesic classes Created 2026-10-07 Updated 2026-10-14
In a compact smooth family of marked closed hyperbolic surfaces, only finitely many free homotopy classes of closed geodesics have length below a fixed bound somewhere in the family. A uniform bilipschitz equivalence with a fixed metric reduces this to local finiteness of its length spectrum.