MathLabs
TheoremProved

Wigner's semicircle law

Statement

As N→∞N \to \infty, the empirical distribution of the rescaled eigenvalues of a Wigner matrix converges (in probability, in distribution) to the density ρ(x)=1π2−x2\rho(x) = \frac{1}{\pi}\sqrt{2-x^2} supported on [−2,2][-\sqrt{2}, \sqrt{2}].

Why is it true?

The trace of a high power of H sums over closed walks on the index set; because entries are independent with mean 0, only walks that traverse each edge an even number of times survive expectation, and counting the dominant surviving walks reduces to a purely combinatorial problem whose answer is the Catalan numbers — exactly the moments of the semicircle distribution.

Proof sketch

Step 1 (target). The moments of the semicircle density ρ(x)=1π2−x2\rho(x) = \frac{1}{\pi}\sqrt{2-x^2} on [−2,2][-\sqrt{2}, \sqrt{2}] are the Catalan numbers: the 2k2k-th moment equals Ck=1k+1(2kk)C_k = \frac{1}{k+1}\binom{2k}{k}, and all odd moments vanish by symmetry. So it suffices to show the moments of the rescaled empirical eigenvalue distribution converge to these same numbers.

Step 2 (expand the trace). Write Tr⁡(H2k)=∑i1,…,i2kHi1i2Hi2i3⋯Hi2ki1\operatorname{Tr}(H^{2k}) = \sum_{i_1,\dots,i_{2k}} H_{i_1 i_2} H_{i_2 i_3} \cdots H_{i_{2k} i_1}, a sum over closed walks of length 2k2k on {1,…,N}\{1,\dots,N\}. Taking expectation and using independence of entries, E[Tr⁡(H2k)]\mathbb{E}[\operatorname{Tr}(H^{2k})] splits into a sum, over ways of pairing up the 2k2k factors, of products of the second moments E[HijHkl]\mathbb{E}[H_{ij}H_{kl}] of each pair (odd-order joint moments vanish for mean-zero, and unpaired factors vanish too since E[Hij]=0\mathbb{E}[H_{ij}]=0).

Step 3 (only non-crossing pairings survive at leading order). Each pairing corresponds to a way of identifying edges of the closed walk; a pairing contributes a factor of NN to a power determined by the number of distinct vertices visited. Counting shows a pairing contributes at order Nk+1N^{k+1} only when the identified edges form a non-crossing (planar) pairing of the 2k2k endpoints; crossing pairings contribute at strictly lower order in NN and vanish after dividing by Nk+1N^{k+1} to normalize.

Step 4 (count and conclude). The number of non-crossing pairings of 2k2k points on a circle is exactly the Catalan number Ck=1k+1(2kk)C_k = \frac{1}{k+1}\binom{2k}{k}. Hence 1NE[Tr⁡((H/N)2k)]→Ck\frac{1}{N}\mathbb{E}[\operatorname{Tr}((H/\sqrt{N})^{2k})] \to C_k as N→∞N \to \infty, matching the moments of ρ(x)=1π2−x2\rho(x) = \frac{1}{\pi}\sqrt{2-x^2} term by term; since the semicircle distribution is determined by its moments, the empirical spectral distribution converges to it.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Alan Edelman, N. Raj Rao (2005). Random matrix theory
  2. Wikipedia contributors (2024). Montgomery's pair correlation conjecture
  3. Wikipedia contributors (2024). Wigner semicircle distribution