Numerical computation of endomorphism rings of Jacobians

Transcription

1 Numerical computation of endomorphism rings of Jacobians Nils Bruin (Simon Fraser University), Jeroen Sijsling (Ulm), Alexandre Zotine (Simon Fraser University) July 16, 2018, Madison

2 Setting k C a number field C a proper smooth absolutely irreducible curve over k of genus g, represented by an affine plane model: C : f (x,y) = 0 where f (x,y) k[x,y].

3 Setting k C a number field C a proper smooth absolutely irreducible curve over k of genus g, represented by an affine plane model: Analytic Jacobian: C : f (x,y) = 0 where f (x,y) k[x,y]. J(C) = H 0 (C C,Ω 1 C) /H 1 (C(C),Z) = C g /ΩZ 2g,

4 Setting k C a number field C a proper smooth absolutely irreducible curve over k of genus g, represented by an affine plane model: Analytic Jacobian: C : f (x,y) = 0 where f (x,y) k[x,y]. J(C) = H 0 (C C,Ω 1 C) /H 1 (C(C),Z) = C g /ΩZ 2g, Basis for H 0 (C C,Ω 1 C ): ω 1,...,ω g Basis for H 1 (C(C),Z): α 1,...,α g,β 1,...,β g ( ) Period matrix: Ω = ω i ω i α j β j i,j Goal: Numerically compute Ω and read off properties of C.

5 Previous work Design criterion: Applications need lots of digits. Machine precision (53 bits) is not enough. Other work: Deconinck-van Hoeij (2001): General case (Maple) van Wamelen (2006): Hyperelliptic curves (Magma) Molin-Neurohr (2017): Superelliptic curves (C/Arb) Neurohr (2018): General implementation (in Magma?)

6 Previous work Design criterion: Applications need lots of digits. Machine precision (53 bits) is not enough. Other work: Deconinck-van Hoeij (2001): General case (Maple) van Wamelen (2006): Hyperelliptic curves (Magma) Molin-Neurohr (2017): Superelliptic curves (C/Arb) Neurohr (2018): General implementation (in Magma?) Our contributions: Use certified homotopy continuation Simple way of getting homology generators Flexible implementation that is easy to improve and adapt (in Sage) Compute automorphisms of C via Torelli theorem

7 Basis for H 0 (C C,Ω 1 C ) H 0 (C C,Ω 1 C ) = H0 (C,Ω 1 C ) C contains the regular differentials on C (i.e., the ones that have no poles) If C : f (x,y) = 0 with deg(f ) = n then { } hdx H 0 (C,Ω 1 C) y f (x,y) : deg(h) n 3. Singularities impose linear conditions on h. If singularities are in {(1 : 0 : 0),(0 : 1 : 0),(0 : 0 : 1)}, conditions are easy to write down Otherwise, adjoint ideal gives required information Algebraic process, implemented in Singular. Result: Basis ω 1,...,ω g, where ω i = h i(x,y)dx y f (x,y) with h i k[x,y]

8 Basis for H 1 (C(C),Z) H 1 (C(C),Z) consists of cycles modulo equivalence

9 Basis for H 1 (C(C),Z) H 1 (C(C),Z) consists of cycles modulo equivalence C(C) is a compact Riemann surface, so H 1 (C(C),Z) Z 2g Generated by classes of generators of the fundamental group

10 Basis for H 1 (C(C),Z) H 1 (C(C),Z) consists of cycles modulo equivalence C(C) is a compact Riemann surface, so H 1 (C(C),Z) Z 2g Generated by classes of generators of the fundamental group C(C) is an oriented topological surface, so H 1 (C(C),Z) comes with a non-degenerate alternating intersection pairing.

11 Basis for H 1 (C(C),Z) H 1 (C(C),Z) consists of cycles modulo equivalence C(C) is a compact Riemann surface, so H 1 (C(C),Z) Z 2g Generated by classes of generators of the fundamental group C(C) is an oriented topological surface, so H 1 (C(C),Z) comes with a non-degenerate alternating intersection pairing. Strategy: Determine loops on C(C) that generate fundamental group Compute their intersection pairing matrix Use Z-linear algebra to get a basis for H 1 (C(C),Z). One solution: Tretkoff-Tretkoff (1984) rather opaque algorithm.

12 Lifting homotopy Consider finite cover C C; (x,y) x of degree n = deg y (f ). Unramified outside S = {x C : disc y f (x,y) = 0}

13 Lifting homotopy Consider finite cover C C; (x,y) x of degree n = deg y (f ). Unramified outside S = {x C : disc y f (x,y) = 0} Determine a connected plane graph (V,E) in C S for which a cycle basis generates the fundamental group of C S

14 Lifting homotopy Consider finite cover C C; (x,y) x of degree n = deg y (f ). Unramified outside S = {x C : disc y f (x,y) = 0} Determine a connected plane graph (V,E) in C S for which a cycle basis generates the fundamental group of C S Lift graph to (Ṽ,Ẽ) on C x 1 (S).

15 Lifting homotopy Consider finite cover C C; (x,y) x of degree n = deg y (f ). Unramified outside S = {x C : disc y f (x,y) = 0} Determine a connected plane graph (V,E) in C S for which a cycle basis generates the fundamental group of C S Lift graph to (Ṽ,Ẽ) on C x 1 (S). A cycle basis of (Ṽ,Ẽ) generates the fundamental group of C x 1 (S) and hence of C.

16 Using Voronoi decomposition Example: C : y 2 = x 3 x 1 S = {s 1,s 2,s 3 } Take (bounded) Voronoi cells: s 3 s 2 v 5 v 11 v 6 v 2 s 3 s 4 v 10 v 7 s 1 s 1 s 2 v 0 v 4 v 3 v 1 s 5 s 6

17 Lifting edges Lifting vertices and edges Lift v to C to v (i) = (x v,y (i) v ) by solving f (x v,y (i) v ) = 0. Given edge e = (v,w), parametrize x(t) = (1 t)x v + tx w. Let y (i) (t) be the continuous function determined by y (i) (0) = y (i) v and f (x(t),y (i) (t)) = 0 Then e (i) = {(x(t),y (i) (t) : t [0,1]} is a lift of e to C.

18 Lifting edges Lifting vertices and edges Lift v to C to v (i) = (x v,y (i) v ) by solving f (x v,y (i) v ) = 0. Given edge e = (v,w), parametrize x(t) = (1 t)x v + tx w. Let y (i) (t) be the continuous function determined by y (i) (0) = y (i) v and f (x(t),y (i) (t)) = 0 Then e (i) = {(x(t),y (i) (t) : t [0,1]} is a lift of e to C. Certified continuation: For t 0, set ε = 1 3 min i j y(i) (t 0 ) y (j) (t 0 ) (Kranich 2015): Compute explicit δ > 0 such that for t 0 t 1 < t 0 + δ we have y (i) (t 1 ) y (i) (t 0 ) < ε Store sequence of points along e (i) from which (x(t),y(t)) can be reliably interpolated.

19 Intersection pairing Cycle basis γ 1,...,γ r for (Ṽ,Ẽ) gives us generators for H 1 (C(C),Z). Orientation gives us a signed intersection pairing: β α α α P β P P β α,β P = 1 α,β P = 1 α,β P = 1 2 There is a basis α 1,...,α g,β 1,...,β g such that the Gram matrix for the pairing is ( ) 0 I I 0 An algorithm of Frobenius allows us to find such a basis.

20 Computing period matrices Cycles α i,β i represented as Z-linear combinations of edges e (k) vw : e (k) vw 1 ω i = w v t=0 h i (x(t),y(t)) y f (x(t),y(t)) dt Integral is well-suited for computation using a high-order method, such as Gauss-Legendre. Presently heuristic adaptive integration method Future: Johansen s ARB/ACB library now provides numerical integration with guaranteed error bounds and has a good interface in Sage.

21 Application: Homomorphisms Suppose C 1,C 2 are curves with Jacobians J 1,J 2, with bases for differentials and homology Consider a homomorphism φ : J 1 J 2. T = T φ : H 0 (C 1,Ω 1 C 1 ) H 0 (C 2,Ω 1 C 2 ) R = R φ : H 1 (C 1,Z) H 1 (C 2,Z) T φ M g2,g 1 (C) R φ M 2g2,2g 1 (Z)

22 Application: Homomorphisms Suppose C 1,C 2 are curves with Jacobians J 1,J 2, with bases for differentials and homology Consider a homomorphism φ : J 1 J 2. T = T φ : H 0 (C 1,Ω 1 C 1 ) H 0 (C 2,Ω 1 C 2 ) R = R φ : H 1 (C 1,Z) H 1 (C 2,Z) Lemma: If Ω i = (I gi τ i ) then T φ M g2,g 1 (C) ( ) D B R =, where D,B,C,A M C A g2,g 1 (Z). and T = D + τ 2 C, with B + τ 2 A = (D + τ 2 C)τ 1. R φ M 2g2,2g 1 (Z) Result: 2g 1 g 2 equations with real coefficients in 4g 1 g 2 integer variables, so LLL can find small integer solutions.

23 Application: Idempotents and automorphisms Suppose we have a Z-basis B 1,...,B r for End(J) = Hom(J,J). We can determine idempotents in End(J), which give isogeny factors. We can determine units. If symplectic structure is taken into account, we get a finite group of symplectic automorphisms. The Torelli theorem relates this to Aut(C). Via action on tangent space, we get action of automorphisms on canonical model of C. We can verify automorphisms algebraically this way. Similarly, numerically found endomorphisms can be certified: [Costa-Mascot-Sijsling-Voight, 2016]

24 Example: genus 3 curves (from Sutherland): C 1 : x 2 y 2 xy 3 + x 3 + 2x 2 y + 2xy 2 x 2 y = 0 C 2 : y 2 + (x 4 + x 3 + x 2 + 1)y = x 7 8x 5 4x x 3 3x 2 16x + 8 We find a homomorphism (on homology):

25 Example: non-galois cover Consider C : 4x 6 54x 5 y 729x x 3 y x 2 54xy = 0. From idempotent computations we see for D 2 : y 2 = 16x 5 40x x x 2 32x 23. there is a degree 3 map C D 2, but Aut(C) = Z/2. Construction: From action of idempotent on tangent space, we can construct a projection from canonical model of C to construct D 2.

26 Example: Prym varieties Construction of W.P. Milne (1923) associates to a genus 4 curve (e.g.): C : x 2 + xy + y 2 + 3xz + z 2 yw + w 2 = xyz + xyw + xzw + yzw = 0 a plane quartic: F : 5s s 3 t + 28s s 2 t s 2 t + 44s st st 2 +66st + 18s + 16t t t t + 1 = 0.

27 Example: Prym varieties Construction of W.P. Milne (1923) associates to a genus 4 curve (e.g.): C : x 2 + xy + y 2 + 3xz + z 2 yw + w 2 = xyz + xyw + xzw + yzw = 0 a plane quartic: F : 5s s 3 t + 28s s 2 t s 2 t + 44s st st 2 Unramified double cover of C: +66st + 18s + 16t t t t + 1 = 0. D: u 4 v 4 3u 4 v 2 + u 4 u 3 v 3 2u 3 v + u 2 v 2 u 2 + 3uv 3 +2uv + v 4 + v = 0. Numerical computation: Jac( D) Jac(F) Jac(C). (consisten with Jac(F) being the Prym variety of D C.

28 Example usage sage: E=EllipticCurve([0,1]) sage: S=E.riemann_surface(prec=100) sage: A=S.symplectic_isomorphisms() sage: A=S.symplectic_isomorphisms(); A [ [ 0-1] [ 1 1] [1 0] [ 0 1] [-1-1] [-1 0] [ 1 1], [-1 0], [0 1], [-1-1], [ 1 0], [ 0-1] ] sage: TA=S.tangent_representation_algebraic(A); TA [[a], [-a + 1], [1], [-a], [a - 1], [-1]] sage: parent(ta[0]) Full MatrixSpace of 1 by 1 dense matrices over Number Field in a with defining polynomial y^2 - y + 1