4
$\begingroup$

It is folklore that many number theoretic results on prime numbers have a simpler-to-prove finite field analog. For example, on the one hand, the proof of the Prime Number Theorem $$\#\{\text{prime numbers}\leq x\} \sim \frac{x}{\log x}, \;\;\,\; x \to +\infty,$$ requires complex analysis and the study of the Riemann zeta function (or the elementary, albeit complicated, machinery of Selberg), while, on the other hand, the proof of $$\#\{\text{irreducible monic polynomials in $\mathbb{F}_q[x]$ of degree} \leq n\} \sim \frac{q^n}{\log_q q^n}$$ requires only some combinatorial reasonings (which also gives an error term of the size of the one expected for the error term of the prime numbers counting function under the Riemann's hypothesis).

Do you know where I can find a survey or some other kind of collection of these finite field analog? Thanks

Improve this question
$\endgroup$
3
  • 2
    $\begingroup$ In general, we say "function field" analogue. I don't know a good survey, but maybe concerning objects this could be a good start. See also this question: mathoverflow.net/questions/1367/…, especially this reference. $\endgroup$
    – Watson
    Commented Apr 14, 2020 at 14:10
  • $\begingroup$ See also the non-analogies: mathoverflow.net/questions/177234 $\endgroup$
    – Watson
    Commented Apr 14, 2020 at 14:16
  • 4
    $\begingroup$ Arguably counting prime polynomials of degree $n$ is not really the right analogue of the prime number theorem. A better one might be prime polynomials with the leading $k$ coefficients fixed. This requires nonvanishing on $s=1$ for a Dirichlet $L$-function, and can be proven by the same kind of complex-analytic argument. (Or by one of the four different proofs of the Riemann hypothesis, of course - but none of them are as trivial as the "some combinatorial reasonings" you mention, which give the wrong impression IMO.) $\endgroup$
    – Will Sawin
    Commented Apr 14, 2020 at 14:31

1 Answer 1

Reset to default
7
$\begingroup$

One of the best references I am aware of, is the book by Rosen ‘Number theory in function fields’ https://www.springer.com/gp/book/9780387953359.

A good survey, which also concerns the important connection with random matrix theory, is the following paper by Rudnick, although you won’t find proofs there: http://www.math.tau.ac.il/~rudnick/papers/ICM-Proceedings-Rudnickv5.pdf

Improve this answer
$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .