E. Kowalski's blog

Comments on mathematics, mostly.

In color

leave a comment

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

Chameleon

Chameleon

Chameleon

Chameleon

Chameleon tail

Chameleon tail

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

Gecko

Gecko

Written by

August 8th, 2016 at 7:47 pm

Posted in Animals,Switzerland

Jordan blocks

3 comments

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

A_1=\begin{pmatrix}\alpha & 1\\0&\alpha\end{pmatrix},\quad\quad A_2=\begin{pmatrix} \alpha & 0\\1&\alpha\end{pmatrix}

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

I have the vague impression that most elementary textbooks in Germany (I taught linear algebra last year…) use A_1, but for instance Bourbaki (Algèbre, chapitre VII, page 34, définition 3, in the French edition) uses A_2, 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 A_2 myself, because I find it much easier to remember a good model for a Jordan block: over the field K, take the vector space V=K[X]/X^nK[X], and consider the linear map u\colon V\to V defined by u(P)=\alpha P+XP. Then the matrix of u with respect to the basis (1,X,\ldots,X^{n-1}) is the Jordan block in its lower-triangular incarnation. The point here (for me) is that passing from n to n+1 is nicely “inductive”: the formula for the linear map u is “independent” of n, and the bases for different n 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…)

Written by

August 5th, 2016 at 8:28 pm

Posted in Mathematics

Rembrandt van Rijn

leave a comment

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

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.

Written by

August 4th, 2016 at 1:18 pm

Posted in Arts

A geometric interpretation of Schinzel’s Hypothesis

3 comments

Schinzel’s “Hypothesis” for primes is (update: actually, not really, see the remark at the end…) the statement that if F is an irreducible polynomial (say monic) in \mathbf{Z}[Y], and if there is no “congruence obstruction”, then the sequence of values F(n) for integers n\geq 1 contains infinitely many primes. More precisely, one expects that the number \pi_F(x) of integers n\leq X such that F(n) is prime satisfies
\pi_F(x)\sim c_F\frac{x}{\log x},
for some (explicitly predicted) constant c_F>0, called sometimes the “singular series”.

Except if F 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 \mathbf{Z}, one considers the ring A=\mathbf{F}_q[X] of polynomials over a finite field \mathbf{F}_q with q elements, instead of F, one considers a polynomial F\in A[Y]=\mathbf{F}_q[X,Y], and then the question is to determine asymptotically how many polynomials f\in A of given degree n\geq 1 are such that F(f)\in A is an irreducible polynomial.

The reason the problem becomes more accessible is that there is an algebraic criterion for a polynomial f with coefficients in a finite field \mathbf{F}_q to be irreducible: if we look at the natural action of the Frobenius automorphism x\mapsto x^q on the set of roots of the polynomial, then f is irreducible if and only if this action “is” a cycle of length \deg(f). This is especially useful for the variant of the Schinzel problem where the size of the finite field is varying, whereas the degree n of the polynomials f 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 n 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 F(f) for some fixed polynomial F\in A[Y]=\mathbf{F}_q[X][Y], where f runs over polynomials of a fixed degree d\geq 1, but q ranges over powers of a fixed prime. “Generically”, the polynomial F(f) has some fixed degree n, and is squarefree. If we interpret the parameter space X_d geometrically, the content of the previous paragraph is that we have a group homomorphism
\rho\colon \pi_1(X_d)\to \mathfrak{S}_n,
from the fundamental group of X_d to the symmetric group. Then the Chebotarev Density Theorem solves, in principle, the problem of counting the number of irreducible specializations in the large q limit: essentially (omitting the distinction between geometric and arithmetic fundamental groups), the asymptotic proportion of f\in X_d(\mathbf{F}_q) such that F(f) is irreducible converges as q\to+\infty to the proportion, in the image of \rho, of the elements that are n-cycles in \mathfrak{S}_n. If the homomorphism \rho is surjective, then this means that the probability that F(f) is irreducible is about 1/n. This is the expected answer in many cases, because this is also the probability that a random polynomial of degree n 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 F(f) and the action of Frobenius on its roots that will determine if F(f) is irreducible. A root of F(f) is an element x such that
F(f)(x)=F(x,f(x))=0
where we view F as a two-variable polynomial. In other words, x is the first coordinate of a point (x,f(x)) that belongs to the intersection of the graph of f in the plane, and the plane affine curve S with equation F(x,y)=0. Since the Frobenius will permute these intersection points in the same way that it permutes the roots of F(f), we can interpret the Schinzel Problem, in that context, as asking about the “variation” of this Galois action as f varies and the curve S is fixed.

Schinzel Problem

Schinzel Problem

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 U; the point at infinity, where polynomials have their single pole, might also be changed to any effective divisor with support the complement of U in its smooth projective model (e.g., allowing poles at 0 and \infty on the projective line); and S may be any (non-vertical) curve in U\times\mathbf{A}^1. For instance (to see that this generalization is not pointless), take any curve U, and define S=U\times\{0\}. Then the intersection of the graph of a function f on U and S is the set of zeros of f. 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 \mathbf{Q}…)

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 \geq 2g+1, where g is the genus of the smooth projective model of U, 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…

Leibnitz Room

Leibnitz Room

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…]

Written by

June 5th, 2016 at 12:29 pm

Posted in Mathematics

L-functions database!

leave a comment

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!

Written by

May 9th, 2016 at 9:46 pm