One of the deepest and most important results in number theory is the **Mordell Conjecture**, proved by Faltings (and independently by Vojta shortly thereafter). It asserts that if is an algebraic curve of genus at least 2, then the set of rational points on is finite. At present, we do not know any effective algorithm (in theory or in practice) to compute the finite set . The techniques of Faltings and Vojta lead in principle to an upper bound for the number of rational points on , but the bound obtained is far from sharp and is difficult to write down explicitly. In his influential paper *Effective Chabauty*, Robert Coleman combined his theory of p-adic integration with an old idea of Chabauty and showed that it led to a simple explicit upper bound for the size of provided that the Mordell-Weil rank of the Jacobian of is not too large. (For a memorial tribute to Coleman, who passed away on March 24, 2014, see this blog post.)

More specifically, around 1940 Claude Chabauty had the idea that in order to prove that is finite, one could try to show that is finite, where is the -adic closure of in for some prime number . Under the assumption that , Chabauty proved that this strategy actually works! Coleman made this argument effective, proving the following important result:

**Theorem **(Coleman): Let be an algebraic curve of genus at least 2. Assume that . Let be a prime at which has good reduction. Then .

This result was extended to curves with bad reduction at by Lorenzini and Tucker, following a suggestion of McCallum (when , see the remarks before 1.11 in Lorenzini-Tucker). A new proof of this bound was subsequently given by McCallum and Poonen. In this refinement, is replaced by the set of smooth points on the special fiber of the minimal proper regular model for over . The strategy of proof is similar to Coleman’s original approach, but there are some extra technical details involving relative dualizing sheaves.

Michael Stoll proved that if in the setting of Coleman’s original theorem then one can do even better: the appearing in Coleman’s result can be replaced by . This was originally a question of Lorenzini-Tucker (see the remarks after 1.11 in their paper).

The “fiber product” of these ideas was worked out recently in an elegant paper by Eric Katz and David Zureick-Brown. They prove the following definitive version of the Chabauty-Coleman bound:

**Theorem** (Katz, Zureick-Brown): Let be an algebraic curve of genus at least 2. Assume that . Let be a prime number, and let be a proper regular model for over . Then .

Katz and Zureick-Brown give an example in their paper where , the above bound is sharp, and no previously known bound is sharp.

Interestingly, the proof of the theorem of Katz and Zureick-Brown relies in a crucial way on the Riemann-Roch theorem for graphs which Norine and I proved in 2007. In order to explain how Riemann-Roch for graphs enters the picture, I will first summarize the combined ideas of Chabauty, Coleman, Lorenzini-Tucker, and McCallum-Poonen. (Here I will follow closely the wonderfully lucid article by McCallum and Poonen).

Let be an algebraic curve and let be its Jacobian. There is a canonical bilinear pairing , denoted , which is uniquely characterized by the following two properties:

(1) For fixed , the map given by is a group homomorphism.

(2) On some open subgroup of , one can compute for by formally integrating power series in suitable local coordinates.

Now for and , we define , where is the differential corresponding to under the canonical isomorphism between and .

If have the same reduction in some proper regular model for , then can be calculated by expanding in a power series with respect to a local parameter on and formally integrating.

One deduces from this formalism that if we fix and define

then . In particular, if then .

Fix a nonzero differential . Since is a regular model, each point of reduces to a point of . The set of points of reducing to a given point of (which one calls a (nonsingular) *residue class*) naturally has the structure of an open p-adic disc.

Fix a residue class and a point , and let be a local parameter on at .

On the disc , can be expressed as a power series by

integrating a formal power series expansion for relative to the local parameter term-by-term (with constant term 0). Assuming that , Coleman observed that the Newton polygon of coincides with the Newton polygon of ; the point is that the denominators which crop up when one integrates do not change the shape of the Newton polygon as long as is large enough.

By assumption, if then for all . Accordingly, we can bound the number of rational points on by partitioning into residue classes and bounding the number of zeros of on each on each residue class. The Newton polygon argument above, together with Hensel’s Lemma, shows that if is the residue class of then

where is obtained by reducing (suitably rescaled so that its reduction is well-defined and nonzero) to the component containing .

Summing over all residue classes and using the fact that (which follows from the Riemann-Roch theorem when is smooth), we obtain the Lorenzini-Tucker and McCallum-Poonen bound . (Coleman’s original bound was the special case of this inequality when has good reduction at .)

Michael Stoll noticed that when has good reduction at , one can improve to in Coleman’s original bound by a suitable use of Clifford’s inequality. The key idea is that instead of choosing just one differential , as we did in the argument above, we should choose the best possible differential for each residue class. Doing so and following the above chain of reasoning gives us the bound where .

Let and set . Then and are both linearly equivalent to effective divisors, so Clifford’s inequality implies that On the other hand, by the semicontinuity of , we have Combining these two inequalities gives and therefore as desired. We have thus proved:

**Theorem **(Stoll): Let be an algebraic curve of genus at least 2. Assume that . Let be a prime at which has good reduction. Then .

Now, what to do if has bad reduction at ? Well, first of all, Katz and Zureick-Brown prove a lemma to the effect that one can reduce to the case where is semistable; the point is that extending scalars only makes the degree of bigger. However, it is well-known that Clifford’s inequality fails in general for singular curves, even semistable ones, so another idea is needed. In May 2011, I suggested to David Zureick-Brown that one could potentially use Clifford’s inequality for graphs (proved in my paper with Norine) to carry out Stoll’s idea in the case of totally degenerate semistable reduction. It turns out that this works! We will explain the idea, and then briefly indicate how Katz and Zureick-Brown handle the more general case of mixed bad reduction.

Assume for the moment that is a proper regular semistable model for which is *totally degenerate*, i.e., every irreducible component of is a smooth rational curve. Equivalently, if is the dual graph of (whose vertices correspond to the irreducible components and edges correspond to crossings between these components), then is totally degenerate if and only if the genus of equals the genus of .

There is a divisor on which records which irreducible component of a given point lies on. Clifford’s theorem for graphs implies that and a variant of the Specialization Lemma from this paper (the analogue in this context of semicontinuity) implies that Combining these inequalities yields as before.

The general case, where is a proper regular semistable model for which is not assumed to be totally degenerate, follows similarly by replacing Clifford’s inequality for graphs with an inequality which can be deduced formally from the Riemann-Roch theorem for metrized complexes of curves which Amini and I recently proved. (Alternatively, one can use the earlier Riemann-Roch theorem for vertex-weighted graphs due to Amini and Caporaso.) One also need a suitable extension of the Specialization Lemma to this context, c.f. Theorem 5.11 in Amini-Baker. For more details, see the paper of Katz and Zureick-Brown, Section 5.5 in my paper with Amini, or these slides by David Zureick-Brown.

**Concluding remarks:**

1. The -adic integration pairing on discussed above differs in the bad reduction case from more general theories of -adic integration, e.g. the theory constructed recently by Berkovich. Indeed, the latter is multi-valued and has non-trivial periods while the above pairing is uniquely defined. However, the pairing discussed here (which uses the Jacobian of to kill off polyvalency) seems to be better suited at the present time for computations and for applications of the above sort.

2. The Riemann-Roch theorem for metrized complexes of curves alluded to above includes as special cases both Riemann-Roch for graphs and Riemann-Roch for algebraic curves. I plan to write a future blog post explaining some other applications of the theory of metrized complexes of curves, which include a generalization of the Eisenbud-Harris theory of limit linear series to semistable curves not of compact type.

3. The Chabauty-Coleman bounds discussed in this post all have analogues for number fields other than , and (in a slightly messier form) for primes which are less than .

4. Michael Stoll has an exciting recent preprint in which he uses singular residue classes (which look -adic analytically like open annuli rather than open discs) on semistable curves to refine the method of Chabauty-Coleman, showing that there is a bound depending only on and for the number of -rational points on a hyperelliptic curve of genus over a number field such that the Mordell-Weil rank of its Jacobian is at most . (If , an explicit bound is .) Integrals of holomorphic 1-forms on annuli generally include a -adic logarithm term (coming from the integral of ) which is hard to control, and there is also a hard-to-control error term coming from comparing the two different kinds of integrals mentioned in Remark 1 above, but Stoll makes the clever observation that if then one can use three independent 1-forms in the space to cancel out these two kinds of problem terms.

5. One can also apply the Chabauty-Coleman method to symmetric powers of curves, obtaining bounds for the number of rational points on an algebraic curve which are defined over a number field of degree at most . See for example this paper by Samir Siksek, as well as forthcoming work of Bjorn Poonen’s Ph.D. student Jennifer Park (which makes crucial use of my Georgia Tech colleague Joe Rabinoff‘s thesis work on tropical analytic geometry). I have a particular fondness for this topic; when I participated in the Arizona Winter School as a graduate student in 1999, our student group (which included Manjul Bhargava) computed all the quadratic points on a specific genus 3 hyperelliptic curve. And my first published paper applied the Coleman-Chabauty method to symmetric powers of a modular curve.

6. Bjorn Poonen and Michael Stoll have a recent preprint in which they prove that for , a positive fraction of hyperelliptic curves of odd degree over have only one rational point, the point at infinity. They also prove a lower bound on this fraction that tends to 1 as the genus tends to infinity. Their method combines a refinement of the Chabauty-Coleman method (based on an old idea of McCallum) with the Bhargava-Gross equidistribution theorem for nonzero 2-Selmer group elements.

A few comments that came up in Banff, but that didn’t make it to my slides:

The rank < genus condition is restrictive, but not too restrictive — one expects that the average rank is 1/2 (i.e. 100% of the time the rank is either 0 or 1). The rank is 1 infinitely often as well. (E.g. Jac X could certainly be a product of rank 1 elliptic curves, or X could have a large number of points.) There is some progress: Bhargava and Gross prove that the average rank is at most 1.5 (http://www.math.harvard.edu/~gross/preprints/stable23.pdf).

In practice too, when a collection of curves arises in the solution to some problem, almost all, but not usually literally all, of them have rank < g. For instance, Smart gave a list of genus 2 curves with good reduction outside of two. There are around 400 of these; all have rank at most 2, and only a few have rank equal to 2.

Its also unclear whether ranks are unbounded. The record for elliptic curves is 28; I'm not sure what the record is for higher genus curves, but Michael Stoll found a genus 2 curve with simple Jacobian of rank 20.