Plumbed 3-Manifolds and Neumann Moves

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.