rational points on curves and chip firing
play

Rational points on curves and chip firing. David Zureick-Brown - PowerPoint PPT Presentation

Rational points on curves and chip firing. David Zureick-Brown (Emory University) Eric Katz (Waterloo) Slides available at http://www.mathcs.emory.edu/~dzb/slides/ 2014 Joint Math Meetings Tropical and Nonarchimedean Geometry Baltimore, MD


  1. Rational points on curves and chip firing. David Zureick-Brown (Emory University) Eric Katz (Waterloo) Slides available at http://www.mathcs.emory.edu/~dzb/slides/ 2014 Joint Math Meetings Tropical and Nonarchimedean Geometry Baltimore, MD January 16, 2014

  2. Faltings’ theorem Theorem (Faltings) Let C be a smooth curve over Q with genus at least 2. Then C ( Q ) is finite. Example For g ≥ 2, y 2 = x 2 g +1 + 1 has only finitely many solutions with x , y ∈ Q . David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 2 / 26

  3. Uniformity Problem 1 Given C, compute C ( Q ) exactly. 2 Compute bounds on # C ( Q ) . Conjecture (Uniformity) There exists a constant N ( g ) such that every smooth curve of genus g over Q has at most N ( g ) rational points. This would follow from standard conjectures (e.g. Lang’s conjecture, the higher dimensional analogue of Faltings’ theorem). David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 3 / 26

  4. Coleman’s bound Theorem (Coleman) Let X be a curve of genus g and let r = rank Z Jac X ( Q ) . Suppose p > 2 g is a prime of good reduction. Suppose r < g. Then # X ( Q ) ≤ # X ( F p ) + 2 g − 2 . Remark 1 A modified statement holds for p ≤ 2 g or for K � = Q . 2 Note: this does not prove uniformity (since the first good p might be large). David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 4 / 26

  5. Stoll’s bound Theorem (Stoll) Let X be a curve of genus g and let r = rank Z Jac X ( Q ) . Suppose p > 2 g is a prime of good reduction. Suppose r < g. Then # X ( Q ) ≤ # X ( F p ) + 2 r . David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 5 / 26

  6. Bad reduction bound Theorem (Lorenzini-Tucker, McCallum-Poonen) Let X be a curve of genus g and let r = rank Z Jac X ( Q ) . Suppose p > 2 g is a prime. Suppose r < g. Let X be a regular proper model of C. Then # X ( Q ) ≤ # X sm ( F p ) + 2 g − 2 . Remark A recent improvement due to Stoll gives a uniform bound if r ≤ g − 3. David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 6 / 26

  7. Main Theorem Theorem (ZB-Katz) Let X be a curve of genus g and let r = rank Z Jac X ( Q ) . Suppose p > 2 g is a prime. Let X be a regular proper model of C. Suppose r < g. Then # X ( Q ) ≤ # X sm ( F p ) + 2 r . David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 7 / 26

  8. Example (hyperelliptic curve with cuspidal reduction) = ( x − 50)( x − 9)( x − 3)( x + 13)( x 3 + 2 x 2 + 3 x + 4) − 2 · 11 · 19 · 173 · y 2 = x ( x + 1)( x + 2)( x + 3)( x + 4) 3 mod 5 . Analysis X ( Q ) contains 1 {∞ , (50 , 0) , (9 , 0) , (3 , 0) , ( − 13 , 0) , (25 , 20247920) , (25 , − 20247920) } # X sm ( F 5 ) = 5 2 5 7 ≤ # X ( Q ) ≤ # X sm ( F 5 ) + 2 · 1 = 7 3 5 This determines X ( Q ) David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 8 / 26

  9. Non-example = x 6 + 5 y 2 = x 6 mod 5 . Analysis 1 X ( Q ) ⊃ {∞ + , ∞ − } 2 X sm ( F 5 ) = {∞ + , ∞ − , ± (1 , ± 1) , ± (2 , ± 2 3 ) , ± (3 , ± 3 3 ) , ± (4 , ± 4 3 ) , } 3 2 ≤ # X ( Q ) ≤ # X sm ( F 5 ) + 2 · 1 = 20 5 David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 9 / 26

  10. Models = x 6 + 5 y 2 = x 6 mod 5 . Note: no point can reduce to (0 , 0). David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 10 / 26

  11. Models = x 6 + 5 2 y 2 = x 6 mod 5 Now: (0 , 5) reduces to (0 , 0). Local equation looks like xy = 5 2 David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 11 / 26

  12. Models = x 6 + 5 2 y 2 = x 6 mod 5 Blow up. Local equation looks like xy = 5 David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 12 / 26

  13. Models = x 6 + 5 4 y 2 = x 6 mod 5 Blow up. Local equation looks like xy = 5 3 David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 13 / 26

  14. Models = x 6 + 5 4 y 2 = x 6 mod 5 Blow up. Local equation looks like xy = 5 David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 14 / 26

  15. Chabauty’s method ( p -adic integration ) There exists V ⊂ H 0 ( X Q p , Ω 1 X ) with dim Q p V ≥ g − r such that, � Q ω = 0 ∀ P , Q ∈ X ( Q ) , ω ∈ V P ( Coleman, via Newton Polygons ) Number of zeroes in a residue class D P is ≤ 1 + n P , where n P = # (div ω ∩ D P ) ( Riemann-Roch ) � n P = 2 g − 2. ( Coleman’s bound ) � P ∈ X ( F p ) (1 + n P ) = # X ( F p ) + 2 g − 2. David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 15 / 26

  16. Example (from McCallum-Poonen’s survey paper) Example X : y 2 = x 6 + 8 x 5 + 22 x 4 + 22 x 3 + 5 x 2 + 6 x + 1 1 Points reducing to � Q = (0 , 1) are given by x = p · t , where t ∈ Z p √ x 6 + 8 x 5 + 22 x 4 + 22 x 3 + 5 x 2 + 6 x + 1 = 1 + x 2 + · · · y = � P t � t xdx ( x − x 3 + · · · ) dx = 2 y (0 , 1) 0 David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 16 / 26

  17. Stoll’s idea: use multiple ω � ( Coleman, via Newton Polygons ) Number of zeroes of ω in a residue class D P is ≤ 1 + n P , where n P = # (div ω ∩ D P ) Let � n P = min ω ∈ V # (div ω ∩ D P ) ( Example ) r ≤ g − 2, ω 1 , ω 2 ∈ V ( Stoll’s bound ) � � n P ≤ 2 r . (Recall dim Q p V ≥ g − r ) David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 17 / 26

  18. Stoll’s bound; proof. Let D = � � n P P . Wanted: deg D ≤ 2 r (Clifford) If H 0 ( X F p , K − D ′ ) � = 0 then dim H 0 ( X F p , D ′ ) ≤ 1 2 deg D ′ + 1 ( D ′ = K − D ) 1 2 deg( K − D ) + 1 ≥ dim H 0 ( X F p , K − D ) ( Assumption ) dim H 0 ( X F p , K − D ) ≥ g − r (Recall dim Q p V ≥ g − r ) David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 18 / 26

  19. Complications when X F p is singular 1 ω ∈ H 0 ( X , Ω) may vanish along components of X F p . 2 I.e. H 0 ( X F p , K − D ) � = 0 �⇒ D is special. 3 rank( K − D ) � = dim H 0 ( X F p , K − D ) − 1 Summary The relationship between dim H 0 ( X F p , K − D ) and deg D is less transparent and does not follow from geometric techniques. David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 19 / 26

  20. Rank of a divisor Definition (Rank of a divisor is) 1 r ( D ) = − 1 if | D | is empty. 2 r ( D ) ≥ 0 if | D | is nonempty 3 r ( D ) ≥ k if | D − E | is nonempty for any effective E with deg E = k . Remark 1 If X is smooth, then r ( D ) = dim H 0 ( X , D ) − 1. 2 If X is has multiple components, then r ( D ) � = dim H 0 ( X , D ) − 1. Remark Ingredients of Stoll’s proof only use formal properties of r ( D ). David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 20 / 26

  21. Formal ingredients of Stoll’s proof Need: r ( K − D ) ≤ 1 (Clifford) 2 deg( K − D ) (Large rank) r ( K − D ) ≥ g − r − 1 (Recall, V ⊂ H 0 ( X Q p , Ω 1 X ) , dim Q p V ≥ g − r ) David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 21 / 26

  22. Semistable case Idea : any section s ∈ H 0 ( X , D ) can be scaled to not vanish on a component (but may now have zeroes or poles at other components.) Divisors on graphs : David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 22 / 26

  23. Semistable case Idea : any section s ∈ H 0 ( X , D ) can be scaled to not vanish on a component (but may now have zeroes or poles at other components.) Divisors on graphs : David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 23 / 26

  24. Semistable case Idea : any section s ∈ H 0 ( X , D ) can be scaled to not vanish on a component (but may now have zeroes or poles at other components.) Divisors on graphs : David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 24 / 26

  25. Divisors on graphs Definition For D ∈ Div Γ, r num ( D ) ≥ k if | D − E | is non-empty for every effective E of degree k . Theorem (Baker, Norine) Riemann-Roch for r num . Clifford’s theorem for r num . Specialization : r num ( D ) ≥ r ( D ) . Formal corollary : X ( Q ) ≤ # X sm ( F p ) + 2 r (for X totally degenerate) . David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 25 / 26

  26. General case (not totally degenerate) – abelian rank Problems when g (Γ) < g ( X ). (E.g. rank can increase after reduction.) Definition (Abelian rank r ab ) After winning winning the chip firing game, we additionally require that the resulting divisor is equivalent to an effective divisor on that component. Theorem (Katz-ZB) Clifford’s theorem holds for r ab Specialization : r ab ( K − D ) ≥ g − r. Formal corollary X ( Q ) ≤ # X sm ( F p ) + 2 r (for semistable curves.) David Zureick-Brown (Emory) Rational points on curves and chip firing. January 16, 2014 26 / 26

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend