37.08.03 · probability / 08-random-matrices

Gaussian Ensembles GOE/GUE/GSE and the Joint Eigenvalue Density

shipped3 tiersLean: none

Anchor (Master): Anderson-Guionnet-Zeitouni, An Introduction to Random Matrices (Cambridge, 2010) §2.5-2.6; Mehta, Random Matrices (Elsevier, 3rd ed., 2004) Ch. 3, 5-7; Forrester, Log-Gases and Random Matrices (Princeton, 2010); Dyson, J. Math. Phys. 3 (1962); Deift, Orthogonal Polynomials and Random Matrices (AMS, 1999)

Intuition Beginner

Imagine scattering beads at random along a wire. If they were truly independent, two beads could land on top of each other or huddle into a tight clump; gaps and clusters would appear all over. The eigenvalues of a random matrix behave very differently. They act like beads that quietly push each other apart, the way like-charged particles on a wire repel: you almost never find two of them right next to each other, and the whole arrangement looks suspiciously even. This built-in spacing is the single most striking feature of random-matrix spectra, and it is the reason these models capture the energy levels of complicated physical systems so well.

The Gaussian ensembles are the cleanest matrices where this happens. You fill a square grid with independent bell-curve random numbers and make it symmetric (or its complex cousin). Because the recipe does not prefer any direction in space, it is built with a perfect symmetry, and that symmetry is exactly what forces the eigenvalues to repel. There turn out to be three flavours of this construction, labelled by a number called beta that takes the values one, two, and four, measuring how strongly the eigenvalues push apart.

The payoff is a single tidy formula for how likely any particular arrangement of eigenvalues is. It multiplies together two competing effects: a repulsion term that grows when eigenvalues spread apart, and a confining term that grows when they wander too far from the center. The balance between pushing apart and being reeled back in is what fixes the shape of the spectrum.

Visual Beginner

Picture two rows of dots above a number line. The top row is a batch of genuinely independent random points: they bunch up in places and leave ragged gaps elsewhere, and sometimes two land almost on top of each other. The bottom row is the eigenvalues of a Gaussian random matrix of the same size: the dots are spread out smoothly, kept apart by an invisible spring between every pair, with hardly any near-collisions.

The springs between neighbours are the repulsion; the bell-shaped envelope drawn over both rows is the confinement. The lower row is what the tidy formula describes: an arrangement is likely when the dots are both well spread (springs relaxed) and not too far out (inside the envelope). The number beta sets how stiff the springs are.

Worked example Beginner

We compute the repulsion term for the smallest interesting case — two eigenvalues — and see how it forbids collisions.

Step 1. With two eigenvalues sitting at positions and , the repulsion term is the distance between them raised to the power beta. For the first flavour, beta is one, so the repulsion term is just the gap, the size of .

Step 2. Suppose the two eigenvalues are far apart, say at and . The gap is , so the repulsion term is . Now suppose they are close, at and . The gap is , so the repulsion term is only . A configuration whose repulsion term is ten times smaller is correspondingly ten times less likely, all else being equal.

Step 3. Push them to the same point, . The gap is , so the repulsion term is . A configuration with repulsion term zero has probability zero: two eigenvalues exactly coinciding simply does not happen. This is the precise sense in which the eigenvalues refuse to collide.

Step 4. Compare the three flavours at the close pair and , gap . For beta one the term is ; for beta two it is ; for beta four it is multiplied by itself four times, about . The bigger beta is, the harder a small gap is punished, so the stronger the repulsion.

Step 5. What this tells us: the repulsion term is a product of the gaps between eigenvalues, and raising each gap to the power beta is what turns "they tend not to be close" into a precise, tunable rule. Setting beta to one, two, or four gives the three Gaussian ensembles, with stiffer springs as beta grows.

Check your understanding Beginner

Formal definition Intermediate+

Let index the three division algebras . The Gaussian ensemble of parameter is a probability measure on the real vector space of self-adjoint matrices over the corresponding algebra: real symmetric matrices for (the Gaussian Orthogonal Ensemble, GOE), complex Hermitian for (the Gaussian Unitary Ensemble, GUE), and quaternionic self-dual for (the Gaussian Symplectic Ensemble, GSE). The measure has density proportional to $$ P(M), dM ;\propto; \exp!\Big(-\tfrac{\beta n}{4},\operatorname{tr} M^2\Big), dM , $$ where is Lebesgue measure on the independent real coordinates of . Equivalently the entries are independent centred Gaussians: the diagonal entries are real with one variance, and each independent off-diagonal entry has real and imaginary (and quaternionic) parts that are i.i.d. Gaussian, the variances chosen so that the density takes the displayed trace form. (Many references drop the factor and rescale afterward; here we keep the normalisation of 37.08.01 so the spectrum fills .)

The defining structural feature is invariance: for any in the orthogonal group (), unitary group (), or symplectic group (), the map preserves both and Lebesgue measure , hence preserves . The Gaussian ensembles are the only ensembles that are simultaneously invariant under the relevant group and have independent entries; this rigidity is the algebraic root of everything below.

By the spectral theorem every factors as with real and in the relevant group; the eigenvalues are well defined and, generically, distinct. The joint eigenvalue density is the pushforward of under . Writing the Vandermonde determinant $$ \Delta(\lambda) = \prod_{1 \le i < j \le n} (\lambda_j - \lambda_i) = \det\big(\lambda_i^{,j-1}\big){i,j=1}^n , $$ the joint density on the ordered or unordered eigenvalues (up to the normalising constant $Z{n,\beta}$) is $$ p_{n,\beta}(\lambda_1, \dots, \lambda_n) = \frac{1}{Z_{n,\beta}}, |\Delta(\lambda)|^{\beta}, \exp!\Big(-\tfrac{\beta n}{4}\sum_{i=1}^n \lambda_i^2\Big). $$ The exponent is the confinement inherited from ; the factor is the eigenvalue repulsion, produced entirely by the change of variables and absent from the matrix density. The exponent on the Vandermonde is the same labelling the symmetry class, the central coincidence the next section explains.

Counterexamples to common slips Intermediate+

  • The repulsion is not put in by hand. The factor does not appear in ; it is the Jacobian of the spectral factorisation . Forgetting it and writing the eigenvalue density as a plain product of Gaussians gives the wrong law with no level repulsion.
  • The diagonal and off-diagonal variances differ. For GUE the off-diagonal complex entry has variance split between its real and imaginary parts; the diagonal real entry has a different variance. The single requirement is that the assembled density equals ; demanding all entries have one common variance is wrong for structure.
  • is not a free continuous parameter for matrix ensembles. Only arise from genuine matrix models over , by Dyson's classification. General exists as a log-gas (and as the tridiagonal Dumitriu-Edelman models) but is not a -invariant matrix ensemble for other values.
  • Invariance alone does not give independent entries. The general invariant ensemble has density for a potential ; only the quadratic makes the entries independent. The Gaussian case is the unique intersection of "invariant" and "independent entries".

Key theorem with proof Intermediate+

Theorem (Weyl integration / joint eigenvalue density). For the pushforward of the Gaussian ensemble density under has density $$ p_{n,\beta}(\lambda) = \frac{1}{Z_{n,\beta}},\prod_{i<j}|\lambda_i - \lambda_j|^{\beta},\exp!\Big(-\tfrac{\beta n}{4}\sum_i \lambda_i^2\Big), $$ and more generally, for any invariant density , the eigenvalue density is .

Proof. Use the coordinate change , where ranges over diagonal matrices and ranges over the relevant compact group modulo the stabiliser of (the torus of diagonal group elements, since these commute with a generic diagonal ). The map is a diffeomorphism off the measure-zero set of matrices with repeated eigenvalues. The potential depends only on the eigenvalues, , so the entire content is the Jacobian of the factorisation, and one must show factors as .

Compute the Jacobian at a fixed diagonal with distinct entries by examining how moves under infinitesimal variations of . Write with a skew-self-adjoint generator (anti-symmetric for , anti-Hermitian for , etc.); to first order $$ dM = U\big(d\Lambda + [,X, \Lambda,]\big)U^{*} , \qquad [X,\Lambda]{ij} = X{ij}(\lambda_j - \lambda_i). $$ The diagonal part of is (the commutator has zero diagonal), contributing the flat measure . The off-diagonal part is for each unordered pair . Each such pair contributes real degrees of freedom — one for (a single real ), two for (complex ), four for (quaternionic ) — and on each of those real components the differential is multiplied by the scalar . Since conjugation by the orthogonal/unitary is an isometry of the coordinate space, it contributes only a factor independent of .

Collecting the Jacobian determinant: each ordered pair contributes once per real degree of freedom, i.e. per unordered pair, so $$ J(\Lambda, U) = c(U)\prod_{i<j}|\lambda_i - \lambda_j|^{\beta} = c(U),|\Delta(\lambda)|^{\beta}. $$ Integrating over the group (a finite Haar volume) absorbs into the normalising constant . Substituting for the Gaussian case (after restoring the in the trace) yields the stated density.

Bridge. This Jacobian computation builds toward the orthogonal-polynomial solution of the Gaussian ensembles and appears again in the Coulomb-gas variational problem below, where the same becomes a logarithmic energy. The foundational reason the symmetry-class index and the Vandermonde exponent are the same number is that each off-diagonal matrix entry carries exactly real components over the algebra , and each component is scaled by the eigenvalue gap in the spectral coordinate change — so the count of real off-diagonal directions per pair is literally the power on the gap. This is exactly the content of Dyson's threefold way: the three division algebras give the three values of , and there are no others. The repulsion factor generalises the simple observation that a symmetric matrix near a degeneracy must spend "area" of order (gap) in each transverse direction to separate its eigenvalues, which is dual to the level-crossing avoidance of von Neumann and Wigner. Putting these together, the bridge is that the entire spectral statistics of an invariant ensemble is set by one Jacobian, and the central insight is that level repulsion is not a dynamical effect but a measure-theoretic one, baked into the geometry of the map .

Exercises Intermediate+

Advanced results Master

The normalising constant is a Selberg-type integral, evaluated in closed form. For the Gaussian weight, $$ Z_{n,\beta} = \int_{\mathbb{R}^n} |\Delta(\lambda)|^{\beta},\exp!\Big(-\tfrac{\beta}{4}\sum_i \lambda_i^2\Big), d^n\lambda = (2\pi)^{n/2},\beta^{-n/2 - \beta n(n-1)/4},\prod_{j=1}^n \frac{\Gamma!\big(1 + \tfrac{\beta}{2}j\big)}{\Gamma!\big(1 + \tfrac{\beta}{2}\big)} , $$ the Mehta integral, a confluent limit of Selberg's integral. Its finiteness for every is why the joint density extends to a general- log-gas even though only come from matrices, and the Dumitriu-Edelman tridiagonal models realise every as the spectrum of an explicit sparse random matrix.

For the ensemble is exactly solvable by orthogonal polynomials. Writing and orthogonalising the monomials against the Gaussian weight produces the Hermite polynomials ; the squared Vandermonde times the weight becomes with the Christoffel-Darboux kernel built from the Hermite functions . The -point correlation functions are then determinants : the GUE is a determinantal point process. The one-point function has the semicircle 37.08.01 as its large- envelope, recovering the global law from the exact finite- object.

The local limits follow from the asymptotics of . In the bulk, rescaling near a point by the mean spacing sends to the sine kernel , universal across the interior. At the edge near , rescaling by sends to the Airy kernel , whose largest-eigenvalue gap probability is the Tracy-Widom distribution with the Hastings-McLeod solution of Painlevé II. For the correlation functions are Pfaffians rather than determinants, with matrix-valued kernels; the structural picture is identical with quaternion determinants replacing ordinary ones.

The log-gas / Coulomb-gas picture gives the global density by a variational principle. The energy , written for the empirical measure and rescaled, becomes the functional . Minimising over probability measures (a problem in potential theory) yields the equilibrium measure, which for the quadratic confinement is exactly the semicircle : the saddle-point of the partition function is the semicircle, independently of , while controls only the fluctuations about it. This is the large-deviation reading: , and the rate functional's minimiser is the macroscopic spectrum.

Synthesis. The foundational reason the same number governs the symmetry class, the Vandermonde exponent, and the Coulomb-gas temperature is that each off-diagonal matrix entry carries real components over , and the spectral change of variables scales each component by the eigenvalue gap — so the count of transverse directions, the power on , and the inverse temperature are one integer seen three ways, and this is exactly Dyson's threefold way. Putting these together, the joint density is to the matrix ensemble what the Gibbs measure of a log-gas is to a confined Coulomb system: the Weyl Jacobian, the orthogonal-polynomial determinant, and the potential-theoretic equilibrium measure are three computations of one object, dual to one another, with the semicircle 37.08.01 appearing as the one-point envelope of the determinantal kernel and simultaneously as the equilibrium measure of the variational problem. The central insight is that level repulsion is geometric, not dynamical, generalising the avoided level crossings of finite quantum systems to the bulk and edge universality classes; the sine and Airy kernels are the local fingerprints of surviving the scaling limit, dual to the way the global semicircle survives the moment count. The bridge to the frontier is that bulk sine-kernel and edge Tracy-Widom statistics, proved for the Gaussian ensembles by orthogonal polynomials here, extend by the universality program to all Wigner matrices, so the exactly solvable Gaussian case is the template the local-law program promotes to a theorem.

Full proof set Master

The Weyl Jacobian computation giving and the log-gas reformulation are proved in full above. The remaining Master claims are recorded here.

Proposition (Vandermonde as the spectral Jacobian factor, explicit). For an Hermitian matrix the Jacobian of $M = U\Lambda U^{}\prod_{i<j}|\lambda_i - \lambda_j|^2U$.*

Proof. In the tangent space at , the symmetric (Hermitian) perturbations split as with anti-Hermitian. The diagonal directions are the real numbers . For each pair the off-diagonal Hermitian entry is complex, two real components, and equals with ranging over . The linear map from to has real Jacobian determinant (multiplication by a complex scalar scales area by ). Taking the product over all pairs gives ; the change from -coordinates to -coordinates on the unitary group contributes only the -dependent Haar factor, which integrates to a constant.

Proposition (Mehta normalising integral, ).

Proof. Expand and replace the monomials by the monic Hermite polynomials orthogonal with respect to (the same determinant, since the polynomials are monic of the right degrees and row operations preserve ). Thus . By the Andréief / Heine identity, . With and the cross-integrals are diagonal by orthogonality, equal to the squared norms . Hence the integral is after accounting for ordering, which simplifies to on collecting the normalisation.

Proposition (GUE correlations are determinantal). The -point correlation function of the GUE is with and the -normalised Hermite functions.

Proof. The joint density is after absorbing the weight into the Hermite functions . Expanding the product of determinants and using orthonormality , the reproducing property and hold. The general theorem on -projection kernels (Dyson-Mehta) then gives the -point correlations by integrating out variables: each integration reduces the determinant rank by one via the reproducing property, leaving .

Proposition (equilibrium measure is the semicircle). The minimiser of over probability measures on is the semicircle .

Proof. The Euler-Lagrange (variational) condition for a minimiser with the unit-mass constraint is that there exists a constant with for and off the support. Differentiating in on the support gives , a singular integral equation whose solution supported on a symmetric interval is found by the resolvent ansatz: the Stieltjes transform must satisfy and have square-root behaviour at the endpoints. Solving the resulting algebraic equation with gives — the semicircle transform of 37.08.01 — fixing and, by Stieltjes inversion, . Convexity of (the logarithmic energy is strictly convex on signed measures of zero mass) makes the critical point the unique global minimiser.

Connections Master

The Wigner semicircle law and the moment method 37.08.01 is the global limit this unit refines. There the semicircle is obtained as the limiting empirical spectral distribution of any Wigner matrix by counting non-crossing pair partitions; here it reappears in two exact guises specific to the Gaussian ensembles — as the large- envelope of the determinantal one-point function and as the equilibrium measure of the log-gas variational problem — so the Gaussian ensembles are the exactly solvable special case whose joint density makes the semicircle and its -dependent fluctuations explicit.

The Stieltjes transform and resolvent route 37.08.02 supplies the singular-integral solution used in the equilibrium-measure proposition. The Euler-Lagrange condition for the log-gas is a principal-value Stieltjes equation, and the same self-consistent resolvent that the cavity method produces there is the analytic engine that inverts the variational equation here; the resolvent is the common language of the dynamical, moment, and Coulomb-gas derivations of the semicircle.

The QFT large- matrix model and topological expansion 08.14.06 is the field-theoretic sibling of the Gaussian ensembles. The partition function studied there is the same Gaussian matrix integral whose eigenvalue reduction is this unit's joint density; the genus expansion in corresponds to the fluctuation expansion around the equilibrium measure, and the planar saddle is the semicircle equilibrium measure derived above.

The Haar measure and representation theory of compact groups [needed for the Weyl integration step] underlies the change of variables: the factor in the Jacobian is integrated against normalised Haar measure on , , or , and the Weyl integration formula proved here is the spectral specialisation of the general Weyl integration formula for class functions on a compact Lie group, with the maximal torus playing the role of the diagonal eigenvalue coordinates.

Historical & philosophical context Master

Eugene Wigner proposed Gaussian random matrices in the mid-1950s as a model for the statistics of highly excited nuclear energy levels, where the precise Hamiltonian is unknown but its symmetry class is not [Wigner 1955]. The decisive structural step was taken by Freeman Dyson, who in a 1962 series in the Journal of Mathematical Physics introduced the Coulomb-gas interpretation of the joint eigenvalue density [Dyson 1962b] and, in the companion paper, classified the ensembles by their behaviour under time-reversal and rotation into the orthogonal, unitary, and symplectic classes — the threefold way — explaining why exactly three values occur [Dyson 1962a]. Madan Lal Mehta, often in collaboration with Dyson, developed the orthogonal-polynomial method that makes the GUE exactly solvable and computed the gap and spacing distributions; his monograph [Mehta 2004] remains the standard reference and contains the joint-density derivation and the Mehta normalising integral.

The joint eigenvalue density and its repulsion go back, for the unitary group itself, to Hermann Weyl's integration formula for class functions on compact Lie groups, of which the Gaussian-ensemble Jacobian is a Euclidean analogue. The general- extension beyond the three classical values, long treated as a formal interpolation through the Selberg integral, was given a genuine matrix realisation by Ioana Dumitriu and Alan Edelman in 2002 via tridiagonal models, and Peter Forrester's treatise systematised the log-gas and Selberg-integral technology across all [Forrester 2010]. The bulk sine-kernel and edge Airy-kernel limits, computed for the Gaussian ensembles by orthogonal polynomials, were later shown universal across Wigner matrices by the Erdős-Schlein-Yau and Tao-Vu programs, vindicating Wigner's original hypothesis that the symmetry class alone, not the microscopic law, fixes the local spectral statistics.

Bibliography Master

@article{wigner1955gaussian,
  author  = {Wigner, Eugene P.},
  title   = {Characteristic vectors of bordered matrices with infinite dimensions},
  journal = {Annals of Mathematics},
  volume  = {62},
  number  = {3},
  pages   = {548--564},
  year    = {1955}
}

@article{dyson1962threefold,
  author  = {Dyson, Freeman J.},
  title   = {The threefold way: algebraic structure of symmetry groups and ensembles in quantum mechanics},
  journal = {Journal of Mathematical Physics},
  volume  = {3},
  number  = {6},
  pages   = {1199--1215},
  year    = {1962}
}

@article{dyson1962coulomb,
  author  = {Dyson, Freeman J.},
  title   = {Statistical theory of the energy levels of complex systems. I},
  journal = {Journal of Mathematical Physics},
  volume  = {3},
  number  = {1},
  pages   = {140--156},
  year    = {1962}
}

@book{mehta2004gaussian,
  author    = {Mehta, Madan Lal},
  title     = {Random Matrices},
  edition   = {3rd},
  publisher = {Elsevier/Academic Press, Amsterdam},
  year      = {2004}
}

@book{agz2010gaussian,
  author    = {Anderson, Greg W. and Guionnet, Alice and Zeitouni, Ofer},
  title     = {An Introduction to Random Matrices},
  series    = {Cambridge Studies in Advanced Mathematics},
  volume    = {118},
  publisher = {Cambridge University Press},
  year      = {2010}
}

@book{forrester2010,
  author    = {Forrester, Peter J.},
  title     = {Log-Gases and Random Matrices},
  series    = {London Mathematical Society Monographs},
  publisher = {Princeton University Press},
  year      = {2010}
}

@article{dumitriuedelman2002,
  author  = {Dumitriu, Ioana and Edelman, Alan},
  title   = {Matrix models for beta ensembles},
  journal = {Journal of Mathematical Physics},
  volume  = {43},
  number  = {11},
  pages   = {5830--5847},
  year    = {2002}
}

@book{deift1999,
  author    = {Deift, Percy A.},
  title     = {Orthogonal Polynomials and Random Matrices: A Riemann-Hilbert Approach},
  series    = {Courant Lecture Notes},
  volume    = {3},
  publisher = {American Mathematical Society},
  year      = {1999}
}