Pith. sign in

REVIEW 5 major objections 4 minor 1 cited by

Hyperbolicity, topology, and combinatorics of fine curve graphs and variants

T0 review · 5 major / 4 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The finitary curve graph's automorphism group is exactly the surface's homeomorphism group.

desk verdict New constructions in fine curve graphs are real, but Theorem 1.8 and the contractibility result rest on an unproved lemma, so the paper needs revision before its main rigidity claims can be trusted. read the letter →

arxiv 2501.18705 v1 pith:I6TVGEKS submitted 2025-01-30 math.GT math.CO

Roberta Shapiro This is my paper · ORCID
classification math.GTmath.CO MSC 57K2005C63
keywords finek-curvegraphfinitarycurveGromovhyperbolicitycountableuniversalautomorphismrigidityflagcomplexinducedsubgraphsurfacehomeomorphismgroup
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper studies the fine k-curve graph of a surface: vertices are actual embedded essential closed curves, and two vertices are adjacent when the curves meet in at most k points. Its main positive claim is that caring only about finite intersection produces a single graph, the finitary curve graph, that is simultaneously a universal countable graph and a sharp geometric invariant: every countable graph embeds as an induced subgraph, while the automorphism group is exactly the surface homeomorphism group. The paper also proves hyperbolicity of each fine k-curve graph, computes diameter 2 for the finitary graph, shows its flag complex is contractible, and gives finite graphs that cannot be embedded in fine curve graphs. A reader should care because the results bundle two properties usually thought to fight each other — genericity and rigidity — into one explicitly geometric object.

What carries the argument

The load-bearing tool is a crossing representative lemma (Lemma 4.1 and Corollary 4.2): after deleting a compact totally disconnected set of messy intersections from a surface, any prescribed isotopy class still contains a curve or arc that meets each curve in a given finite family only finitely many times and only in crossings. This is proved by annular surgery arguments that push a curve off the bad intersections. The lemma supplies the common neighbor needed for contractibility, the induced embeddings of arbitrary graphs, and the link-inclusion criterion used in the automorphism proof. A second, smaller mechanism is the link characterization Lemma 6.2: a curve lies in the union of a finite set of curves exactly when every curve meeting each of those finitely also meets it finitely; this translates infinite intersection behavior into graph-theoretic link inclusion, allowing automorphisms of the finitary graph to preserve edges with one intersection and thereby reduce to rigidity of the fine 1-curve graph.

What would settle it

Draw two curves whose intersection set is a Cantor set on a surface with a Cantor set removed, choose the isotopy class of a third curve that must thread between them, and check whether a representative exists meeting both curves finitely and only in crossings; any failure refutes Corollary 4.2 and with it the contractibility and automorphism theorems.

Watch

Extended reading notes

Core claim

The paper's central discovery is that the finitary curve graph $C^\dagger_{<\infty}(S_g)$ of a closed oriented surface is a strangely extreme object: it has diameter 2, its flag complex is contractible, and it contains every countable graph as an induced subgraph, yet its automorphism group is exactly the homeomorphism group of $S_g$ under the natural action. Theorem 1.8 states that the map $\Phi\colon \mathrm{Homeo}(S_g)\to \mathrm{Aut}(C^\dagger_{<\infty}(S_g))$ is an isomorphism. Along the way the paper proves that every fine $k$-curve graph is Gromov hyperbolic for all $k$, and that finite graphs can be embedded into fine curve graphs only with genus quadratic in the number of vertices, while certain finite graphs such as wheels and doubled pants obstructions are inadmissible.

Load-bearing premise

The load-bearing premise is that a curve can always be repositioned in any chosen winding pattern so that it meets each curve of a finite collection only finitely many times, crossing at every meeting; the paper asserts this follows without a full proof.

Editorial extensions

If this is right

  • The finitary curve graph is quasi-isometric to a point, so all large-scale geometry is trivial and the group rigidity must come from local graph structure.
  • Every countable graph, including the countable random graph, occurs as an induced subgraph of the finitary curve graph and of every fine k-curve graph with k at least 2.
  • For the fine curve graph with k equal to 0, finite graphs embed only with genus quadratic in the number of vertices, and explicit finite graphs are forbidden as induced subgraphs.
  • The flag complex of the finitary curve graph is contractible, so the clique complex loses all topological information about the surface.
  • Automorphisms of the finitary curve graph are exactly the homeomorphisms, so the graph is not highly symmetric: some isomorphisms between induced subgraphs do not extend to automorphisms.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the same argument can be rerun for compact surfaces with boundary, the expected automorphism group would be a relative homeomorphism group that fixes or permutes boundary components; testing that extension is a direct next step.
  • The proof's reliance on the crossing representative lemma suggests the whole package could be tested by checking Corollary 4.2 for wild pairs of curves whose intersection set is a Cantor set, since a counterexample there would isolate a failure even if the automorphism theorem itself is not directly contradicted.
  • The combination of containing every countable graph while failing the extension property that characterizes the countable random graph points toward a family of countable universal graphs whose automorphism groups are large geometric groups rather than the full symmetric group of a countable set.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 4 minor

Summary. The paper studies fine k-curve graphs C†_k(S), whose vertices are essential simple closed curves and whose edges join curves meeting in at most k points, together with the direct limit C†_<∞(S), where edges join curves meeting finitely many times. The main claims are: hyperbolicity of C†_k(S_g) for all k; diameter 2 for C†_<∞(S_g,b); contractibility of its flag complex; induced-subgraph universality for all countable graphs in C†_k(S_g,b) for k ≥ 2 and in C†_<∞(S_g,b); existence of finite graphs not appearing as induced subgraphs of fine curve graphs; and an isomorphism Aut(C†_<∞(S_g)) ≅ Homeo(S_g). The proofs rest on an asserted existence result (Proposition 3.4) for curves meeting finite collections of curves or arcs in finitely many crossing points, on reduction to Bowden–Hensel–Webb for hyperbolicity, and on Booth–Minahan–Shapiro for automorphisms of the fine 1-curve graph.

Significance. The results are potentially strong: a countable-universal graph whose automorphism group recovers the full homeomorphism group of a surface is striking, and the explicit construction of finite inadmissible subgraphs of fine curve graphs is a valuable addition. The paper is also quite explicit, with worked examples, figures, and detailed constructions rather than parameter-fitting or black-box arguments. However, several load-bearing statements are currently asserted rather than proved, including Proposition 3.4, parts of Corollary 4.2, the inductive surgery step in Proposition 2.2, and the key automorphism-preservation step in Proposition 6.1. If these gaps are repaired, the results would be significant; as written, the central claims are not yet fully supported.

major comments (5)
  1. [§3, Proposition 3.4] Proposition 3.4 is stated as 'directly follows from the above discussion,' but Lemmas 3.1–3.3 concern a single annulus or strip in which the intersection of the collection with the annulus is already a union of arcs. Proposition 3.4 must handle an arbitrary finite collection of curves and arcs in Σ = S \ C and an arbitrary prescribed isotopy class, with only crossing intersections. This is not a formal consequence of the lemmas as written. Since Corollary 4.2, Lemma 4.1, Theorem 1.3, Lemma 5.2, Lemma 6.2, and Theorem 1.8 all depend on this existence result, a complete proof is needed.
  2. [§4, Corollary 4.2 and Lemma 4.1] The proof of Corollary 4.2 constructs a curve γ in an annular or strip neighborhood A of a representative α that is disjoint from P, and then stops. It never invokes Proposition 3.4 or Lemma 3.3 to arrange |γ ∩ γ_i| < ∞ or that all intersections are crossing, so conditions (1) and (2) of the corollary are not proved. In addition, Lemma 4.1 cites 'Lemma 3.4', which does not exist in the paper, and its claim that Σ' is connected is justified by saying that the universal cover of Σ \ E is simply connected, which does not imply that the base is connected. These gaps are load-bearing for Theorem 1.3 and for the rigidity argument in Section 6.
  3. [§3, proof of Theorem 1.2] The proof establishes only that any two vertices a and b are joined by a length-two path a–c–b, so diam(C†_<∞(S_g,b)) ≤ 2. To prove diam = 2 the paper must also exhibit two curves with infinite intersection whose vertices are not adjacent; no such pair is constructed and the lower bound is not otherwise established.
  4. [§2, Proposition 2.2, Case 3] In the essential-intersection case, the proof asserts that if ui and ui+1 meet k+1 times and are in minimal position, then 'conventional surgery techniques' produce a path of length two in C†_k(S_g). No detailed argument or precise reference is given. This is the inductive step on which hyperbolicity of all fine k-curve graphs rests, so the surgery construction needs to be written out for this graph or replaced by a citation that covers exactly this statement.
  5. [§6, Proposition 6.1] The proof consists of the sentence 'The proposition now follows from Lemma 6.3.' That is not sufficient: Lemma 6.3 gives a topological characterization of |u ∩ v| ≤ 1 via absence of essential simple closed curves in u ∪ v, but the proof does not explain why this property is preserved by an arbitrary automorphism of C†_<∞(S_g), nor how the link-containment Lemma 6.2 is used to convert the presence of such a curve into a graph-theoretic invariant. Since Proposition 6.1 is the key reduction to Booth–Minahan–Shapiro in Theorem 1.8, a complete argument is required.
minor comments (4)
  1. [Title and front matter] The title contains a typo: 'COMBINA TORICS' should be 'COMBINATORICS'; 'hoemeomorphic' appears in Section 1; and 'we will are ready' appears in Section 5.2.
  2. [§4, Lemma 4.1] The reference to 'Lemma 3.4' should be corrected to 'Proposition 3.4' or to whichever statement is actually intended.
  3. [§5, Theorem 1.7 proof] The graph notation # is defined just before Lemma 5.6, but the proof of Theorem 1.7 would benefit from a sentence explaining why any realization must be supported on 2g+b−1 pairwise disjoint subsurfaces, since that is the key counting step.
  4. [Figures] The figures are schematic and helpful, but several, especially Figures 5 and 9, are referenced without a precise explanation of how the handles or cone vertices behave under the isotopies; a sentence or two in the captions would improve readability.

Circularity Check

0 steps flagged · score 2.0 of 10

No definitional or fitted-input circularity: the principal rigidity conclusion depends on an author-coauthored prior theorem and on an unproved internal existence proposition, but these are dependencies and missing support rather than reductions of the conclusion to its own inputs.

full rationale

The paper contains no fitted parameters, no quantity that is defined in terms of the result it is used to prove, and no instance where a conclusion is presupposed by its own hypothesis. Theorem 1.1 is derived from the independent Bowden-Hensel-Webb hyperbolicity theorem plus quasi-isometries established in Propositions 2.1 and 2.2; the diameter and contractibility arguments are geometric constructions, not repackaged assumptions. Theorem 1.8, the strongest claim, reduces automorphisms of the finitary curve graph to automorphisms of the fine 1-curve graph via Proposition 6.1, Lemma 6.2, and Lemma 6.3, and then invokes Booth-Minahan-Shapiro [6] for the statement Aut(C†_1(Sg)) ≅ Homeo(Sg). That citation is a load-bearing dependency and the cited authors include the present author, but it is a dependency on a separate prior theorem about a different graph, not a circular reuse of the present paper's target result. The more serious issue is internal missing support: Lemma 4.1's proof says 'By Lemma 3.4', but no Lemma 3.4 exists in the paper, and the nearby Proposition 3.4 is asserted only as 'directly follows from the above discussion' without a proof. Since Lemma 4.1 and Corollary 4.2 are used in Theorem 1.3, Lemma 5.2, Lemma 6.2, and consequently Theorem 1.8, this is a substantial correctness gap, but it is a gap in proof support rather than a circular derivation in which the conclusion equals an input by construction. Accordingly, the circularity score is low: no definitional or fitted-input circularity is present, and the flagged items are external dependency and omitted proof rather than circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No fitted parameters or invented entities are introduced. The paper's new content is carried by topological constructions and by external theorems; the most important internal tool, Proposition 3.4 and its corollary, is only sketched, and the external hyperbolicity and automorphism results are taken on trust.

assumptions (4)
  • standard math The fine curve graph C†(S_g) is Gromov hyperbolic.
    Invoked as the base case in the proof of Theorem 1.1. The paper cites Bowden-Hensel-Webb for this fact; if that result is only proved for smooth curves, its transfer to all continuous topological curves is not justified.
  • standard math Aut(C†_1(S_g)) is isomorphic to Homeo(S_g), from Booth-Minahan-Shapiro.
    Used as the external theorem in the proof of Theorem 1.8. This is a preprint coauthored by the present author and is not independently checked in this paper.
  • ad hoc to paper Proposition 3.4: for a surface with a closed subset of a Cantor set removed, there is a curve in any isotopy class meeting a finite collection of curves and arcs finitely many times.
    Stated without proof in Section 3 as 'directly follows from the above discussion', then used to prove Lemma 4.1 and Corollary 4.2. It is a load-bearing unproved claim.
  • standard math Epstein's local tameness theorem: every point of a simple closed curve has a locally flat neighborhood.
    Invoked in the 'Note on the tameness of curves' section to justify local surgeries and banana neighborhoods. It does not make the entire curve smooth, so wild intersection patterns remain possible.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Hyperbolicity, topology, and combinatorics of fine curve graphs and variants." pith.science (2026). https://pith.science/paper/I6TVGEKS

@misc{pith2026250118705,
  author       = {Pith},
  title        = {Pith review of: Hyperbolicity, topology, and combinatorics of fine curve graphs and variants},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/I6TVGEKS}},
  note         = {Machine review of arXiv:2501.18705}
}
abstract

Given a surface, the fine $k$-curve graph of the surface is a graph whose vertices are simple closed essential curves and whose edges connect curves that intersect in at most $k$ points. We note that the fine $k$-curve graph is hyperbolic for all $k$ and, for $k\geq 2,$ show that it contains as induced subgraphs all countable graphs. We also show that the direct limit of this family of graphs, which we call the finitary curve graph, has diameter 2, has a contractible flag complex, contains every countable graph as an induced subgraph, and has as its automorphism group the homeomorphism group of the surface. Finally, we explore some finite graphs that are not induced subgraphs of fine curve graphs.

Figures

Figures reproduced from arXiv: 2501.18705 by the authors.

Figure 1
Figure 1. Left: a crossing intersection. Right: a touching intersection. We now introduce several graph notations. If {vi}I are vertices of a graph G, we denote a (possibly infinite) path in G by (. . . , vj−1, vj , vj+1, . . .). We endow all graphs with the path metric, wherein the distance between two vertices is the length of a shortest path between them. We further parameterize all edges to have unit speed and length one.… view at source ↗
Figure 2
Figure 2. Any pair of crossing curves in C † 1 (Sg) is, up to homeomorphism of Sg, equivalent to the two blue curves on the left. We may find a curve disjoint from both (such as the red curve on the right) outside the torus they fill. We therefore conclude that, for all vertices u and v, we have 1 2 d0(u, v) ≤ d1(ι(u), ι(v)) ≤ 2 d0(u, v). □ With that in mind, we will now prove the inductive step. Proposition 2.2 (Inductive Ca… view at source ↗
Figure 3
Figure 3. We have an example of a curve u that crosses the annulus bounded by green curves v and v ′ five times and forms two loops. The crossing strands are purple while the loops are burgundy. Lemma 3.1. Let ν be an embedded annulus in Sg bounded by two homotopic curves v and v ′ . Then, an embedded curve u crosses ν finitely many times. Proof. Suppose u crosses ν infinitely many times. By compactness, there must be a seque… view at source ↗
Figures from the paper (12 more)
Figure 4
Figure 4. Figure 4: Top: the horizontal lines are, top to bottom, v ′ , v′′ , and v. Pictured as well are u1 ⊂ u (red) and a banana neighborhood B of u1 that is disjoint from v∪v ′ except at the endpoints of u1. Bottom: the banana neighborhood B of u1 ⊂ u. To ensure that we have a curve t…
Figure 5
Figure 5. Figure 5: We call these annuli handles and label them Ai,j if i < j [PITH_FULL_IMAGE:figures/full_fig_p010_5.png]
Figure 6
Figure 6. Figure 6: Left: A schematic of A = I × (I/{0} ∼ {1}) with curves {wn}. Center: A schematic of A with each wj isotoped to intersect each wi with i < j in exactly two points, creating the collection {w ′ n}. Right: A perturbation of w ′ 2 in P1,2 so that it intersects w ′ 1 infini…
Figure 7
Figure 7. Figure 7: A schematic of a curve contained in the union of other curves. Lemma 5.1 (Inductive admissible subgraphs). Let G be a finite graph that is realized as an induced subgraph of C † (Sg,b). Then the following graphs are also admissible. (1) (Disjoint union) G ⊔ v, the disj…
Figure 8
Figure 8. Figure 8: A realization of a half-graph on 10 vertices in an annulus (the top and bottom edges of the rectangle are identified). A similar realization exists for arbitrarily large half-graphs. We note, however, that the construction of Bering–Gaster for graphs inadmissible in cu…
Figure 9
Figure 9. Figure 9: We conflate vi with its image under a graph embedding into C † (S1). Top left: a graph G on 6 vertices that is inadmissible as a subgraph of C † (S1). Without the central (unlabeled) vertex, this graph is inadmissible as a subgraph of C † (S0,2. Bottom left, top right,…
Figure 10
Figure 10. Figure 10: A graph on 7 vertices that is inadmissible as a subgraph of C † (S1). Without the central (unlabeled) vertex, the graph is inadmissible as a subgraph of C † (S0,2). of the remainder of the vertices will be both to the left and to the right of any preexisting curve the…
Figure 11
Figure 11. Figure 11: A 5-cycle with one additional edge as an admissible subgraph of C † (S1). v1 v2 v4 v3 v5 v1 v2 v3 v5 v4 v1 v2 v4 v3 v5 v1 v2 v3 v5 v4 [PITH_FULL_IMAGE:figures/full_fig_p020_11.png]
Figure 12
Figure 12. Figure 12: Two 5-cycles with 2 additional edge as admissible subgraphs of C † (S1). Degree 2 Now there are 2 cases: either the neighbors of γ are adjacent or they are not. If they are adjacent, then there is a triangle, a contradiction. Otherwise, the graph is admissible as in …
Figure 13
Figure 13. Figure 13: A 5-cycle with three additional edges as an admissible subgraph of C † (S1). v1 v2 v3 v4 v5 v1 v2 v3 v5 v4 [PITH_FULL_IMAGE:figures/full_fig_p021_13.png]
Figure 14
Figure 14. Figure 14: A 4-cycle with two additional edge as an admissible subgraph of C † (S1). v1 v2 v4 v3 v5 v1 v2 v3 v5 v4 [PITH_FULL_IMAGE:figures/full_fig_p021_14.png]
Figure 15
Figure 15. Figure 15: A 5-cycle as an admissible subgraph of C † (S1). [2] Edgar A. Bering IV, Gabriel Conant, and Jonah Gaster. “On the complexity of finite subgraphs of the curve graph”. In: Osaka J. Math. 55.4 (2018), pp. 795–808. issn: 0030-6126. url: https: //projecteuclid.org/euclid.…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Automorphisms of fine curve graphs of planar surfaces

    math.GT 2025-06 conditional novelty 6.0 of 10

    For a sphere with at least seven punctures, the automorphism group of the fine curve graph is naturally isomorphic to the homeomorphism group of the surface.

Reference graph

Works this paper leans on

12 extracted references · 5 canonical work pages · cited by 1 Pith paper

  1. [1]

    Automorphisms of the k-Curve Graph

    Shuchi Agrawal et al. “Automorphisms of the k-Curve Graph”. In: Michigan Mathematical Journal (2021), pp. 1–39. doi: 10.1307/mmj/20205929 . url: https://doi.org/10.1307/ mmj/20205929. REFERENCES 21 v1 v2 v3v4 v5 v1 v2 v3 v4v5 Figure 13. A 5-cycle with three additional edges as an admissible subgraph of C†(S1). v1 v2 v3 v4 v5 v1 v2 v3 v4v5 Figure 14. A 4-c...

    work page arXiv 2021

  2. [2]

    On the complexity of finite subgraphs of the curve graph

    Edgar A. Bering IV, Gabriel Conant, and Jonah Gaster. “On the complexity of finite subgraphs of the curve graph”. In: Osaka J. Math. 55.4 (2018), pp. 795–808. issn: 0030-6126. url: https: //projecteuclid.org/euclid.ojm/1539158673

    work page arXiv 2018

  3. [3]

    The random graph embeds in the curve graph of any infinite genus surface

    Edgar A. Bering IV and Jonah Gaster. “The random graph embeds in the curve graph of any infinite genus surface”. In: New York J. Math. 23 (2017), pp. 59–66. issn: 1076-9803. url: http://nyjm.albany.edu:8000/j/2017/23_59.html

    work page 2017

  4. [4]

    Automorphisms of smooth fine curve graphs

    Katherine Williams Booth. Automorphisms of smooth fine curve graphs . 2024. url: https: //arxiv.org/abs/2410.21463. 22 REFERENCES

    arXiv 2024

  5. [5]

    Homeomorphisms of surfaces that preserve continuously differen- tiable curves

    Katherine Williams Booth. Homeomorphisms of surfaces that preserve continuously differen- tiable curves . 2024. url: https://arxiv.org/abs/2410.21460

    arXiv 2024

  6. [6]

    Automorphisms of the fine 1-curve graph

    Katherine Williams Booth, Daniel Minahan, and Roberta Shapiro. Automorphisms of the fine 1-curve graph. 2023. url: https://arxiv.org/abs/2309.16041

    arXiv 2023

  7. [7]

    Quasi-morphisms on sur- face diffeomorphism groups

    Jonathan Bowden, Sebastian Wolfgang Hensel, and Richard Webb. “Quasi-morphisms on sur- face diffeomorphism groups”. In: Journal of the American Mathematical Society 35.1 (2021), pp. 211–231. doi: 10.1090/jams/981

    doi:10.1090/jams/981 2021

  8. [8]

    de la Nuez Gonz´ alez

    Valentina Disarlo, Thomas Koberda, and J. de la Nuez Gonz´ alez. The model theory of the curve graph. 2023. url: https://arxiv.org/abs/2008.10490

    arXiv 2023

Show all 12 references
  1. [9]

    Curves on 2-manifolds and isotopies

    D. B. A. Epstein. “Curves on 2-manifolds and isotopies”. In: Acta Math. 115 (1966), pp. 83–

    1966

  2. [10]

    Geometry of the complex of curves. I. Hyperbolic- ity

    Howard A. Masur and Yair N. Minsky. “Geometry of the complex of curves. I. Hyperbolic- ity”. In: Invent. Math. 138.1 (1999), pp. 103–149. issn: 0020-9910,1432-1297. doi: 10.1007/ s002220050343. url: https://doi.org/10.1007/s002220050343

    1999 doi

  3. [11]

    Fr´ ed´ eric Le Roux and Maxime Wolff.Automorphisms of some variants of fine graphs . 2022. doi: 10.48550/ARXIV.2210.05460. url: https://arxiv.org/abs/2210.05460. Email address: shaprh@umich.edu

    2022 doi arXiv

  4. [107]

    issn: 0001-5962,1871-2509. doi: 10 . 1007 / BF02392203. url: https : / / doi . org / 10 . 1007/BF02392203

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.