From Berry-Esseen to super-exponential

Abstract

For any integer m<n, where m can depend on n, we study the rate of convergence of 1mTr Um to its limiting Gaussian as n∞ for orthogonal, unitary and symplectic Haar distributed random matrices U of size n. In the unitary case, we prove that the total variation distance is less than ( n/m +2)-1 m- n/m n/m 1/4 n times a constant. This result interpolates between the super-exponential bound obtained for fixed m and the 1/n bound coming from the Berry-Esseen theorem applicable when m n by a result of Rains. We obtain analogous results for the orthogonal and symplectic groups. In these cases, our total variation upper bound takes the form (2 n/m+1)-1/2m- n/m +1( n)1/4 times a constant and the result holds provided n ≥ 2m. For m=1, we obtain complementary lower bounds and precise asymptotics for the L2-distances as n∞, which show how sharp our results are.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…