This is going to be a fairly vague question but hopefully it will have concrete answers:

There is this recurrent phenomenon in the arithmetic of curves (possibly stacky,affine) where there is a "phase transition" associated with the euler characteristic being positive, zero or negative.

For instance, Mordell's conjecture (Falting's theorem) states that there are finitely many integral points if the euler characteristic is negative. In fact, this theorem is true not only for affine curves but also for stacky curves.

Another example is the failure of local-global principles for integral points for euler characteristic $\leq 0$.

Question: Is there some key set of features in the "hyperbolic" case that come up often in proofs?

Let me illustrate the kind of answer I am looking for with reference to the complex case. In this case, negative euler characteristic corresponds exactly to having the hyperbolic disc as the universal covering space. So a very common argument is that given a map to a hyperbolic curve, we can lift it in some appropriate sense to the universal cover and then by Liouville, this lift will often be constant.

Is there an analogous collection of arithmetic hyperbolic techniques to keep in mind?

  • 2
    $\begingroup$ I am not entirely sure what you are looking for but a powerful tool in arithmetic hyperbolicity is Diophantine approximation and Nevanlinna theory. Vojta has some nice notes about (math.berkeley.edu/~vojta/cime/cime.pdf). Another useful theorem which is used in Diophantine approximation is the Schmidt Subspace Theorem. Yuri Bilu has a wonderful Bourbaki survey about this theorem and its applications (numdam.org/article/AST_2008__317__1_0.pdf). Finally, Ariyan Javanpeykar has a nice survey about hyperbolicity (arxiv.org/pdf/2002.11981.pdf). Hope this is helpful! $\endgroup$ – Jackson Morrow Jun 9 '20 at 17:04
  • $\begingroup$ I am not entirely sure what I am looking for either but your links seem to be along the right lines! Thank you! $\endgroup$ – Asvin Jun 9 '20 at 18:13

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.