Frobenius Distributions Edgar Costa (MIT) Simons Collab. on - - PowerPoint PPT Presentation

frobenius distributions
SMART_READER_LITE
LIVE PREVIEW

Frobenius Distributions Edgar Costa (MIT) Simons Collab. on - - PowerPoint PPT Presentation

Frobenius Distributions Edgar Costa (MIT) Simons Collab. on Arithmetic Geometry, Number Theory, and Computation April 23rd, 2019 University of Washington Slides available at edgarcosta.org under Research factorization of f p x e.g.: f p x


slide-1
SLIDE 1

Frobenius Distributions

Edgar Costa (MIT)

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

April 23rd, 2019 University of Washington

Slides available at edgarcosta.org under Research

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 .

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 .

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 .

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 .

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 .

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).

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

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

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

slide-11
SLIDE 11

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.

slide-12
SLIDE 12

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.

slide-13
SLIDE 13

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.

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.

slide-15
SLIDE 15

Hasse’s bound

Theorem (Hasse) #Ep = p + 1 − ap, ap ∈ [−2√p, 2√p] Alternatively, we could also have written the formula above as Ep L 1 where L T 1 apT pT2 1 T

p H1 E

ap p 1 Ep

p

2 p 2 p Question What can we say about the error term ap p as p ?

slide-16
SLIDE 16

Hasse’s bound

Theorem (Hasse) #Ep = p + 1 − ap, ap ∈ [−2√p, 2√p] Alternatively, we could also have written the formula above as #Ep =L(1), where L(T) =1 − apT + pT2 = det(1 − T Frobp |H1(E)) ap :=p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] Question What can we say about the error term ap p as p ?

slide-17
SLIDE 17

Hasse’s bound

Theorem (Hasse) #Ep = p + 1 − ap, ap ∈ [−2√p, 2√p] Alternatively, we could also have written the formula above as #Ep =L(1), where L(T) =1 − apT + pT2 = det(1 − T Frobp |H1(E)) ap :=p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] Question What can we say about the error term ap/√p as p → ∞?

slide-18
SLIDE 18

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM E E d Over an elliptic curve E is a torus E where

1 2

and we have E

slide-19
SLIDE 19

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM E E d

  • 2
  • 1

1 2

  • 2
  • 1

1 2

Over an elliptic curve E is a torus E where

1 2

and we have E

slide-20
SLIDE 20

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

Over an elliptic curve E is a torus E where

1 2

and we have E

slide-21
SLIDE 21

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

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

slide-22
SLIDE 22

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

ap 1 p ap 1 2 ap

p

Ep

slide-23
SLIDE 23

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

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

p

Ep

slide-24
SLIDE 24

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

Prob(ap = 0) ? ∼ 1/√p Prob(ap = 0) = 1/2 ap = 0 ⇐ ⇒ Q(Frobp) ⊊ EndQ Epal

slide-25
SLIDE 25

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

Prob(ap = 0) ? ∼ 1/√p Prob(ap = 0) = 1/2 ap = 0 ⇐ ⇒ Q(Frobp) ⊊ EndQ Epal ⇐ ⇒ dim EndQ Epal > 2

slide-26
SLIDE 26

Two types of elliptic curves

ap := p + 1 − #Ep = Tr Frobp ∈ [−2√p, 2√p] There are two limiting distributions for ap/√p non-CM CM EndQ Eal = Q EndQ Eal = Q( √ −d)

  • 2
  • 1

1 2

  • 2
  • 1

1 2

Prob(ap = 0) ? ∼ 1/√p Prob(ap = 0) = 1/2 ap = 0 ⇐ ⇒ Q(Frobp) ⊊ EndQ Epal ⇐ ⇒ dim EndQ Epal > 2 = min

q dim EndQ Eal q

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

  • EndQ Eal ֒

→ EndQ Eal

p ←

֓ Q(Frobp)

  • ap ̸= 0 ⇐

⇒ EndQ Epal is a quadratic field

  • If E has CM and ap

0, then E Ep .

  • If E is non-CM, then

Ep Eq with prob. 1.

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

  • EndQ Eal ֒

→ EndQ Eal

p ←

֓ Q(Frobp)

  • ap ̸= 0 ⇐

⇒ EndQ Epal is a quadratic field

  • If E has CM and ap ̸= 0, then EndQ Eal ≃ EndQ Eal

p .

  • If E is non-CM, then

Ep Eq with prob. 1.

slide-29
SLIDE 29

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

  • EndQ Eal ֒

→ EndQ Eal

p ←

֓ Q(Frobp)

  • ap ̸= 0 ⇐

⇒ EndQ Epal is a quadratic field

  • If E has CM and ap ̸= 0, then EndQ Eal ≃ EndQ Eal

p .

  • If E is non-CM, then EndQ Eal

p ∩ EndQ Eal q ≃ Q with prob. 1.

slide-30
SLIDE 30

Examples

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

slide-31
SLIDE 31

Examples

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)

slide-32
SLIDE 32

Genus 2 curves/Abelian surfaces

A := Jac(C : y2 = a6x6 + · · · + a0) There are 6 possibilities for the real endomorphism algebra: Abelian surface A square of CM elliptic curve M2

  • QM abelian surface

M2

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

product of CM and non-CM elliptic curves

  • RM abelian surface
  • product of non-CM elliptic curves

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

slide-33
SLIDE 33

Genus 2 curves/Abelian surfaces

A := Jac(C : y2 = a6x6 + · · · + a0) There are 6 possibilities for the real endomorphism algebra: 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?

slide-34
SLIDE 34

Genus 2 curves/Abelian surfaces

A := Jac(C : y2 = a6x6 + · · · + a0) There are 6 possibilities for the real endomorphism algebra: 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?

slide-35
SLIDE 35

Zeta functions and Frobenius polynomials

  • C/Q a nice curve of genus g
  • A := Jac(C)
  • p a prime of good reduction

Zp(T) := exp ( ∞ ∑

r=1

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

  • 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

slide-36
SLIDE 36

Zeta functions and Frobenius polynomials

  • C/Q a nice curve of genus g
  • A := Jac(C)
  • 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) = 2g and Lp(T) = det(1 − t Frobp |H1(C)) = det(1 − t Frobp |H1(A))

  • 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

slide-37
SLIDE 37

Zeta functions and Frobenius polynomials

  • C/Q a nice curve of genus g
  • A := Jac(C)
  • 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) = 2g and Lp(T) = det(1 − t Frobp |H1(C)) = det(1 − t Frobp |H1(A))

  • 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

slide-38
SLIDE 38

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

slide-39
SLIDE 39

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

slide-40
SLIDE 40

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))

slide-41
SLIDE 41

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

slide-42
SLIDE 42

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

slide-43
SLIDE 43

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)

slide-44
SLIDE 44

Same Lp, different approach

We could have looked at the lattice Néron–Severi lattice. NS(Aal) ֒ → NS(Aal

p )

  • rk NS(Aal) ∈ {1, 2, 3, 4}
  • rk NS(Aal

p ) ∈ {2, 4, 6}

Example

  • rk NS(Aal

5 ) = rk NS(Aal 7 ) = 4

  • disc NS(Aal

5 ) = −6 mod Q×2

  • disc NS(Aal

7 ) = −10 mod Q×2

⇒ rk NS(Aal) ≤ 3 Fact By a theorem of Charles, we know that at some point this method will attain a tight upper bound for rk NS(Aal).

slide-45
SLIDE 45

Real endomorphisms algebras and Picard numbers

Abelian surface EndR Aal rk NS(Aal) square of CM elliptic curve M2(C) 4

  • QM abelian surface

M2(R) 3

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

C × C 2

  • product of CM elliptic curves

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

  • RM abelian surface

R × R 2

  • product of non-CM elliptic curves

generic abelian surface R 1

slide-46
SLIDE 46

Higher genus

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)

slide-47
SLIDE 47

Higher genus

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)

slide-48
SLIDE 48

Higher genus

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)

slide-49
SLIDE 49

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

slide-50
SLIDE 50

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.

slide-51
SLIDE 51

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.

slide-52
SLIDE 52

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.

slide-53
SLIDE 53

K3 surfaces

K3 surfaces are a possible generalization of elliptic curves They may arise in many ways:

  • smooth quartic surfaces in P3

X : f(x, y, z, w) = 0, deg f = 4

  • double cover of P2 branched over a sextic curve

X : w2 = f(x, y, z), deg f = 6 Can we play similar game as before? In this case, instead of studying Xp or

p we study

p Xp 2 4 22

slide-54
SLIDE 54

K3 surfaces

K3 surfaces are a possible generalization of elliptic curves They may arise in many ways:

  • smooth quartic surfaces in P3

X : f(x, y, z, w) = 0, deg f = 4

  • double cover of P2 branched over a sextic curve

X : w2 = f(x, y, z), deg f = 6 Can we play similar game as before? In this case, instead of studying Xp or

p we study

p Xp 2 4 22

slide-55
SLIDE 55

K3 surfaces

K3 surfaces are a possible generalization of elliptic curves They may arise in many ways:

  • smooth quartic surfaces in P3

X : f(x, y, z, w) = 0, deg f = 4

  • double cover of P2 branched over a sextic curve

X : w2 = f(x, y, z), deg f = 6 Can we play similar game as before? In this case, instead of studying #Xp or Tr Frobp we study p − → rk NS Xpal ∈ {2, 4, . . . , 22}

slide-56
SLIDE 56

K3 Surfaces

X/Q a K3 surface p − → rk NS Xpal ∈ {2, 4, . . . , 22} This is analogous to studying: p − → rk End Epal ∈ {2, 4} Recall that:

  • Ep

4 ap

  • ap

1 p

if E is non-CM (Lang–Trotter) 1 2 if E has CM by d In the later case, p ap p p is ramified or inert in d

slide-57
SLIDE 57

K3 Surfaces

X/Q a K3 surface p − → rk NS Xpal ∈ {2, 4, . . . , 22} This is analogous to studying: p − → rk End Epal ∈ {2, 4} Recall that:

  • rk End Epal = 4 ⇐

⇒ ap = 0

  • Prob(ap = 0) =

  

?

1 √p

if E is non-CM (Lang–Trotter) 1/2 if E has CM by Q( √ −d) In the later case, p ap p p is ramified or inert in d

slide-58
SLIDE 58

K3 Surfaces

X/Q a K3 surface p − → rk NS Xpal ∈ {2, 4, . . . , 22} This is analogous to studying: p − → rk End Epal ∈ {2, 4} Recall that:

  • rk End Epal = 4 ⇐

⇒ ap = 0

  • Prob(ap = 0) =

  

?

1 √p

if E is non-CM (Lang–Trotter) 1/2 if E has CM by Q( √ −d) In the later case, {p : ap = 0} = {p : p is ramified or inert in Q( √ −d)}

slide-59
SLIDE 59

Néron–Severi group

  • NS • = Néron–Severi group of • ≃ {curves on •}/ ∼
  • ρ(•) = rk NS •
  • Xp := X mod p

X X X 1 2 20 Xp Xp Xp 2 4 22 Theorem (Charles) For infinitely many p we have Xp

q

Xq .

slide-60
SLIDE 60

Néron–Severi group

  • NS • = Néron–Severi group of • ≃ {curves on •}/ ∼
  • ρ(•) = rk NS •
  • Xp := X mod p

X

  • NS Xal
  • ρ(Xal)
  • ???
  • ∈ {1, 2, . . . , 20}

Xp

NS Xpal ρ(Xpal)

∈ {2, 4, . . . 22} Theorem (Charles) For infinitely many p we have Xp

q

Xq .

slide-61
SLIDE 61

Néron–Severi group

  • NS • = Néron–Severi group of • ≃ {curves on •}/ ∼
  • ρ(•) = rk NS •
  • Xp := X mod p

X

  • NS Xal
  • ρ(Xal)
  • ???
  • ∈ {1, 2, . . . , 20}

Xp

NS Xpal ρ(Xpal)

∈ {2, 4, . . . 22} Theorem (Charles) For infinitely many p we have ρ(Xpal) = minq ρ(Xqal).

slide-62
SLIDE 62

The Problem

X

  • NS Xal
  • ρ(Xal)
  • ???
  • ∈ {1, 2, . . . , 20}

Xp

NS Xpal ρ(Xpal)

∈ {2, 4, . . . 22} Theorem (Charles) For infinitely many p we have ρ(Xpal) = minq ρ(Xqal). What can we say about the following:

  • Πjump(X) :=

{ p : ρ(Xpal) > minq ρ(Xqal) }

  • X B

p B p

jump X

p B as B Let’s do some numerical experiments!

slide-63
SLIDE 63

The Problem

X

  • NS Xal
  • ρ(Xal)
  • ???
  • ∈ {1, 2, . . . , 20}

Xp

NS Xpal ρ(Xpal)

∈ {2, 4, . . . 22} Theorem (Charles) For infinitely many p we have ρ(Xpal) = minq ρ(Xqal). What can we say about the following:

  • Πjump(X) :=

{ p : ρ(Xpal) > minq ρ(Xqal) }

  • γ(X, B) := # {p ≤ B : p ∈ Πjump(X)}

# {p ≤ B} as B → ∞ Let’s do some numerical experiments!

slide-64
SLIDE 64

The Problem

X

  • NS Xal
  • ρ(Xal)
  • ???
  • ∈ {1, 2, . . . , 20}

Xp

NS Xpal ρ(Xpal)

∈ {2, 4, . . . 22} Theorem (Charles) For infinitely many p we have ρ(Xpal) = minq ρ(Xqal). What can we say about the following:

  • Πjump(X) :=

{ p : ρ(Xpal) > minq ρ(Xqal) }

  • γ(X, B) := # {p ≤ B : p ∈ Πjump(X)}

# {p ≤ B} as B → ∞ Let’s do some numerical experiments!

slide-65
SLIDE 65

Two generic K3 surfaces, ρ(Xal) = 1

γ(X, B) ? ∼ cX √ B , B → ∞ p

jump X

1 p

Why?

slide-66
SLIDE 66

Two generic K3 surfaces, ρ(Xal) = 1

γ(X, B) ? ∼ cX √ B , B → ∞ = ⇒ Prob(p ∈ Πjump(X)) ? ∼ 1/√p

Why?

slide-67
SLIDE 67

Two generic K3 surfaces, ρ(Xal) = 1

γ(X, B) ? ∼ cX √ B , B → ∞ = ⇒ Prob(p ∈ Πjump(X)) ? ∼ 1/√p

Why?

slide-68
SLIDE 68

Three K3 surfaces with ρ(Xal) = 2

No obvious trend… Could it be related to some integer being a square modulo p?

slide-69
SLIDE 69

Three K3 surfaces with ρ(Xal) = 2

No obvious trend… Could it be related to some integer being a square modulo p?

slide-70
SLIDE 70

Three K3 surfaces with ρ(Xal) = 2

No obvious trend… Could it be related to some integer being a square modulo p?

slide-71
SLIDE 71

We can explain the 1/2

Theorem (C, C–Elsenhans–Jahnel) If ρ(Xal) = minq ρ(Xpal), then there is a dX ∈ Z such that: { p > 2 : p inert in Q( √ dX) } ⊂ Πjump(X). In general, dX is not a square. Corollary If dX is not a square:

  • B

X B 1 2

  • X

has infinitely many rational curves.

D3 1 5 151 22490817357414371041 387308497430149337233666358807996260780875056740850984213276970343278935342068889706146733313789 D4 53 2624174618795407 512854561846964817139494202072778341 1215218370089028769076718102126921744353362873 6847124397158950456921300435158115445627072734996149041990563857503 D5 1 47 3109 4969 14857095849982608071 445410277660928347762586764331874432202584688016149 658652708525052699993424198738842485998115218667979560362214198830101650254490711

slide-72
SLIDE 72

We can explain the 1/2

Theorem (C, C–Elsenhans–Jahnel) If ρ(Xal) = minq ρ(Xpal), then there is a dX ∈ Z such that: { p > 2 : p inert in Q( √ dX) } ⊂ Πjump(X). In general, dX is not a square. Corollary If dX is not a square:

  • lim infB→∞ γ(X, B) ≥ 1/2
  • Xal has infinitely many rational curves.

D3 1 5 151 22490817357414371041 387308497430149337233666358807996260780875056740850984213276970343278935342068889706146733313789 D4 53 2624174618795407 512854561846964817139494202072778341 1215218370089028769076718102126921744353362873 6847124397158950456921300435158115445627072734996149041990563857503 D5 1 47 3109 4969 14857095849982608071 445410277660928347762586764331874432202584688016149 658652708525052699993424198738842485998115218667979560362214198830101650254490711

slide-73
SLIDE 73

We can explain the 1/2

Theorem (C, C–Elsenhans–Jahnel) If ρ(Xal) = minq ρ(Xpal), then there is a dX ∈ Z such that: { p > 2 : p inert in Q( √ dX) } ⊂ Πjump(X). In general, dX is not a square. Corollary If dX is not a square:

  • lim infB→∞ γ(X, B) ≥ 1/2
  • Xal has infinitely many rational curves.

D3 = − 1 · 5 · 151 · 22490817357414371041 · 387308497430149337233666358807996260780875056740850984213276970343278935342068889706146733313789 D4 =53 · 2624174618795407 · 512854561846964817139494202072778341 · 1215218370089028769076718102126921744353362873 · 6847124397158950456921300435158115445627072734996149041990563857503 D5 = − 1 · 47 · 3109 · 4969 · 14857095849982608071 · 445410277660928347762586764331874432202584688016149 · 658652708525052699993424198738842485998115218667979560362214198830101650254490711

slide-74
SLIDE 74

Experimental data for ρ(Xal) = 2 (again)

What if we ignore { p > 2 : p inert in Q(√dX) } ⊂ Πjump(X)? X

dX

B c B B

γ γ γ

p

jump X

1 if dX is not a square modulo p

1 p

  • therwise

Why?!?

slide-75
SLIDE 75

Experimental data for ρ(Xal) = 2 (again)

What if we ignore { p > 2 : p inert in Q(√dX) } ⊂ Πjump(X)? γ ( XQ (√

dX

), B )

?

∼ c √ B , B → ∞

γ( )

100 1000 104 105 0.05 0.10 0.50 1

γ( )

1000 104 105 0.05 0.10 0.50 1

γ( )

100 1000 104 105 0.05 0.10 0.50 1

p

jump X

1 if dX is not a square modulo p

1 p

  • therwise

Why?!?

slide-76
SLIDE 76

Experimental data for ρ(Xal) = 2 (again)

What if we ignore { p > 2 : p inert in Q(√dX) } ⊂ Πjump(X)? γ ( XQ (√

dX

), B )

?

∼ c √ B , B → ∞

γ( )

100 1000 104 105 0.05 0.10 0.50 1

γ( )

1000 104 105 0.05 0.10 0.50 1

γ( )

100 1000 104 105 0.05 0.10 0.50 1

Prob(p ∈ Πjump(X)) =    1 if dX is not a square modulo p

?

1 √p

  • therwise

Why?!?