Papers
Topics
Authors
Recent
Search
2000 character limit reached

The separation modulus of unitarily invariant matrix norms

Published 5 Aug 2025 in math.MG, math.FA, math.PR, and math.SP | (2508.03853v1)

Abstract: If $X=(M_n(\mathbb{R}),|\cdot|)$ is a unitarily invariant normed space on , then we prove (via exact computations for a Jacobi orthogonal random matrix ensemble) that the spectral gap of the Laplacian with Dirichlet boundary conditions on the unit ball $B_X$ of $X$ satisfies $\lambda(X)\asymp n3 |I|2$. This leads to a confirmation of the weak isomorphic reverse isoperimetry conjecture for $X$, namely, we demonstrate that there exists a convex body $L=L_X\subset B_X$ such that $\mathrm{vol}{n2}(L){1/n2}\asymp \mathrm{vol}{n2}(B_{X}){1/n2}$, yet its isoperimetric quotient is at most a universal constant multiple of $n$. As a corollary (and motivation) of these results, we deduce that the separation modulus of $X$ satisfies $\mathsf{SEP}(X)\asymp \sqrt{n}|I_n|X\mathrm{diam}(B_X)$, where $\mathrm{diam}(B_X)$ is the diameter of $B_X$ with respect to the standard Euclidean metric on $M_n(\mathbb{R})$. Assuming oracle access to norm evaluations in $X$, by combining this with a new deterministic algorithm for efficiently computing a $O(1)$-approximation of the diameter of convex bodies in $\mathbb{R}n$ that are given by a weak membership oracle and are symmetric with respect to coordinate permutations and reflections about the axes, we obtain an oracle polynomial time algorithm whose output is guaranteed to be the separation modulus of $X$ up to positive universal constant factors. We also deduce an upper bound on the Lipschitz extension modulus of $X$ that improves over the previously best-known bound even in the special case when $X$ is $M_n(\mathbb{R})$ equipped with the $\ell{2}n\to \ell_{2}n$ operator norm.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.