pith. sign in

arxiv: 2410.15276 · v3 · submitted 2024-10-20 · 🧮 math.GR · math.GT

The Pants Graph of a Free Group

Pith reviewed 2026-05-23 19:07 UTC · model grok-4.3

classification 🧮 math.GR math.GT
keywords pants graphfree groupouter automorphism groupfree splitting complexcoarsely surjective orbit mapcoarsely Lipschitz mapconnected graphunbounded diameter
0
0 comments X

The pith

The outer automorphism group of a free group acts isometrically on its pants graph with a coarsely surjective orbit map, and there is a coarsely Lipschitz map to the free splitting complex.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines a pants decomposition for a finitely generated free group and uses it to build the pants graph, whose vertices are all such decompositions. It shows that the outer automorphism group acts isometrically on this graph so that every point lies within bounded distance of some orbit point, and it constructs a map to the free splitting complex that stretches distances by at most a fixed factor. These two maps together force the pants graph to be path-connected and to have infinite diameter. A reader would care because the construction supplies a new combinatorial object on which Out(F_n) acts, with control over its large-scale geometry.

Core claim

A pants decomposition of a free group is introduced, leading to the pants graph consisting of all such decompositions. The natural isometric action of the outer automorphism group induces a coarsely surjective orbit map. A coarsely Lipschitz map from the pants graph to the free splitting complex is constructed. These imply the pants graph is connected and unbounded.

What carries the argument

The pants graph, the simplicial graph whose vertices are pants decompositions of the free group.

If this is right

  • The pants graph is path-connected.
  • The diameter of the pants graph is infinite.
  • Every point in the pants graph lies at bounded distance from the orbit of any basepoint under Out(F).
  • Distances in the pants graph coarsely dominate distances in the free splitting complex via the constructed map.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The two maps together may allow results proved on the free splitting complex to be pulled back to the pants graph up to coarse distortion.
  • One could check whether the pants graph is quasi-isometric to other known Out(F_n)-complexes.
  • The construction supplies a concrete combinatorial model in which to test geometric properties of outer automorphism groups that were previously studied only on the splitting complex.

Load-bearing premise

Pants decompositions of free groups can be defined so that the resulting simplicial graph admits an isometric Out(F) action and a coarsely Lipschitz map to the free splitting complex.

What would settle it

An explicit pair of pants decompositions in some free group F_n whose distance in the pants graph cannot be bounded by any function of their distance in the free splitting complex.

Figures

Figures reproduced from arXiv: 2410.15276 by Donggyun Seo.

Figure 1
Figure 1. Figure 1: the Farey graph and the orientable pants graph of F2 This map φ preserves the adjacency of vertices, and we extend it to a simplicial map. The image of φ contains all vertices except for the midpoints of edges of C(S1,1). Observe that the closed 1-neighborhood of the image of φ covers Cˆ(S1,1) (1). Thus, the image of φ is 1-dense. Now, consider two vertices P ′ , P′′ ∈ P+ 2 . Let φ(P ′ ) = γ0, γ1, . . . , … view at source ↗
Figure 2
Figure 2. Figure 2: Elementary move I 3.2.2. Elementary move II. The key characteristic of Elementary move II is that it involves a modification of the surface itself. This move provides a homotopy equiv￾alence η : X → Y , which transforms a pants decomposition [PX, hX, X] into a new pants decomposition [PY , η ◦ hX, Y ] for some marked pants decomposition PY , as illustrated in [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Elementary move II Then there exists the unique boundary curve β ⊂ X such that the union of η(PX) and η(β) is a pants decomposition of Y , denoted by PY . We say Elementary move II is the move that modifies [PX, hX, X] to [PY , η ◦ hX, Y ]. We also call the inverse of this move Elementary move II. 3.2.3. Elementary move III. Elementary move III is one of the elementary moves introduced by Papadopoulos–Penn… view at source ↗
Figure 4
Figure 4. Figure 4: Elementary move III [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Elementary move IV 3.3. (Non-orientable) Pants graphs. We define a simplicial graph Pn as follows: Consider all pants decompositions of the n-rose as the vertices of Pn. Two vertices are joined by an edge in Pn if and only if there exist representatives of these vertices such that one is obtained from the other by Elementary move I, II, III, or IV. We call Pn the pants graph of Fn. Next, we define a simpli… view at source ↗
Figure 6
Figure 6. Figure 6: Their distance in P + n is at most three [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Three red curves Proof. Consider the three red curves in [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Their distance is uniformly bounded. Proof. Let γ be the separating curve on the left-hand side of [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Their distance is uniformly bounded. to construct a path between these two vertices that contains two consecutive edges associated with an Elementary move IV. From this exercise, one deduces that for each marked surface (hX, X), the map P(X) → Pn, PX 7→ [PX, hX, X], extended so that each edge is mapped to a geodesic segment, is coarsely Lipschitz. As a corollary, the image of P(X) in Pn is connected for ev… view at source ↗
Figure 10
Figure 10. Figure 10: A cycle preserved by ιi The pants decomposition P and its image under the inversion, ιi .P = [PX, hX ◦ ι −1 i , X), are joined by a path of length two, as shown in [PITH_FULL_IMAGE:figures/full_fig_p016_10.png] view at source ↗
read the original abstract

We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants graph of a free group, consisting of all possible pants decompositions. The natural isometric action of the outer automorphism group of the free group on the pants graph induces a coarsely surjective orbit map. Additionally, we construct a coarsely Lipschitz map from the pants graph to the free splitting complex. These results imply that the pants graph of a free group is both connected and unbounded.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper introduces the notion of a pants decomposition for a finitely generated free group and defines the associated pants graph as the simplicial graph whose vertices are these decompositions. It establishes that Out(F_n) acts isometrically on this graph with a coarsely surjective orbit map, constructs a coarsely Lipschitz map from the pants graph to the free splitting complex, and concludes from these that the pants graph is connected and unbounded.

Significance. If the results hold, the construction provides a new combinatorial model for the action of Out(F_n), analogous to the pants graph in the surface case, and links it via a coarse map to the free splitting complex. This could serve as a tool for studying the geometry of outer automorphisms of free groups, with the connectedness and unboundedness results forming a foundational step for further investigations in geometric group theory.

minor comments (3)
  1. The introduction would benefit from a brief comparison to existing complexes such as the free factor complex or the free splitting complex to clarify the novelty of the pants graph.
  2. Notation for the pants decompositions and the simplicial structure of the graph should be made consistent between the definition and the statements of the main theorems.
  3. The abstract states the implications for connectedness and unboundedness but does not indicate the rank n for which the results hold; this should be clarified in the introduction.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript and for recommending minor revision. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines a new notion of pants decomposition for free groups and builds the associated simplicial pants graph from it. The claimed isometric Out(F_n) action, coarsely surjective orbit map, and coarsely Lipschitz map to the free splitting complex are presented as constructions on this newly defined object; the connectedness and unboundedness conclusions follow directly from those constructions. No equations, fitted parameters, self-citations, or prior results are invoked in a way that reduces any central claim to its own inputs by definition or by construction. The argument is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claims rest on the newly introduced definition of pants decomposition for free groups and the existence of the stated coarse maps; no numerical free parameters are used.

axioms (1)
  • domain assumption A pants decomposition of a finitely generated free group exists and assembles into a simplicial graph.
    Invoked in the second sentence of the abstract to define the vertices of the pants graph.
invented entities (1)
  • Pants decomposition of a free group no independent evidence
    purpose: To serve as vertices of the new pants graph
    New algebraic notion introduced by the paper; no independent evidence supplied beyond the construction itself.

pith-pipeline@v0.9.0 · 5609 in / 1286 out tokens · 24470 ms · 2026-05-23T19:07:31.017937+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Systems 43 (2023), no

    Tarik Aougab, Matt Clay, and Yo'av Rieck, Thermodynamic metrics on outer space, Ergodic Theory Dynam. Systems 43 (2023), no. 3, 729--793. 4544143

  2. [2]

    Brock, The W eil- P etersson metric and volumes of 3-dimensional hyperbolic convex cores , J

    Jeffrey F. Brock, The W eil- P etersson metric and volumes of 3-dimensional hyperbolic convex cores , J. Amer. Math. Soc. 16 (2003), no. 3, 495--535. 1969203

  3. [3]

    Young-Eun Choi and Kasra Rafi, Comparison between T eichm\" u ller and L ipschitz metrics , J. Lond. Math. Soc. (2) 76 (2007), no. 3, 739--756. 2377122

  4. [4]

    Marc Culler and Karen Vogtmann, Moduli of graphs and automorphisms of free groups, Invent. Math. 84 (1986), no. 1, 91--119. 830040

  5. [5]

    Taylor, The co-surface graph and the geometry of hyperbolic free group extensions, J

    Spencer Dowdall and Samuel J. Taylor, The co-surface graph and the geometry of hyperbolic free group extensions, J. Topol. 10 (2017), no. 2, 447--482. 3653318

  6. [6]

    Stefano Francaviglia and Armando Martino, Metric properties of outer space, Publ. Mat. 55 (2011), no. 2, 433--473. 2839451

  7. [7]

    Allen Hatcher, Homological stability for automorphism groups of free groups, Comment. Math. Helv. 70 (1995), no. 1, 39--62. 1314940

  8. [8]

    Michael Handel and Lee Mosher, The free splitting complex of a free group, I : hyperbolicity , Geom. Topol. 17 (2013), no. 3, 1581--1672. 3073931

  9. [9]

    , The free splitting complex of a free group, II : L oxodromic outer automorphisms , Trans. Amer. Math. Soc. 372 (2019), no. 6, 4053--4105. 4009387

  10. [10]

    3, 221--237

    Allen Hatcher and William Thurston, A presentation for the mapping class group of a closed orientable surface, Topology 19 (1980), no. 3, 221--237. 579573

  11. [11]

    Allen Hatcher and Karen Vogtmann, The complex of free factors of a free group, Quart. J. Math. Oxford Ser. (2) 49 (1998), no. 196, 459--468. 1660045

  12. [12]

    Ilya Kapovich and Martin Lustig, Geometric intersection number and analogues of the curve complex for free groups, Geom. Topol. 13 (2009), no. 3, 1805--1833. 2496058

  13. [13]

    Ilya Kapovich and Kasra Rafi, On hyperbolicity of free splitting and free factor complexes, Groups Geom. Dyn. 8 (2014), no. 2, 391--414. 3231221

  14. [14]

    2, 283--298

    Feng Luo, Automorphisms of the complex of curves, Topology 39 (2000), no. 2, 283--298. 1722024

  15. [15]

    Dedicata 173 (2014), 271--280

    Brian Mann, Hyperbolicity of the cyclic splitting graph, Geom. Dedicata 173 (2014), 271--280. 3275303

  16. [16]

    Dan Margalit, Automorphisms of the pants complex, Duke Math. J. 121 (2004), no. 3, 457--479. 2040283

  17. [17]

    Bernhard Neumann, Die A utomorphismengruppe der freien G ruppen , Math. Ann. 107 (1933), no. 1, 367--386. 1512806

  18. [18]

    Jakob Nielsen, Die I somorphismengruppe der freien G ruppen , Math. Ann. 91 (1924), no. 3-4, 169--209. 1512188

  19. [19]

    Penner, Hyperbolic metrics, measured foliations and pants decompositions for non-orientable surfaces, Asian J

    Athanase Papadopoulos and Robert C. Penner, Hyperbolic metrics, measured foliations and pants decompositions for non-orientable surfaces, Asian J. Math. 20 (2016), no. 1, 157--182. 3460762

  20. [20]

    Micha Stukow and B a \.z ej Szepietowski , Automorphisms of the pants graph of a nonorientable surface , arXiv e-prints (2025), arXiv:2507.12613