Traces of high powers of the Frobenius class in the moduli space of hyperelliptic curves
- Iakovos Jake Chinis1Email author
Received: 4 November 2015
Accepted: 3 May 2016
Published: 1 August 2016
Abstract
The Zeta function of a curve C over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix \(\Theta _C\). Following the work of Rudnick (Acta Arith. 143(1), 81–99, 2010), we compute the expected value of \({{\mathrm{tr}}}(\Theta _C^n)\) over the moduli space of hyperelliptic curves of genus g, over a fixed finite field \({\mathbb F}_q\), in the limit of large genus. As an application, we compute the expected value of the number of points on C in \({\mathbb F}_{q^n}\) as the genus tends to infinity. We also look at biases in both expected values for small values of n.
Keywords
1 Introduction
Remark 1
One can show that \(\overline{C}_Q\) consists of two affine components: the first is \(C_Q\) itself and the second is the curve given by \(y^2=x^{2g+2}Q(\frac{1}{x})\). In fact, \(C_Q\) is isomorphic to \(\overline{C}_Q\cap \{x_0\ne 0\}\) and taking \(x_0=0\) yields the point at infinity; we refer the reader to Silverman [8].
In this paper, we study the traces of high powers of the Frobenius class of \(C\in {\mathscr {H}}_g\) over a fixed finite field \({\mathbb F}_q\), of odd cardinality q, as g tends to infinity. In particular, we concern ourselves with the expected values \(\langle {{\mathrm{tr}}}(\Theta _{C}^n) \rangle _{{\mathscr {H}}_g}\) as \(g \rightarrow \infty \) and we compare our work with the Random Matrix results of [3].
Theorem 1.1
Corollary 1.2
Corollary 1.3
- (i)If n is odd, then$$\begin{aligned} \langle \#C({\mathbb F}_{q^n}) \rangle _{{\mathscr {H}}_g}=q^n+1. \end{aligned}$$
- (ii)If n is even, then$$\begin{aligned} \langle \#C({\mathbb F}_{q^n}) \rangle _{{\mathscr {H}}_g} \sim q^n+q^\frac{n}{2}+1-\sum _{\begin{array}{c} {\deg (P)|\frac{n}{2}}\\ {\deg (P)\ne 1} \end{array}}\frac{\deg (P)}{|P|+1}. \end{aligned}$$
Once again, our results for odd n are exact and hold for all values of g. Although we continue to get deviations from the RMT results for even \(n\ge 4\), our results hold for \(n=2\) and our deviations are different from those obtained in [7].
Another approach to computing \(\langle \#C({\mathbb F}_{q^n}) \rangle _{{\mathscr {H}}_g}\) is the work of Alzahrani [1] which uses the distribution of the \({\mathbb F}_q\)-points of \({\mathscr {H}}_g\) in \({\mathbb F}_{q^n}\). Using these methods, the results of Alzahrani agree with the Corollary above (albeit with a larger error term).
Finally, we would like to mention that some of the computations done in Sect 2.1 through 3.2 were done independently by Lorenzo et al. in their study of statistics for biquadratic curves; their work is collected in [5].
2 Preliminaries
In this section, we establish some notation, we introduce the main results of [7], and we prove some preliminary results. Since the majority of what follows is based off of the work in [7], we use the same notation and list important results for the convenience of the reader. We use [6] as a general reference.
Throughout this paper, \({\mathbb F}_q\) is a fixed finite field of odd cardinality q, P is solely used to represent monic irreducible polynomials in \({\mathbb F}_q[x]\), and Q will be used to denote squarefree polynomials of degree \(2g+1\) or \(2g+2\) with \(g\ge 1\). Unless stated otherwise, sums/products are over monic elements in \({\mathbb F}_q[x]\) (under the given restrictions). For example, sums/products indexed by P are over all monic irreducible polynomials in \({\mathbb F}_q[x]\), where as sums/products indexed by \(\deg (f)=n\) are over all monic polynomials of degree n in \({\mathbb F}_q[x]\). In the case where a sum involves elements \(B\in {\mathbb F}_q[x]\) that are not necessarily monic, we write the sum over B n.n.m..
Lemma 2.1
- (i)For \(n=1\),$$\begin{aligned} \sigma _1(0)=1, \quad \sigma _1(\alpha )=1-q \quad \,\forall \alpha \ge 1. \end{aligned}$$(15)
- (ii)If \(n\ge 2\), then$$\begin{aligned} \sigma _n(\alpha )=\left\{ \begin{array}{lll} 1, &{} \quad \alpha \equiv 0\mod n,\\ -q, &{} \quad \alpha \equiv 1\mod n,\\ 0, &{} \quad \text{ otherwise. }\\ \end{array}\right. \end{aligned}$$(16)
Lemma 2.2
- (i)n odd, \(0\le \beta \le n-1\):and$$\begin{aligned} S(\beta ;n)=q^{\beta -\frac{n-1}{2}}S(n-1-\beta ;n) \end{aligned}$$(17)$$\begin{aligned} S(n-1;n)=\pi _q(n)q^{\frac{n-1}{2}}. \end{aligned}$$(18)
- (ii)n even, \(1\le \beta \le n-2\):and$$\begin{aligned} S(\beta ;n)=q^{\beta -\frac{n}{2}}\Big (-S(n-1-\beta ;n)+(q-1)\sum _{j=0}^{n-\beta -2}S(j;n)\Big ) \end{aligned}$$(19)$$\begin{aligned} S(n-1;n)=-\pi _q(n)q^{\frac{n-2}{2}}. \end{aligned}$$(20)
Lemma 2.3
2.1 Improved estimate for \(S(\beta ;n)\) when \(\beta \) is even
Initially, we concern ourselves with \(\langle {{\mathrm{tr}}}(\Theta _{C_Q}^n) \rangle _{{\mathcal F}_{2g+2}}\); in doing so, we need to estimate \(S(\beta ;n)\) for when \(\beta \) is even (see Sect. 3.1.1 and 3.1.3). The following theorem makes use of Lemmas 2.2 and 2.3; it is the analogous result to Proposition 9 of [7] (since Rudnick considers the average value over \({\mathcal F}_{2g+1}\), estimates for \(S(\beta ;n)\) in [7] involve \(\beta \) odd). Furthermore, this result will allow us to compute \(\langle {{\mathrm{tr}}}(\Theta _{C_Q}^n) \rangle _{{\mathcal F}_{2g+2}}\) for n near 4g (just as Proposition 9 in [7] allows Rudnick to compute \(\langle {{\mathrm{tr}}}(\Theta _{C_Q}^n) \rangle _{{\mathcal F}_{2g+1}}\) for n near 4g).
Theorem 2.4
Remarks 1
- (i)
The result above is essentially the same as Proposition 9 in [7] with one additonal term; namely, \(\pi _q(n)q^\frac{\beta }{2}\).
- (ii)As Rudnick points out in [7], the main tool in proving Theorem 2.4 is duality; it allows us to improve the error term in estimates of \(S(\beta ;n)\) and to get results holding for n near 4g and not only for n near 2g. We would like to mention that the duality present in our character sums \(S(\beta ;n)\) is based on the functional equation (2)for prime characters \(\chi _P\) (see the proof of Proposition 7 in [7]).$$\begin{aligned} L^*(u,\chi _P)=(uq^2)^{\lfloor {\frac{\deg (P)-1}{2}}\rfloor } L^*\left( \frac{1}{qu},\chi _P\right) , \end{aligned}$$
Proof
- (i)If n is odd, we apply (17) to \(S(\beta ;n)\) and then apply (21) to \(S(n-1-\beta ;n)\):$$\begin{aligned} S(\beta ;n)= & {} q^{\beta -\frac{n-1}{2}}S(n-1-\beta ;n)\\= & {} q^{\beta -\frac{n-1}{2}}\left( \pi _q(n)q^\frac{n-1-\beta }{2}+O\left( \frac{n-1-\beta }{n}q^{\frac{n}{2}+n-1-\beta }\right) \right) \\= & {} \pi _q(n)q^{\frac{\beta }{2}}+O(q^n). \end{aligned}$$
- (ii)If n is even, we apply (19) to \(S(\beta ;n)\) and then apply (21) to \(S(n-1-\beta ;n)\):$$\begin{aligned} S(\beta ;n)= & {} q^{\beta -\frac{n}{2}}\left( -S(n-1-\beta ;n)+(q-1)\sum _{j=0}^{n-\beta -2}S(j;n)\right) \\= & {} q^{\beta -\frac{n}{2}}\left( O\Big (\frac{n-1-\beta }{n}q^{\frac{n}{2}+n-1-\beta }\right) \\&+(q-1)\sum _{j=0}^{n-\beta -2} \Big (\eta _j\pi _q(n)q^{\frac{j}{2}}+O(\frac{j}{n}q^{\frac{n}{2}+j})\Big )\Biggr ). \end{aligned}$$
3 Computing \(\langle \hbox {tr}(\Theta _{C_Q}^n) \rangle _{\mathcal {F}_{2g+1} \cup \mathcal {F}_{2g+2}}\)
In this section, we compute \(\langle {{\mathrm{tr}}}(\Theta _{C_Q}^n) \rangle _{{\mathcal F}_{2g+1} \cup {\mathcal F}_{2g+2}}\) by first computing \(\langle {{\mathrm{tr}}}(\Theta _{C_Q}^n) \rangle _{{\mathcal F}_{2g+2}}\) and then combining that result with Rudnick’s for \(\langle {{\mathrm{tr}}}(\Theta _{C_Q}^n) \rangle _{{\mathcal F}_{2g+1}}.\)
3.1 Computing \(\hbox {tr}(\Theta _{C_Q}^n)\) for \(Q\in \mathcal {F}_{2g+2}\)
In the next three sections, we continue to use Rudnick’s methods in order to compute \({\mathcal P}_n\), \(\square _n\), and \({\mathbb H}_n\). Not surprinsingly, our results will only slightly differ from Rudnick’s. The addition of \(-1/q^\frac{n}{2}\) from (9) will be the main difference. We will also have different cut-off points for n when estimating \({\mathcal P}_n\) (see Sect. 5.3 of [7]).
3.1.1 Contribution of the primes: \(\mathcal {P}_n\)
- (i)\(n\le g+1:\) If \(S(\beta ;n)\ne 0\), then \(\beta <n\); since \(\beta \) is even,Then \(S(\beta ;n)\ll \frac{\beta }{n}q^{n+\beta },\) which implies that$$\begin{aligned} S(\beta ;n)= & {} \pi _q(n)q^{\frac{\beta }{2}}+O \left( \frac{\beta }{n}q^{\beta +\frac{n}{2}}\right) \\= & {} \frac{q^{n+\frac{\beta }{2}}}{n}+O \Bigg (\frac{q^{\frac{n}{2}+\frac{\beta }{2}}}{n}\Bigg )+O \Bigg (\frac{\beta }{n}q^{\beta +\frac{n}{2}}\Bigg ). \end{aligned}$$$$\begin{aligned} \langle {\mathcal P}_n\rangle _{{\mathcal F}_{2g+2}}\ll & {} \frac{n}{q^{2g+\frac{n}{2}}}\sum _{\beta <n}\frac{\beta }{n}q^{\beta +n}\\\ll & {} \frac{n}{q^{2g+\frac{n}{2}}}q^{2n}=nq^{\frac{3n}{2}-2g}\ll gq^{\frac{-g}{2}}. \end{aligned}$$
- (ii)\(g+1<n<2g+1:\) Since \(2g+2,2g\ge n\), \(S(2g+2;n)=S(2g;n)=0.\) Hence,$$\begin{aligned}\langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= \frac{-n}{(q-1)q^{2g+1+\frac{n}{2}}}(S(2g+2;n)-qS(2g;n))=0.\end{aligned}$$
- (iii)\(n=2g+1:\) Since \(2g+2\ge n\), \(S(2g+2;n)=0\) and we get thatUsing (18),$$\begin{aligned} \langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= & {} \frac{n}{(q-1)q^{2g+1+\frac{n}{2}}} q S(2g;n),\\= & {} \frac{2g+1}{(q-1)q^{3g+\frac{1}{2}}} S(2g;2g+1). \end{aligned}$$By replacing \(\pi _q(2g+1)\) and simplifying, we obtain$$\begin{aligned} \langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= & {} \frac{2g+1}{(q-1)q^{3g+\frac{1}{2}}} \pi _q(2g+1)q^{\frac{(2g+1)-1}{2}}. \end{aligned}$$$$\begin{aligned} \langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= & {} \frac{2g+1}{(q-1)q^{3g+\frac{1}{2}}} \left( \frac{q^{2g+1}}{2g+1}+O\left( \frac{q^g}{2g+1}\right) q^g\right) \\= & {} \frac{q^{\frac{1}{2}}}{q-1}+O(q^{-g}). \end{aligned}$$
- (iv)\(n=2g+2\): Similarly,From Theorem 2.4,$$\begin{aligned} \langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= & {} \frac{n}{(q-1)q^{2g+1+\frac{n}{2}}}q S(2g;n)\\= & {} \frac{2g+2}{(q-1)q^{3g+1}} S(2g;2g+2). \end{aligned}$$$$\begin{aligned} \langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= & {} \frac{2g+2}{(q-1)q^{3g+1}} \left( \left( \frac{q^{2g+2}}{2g+2}+O(\frac{q^g}{2g+2})\right) (q^g-q^{g-1})+O(q^{2g})\right) \\= & {} 1+O(q^{-g})+O(gq^{-g}). \end{aligned}$$
- (v)\(n>2g+2:\) We apply Theorem 2.4 to getUpon further simplification,$$\begin{aligned} \langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= & {} \frac{-n}{(q-1)q^{2g+1+\frac{n}{2}}}\left( S(2g+2;n)-qS(2g;n)\right) \\= & {} \frac{-n}{(q-1)q^{2g+1+\frac{n}{2}}}\left( \pi _q(n)(q^{\frac{2g+2}{2}}-\eta _nq^{2g+2-\frac{n}{2}})\right. \\&\left. -q\pi _q(n)(q^{\frac{2g}{2}}-\eta _nq^{2g-\frac{n}{2}})+O(q^n)\right) . \end{aligned}$$$$\begin{aligned} \langle {\mathcal P}_n \rangle _{{\mathcal F}_{2g+2}}= & {} \frac{n}{(q-1)q^{2g+1+\frac{n}{2}}}\Biggr (\eta _n \pi _q(n) (q^{2g+2-\frac{n}{2}}-q^{2g+1-\frac{n}{2}})+O(q^n)\Biggr )\\= & {} \frac{n\eta _n \pi _q(n)}{q^n}+O(nq^{\frac{n}{2}-2g})\\= & {} \eta _n (1+O(q^{\frac{-n}{2}}))+O(nq^{\frac{n}{2}-2g}). \end{aligned}$$
3.1.2 Contribution of the squares: \(\square _n\)
3.1.3 Contribution of the higher prime powers: \(\mathbb {H}_n\)
3.2 Computing \(\langle \hbox {tr}(\Theta _{C_Q}^n)\rangle _{\mathcal {F}_{2g+2}}\)
Theorem 3.1
3.3 Computing \(\langle \hbox {tr}(\Theta _{C_Q}^n)\rangle _{\mathcal {F}_{2g+1}\cup \mathcal {F}_{2g+2}}\)
The main result of [7] is given below:
Theorem 3.2
Corollary 3.3
Note 2 The first main term in Corollary 3.3 does not appear in Theorem 3.2, neither does the term \(\frac{q^{\frac{3}{2}}}{q^2-1}\) corresponding to \(n=2g+1\). Similarly, for \(n=2g\), the constant \(\frac{1}{q-1}\) in Theorem 3.2 is scaled down to \(\frac{1}{q^2-1}\) in Corollary 3.3. In the next section, we shall see that these differences are diminished when we consider the average of \({{\mathrm{tr}}}(\Theta _{C}^n)\) over \({\mathscr {H}}_g\).
4 Computing \(\langle \hbox {tr}(\Theta _{C}^n)\rangle _{\mathscr {H}_g}\)
As we mentioned in the introduction, averaging over monic squarefree polynomials of a fixed degree is not the same as averaging over the moduli space of hyperelliptic curves of genus g: in the latter case, we consider polynomials of degree \(2g+1\) and \(2g+2\). Also, by restricting ourselves to monic polynomials, we introduce a bias in the average value of the trace: the contribution of the point at infinity is related to the leading coefficient of Q, as seen by Eq. (10).
Theorem 4.1
In particular,
Corollary 4.2
Proof
The first part is clear. To prove the second part, we treat each non-mainterm in Theorem 4.1 separately and show that each of them contributes an error term of \(o(\frac{1}{g})\) in the desired region.
Declarations
Open Access
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Acknowledgements
We thank Dr. Chantal David for many valuable suggestions which have vastly improved this paper and for her continuous support throughout this research. We also thank Dr. Zeév Rudnick, Manal Alzahrani, and Patrick Meisner for their valuable input and insight. Finally, we thank the anonymous referee for carefully reviewing our work and for their many useful comments.
Competing interests
The author declares that they have no competing interests.
Authors’ Affiliations
References
- Alzahrani, M.: The distribution of points on hyperelliptic cuvres over $${\mathbb{F}}_q$$ F q of genus $$g$$ g in finite extensions of $${\mathbb{F}}_q$$ F q . Dissertation, Concordia University, Montreal (2015)Google Scholar
- Bucur, A., David, C., Feigon, B., Lalin, M.: Statistics for traces of cyclic trigonal curves over finite fields. Int. Math. Res. Note. 2010(5), 932–967 (2010)MathSciNetMATHGoogle Scholar
- Diaconis, P., Shahshahani, M.: On the eigenvalues of random matrices. Studies in applied probabilities. J. Appl. Probab. 31A, 49–62 (1994)MathSciNetView ArticleMATHGoogle Scholar
- Kurlberg, P., Rudnick, Z.: The fluctuations in the number of points on a hyperelliptic curve over a finite field. J. Number. Theor. 129(3), 580–587 (2009)MathSciNetView ArticleMATHGoogle Scholar
- Meleleo, G.: Questions related to primitive points on elliptic curves and statistics for biquadratic curves over finite fields. Dissertation, Università degli Studi Roma Tre, Rome (2015)Google Scholar
- Rosen, M.: Number Theory in Function Fields. Springer, New York (2002)View ArticleMATHGoogle Scholar
- Rudnick, Z.: Traces of high powers of the Frobenius class in the hyperelliptic ensemble. Acta. Arith. 143(1), 81–99 (2010)MathSciNetView ArticleMATHGoogle Scholar
- Silverman, J.: The Arithmetic of Elliptic Curves. Springer, Dordrecht (2009)View ArticleMATHGoogle Scholar
- Weil, A.: Sur les courbes algébriques et les variétés qui s’en déduisent. Hermann et Cie, Paris (1948)MATHGoogle Scholar




