The spectral gap theorem of Caputo, Liggett, and Richthammer states that on any connected graph equipped with edge weights, the 2nd eigenvalue of the interchange process equals the 2nd eigenvalue of the random walk process. In this work we characterize the 2nd eigenspace of the interchange process. We prove that this eigenspace is uniquely determined by the 2nd eigenvectors of the random walk process on every connected weighted graph except the $4$-cycle with uniform edge weights. The key to our proof is an induction scheme on the number of vertices, and involves the octopus (in)equality, representation theoretic computations, and graph Laplacian computations.