# Why should I care about fields of positive characteristic?

This is what I know about why someone might care about fields of positive characteristic:

1. they are useful for number theory
2. in algebraic geometry, a theory of "geometry" can be developed over them, and it's fun to see how this geometry works out

Some people might read this and think, "What more could you need?" But I've never been able to make myself care about number theory, so (1) doesn't help me. (2) is nice for what it is, but I'm hoping there's something more. My understanding of (2) is that this is only geometry in a rather abstract sense and, for instance, there's no generally useful way to directly visually represent these fields or varieties over them the way we can over the reals or complex numbers. (Drawing a curve in R^2 and saying it's the curve over some other field may be helpful for some purposes, but it's not what I'm after here.)

Is there anything else? The ideal (surely impossible) answer for me would be "Yes, such fields are very good models for these common and easy to understand physical systems: A, B, C. Also, we can visualize them and varieties over them quite easily by method D. Finally, here's a bunch of surprising and helpful applications to 500 other areas of mathematics."

algebraic & geometric topology

differential geometry & topology

applications to physics

and I certainly care about algebraic geometry over C

(this is to say I understand the motivations behind these subjects and the general idea, not necessarily that I know them in depth)

• If you don't care about number theory, it would be helpful if you said what you do care about. One of my meta-mathematical beliefs is that there is always one major theorem in any sufficiently large subject which depends on results from any other sufficiently large subject and I would be interested in testing that out here. Aug 2, 2010 at 18:09
• "But I've never been able to make myself care about number theory". Oh, come on -- -1. (Not literally, but still...) Aug 3, 2010 at 1:17
• The geometric content of char p geometry would become clear once you look at the Weil conjectures. The thing is that even in char p there is a cohomology theory which behaves much like the topological cohomology theories do for varieties over complex numbers. This detachment is rather interesting, wouldn't you agree?
– user218
Aug 7, 2010 at 9:39

Let's suppose you care about finite groups, one way or another. Then you probably care about the classification of finite simple groups. The bulk of this classification is the groups of Lie type, which were discovered by finding analogues of Lie groups over finite fields.

Finite fields are also (as one might guess) very important in computer science. I'm certainly no expert, but here are some applications I know of:

• Cryptographic protocols like Diffie-Hellman have as their basis the simple fact that it is difficult to invert exponentiation in finite fields.
• The standard way that one factors polynomials over the integers is to apply something like Berlekamp's algorithm to factor them over several finite fields first, then combine the factorizations.
• The classic theorem that IP=PSPACE requires some work over finite fields.
• Elliptic curves over finite fields are used for elliptic curve cryptography.
• I have also been told that vector spaces and varieties over finite fields can be used to construct error-correcting codes. I don't know anything about this, but here is a book on the subject. For the special case of linear codes this leads to a beautiful analogy between lattice sphere packings and error-correcting codes which is described, for example, by Noam Elkies here.

Finally, even if you are only interested in varieties over $\mathbb{C}$ (say), if your variety happens to also be nice and defined over $\mathbb{Z}$ then it can be nice and defined over $\mathbb{F}_p$ for all but finitely many $p$ and you can use the Weil conjectures to compute its Betti numbers by counting. This is particularly easy to do for varieties with nice moduli interpretations like flag varieties.

Edit: You might also be interested in reading Serre's expository article How to use finite fields for problems concerning infinite fields, as well as Manin's Reflections on arithmetical physics. I got the latter link from an excellent answer to an MO question on mirror symmetry over finite fields.

• Cryptography was my answer also, you did a great job(better than I would have) of putting that together. Aug 2, 2010 at 18:05
• Re error-correcting codes: the main idea behind Reed-Solomon codes (used in CDs/DVDs to deal with scratches) is the fact that if you evaluate a polynomial of degree n (over a finite field) at n+t points, you can interpolate it even if you lose t of the values. Another related use: the discrete Fourier transform / FFT is often usefully done over finite fields. Aug 2, 2010 at 18:54
• Thanks Qiaochu, this is very helpful. I've accepted this, but would still like to read what anyone else has to say. Aug 2, 2010 at 20:25

There is a whole paper of Serre on this, which I haven't read; I will explain briefly one of my favorite applications.

One of the really cool applications of this is to the Ax-Grothendieck theorem. Which is a 100% analytic statement: if $P: \mathbb{C}^n \to \mathbb{C}^n$ is an injective polynomial map, then it's surjective. And yet the proof uses finite fields.

How? Well, first note that the theorem is trivial when $\mathbb{C}$ is replaced by a finite field: an injective map on finite sets is surjective. Using a little algebra (and a simple direct limit argument), it follows that the theorem is true for the algebraically closed field of characteristic $p$ which is the algebraic closure of the integers mod $p$.

Now apply to a bit of model theory; the theorem of Robinson says that any statement of first-order logic that is true in an alg. closed field of char. $p$ for each $p$ is true in any algebraically closed field of char 0, in particular the complex numbers. The trick is that the Ax-Grothendieck theorem can be phrased as a collection of (infinitely many) statements in first-order logic. And each is true in the algebraic closure of the finite fields. Whence, by Robinson's theorem, it's true in $\mathbb{C}$!

This would be cheating if Robinson's theorem were something obscure. In fact, however, it is a direct application of the compactness theorem for first-order logic.

For another proof via the Nullstellensatz (but based on finite fields, still), see Terry Tao's post.

If you are interested in algebraic geometry over C, here is another reason. A basic technique in birational geometry is the bend and break, which roughly amounts to taking any curve on a projective variety and deforming it until it becomes a union of curves of lower genus. Eventually this technique can be used to produce rational curves (under appropriate hypothesis).

This is a major tool, and has been used for instance to study the geometry of Fano varieties, in particular to prove that they are uniruled, or to prove Hartshorne conjecture on the characterization of projective space by the positivity of its tangent bundle.

The fact is, to make the trick work you have to have a curve whose space of embedded deformations is big enough. This is easy to achieve in positive characteristic: the curve itself may not deform, but if you compose the inclusion with a sufficiently high power of the Frobenius morphism, the map that you obtain will have enough deformations. To prove the result in characteristic 0, a technique of reduction to characteristic p is used.

1. You can't avoid finite fields if you do complex algebraic geometry, just as you can't avoid (and it is an advantage to utilize) variables that square to zero. Some major techniques work by reduction mod $p$ and there aren't always substitutes that accomplish the same directly in characteristic 0.

2. A lot of algorithms work by reducing modulo many primes and then patching together the results (Chinese remainder theorem). For the analysis of what at happens the primes you need to understand finite fields, and in some cases, p-adic fields.

3. Error-correcting codes have a fundamental significance as constructions of "uniformly distributed" or "well spaced" objects in many dimensions. This is true irrespective of their additional commercial, cryptographic or computational significance. And it happens that the comprehensible part of error-correcting code theory is the part related to linear algebra, number theory, and algebraic geometry over finite fields. To the extent that error-correcting codes are seen to be a model for phenomena in nature or its mathematical idealizations (crystals, packings, coverings, spin glasses, combinatorial phase transitions, etc) then routine use of finite fields is unavoidable, even if you don't care about number theory per se.

The construction of the real field from the rationals using Cauchy sequences can be mimicked to construct other (characteristic zero) complete fields not isometric to the reals. Namely, instead of starting out with the metric defined by the usual (archimedean) absolute value, one can consider the $p$-adic metric ($p$ a fixed prime) and proceed in the same lines. A theorem of Ostrowski says that up to equivalence these are in fact the only ways to complete $\Bbb Q$.

Being complete, the fields ${\Bbb Q}_p$ thus obtained can be used to develop an analytic theory which is similar to the classical theory "over $\Bbb R$" but has some subtle differences.

A source of difference is that the fields ${\Bbb Q}_p$ have--unlikely $\Bbb R$--a natural subring, the radius $1$ sphere centered in $0$, a.k.a. the $p$-adic integers $\Bbb Z_p$, which is a local ring with residue field isomorphic to the field with $p$ elements.

This is a clue to the fact that "$p$-adic analysis" is deeply intertwined with the theory of finite fields.

• On the other hand, one could argue (I don't) that this shows that one doesn't need finite fields of positive characteristic: they are 'really' just the tip of the characteristic-$0$, $p$-adic iceberg. (To be clear, I don't believe this.) May 17, 2017 at 21:33

I do not want to be mean or rude here; but my personal belief is that if you do not appreciate number theory, you are missing the most important topic in mathematics. It is literally the heart of mathematics.

If you really need a concrete example, I can give one from the point of view of algebra. To have an example of a purely non-separable polynomial, you go to char p.

• re: number theory, obviously plenty of eminent mathematicians think it's great, so I'm sure there's something to it, but I just don't see it. Regardless, maybe you should accept that people have different taste rather than try to tiptoe around insulting me. re: your example, if I didn't already care about char p, why would the fact that char p fields have different behavior from char 0 matter? Sure, if 1+1+1=0, weird things happen. Who cares? It's like saying you should study non-unital rings instead of unital ones because unital rings always have maximal ideals. Aug 6, 2010 at 21:48
• @Mike Benfield: Let us disregard the importance of number theory and assume for a moment that it is not a subject worthy of consideration. And let us disregard past insults also. Then the question for you, looking at my answer, is: Do you care about the algebraic fact that non-separable polynomials exist?
– user218
Aug 7, 2010 at 9:37
• (Unfortunately it seems the software doesn't notify me when comments on answers I have commented on appear.) Taking the point of view that I don't care about characteristic p, no, I don't care that non-separable polynomials exist. This is essentially the content of my previous comment. If there's a reason why non-separable polynomials are interesting in themselves to someone who does not already care about char p, I'd like to hear it. Aug 18, 2010 at 13:03