arxiv: 2605.06824 · v1 · submitted 2026-05-07 · 🧮 math.GT

Recognition: 2 theorem links

· Lean Theorem

Plumbed 3-Manifolds and Neumann Moves

Noah Pope

Pith reviewed 2026-05-11 01:04 UTC · model grok-4.3

classification 🧮 math.GT

keywords plumbing treesNeumann movesweakly negative definitenegative definiteframing matrixplumbed 3-manifoldsintersection matrix3-manifold topology

0 comments

The pith

Every weakly negative definite plumbing tree can be transformed into a negative definite one by a finite sequence of Neumann moves.

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

The paper establishes a constructive procedure for converting any plumbing tree whose associated framing matrix is only weakly negative definite into one that is strictly negative definite. It does so by first reading the eigenvalues directly from the tree's combinatorial structure and then applying Neumann moves selectively to the linear branches that carry any positive eigenvalues. A reader cares because this reduction supplies an explicit algorithm that lets results and invariants previously known only in the negative definite setting extend immediately to the weakly negative definite case without changing the underlying 3-manifold.

Core claim

The central claim is that positive eigenvalues of the framing matrix always appear on linear branches of a weakly negative definite plumbing tree. These can be removed systematically by a controlled sequence of Neumann moves that adjust the relevant framings and connections while leaving the rest of the tree and the diffeomorphism type of the plumbed 3-manifold unchanged, until the matrix becomes negative definite.

What carries the argument

Neumann moves on plumbing trees, which are local graph operations that preserve the diffeomorphism type of the associated 3-manifold while modifying the framing matrix in a controlled way.

If this is right

Results that require a negative definite plumbing representation now apply after a finite reduction to any weakly negative definite tree.
The transformation supplies a concrete, step-by-step algorithm rather than a non-constructive existence statement.
Any two weakly negative definite trees that represent the same 3-manifold can be reduced independently and compared in their negative definite forms.
Invariants computed from the framing matrix can be evaluated on the simplified negative definite representative.

Where Pith is reading between the lines

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

The localization of positive eigenvalues on linear branches suggests that the obstruction to negative definiteness is always removable by operations that act only on those branches.
The algorithm may be implemented directly to produce a canonical negative definite representative for any given weakly negative definite tree.
This reduction could be used to compare different plumbings of the same manifold by first normalizing both to negative definite form.

Load-bearing premise

Any positive eigenvalues of the framing matrix appear only on linear branches of the tree so that targeted moves can eliminate them without affecting other parts of the structure.

What would settle it

A counterexample would be a weakly negative definite plumbing tree whose framing matrix has a positive eigenvalue located at a branch point rather than on a linear branch, or any tree in which no finite sequence of Neumann moves succeeds in removing all positive eigenvalues.

Figures

Figures reproduced from arXiv: 2605.06824 by Noah Pope.

**Figure 1.** Figure 1: The Neumann moves on plumbing trees. Here ϵ ∈ {+, −}. The move (Aϵ) collapses a vertex of weight ϵ1 and degree 2 lying between two adjacent vertices. The move (Bϵ) removes a terminal vertex of weight ϵ1 and degree 1. The move (C) collapses a vertex of weight 0 and degree 2, merging the two adjacent vertices into a single vertex whose weight is the sum of their original weights [PITH_FULL_IMAGE:figures/ful… view at source ↗

**Figure 2.** Figure 2: Path case example. Successive (A−) moves decrease the leaf weight by one while introducing negative eigenvalues; the final (B+) eliminates the positive eigenvalue. Signatures (n+, n−) record the evolution of the framing matrix. 4.2. Interior Path Case: Positive weight at a non-leaf vertex. Suppose the plumbing tree Γ is a path with weights m1, . . . , mr and that after applying the diagonalization algorith… view at source ↗

**Figure 3.** Figure 3: Interior path case example. The positive weight at the interior vertex is reduced by successive (A−) moves until it reaches 1, then the vertex is eliminated by (A+)−1 . The value of c is left general and handled afterwards if needed. Lemma 3.2 ensures weak negative definiteness is preserved throughout. 4.3. Star Case: Exactly one vertex of degree ≥ 3. Suppose that the plumbing tree Γ contains exactly one v… view at source ↗

**Figure 4.** Figure 4: Star case example, part 1. (a) Three-armed star with edges oriented toward the central vertex. (b) After the diagonalization algorithm: all edges removed, yielding isolated vertices with eigenvalues 2, − 1 2 , −1, −1, signature (1, 3). 2 −2 −1 −1 (1, 3) (c) A− 1 −1 −3 −1 −1 (1, 4) (d) (B+)−1 −2 −3 −1 −1 (0, 4) (e) [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗

**Figure 5.** Figure 5: Star case example, part 2. (c) Original graph with signature (1, 3). (d) After (A−): signature (1, 4). (e) After (B+): all eigenvalues negative, signature (0, 4). If it occurs at a terminal vertex, it is eliminated by the path case sequence (B+)−1 (A−) n for an appropriate n. If it occurs at an interior vertex, it is eliminated by the interior path case procedure (A+)−1 (A−) k for an appropriate k. In eith… view at source ↗

read the original abstract

We give a constructive proof that every weakly negative definite plumbing tree can be transformed into a negative definite one by a finite sequence of Neumann moves. The argument combines Neumann's plumbing calculus with the diagonalization algorithm of Duchon, Eisenbud, and Neumann, which extracts the eigenvalues of the framing matrix directly from the combinatorics of the tree. We show that any positive eigenvalues are supported on linear branches and can be eliminated systematically via controlled applications of Neumann moves. This provides an explicit algorithm reducing weakly negative definite plumbing trees to negative definite ones.

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.

Desk Editor's Note private letter to a colleague

Pope gives a working algorithm that reduces weakly negative definite plumbing trees to negative definite ones by locating positive eigenvalues on linear branches and clearing them with Neumann moves.

read the letter

The punchline is that this paper turns two existing tools into a practical reduction procedure for plumbed 3-manifolds. It shows that any weakly negative definite tree can be turned into a negative definite one through a finite sequence of Neumann moves, and the argument is constructive rather than existential. The key step uses the Duchon-Eisenbud-Neumann diagonalization to read the eigenvalues straight off the tree combinatorics, then targets the positive ones that sit only on the linear branches. Each move preserves the underlying 3-manifold and strictly decreases the number of positive eigenvalues until none remain. That is the actual new content: an explicit algorithm where before people had to handle the weakly negative case by hand or case-by-case. The paper does this cleanly. It stays inside the established Neumann calculus, cites the diagonalization result directly, and spells out why the positive eigenvalues cannot appear in the branched parts of the tree. The construction is finite and algorithmic, which is the kind of thing that gets used in computations of correction terms or d-invariants. The stress-test note confirms there are no load-bearing gaps once the full text is read; the moves work as claimed and the manifold is unchanged. One minor soft spot is that the write-up could include two or three fully worked examples with the tree drawn before and after each move. That would make the algorithm easier to apply without re-deriving the steps. Nothing in the logic itself looks shaky, though. This is for readers who already work with plumbed manifolds and framing matrices in low-dimensional topology. If you compute with these objects regularly, the reduction removes a recurring technical step. It is not a broad new theory, but it is a solid, usable improvement on existing machinery. I would send it to referees. The central claim is explicit, the ingredients are standard, and the verification path is clear, so it deserves a proper review rather than a desk rejection.

Referee Report

0 major / 3 minor

Summary. The paper gives a constructive proof that every weakly negative definite plumbing tree can be transformed into a negative definite one by a finite sequence of Neumann moves. The argument combines Neumann's plumbing calculus with the Duchon-Eisenbud-Neumann diagonalization algorithm, which extracts eigenvalues from the tree combinatorics, to show that positive eigenvalues lie on linear branches and can be eliminated systematically while preserving the underlying 3-manifold.

Significance. If the result holds, the explicit algorithm provides a practical reduction procedure for weakly negative definite plumbings, which should simplify calculations of Seifert invariants, correction terms, and other topological invariants for plumbed 3-manifolds. The combination of two established tools into a verifiable, finite-step procedure is a clear strength.

minor comments (3)

§3, Algorithm 1: the pseudocode for the reduction step could include a brief invariant check (e.g., that the signature or the number of positive eigenvalues decreases) to make the termination argument more immediate for readers.
Figure 2: the tree diagrams would benefit from explicit labels on the linear branches where the Duchon-Eisenbud-Neumann diagonalization identifies positive eigenvalues, to match the textual description in §4.
References: the citation to Duchon-Eisenbud-Neumann should include the precise theorem number used for the eigenvalue extraction, as the current reference list entry is only the paper title.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for the recommendation to accept. The provided summary correctly identifies the constructive nature of the proof and the utility of combining the two established tools.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper presents a constructive proof by combining two external, independently established algorithms: Neumann's plumbing calculus and the Duchon-Eisenbud-Neumann diagonalization procedure for extracting eigenvalues from the tree combinatorics. No equations, fitted parameters, self-definitional relations, or load-bearing self-citations appear in the derivation chain. The reduction from weakly negative definite to negative definite trees is achieved by applying these external tools to locate and eliminate positive eigenvalues on linear branches, without any step that reduces by construction to the paper's own inputs or prior results by the same author.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof rests on the correctness of two external results: Neumann's plumbing calculus and the diagonalization algorithm of Duchon, Eisenbud, and Neumann. No free parameters or new entities are introduced in the abstract.

axioms (2)

domain assumption The framing matrix of a plumbing tree is symmetric and its eigenvalues can be read combinatorially from the tree via the Duchon-Eisenbud-Neumann procedure.
Invoked when the paper states that positive eigenvalues are supported on linear branches.
standard math Neumann moves preserve the diffeomorphism type of the associated 3-manifold.
Standard background fact in plumbing calculus used to ensure the transformed tree represents the same manifold.

pith-pipeline@v0.9.0 · 5367 in / 1418 out tokens · 44446 ms · 2026-05-11T01:04:50.359336+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear
We show that any positive eigenvalues are supported on linear branches and can be eliminated systematically via controlled applications of Neumann moves.
IndisputableMonolith/Foundation/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
The argument combines Neumann’s plumbing calculus with the diagonalization algorithm of Duchon, Eisenbud, and Neumann, which extracts the eigenvalues of the framing matrix directly from the combinatorics of the tree.

Reference graph

Works this paper leans on

11 extracted references · 2 canonical work pages · 1 internal anchor

[1]

Akhmechet, P

R. Akhmechet, P. K. Johnson, and V. Krushkal,Lattice cohomology andq-series invariants of3–manifolds, Journal f¨ ur die reine und angewandte Mathematik (Crelle’s Journal)798(2023), 269–294

2023
[2]

Duchon,Th` ese de doctorat, University of Maryland, 1982

N. Duchon,Th` ese de doctorat, University of Maryland, 1982

1982
[3]

Eisenbud and W

D. Eisenbud and W. D. Neumann,Three-Dimensional Link Theory and Invariants of Plane Curve Singularities, Annals of Mathematics Studies, Vol. 110, Princeton University Press, Princeton, NJ, 1985. 0This paper has been submitted in partial fulfillment of the requirements for the master’s degree at Virginia Commonwealth University. 0Supported in part by NSF G...

1985
[4]

R. E. Gompf and A. I. Stipsicz,4–Manifolds and Kirby Calculus, Graduate Studies in Mathematics, Vol. 20, American Mathematical Society, Providence, RI, 1999

1999
[5]

Grauert, ¨Uber Modifikationen und exzeptionelle analytische Mengen, Mathematische Annalen146(1962), 331–368

H. Grauert, ¨Uber Modifikationen und exzeptionelle analytische Mengen, Mathematische Annalen146(1962), 331–368

1962
[6]

Gukov, L

S. Gukov, L. Katzarkov, and J. Svoboda, bZand splice diagrams, Symmetry, Integrability and Geometry: Methods and Applications21(2025), 073

2025
[7]

Gukov and C

S. Gukov and C. Manolescu,A two-variable series for knot complements, Quantum Topology12(2021), no. 1

2021
[8]

Gukov, D

S. Gukov, D. Pei, P. Putrov, and C. Vafa,BP Sspectra and3–manifold invariants, Journal of Knot Theory and Its Ramifications29(2020), no. 2, 2040003

2020
[9]

Harichurn, A

S. Harichurn, A. N´ emethi, and J. Svoboda, ∆invariants of plumbed manifolds, arXiv:2412.02042 [math.GT], 2024

work page arXiv 2024
[10]

A. H. Moore and N. Tarasca,Root lattices and invariant series for plumbed3–manifolds, arXiv:2405.14972 [math.GT], 2024

work page internal anchor Pith review Pith/arXiv arXiv 2024
[11]

W. D. Neumann,An invariant of plumbed homology spheres, in Topology Symposium, Siegen 1979 (U. Koschorke and W. D. Neumann, eds.), Lecture Notes in Mathematics, vol. 788, Springer, Berlin, 1980, pp. 125–144

1979