The Weil bound for curves over finite fields

The purpose of this post is to describe an application of the general intersection theory machinery (for curves on surfaces) developed in the previous posts: the Weil bound on points on a curve over a finite field.

1. Statement of the Weil bound

Let be a smooth, projective, geometrically irreducible curve over of genus . Then the Weil bound states that:

Weil’s proof of this bound is based on intersection theory on the surface . More precisely, let

so that is a smooth, connected, projective curve. It comes with a Frobenius map

of -varieties: in projective coordinates the Frobenius runs

In particular, the map has degree . One has

representing the -valued points of as the fixed points of the Frobenius (Galois) action on the -valued points. So the strategy is to count fixed points, using intersection theory.

Using the (later) theory of -adic cohomology, one represents the number of fixed points of the Frobenius as the Lefschetz number of : the action of on and give the terms . The fact that (remaining) action of on the -dimensional vector space can be bounded is one of the Weil conjectures, proved by Deligne for general varieties: here it states that has eigenvalues which are algebraic integers all of whose conjugates have absolute value .

 

Finishing the proof of Lazard’s theorem

This is the third in the series of posts intended to work through the proof of Lazard’s theorem, that the Lazard ring classifying the universal formal group law is actually a polynomial ring on a countable set of generators. In the first post, we reduced the result to an elementary but tricky “symmetric 2-cocycle lemma.” In the previous post, we proved most of the symmetric 2-cocycle lemma, except in characteristic zero. The case of characteristic zero is not harder than the cases we handled (it’s easier), but in this post we’ll complete the proof of that case by exhibiting a very direct construction of logarithms in characteristic zero. Next, I’ll describe an application in Lazard’s original paper, on “approximate” formal group laws.

After this, I’m going to try to move back to topology, and describe the proof of Quillen’s theorem on the formal group law of complex cobordism. The purely algebraic calculations of the past couple of posts will be necessary, though.

1. Formal group laws in characteristic zero

The last step missing in the proof of Lazard’s theorem was the claim that the map

classifying the formal group law obtained from the additive one by “change-of-coordinates” by the exponential series is an isomorphism mod torsion. In other words, we have an isomorphism

In fact, we didn’t really need this: we could have proved the homological 2-cocycle lemma in all cases, instead of just the finite field case, and it would have been easier. But I’d like to emphasize that the result is really something elementary here. In fact, what it is saying is that to give a formal group law over a -algebra is equivalent to giving a choice of series .

Definition 1 An exponential for a formal group law is a power series such that

The inverse power series is called the logarithm.

That is, a logarithm is an isomorphism of with the additive formal group law.

So another way of phrasing this result is that:

Proposition 2 A formal group law over a -algebra has a unique logarithm (i.e., is uniquely isomorphic to the additive one).

 

Lazard’s theorem II

We are in the middle of proving an important result of Lazard:

Theorem 1 The Lazard ring over which the universal formal group law is defined is a polynomial ring in variables of degree .

The fact that the Lazard ring is polynomial implies a number of results which are not a priori obvious: for instance, it shows that given a surjection of rings , then any formal group law on can be lifted to one over .

We began the proof of Lazard’s theorem last time: we produced a map

classifying the formal group law obtained from the additive one by the “change of coordinates” . We claimed that the map on indecomposables was injective, and that, in fact the image in the indecomposables of could be determined completely. I won’t get into the details of this (it was all in the previous post), because the purpose of this post is to prove a result to which we reduced last time.

Let be an abelian group. A symmetric 2-cocycle is a “polynomial” with the properties:

and

These symmetric 2-cocycles come up when one tries to classify formal group laws over the ring , as we saw last time: in fact, we can think of them as “deformations” of the additive formal group law.

The main lemma which we stated last time was the following:

Theorem 2 (Symmetric 2-cocycle lemma) A homogeneous symmetric 2-cocycle of degree is a multiple of where if is not a power of a prime, and if .

For a direct combinatorial proof of this theorem, see Lurie’s notes. I want to describe a longer homological proof, which is apparently due to Mike Hopkins and which appears in the COCTALOS notes. The strategy is to interpret these symmetric 2-cocycles as actual cocycles in a cobar complex computing an group. Then, the strategy is to compute this group independently.

This argument is somewhat longer than the combinatorial one, but it has the benefit (for me) of engaging with some homological algebra (which I need to learn more about), as well as potentially generalizing in other directions. 

 

The Lazard ring

After describing the computation of , I’d now like to handle the remaining half of the machinery that goes into Quillen’s theorem: the structure of the universal formal group law.

Let be a (commutative) ring. Recall that a formal group law (commutative and one-dimensional) is a power series such that

1. .
2. .
3. .

It is automatic from this by a successive approximation argument that there exists an inverse power series such that .

In particular, has the property that for any -algebra , the nilpotent elements of become an abelian group with addition given by .

A key observation is that, given , to specify a formal group law amounts to specifying a countable collection of elements to define the power series . These are required to satisfy various polynomial constraints to ensure that the formal group identities hold. Consequently:

Theorem 1 There exists a universal ring together with a formal group law on , such that any FGL on another ring determines a unique map carrying .

 

The classical zero-free region for L-functions

Apologies for the lack of posts lately; it’s been a busy semester. This post is essentially my notes for a talk I gave in my analytic number theory class.

Our goal is to obtain bounds on the distribution of prime numbers, that is, on functions of the form . The closely related function

turns out to be amenable to study by analytic means; here is the von Mangolt function,

Bounds on will imply corresponding bounds on by fairly straightforward arguments. For instance, the prime number theorem is equivalent to .

The function is naturally connected to the -function in view of the formula

In other words, is the Dirichlet series associated to the function . Using the theory of Mellin inversion, we can recover partial sums by integration of along a vertical line. That is, we have

at least for , in which case the integral converges. Under hypotheses on the poles of (equivalently, on the zeros of ), we can shift the contour appropriately, and estimate the integral to derive the prime number theorem.

 

l-adic cohomology and exponential sums

I’d like to explain what I think is a pretty piece of mathematics.

Deligne’s proof of the Weil conjectures, and his strengthenings of them, in his epic paper “La conjecture de Weil II” have had, needless to say, many applications—far more than the initial paper where he proved the last of the Weil conjectures. One of the applications is to bounding exponential sums. I’d like to begin sketching the idea today. I learned this from the article “Sommes trigonometriques” in SGA 4.5, which is very fun to read.

1. The trace formula

Let’s say you have some variety over a finite field , say separated. Suppose you have a -adic sheaf on . I’ll denote by “dropping the zero” the base change to , so denotes the pull-back to .

For each point , we can take the “geometric stalk” (or ) which is given by finding a map hitting , and pulling back to it. This “stalk” is automatically equivariant with respect to the Galois group for the residue field, and as a result we can compute the trace of the geometric Frobenius of —that’s the inverse of the usual Frobenius—and take its trace on .

So the intuition here is that we’re taking local data of the sheaf : just the trace of its Frobenius at each point. One interesting interpretation of this procedure was discussed on this MO question: namely, the process is analogous to “integration over a contour.” Here the contour is , which has cohomological dimension one and is thus the étale version of a curve.

Now, the trace formula says that the local data of these traces all pieces into a simple piece of global data, which is the compactly supported cohomology.

 

The Fourier-Deligne transform for l-adic sheaves

The topic of this post is a curious functor, discovered by Deligne, on the category of sheaves over the affine line, which is a “sheafification” of the Fourier transform for functions.

Recall that the classical Fourier transform is an almost-involution of the Hilbert space . We shall now discuss the Fourier-Deligne transform, which is an almost-involution of the bounded derived category of -adic sheaves, . The Fourier transform is defined by multiplying a function with a character (which depends on a parameter) and integrating. Analogously, the Fourier-Deligne transform will twist an element of by a character depending on a parameter, and then take the cohomology.

More precisely, consider the following: let be a LCA group, its dual. We have a canonical character on given by evaluation. To construct the Fourier transform , we start with a function . We pull back to , multiply by the evaluation character defined above, and integrate along fibers to give a function on .

Everything we’ve done here has a sheaf-theoretic analog, however: pulling back a function corresponds to the functorial pull-back of sheaves, multiplication by a character corresponds to tensoring with a suitable line bundle, and integration along fibers corresponds to the lower shriek push-forward. Much of the classical formalism goes over to the sheaf-theoretic case. One can prove an “inversion formula” analogous to the Fourier inversion formula (with a Tate twist).

Why should we care? Well, Laumon interpreted the Fourier transform as a suitable “deformation” of the cohomology of a suitable sheaf on the affine line, and used it to give a simplified proof of the main results of Weil II, without using scary things like vanishing cycles and Picard-Lefschetz theory. The Fourier transform also behaves very well with respect to perverse sheaves: it is an auto-equivalence of the category of perverse sheaves, because of the careful way in which it is calibrated. Its careful use can be used to simplify some of the arguments in BBD that also rely on other scary things.

 

Tsen’s theorem

I’d like to take a quick (one-post) break from simplicial methods. This summer, I will be studying étale cohomology and the proofs of the Weil conjectures through the HCRP program. I have currently been going through the basic computations in étale cohomology, and, to help myself understand one point better, would like to mention a very pretty and elementary argument I recently learned from Johan de Jong’s course notes on the subject (which are a chapter in the stacks project).

1. Motivation via étale cohomology

When doing the basic computations of the étale cohomology of curves, one of the important steps is the computation of the sheaf (that is, the multiplicative group of units), and in doing this one needs to know the cohomology of the generic point. That is, one needs to compute

where for a field of transcendence degree one over the algebraically closed ground field, and the “et” subscript means étale cohomology. Now, ultimately, whenever you have the étale cohomology of a field, it turns out to be the same as Galois cohomology. In other words, if , then the small étale site of is equivalent to the site of continuous -sets, and consequently the category of abelian sheaves on this site turns out to be equivalent to the category of continuous -modules. Taking the étale cohomology of this sheaf then turns out to be the same as taking the group cohomology of the associated -module. So, if you’re interested in étale cohomology, then you’re interested in Galois cohomology. In particular, you are interested in things like group cohomologies of the form

 

Matthew Emerton posts really good answers

I asked a question on what Tate’s thesis was really about on math.SE, and Matthew Emerton has posted a very thoughtful and detailed answer. You should go read it. Actually, I recommend looking at all his answers on the website, which are easily some of the best answers there.

(Apparently I am not the first person to notice this.)

 

GILA 3: Probabilistic algorithms for primality testing

Last time, we showed that prime numbers admit succinct certificates. Given a number containing bits, one could produce a “proof” that the number is prime in polynomial in space. In other words, the language containing all primes (represented in the binary expansion, say) lies in the complexity class .

In practice, though, being in does not give a good way of solving the problem by itself; for that, we want the problem to be in . Perhaps, though, that is too strict. One relaxation is to consider classes of problems that can be solved by randomized algorithms that run in polynomial time—randomized meaning that the right output comes out with high probability, that is. This is the class : by definition, something belongs to the class if there is a polynomial-time nondeterministic Turing machine such that on any computation, at least of the computation tree leads to the right answer. So the idea of is that, to decide whether a string belongs to our language , we generate a bunch of random bits and then run a deterministic algorithm on the string together with the random bits. Most likely, if the random bits were not too bad, we will get the right answer.

In practice, people tend to believe that while . But, in any case, probabilistic algorithms may be more efficient than deterministic ones, so even if the former equality holds they are interesting.

Today, I want to describe a probabilistic algorithm for testing whether a number is prime. As before, the algorithm will rely on a little elementary number theory.