We’re going to discuss the arithmetic of polynomial rings over finite fields and its similarity to the arithmetic of the integers. We’ll first run though some preliminary observations about the arithmetic of polynomial rings which will suggest that it behaves similar to the arithmetic of the integers.

Here is how the following will proceed: we’ll look at analogues of the -function as well as the classic theorems of Euler and Fermat, and conclude with some discussion of a zeta-function over the polynomial rings.

Let be the polynomial ring in over a finite field . We note here that *the role of positive integers in are played by monic polynomials*, and *prime integers are played by irreducible monic polynomials*. In fact, we can interchange “irreducible” with “prime” because like , is also a PID. The proof for both cases are standard facts in an introductory abstract algebra course, and are even analogous; they both deal with looking at a minimal element of an ideal, with respect to a norm, and then using the division algorithm. Both rings also happen to have infinitely many primes. The proofs here are analogous as well, if you use Euclid’s argument for infinitely many primes. Moreover, the residue class rings modulo a non-zero ideal of both rings are finite. This follows quickly by using the division algorithm to find a complete set of representatives for the residue class ring. If we restrict the ideal to be generated by a prime element, then the residue class rings become residue class fields in both cases. There is also the discussion of units. Both and have a finite system of units, the former being and the latter being by degree considerations. It is here that we see *the role of is played by in *. These basic properties suggest that the arithmetic of should be similar to that of . As said above, this is the case. However, it is surprisingly easier to understand and requires the use of much less machinery than . For example, there is an analogous zeta-function for , and therefore an analogous Riemann Hypothesis. Here is where differs from , because we have proven that the hypothesis is true for . However, let’s talk about some simpler analogous number theoretic statements in first.

#### The -function, Euler, and Fermat

Before looking at analogues to the -function and theorems of Euler and Fermat there is a small technical note to be made aware of. If , then we define . By finding a full set of representatives for using the division algorithm, it’s easy to check that the order of is .

Let’s start with Euler’s -function. Euler gave a product formula for , rightly named **Euler’s product formula**, which says

,

where is a prime. The proof rests on the fact that the -function is multiplicative and that for a prime and positive integer we have . The analogous function for is where , for non-zero, returns the order of the group or equivalently the number of polynomials of degree less than and relatively prime to . The analogous product formula is

,

where is an irreducible monic polynomial. This looks strikingly similar to the Euler product formula above, and keeping with similar fashion as before, the proof is somewhat analogous: the Chinese remainder theorem in is used to show is multiplicative. Yet, we need a different argument to compute . It is essentially a counting argument: the ring can be shown to be local, and so by counting the complement of a maximal ideal in we have also counted . Like in the case of the Euler product formula, the proof follows easily from these two facts.

We also have an analogues to two famous number theory statements of Euler and Fermat. In **Euler’s theorem** takes the form

,

where , , and is relatively prime to . As usual, the proof is completely analogous since the order of is by definition $latex \Phi(f)$, and since is relatively prime to it’s an element of (this last statement follows from the Chinese remainder theorem in ). If we take to be some irreducible monic polynomial then we obtain the analogue to **Fermat’s little theorem**:

.

Indeed, is the order of which is $latex because is a field as we have discussed above.

#### The Zeta-Function

As mentioned, there is an analogue to the zeta-function in . In , the zeta-function on complex numbers with is defined as

.

The **Euler product** form of can be obtained in the exact same style of how Riemann did for the usual zeta-function by sieving out multiples of for all monic irreducible polynomials . The closed form expression can be deduced by noticing that the summation form is an infinite geometric series by using the definition of and collecting terms by degree. Similar to the usual zeta-function , can be extended to a meromorphic function on with a simple pole at . However, is significantly more simple to work with.

#### References

*Number Theory in Function Fields* – Michael Rosen