Growth of rational points on curves Robert J. Lemke Oliver Tufts - - PowerPoint PPT Presentation

growth of rational points on curves
SMART_READER_LITE
LIVE PREVIEW

Growth of rational points on curves Robert J. Lemke Oliver Tufts - - PowerPoint PPT Presentation

Growth of rational points on curves Robert J. Lemke Oliver Tufts University (Actual theorems joint with Frank Thorne) Diophantine stability Let C / Q be a curve, Diophantine stability Let C / Q be a curve, and let F C := { K : K = Q ( P ) for


slide-1
SLIDE 1

Growth of rational points on curves

Robert J. Lemke Oliver Tufts University (Actual theorems joint with Frank Thorne)

slide-2
SLIDE 2

Diophantine stability

Let C/Q be a curve,

slide-3
SLIDE 3

Diophantine stability

Let C/Q be a curve, and let FC := {K : K = Q(P) for some P ∈ C(¯ Q)} be the set of fields over which C gains a point.

slide-4
SLIDE 4

Diophantine stability

Let C/Q be a curve, and let FC := {K : K = Q(P) for some P ∈ C(¯ Q)} be the set of fields over which C gains a point.

Question (Mazur–Rubin)

What does FC look like?

slide-5
SLIDE 5

Diophantine stability

Let C/Q be a curve, and let FC := {K : K = Q(P) for some P ∈ C(¯ Q)} be the set of fields over which C gains a point.

Question (Mazur–Rubin)

What does FC look like? To what extent does it determine C?

slide-6
SLIDE 6

Diophantine stability

Let C/Q be a curve, and let FC := {K : K = Q(P) for some P ∈ C(¯ Q)} be the set of fields over which C gains a point.

Question (Mazur–Rubin)

What does FC look like? To what extent does it determine C? Today: How does FC

n (X; G) := {K ∈ FC : [K : Q] = n, Gal(

K/Q) ≃ G, |Disc(K)| ≤ X} behave?

slide-7
SLIDE 7

Diophantine stability

Let C/Q be a curve, and let FC := {K : K = Q(P) for some P ∈ C(¯ Q)} be the set of fields over which C gains a point.

Question (Mazur–Rubin)

What does FC look like? To what extent does it determine C? Today: How does FC

n (X; G) := {K ∈ FC : [K : Q] = n, Gal(

K/Q) ≃ G, |Disc(K)| ≤ X} behave? Notation: When C = P1

Q, we simply write Fn(X; G) instead.

slide-8
SLIDE 8

Elliptic curves

Suppose E/Q is an elliptic curve.

slide-9
SLIDE 9

Elliptic curves

Suppose E/Q is an elliptic curve. For a number field K/Q, let w(EK) := (−1)rkan(EK ),

slide-10
SLIDE 10

Elliptic curves

Suppose E/Q is an elliptic curve. For a number field K/Q, let w(EK) := (−1)rkan(EK ), and set w(E, ρK) = w(EK)/w(EQ).

slide-11
SLIDE 11

Elliptic curves

Suppose E/Q is an elliptic curve. For a number field K/Q, let w(EK) := (−1)rkan(EK ), and set w(E, ρK) = w(EK)/w(EQ).

Philosophy (“Minimalist philosophy”)

Suppose G is primitive,

slide-12
SLIDE 12

Elliptic curves

Suppose E/Q is an elliptic curve. For a number field K/Q, let w(EK) := (−1)rkan(EK ), and set w(E, ρK) = w(EK)/w(EQ).

Philosophy (“Minimalist philosophy”)

Suppose G is primitive, i.e. K ∈ Fn(X; G) has no subfields.

slide-13
SLIDE 13

Elliptic curves

Suppose E/Q is an elliptic curve. For a number field K/Q, let w(EK) := (−1)rkan(EK ), and set w(E, ρK) = w(EK)/w(EQ).

Philosophy (“Minimalist philosophy”)

Suppose G is primitive, i.e. K ∈ Fn(X; G) has no subfields. Then

  • K ∈ FE

n (X; G) for all K ∈ Fn(X; G) with w(E, ρK) = −1,

slide-14
SLIDE 14

Elliptic curves

Suppose E/Q is an elliptic curve. For a number field K/Q, let w(EK) := (−1)rkan(EK ), and set w(E, ρK) = w(EK)/w(EQ).

Philosophy (“Minimalist philosophy”)

Suppose G is primitive, i.e. K ∈ Fn(X; G) has no subfields. Then

  • K ∈ FE

n (X; G) for all K ∈ Fn(X; G) with w(E, ρK) = −1,

  • K ∈ FE

n (X; G) for 0% of K ∈ Fn(X; G) with w(E, ρK) = 1.

slide-15
SLIDE 15

Elliptic curves

Suppose E/Q is an elliptic curve. For a number field K/Q, let w(EK) := (−1)rkan(EK ), and set w(E, ρK) = w(EK)/w(EQ).

Philosophy (“Minimalist philosophy”)

Suppose G is primitive, i.e. K ∈ Fn(X; G) has no subfields. Then

  • K ∈ FE

n (X; G) for all K ∈ Fn(X; G) with w(E, ρK) = −1,

  • K ∈ FE

n (X; G) for 0% of K ∈ Fn(X; G) with w(E, ρK) = 1.

  • V. Dokchitser: Computes w(E, ρ) for any Artin representation ρ.
slide-16
SLIDE 16

Goldfeld’s conjecture

Conjecture (Goldfeld; proved up to ǫ + √ǫ by A. Smith, 2019)

If E/Q is an elliptic curve,

slide-17
SLIDE 17

Goldfeld’s conjecture

Conjecture (Goldfeld; proved up to ǫ + √ǫ by A. Smith, 2019)

If E/Q is an elliptic curve, then:

  • rk(E) doesn’t grow in 50% of Q(

√ d),

slide-18
SLIDE 18

Goldfeld’s conjecture

Conjecture (Goldfeld; proved up to ǫ + √ǫ by A. Smith, 2019)

If E/Q is an elliptic curve, then:

  • rk(E) doesn’t grow in 50% of Q(

√ d),

  • rk(E) grows by 1 for 50% of Q(

√ d),

slide-19
SLIDE 19

Goldfeld’s conjecture

Conjecture (Goldfeld; proved up to ǫ + √ǫ by A. Smith, 2019)

If E/Q is an elliptic curve, then:

  • rk(E) doesn’t grow in 50% of Q(

√ d),

  • rk(E) grows by 1 for 50% of Q(

√ d), and

  • rk(E) grows by ≥ 2 for 0% of Q(

√ d).

slide-20
SLIDE 20

Goldfeld’s conjecture

Conjecture (Goldfeld; proved up to ǫ + √ǫ by A. Smith, 2019)

If E/Q is an elliptic curve, then:

  • rk(E) doesn’t grow in 50% of Q(

√ d),

  • rk(E) grows by 1 for 50% of Q(

√ d), and

  • rk(E) grows by ≥ 2 for 0% of Q(

√ d).

Theorem (Gouvêa–Mazur)

#{K ∈ FE

2 (X) : w(E, ρK) = +1} ≫ X 1/2−ǫ.

slide-21
SLIDE 21

Goldfeld’s conjecture

Conjecture (Goldfeld; proved up to ǫ + √ǫ by A. Smith, 2019)

If E/Q is an elliptic curve, then:

  • rk(E) doesn’t grow in 50% of Q(

√ d),

  • rk(E) grows by 1 for 50% of Q(

√ d), and

  • rk(E) grows by ≥ 2 for 0% of Q(

√ d).

Theorem (Gouvêa–Mazur)

#{K ∈ FE

2 (X) : w(E, ρK) = +1} ≫ X 1/2−ǫ.

In particular, rkan(E) grows by (at least) 2 in X 1/2−ǫ fields.

slide-22
SLIDE 22

Nonabelian twists

slide-23
SLIDE 23

Nonabelian twists

Conjecture

Let E/Q be an elliptic curve.

slide-24
SLIDE 24

Nonabelian twists

Conjecture

Let E/Q be an elliptic curve. For any n ≥ 2, as X → ∞,

  • rk(E) doesn’t grow in 50% of K ∈ Fn(X; Sn),
slide-25
SLIDE 25

Nonabelian twists

Conjecture

Let E/Q be an elliptic curve. For any n ≥ 2, as X → ∞,

  • rk(E) doesn’t grow in 50% of K ∈ Fn(X; Sn),
  • rk(E) grows by 1 in 50% of K ∈ Fn(X; Sn),
slide-26
SLIDE 26

Nonabelian twists

Conjecture

Let E/Q be an elliptic curve. For any n ≥ 2, as X → ∞,

  • rk(E) doesn’t grow in 50% of K ∈ Fn(X; Sn),
  • rk(E) grows by 1 in 50% of K ∈ Fn(X; Sn), and
  • rk(E) grows by ≥ 2 in 0% of K ∈ Fn(X; Sn).
slide-27
SLIDE 27

Nonabelian twists

Conjecture

Let E/Q be an elliptic curve. For any n ≥ 2, as X → ∞,

  • rk(E) doesn’t grow in 50% of K ∈ Fn(X; Sn),
  • rk(E) grows by 1 in 50% of K ∈ Fn(X; Sn), and
  • rk(E) grows by ≥ 2 in 0% of K ∈ Fn(X; Sn).

“Theorem” (LO–Thorne)

There’s an analogue of Gouvêa–Mazur for twists by K ∈ Fn(X; Sn).

slide-28
SLIDE 28

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

slide-29
SLIDE 29

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))}

slide-30
SLIDE 30

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))} ≫ X cn−ǫ,

slide-31
SLIDE 31

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))} ≫ X cn−ǫ, where cn =            1/n n ≤ 5

slide-32
SLIDE 32

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))} ≫ X cn−ǫ, where cn =            1/n n ≤ 5 1/5 n = 6

slide-33
SLIDE 33

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))} ≫ X cn−ǫ, where cn =            1/n n ≤ 5 1/5 n = 6 1/6 n = 7, 8

slide-34
SLIDE 34

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))} ≫ X cn−ǫ, where cn =            1/n n ≤ 5 1/5 n = 6 1/6 n = 7, 8

1 4 − n2+4n−2 2n2(n−1)

n ≥ 9.

slide-35
SLIDE 35

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))} ≫ X cn−ǫ, where cn =            1/n n ≤ 5 1/5 n = 6 1/6 n = 7, 8

1 4 − n2+4n−2 2n2(n−1)

n ≥ 9. Same bound when w(E, ρK) = 1 and when w(E, ρK) = −1.

slide-36
SLIDE 36

Rank growth of nonabelian twists

Theorem (LO–Thorne)

Let E/Q be an elliptic curve. For any n ≥ 2, #FE

n (X; Sn)

= #{K ∈ Fn(X; Sn) : rk(E(K)) > rk(E(Q))} ≫ X cn−ǫ, where cn =            1/n n ≤ 5 1/5 n = 6 1/6 n = 7, 8

1 4 − n2+4n−2 2n2(n−1)

n ≥ 9. Same bound when w(E, ρK) = 1 and when w(E, ρK) = −1.

Corollary

rkan(E) grows by ≥ 2 in at least X 1/3−ǫ fields K ∈ F3(X; S3).

slide-37
SLIDE 37

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X.

slide-38
SLIDE 38

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X. Idea: If E : y2 = x3 + Ax + B,

slide-39
SLIDE 39

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X. Idea: If E : y2 = x3 + Ax + B, choose any x ∈ Q.

slide-40
SLIDE 40

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X. Idea: If E : y2 = x3 + Ax + B, choose any x ∈ Q. If x = u/v for coprime u, v,

slide-41
SLIDE 41

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X. Idea: If E : y2 = x3 + Ax + B, choose any x ∈ Q. If x = u/v for coprime u, v, then v4y2 = v(u3 + Auv2 + Bv3).

slide-42
SLIDE 42

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X. Idea: If E : y2 = x3 + Ax + B, choose any x ∈ Q. If x = u/v for coprime u, v, then v4y2 = v(u3 + Auv2 + Bv3). Choosing |u|, |v| ≤ X 1/4

slide-43
SLIDE 43

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X. Idea: If E : y2 = x3 + Ax + B, choose any x ∈ Q. If x = u/v for coprime u, v, then v4y2 = v(u3 + Auv2 + Bv3). Choosing |u|, |v| ≤ X 1/4 = ⇒ |RHS| ≤ X.

slide-44
SLIDE 44

Rank two quadratic twists

Theorem (Gouvêa–Mazur)

rkan(E) grows by ≥ 2 in ≫ X 1/2−ǫ fields Q( √ d) with |d| ≤ X. Idea: If E : y2 = x3 + Ax + B, choose any x ∈ Q. If x = u/v for coprime u, v, then v4y2 = v(u3 + Auv2 + Bv3). Choosing |u|, |v| ≤ X 1/4 = ⇒ |RHS| ≤ X.

Problem

How do we distinguish the fields Q(

  • v(u3 + Auv2 + Bv3))?
slide-45
SLIDE 45

Distinguishing quadratic fields

Problem

How do we distinguish the fields Q(

  • v(u3 + Auv2 + Bv3))?
slide-46
SLIDE 46

Distinguishing quadratic fields

Problem

How do we distinguish the fields Q(

  • v(u3 + Auv2 + Bv3))?

Gouvêa and Mazur show that:

1 v(u3 + Auv2 + Bv3) assumes ≫ X 1/2 squarefree values ≤ X,

slide-47
SLIDE 47

Distinguishing quadratic fields

Problem

How do we distinguish the fields Q(

  • v(u3 + Auv2 + Bv3))?

Gouvêa and Mazur show that:

1 v(u3 + Auv2 + Bv3) assumes ≫ X 1/2 squarefree values ≤ X, 2 any particular value arises ≪ X ǫ times.

slide-48
SLIDE 48

Distinguishing quadratic fields

Problem

How do we distinguish the fields Q(

  • v(u3 + Auv2 + Bv3))?

Gouvêa and Mazur show that:

1 v(u3 + Auv2 + Bv3) assumes ≫ X 1/2 squarefree values ≤ X, 2 any particular value arises ≪ X ǫ times.

= ⇒ rk(E) grows in at least X 1/2−ǫ fields K ∈ F2(X).

slide-49
SLIDE 49

Distinguishing quadratic fields

Problem

How do we distinguish the fields Q(

  • v(u3 + Auv2 + Bv3))?

Gouvêa and Mazur show that:

1 v(u3 + Auv2 + Bv3) assumes ≫ X 1/2 squarefree values ≤ X, 2 any particular value arises ≪ X ǫ times.

= ⇒ rk(E) grows in at least X 1/2−ǫ fields K ∈ F2(X). Get growth ≥ 2 of rkan(E) by controlling the root number.

slide-50
SLIDE 50

First parametrization in higher degree fields

slide-51
SLIDE 51

First parametrization in higher degree fields

If E : y2 = f (x) and n is even,

slide-52
SLIDE 52

First parametrization in higher degree fields

If E : y2 = f (x) and n is even, then (x, txn/2) is a point on E(Kt),

slide-53
SLIDE 53

First parametrization in higher degree fields

If E : y2 = f (x) and n is even, then (x, txn/2) is a point on E(Kt), where Kt := Q(t)[x]/Pf (x, t), Pf (x, t) := t2xn − f (x).

slide-54
SLIDE 54

First parametrization in higher degree fields

If E : y2 = f (x) and n is even, then (x, txn/2) is a point on E(Kt), where Kt := Q(t)[x]/Pf (x, t), Pf (x, t) := t2xn − f (x).

Proposition

There is a model E : y2 = f (x) s.t. Gal( Kt/Q(t)) ≃ Sn.

slide-55
SLIDE 55

First parametrization in higher degree fields

If E : y2 = f (x) and n is even, then (x, txn/2) is a point on E(Kt), where Kt := Q(t)[x]/Pf (x, t), Pf (x, t) := t2xn − f (x).

Proposition

There is a model E : y2 = f (x) s.t. Gal( Kt/Q(t)) ≃ Sn. Get many K ∈ Fn(X; Sn) in which rk(E) grows by specializing t

slide-56
SLIDE 56

First parametrization in higher degree fields

If E : y2 = f (x) and n is even, then (x, txn/2) is a point on E(Kt), where Kt := Q(t)[x]/Pf (x, t), Pf (x, t) := t2xn − f (x).

Proposition

There is a model E : y2 = f (x) s.t. Gal( Kt/Q(t)) ≃ Sn. Get many K ∈ Fn(X; Sn) in which rk(E) grows by specializing t, provided we can control multiplicities!

slide-57
SLIDE 57

First parametrization: Controlling multiplicities

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

slide-58
SLIDE 58

First parametrization: Controlling multiplicities

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma

If t = u/v, then Discx(Pf (x, u/v)) = u2n−4v4−2nH(u, v) for a not-squarefull sextic form H(u, v).

slide-59
SLIDE 59

First parametrization: Controlling multiplicities

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma

If t = u/v, then Discx(Pf (x, u/v)) = u2n−4v4−2nH(u, v) for a not-squarefull sextic form H(u, v).

Theorem (Greaves)

Any “not obstructed” form H(u, v) of degree ≤ 6 assumes ≫ T 2 squarefree values with |u|, |v| ≤ T.

slide-60
SLIDE 60

First parametrization: Controlling multiplicities

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma

If t = u/v, then Discx(Pf (x, u/v)) = u2n−4v4−2nH(u, v) for a not-squarefull sextic form H(u, v).

Theorem (Greaves)

Any “not obstructed” form H(u, v) of degree ≤ 6 assumes ≫ T 2 squarefree values with |u|, |v| ≤ T. Each value occurs ≪ X ǫ times

slide-61
SLIDE 61

First parametrization: Controlling multiplicities

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma

If t = u/v, then Discx(Pf (x, u/v)) = u2n−4v4−2nH(u, v) for a not-squarefull sextic form H(u, v).

Theorem (Greaves)

Any “not obstructed” form H(u, v) of degree ≤ 6 assumes ≫ T 2 squarefree values with |u|, |v| ≤ T. Each value occurs ≪ X ǫ times = ⇒ there are ≫ X 2/(n+4)−ǫ fields Kt with |Disc(Kt)| ≤ X.

slide-62
SLIDE 62

How do we control root numbers?

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

slide-63
SLIDE 63

How do we control root numbers?

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma (V. Dokchitser)

If K and K ′ ∈ Fn(X; Sn) are such that

slide-64
SLIDE 64

How do we control root numbers?

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma (V. Dokchitser)

If K and K ′ ∈ Fn(X; Sn) are such that

  • K ⊗ Qp ≃ K ′ ⊗ Qp for each p | NE,
slide-65
SLIDE 65

How do we control root numbers?

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma (V. Dokchitser)

If K and K ′ ∈ Fn(X; Sn) are such that

  • K ⊗ Qp ≃ K ′ ⊗ Qp for each p | NE, and
  • sgn(Disc(K)) = −sgn(Disc(K ′)),
slide-66
SLIDE 66

How do we control root numbers?

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma (V. Dokchitser)

If K and K ′ ∈ Fn(X; Sn) are such that

  • K ⊗ Qp ≃ K ′ ⊗ Qp for each p | NE, and
  • sgn(Disc(K)) = −sgn(Disc(K ′)),

then w(E, ρK) = −w(E, ρK ′).

slide-67
SLIDE 67

How do we control root numbers?

(Recall: Pf (x, t) = xnt2 − f (x) and Kt = Q(t)[x]/Pf (x, t).)

Lemma (V. Dokchitser)

If K and K ′ ∈ Fn(X; Sn) are such that

  • K ⊗ Qp ≃ K ′ ⊗ Qp for each p | NE, and
  • sgn(Disc(K)) = −sgn(Disc(K ′)),

then w(E, ρK) = −w(E, ρK ′).

Theorem

The number of K ∈ Fn(X; Sn) s.t. rk(E(K)) > rk(E(Q)) and w(E, ρK) = +1 is ≫ X 1/(⌈ n

2 ⌉+2)−ǫ.

slide-68
SLIDE 68

Second Parametrization

If n is even,

slide-69
SLIDE 69

Second Parametrization

If n is even, let F, G ∈ Z[x] have degree n/2 and n/2 − 2, resp.

slide-70
SLIDE 70

Second Parametrization

If n is even, let F, G ∈ Z[x] have degree n/2 and n/2 − 2, resp. Then (x, F(x)

G(x)) is on E(KF,G),

slide-71
SLIDE 71

Second Parametrization

If n is even, let F, G ∈ Z[x] have degree n/2 and n/2 − 2, resp. Then (x, F(x)

G(x)) is on E(KF,G), where

KF,G = Q[x]/(F 2 − fG 2).

slide-72
SLIDE 72

Second Parametrization

If n is even, let F, G ∈ Z[x] have degree n/2 and n/2 − 2, resp. Then (x, F(x)

G(x)) is on E(KF,G), where

KF,G = Q[x]/(F 2 − fG 2).

Lemma

Gal( KF,G/Q) ≃ Sn for almost all F,G.

slide-73
SLIDE 73

Second Parametrization

If n is even, let F, G ∈ Z[x] have degree n/2 and n/2 − 2, resp. Then (x, F(x)

G(x)) is on E(KF,G), where

KF,G = Q[x]/(F 2 − fG 2).

Lemma

Gal( KF,G/Q) ≃ Sn for almost all F,G.

Proof.

If F(x) = txn/2 and G(x) = 1,

slide-74
SLIDE 74

Second Parametrization

If n is even, let F, G ∈ Z[x] have degree n/2 and n/2 − 2, resp. Then (x, F(x)

G(x)) is on E(KF,G), where

KF,G = Q[x]/(F 2 − fG 2).

Lemma

Gal( KF,G/Q) ≃ Sn for almost all F,G.

Proof.

If F(x) = txn/2 and G(x) = 1, then KF,G = Kt.

slide-75
SLIDE 75

Second Parametrization

If n is even, let F, G ∈ Z[x] have degree n/2 and n/2 − 2, resp. Then (x, F(x)

G(x)) is on E(KF,G), where

KF,G = Q[x]/(F 2 − fG 2).

Lemma

Gal( KF,G/Q) ≃ Sn for almost all F,G.

Proof.

If F(x) = txn/2 and G(x) = 1, then KF,G = Kt. Now use Hilbert Irreducibility.

slide-76
SLIDE 76

Second Parametrization: Controlling Multiplicities

Question

How do we control the multiplicity of KF,G = Q[x]/(F 2 − fG 2)?

slide-77
SLIDE 77

Second Parametrization: Controlling Multiplicities

Question

How do we control the multiplicity of KF,G = Q[x]/(F 2 − fG 2)?

Lemma

Given f , H ∈ Z[x], there are On(1) solutions F, G to H = F 2 − fG 2.

slide-78
SLIDE 78

Second Parametrization: Controlling Multiplicities

Question

How do we control the multiplicity of KF,G = Q[x]/(F 2 − fG 2)?

Lemma

Given f , H ∈ Z[x], there are On(1) solutions F, G to H = F 2 − fG 2.

Question

How do we make sure the same field isn’t cut out by lots of polynomials?

slide-79
SLIDE 79

Multiplicities of fields

Let Sn(Y ) := {g(x) = xn + a1xn−1 + · · · + an ∈ Z[x] : |ai| ≤ Y i}.

slide-80
SLIDE 80

Multiplicities of fields

Let Sn(Y ) := {g(x) = xn + a1xn−1 + · · · + an ∈ Z[x] : |ai| ≤ Y i}. (Note: If g ∈ Sn(Y ), then |Disc(g)| ≪ Y n(n−1).)

slide-81
SLIDE 81

Multiplicities of fields

Let Sn(Y ) := {g(x) = xn + a1xn−1 + · · · + an ∈ Z[x] : |ai| ≤ Y i}. (Note: If g ∈ Sn(Y ), then |Disc(g)| ≪ Y n(n−1).)

Lemma (Ellenberg–Venkatesh + ǫ·(LO–Thorne))

If K ∈ Fn(X), then #{g ∈ Sn(Y ) : Q[x]/g ≃ K}

slide-82
SLIDE 82

Multiplicities of fields

Let Sn(Y ) := {g(x) = xn + a1xn−1 + · · · + an ∈ Z[x] : |ai| ≤ Y i}. (Note: If g ∈ Sn(Y ), then |Disc(g)| ≪ Y n(n−1).)

Lemma (Ellenberg–Venkatesh + ǫ·(LO–Thorne))

If K ∈ Fn(X), then #{g ∈ Sn(Y ) : Q[x]/g ≃ K} ≪ max

  • Y nDisc(K)−1/2, Y n/2

.

slide-83
SLIDE 83

Multiplicities of fields

Let Sn(Y ) := {g(x) = xn + a1xn−1 + · · · + an ∈ Z[x] : |ai| ≤ Y i}. (Note: If g ∈ Sn(Y ), then |Disc(g)| ≪ Y n(n−1).)

Lemma (Ellenberg–Venkatesh + ǫ·(LO–Thorne))

If K ∈ Fn(X), then #{g ∈ Sn(Y ) : Q[x]/g ≃ K} ≪ max

  • Y nDisc(K)−1/2, Y n/2

. = ⇒ #{|Disc(KF,G)| ≤ X}/iso.

slide-84
SLIDE 84

Multiplicities of fields

Let Sn(Y ) := {g(x) = xn + a1xn−1 + · · · + an ∈ Z[x] : |ai| ≤ Y i}. (Note: If g ∈ Sn(Y ), then |Disc(g)| ≪ Y n(n−1).)

Lemma (Ellenberg–Venkatesh + ǫ·(LO–Thorne))

If K ∈ Fn(X), then #{g ∈ Sn(Y ) : Q[x]/g ≃ K} ≪ max

  • Y nDisc(K)−1/2, Y n/2

. = ⇒ #{|Disc(KF,G)| ≤ X}/iso. ≫ X

1 4 − n2+4n−2 2n2(n−1) .

slide-85
SLIDE 85

The limit of the method

Theorem

Let E/Q be an elliptic curve.

slide-86
SLIDE 86

The limit of the method

Theorem

Let E/Q be an elliptic curve. If for each K ∈ Fn(X; Sn),

  • L(s, EK) is automorphic,
slide-87
SLIDE 87

The limit of the method

Theorem

Let E/Q be an elliptic curve. If for each K ∈ Fn(X; Sn),

  • L(s, EK) is automorphic,
  • L(s, EK) satisfies GRH,
slide-88
SLIDE 88

The limit of the method

Theorem

Let E/Q be an elliptic curve. If for each K ∈ Fn(X; Sn),

  • L(s, EK) is automorphic,
  • L(s, EK) satisfies GRH, and
  • L(s, EK) satisfies BSD,
slide-89
SLIDE 89

The limit of the method

Theorem

Let E/Q be an elliptic curve. If for each K ∈ Fn(X; Sn),

  • L(s, EK) is automorphic,
  • L(s, EK) satisfies GRH, and
  • L(s, EK) satisfies BSD,

then #{K ∈ Fn(X; Sn) : rk(E(K)) ≥ 2 + rk(E(Q))}

slide-90
SLIDE 90

The limit of the method

Theorem

Let E/Q be an elliptic curve. If for each K ∈ Fn(X; Sn),

  • L(s, EK) is automorphic,
  • L(s, EK) satisfies GRH, and
  • L(s, EK) satisfies BSD,

then #{K ∈ Fn(X; Sn) : rk(E(K)) ≥ 2 + rk(E(Q))} ≫ X

1 4+ 1 2(n2−n) .

slide-91
SLIDE 91

But what’s the truth?

slide-92
SLIDE 92

But what’s the truth?

Conjecture (Birch–Swinnerton-Dyer)

If r = rk(E), then r = ords=1L(s, E) and L(r)(1, E) r! = |X(E)|Reg(E)Tam(E)ΩR(E) |E(Q)tors|2 .

slide-93
SLIDE 93

But what’s the truth?

Conjecture (Birch–Swinnerton-Dyer)

If r = rk(E), then r = ords=1L(s, E) and L(r)(1, E) r! = |X(E)|Reg(E)Tam(E)ΩR(E) |E(Q)tors|2 .

Conjecture (Tate’s Séminaire Bourbaki)

If K/Q has sig. (r1, r2) and r = rk(EK),

slide-94
SLIDE 94

But what’s the truth?

Conjecture (Birch–Swinnerton-Dyer)

If r = rk(E), then r = ords=1L(s, E) and L(r)(1, E) r! = |X(E)|Reg(E)Tam(E)ΩR(E) |E(Q)tors|2 .

Conjecture (Tate’s Séminaire Bourbaki)

If K/Q has sig. (r1, r2) and r = rk(EK), then r = ords=1L(s, EK) and L(r)(1, EK) r! = |X(EK)|Reg(EK)Tam(EK)ΩR(E)r1ΩC(E)r2 |Disc(K)|1/2|E(K)tors|2 .

slide-95
SLIDE 95

But what’s the truth?

Conjecture (Birch–Swinnerton-Dyer)

If r = rk(E), then r = ords=1L(s, E) and L(r)(1, E) r! = |X(E)|Reg(E)Tam(E)ΩR(E) |E(Q)tors|2 .

Conjecture (Tate’s Séminaire Bourbaki)

If K/Q has sig. (r1, r2) and r = rk(EK), then r = ords=1L(s, EK) and L(r)(1, EK) r! = |X(EK)|Reg(EK)Tam(EK)ΩR(E)r1ΩC(E)r2 |Disc(K)|1/2|E(K)tors|2 . Idea: Pay attention to the case when rk(EQ) = rk(EK).

slide-96
SLIDE 96

Relative rank zero BSD

Conjecture

Let L(s, E, ρK) = L(s, EK)/L(s, E).

slide-97
SLIDE 97

Relative rank zero BSD

Conjecture

Let L(s, E, ρK) = L(s, EK)/L(s, E). If E(K) = E(Q), then L(1, E, ρK) = |X(EK)| |X(E)| Tam(EK) Tam(E) ΩR(E)r1−1ΩC(E)r2 |Disc(K)|1/2 .

slide-98
SLIDE 98

Relative rank zero BSD

Conjecture

Let L(s, E, ρK) = L(s, EK)/L(s, E). If E(K) = E(Q), then L(1, E, ρK) = |X(EK)| |X(E)| Tam(EK) Tam(E) ΩR(E)r1−1ΩC(E)r2 |Disc(K)|1/2 . Expect: L(1, E, ρK), Tam(EK) ≪ (ht(E)|Disc(K)|)ǫ =: Qǫ,

slide-99
SLIDE 99

Relative rank zero BSD

Conjecture

Let L(s, E, ρK) = L(s, EK)/L(s, E). If E(K) = E(Q), then L(1, E, ρK) = |X(EK)| |X(E)| Tam(EK) Tam(E) ΩR(E)r1−1ΩC(E)r2 |Disc(K)|1/2 . Expect: L(1, E, ρK), Tam(EK) ≪ (ht(E)|Disc(K)|)ǫ =: Qǫ, so |X(EK)| |X(E)| ≪ |Disc(K)|1/2 ΩR(E)r1−1ΩC(E)r2 Qǫ.

slide-100
SLIDE 100

Relative rank zero BSD

Conjecture

Let L(s, E, ρK) = L(s, EK)/L(s, E). If E(K) = E(Q), then L(1, E, ρK) = |X(EK)| |X(E)| Tam(EK) Tam(E) ΩR(E)r1−1ΩC(E)r2 |Disc(K)|1/2 . Expect: L(1, E, ρK), Tam(EK) ≪ (ht(E)|Disc(K)|)ǫ =: Qǫ, so |X(EK)| |X(E)| ≪ |Disc(K)|1/2 ΩR(E)r1−1ΩC(E)r2 Qǫ. Crude model: |X(EK)/X(E)| = m2 uniformly with m ≪ |Disc(K)|1/4Qǫ ΩR(E)

r1−1 2 ΩC(E) r2 2

.

slide-101
SLIDE 101

An embarrassingly crude model

We thus expect L(1, E, ρK) = m2 · (Invariants of E) with m ≪ |Disc(K)|1/4Qǫ ΩR(E)

r1−1 2 ΩC(E) r2 2

.

slide-102
SLIDE 102

An embarrassingly crude model

We thus expect L(1, E, ρK) = m2 · (Invariants of E) with m ≪ |Disc(K)|1/4Qǫ ΩR(E)

r1−1 2 ΩC(E) r2 2

. Very crude model: L(1, E, ρK) = 0 if m “accidentally” equals 0,

slide-103
SLIDE 103

An embarrassingly crude model

We thus expect L(1, E, ρK) = m2 · (Invariants of E) with m ≪ |Disc(K)|1/4Qǫ ΩR(E)

r1−1 2 ΩC(E) r2 2

. Very crude model: L(1, E, ρK) = 0 if m “accidentally” equals 0, which happens with probability about ΩR(E)

r1−1 2 ΩC(E) r2 2

|Disc(K)|1/4 .

slide-104
SLIDE 104

A prediction for rank 2 twists

For fixed E, if K ∈ Fn(X; Sn) with w(E, ρK) = +1, we thus expect Prob.(L(1, E, ρK) = 0) ≈ 1 |Disc(K)|1/4 .

slide-105
SLIDE 105

A prediction for rank 2 twists

For fixed E, if K ∈ Fn(X; Sn) with w(E, ρK) = +1, we thus expect Prob.(L(1, E, ρK) = 0) ≈ 1 |Disc(K)|1/4 .

Conjecture

If E/Q is an elliptic curve, then for each n X 3/4−ǫ ≪ #{K ∈ FE

n (X; Sn) : w(E, ρK) = +1} ≪ X 3/4+ǫ.

slide-106
SLIDE 106

A prediction for rank 2 twists

For fixed E, if K ∈ Fn(X; Sn) with w(E, ρK) = +1, we thus expect Prob.(L(1, E, ρK) = 0) ≈ 1 |Disc(K)|1/4 .

Conjecture

If E/Q is an elliptic curve, then for each n X 3/4−ǫ ≪ #{K ∈ FE

n (X; Sn) : w(E, ρK) = +1} ≪ X 3/4+ǫ.

More generally, if G ⊆ Sn is primitive, then #{K ∈ FE

n (X; G) : w(E, ρK) = +1}

slide-107
SLIDE 107

A prediction for rank 2 twists

For fixed E, if K ∈ Fn(X; Sn) with w(E, ρK) = +1, we thus expect Prob.(L(1, E, ρK) = 0) ≈ 1 |Disc(K)|1/4 .

Conjecture

If E/Q is an elliptic curve, then for each n X 3/4−ǫ ≪ #{K ∈ FE

n (X; Sn) : w(E, ρK) = +1} ≪ X 3/4+ǫ.

More generally, if G ⊆ Sn is primitive, then X

1 a(G) − 1 4 −ǫ ≪ #{K ∈ FE

n (X; G) : w(E, ρK) = +1} ≪ X

1 a(G) − 1 4 +ǫ.

slide-108
SLIDE 108

A prediction for rank 2 twists

For fixed E, if K ∈ Fn(X; Sn) with w(E, ρK) = +1, we thus expect Prob.(L(1, E, ρK) = 0) ≈ 1 |Disc(K)|1/4 .

Conjecture

If E/Q is an elliptic curve, then for each n X 3/4−ǫ ≪ #{K ∈ FE

n (X; Sn) : w(E, ρK) = +1} ≪ X 3/4+ǫ.

More generally, if G ⊆ Sn is primitive, then X

1 a(G) − 1 4 −ǫ ≪ #{K ∈ FE

n (X; G) : w(E, ρK) = +1} ≪ X

1 a(G) − 1 4 +ǫ.

Take note: What if 1/a(G) < 1/4?

slide-109
SLIDE 109

A prediction for rank 2 twists

For fixed E, if K ∈ Fn(X; Sn) with w(E, ρK) = +1, we thus expect Prob.(L(1, E, ρK) = 0) ≈ 1 |Disc(K)|1/4 .

Conjecture

If E/Q is an elliptic curve, then for each n X 3/4−ǫ ≪ #{K ∈ FE

n (X; Sn) : w(E, ρK) = +1} ≪ X 3/4+ǫ.

More generally, if G ⊆ Sn is primitive, then X

1 a(G) − 1 4 −ǫ ≪ #{K ∈ FE

n (X; G) : w(E, ρK) = +1} ≪ X

1 a(G) − 1 4 +ǫ.

Take note: What if 1/a(G) < 1/4? Predicts finiteness/emptiness.

slide-110
SLIDE 110

Example: Prime degree cyclic fields

Let K ∈ Fp(X; Cp).

slide-111
SLIDE 111

Example: Prime degree cyclic fields

Let K ∈ Fp(X; Cp). Then L(s, E, ρK) =

  • χ=χ0

L(s, E, χ),

slide-112
SLIDE 112

Example: Prime degree cyclic fields

Let K ∈ Fp(X; Cp). Then L(s, E, ρK) =

  • χ=χ0

L(s, E, χ), and since each χ is complex, no L(s, E, χ) is self-dual

slide-113
SLIDE 113

Example: Prime degree cyclic fields

Let K ∈ Fp(X; Cp). Then L(s, E, ρK) =

  • χ=χ0

L(s, E, χ), and since each χ is complex, no L(s, E, χ) is self-dual and w(E, ρK) = +1 always.

slide-114
SLIDE 114

Example: Prime degree cyclic fields

Let K ∈ Fp(X; Cp). Then L(s, E, ρK) =

  • χ=χ0

L(s, E, χ), and since each χ is complex, no L(s, E, χ) is self-dual and w(E, ρK) = +1 always. Moreover, #Fp(X; Cp) ≪ X 1/(p−1)+ǫ,

slide-115
SLIDE 115

Example: Prime degree cyclic fields

Let K ∈ Fp(X; Cp). Then L(s, E, ρK) =

  • χ=χ0

L(s, E, χ), and since each χ is complex, no L(s, E, χ) is self-dual and w(E, ρK) = +1 always. Moreover, #Fp(X; Cp) ≪ X 1/(p−1)+ǫ, so we obtain:

Conjecture (David–Fearnley–Kisilevsky)

limX→∞ FE

p (X; Cp) is finite if p ≥ 7.

slide-116
SLIDE 116

Example: Prime degree cyclic fields

Let K ∈ Fp(X; Cp). Then L(s, E, ρK) =

  • χ=χ0

L(s, E, χ), and since each χ is complex, no L(s, E, χ) is self-dual and w(E, ρK) = +1 always. Moreover, #Fp(X; Cp) ≪ X 1/(p−1)+ǫ, so we obtain:

Conjecture (David–Fearnley–Kisilevsky)

limX→∞ FE

p (X; Cp) is finite if p ≥ 7.

slide-117
SLIDE 117

Example: Prime degree cyclic fields, cont.

Variant: Fix K ∈ Fp(X; Cp) and vary E.

slide-118
SLIDE 118

Example: Prime degree cyclic fields, cont.

Variant: Fix K ∈ Fp(X; Cp) and vary E. Model had Prob.(L(1, E, ρK) = 0) ≈ ΩR(E)

r1−1 2 ΩC(E) r2 2

|Disc(K)|1/4 .

slide-119
SLIDE 119

Example: Prime degree cyclic fields, cont.

Variant: Fix K ∈ Fp(X; Cp) and vary E. Model had Prob.(L(1, E, ρK) = 0) ≈ ΩR(E)

r1−1 2 ΩC(E) r2 2

|Disc(K)|1/4 . K has signature (p, 0) and ΩR(E) ≈ ht(E)−1/12,

slide-120
SLIDE 120

Example: Prime degree cyclic fields, cont.

Variant: Fix K ∈ Fp(X; Cp) and vary E. Model had Prob.(L(1, E, ρK) = 0) ≈ ΩR(E)

r1−1 2 ΩC(E) r2 2

|Disc(K)|1/4 . K has signature (p, 0) and ΩR(E) ≈ ht(E)−1/12, ⇒ Prob.(L(1, E, ρK) = 0) ≈ ht(E)− p−1

24 .

Conjecture

If p ≤ 19, there exist infinitely many E for which K ∈ FE

p (X; Cp).

slide-121
SLIDE 121

Example: Prime degree cyclic fields, cont.

Variant: Fix K ∈ Fp(X; Cp) and vary E. Model had Prob.(L(1, E, ρK) = 0) ≈ ΩR(E)

r1−1 2 ΩC(E) r2 2

|Disc(K)|1/4 . K has signature (p, 0) and ΩR(E) ≈ ht(E)−1/12, ⇒ Prob.(L(1, E, ρK) = 0) ≈ ht(E)− p−1

24 .

Conjecture

If p ≤ 19, there exist infinitely many E for which K ∈ FE

p (X; Cp).

If p ≥ 23, then there are only finitely many.

slide-122
SLIDE 122

Example: Prime degree cyclic fields, cont.

Variant: Fix K ∈ Fp(X; Cp) and vary E. Model had Prob.(L(1, E, ρK) = 0) ≈ ΩR(E)

r1−1 2 ΩC(E) r2 2

|Disc(K)|1/4 . K has signature (p, 0) and ΩR(E) ≈ ht(E)−1/12, ⇒ Prob.(L(1, E, ρK) = 0) ≈ ht(E)− p−1

24 .

Conjecture

If p ≤ 19, there exist infinitely many E for which K ∈ FE

p (X; Cp).

If p ≥ 23, then there are only finitely many. Hybrid: Is there no E/Q and no K ∈ Fp(X; Cp) with p ≥ 23 for which E(K) = E(Q)?

slide-123
SLIDE 123

Higher genus curves

Theorem (Keyes)

Let C/Q be hyperelliptic of genus g.

slide-124
SLIDE 124

Higher genus curves

Theorem (Keyes)

Let C/Q be hyperelliptic of genus g. If deg(C) is odd, then #FC

n (X; Sn) ≫ X

1 4−cg,n−ǫ

for each n ≥ g, where cg,n is explicit and → 0 as n → ∞.

slide-125
SLIDE 125

Higher genus curves

Theorem (Keyes)

Let C/Q be hyperelliptic of genus g. If deg(C) is odd, then #FC

n (X; Sn) ≫ X

1 4−cg,n−ǫ

for each n ≥ g, where cg,n is explicit and → 0 as n → ∞.

Question

What’s the truth?

slide-126
SLIDE 126

Higher genus curves

Theorem (Keyes)

Let C/Q be hyperelliptic of genus g. If deg(C) is odd, then #FC

n (X; Sn) ≫ X

1 4−cg,n−ǫ

for each n ≥ g, where cg,n is explicit and → 0 as n → ∞.

Question

What’s the truth? How does #FC

n (X; G) behave for other G?

slide-127
SLIDE 127

Higher genus curves

Theorem (Keyes)

Let C/Q be hyperelliptic of genus g. If deg(C) is odd, then #FC

n (X; Sn) ≫ X

1 4−cg,n−ǫ

for each n ≥ g, where cg,n is explicit and → 0 as n → ∞.

Question

What’s the truth? How does #FC

n (X; G) behave for other G? For

  • ther C?
slide-128
SLIDE 128

Higher genus curves

Theorem (Keyes)

Let C/Q be hyperelliptic of genus g. If deg(C) is odd, then #FC

n (X; Sn) ≫ X

1 4−cg,n−ǫ

for each n ≥ g, where cg,n is explicit and → 0 as n → ∞.

Question

What’s the truth? How does #FC

n (X; G) behave for other G? For

  • ther C? What does this reveal about the geometry of C?