mathematics

Isotropic Decompositions via Inverse Eigenvectors

arXiv:2607.26048

summary

The paper introduces a residue‑theoretic framework for inverse eigenvectors of matrices and proves an inverse analogue of the spectral theorem, yielding explicit rank‑one tensor decompositions that form isotropic probability measures and tight frames.

Abstract

We develop a residue-theoretic framework for studying inverse eigenvectors of a square matrix, defined by the nonlinear equation . Our main result is an inverse analogue of the spectral theorem: under natural transversality and properness assumptions, the identity operator admits an explicit decomposition into rank-one tensors associated with the inverse eigenvectors. The proof is based on residues of rational differential forms in several complex variables. For real correlation matrices whose off-diagonal entries have modulus strictly less than one, we remove the properness assumption and show that the coefficients in the decomposition are positive and sum to~. Consequently, the inverse eigenvectors support an explicit centered discrete isotropic probability measure and form a weighted tight frame. We extend the construction to arbitrary real Gram matrices, diagonal inverse eigenvectors, and weighted inverse-eigenvector equations. Simple trace and arithmetic--geometric mean arguments yield inverse eigenvectors with controlled Euclidean norm and coordinate product. These estimates lead to short proofs of the strong real polarization inequality and the th real linear polarization inequality, together with weighted and matrix-valued generalizations and further geometric and analytic applications.

24 pages. First, preliminary version

Topics & keywords

#inverse eigenvectors#residue theory#tensor decomposition#tight frames#polarization inequality#gram matricesinverse eigenvectorsresidue of rational differential formsrank-one tensor decompositionisotropic probability measuretight framepolarization inequality
Isotropic Decompositions via Inverse Eigenvectors · wovepaper