I just uploaded to the arxiv a paper which can be viewed as vindication by anybody who has ever struggled to compute an eigenvalue by hand: the paper gives mathematical proof that eigenvalues are almost always as complicated as they can be. Intuitive as this may be, to prove it I needed two mathematical bazookas: both the extended Riemann hypothesis and the classification of finite simple groups!

An example will illustrate what I mean. Here is a random matrix with entries:

The eigenvalues of as approximated by scipy.lingalg.eig are shown below.

But what if we want to know the eigenvalues exactly? Well, they are the roots of the characteristic polynomial of , which is

so we just have to solve

. The

Abel–Ruffini theorem states that,

*in general*, this is not possible in the quadratic-formula-type sense involving radicals, etc., so there are certainly evil matrices that defy solution. But could there be something special about random matrices that makes

typically more special?

It is not at all obvious that is “generic”. For one thing, if is singular, then has an obvious root: zero! For another, if happens to have a repeated eigenvalue, then and share a factor, which is certainly a special algebraic property. It turns out that these events are low-probability events, but those are landmark results about random matrices (due originally to Komlós and Tao–Vu (symmetric case) and Ge (nonsymmetric), respectively).

Algebraically, the complexity of solving is measured by the Galois group . In particular, the polynomial is irreducible if and only if is transitive, and the equation is solvable by a formula involving radicals as in the quadratic formula if and only if is solvable in the sense of group theory. Galois groups are not easy to calculate in general, but “typically” they are, by the following well-known trick. If we factorize mod for some prime , then, as long as we do not get a repeated factor, the degree sequence of the factorization is the same as the cycle type of some element of . If we do this for enough small primes we can often infer that .

Let’s do this for the above example. If we factorize mod for , discarding the “ramified” primes for which there is a repeated factor, we get the following degree sequences:

Therefore contains a -cycle, an element of type , etc. Just from the -cycle and the element it is clear that must be transitive (in fact 2-transitive), so is irreducible. The are various other rules that help eliminate other possibilities for . A common one is a theorem of Jordan which states that if is primitive and contains a -cycle for some prime then . The element of cycle type is odd and has a power which is a 5-cycle, so Jordan’s theorem implies .

Conclusion: for the matrix above, solving is a certifiable pain. You should just give up and accept itself as the prettiest answer you are going to get.

What my paper shows in general is that, if you choose the entries of an matrix from a fixed distribution in the integers,then, *with probability tending to as , the characteristic polynomial is irreducible, and moreover its Galois group is at least *. The result is conditional on the extended Riemann hypothesis, as mentioned, except in some nice special cases, such as when the entries are uniformly distributed in

Note I only said “at least ”. Presumably the event also has negligible probability, so with probability , but this remains open, and seems difficult. To prove it (naively), you have to show that the discriminant of the characteristic polynomial is, with high probability, not a perfect square. That should certainly be a low-probability event, but it’s not clear how to prove it!

Why do I need the extended Riemann hypothesis (ERH) and the classification of finite simple groups (CFSG)?

- ERH: The example above involving factorizing mod is not just useful in practice but also in theory. The prime ideal theorem tells you the statistics of what happens with your polynomial mod for large . In particular, to show that is transitive it suffices to show that has one root on average mod , for large primes . Exactly how large must be is determined by the error term in the prime ideal theorem, and ERH really helps a lot.
- CFSG: An elaboration of the above strategy is used to show that is not just transitive but -transitive for any constant . By CFSG, and is enough to imply .

Arguably, matrices are not playing a large role in the statement of the theorem: it is just a statement about a random polynomial , where the model happens to be “take a random matrix with independent entries and take its characteristic polynomial”. The theorem should be true for any good model for a random polynomial of high degree. For example, in the “independent (or restricted) coefficients model”, the coefficients of are independent with some fixed distribution. For this model the corresponding statements were proved recently by Bary-Soroker–Kozma (see also Bary-Soroker’s blog post) and Breuillard–Varju, and I certainly borrow a lot from those papers. However, the common ground is isolated to the local–global principle that reduces the problem to a problem modulo , and there the commonality ends. The independent coefficients case becomes a question about a certain kind of random walk (see the Breuillard–Varju paper) mod , whereas the characteristic polynomial case becomes a problem about counting eigenvalues of a random matrix mod .

There are many beautiful questions and mysteries about random polynomials. See for example the many high-definition pictures on John Baez’s website here showing the roots of random polynomials with independent coefficients. In many ways, taking the characteristic polynomial of a random matrix is actually a more natural model of a random polynomial, and some aspects become simpler. For example, I bet that the vs question will be settled sooner in the case of a random characteristic polynomial than in the case of independent coefficients.