On the Zeta Function of Curves over Finite Fields Nurdag ul Anbar - - PowerPoint PPT Presentation

on the zeta function of curves over finite fields
SMART_READER_LITE
LIVE PREVIEW

On the Zeta Function of Curves over Finite Fields Nurdag ul Anbar - - PowerPoint PPT Presentation

On the Zeta Function of Curves over Finite Fields Nurdag ul Anbar (joint work with Henning Stichtenoth) Sabanc University RICAM, Workshop 2: Algebraic Curves over Finite Fields 11-15 November 2013 Introduction Curves with a prescribed L


slide-1
SLIDE 1

On the Zeta Function of Curves over Finite Fields

Nurdag¨ ul Anbar (joint work with Henning Stichtenoth)

Sabancı University

RICAM, Workshop 2: Algebraic Curves over Finite Fields 11-15 November 2013

slide-2
SLIDE 2

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

L-polynomial of a curve

X: a nice curve over Fq of genus g. The Zeta function of X, ZX (t) = LX (t) (1 − t)(1 − qt) , where LX (t) ∈ Z[t] of degree 2g. LX (t) = a0 + a1t + . . . + a2gt2g ( L-polynomial of X)

  • a0 = 1
  • a1 = N − (q + 1), where N is the number of rational points of

X

  • a2g−i = qg−iai for i = 0, . . . , g
slide-3
SLIDE 3

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

L-polynomial of a curve

X: a nice curve over Fq of genus g. The Zeta function of X, ZX (t) = LX (t) (1 − t)(1 − qt) , where LX (t) ∈ Z[t] of degree 2g. LX (t) = a0 + a1t + . . . + a2gt2g ( L-polynomial of X)

  • a0 = 1
  • a1 = N − (q + 1), where N is the number of rational points of

X

  • a2g−i = qg−iai for i = 0, . . . , g
slide-4
SLIDE 4

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

L-polynomial of a curve

X: a nice curve over Fq of genus g. The Zeta function of X, ZX (t) = LX (t) (1 − t)(1 − qt) , where LX (t) ∈ Z[t] of degree 2g. LX (t) = a0 + a1t + . . . + a2gt2g ( L-polynomial of X)

  • a0 = 1
  • a1 = N − (q + 1), where N is the number of rational points of

X

  • a2g−i = qg−iai for i = 0, . . . , g
slide-5
SLIDE 5

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Some notation

Remember: X is defined over Fq Fd := Fqd Xd: the curve X over Fd Nd: the number of rational points of Xd Sd := Nd − (qd + 1) Br: the number of degree r points of X L(t) = LX (t) = 1 + a1t + . . . + a2gt2g Sd = dad −

d−1

  • j=1

Sd−jaj with S1 = N1 − (q + 1) = a1 rBr =

  • d|r

µ r d

  • (qd + 1 + Sd) for all r ≥ 1 ,

for all r ≥ 1, where µ(.) is the M¨

  • bius function.
slide-6
SLIDE 6

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Some notation

Remember: X is defined over Fq Fd := Fqd Xd: the curve X over Fd Nd: the number of rational points of Xd Sd := Nd − (qd + 1) Br: the number of degree r points of X L(t) = LX (t) = 1 + a1t + . . . + a2gt2g Sd = dad −

d−1

  • j=1

Sd−jaj with S1 = N1 − (q + 1) = a1 rBr =

  • d|r

µ r d

  • (qd + 1 + Sd) for all r ≥ 1 ,

for all r ≥ 1, where µ(.) is the M¨

  • bius function.
slide-7
SLIDE 7

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Some recursively defined functions over Z: σ0 := 0 and for all r ≥ 1, σr(T1, . . . , Tr) := rTr −

r−1

  • j=1

σr−j(T1, . . . , Tr−j) · Tj βr(T1, . . . , Tr) :=

  • d|r

µ r d

  • σd(T1, . . . , Td) +
  • d|r

µ r d

  • (qd + 1)

ϕr(T1, . . . , Tr−1) := rTr − βr(T1, . . . , Tr)

σr(a1, . . . , ar) = Sr = Nr−(qr+1) and βr(a1, . . . , ar) = rBr = ⇒ rar = ϕr(a1, . . . , ar−1) + rBr

slide-8
SLIDE 8

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Some recursively defined functions over Z: σ0 := 0 and for all r ≥ 1, σr(T1, . . . , Tr) := rTr −

r−1

  • j=1

σr−j(T1, . . . , Tr−j) · Tj βr(T1, . . . , Tr) :=

  • d|r

µ r d

  • σd(T1, . . . , Td) +
  • d|r

µ r d

  • (qd + 1)

ϕr(T1, . . . , Tr−1) := rTr − βr(T1, . . . , Tr)

σr(a1, . . . , ar) = Sr = Nr−(qr+1) and βr(a1, . . . , ar) = rBr = ⇒ rar = ϕr(a1, . . . , ar−1) + rBr

slide-9
SLIDE 9

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Some recursively defined functions over Z: σ0 := 0 and for all r ≥ 1, σr(T1, . . . , Tr) := rTr −

r−1

  • j=1

σr−j(T1, . . . , Tr−j) · Tj βr(T1, . . . , Tr) :=

  • d|r

µ r d

  • σd(T1, . . . , Td) +
  • d|r

µ r d

  • (qd + 1)

ϕr(T1, . . . , Tr−1) := rTr − βr(T1, . . . , Tr)

σr(a1, . . . , ar) = Sr = Nr−(qr+1) and βr(a1, . . . , ar) = rBr = ⇒ rar = ϕr(a1, . . . , ar−1) + rBr

slide-10
SLIDE 10

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Necessary conditions on the coefficients of L-polynomial

Theorem Let X be a non-singular, absolutely irreducible, projective curve defined over Fq and let LX (t) = 1 + a1t + . . . + a2gt2g be its L-polynomial. Then the inequalities rar ≥ ϕr(a1, . . . , ar−1) hold for r = 1, . . . , g. Example a1 ≥ −(q + 1) 2a2 ≥ a2

1 + a1 − (q2 − q)

3a3 ≥ −a3

1 + a1 + 3a1a2 − (q3 − q)

4a4 ≥ −a4

1 − a2 1 − 4a2 1a2 + 4a1a3 + 2a2 − (q4 − q2)

slide-11
SLIDE 11

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Necessary conditions on the coefficients of L-polynomial

Theorem Let X be a non-singular, absolutely irreducible, projective curve defined over Fq and let LX (t) = 1 + a1t + . . . + a2gt2g be its L-polynomial. Then the inequalities rar ≥ ϕr(a1, . . . , ar−1) hold for r = 1, . . . , g. Example a1 ≥ −(q + 1) 2a2 ≥ a2

1 + a1 − (q2 − q)

3a3 ≥ −a3

1 + a1 + 3a1a2 − (q3 − q)

4a4 ≥ −a4

1 − a2 1 − 4a2 1a2 + 4a1a3 + 2a2 − (q4 − q2)

slide-12
SLIDE 12

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

The converse of the Theorem

Problem: Let (a1, a2, . . . , am) ∈ Zm satisfying rar ≥ ϕr(a1, . . . , ar−1) for all r = 1, . . . , m. Is there a curve X of genus g over Fq whose L-polynomial has the form L(t) = 1 + a1t + a2t2 + . . . + amtm + . . . ? Not in general! Hasse-Weil Theorem: L(t) = 2g

k=1(1 − wkt) with | wk |= √q

= ⇒| ar |≤ 2g r

  • · √qr

for r = 1, . . . , g .

slide-13
SLIDE 13

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

The converse of the Theorem

Problem: Let (a1, a2, . . . , am) ∈ Zm satisfying rar ≥ ϕr(a1, . . . , ar−1) for all r = 1, . . . , m. Is there a curve X of genus g over Fq whose L-polynomial has the form L(t) = 1 + a1t + a2t2 + . . . + amtm + . . . ? Not in general! Hasse-Weil Theorem: L(t) = 2g

k=1(1 − wkt) with | wk |= √q

= ⇒| ar |≤ 2g r

  • · √qr

for r = 1, . . . , g .

slide-14
SLIDE 14

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

The converse of the Theorem

Problem: Let (a1, a2, . . . , am) ∈ Zm satisfying rar ≥ ϕr(a1, . . . , ar−1) for all r = 1, . . . , m. Is there a curve X of genus g over Fq whose L-polynomial has the form L(t) = 1 + a1t + a2t2 + . . . + amtm + . . . ? Not in general! Hasse-Weil Theorem: L(t) = 2g

k=1(1 − wkt) with | wk |= √q

= ⇒| ar |≤ 2g r

  • · √qr

for r = 1, . . . , g .

slide-15
SLIDE 15

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Theorem (A., Stichtenoth) Let a1, . . . , am be integers such that rar ≥ ϕr(a1, . . . , ar−1) for r = 1, . . . , m. Then there is an integer g0 ≥ m such that for all g ≥ g0, there exists a curve over Fq of genus g whose L-polynomial has the form L(t) ≡ 1 + a1t + . . . + amtm mod tm+1

slide-16
SLIDE 16

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Sketch of the proof

Remember: rar = ϕr(a1, . . . , ar−1) + rBr for r ≥ 1. Step 1: For all m ≥ 1 and all (a1, . . . , am−1) ∈ Zm−1, ϕm(a1, . . . , am−1) ≡ 0 mod m . Step 2: Define br := r−1(rar − ϕr(a1, . . . , ar−1)) for r = 1, . . . , m. Equivalent statement: Let b1, . . . , bm be non-negative integers. Then there is a constant g0 ≥ m such that for all integers g ≥ g0 there exists a curve X

  • ver Fq of genus g such that X has exactly br points of degree r,

for r = 1, . . . , m.

slide-17
SLIDE 17

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Sketch of the proof

Remember: rar = ϕr(a1, . . . , ar−1) + rBr for r ≥ 1. Step 1: For all m ≥ 1 and all (a1, . . . , am−1) ∈ Zm−1, ϕm(a1, . . . , am−1) ≡ 0 mod m . Step 2: Define br := r−1(rar − ϕr(a1, . . . , ar−1)) for r = 1, . . . , m. Equivalent statement: Let b1, . . . , bm be non-negative integers. Then there is a constant g0 ≥ m such that for all integers g ≥ g0 there exists a curve X

  • ver Fq of genus g such that X has exactly br points of degree r,

for r = 1, . . . , m.

slide-18
SLIDE 18

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Sketch of the proof

Remember: rar = ϕr(a1, . . . , ar−1) + rBr for r ≥ 1. Step 1: For all m ≥ 1 and all (a1, . . . , am−1) ∈ Zm−1, ϕm(a1, . . . , am−1) ≡ 0 mod m . Step 2: Define br := r−1(rar − ϕr(a1, . . . , ar−1)) for r = 1, . . . , m. Equivalent statement: Let b1, . . . , bm be non-negative integers. Then there is a constant g0 ≥ m such that for all integers g ≥ g0 there exists a curve X

  • ver Fq of genus g such that X has exactly br points of degree r,

for r = 1, . . . , m.

slide-19
SLIDE 19

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Sketch of the proof

Remember: rar = ϕr(a1, . . . , ar−1) + rBr for r ≥ 1. Step 1: For all m ≥ 1 and all (a1, . . . , am−1) ∈ Zm−1, ϕm(a1, . . . , am−1) ≡ 0 mod m . Step 2: Define br := r−1(rar − ϕr(a1, . . . , ar−1)) for r = 1, . . . , m. Equivalent statement: Let b1, . . . , bm be non-negative integers. Then there is a constant g0 ≥ m such that for all integers g ≥ g0 there exists a curve X

  • ver Fq of genus g such that X has exactly br points of degree r,

for r = 1, . . . , m.

slide-20
SLIDE 20

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

The proof of Step 2:

The proof is by construction.

  • For given b1, . . . , bm, there exists a curve Y over Fq with

B1(Y) ≥ b1, . . . , Bm(Y) ≥ bm.

  • Define the sets

S1 consisting of exactly br points of degree r for r = 1, . . . , m S2 := {Q ∈ Y | Q ∈ S1 and degQ ≤ m}

  • Construct an Artin-Schreier cover

Y such that each P ∈ S1 totally ramifies and each Q ∈ S2 gets inert.

slide-21
SLIDE 21

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

The proof of Step 2:

The proof is by construction.

  • For given b1, . . . , bm, there exists a curve Y over Fq with

B1(Y) ≥ b1, . . . , Bm(Y) ≥ bm.

  • Define the sets

S1 consisting of exactly br points of degree r for r = 1, . . . , m S2 := {Q ∈ Y | Q ∈ S1 and degQ ≤ m}

  • Construct an Artin-Schreier cover

Y such that each P ∈ S1 totally ramifies and each Q ∈ S2 gets inert.

slide-22
SLIDE 22

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

The proof of Step 2:

The proof is by construction.

  • For given b1, . . . , bm, there exists a curve Y over Fq with

B1(Y) ≥ b1, . . . , Bm(Y) ≥ bm.

  • Define the sets

S1 consisting of exactly br points of degree r for r = 1, . . . , m S2 := {Q ∈ Y | Q ∈ S1 and degQ ≤ m}

  • Construct an Artin-Schreier cover

Y such that each P ∈ S1 totally ramifies and each Q ∈ S2 gets inert.

slide-23
SLIDE 23

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

The proof of Step 2:

The proof is by construction.

  • For given b1, . . . , bm, there exists a curve Y over Fq with

B1(Y) ≥ b1, . . . , Bm(Y) ≥ bm.

  • Define the sets

S1 consisting of exactly br points of degree r for r = 1, . . . , m S2 := {Q ∈ Y | Q ∈ S1 and degQ ≤ m}

  • Construct an Artin-Schreier cover

Y such that each P ∈ S1 totally ramifies and each Q ∈ S2 gets inert.

slide-24
SLIDE 24

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Special Case: m = 1

Theorem Let b be a non-negative integer. Then there are constants α(q) > 0 and β(q) such that for all integers g ≥ α(q)b + β(q), there exists a curve X over Fq of genus g having exactly b rational points. Basis step: Curves with many rational points the Garcia-Stichtenoth tower (q: square) the Elkies et al. class field tower Remark: (q: square) Let p = charFq and q be a square. Then g0 can be defined as 4p(p + 11)b.

slide-25
SLIDE 25

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Special Case: m = 1

Theorem Let b be a non-negative integer. Then there are constants α(q) > 0 and β(q) such that for all integers g ≥ α(q)b + β(q), there exists a curve X over Fq of genus g having exactly b rational points. Basis step: Curves with many rational points the Garcia-Stichtenoth tower (q: square) the Elkies et al. class field tower Remark: (q: square) Let p = charFq and q be a square. Then g0 can be defined as 4p(p + 11)b.

slide-26
SLIDE 26

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Special Case: m = 1

Theorem Let b be a non-negative integer. Then there are constants α(q) > 0 and β(q) such that for all integers g ≥ α(q)b + β(q), there exists a curve X over Fq of genus g having exactly b rational points. Basis step: Curves with many rational points the Garcia-Stichtenoth tower (q: square) the Elkies et al. class field tower Remark: (q: square) Let p = charFq and q be a square. Then g0 can be defined as 4p(p + 11)b.

slide-27
SLIDE 27

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Remark: Elkis et al.: For any q, there exists a sequence of curves Xi over Fq with lim

g→∞

N(Xi) g(Xi) = cq , where cq > 0 is a constant depending only on q. A., Stichtenoth: For any q, there exists a constant δq depending

  • nly on q such that for any c ∈ [0, δq] there exists a sequence of

curves Xi over Fq with lim

g→∞

N(Xi) g(Xi) = c .

slide-28
SLIDE 28

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Remark: Elkis et al.: For any q, there exists a sequence of curves Xi over Fq with lim

g→∞

N(Xi) g(Xi) = cq , where cq > 0 is a constant depending only on q. A., Stichtenoth: For any q, there exists a constant δq depending

  • nly on q such that for any c ∈ [0, δq] there exists a sequence of

curves Xi over Fq with lim

g→∞

N(Xi) g(Xi) = c .

slide-29
SLIDE 29

Introduction Curves with a prescribed L-polynomial up to some degree Curves with prescribed number of points

Thanks for your attention!