Norm of matrix-valued polynomials in random unitaries and permutations

TL;DR

This work analyzes operator norms of non-commutative polynomials in independent random matrices (unitaries, orthogonals, or permutations) and compares them to their free-group algebra counterparts. It introduces a novel non-backtracking framework and a non-commutative Cauchy–Schwarz inequality to derive sharp upper bounds via the expected high-trace method, enabling quantitative convergence results uniform in matrix size up to $n \le \exp(N^{\alpha})$ and beyond to permutation models. A universal lower bound is established from exactness of the free-group C*-algebra, yielding a universal Alon–Boppana-type bound in the permutation case. The paper also extends these analyses to general polynomials through a linearization trick and demonstrates strong convergence results, with applications to random representations and the Hayes criterion related to the Peterson–Thom conjecture.

Abstract

We consider a non-commutative polynomial in several independent $N$-dimensional random unitary matrices, uniformly distributed over the unitary, orthogonal or symmetric groups, and assume that the coefficients are $n$-dimensional matrices. The main purpose of this paper is to study the operator norm of this random non-commutative polynomial. We compare it with its counterpart where the the random unitary matrices are replaced by the unitary generators of the free group von Neumann algebra. Our first result is that these two norms are overwhelmingly close to each other in the large $N$ limit, and this estimate is uniform over all matrix coefficients as long as $n \le\exp (N^α)$ for some explicit $α>0$. Such results had been obtained by very different techniques for various regimes, all falling in the category $n\ll N$. Our result provides a new proof of the Peterson-Thom conjecture. Our second result is a universal quantitative lower bound for the operator norm of polynomials in independent $N$-dimensional random unitary and permutation matrices with coefficients in an arbitrary $C^*$-algebra. A variant of this result for permutation matrices generalizes the Alon-Boppana lower bound in two directions. Firstly, it applies for arbitrary polynomials and not only linear polynomials, and secondly, it applies for coefficients of an arbitrary $C^*$-algebra with non-negative joint moments and not only for non-negative real numbers.

Figures (1)

• Figure 1: Tangle-free paths whose union is tangled.

Theorems & Definitions (94)

• Theorem 1.1
• Corollary 1.2
• Theorem 1.3
• Theorem 1.4
• Corollary 1.5
• Theorem 1.6
• Theorem 1.7
• Theorem 1.8
• Lemma 3.1
• proof