The least singular value of polynomials in Ginibre matrices at the constant term

Let P be a nonconstant polynomial in k noncommuting variables and let $X_1,\dots,X_k$ be independent N × N complex Ginibre matrices. We prove that the least singular value of P(X)-P(0)I_N satisfies $\mathbb P\{s_{\min}\le t\}\le C(N^{\kappa}t^b+e^{-cN})$ for all t>0 and all large N, with constants depending only on P. Han proved this bound at every $z\ne P(0)$ and asked whether it holds at z = P(0); Collins, Kitagawa, Miyagawa, Yuan and Zhong answered this when P is not constant on ℂ^k. The polynomials left open are those that are constant on ℂ^k; in degree two they are covered by a theorem of Cook, Guionnet and Husson, and an example of degree three is x_1²x_2-x_2 x_1². For these polynomials we use a tuple of d × d matrices, $d=\deg P$, at which P-P(0) is invertible. Sizes N = M+s with $d\mid M$ and d ≤ s ≤ 2d-1 are treated by bounding the determinant of a Schur complement of bounded size with the Carbery–Wright inequality.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24358817
Primary Topic
Random Matrices and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The least singular value of polynomials in Ginibre matrices at the constant term

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Random Matrices and Applications
preprint

The least singular value of polynomials in Ginibre matrices at the constant term

Yitzchak Shmalo
preprint en

Abstract

Let P be a nonconstant polynomial in k noncommuting variables and let $X_1,\dots,X_k$ be independent N × N complex Ginibre matrices. We prove that the least singular value of P(X)-P(0)I_N satisfies $\mathbb P\{s_{\min}\le t\}\le C(N^{\kappa}t^b+e^{-cN})$ for all t>0 and all large N, with constants depending only on P. Han proved this bound at every $z\ne P(0)$ and asked whether it holds at z = P(0); Collins, Kitagawa, Miyagawa, Yuan and Zhong answered this when P is not constant on ℂ^k. The polynomials left open are those that are constant on ℂ^k; in degree two they are covered by a theorem of Cook, Guionnet and Husson, and an example of degree three is x_1²x_2-x_2 x_1². For these polynomials we use a tuple of d × d matrices, $d=\deg P$, at which P-P(0) is invertible. Sizes N = M+s with $d\mid M$ and d ≤ s ≤ 2d-1 are treated by bounding the determinant of a Schur complement of bounded size with the Carbery–Wright inequality.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Random Matrices and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon