Optimal Lower Bound on Eigenvector Overlaps for non-Hermitian Random Matrices
Giorgio Cipolloni, László Erdős, Joscha Henheik, Dominik Schröder
TL;DR
The paper addresses eigenvector stability and singular-vector thermalisation for large non-Hermitian random matrices with additive i.i.d. noise. It develops a novel observables decomposition into regular and singular parts and establishes two-resolvent local laws for regular observables, enabling a rigorous ETH-like statement for the Hermitised matrix and an optimal lower bound on diagonal eigenvector overlaps. The key technical advance is the structured regularisation anchored by two critical directions, plus a comprehensive hierarchy of master and reduction inequalities that control long resolvent chains. Collectively, these results extend QUE from Hermitian Wigner ensembles to general non-Hermitian models with i.i.d. perturbations, with implications for eigenvalue sensitivity and Dyson-type dynamics in the non-Hermitian setting, and provide sharp quantitative control over eigenvector overlaps beyond the Ginibre case.
Abstract
We consider large non-Hermitian $N\times N$ matrices with an additive independent, identically distributed (i.i.d.) noise for each matrix elements. We show that already a small noise of variance $1/N$ completely thermalises the bulk singular vectors, in particular they satisfy the strong form of Quantum Unique Ergodicity (QUE) with an optimal speed of convergence. In physics terms, we thus extend the Eigenstate Thermalisation Hypothesis, formulated originally by [Deutsch 1991] and proven for Wigner matrices in [Cipolloni, Erdős, Schröder 2020], to arbitrary non-Hermitian matrices with an i.i.d. noise. As a consequence we obtain an optimal lower bound on the diagonal overlaps of the corresponding non-Hermitian eigenvectors. This quantity, also known as the (square of the) eigenvalue condition number measuring the sensitivity of the eigenvalue to small perturbations, has notoriously escaped rigorous treatment beyond the explicitly computable Ginibre ensemble apart from the very recent upper bounds given in [arXiv:2005.08930] and [arXiv:2005.08908]. As a key tool, we develop a new systematic decomposition of general observables in random matrix theory that governs the size of products of resolvents with deterministic matrices in between.
