1. | An integer $n\ge 2$ is prime if the only positive integers that divide it are 1 and itself; if $n\ge 2$ is not prime we say it is composite. The number 1 is neither prime nor composite, but instead is called a unit. |

2. | This property is called unique factorization, and is one of the most important properties of prime numbers. If 1 were considered a prime, then unique factorization would fail; for example, if 1 were prime then ${3}^{5}\xb77$ and ${1}^{2009}\xb7{3}^{5}\xb77$ would be two different factorizations of 1701. |

3. | The proof is by contradiction. Assume there are only finitely many primes. We label them ${p}_{1}$, ${p}_{2}$, ⋯, ${p}_{n}$. Consider the number $m={p}_{1}{p}_{2}\cdots {p}_{n}+1$. Either this is a new prime not on our list, or it is composite. If it is composite, it must be divisible by some prime; however, it cannot be divisible by any prime on our list, as each of these give remainder 1. Thus m is either prime or divisible by a prime not on our list. In either case, our list was incomplete, proving that there are infinitely many primes. With a little bit of effort, one can show that Euclid’s argument proves there is a $C>0$ such that $\pi \left(x\right)\ge Cloglogx$. The first few primes generated in this manner are 2, 3, 7, 43, 13, 53, 5, 6221671, 38709183810571, 139, 2801. A fascinating question is whether or not every prime is eventually listed (see [ 13]). |

4. | The notation $f\left(x\right)=o\left(g\right(x\left)\right)$ means ${lim}_{x\to \infty}f\left(x\right)/g\left(x\right)=0$. |

5. | A complex number $z\in \mathbb{C}$ is of the form $z=x+iy$. We call x the real part and y the imaginary part; we frequently denote these by $\mathrm{Re}\left(z\right)$ and $\mathrm{Im}\left(z\right)$, respectively. |

6. | Let $s=\sigma +it$. Then $\left|\zeta \left(s\right)\right|\le {\sum}_{n=1}^{\infty}{n}^{-\sigma}$. The integral test from calculus states that this series converges if and only if ${\int}_{1}^{\infty}{x}^{-\sigma}dx$ converges, and this integral converges if $\sigma >1$. |

7. | To see this, use the geometric series formula (see Footnote 9) to expand ${(1-{p}^{-s})}^{-1}$ as ${\sum}_{k=0}^{\infty}{p}^{-ks}$ and note that ${n}^{-s}$ occurs exactly once on each side (and clearly every term from expanding the product is of the form ${n}^{-s}$ for some n. |

8. | We give two quick proofs of the importance of the Euler product by showing how it implies there are infinitely many primes. The first is $\sum 1/{n}^{s}\to \infty $ as $s\to 1+$, which means there must be infinitely many primes as otherwise the product is finite. The second proof is to note $\sum 1/{n}^{2}={\pi}^{2}/6$ is irrational; if there were only finitely many primes than the product would be rational. See for example [ 16] for details. |

9. | The subject of meromorphic continuation belongs to complex analysis. For the benefit of the reader who hasn’t seen this, we give a brief example that will be of use throughout this paper, namely the geometric series formula $1+r+{r}^{2}+{r}^{3}+\cdots =1/(1-r)$. Note that while the sum makes sense only when $\left|r\right|<1$, $1/(1-r)$ is well-defined for all $r\ne 1$ and agrees with the sum whenever $\left|r\right|<1$. We say $1/(1-r)$ is a meromorphic continuation of the sum. |

10. | One proof is to use the Gamma function, $\mathsf{\Gamma}\left(s\right)={\int}_{0}^{\infty}{e}^{-t}{t}^{s-1}dt$. A simple change of variables gives ${\int}_{0}^{\infty}{x}^{\frac{1}{2}s-1}{e}^{-{n}^{2}\pi x}dx$= $\mathsf{\Gamma}\left(\frac{s}{2}\right)/{n}^{s}{\pi}^{s/2}$. Summing over n represents a multiple of $\zeta \left(s\right)$ as an integral. After some algebra we find $\mathsf{\Gamma}\left(\frac{s}{2}\right)\zeta \left(s\right)$=${\int}_{1}^{\infty}{x}^{\frac{1}{2}s-1}\omega \left(x\right)dx$+${\int}_{1}^{\infty}{x}^{-\frac{1}{2}s-1}\omega \left(\frac{1}{x}\right)dx$, with $\omega \left(x\right)={\sum}_{n=1}^{+\infty}{e}^{-{n}^{2}\pi x}$. Using Poisson summation, we find $\omega \left(\frac{1}{x}\right)=-\frac{1}{2}+-\frac{1}{2}{x}^{\frac{1}{2}}+{x}^{\frac{1}{2}}\omega \left(x\right)$, which yields ${\pi}^{-\frac{1}{2}s}\mathsf{\Gamma}\left(\frac{s}{2}\right)\zeta \left(s\right)$=$\frac{1}{s(s-1)}$+ ${\int}_{1}^{\infty}({x}^{\frac{1}{2}s-1}+{x}^{-\frac{1}{2}s-\frac{1}{2}})\omega \left(x\right)dx$, from which the claimed functional equation follows. |

11. | Let f be a meromorphic function with only finitely many poles on an open set U which is bounded by a ‘nice’ curve $\gamma $. Thus at each point ${z}_{0}\in U$ we have $f\left(x\right)={\sum}_{n=N}^{\infty}{a}_{n}{(z-{z}_{0})}^{n}$ with $N>-\infty $. If $N>0$ we say f has a zero of order N. If $N<0$ we say f has a pole of order $-N$, and in this case we call ${a}_{-1}$ the residue of f at ${z}_{0}$ (for clarity, we often denote this by $\mathrm{Res}(f,{z}_{0})$). If f does not have a pole at ${z}_{0}$, then the residue is zero. Our assumption implies that there are only finitely many points where the residue is non-zero. The residue theorem states $\frac{1}{2\pi i}{\oint}_{\gamma}f\left(z\right)dz={\sum}_{z\in U}\mathrm{Res}(f,z)$. One useful variant is to apply this to ${f}^{\prime}\left(z\right)/f\left(z\right)$, which then counts the number of zeros of f minus the number of poles; another is to look at ${f}^{\prime}\left(z\right)/f\left(z\right)\xb7g\left(z\right)$ where $g\left(z\right)$ is analytic, which we will do later when stating the explicit formula for the zeros of the Riemann zeta function. |

12. | Some care is required with this sum, as $\sum 1/\left|\rho \right|$ diverges. The solution involves pairing the contribution from $\rho $ with $\overline{\rho}$; see for example [ 17]. |

13. | To see this, note ${\sum}_{{p}^{2}\le x}logp\le {x}^{1/2}logx$, while the contribution from $n={p}^{r}$ with $r\ge 3$ is bounded by ${\sum}_{r\ge 3}{\sum}_{{p}^{r}\le x}logp\le {x}^{1/3}2{log}^{2}x$ (this is because ${p}^{r}\le x$ implies $r\le {log}_{2}x\le 2logx$). |

14. | Partial summation is the discrete analogue of integration by parts [ 16]. In our case, ${\sum}_{p\le x}logp\sim x$ is equivalent to ${\sum}_{p\le x}1\sim x/logx$. |

15. | Note this is only true for zeros in the critical strip, namely $0\le \mathrm{Re}\left(\rho \right)\le 1$; for zeros outside the critical strip we can and do have zeros of $\zeta \left(s\right)$ not corresponding to zeros of $\zeta (1-s)$ because of poles of the Gamma function. |

16. | The Riemann Hypothesis is probably the most important mathematical aside ever in a paper. Riemann [ 18, 19] wrote (translated into English; note when he talks about the roots being real, he’s writing the roots as $1/2+i\gamma $, and thus $\gamma \in \mathbb{R}$ is the Riemann Hypothesis): …and it is very probable that all roots are real. Certainly one would wish for a stricter proof here; I have meanwhile temporarily put aside the search for this after some fleeting futile attempts, as it appears unnecessary for the next objective of my investigation. Though not mentioned in the paper, Riemann had developed a terrific formula for computing the zeros of $\zeta \left(s\right)$, and had checked (but never reported!) that the first few were on the critical line $\mathrm{Re}\left(s\right)=1/2$. His numerical computations were only discovered decades later when Siegel was looking through Riemann’s papers. |

17. | The prime number theorem is in fact equivalent to the statement that $\mathrm{Re}\left(\rho \right)<1$ for any zero of $\zeta \left(s\right)$. The prime number theorem was first proved independently by Hadamard [ 22] and de la Vallée Poussin [ 23] in 1896. Each proof crucially used results from complex analysis, which is hardly surprising given that Riemann had shown $\pi \left(x\right)$ is related to the zeros of the meromorphic function $\zeta \left(s\right)$. It was not until almost 50 years later that Erdös [ 14] and Selberg [ 15] obtained elementary proofs of the prime number theorem (in other words, proofs that did not use complex analysis, which was quite surprising as the prime number theorem was known to be equivalent to a statement about zeros of a meromorphic function). See [ 24] for some commentary on the history of elementary proofs. |

18. | By this we mean ${\int}_{-\infty}^{\infty}{\left|x\right|}^{k}p\left(x\right)dx<\infty $. If the integrand is not absolutely convergent, then the value could depend on how we tend to infinity. The standard example is the Cauchy distribution, $p\left(x\right)={\left(\pi (1+{x}^{2})\right)}^{-1}$. Note ${\int}_{-\infty}^{\infty}\left|x\right|p\left(x\right)dx=\infty $, ${lim}_{A\to \infty}{\int}_{-A}^{A}xp\left(x\right)dx=0$ and ${lim}_{A\to \infty}{\int}_{-A}^{2A}xp\left(x\right)dx={\pi}^{-1}log2$. |

19. | The reason is we can always adjust our probability distribution, in this case, to have mean 0 and variance 1 by simple translations and rescaling. For example, if the density p has mean $\mu $ and variance $\sigma $, then $g\left(x\right)={\sigma}^{-1}p(\sigma x+\mu )$ has mean 0 and variance 1. Thus the third moment (or the fourth if the third vanishes) are the first moments that truly show the ‘shape’ of the density. |

20. | For $x\in [0,\infty )$, consider ${f}_{1}\left(x\right)={\left(2\pi x\right)}^{-1/2}exp\left(-{(logx)}^{2}/2\right)$ and ${f}_{2}\left(x\right)={f}_{1}\left(x\right)\left[1+sin(2\pi logx)\right]$. For $r\in \mathbb{N}$, the r^{th} moment of ${f}_{1}$ and ${f}_{2}$ is $exp({r}^{2}/2)$. The reason for the non-uniqueness of moments is that the moment generating function ${M}_{f}\left(t\right)={\int}_{-\infty}^{\infty}exp\left(tx\right)f\left(x\right)dx$ does not converge in a neighborhood of the origin. See [ 44], Chapter 2. |

21. | The standard example is the function $f\left(x\right)=exp(-1/{x}^{2})$ if $\left|x\right|>0$ and 0 otherwise. By using the definition of the derivative and L’Hopital’s rule, we see ${f}^{\left(n\right)}\left(0\right)=0$ for all n, but clearly this function is non-zero if $\left|x\right|>0$. Thus the radius of convergence is zero! This example illustrates how much harder real analysis can be than complex analysis. There if a function of a complex variable has even one derivative then it has infinitely many, and is given by its Taylor series in some neighborhood of the point. |

22. | We can consider the probability densities ${A}_{N}\left(x\right)dx$, where A is a probability density and ${A}_{N}\left(x\right)=N\xb7A\left(Nx\right)$. As $N\to \infty $ almost all the probability (mass) is concentrated in a narrower and narrower band about the origin; we let $\delta \left(x\right)$ be the limit with all the mass at one point. It is a discrete (as opposed to continuous) probability measure, with infinite density but finite mass. Note that $\delta (x-{x}_{0})$ acts like a unit point mass; however, instead of having its mass concentrated at the origin, it is now concentrated at ${x}_{0}$. |

23. | As A is real symmetric, the eigenvalues are real (see Footnote 19) and thus this measure is well defined. |

24. | These ensembles have behavior that is often described by a parameter $\beta $, which is 1 for real symmetric, 2 for complex Hermitian and 4 for symplectic matrices. |

25. | See [ 47, 48]. We quote from [ 47] who quote from [ 48]: There is no covering company responsible for organizing the city transport. Consequently, constraints such as a time table that represents external influence on the transport do not exist. Moreover, each bus is the property of the driver. The drivers try to maximize their income and hence the number of passengers they transport. This leads to competition among the drivers and to their mutual interaction. It is known that without additive interaction the probability distribution of the distances between subsequent buses is close to the Poisonian distribution and can be described by the standard bus route model.... A Poisson-like distribution implies, however, that the probability of close encounters of two buses is high (bus clustering) which is in conflict with the effort of the drivers to maximize the number of transported passengers and accordingly to maximize the distance to the preceding bus. In order to avoid the unpleasant clustering effect the bus drivers in Cuernevaca engage people who record the arrival times of buses at significant places. Arriving at a checkpoint, the driver receives the information of when the previous bus passed that place. Knowing the time interval to the preceding bus the driver tries to optimize the distance to it by either slowing down or speeding up. The papers go on to show the behavior is well-modeled by random matrix theory (specifically, ensembles of complex Hermitian matrices)! |

26. | Explicitly, given two points with masses ${m}_{1}$ and ${m}_{2}$ and initial velocities ${\overrightarrow{v}}_{1}$ and ${\overrightarrow{v}}_{2}$ and located at ${\overrightarrow{r}}_{1}$ and ${\overrightarrow{r}}_{2}$, we can describe how the system evolves in time given that gravity is the only force in play. |

27. | While there are known solutions for special arrangements of special masses, three bodies in general position is still open; see [ 49] for more details. |

28. | Whether or not Pluto will regain planetary status is an entirely different question. |

29. | This is reminiscent of the Central Limit Theorem. For example, if we average over all sequences of tossing a fair coin $2N$ times, we obtain N heads, and most sequences of $2N$ tosses will have approximately N heads, where approximately means deviations on the order of $\sqrt{N}$. |

30. | The first reference to this conjecture in the literature might not have been until 1973 by Montgomery [ 3]. |

31. | If v is an eigenvector with eigenvalue $\lambda $ of a Hermitian matrix A (so $A={A}^{*}$ with ${A}^{*}$ the complex conjugate transpose of A, then ${v}^{*}\left(Av\right)={v}^{*}\left({A}^{*}v\right)={\left(Av\right)}^{*}v$; the first expression is ${\lambda \left|\right|v\left|\right|}^{2}$ while the last is $\overline{\lambda}{\left|\right|v\left|\right|}^{2}$, with ${\left|\right|v\left|\right|}^{2}={v}^{*}v=\sum {\left|{v}_{i}\right|}^{2}$ non-zero. Thus $\lambda =\overline{\lambda}$, and the eigenvalues are real. This is one of the most important properties of Hermitian matrices, as it allows us to order the eigenvalues. |

32. | In fact, one of the authors has used Weibull distributions to model run production in major league baseball, giving a theoretical justification for Bill James’ Pythagorean Won-Loss formula [ 62]. |

33. | Obviously this Weibull cannot be a normal distribution, as they have very different decay rates for large x, and this Weibull is a one-sided distribution! What we mean is that for $0\le x\le 2$ this Weibull is well approximated by a normal distribution which shares its mean and variance, which are (respectively) $\mathsf{\Gamma}(4/3)\approx .893$ and $\mathsf{\Gamma}(5/3)-\mathsf{\Gamma}{(4/3)}^{2}\approx .105$. |

34. | Historically, Frechet introduced this distribution in 1927, and Nuclear Physicists often refer to the Weibull distribution as the Brody distribution [ 25]. |

35. | There is an interesting perspective to proving more than a third of the zeros lie on the critical line. As zeros off the line occur in complex conjugate pairs, proving more than a third of all non-trivial zeros lie on the line is equivalent to more than a half of all zeros with real part at least 1/2 are on the line! Thus, in this sense, a ‘majority’ of all zeros are on the critical line. |

36. | The class number measures how much unique factorization fails in the ring of integers of a finite extension of $\mathbb{Q}$, and thus is an extremely important property of these fields. For example, $\mathbb{Z}\left[i\right]=\{a+ib:a,b\in \mathbb{Z}\}$ has unique factorization, while $\mathbb{Z}\left[i\sqrt{5}\right]=\{a+ib\sqrt{5}:a,b\in \mathbb{Z}\}$ does not (in the latter, note we can write 6 as either $2\xb73$ or $(1+i\sqrt{5})(1-i\sqrt{5})$, and none of these four numbers can be factored as $(a+ib\sqrt{5})(c+id\sqrt{5})$ without one of the two factors being a unit (the units are numbers in the ring whose norm is 1; in $\mathbb{Z}\left[i\sqrt{5}\right]$, these numbers are $\pm 1$ (in $\mathbb{Z}\left[\sqrt{5}\right]$ we would also have numbers such as $2+\sqrt{5}$, as $(2+\sqrt{5})(-2+\sqrt{5})=1$). The class number problem is to find all imaginary quadratic fields with a given class number; see [ 70, 71] for more details and results. It turns out (see [ 72]) that if there are many small (relative to the average spacing) gaps between zeros of $\zeta \left(s\right)$ on the critical line, then there are terrific lower bounds for the class number; another connection between the class number and zeros of L-functions is through the work of Goldfeld [ 73] and Gross-Zagier [ 74]. |

37. | Of course, one has to invert these relations to find the eigenvalues! |

38. | See [ 81, 82] for proofs of the central limit theorem, or [ 16] for a sketch of the proof. |

39. | For example, imagine for all N we always had half the moments equal 0 and the other half equal $2C\left(k\right)$; then the average is $C\left(k\right)$ but no measure is close to the system average. |

40. | Many of the papers in the field have large sections devoted to handling combinatorics; see for instance [ 83, 85, 86]. Interestingly, sometimes the combinatorics cannot be handled, and in [ 87] we believe the number theory and random matrix theory agree where both have been calculated, but we cannot do the combinatorics to prove this. |

41. | The proof is trivial if A is diagonal or upper diagonal, following by definition. As we only need this result for real symmetric matrices, which can be diagonalized, we only give the proof in this case. Let S be such that $A=S\Lambda {S}^{-1}$ with $\Lambda $ diagonal. The claim follows from ${A}^{k}=S{\Lambda}^{k}{S}^{-1}$ and $\mathrm{Trace}\left(ABC\right)=\mathrm{Trace}\left(BCA\right)$. |

42. | With a little more work, we could calculate the variance of the average eigenvalue squared, using either the Central Limit Theorem or even Chebyshev’s Theorem (from probability). |

43. | This is similar in some sense to dimensional analysis arguments in physics, which detect parameter dependence but not the constants. For example, imagine a pendulum of mass m (in kilograms), length L (in meters) where the difference in rest height (when the pendulum is down) and the raised height (where it is at angle $\theta $) is ${L}_{0}$ meters. We assume the only force acting is gravity, with constant g (in meters per second squared). The period is how long (in seconds) it takes the pendulum to do a complete cycle, must be a function of m, L, ${L}_{0}$ and g; however, the only combinations of these quantities that give units of seconds are $\sqrt{L/g}$ and $\sqrt{{L}_{0}/g}$; thus the period must be a function of these two expressions. The correct answer turns out to be (at least for small initial displacements) approximately $2\pi \sqrt{L/g}$; we are able to deduce the correct functional form, though the constants are beyond such analysis. |

44. | It is not hard to show the odd moments vanish by simple counting arguments. For the even moments, if the ${a}_{ij}$’s are not matched in pairs then there is negligible contribution as $N\to \infty $. The proof follows by counting how many tuples there can be with a given matching, and then comparing that to ${N}^{k/2+1}$ (the proofs are somewhat easier if our distribution is even). For example, as we are assuming our distribution has zero mean, if ever there was an ${a}_{{i}_{\ell}{i}_{\ell +1}}$ that was unmatched (so neither $({i}_{\ell},{i}_{\ell +1})$ or $({i}_{\ell +1},{i}_{\ell})$ occurs as the index in any other factor in the trace expansion, then the expectation of this term must vanish as each ${a}_{ij}$ is drawn from a mean zero distribution. The number of valid pairings of the ${a}_{ij}$’s (where everything is matched in pairs) is $(2k-1)!!=(2k-1)(2k-3)\cdots $, which is the $2k$^{th} moment of the standard normal; not ever matching contributes fully, though, and this is why the resulting moments are significantly smaller than the Gaussian’s. |

45. | The Catalan numbers are ${C}_{n}=\frac{1}{n+1}\left(\genfrac{}{}{0pt}{}{2n}{n}\right)$. They arise in a variety of combinatorial problems; see for example [ 88]. |

46. | If the ensemble of matrices had a different symmetry, the start of the proof proceeds as above but the combinatorics changes. For example, looking at Real Symmetric Toeplitz matrices (matrices constant along diagonals) leads to very different combinatorics (and in fact a different density of states than the semi-circle); see [ 83, 84]. If we looked at d-regular graphs, the combinatorics differs again, this time involving local trees; see [ 90]. |

47. | A graph is d-regular if each vertex is connected to exactly d neighbors. |

48. | The Fourier transform of g is $\widehat{g}\left(\xi \right)={\int}_{-\infty}^{\infty}g\left(x\right){e}^{-2\pi ix\xi}dx$. |

49. | This means for any $m,n\ge 0$ that ${lim}_{\left|x\right|\to \infty}{(1+{x}^{2})}^{m}{g}^{\left(n\right)}\left(x\right)=0$ (i.e., g and all its derivatives tend to zero faster than any polynomial). |

50. | We want (1) $f({x}_{1},\cdots ,{x}_{n})$ is symmetric; (2) $f(x+t(1,\cdots ,1\left)\right)=f\left(x\right)$ for $t\in \mathbb{R}$; (3) $f\left(x\right)\to 0$ rapidly as $\left|x\right|\to \infty $ in the hyperplane ${\sum}_{k}{x}_{j}=0$; see [ 86]. |

51. | The earliest occurrence was probably in Dirichlet’s work, who used L-functions attached to characters on ${(\mathbb{Z}/m\mathbb{Z})}^{*}$ to study primes in arithmetic progressions. Another example are elliptic curve L-functions, which (at least conjecturally) give information about the group of Mordell-Weil group of rational solutions of the elliptic curve. |

52. | This is because the zeros are tending to infinity. Thus, given any zero and any finite box, only finitely many zeros can be associated to it such that the required differences lie in the box. Therefore, this zero has negligible contribution in the limit as we are dividing by N. |

53. | For example, the Birch and Swinnerton-Dyer conjecture states the order of vanishing at the central point of an elliptic curve L-function equals the rank of the Mordell-Weil group of rational solutions of the elliptic curve; this is quite important information which we do not wish to discard! |

54. | These classical compact groups are much more natural random matrix ensembles. In our original formulation, we chose the matrix elements randomly and independently from some probability distribution p. What should we take for p? The GOE and GUE ensembles, where the entries are chosen from Gaussians, arise by imposing invariance on $\mathrm{Prob}\left(A\right)dA$ under orthogonal (respectively unitary) transformations; these are natural conditions to impose as the probability of a transformation should be independent of the coordinate system used to write it down. The classical compact groups come endowed with a natural probability, namely Haar measure. |

55. | The eigenvalues of a unitary matrix are of the form ${e}^{i\theta}$. To see this, let v be an eigenvector of U with eigenvalue $\lambda $. Note ${v}^{*}{U}^{*}Uv={v}^{*}v$, which gives ${\left|\lambda \right|}^{2}{\left|\right|v\left|\right|}^{2}={\left|\right|v\left|\right|}^{2}$, so $\left|\lambda \right|=1$. Thus, similar to real symmetric and complex Hermitian matrices, we can parametrize the eigenvalues by a real quantity. |

56. | We use the normalization $\widehat{\varphi}\left(\xi \right)={\int}_{-\infty}^{\infty}\varphi \left(x\right){e}^{-2\pi ix\xi}dx$. The Fourier transform has many nice properties on the Schwartz space (see [ 21] for example). |

57. | These are very strong conditions, and most choices of ${\lambda}_{f}\left(n\right)$ will not satisfy these requirements. Fortunately there are many choices that do work, and these frequently encode information about arithmetically interesting problems. The most studied examples include Dirichlet L-functions, modular and Maass forms; see [ 99] for details. |

58. | For example, there are three flavors of orthogonal symmetry, and their 1-level densities are indistinguishable if the support of $\widehat{\varphi}$ is contained in $(-1,1)$; however, the 2-level densities of all three are distinguishable for arbitrarily small support [ 100]. Another example is in obtaining better decay rates for high vanishing at the central point in a family [ 101]. |

59. | This means we avoid the trivial character ${\chi}_{0}\left(n\right)=1$ if n is relatively prime to m and 0 otherwise; this character gives rise to a simple modification of $\zeta \left(s\right)$. |

60. | We could consider the related family of quadratic Dirichlet characters coming from a fundamental discriminant $d\in [X,2X]$ with $X\to \infty $; this family agrees with the scaling limit of symplectic matrices. |

61. | There are actually three flavors of orthogonal groups. If all the signs of the functional equation are even, the corresponding group should be $\mathrm{SO}\left(2N\right)$, and similarly if the signs are all odd. We refer the reader to the previously mentioned surveys for the details. |

62. | In fact, the case being studied here has the best averaging formula! For cuspidal newforms we have the Petersson formula, and for families of elliptic curves we can use periodicity in evaluating Legendre sums of cubic polynomials. In general, however, unless our family is obtained in some manner from a family such as one of these, we do not possess the needed averaging formula. |

63. | ${(\mathbb{Z}/m\mathbb{Z})}^{*}$ is the set $\{1,2,\cdots ,m-1\}$ where multiplication and addition are modulo m; for example, if $m=17$, $x=11$ and $y=9$ then $xy=99=5\xb717+14$, so $xy\equiv 14\phantom{\rule{0.277778em}{0ex}}mod\phantom{\rule{0.277778em}{0ex}}17$, while $x+y=20\equiv 3\phantom{\rule{0.277778em}{0ex}}mod\phantom{\rule{0.277778em}{0ex}}17$. The hardest step in proving that this is a group under multiplication is finding inverses; one way to accomplish this is with the Euclidean algorithm. |

64. | These properties mean $\chi \left(1\right)=1$, $\chi \left(xy\right)=\chi \left(x\right)\chi \left(y\right)$ and $\chi \left({x}^{r}\right)=\chi {\left(x\right)}^{r}$. Further, though initially only defined on ${(\mathbb{Z}/m\mathbb{Z})}^{*}$, we extend the definition to all of $\mathbb{Z}$ by setting $\chi (n+\ell m)=\chi \left(n\right)$. As ${g}^{m-1}\equiv 1\phantom{\rule{0.277778em}{0ex}}mod\phantom{\rule{0.277778em}{0ex}}m$, $\chi \left({g}^{m-1}\right)=1$ or $\chi {\left(g\right)}^{m-1}=1$ for all $\chi $. Thus $\chi \left(g\right)$ has to be an $m-1$ root of unity. We see each of these roots gives rise to a character (one of which is the principal or trivial character); by multiplicativity once we know the character’s action on the generator we know it everywhere. |

65. | This is not surprising, as the above argument is quite crude, where we have inserted absolute values and thus lost the expected cancelation due to the terms having opposite sign. |

66. | This just asserts that any ‘nice’ L-function has all of its zeros in the critical strip having real part equal to 1/2. |

67. | If $L(s,{f}_{i})$=${L}_{\infty ;i}\left(s\right)$${\prod}_{p}$${\prod}_{j=1}^{{m}_{i}}$${(1-{\alpha}_{j;i}\left(p\right){p}^{-s})}^{-1}$, then $L(s,{f}_{1}\otimes {f}_{2})$ is related to a product over primes of ${\prod}_{j=1}^{{m}_{1}}{\prod}_{k=1}^{{m}_{2}}$${(1-{\alpha}_{j;1}\left(p\right){\alpha}_{k;2}\left(p\right){p}^{-s})}^{-1}$. It is conjectured that these functions have functional equations, satisfy the Riemann hypothesis, et cetera. The existence of the Rankin-Selberg convolution is known for just a few choices of the ${f}_{i}$’s. |

68. | There are several difficulties with the proofs in general, ranging from not knowing properties of the Rankin-Selberg convolution in general to not having a good averaging formula over general families. |

69. | A special case of this theorem was discovered by Dueñez-Miller in [ 102] in studies of a family of $\mathrm{GL}\left(4\right)$ and a family of $\mathrm{GL}\left(6\right)$ L-functions. The analysis there led to a disproof of a folklore conjecture that the theory of low-lying zeros of L-functions is equivalent to a theory of the distribution of signs of the functional equations in the family; see [ 102, 119] for details. The key ingredient in the proofs is the universality of the second moments of the Satake parameters ${\alpha}_{j;i}\left(p\right)$; this is similar to the universality found by Rudnick and Sarnak [ 86] in the n-level correlations. The higher moments of the Satake parameters control the rate of convergence to the random matrix predictions. |

70. | Instead of attaching a symmetry constant, additionally one can attach a symmetry vector which incorporates other information, such as the rank of the family. |

71. | The search string was ’number theory and random matrix theory’. |