multiple dirichlet series
play

Multiple Dirichlet Series Gautam Chinta 2013-02-18 Mon Previous - PowerPoint PPT Presentation

Multiple Dirichlet Series Gautam Chinta 2013-02-18 Mon Previous talks of Sol Friedberg 1. Fourier expansion of (metaplectic) GL 2 Eisenstein series Previous talks of Sol Friedberg 1. Fourier expansion of (metaplectic) GL 2 Eisenstein series 2.


  1. Multiple Dirichlet Series Gautam Chinta 2013-02-18 Mon

  2. Previous talks of Sol Friedberg 1. Fourier expansion of (metaplectic) GL 2 Eisenstein series

  3. Previous talks of Sol Friedberg 1. Fourier expansion of (metaplectic) GL 2 Eisenstein series 2. The d th Fourier coefficient is a Dirichlet series with ◮ functional equations ◮ analytic continuation

  4. Previous talks of Sol Friedberg 1. Fourier expansion of (metaplectic) GL 2 Eisenstein series 2. The d th Fourier coefficient is a Dirichlet series with ◮ functional equations ◮ analytic continuation 3. These properties came from the analytic properties of the Eisenstein series

  5. This talk ◮ Focus on n = 2: Fourier coeffs now involve quadratic Dirichlet L -functions: � L ( s ′ , χ d ) e 2 π ixd W s ( dy ) E ( z , s ) = ∗ + d � =0

  6. This talk ◮ Focus on n = 2: Fourier coeffs now involve quadratic Dirichlet L -functions: � L ( s ′ , χ d ) e 2 π ixd W s ( dy ) E ( z , s ) = ∗ + d � =0 ◮ Mellin transform produces a “double Dirichlet series” L ( s , χ d ) � | d | w d � =0

  7. This talk ◮ Focus on n = 2: Fourier coeffs now involve quadratic Dirichlet L -functions: � L ( s ′ , χ d ) e 2 π ixd W s ( dy ) E ( z , s ) = ∗ + d � =0 ◮ Mellin transform produces a “double Dirichlet series” L ( s , χ d ) � | d | w d � =0 ◮ Properties can be established independent of theory of Eisenstein series (mostly)

  8. This talk ◮ Focus on n = 2: Fourier coeffs now involve quadratic Dirichlet L -functions: � L ( s ′ , χ d ) e 2 π ixd W s ( dy ) E ( z , s ) = ∗ + d � =0 ◮ Mellin transform produces a “double Dirichlet series” L ( s , χ d ) � | d | w d � =0 ◮ Properties can be established independent of theory of Eisenstein series (mostly) ◮ “Axiomatic development” of the theory of WMDS

  9. Transition to local parts ◮ Emphasis on construction of local parts. Two methods: ◮ Functional Equations (Chinta/Gunnells) ◮ Crystal basis description (Brubaker, Bump, Friedberg)

  10. Transition to local parts ◮ Emphasis on construction of local parts. Two methods: ◮ Functional Equations (Chinta/Gunnells) ◮ Crystal basis description (Brubaker, Bump, Friedberg) ◮ Two methods are (more or less) equivalent when they both apply, but it’s not so easy to see

  11. A 2 quadratic double Dirichlet series Goal: construct a two variable Dirichlet series which is roughly of the form L ( s , χ d ) � Z ( s , w ) = d w d

  12. A 2 quadratic double Dirichlet series Goal: construct a two variable Dirichlet series which is roughly of the form L ( s , χ d ) � Z ( s , w ) = d w d We will require that this series satisfy two functional equations as ◮ ( s , w ) �→ (1 − s , s + w − 1 / 2) ◮ ( s , w ) �→ ( s + w − 1 / 2 , 1 − w )

  13. A 2 quadratic double Dirichlet series Goal: construct a two variable Dirichlet series which is roughly of the form L ( s , χ d ) � Z ( s , w ) = d w d We will require that this series satisfy two functional equations as ◮ ( s , w ) �→ (1 − s , s + w − 1 / 2) ◮ ( s , w ) �→ ( s + w − 1 / 2 , 1 − w ) Where do these functional equations come from?

  14. Background on quadratic Dirichlet L -functions Define ∞ � − 1 χ d 0 ( n ) � 1 − χ d 0 ( p ) � � L ( s , χ d 0 ) = = n s p s n =1 p

  15. Background on quadratic Dirichlet L -functions Define ∞ � − 1 χ d 0 ( n ) � 1 − χ d 0 ( p ) � � L ( s , χ d 0 ) = = n s p s n =1 p ◮ Euler product ◮ Analytic continuation ◮ For d 0 a fundamental discriminant , L ( s , χ d 0 ) is entire unless d 0 = 1 ◮ Functional equation ◮ For d 0 a fundamental discriminant , L ( s , χ d 0 ) = ∗| d | 1 / 2 − s L (1 − s , χ d 0 )

  16. Background on quadratic Dirichlet L -functions Define ∞ � − 1 χ d 0 ( n ) � 1 − χ d 0 ( p ) � � L ( s , χ d 0 ) = = n s p s n =1 p ◮ Euler product ◮ Analytic continuation ◮ For d 0 a fundamental discriminant , L ( s , χ d 0 ) is entire unless d 0 = 1 ◮ Functional equation ◮ For d 0 a fundamental discriminant , L ( s , χ d 0 ) = ∗| d | 1 / 2 − s L (1 − s , χ d 0 ) But we need to define for all d . How to do this without messing up the earlier properties?

  17. Weighting polynomials Define L ( s , d ) = L ( s , χ d 0 ) · P ( s , d ) for P a weighting polynomial.

  18. Weighting polynomials Define L ( s , d ) = L ( s , χ d 0 ) · P ( s , d ) for P a weighting polynomial. What properties do we want this weighting polynomial to have? p α || d P p ( p − s , d ) ◮ Euler product: P ( s , d ) = � ◮ functional equation: P ( s , d ) = ( d / d 0 ) 1 / 2 − s P (1 − s , d ). We want this so that L ( s , d ) = ∗ d 1 / 2 − s L (1 − s , d )

  19. Weighting polynomials Define L ( s , d ) = L ( s , χ d 0 ) · P ( s , d ) for P a weighting polynomial. What properties do we want this weighting polynomial to have? p α || d P p ( p − s , d ) ◮ Euler product: P ( s , d ) = � ◮ functional equation: P ( s , d ) = ( d / d 0 ) 1 / 2 − s P (1 − s , d ). We want this so that L ( s , d ) = ∗ d 1 / 2 − s L (1 − s , d ) If this last condition is satisfied, then the double Dirichlet series will have a functional equation ( s , w ) �→ (1 − s , s + w − 1 / 2)

  20. Passage to p -parts Two types of p -parts for L ( s , d ) = L ( s , χ d 0 ) · P ( s , d ): ◮ if ( p , d 0 ) = 1: (1 − χ d 0 ( p ) p − s ) − 1 times P p ( p − s , d ) ◮ if p | d 0 , P p ( p − s , d )

  21. Passage to p -parts Two types of p -parts for L ( s , d ) = L ( s , χ d 0 ) · P ( s , d ): ◮ if ( p , d 0 ) = 1: (1 − χ d 0 ( p ) p − s ) − 1 times P p ( p − s , d ) ◮ if p | d 0 , P p ( p − s , d ) We will next describe the construction of the p -part as in Chinta-Gunnells

  22. A generating series Two variable generating function (1 − x ) − 1 P p ( x , p 2 k ) y 2 k + � � P p ( x , p 2 k +1 ) y 2 k +1 F ( x , y ) = k ≥ 0 k ≥ 0

  23. A generating series Two variable generating function (1 − x ) − 1 P p ( x , p 2 k ) y 2 k + � � P p ( x , p 2 k +1 ) y 2 k +1 F ( x , y ) = k ≥ 0 k ≥ 0 We need F to satisfy 1. (1 − x ) [ F ( x , y ) + F ( x , − y )] and 1 y [ F ( x , y ) − F ( x , − y )] px , xy √ p � � 1 are invariant under ( x , y ) �→ . 2. Also need 2nd functional equation 1 3. Limiting behavior F ( x , 0) = 1 − x

  24. A generating series Two variable generating function (1 − x ) − 1 P p ( x , p 2 k ) y 2 k + � � P p ( x , p 2 k +1 ) y 2 k +1 F ( x , y ) = k ≥ 0 k ≥ 0 We need F to satisfy 1. (1 − x ) [ F ( x , y ) + F ( x , − y )] and 1 y [ F ( x , y ) − F ( x , − y )] px , xy √ p � � 1 are invariant under ( x , y ) �→ . 2. Also need 2nd functional equation 1 3. Limiting behavior F ( x , 0) = 1 − x 1 − xy = ⇒ F ( x , y ) = (1 − x )(1 − y )(1 − px 2 y 2 )

  25. Definition of a group action Let f be the monomial x a y b z c . Define � f ( y , x , z ) if a − b even ( σ 1 f )( x , y , z ) = f ( y , x , z ) x 2 − tx 1 if a − b odd x 1 − tx 2 and define σ 2 f similarly.

  26. Definition of a group action Let f be the monomial x a y b z c . Define � f ( y , x , z ) if a − b even ( σ 1 f )( x , y , z ) = f ( y , x , z ) x 2 − tx 1 if a − b odd x 1 − tx 2 and define σ 2 f similarly. Extend to polynomials by linearity and then to rational functions. This will define an action of S 3 on rational functions.

  27. Construction of p -parts For a ≥ b ≥ c define the polynomials w ∈ W ( − 1) length ( w ) w ( x a +2 y b +1 z c ) � N a , b , c ( x , y , z ) = · D ( x ) ∆( x ) where � � ( x 2 i − t 2 x 2 ( x 2 i − x 2 D ( x ) = j ) and ∆( x ) = j ) . i < j i < j

  28. Construction of p -parts For a ≥ b ≥ c define the polynomials w ∈ W ( − 1) length ( w ) w ( x a +2 y b +1 z c ) � N a , b , c ( x , y , z ) = · D ( x ) ∆( x ) where � � ( x 2 i − t 2 x 2 ( x 2 i − x 2 D ( x ) = j ) and ∆( x ) = j ) . i < j i < j These polynomials arise in the construction of the A 2 multiple Dirichlet series. They also arise as Whittaker functions on the double cover of GL 3 .

  29. Comparison with the Gelfand-Tsetlin formula Will describe the “right-leaning” Gelfand-Tsetlin formula of BBFH (I think).

  30. Comparison with the Gelfand-Tsetlin formula Will describe the “right-leaning” Gelfand-Tsetlin formula of BBFH (I think). Let I be the GT pattern   a 00 a 01 a 02   a 11 a 12  . a 22 

  31. Comparison with the Gelfand-Tsetlin formula Will describe the “right-leaning” Gelfand-Tsetlin formula of BBFH (I think). Let I be the GT pattern   a 00 a 01 a 02   a 11 a 12  . a 22  Define the weight of I to be ( a 00 + a 01 + a 02 − a 11 − a 12 , a 11 + a 12 − a 22 , a 22 ) and “(right sum) — (up-and-right sum)” coordinates r 11 = ( a 11 − a 01 ) + ( a 12 − a 02 ) , r 12 = a 12 − a 02 , r 22 = a 22 − a 12 .

  32. GT-formula (cont.) We say ◮ I is nonstrict if the rows of I are not strictly decreasing ◮ I is right-leaning at ( i , j ) if a i , j = a i − 1 , j ◮ I is left-leaning at ( i , j ) if a i , j = a i − 1 , j − 1

  33. GT-formula (cont.) We say ◮ I is nonstrict if the rows of I are not strictly decreasing ◮ I is right-leaning at ( i , j ) if a i , j = a i − 1 , j ◮ I is left-leaning at ( i , j ) if a i , j = a i − 1 , j − 1 Define � 0 if I is nonstrict G ( I ) = G ( I ; 1 , 1) G ( I ; 1 , 2) G ( I ; 2 , 2) otherwise

Recommend


More recommend