ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P(U1,…,Uk,U1∗,…,Uk∗)P(U_1,\ldots,U_k,U_1^*,\ldots,U_k^*) be a noncommutative nonzero ∗*-polynomial with complex coefficients, let λ‾≠0\underline{\lambda}\neq 0 be a signature, and let U1,…,UkU_1,\ldots,U_k be independently Haar-distributed elements of U(n)U(n). Write πλ‾\pi_{\underline{\lambda}} for the corresponding representation and let σmin⁡\sigma_{\min} denote the least singular value. Polynomial lower-bound conjecture. There is a constant c=c(P,λ‾)>0c=c(P,\underline{\lambda})>0, depending only on PP and λ‾\underline{\lambda}, such that

P[(U1,…,Uk)∈U(n)k: σmin⁡(P(πλ‾(U1),…,πλ‾(Uk)))>1nc]→n→∞1.\mathbb{P}\left[(U_1,\ldots,U_k)\in U(n)^k:\ \sigma_{\min}\left(P(\pi_{\underline{\lambda}}(U_1),\ldots,\pi_{\underline{\lambda}}(U_k))\right)>\frac{1}{n^c}\right]\xrightarrow{n\to\infty}1.

The conjecture asks for a uniform polynomial lower bound on the least singular value of a noncommutative random matrix polynomial. The surrounding discussion explains that such control is needed for estimates involving singular bundles and that even simpler random-matrix questions can be difficult; the source gives no resolution status.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.