Rigorous computation of the endomorphism ring of a Jacobian Edgar - - PowerPoint PPT Presentation

rigorous computation of the endomorphism ring of a
SMART_READER_LITE
LIVE PREVIEW

Rigorous computation of the endomorphism ring of a Jacobian Edgar - - PowerPoint PPT Presentation

Rigorous computation of the endomorphism ring of a Jacobian Edgar Costa (MIT) Simons Collab. on Arithmetic Geometry, Number Theory, and Computation November 13th, 2019 University of New South Wales Slides available at edgarcosta.org under


slide-1
SLIDE 1

Rigorous computation of the endomorphism ring of a Jacobian

Edgar Costa (MIT)

Simons Collab. on Arithmetic Geometry, Number Theory, and Computation

November 13th, 2019 University of New South Wales

Slides available at edgarcosta.org under Research 1/25

slide-2
SLIDE 2

Polynomials

f(x) = anxn + · · · + a0 ∈ Z[x] Write fp(x) := f(x) mod p

  • Given fp(x) what can we say about f(x)?
  • factorization of fp x
  • factorization of f x

e.g.: fp x irreducible f x irreducible

  • factorization of p in

x f x

  • What can we say about fp x for arbitrary p?
  • For

f 2, quadratic reciprocity gives us that Nf p

p

fp depending only on p f .

  • What about for higher degrees?

studying the statistical properties Nf p .

2/25

slide-3
SLIDE 3

Polynomials

f(x) = anxn + · · · + a0 ∈ Z[x] Write fp(x) := f(x) mod p

  • Given fp(x) what can we say about f(x)?
  • factorization of fp(x) ⇝
  • factorization of f(x)

e.g.: fp(x) irreducible ⇒ f(x) irreducible

  • factorization of p in Q[x]/f(x)
  • What can we say about fp x for arbitrary p?
  • For

f 2, quadratic reciprocity gives us that Nf p

p

fp depending only on p f .

  • What about for higher degrees?

studying the statistical properties Nf p .

2/25

slide-4
SLIDE 4

Polynomials

f(x) = anxn + · · · + a0 ∈ Z[x] Write fp(x) := f(x) mod p

  • Given fp(x) what can we say about f(x)?
  • factorization of fp(x) ⇝
  • factorization of f(x)

e.g.: fp(x) irreducible ⇒ f(x) irreducible

  • factorization of p in Q[x]/f(x)
  • What can we say about fp(x) for arbitrary p?
  • For

f 2, quadratic reciprocity gives us that Nf p

p

fp depending only on p f .

  • What about for higher degrees?

studying the statistical properties Nf p .

2/25

slide-5
SLIDE 5

Polynomials

f(x) = anxn + · · · + a0 ∈ Z[x] Write fp(x) := f(x) mod p

  • Given fp(x) what can we say about f(x)?
  • factorization of fp(x) ⇝
  • factorization of f(x)

e.g.: fp(x) irreducible ⇒ f(x) irreducible

  • factorization of p in Q[x]/f(x)
  • What can we say about fp(x) for arbitrary p?
  • For deg f = 2, quadratic reciprocity gives us that

Nf(p) := #{α ∈ Fp : fp(α) = 0} depending only on p mod ∆(f).

  • What about for higher degrees?

studying the statistical properties Nf p .

2/25

slide-6
SLIDE 6

Polynomials

f(x) = anxn + · · · + a0 ∈ Z[x] Write fp(x) := f(x) mod p

  • Given fp(x) what can we say about f(x)?
  • factorization of fp(x) ⇝
  • factorization of f(x)

e.g.: fp(x) irreducible ⇒ f(x) irreducible

  • factorization of p in Q[x]/f(x)
  • What can we say about fp(x) for arbitrary p?
  • For deg f = 2, quadratic reciprocity gives us that

Nf(p) := #{α ∈ Fp : fp(α) = 0} depending only on p mod ∆(f).

  • What about for higher degrees?

studying the statistical properties Nf p .

2/25

slide-7
SLIDE 7

Polynomials

f(x) = anxn + · · · + a0 ∈ Z[x] Write fp(x) := f(x) mod p

  • Given fp(x) what can we say about f(x)?
  • factorization of fp(x) ⇝
  • factorization of f(x)

e.g.: fp(x) irreducible ⇒ f(x) irreducible

  • factorization of p in Q[x]/f(x)
  • What can we say about fp(x) for arbitrary p?
  • For deg f = 2, quadratic reciprocity gives us that

Nf(p) := #{α ∈ Fp : fp(α) = 0} depending only on p mod ∆(f).

  • What about for higher degrees?

⇝ studying the statistical properties Nf(p).

2/25

slide-8
SLIDE 8

Example: Cubic polynomials

Theorem (Frobenius) Prob(Nf(p) = i) = Prob(g ∈ Gal(f) : g fixes i roots), f x x3 2 x

3 2

x

3 2e2 i 3

x

3 2e4 i 3

Nf p k 1 3 if k 1 2 if k 1 1 6 if k 3 f S3 g x x3 x2 2x 1 x

1

x

2

x

3

Ng p k 2 3 if k 1 3 if k 3 g 3

3/25

slide-9
SLIDE 9

Example: Cubic polynomials

Theorem (Frobenius) Prob(Nf(p) = i) = Prob(g ∈ Gal(f) : g fixes i roots), f(x) = x3 − 2 = ( x −

3

√ 2 ) ( x −

3

√ 2e2πi/3) ( x −

3

√ 2e4πi/3) Prob ( Nf(p) = k ) =        1/3 if k = 0 1/2 if k = 1 1/6 if k = 3. f S3 g(x) = x3 − x2 − 2x + 1 = (x − α1) (x − α2) (x − α3) Prob (Ng(p) = k) =    2/3 if k = 0 1/3 if k = 3. g 3

3/25

slide-10
SLIDE 10

Example: Cubic polynomials

Theorem (Frobenius) Prob(Nf(p) = i) = Prob(g ∈ Gal(f) : g fixes i roots), f(x) = x3 − 2 = ( x −

3

√ 2 ) ( x −

3

√ 2e2πi/3) ( x −

3

√ 2e4πi/3) Prob ( Nf(p) = k ) =        1/3 if k = 0 1/2 if k = 1 1/6 if k = 3. ⇒ Gal(f) = S3 g(x) = x3 − x2 − 2x + 1 = (x − α1) (x − α2) (x − α3) Prob (Ng(p) = k) =    2/3 if k = 0 1/3 if k = 3. ⇒ Gal(g) = Z/3Z

3/25

slide-11
SLIDE 11

Elliptic curves

An elliptic curve is a smooth curve defined by y2 = x3 + ax + b Over R it might look like

  • r

Over C this is a torus There is a natural group structure! If P, Q, and R are colinear, then P Q R

4/25

slide-12
SLIDE 12

Elliptic curves

An elliptic curve is a smooth curve defined by y2 = x3 + ax + b Over R it might look like

  • r

Over C this is a torus There is a natural group structure! If P, Q, and R are colinear, then P + Q + R = 0

4/25

slide-13
SLIDE 13

Elliptic curves

E : y2 = x3 + ax + b, a, b ∈ Z Write Ep E p, for p a prime of good reduction

  • What can we say about

Ep for an arbitrary p?

  • Given

Ep for many p, what can we say about E? studying the statistical properties Ep.

5/25

slide-14
SLIDE 14

Elliptic curves

E : y2 = x3 + ax + b, a, b ∈ Z Write Ep := E mod p, for p a prime of good reduction

  • What can we say about #Ep for an arbitrary p?
  • Given

Ep for many p, what can we say about E? studying the statistical properties Ep.

5/25

slide-15
SLIDE 15

Elliptic curves

E : y2 = x3 + ax + b, a, b ∈ Z Write Ep := E mod p, for p a prime of good reduction

  • What can we say about #Ep for an arbitrary p?
  • Given #Ep for many p, what can we say about E?

studying the statistical properties Ep.

5/25

slide-16
SLIDE 16

Elliptic curves

E : y2 = x3 + ax + b, a, b ∈ Z Write Ep := E mod p, for p a prime of good reduction

  • What can we say about #Ep for an arbitrary p?
  • Given #Ep for many p, what can we say about E?

⇝ studying the statistical properties #Ep.

5/25

slide-17
SLIDE 17

Hasse’s bound

Theorem (Hasse, 1930s) |p + 1 − #Ep| ≤ 2√p. In other words,

p

p 1 Ep p 2 2 What can we say about the error term,

p, as p

?

6/25

slide-18
SLIDE 18

Hasse’s bound

Theorem (Hasse, 1930s) |p + 1 − #Ep| ≤ 2√p. In other words, λp := p + 1 − #Ep √p ∈ [−2, 2] What can we say about the error term, λp, as p → ∞?

6/25

slide-19
SLIDE 19

Two types of elliptic curves

λp := p + 1 − #Ep √p ∈ [−2, 2] There are two limiting distributions for λp

  • rdinary

special E E

p

1 p

p

1 2

7/25

slide-20
SLIDE 20

Two types of elliptic curves

λp := p + 1 − #Ep √p ∈ [−2, 2] There are two limiting distributions for λp

  • rdinary

special E E

  • 2
  • 1

1 2

  • 2
  • 1

1 2

p

1 p

p

1 2

7/25

slide-21
SLIDE 21

Two types of elliptic curves

λp := p + 1 − #Ep √p ∈ [−2, 2] There are two limiting distributions for λp

  • rdinary

special End Eal = Z End Eal ̸= Z

  • 2
  • 1

1 2

  • 2
  • 1

1 2

p

1 p

p

1 2

7/25

slide-22
SLIDE 22

Two types of elliptic curves

λp := p + 1 − #Ep √p ∈ [−2, 2] There are two limiting distributions for λp

  • rdinary

special End Eal = Z End Eal ̸= Z

  • 2
  • 1

1 2

  • 2
  • 1

1 2

Prob(λp = 0) ? ∼ 1/√p Prob(λp = 0) = 1/2

7/25

slide-23
SLIDE 23

Two types of elliptic curves

Over C an elliptic curve E is a torus EC ≃ C/Λ, where Λ = ω1Z + ω2Z = and we have End Eal = End Λ

  • rdinary

special d

2 1

d for some d non-CM CM

8/25

slide-24
SLIDE 24

Two types of elliptic curves

Over C an elliptic curve E is a torus EC ≃ C/Λ, where Λ = ω1Z + ω2Z = and we have End Eal = End Λ

  • rdinary

special End Λ = Z Z ⊊ End(Λ) ⊂ Q( √ −d) ω2/ω1 ∈ Q( √ −d) for some d > 0 non-CM CM

  • 2
  • 1

1 2

  • 2
  • 1

1 2

8/25

slide-25
SLIDE 25

How to distinguish between the two types?

non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

It is enough to count points!

  • p

1 Ep ap E a2

p

4p

  • CM

d a2

p

4p .

  • non-CM

a2

p

4p a2

q

4q for p q w/prob 1.

9/25

slide-26
SLIDE 26

How to distinguish between the two types?

non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

It is enough to count points!

  • p + 1 − #Ep =: ap ̸= 0 =

⇒ EndQ Eal ⊂ Q (√ a2

p − 4p

)

  • CM

d a2

p

4p .

  • non-CM

a2

p

4p a2

q

4q for p q w/prob 1.

9/25

slide-27
SLIDE 27

How to distinguish between the two types?

non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

It is enough to count points!

  • p + 1 − #Ep =: ap ̸= 0 =

⇒ EndQ Eal ⊂ Q (√ a2

p − 4p

)

  • CM ⇒ Q(

√ −d) ≃ Q (√ a2

p − 4p

) .

  • non-CM

a2

p

4p a2

q

4q for p q w/prob 1.

9/25

slide-28
SLIDE 28

How to distinguish between the two types?

non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

It is enough to count points!

  • p + 1 − #Ep =: ap ̸= 0 =

⇒ EndQ Eal ⊂ Q (√ a2

p − 4p

)

  • CM ⇒ Q(

√ −d) ≃ Q (√ a2

p − 4p

) .

  • non-CM ⇒ Q

(√ a2

p − 4p

) ̸≃ Q (√ a2

q − 4q

) for p ̸= q w/prob 1.

9/25

slide-29
SLIDE 29

Examples

ap := p + 1 − #Ep ∈ [−2√p, 2√p] E : y2 + y = x3 − x2 − 10x − 20 (11.a2)

  • EndQ Eal

2 ≃ Q(√−1)

  • EndQ Eal

3 ≃ Q(√−11)

  • ⇒ EndQ Eal = Q

E y2 y x3 7 (27.a2)

  • p

2 3 ap Ep is a Quaternion algebra

  • p

1 3 Ep 3

  • E

3

10/25

slide-30
SLIDE 30

Examples

ap := p + 1 − #Ep ∈ [−2√p, 2√p] E : y2 + y = x3 − x2 − 10x − 20 (11.a2)

  • EndQ Eal

2 ≃ Q(√−1)

  • EndQ Eal

3 ≃ Q(√−11)

  • ⇒ EndQ Eal = Q

E : y2 + y = x3 − 7 (27.a2)

  • p = 2 mod 3 ⇒ ap = 0 ⇒ EndQ Eal

p is a Quaternion algebra

  • p = 1 mod 3 ⇒ EndQ Eal

p ≃ Q(

√ −3)

  • ⇝ EndQ Eal = Q(

√ −3)

10/25

slide-31
SLIDE 31

Group-theoretic interpretation

There is a simple group-theoretic descriptions for these histograms!

  • To E we associate a compact Lie group STE

SU 2

  • This group is know as the Sato–Tate group of E.
  • You may think of it as the “Galois” group of E.

Then, the ap are distributed as the trace of a matrix chosen at random from STE with respect to its Haar measure. non-CM CM CM (with the ) SU 2 U 1

SU 2 U 1 11/25

slide-32
SLIDE 32

Group-theoretic interpretation

There is a simple group-theoretic descriptions for these histograms!

  • To E we associate a compact Lie group STE ⊂ SU(2)
  • This group is know as the Sato–Tate group of E.
  • You may think of it as the “Galois” group of E.

Then, the ap are distributed as the trace of a matrix chosen at random from STE with respect to its Haar measure. non-CM CM CM (with the ) SU 2 U 1

SU 2 U 1 11/25

slide-33
SLIDE 33

Group-theoretic interpretation

There is a simple group-theoretic descriptions for these histograms!

  • To E we associate a compact Lie group STE ⊂ SU(2)
  • This group is know as the Sato–Tate group of E.
  • You may think of it as the “Galois” group of E.

Then, the ap are distributed as the trace of a matrix chosen at random from STE with respect to its Haar measure. non-CM CM CM (with the δ) SU(2) U(1) NSU(2)(U(1))

  • 2
  • 1

1 2

  • 2
  • 1

1 2

  • 2
  • 1

1 2 11/25

slide-34
SLIDE 34

Genus 2 curves

An genus 2 curve is a smooth curve defined by y2 = f(x), deg f = 5 or 6 Over R it might look like Now pairs of points have a natural group structure Over this group structure realizes as

2 12/25

slide-35
SLIDE 35

Genus 2 curves

An genus 2 curve is a smooth curve defined by y2 = f(x), deg f = 5 or 6 Over R it might look like Now pairs of points have a natural group structure Over this group structure realizes as

2 12/25

slide-36
SLIDE 36

Genus 2 curves

An genus 2 curve is a smooth curve defined by y2 = f(x), deg f = 5 or 6 Over R it might look like Now pairs of points have a natural group structure Over C this group structure realizes as C2/Λ ≃

12/25

slide-37
SLIDE 37

An example, C : y2 = x5 − 5x3 + 4x + 1

  • 3
  • 2
  • 1

1 2 3

  • 10
  • 5

5 10

13/25

slide-38
SLIDE 38

An example, C : y2 = x5 − 5x3 + 4x + 1

  • 3
  • 2
  • 1

1 2 3

  • 10
  • 5

5 10

D1 := (−2, 1) + (0, 1) D2 := (2, 1) + (3, −11)

13/25

slide-39
SLIDE 39

An example, C : y2 = x5 − 5x3 + 4x + 1

  • 3
  • 2
  • 1

1 2 3

  • 10
  • 5

5 10

13/25

slide-40
SLIDE 40

An example, C : y2 = x5 − 5x3 + 4x + 1

  • 3
  • 2
  • 1

1 2 3

  • 10
  • 5

5 10

D3 := (

− √ 209−23 32

, −115

√ 209−1333 2048

) + ( √

209−23 32

, 115

√ 209−1333 2048

)

13/25

slide-41
SLIDE 41

An example, C : y2 = x5 − 5x3 + 4x + 1

  • 3
  • 2
  • 1

1 2 3

  • 10
  • 5

5 10

(• + •) + (• + •) + (• + •) = 0

13/25

slide-42
SLIDE 42

Real endomorphisms algebras in genus 2

There are 6 possibilities for the real endomorphism algebra1: Abelian surface EndR Aal square of CM elliptic curve M2(C)

  • QM abelian surface

M2(R)

  • square of non-CM elliptic curve
  • CM abelian surface

C × C

  • product of CM elliptic curves

product of CM and non-CM elliptic curves C × R

  • RM abelian surface

R × R

  • product of non-CM elliptic curves

generic abelian surface R Can we distinguish between these by looking at A p?

1and 54 possibilites for Sato–Tate groups

14/25

slide-43
SLIDE 43

Real endomorphisms algebras in genus 2

There are 6 possibilities for the real endomorphism algebra1: Abelian surface EndR Aal square of CM elliptic curve M2(C)

  • QM abelian surface

M2(R)

  • square of non-CM elliptic curve
  • CM abelian surface

C × C

  • product of CM elliptic curves

product of CM and non-CM elliptic curves C × R

  • RM abelian surface

R × R

  • product of non-CM elliptic curves

generic abelian surface R Can we distinguish between these by looking at A mod p?

1and 54 possibilites for Sato–Tate groups

14/25

slide-44
SLIDE 44

Zeta functions and Frobenius polynomials

C/Q a nice curve of genus g and p a prime of good reduction Zp(T) := exp ( ∞ ∑

r=1

#C(Fpr)Tr/r ) ∈ Q(t) where deg Lp(T) and Lp(T) = det(1 − t Frobp |H1(C)) = det(1 − t Frobp |H1(A)), where A := Jac(C).

  • g

1 Lp T 1 apT pT2

  • g

2 Lp T 1 ap 1T ap 2T2 ap 1pT3 p2T4 Lp T gives us a lot of information about Ap A p

15/25

slide-45
SLIDE 45

Zeta functions and Frobenius polynomials

C/Q a nice curve of genus g and p a prime of good reduction Zp(T) := exp ( ∞ ∑

r=1

#C(Fpr)Tr/r ) = Lp(T) (1 − T)(1 − pT) where deg Lp(T) and Lp(T) = det(1 − t Frobp |H1(C)) = det(1 − t Frobp |H1(A)), where A := Jac(C).

  • g = 1 ⇝ Lp(T) = 1 − apT + pT2
  • g = 2 ⇝ Lp(T) = 1 − ap,1T + ap,2T2 − ap,1pT3 + p2T4

Lp T gives us a lot of information about Ap A p

15/25

slide-46
SLIDE 46

Zeta functions and Frobenius polynomials

C/Q a nice curve of genus g and p a prime of good reduction Zp(T) := exp ( ∞ ∑

r=1

#C(Fpr)Tr/r ) = Lp(T) (1 − T)(1 − pT) where deg Lp(T) and Lp(T) = det(1 − t Frobp |H1(C)) = det(1 − t Frobp |H1(A)), where A := Jac(C).

  • g = 1 ⇝ Lp(T) = 1 − apT + pT2
  • g = 2 ⇝ Lp(T) = 1 − ap,1T + ap,2T2 − ap,1pT3 + p2T4

Lp(T) gives us a lot of information about Ap := A mod p

15/25

slide-47
SLIDE 47

Endomorphism algebras over finite fields

Theorem (Tate) Let A be an abelian variety over Fq. Given det(1 − t Frob |H1(A)), we may compute rk End(AFqr), ∀r≥1. Honda–Tate theory gives us A

qr

up to isomorphism Example If L5 T 1 2T2 25T4, then:

  • all endomorphisms are defined over

25, and

  • A

25 is isogenous to a square of an elliptic curve

  • A

M2 6

16/25

slide-48
SLIDE 48

Endomorphism algebras over finite fields

Theorem (Tate) Let A be an abelian variety over Fq. Given det(1 − t Frob |H1(A)), we may compute rk End(AFqr), ∀r≥1. Honda–Tate theory = ⇒ gives us EndQ(AFqr) up to isomorphism Example If L5 T 1 2T2 25T4, then:

  • all endomorphisms are defined over

25, and

  • A

25 is isogenous to a square of an elliptic curve

  • A

M2 6

16/25

slide-49
SLIDE 49

Endomorphism algebras over finite fields

Theorem (Tate) Let A be an abelian variety over Fq. Given det(1 − t Frob |H1(A)), we may compute rk End(AFqr), ∀r≥1. Honda–Tate theory = ⇒ gives us EndQ(AFqr) up to isomorphism Example If L5(T) = 1 − 2T2 + 25T4, then:

  • all endomorphisms are defined over F25, and
  • AF25 is isogenous to a square of an elliptic curve
  • EndQ Aal ≃ M2(Q(

√ −6))

16/25

slide-50
SLIDE 50

Example continued

A = Jac(y2 = x5 − x4 + 4x3 − 8x2 + 5x − 1) (262144.d.524288.1) For p = 5, L5(T) = 1 − 2T2 + 25T4, and:

  • all endomorphisms of A5 are defined over F25
  • det(1 − T Frob2

5 |H1(A)) = (1 − 2T + 25T2)2

  • A5 over F25 is isogenous to a square of an elliptic curve
  • EndQ Aal

5 ≃ M2(Q(

√ −6)) For p 7, L7 T 1 6T2 49T4, and:

  • all endomorphisms of A7 are defined over

49

  • 1

T

2 7 H1 A

1 6T 49T2 2

  • A7 over

49 is isogenous to a square of an elliptic curve

  • A7

M2 10 A M2

17/25

slide-51
SLIDE 51

Example continued

A = Jac(y2 = x5 − x4 + 4x3 − 8x2 + 5x − 1) (262144.d.524288.1) For p = 5, L5(T) = 1 − 2T2 + 25T4, and:

  • all endomorphisms of A5 are defined over F25
  • det(1 − T Frob2

5 |H1(A)) = (1 − 2T + 25T2)2

  • A5 over F25 is isogenous to a square of an elliptic curve
  • EndQ Aal

5 ≃ M2(Q(

√ −6)) For p = 7, L7(T) = 1 + 6T2 + 49T4, and:

  • all endomorphisms of A7 are defined over F49
  • det(1 − T Frob2

7 |H1(A)) = (1 + 6T + 49T2)2

  • A7 over F49 is isogenous to a square of an elliptic curve
  • EndQ Aal

7 ≃ M2(Q(

√ −10)) A M2

17/25

slide-52
SLIDE 52

Example continued

A = Jac(y2 = x5 − x4 + 4x3 − 8x2 + 5x − 1) (262144.d.524288.1) For p = 5, L5(T) = 1 − 2T2 + 25T4, and:

  • all endomorphisms of A5 are defined over F25
  • det(1 − T Frob2

5 |H1(A)) = (1 − 2T + 25T2)2

  • A5 over F25 is isogenous to a square of an elliptic curve
  • EndQ Aal

5 ≃ M2(Q(

√ −6)) For p = 7, L7(T) = 1 + 6T2 + 49T4, and:

  • all endomorphisms of A7 are defined over F49
  • det(1 − T Frob2

7 |H1(A)) = (1 + 6T + 49T2)2

  • A7 over F49 is isogenous to a square of an elliptic curve
  • EndQ Aal

7 ≃ M2(Q(

√ −10)) ⇒ EndR Aal ̸= M2(C)

17/25

slide-53
SLIDE 53

Upper bounds for the endomorphism ring

Let K be a numberfield such that End AK = End Aal , then

  • AK

t i 1 Ani i ,

  • Ai unique and simple up to isogeny (over K),
  • Bi

Ai central simple algebra over Li Z Bi ,

  • Li Bi

e2

i ,

  • AK

t i 1 Mni Bi

Theorem (C–Mascot–Sijsling–Voight, C–Lombardo–Voight) If Mumford–Tate conjecture holds for A, then we can compute

  • t
  • eini ni

Ai

t i 1

  • Li

This is practical and its done by counting points (=computing Lp)

18/25

slide-54
SLIDE 54

Upper bounds for the endomorphism ring

Let K be a numberfield such that End AK = End Aal, then

  • AK ∼ ∏t

i=1 Ani i ,

  • Ai unique and simple up to isogeny (over K),
  • Bi := EndQ Ai central simple algebra over Li := Z(Bi),
  • dimLi Bi = e2

i ,

  • EndQ AK = ∏t

i=1 Mni(Bi)

Theorem (C–Mascot–Sijsling–Voight, C–Lombardo–Voight) If Mumford–Tate conjecture holds for A, then we can compute

  • t
  • eini ni

Ai

t i 1

  • Li

This is practical and its done by counting points (=computing Lp)

18/25

slide-55
SLIDE 55

Upper bounds for the endomorphism ring

Let K be a numberfield such that End AK = End Aal, then

  • AK ∼ ∏t

i=1 Ani i ,

  • Ai unique and simple up to isogeny (over K),
  • Bi := EndQ Ai central simple algebra over Li := Z(Bi),
  • dimLi Bi = e2

i ,

  • EndQ AK = ∏t

i=1 Mni(Bi)

Theorem (C–Mascot–Sijsling–Voight, C–Lombardo–Voight) If Mumford–Tate conjecture holds for A, then we can compute

  • t
  • {(eini, ni dim Ai)}t

i=1

  • Li

This is practical and its done by counting points (=computing Lp) 18/25

slide-56
SLIDE 56

Real endomorphisms algebras, {eini, ni dim Ai}t

i=1, and dim Li

Abelian surface EndR Aal tuples dim Li square of CM elliptic crv M2(C) {(2, 2)} 2

  • QM abelian surface

M2(R) {(2, 2)} 1

  • square of non-CM elliptic crv
  • CM abelian surface

C × C {(1, 2)} 4

  • product of CM elliptic crv

{(1, 1), (1, 1)} 2, 2 CM × non-CM elliptic crvs C × R {(1, 1), (1, 1)} 2, 1

  • RM abelian surface

R × R {(1, 2)} 2

  • prod. of non-CM elliptic crv

{(1, 1), (1, 1)} 1, 1 generic abelian surface R {(1, 1)} 1

19/25

slide-57
SLIDE 57

Example continued

A = Jac(y2 = x5 − x4 + 4x3 − 8x2 + 5x − 1) (262144.d.524288.1)

  • EndQ Aal

3 ≃ M2(Q(

√ −3))

  • EndQ Aal

5 ≃ M2(Q(

√ −6))

  • ⇒ EndR Aal ̸= M2(C)

Question Write B := EndQ Aal and assume that B is a quaternion algr. Can we guess disc B? If is ramified in B cannot split in

p

  • 5 13 17

B, as they split in 3

  • 7 11

B, as they split in 6 We can rule out all the primes except 2 and 3 (up to some bnd). Indeed, B 6.

20/25

slide-58
SLIDE 58

Example continued

A = Jac(y2 = x5 − x4 + 4x3 − 8x2 + 5x − 1) (262144.d.524288.1)

  • EndQ Aal

3 ≃ M2(Q(

√ −3))

  • EndQ Aal

5 ≃ M2(Q(

√ −6))

  • ⇒ EndR Aal ̸= M2(C)

Question Write B := EndQ Aal and assume that B is a quaternion algr. Can we guess disc B? If ℓ is ramified in B ⇒ ℓ cannot split in Q(Frobp)

  • 5, 13, 17 ∤ disc B, as they split in Q(

√ −3)

  • 7, 11 ∤ disc B, as they split in Q(

√ −6) We can rule out all the primes except 2 and 3 (up to some bnd). Indeed, B 6.

20/25

slide-59
SLIDE 59

Example continued

A = Jac(y2 = x5 − x4 + 4x3 − 8x2 + 5x − 1) (262144.d.524288.1)

  • EndQ Aal

3 ≃ M2(Q(

√ −3))

  • EndQ Aal

5 ≃ M2(Q(

√ −6))

  • ⇒ EndR Aal ̸= M2(C)

Question Write B := EndQ Aal and assume that B is a quaternion algr. Can we guess disc B? If ℓ is ramified in B ⇒ ℓ cannot split in Q(Frobp)

  • 5, 13, 17 ∤ disc B, as they split in Q(

√ −3)

  • 7, 11 ∤ disc B, as they split in Q(

√ −6) We can rule out all the primes except 2 and 3 (up to some bnd). Indeed, disc B = 6.

20/25

slide-60
SLIDE 60

Lower bounds for the endomorphism ring

  • C be a nice curve of genus g over a number field
  • Jac(C) ≃C Cg/Λ
  • End Jac(C)al ≃ End Cg/Λ ≃ End Λ

Question Can we compute End Jac(C)al?

21/25

slide-61
SLIDE 61

Numerical approach

Question Can we compute End Jac(C)al? End Jac(C)al ≃ End Cg/Λ ≃ End Λ Let the columns of Π ∈ Mg,2g(C) be a basis for Λ. The isomorphism above is realized by MΠ = ΠR, where M ∈ Mg(Qal) and R ∈ M2g(Z). Thus by computing Π, we may compute End Λ numerically.

22/25

slide-62
SLIDE 62

Numerical endomorphism ring (Example continued)

C : y2 = x5 − x4 + 4x3 − 8x2 + 5x − 1 (262144.d.524288.1) Given Π (with 600 digits) Π ≈ ( 1.851 − 0.1795i 3.111 + 2.027i −1.517 + 0.08976i 1.851 0.8358 − 2.866i 0.3626 + 0.1269i −1.727 + 1.433i 0.8358 ) we can verify Jac(C) has numerical quaternionic multiplication. For example, we have α

?

∈ End(Jac(C)C) where Mα = ( √ 2 √ 2 ) and Rα =      −3 −1 −2 1 −4 −2 4 −3      , which satisfies α2 = 2.

23/25

slide-63
SLIDE 63

Lower bounds for the endomorphism ring

  • C be a nice curve of genus g over a number field
  • Jac(C) ≃C Cg/Λ
  • End Jac(C)al ≃ End Cg/Λ ≃ End Λ

Theorem (C–Mascot–Sijsling–Voight) There exists a deterministic algorithm that, given input α ∈ Mg(Qal), returns    true α ∈ End Jac(C)al and α is nondegenerate2, false α / ∈ End Jac(C)al or α is degenerate.

2i.e., not in the locus of indeterminancy of the Mumford map

24/25

slide-64
SLIDE 64

Lower bounds for the endomorphism ring

Theorem (C–Mascot–Sijsling–Voight) There exists a deterministic algorithm that, given input α ∈ Mg(Qal), returns    true α ∈ End Jac(C)al and α is nondegenerate3, false α / ∈ End Jac(C)al or α is degenerate. Idea:

  • α represents an action on the tangent space
  • locally this corresponds to system of differential eqns
  • solve it locally and match it with a divisor of C × C

3i.e., not in the locus of indeterminancy of the Mumford map

25/25