MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $H$ be a hyperellipitic curve of genus $g$ defined over $\mathbb{F}_q$. The Frobenius endomorphism operates on the divisor class group of $H$ and satisfies a characteristic polynomial $P\in\mathbb{Z}[T]$ of degree $2g$. This polynomial $P$ fulfils the equation $$P(T) = T^{2g} L(1/T),$$ i.e. $P$ is the reciprocal polynomial of $L$, where $L(T)$ denotes the numerator of the zeta-function of $H$ over $\mathbb{F}_q$.

Where do I find that statement (for citation)?

FYI: The statement can be found (without a proof) for example, as preprint of T. Lange, page 23, Theorem 2.35. In the case of elliptic curves ($g=1$), it can be found in the book of Koblitz "A course in number theory and cryptography" or Silverman "The Arithmetic of Elliptic Curves".

share|cite|improve this question
Weil, Courbes algébriques et Variétés abéliennes. – Felipe Voloch Nov 8 '11 at 11:56
And, you don't need to assume that the curve is hyperelliptic. – Felipe Voloch Nov 8 '11 at 12:01
E. Artin's thesis (cf. Collected Works) treated the hyperelliptic case, several years prior to Weil. One convenience there is quadratic reciprocity (at least in char not 2). – paul garrett Nov 8 '11 at 13:54
@paul: Artin certainly proved that $L(1)$ is the class number, but I am not sure about the full statement above which requires the action of Frobenius on the Jacobian, which may need the structure of the Jacobian as an abelian variety. – Felipe Voloch Nov 8 '11 at 17:50
@Felipe Ah, yes, what you say is surely right. Indeed, beyond genus 1, people should be clear on the fact that Weil certainly does deserve credit for legitimizing "Jacobians" in an algebraic setting (as opposed to the "classical" setting, whether the Italian school or Abel-Jacobi). – paul garrett Nov 11 '11 at 23:31

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.