For some reason, yesterday was exceptionally good for chameleon spotting in the Zürich rain forest…

which does not mean that geckos were not displaying themselves most beautifully also…

Skip to content
## In color

## Jordan blocks

## Rembrandt van Rijn

## A geometric interpretation of Schinzel’s Hypothesis

## L-functions database!

For some reason, yesterday was exceptionally good for chameleon spotting in the Zürich rain forest…

which does not mean that geckos were not displaying themselves most beautifully also…

Here is yet another definition in mathematics where it seems that conventions vary (almost like the orientation of titles on the spines of books): is a Jordan block an upper-triangular or lower-triangular matrix? In other words, which of the matrices

is a Jordan block of size 2 with respect to the eigenvalue ?

I have the vague impression that most elementary textbooks in Germany (I taught linear algebra last year…) use , but for instance Bourbaki (Algèbre, chapitre VII, page 34, définition 3, in the French edition) uses , and so does Lang’s “Algebra”. Is it then a cultural dichotomy (again, like spines of books)?

I have to admit that I tend towards myself, because I find it much easier to remember a good model for a Jordan block: over the field , take the vector space , and consider the linear map defined by . Then the matrix of with respect to the basis is the Jordan block in its lower-triangular incarnation. The point here (for me) is that passing from to is nicely “inductive”: the formula for the linear map is “independent” of , and the bases for different are also nicely meshed. (In other words, if one finds the Jordan normal form using the classification of modules over principal ideal domains, one is likely to prefer the lower-triangular version that “comes out” more naturally…)

If, like me, you sometimes find yourself lost for minutes on end looking at a painting, or a print, by Rembrandt,

you may find interesting to know that the first five volumes of the definitive catalogue of his paintings are freely available online on the Rembrandt Database website.

Schinzel’s “Hypothesis” for primes is (**update**: actually, not really, see the remark at the end…) the statement that if is an irreducible polynomial (say monic) in , and if there is no “congruence obstruction”, then the sequence of values for integers contains infinitely many primes. More precisely, one expects that the number of integers such that is prime satisfies

for some (explicitly predicted) constant , called sometimes the “singular series”.

Except if has degree one, this problem is very much open. But it makes sense to translate it to a more geometric setting of polynomials over finite fields, and this leads (as is often the case) to problems that are more tractable. The translation is straightforward: instead of , one considers the ring of polynomials over a finite field with elements, instead of , one considers a polynomial , and then the question is to determine asymptotically how many polynomials of given degree are such that is an irreducible polynomial.

The reason the problem becomes more accessible is that there is an algebraic criterion for a polynomial with coefficients in a finite field to be irreducible: if we look at the natural action of the Frobenius automorphism on the set of roots of the polynomial, then is irreducible if and only if this action “is” a cycle of length . This is especially useful for the variant of the Schinzel problem where the *size* of the finite field is varying, whereas the degree of the polynomials remains fixed, since in that case the variation of the action of the Frobenius on the roots of the polynomial is encoded in a group homomorphism from the Galois group of the function field of the parameter space to the symmetric group on letters. (This principle goes back at least to work of S.D. Cohen on Hilbert’s Irreducibility Theorem).

If we apply this principle in the Schinzel setting, this means that we consider specialized polynomials for some fixed polynomial , where runs over polynomials of a fixed degree , but ranges over powers of a fixed prime. “Generically”, the polynomial has some fixed degree , and is squarefree. If we interpret the parameter space geometrically, the content of the previous paragraph is that we have a group homomorphism

from the fundamental group of to the symmetric group. Then the Chebotarev Density Theorem solves, in principle, the problem of counting the number of irreducible specializations in the large limit: essentially (omitting the distinction between geometric and arithmetic fundamental groups), the asymptotic proportion of such that is irreducible converges as to the proportion, in the image of , of the elements that are -cycles in . If the homomorphism is surjective, then this means that the probability that is irreducible is about . This is the expected answer in many cases, because this is also the probability that a random polynomial of degree is irreducible.

All this has been used by a number of people (including Hall, Pollack, Bary-Soroker, and most successfully Entin). However, there is a nice geometric interpretation that I haven’t seen elsewhere. To see it, we go back to and the action of Frobenius on its roots that will determine if is irreducible. A root of is an element such that

where we view as a two-variable polynomial. In other words, is the first coordinate of a point that belongs to the intersection of the graph of in the plane, and the plane affine curve with equation . Since the Frobenius will permute these intersection points in the same way that it permutes the roots of , we can interpret the Schinzel Problem, in that context, as asking about the “variation” of this Galois action as varies and the curve is fixed.

This point of view immediately suggests some generalizations: there is no reason to work over a finite field (any field will do), the base curve (which is implicitly the affine line where polynomials live) can be changed to another (open) curve ; the point at infinity, where polynomials have their single pole, might also be changed to any effective divisor with support the complement of in its smooth projective model (e.g., allowing poles at and on the projective line); and may be any (non-vertical) curve in . For instance (to see that this generalization is not pointless), take any curve , and define . Then the intersection of the graph of a function on and is the set of zeros of . The problem becomes something like figuring out the “generic” Galois group of the splitting field of this set of zeros. (E.g., the Galois group of a complicated elliptic function defined over …)

In fact this special case was (with different motivation and terminology) considered by Katz in his book “Twisted *L*-functions and monodromy” (see Chapter 9). Katz shows that if the (fixed) effective divisor used to define the poles of the functions considered has degree , where is the genus of the smooth projective model of , then the image of Galois is the full symmetric group (his proof is rather nice, using character sums on the Jacobian…)

The general case, on the other hand, does not seem to have been considered before. In the recent note that I’ve written on the subject, I use quite elementary arguments with Lefschetz pencils / Morse-like functions (again inspired by results of Katz and Katz-Rains) to show that in very general conditions, the image of the fundamental group is again the full symmetric group. This gives the asymptotic for this geometric Schinzel problem in this generality over finite fields. (In the classical case, this was essentially done by Entin, though the conditions of applicability are not exactly the same).

I recently gave a talk about this in Berlin, and the slides might be a good introduction to the ideas of the proof for interested readers…

As I mention at the end of those slides, the next step is of course to think about the fixed finite field case, where the degree of the polynomials tends to infinity. This seems, even geometrically, to be quite an interesting problem…

[Update: after I wrote this post, I remembered that in fact the (qualitative) problem of representing primes with one polynomial that I consider here is actually *Bunyakowski’s Problem*, and that the Schinzel Hypothesis is the qualitative statement for a finite set of polynomials… The quantitative versions of both are usually called the Bateman-Horn conjecture. So my terminology is multiply inaccurate…]

People studying automorphic forms, automorphic representations, number fields, diophantine equations, function fields, algebraic curves, equidistribution and many other arithmetic objects (*j’en passe, et des meilleurs*), often end up with some “L-function” to deal with — indeed, probably equally often, with a whole family of them, sometimes not so well-behaved… These objects are fascinating, mystifying, exhilarating, random and possibly spooky. Where they really come from is still a mystery, even with buzzwords aplenty ringing around our ears. But one remarkable thing was already known to Euler and to Riemann: one can compute with L-functions. One impressive research project has been building, for quite a few years, a very sophisticated website presenting enormous amounts of data about L-functions of many kinds. The L-functions Database is now out of its beta status: go see it, and have a look at the list of editors to see who should be thanked for this amazing work!