An Algorithm for Diagonalizing Matrices of Formal Power Series

This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the associated spectral projections have entries in the ring. Building on this characterization, we develop an algorithm for deciding the unitary diagonalizability of matrices over regular local rings of algebraic varieties. A central ingredient of the algorithm is a decision procedure for determining whether a polynomial splits over a formal power series ring; we establish this using techniques from prime decomposition and the relative smoothness of integral closures in ramification theory.

💡 Research Summary

The paper investigates the problem of unitary diagonalization for matrices whose entries lie in a ring of formal power series in several variables. After fixing the standard involution on the complex power‑series ring (C=\mathbb C