1,900
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

AGM and Jellyfish Swarms of Elliptic Curves

, , &
Pages 355-369 | Received 20 Oct 2021, Accepted 24 Feb 2022, Published online: 26 Jan 2023

Abstract

The classical AGM produces wonderful infinite sequences of arithmetic and geometric means with common limit. For finite fields Fq, with q3(mod4), we introduce a finite field analogue AGMFq that spawns directed finite graphs instead of infinite sequences. The compilation of these graphs reminds one of a jellyfish swarm, as the 3D renderings of the connected components resemble jellyfish (i.e., tentacles connected to a bell head). These swarms turn out to be more than the stuff of child’s play; they are taxonomical devices in number theory. Each jellyfish is an isogeny graph of elliptic curves with isomorphic groups of Fq-points, which can be used to prove that each swarm has at least (1/2ε)q jellyfish. This interpretation also gives a description of the class numbers of Gauss, Hurwitz, and Kronecker which is akin to counting types of spots on jellyfish.

1 Arithmetic and geometric means

Beginning with positive real numbers a1:=a and b1:=b, the AGMR inductively produces a sequence of pairs AGMR(a,b):={(a1,b1),(a2,b2),}, consisting of arithmetic and geometric means. Namely, for n2, we letan:=an1+bn12   andbn:=an1bn1.

For n2, we have the elementary inequality anbn. At a deeper level, the classical theory of the AGMR (for example, see Chapter 1 of [Citation3]) establishes that these rapidly converging sequences have a common limit limn+an=limn+bn.

In 1748, Euler [Citation3] employed AGMR(2,1) as a remarkable device for rapidly computing digits of π. Namely, he showed that π=limn+pn, where pn:=an21i=1n2i2(ai2bi2).

Although the first three terms p1=4,p2=3.18767, andp3=3.14168 are quite satisfying, the next two termsp4=3.14159265389 andp5=3.14159265358979323846are even more astounding as they give 11 and 20 decimal places of π respectively.

Is there a finite field analogue of AGMR? If so, what number theoretic secrets does it reveal? The nonexistence of many square-roots in Fq poses an obvious obstacle. One solution would be to consider a process where the finite fields grow in size, allowing for the existence of square-roots. However, a second issue arises. Namely, what defines the correct choice of square-root? Over R, the convention of taking positive square-roots guarantees that AGMR never ventures beyond R. Consequently, over finite fields we seek situations where there are unique choices of square-root that similarly avoid the need for field extensions.

These requirements hold for finite fields Fq, where q=pm3(mod4) with p prime. These fields enjoy the property that –1 is not a square, which corresponds to the fact that i=1 is not a real number. For such a field Fq, we let ϕq(·) be its quadratic residue symbol (the usual Legendre symbol (·p) when q = p is prime). We then define AGMFq(a,b) for pairs a,bFq×:=Fq{0}, with a±b and ϕq(ab)=1. This input data gives a1:=a and b1:=b, and for n2 we let(1.1) an:=an1+bn12andbn:=an1·bn1,(1.1) where bn is the unique square-root with ϕq(anbn)=1. Although an1bn1 has two square-roots, only one choice satisfies ϕq(anbn)=1 as ϕq(1)=1. Therefore, we obtain a sequence of pairsAGMFq(a,b):={(a1,b1),(a2,b2),}.

Let’s consider the case of F7. Half of the 12 pairs that appear in some AGMF7(a,b) form a single AGM-orbitAGMF7(1,2)={(1,2),(5,3),(4,1),(6,5),(2,4),(3,6)¯,}.

(Note. The overlined pairs form a repeating orbit.). The other 6 pairs lead to this orbit after a single step. For example, we have(1.2) AGMF7(6,3)={(6,3),(1,2),(5,3),(4,1),(6,5),(2,4),(3,6)¯,}.(1.2)

The compilation JF7 of all such sequences forms a connected directed graph ().

Fig. 1 3D rendering of JF7.

Fig. 1 3D rendering of JF7.

This example is typical. The compilation of the AGMFq sequences is always a disjoint union of connected directed graphs. The nodes are admissible ordered pairsFootnote1 (a,b), where a,bFq×, with a±b, and ϕq(ab)=1. Moreover, (a,b)(c,d) is an edge if and only if c=(a+b)/2 and d=ab, with ϕq(cd)=1. These connected components are like jellyfish, as their 3D renderings turn out to be unit length tentacles leading to a bell head cycle. Hence, we playfully refer to the compilation of the AGMFq sequences(1.3) JFq:=J1J2Jd(Fq)(1.3) as the jellyfish swarm for Fq, where the J1,J2,,Jd(Fq) are the individual jellyfish which make up the swarm.

Let’s summarize some basic facts about AGMFq and the jellyfish swarms JFq.

Theorem 1.

If Fq is a finite field with q3(mod4), then the following are true.

  1. The AGMFq algorithm is well-defined.

  2. The jellyfish swarm JFq has (q1)(q3)/2 nodes.

  3. Every jellyfish has a bell head with length one tentacles pointing to each node.

  4. If Nn(Fq) denotes the number of jellyfish with n nodes, then (q1)|nNn(Fq).

Proof of Theorem 1.

  1. If (a, b) is admissible, then we must show that the next pair (c, d) generated by AGMFq is also admissible. It is clear that cd0 since ab0 and a±b. If c=±d, then (ab)2=a22ab+b2=4c24d2=0, which in turn implies the contradiction that a=b. Therefore, AGMFq is well-defined.

  2. We compute the number of admissible pairs (a, b). There are q – 1 choices for a, and (q3)/2 choices of b with a±b which additionally satisfy the quadratic residue condition ϕq(ab)=1.

  3. Each AGMFq sequence eventually enters a repeating cycle (i.e., the bell head). Suppose that (a, b) is in this orbit. Reversing AGMFq to find its parents, say (A,B), we have A+B=2a and AB=b2. Therefore, (AB)2=4a24b2, and so ϕq(a2b2)=1 with two square-roots. If (A, B) is the parent in the cycle, then the other solution is (B,A), and is not in the cycle. Therefore, (a,b) has exactly one attached tentacle. To see that this tentacle has length 1, we use the assumption that (A, B) is in the cycle, and so has a parent of its own. Repeating the argument above, we have ϕq(A2B2)=1, which in turn gives ϕq(B2A2)=1. This means that (B, A) does not have a parent.

  4. Each αFq× induces an automorphism on JFq defined by (a,b)(αa,αb), as α·AGMFq(a,b)=AGMFq(αa,αb). As there are no fixed admissible pairs provided that α1, we find that the orbit of a node under these automorphisms has size q – 1. As these automorphisms permute the jellyfish with fixed size, the claim follows. □

Theorem 1

inspires many natural questions. For example, how small (resp. large) are the jellyfish in a general swarm? This appears to be a very difficult question. For instance, there are AGMFq-orbits that are much shorter than q, such as the length 9AGMF67(1,17)={(1,17),(9,33),(65,15),(40,29)¯,},as well as those that are much longer than q, such as the length 410AGMF83(1,3)={(1,3),(2,13),,(37,12),(66,19)¯,}.

These examples correspond to a tiny 18 node jellyfish in JF67, and a gigantic 820 node jellyfish in JF83. As another question, what can be said about d(Fq), the number of jellyfish in JFq? illustrates the oscillatory behavior of d(Fq). This erratic sequence does not appear to settle into a predictable pattern as q+. Indeed, there are many astonishing examples of disproportionate consecutive values, such as d(F479)=18 and d(F487)=359. The only clear observation is that the d(Fpm) grow rapidly with m when p is fixed. For instance, we haved(F3)=0d(F33)=39d(F35)=1210,d(F7)=1d(F73)=1539d(F75)=876713,d(F11)=3d(F113)=8778d(F115)=25558635.

Table 1 d(Fq) for pimes q.

We shall see that the theory of elliptic curves offers deep insight into these questions.

2 Jellyfish swarms organize elliptic curves

Computing arithmetic and geometric means over Fq might seem like mere child’s play. However, it turns out that this arithmetic process is a taxonomical device in number theory which organizes elliptic curves.

An elliptic curve E over a field F can be thought of as a cubic equation of the formy2=f(x)=x3+ax2+bx+c,where a,b,cF, and f has nonzero discriminant. If E(F) denotes the F-rational points of E, including the identity “point at infinity” O, then E(F) naturally forms an abelian group via the well-known “chord-tangent law.” The group law can be described by asserting that three colinear points on an elliptic curve sum to the identity O. Number theorists are deeply interested in these groups of rational points.

If F is a number field (i.e., a field which has finite degree over Q), then a classical theorem by Mordell and Weil asserts that E(F), the Mordell-Weil group of E/F, is finitely generated. The special case where F=Q is the subject of two frequently cited Monthly articles. The beautiful 1993 article by Silverman [Citation17] on the representation of positive integers as sums of two rational cubes describes the intimate relationship between Ramanujan’s taxi-cab numbers and positive rank elliptic curves (i.e., curves with infinitely many Q-rational points). The famous 1991 article by Mazur [Citation12] promotes the conjectured “Modularity” of elliptic curves over Q (formerly known as the Taniyama-Weil Conjecture). This conjecture is now known to be true, largely thanks to the work of Wiles and Taylor [Citation20, Citation23], which was a celebrated ingredient in the proof of Fermat’s Last Theorem.

For the case of finite fields, it turns out that the jellyfish swarms JFq organize elliptic curves. One can think of the nodes as spots on the jellyfish, and these spots will be mapped to curves. These swarms are coverings of networks of special Legendre elliptic curves when q3(mod4) and p7. To be precise, for λFq{0,1}, we recall the Legendre normal form elliptic curve(2.1) Eλ:y2=x(x1)(xλ).(2.1)

Isomorphism classes of elliptic curves are distinguished by their j-invariants, and for Eλ we have(2.2) j(Eλ)=28·(λ2λ+1)3λ2(λ1)2.(2.2)

For an introduction to elliptic curves over finite fields, the reader may consult Chapter 4 of [Citation22].

The jellyfish swarm JFq organizes elliptic curves via the map ΨFq:JFqEFq, where EFq is the set of Legendre curves over Fq, and(2.3) ΨFq(a,b):=Eλ(a,b),(2.3) where λ(a,b):=b2/a2. For instance, (1.2) givesΨF7(AGMF7(6,3))=ΨF7({(6,3),(1,2),(5,3),(4,1),(6,5),(2,4),(3,6)¯,})={E2,E4,E4,E4,E4,E4,E4¯,}={E2,E4¯,}.

As the values λ(a,b)=b2/a2 cover the squares in Fq{0,1}, it is natural ask what special features are shared by curves of the form Eλ2. It turns out that these curves are distinguished by the 2-Sylow subgroups of their Fq-rational points.

Lemma 2.

Suppose that Fq is a finite field with q3(mod4). If λFq{0,1}, then the 2-Sylow subgroup of Eλ2(Fq) is of the form Z/2Z×Z/22+bZ, where b0.

Proof of Lemma 2.

Elliptic curves with four 2-torsion points (i.e., including the identity) can be written in the formE:y2=(xα)(xβ)(xγ).

The nontrivial 2-torsion points correspond to the roots of the cubic. They are the points (α,0),(β,0) and (γ,0). For such curves, the classical 2-descent lemma (see pp. 47–49 of [Citation10] or p. 315 of [Citation16]) says that a nonzero point P=(x0,y0)E(Fq) satisfies P=2Q, where QE(Fq), if and only ifx0α,x0β,x0γFq2.

Here we have α=0,β=1, and γ=λ2. Since q3(mod4), then exactly one of (1, 0) and (λ2,0) is in 2Eλ2(Fq), as exactly one of ±(1λ2) is a square. On the other hand, (0,0)2Eλ2(Fq) by the 2-descent lemma because –1 is not a square. Therefore, the Z/4Z rank of E(Fq) is 1, which means that E(Fq) contains Z/4Z but not Z/4Z×Z/4Z.

The JFq organize the curves in ΨFq(JFq) as unions of explicit isogeny graphs. An isogeny between two elliptic curves is a special map Φ (called a morphism) that preserves the identity element, is given by rational functions Φ=(u(x,y),v(x,y)), and is a homomorphism on Fq-points with finite kernel. The isogeny graph structure of ΨFq(JFq) is provided by the following theorem.

Theorem 3.

If Fq is a finite field with q3(mod4) and char(Fq)=p7, then the following are true.

  1. We have that ΨFq(JFq)={Eα2/Fq:αFq{0,±1}}.Moreover, each Eα2ΨFq(JFq) has q – 1 preimages.

  2. For each 1id(Fq), we have that ΨFq(Ji) is a connected graphFootnote2, where an edge (an,bn)(an+1,bn+1)Ji is the isogeny Φn:Eλ(an,bn)Eλ(an+1,bn+1) defined by Φn(x,y):=((anx+bn)2x(an+bn)2,any(anxbn)(anx+bn)x2(an+bn)3).

Moreover, we have that ker(Φn)=(0,0).

Proof of Theorem 3.

  1. For an admissible pair (a,b), we have a,bFq×, and a±b. Therefore, b/aFq{0,±1} andΨFq(JFq){Eα2/Fq:αFq{0,±1}}.On the other hand, if αFq{0,±1}, then one can choose (a, b) such that a=±1 and b=±α with ϕq(ab)=1, giving λ(a,b)=α2. Furthermore, each admissible pair (a,b), produces the q – 1 further admissible pairs (ka,kb), all mapping to Eb2/a2. Hence, each Eλ(a,b) has q – 1 preimages.

  2. If (x,y)(0,0)Eλ(an,bn), then a brute force calculation gives(anx+bn)2x(an+bn)2((anx+bn)2x(an+bn)21)((anx+bn)2x(an+bn)2bn+12an+12)=an2y2(anxbn)2(anx+bn)2x4(an+bn)6.

This proves that Φn(x,y)Eλ(an+1,bn+1). To verify that the map preserves the identity O=[0,1,0] (the point at infinity in projective space), we consider the projectivized form Φn(x,y,z):=[φ1(x,y,z),φ2(x,y,z),φ3(x,y,z)], whereφ1:=(an+bn)×(an4xy2+(an4+an2bn2)x3+2an3bny2z+(2an3bn+2anbn3)x2z2anbn3xz2),φ2:=2an3bn2xyzan5y3(an5+an3bn2)x2y,φ3:=(an+bn)3(an2y2z+(an2+bn2)x2zbn2xz2).

One sees that Φn(x,y,z) preserves the point at infinity O. Furthermore, as an+bn=2an+10, we find by inspection that Φn is an isogeny with ker(Φn)=(0,0).

What features are shared by the elliptic curves corresponding to the nodes of a single jellyfish? The next corollary offers the answer.

Corollary 4.

For each 1id(Fq), the following are true.

  1. There is an abelian group G such that for all (an,bn)Ji we have Eλ(an,bn)(Fq)G.Moreover, the 2-Sylow subgroup of G is Z/2Z×Z/22+bq(i)Z, where bq(i)0.

  2. There is a fixed “trace of Frobenius” aq(i) such that for all (an,bn)Ji we have |Eλ(an,bn)(Fq)|=q+1aq(i).

Proof

of Corollary 4.

  1. For adjacent pairs (an,bn),(an+1,bn+1)Ji, Theorem 3 (2) gives an isogenyΦn:Eλ(an,bn)Eλ(an+1,bn+1),with ker(Φn)=(0,0)Z/2Z. It is well-known (for example, see Exercise 5.4 on p. 153 of [Citation16]) that isogenous elliptic curves over finite fields have the same number of rational points. In particular, the 2-Sylow subgroups of the groups of Fq rational points of these two curves have the same order. Therefore, since Φn(Eλ(an,bn)(Fq)) is an index 2 subgroup of Eλ(an+1,bn+1)(Fq), then as abstract groups we find that Eλ(an,bn)(Fq)Eλ(an+1,bn+1)(Fq).

  2. By Theorem 3 (2), we have that ΨFq(Ji) is a connected isogeny graph. As mentioned above, isogenous curves over finite fields have the same number of rational points. Hence, there is a fixed integer aq(i), known as the trace of Frobenius, such that |Eλ(an,bn)(Fq)|=q+1aq(i) for each (an,bn)Ji.

Example.

By Theorem 1, JF19 has 144 nodes. and it turns out thatJF19=J1J2J6J7J8

(i.e., d(F19)=8), where the jellyfish can be ordered so that J1,J2,,J6 have bell heads with cycle length 6, and J7 and J8 have bell heads with cycle length 18 (). By Theorem 3 (1), the nodes in JF19 map to the eight Legendre curves with 18 preimages each. The 6 smaller jellyfish give the isogeny graph depicted in .

Fig. 2 2D rendering of the isogeny graph of each J{J1,,J6}.

Fig. 2 2D rendering of the isogeny graph of each J∈{J1,…,J6}.

Fig. 3 JF19 swarm.

Fig. 3 JF19 swarm.

This defines the 3-to-1 covering ΨF19(J1)==ΨF19(J6)={E6,E9,E16,E17}. These Legendre curves satisfyE6(F19)E9(F19)E16(F19)E17(F19)Z/2Z×Z/12Z.

We have a19(1)==a19(6)=19+1|Z/2Z×Z/12Z|=4. For J7 and J8, we obtain the 9-to-1 covering ΨF19(J7)=ΨF19(J8)={E4,E5,E7,E11}, withE4(F19)E5(F19)E7(F19)E11(F19)Z/2Z×Z/8Z.

Therefore, we have a19(7)=a19(8)=19+1|Z/2Z×Z/8Z|=4.

This example shows that individual jellyfish generally include many non-isomorphic curves, as the j-invariants (see (2.2)) for the smaller (resp. larger) jellyfish are j(E9)=j(E17)=5 and j(E6)=j(E16)=15 (resp. j(E7)=j(E11)=5 and j(E4)=j(E5)=15). We shall show that the number of different j-invariants, like counting types of spots on jellyfish, has taxonomic significance.

Thanks to the deeper insight offered by Corollary 4, we are able to revisit the baffling numbers d(Fq), and offer a nontrivial lower bound.

Theorem 5.

If ε>0, then for sufficiently large q3(mod4) we have d(Fq)(12ε)·q.

Remark.

Is this lower bound close to the truth? In view of examples such asd(F47)=4>47/23.4278,d(F383)=14>383/29.7851,d(F983)=25>983/215.6764,d(F1907)=38>1907/221.8346,d(F7703)=87>7703/243.8833,it is tempting to speculate that this lower bound is not much smaller than an optimal bound which perhaps might be of the form qloglog(q).

Proof of Theorem 5.

Corollary 4 guarantees that d(Fq) is at least as large as the number of distinct groups G for which Eλ2(Fq)G for some λFq{0,1}. For a group G, the proof of Theorem 6 establishes the existence of such a curve provided Z/2Z×Z/4ZG and there is an E/Fq for which E(Fq)G.

We can construct many such groups. If 2qs2q and sq+1(mod8), then let mq(s):=(q+1s)/20(mod4). A classical theorem of Rück and Voloch [Citation15, Citation21] guarantees that one can take G:=Z/2Z×Z/mq(s)Z. For large q, this represents approximately one eighth of the integers in [2q,2q]. Therefore, if ε>0, then for sufficiently large q we have(2.4) d(Fq)(12ε)q.(2.4)

3 Jellyfish swarms and Gauss’ Class numbers

The swarms JFq offer new descriptions of the class numbers studied by Gauss, Hurwitz and Kronecker (see [Citation5] for more on class numbers). To make this precise, recall that an integral binary quadratic form is a homogeneous degree 2 polynomialf(x,y):=ax2+bxy+cy2Z[x,y].

The discriminantFootnote3 of f is D:=b24ac. If a > 0 and D<0, then f(x, y) is called positive definite. Furthermore, f is primitive if gcd(a,b,c)=1. For negative discriminants D, the group SL2(Z) acts on QD, the set of positive definite binary quadratic forms of discriminant D. More precisely, for any γ=(uvrs), we have(f°γ)(x,y):=f(ux+vy,rx+sy).

Although there are infinitely many primitive binary quadratic forms with discriminant D, Gauss proved that their number of SL2(Z)-orbits is finite, and this number is known as Gauss’ class number h(D).

Gauss’ class numbers lead to the more general Hurwitz-Kronecker class numbers. If N0,3(mod4), then the Hurwitz-Kronecker class number H(N) is the class number of positive definite integral binary quadratic forms of discriminant N, where each class C is counted with multiplicity 1/Aut(C). If N=Df2, where D is a negative fundamental discriminant (i.e., the discriminant of the ring of integers of an imaginary quadratic field), then H(N) is related to h(D) by (for example, see p. 273 of [Citation5])H(N)=h(D)w(D)d|fμ(d)(Dd)σ1(f/d).

Here w(D) is half the number of integral units in Q(D), and σs(n) denotes the sum of the sth powers of the positive divisors of n, and (D·) is the quadratic Dirichlet character with conductor D.

Class numbers have a long and rich history. For example, class numbers play a central role in the study of quadratic forms. Indeed, if r3(n) denotes the number of representations of an integer n as a sum of three squares, then Gauss proved thatr3(n)={12H(4n)ifn1,2(mod4),24H(n) ifn3(mod8),r3(n/4) ifn0(mod4),0 ifn7(mod8).

Class numbers play even deeper roles in algebraic and analytic number theory, as they are the orders of ideal class groups of rings of integers and orders of imaginary quadratic fields. These groups themselves are the Galois groups of Hilbert class fields. For brevity, we simply say that the study of class numbers continues to drive cutting edge research today.

The jellyfish swarms JFq offer a new interpretation of these class numbers. As the nodes are jellyfish spots, it is quite gratifying to discover that class numbers represent the number of types of spots that appear in a family of jellyfish. In this analogy, the j-invariants distinguish these types of spots. Namely, for integers s, let MFq(s) be the number of distinct j-invariants of curves in the union of jellyfish with aq(i)=s, the “Frobenius trace s family.” We have the following attractive description which follows from a well-known theorem of Schoof.

Theorem 6.

Suppose that Fq is a finite field with q3(mod4) and p7. If 2qs2q is a nonzero integer with sq+1(mod8), then we have H(4qs24)=MFq(s).

Example.

We revisit the example of JF19, where J1,,J6 (resp. J7 and J8) are the smaller (resp. larger) jellyfish. We found earlier that the Frobenius trace -4 family isΨF19(J1)ΨF19(J6)={E6,E9,E16,E17}.

One checks (using (2.2) that j(E9)=j(E17)=5 and j(E6)=j(E16)=15, giving MF19(4)=2. We also found that the Frobenius trace 4 family isΨF19(J7)ΨF19(J8)={E4,E5,E7,E11}.

As j(E7)=j(E11)=5, and j(E4)=j(E5)=15, we also have MF19(4)=2. Therefore, since MF19(±4)=2, Theorem 6 givesH(76(±4)24)=H(15)=2.

Proof of Theorem 6.

Let E/Fq be an elliptic curve for which |E(Fq)|0(mod8) and Z/2Z×Z/2ZE(Fq). We automatically have Z/2Z×Z/4ZE(Fq), because these groups can always be described as a direct product of at most 2 cyclic groups. Moreover, an application of the 2-descent lemma (for example, see Proposition 3.3 of [Citation1]) implies that there is an αFq{0,±1} for which Eα2FqE. Conversely, every Eλ(a,b) is such an E thanks to Corollary 4. Therefore, JFq encodes the isomorphism classes of elliptic curves E/Fq with Z/2Z×Z/2ZE(Fq), with the additional property that qs+1(mod8), where s:=q+1#E(Fq).

We consider the Fq isomorphism classes of such curves with fixed nonzero trace of Frobenius s. If (a,b),(a,b)JFq satisfies j(Eλ(a,b))=j(Eλ(a,b)), then either Eλ(a,b)FqEλ(a,b), or they are nontrivial twists of each other (see Chapter X of [Citation16]). In the latter case, the traces of Frobenius differ in sign.

Combining these facts, we have that MFq(s) is the number of isomorphism classes of elliptic curves E/Fq with Z/2Z×Z/2ZE(Fq) and trace of Frobenius s. The rich theory of complex multiplication for elliptic curves is the bridge which connects the counts of such classes with equivalence classes of binary quadratic forms. Indeed, a well-known deep theorem of Schoof (see Section 4 of [Citation18]) asserts that H(4qs24) equals the number of such isomorphism classes of elliptic curves. Invoking this theorem completes the proof. □

4 Analogies between Hypergeometric functions

Does the classical AGMR have more in common with its finite field analogues than the inductive rulesan:=an1+bn12andbn:=an1bn1?

This is indeed the case. It turns out that the results offered above are a byproduct of remarkable analogies between complex hypergeometric functions and their finite field analogues. Let us explain.

Hypergeometric functions and AGMR.

The theory underlying AGMR (see Chapter 1 of [Citation3]) is a story involving special integrals and their relationship with Gauss’ hypergeometric functions. To make this precise, for a>b>0, we let(4.1) IR(a,b):=12a1dxx(x1)(x(1b2/a2)),(4.1) where the polynomial in the square-root in the denominator of the integrand is tantalizinglyFootnote4 close to the cubic in the Legendre curveEλ(a,b):y2=x(x1)(xb2/a2).

It is straightforward to check that IR(a,b)=IR(a+b2,ab), which in turn implies that AGMR(a,b)={(a1,b1),(a2,b2),} satisfies(4.2) IR(a1,b1)=IR(a2,b2)==IR(an,bn)=.(4.2)

Gauss discovered a beautiful formula for IR(a,b) in terms of hypergeometric functions. For α1,α2,αn and β1,,βn1C, these functions are defined by(4.3) nFn1class(α1,α2,,αn β1,,βn1|t):=k=0(α1)k(α2)k(αn)k(β1)k(βn1)ktkk!,(4.3) where (x)k is the Pochhammer symbol defined by(x)k={1ifk=0x(x+1)(x+k1)ifk>0.

Gauss’ theory of elliptic integrals [Citation9, p. 182] gives(4.4) IR(a,b)=π2a· 2F1class(12,12 1|1b2a2),(4.4) which, by letting a(a+b)/2 and bab, also gives(4.5) IR(a+b2,ab)=πa+b· 2F1class(12,12 1|(ab)2(a+b)2).(4.5)

Equating these expressions, we find that AGMR leads to the identity2F1class(12,12 1|1b2a2)=2aa+b·2F1class(12,12 1|(ab)2(a+b)2),which relates 1b2/a2 with λ(a+b,ab)=(ab)2/(a+b)2. This identity is a special case (i.e., α=β=1/2 and t=(ab)/(a+b)) of the far more general quadratic transformation formula (see [Citation2, (3.1.11)])(4.6) 2F1class(α,β 2α|4t(1+t)2)=(1+t)2β·2F1class(β+12α,β α+12|t2).(4.6)

Hypergeometric functions and AGMFq.

In view of the previous discussion, we seek a finite field analog ofIR(a,b):=12a1dxx(x1)(x(1b2/a2)).

To this end, one can replace the integral over R by a sum over Fq, and replace the square-root with the quadratic character ϕq(·), and we can naively declare the finite field analogue to be the sum(4.7) IFq(a,b):=xFqϕq(x)ϕq(x1)ϕq(x(1b2/a2)).(4.7)

We hope that such sums are values of hypergeometric-type functions.

In his important 1984 Ph.D. thesis [Citation7], Greene defined the finite field hypergeometric functions that do the trick (see [Citation13, Citation14] for applications). For multiplicative charactersFootnote5 A1,A2,,An and B1,B2,,Bn1 of Fq×, he definednFn1(A1,A2,,An B1,,Bn1|t)Fq:=qq1χ(A1χχ)(A2χB1χ)(AnχBn1χ)χ(t),where the sum is over the multiplicative characters of Fq×, and (AB) is the normalized Jacobi sum(AB):=B(1)qJ(A,B¯):=B(1)qtFqA(t)B¯(1t).

This definition was meant to resemble (4.3), and is based on analogies between Gauss sums and the complex Γ-function, which interpolates factorials, and the classical Gauss sum expression for Jacobi sums (when χψ is nontrivial)J(χ,Ψ)=G(χ)G(ψ)G(χψ),which in turn emulates binomial coefficients.

These functions take an attractive form when n = 2 (see p. 82 of [Citation8]). If A, B, and C are characters of Fq and tFq×, then2F1(A,BC|t)Fq=BC(1)q·xFqB(x)·B¯C(1x)·A¯(1xt).

In particular, if A=B=ϕq(·) and εq(·) is trivial, then a change of variables gives(4.8) 2F1(λ)Fq:=2F1(ϕq,ϕqεq|λ)Fq=ϕq(1)q·xFqϕq(x(x1)(xλ)).(4.8)

In analogy with Gauss’ integral formulas, which give periods of elliptic curves, Greene’s functions compute traces of Frobenius over Fq. Indeed, if char(Fq)>3 and λFq{0,1}, then (4.8) gives(4.9) |Eλ(Fq)|=q+1+qϕq(1)· 2F1(λ)Fq.(4.9)

In terms of the desired analogy, if q3(mod4), then (4.7) and (4.8) gives the counterpart of (4.4)IFq(a,b)=q· 2F1(1b2/a2)Fq.

To complete the analogy, we require a quadratic transformation law which plays the role of (4.6). We conclude by stating this recent theorem of Evans and Greene (see Theorem 2 of [Citation6]), which precisely offers the desired analogous transformation.

Theorem 7.

[Theorem 2 of [Citation6]] Suppose that A, A2B¯, and ϕqAB¯ are all nontrivial characters of Fq×. If tFq{1}, then 2F1(A,BA2|4t(1+t)2)Fq=A¯(4)ϕqB(1)G(A2B¯)·G(ϕqA¯B)G(ϕq)G(A)·B2(1+t) 2F1(ϕqA¯B,BϕqA|t2)Fq.

5 Epilogue

We hope that the reader agrees that the story presented here is a beautiful amalgamation of facts about elliptic curves over C and over finite fields. It is quite marvelous to find that the hypergeometric functions of Gauss (in the case of R) and of Greene (in the case of Fq) underlie different features in the theory of elliptic curves that are captured by sequences of arithmetic and geometric means. We hope that this story encourages readers to learn more about the theory of Gauss’ class numbers, elliptic curves, and hypergeometry. We highly recommend D. Cox’s book “Primes of the form x2+ny2” [Citation5] and “Pi and the AGM” [Citation3] by P. Borwein and J. Borwein.

We aim to entice readers with the following tantalizing problems.

Problems.

  1. What can one prove about the sizes of the jellyfish in JFq? This question is intimately connected to the unproven Cohen-Lenstra heuristics on the expected behavior of class groups of imaginary quadratic orders.

  2. Determine an “optimal” function D(q) for which d(Fq)D(q).In particular, how close to optimal is the lower bound in Theorem 2.4? Is the correct lower bound more like qloglog(q)?

  3. It would be very interesting to define variants of AGM in situations where choices of square-root are not well-defined, such as the complex field C and the finite fields Fq with q3(mod4).

To conclude, we must confess that the AGMFq jellyfish are merely alluring examples of creatures that inhabit the magnificent kingdom formed out of elliptic curves over finite fields. The beautiful AGMFq sequences innocently offer glimpses of the fascinating theory of isogenies for elliptic curves over finite fields, which form networks, dubbed isogeny volcanoes. The jellyfish are examples that arise from “2-volcanoes of height 1.” Isogeny volcanoes play important roles in computational number theory and cryptography. They are often employed as a means of accelerating number theoretic algorithms. They have even been used to quickly compute values of Euler’s partition function [Citation4]. This important theory has its origins in David Kohel’s Citation1996 Ph.D. thesis [Citation11]. We invite interested readers to read the delightful expository article [Citation19] by Sutherland.

Acknowledgment

The authors thank the referees, Jennifer Balakrishnan, Hasan Saad, and Drew Sutherland for comments and suggestions that improved this article. The second author thanks the Thomas Jefferson Fund and the NSF (DMS-2002265 and DMS-2055118) for their generous support, as well as the Kavli Institute grant NSF PHY-1748958. The third author is grateful for the support of a Fulbright Nehru Postdoctoral Fellowship.

Additional information

Funding

The second author thanks the Thomas Jefferson Fund and the NSF (DMS-2002265 and DMS-2055118) for their generous support, as well as the Kavli Institute grant NSF PHY-1748958. The third author is grateful for the support of a Fulbright Nehru Postdoctoral Fellowship.

Notes on contributors

Michael J. Griffin

MICHAEL J. GRIFFIN received the Ph.D. degree in Mathematics from Emory University in 2015. He is an Assistant Professor of Mathematics at Brigham University in Provo, Utah, USA. His research interests are in number theory.

Ken Ono

KEN ONO received the Ph.D. degree in Mathematics from UCLA in 1993. He is the Thomas Jefferson Professor of Mathematics at the University of Virginia, Charlottesville, Virginia, USA. His research interests are in number theory.

Neelam Saikia

NEELAM SAIKIA received the Ph.D. degree in Mathematics from the Indian Institute of Technology in Delhi, India in 2016. She is an Assistant Professor of Mathematics at the Indian Institute of Technology Bhubaneswar in Bhubaneswar, Odisha, India. Her research interests are in number theory.

Wei-Lun Tsai

WEI-LUN TSAI received the Ph.D. degree in Mathematics from the Texas A&M University in 2020. He is a Research Postdoctoral Fellow at the University of Virginia, Charlottesville, Virginia, USA. His research interests are in number theory.

Notes

1 There are no loops (i.e., (a,b)(a,b)) as nodes of the form (a, a) are not allowed.

2 The proof of Theorem 3 shows that the swarms are graphs of 2-isogenies. We point interested readers to Sutherland’s expository article [Citation19] for more on the theory of isogeny graphs.

3 Discriminants always satisfy D0,1(mod4).

4 These models are actually –1 quadratic twists of each other.

5 For multiplicative characters χ, we adopt the convention that χ(0):=0.

References

  • Ahlgren, S., Ono, K. (2000). Modularity of a certain Calabi-Yau threefold. Montash. Math. 129(3): 177–190.
  • Andrews, G., Askey, R., Roy, R. (2001). Special Functions. Cambridge: Cambridge Univ. Press.
  • Borwein, J., Borwein, P. (1998). Pi and the AGM. New York: Wiley.
  • Bruinier, J. H., Ono, K., Sutherland, A. V. (2016). Class polynomials for nonholomorphic modular functions. J. Number Theory 161: 204–229. DOI: 10.1016/j.jnt.2015.07.002.
  • Cox, D. A. (2013). Primes of the Form x2+ny2. New York: Wiley.
  • Evans, R., Greene, J. (2017). A quadratic hypergeometric 2F1 transformation over finite fields. Proc. Amer. Math. Soc. 145: 1071–1076.
  • Greene, J. (1984). Character sum analogues for hypergeometric and generalized hypergeometric functions over finite fields. Ph.D. Dissertation. Univ. of Minnesota, Minneapolis, USA.
  • Greene, J. (1987). Hypergeometric functions over finite fields. Trans. Amer. Math. Soc. 301: 77–101. DOI: 10.1090/S0002-9947-1987-0879564-8.
  • Husemöller, D. (2004). Elliptic Curves. New York: Springer.
  • Koblitz, N. (1993). Introduction to Elliptic Curves and Modular Forms, 2nd ed. New York: Springer.
  • Kohel, D. (1996). Endomorphism rings of elliptic curves over finite fields. Ph.D. Dissertation. Univ. of California, Berkeley, USA.
  • Mazur, B. (1991). Number theory as gadfly. Amer. Math. Monthly. 98(7): 593–610. DOI: 10.1080/00029890.1991.11995762.
  • Ono, K. (1998). Values of Gaussian hypergeometric series. Trans. Amer. Math. Soc. 350(3): 1205–1223.
  • Ono, K. (2004). The Web of Modularity. Providence: Amer. Math. Soc.
  • Rück, H.-G. (1987). A note on elliptic curves over finite fields. Math. Comp. 49: 301–304.
  • Silverman, J. (2009). The Arithmetic of Elliptic Curves, 2nd ed. New York: Springer.
  • Silverman, J. (1993). Taxicabs and sums of two cubes. Amer. Math. Monthly. 100(4): 331–340.
  • Schoof, R. (1987). Nonsingular plane cubic curves over finite fields. J. Comb. Theory Ser. A. 46(2): 183–211.
  • Sutherland, A. V. (2013). Isogeny volcanoes. ANTS X- Proc. Algorithmic Number Theory Symposium. Berkeley: Mathematical Sciences Publishers, pp. 507–530.
  • Taylor, R., Wiles, A. (1995). Ring theoretic properties of certain Hecke algebras. Ann. Math. 141: 553–572. DOI: 10.2307/2118560.
  • Voloch, J. F. (1988). A note on elliptic curves over finite fields. Bull. Soc. Math. France. 116: 455–458. DOI: 10.24033/bsmf.2107.
  • Washington, L. C. (2008). Elliptic Curves, Number Theory, and Cryptography, Boca Raton: Chapman & Hall.
  • Wiles, A. (1995). Modular elliptic curves and Fermat’s Last theorem. Ann. Math. 141: 443–551. DOI: 10.2307/2118559.