hilbert functions in algebra and geometry
play

Hilbert Functions in Algebra and Geometry Alexandra Seceleanu - PowerPoint PPT Presentation

Hilbert Functions in Algebra and Geometry Alexandra Seceleanu Department of Mathematics University of NebraskaLincoln GWCAWMMG workshop April 13, 2019 Outline What is a Hilbert function? Hilberts Theorem Classification of Hilbert


  1. Hilbert Functions in Algebra and Geometry Alexandra Seceleanu Department of Mathematics University of Nebraska–Lincoln GWCAWMMG workshop April 13, 2019

  2. Outline What is a Hilbert function? Hilbert’s Theorem Classification of Hilbert Functions in Geometry Open questions

  3. Graded rings Definition A commutative unital ring R is called a graded ring if it can be written as a direct sum of subgroups � R = R i such that R i R j ⊆ R i + j , ∀ i , j ≥ 0 . i ≥ 0 Elements of R i are called homogeneous elements of degree i . Example ◮ polynomial rings in several variables R = F [ x 1 , . . . , x n ] , R i is the set of all homogeneous polynomials of degree i . � i ≥ 0 I i of any ideal I . ◮ the blowup (Rees) algebra R ( I ) =

  4. Graded rings Definition A commutative unital ring R is called a graded ring if it can be written as a direct sum of subgroups � R = R i such that R i R j ⊆ R i + j , ∀ i , j ≥ 0 . i ≥ 0 Elements of R i are called homogeneous elements of degree i . Example ◮ polynomial rings in several variables R = F [ x 1 , . . . , x n ] , R i is the set of all homogeneous polynomials of degree i . � i ≥ 0 I i of any ideal I . ◮ the blowup (Rees) algebra R ( I ) =

  5. Graded Modules Definition A module M over a graded ring R is called a graded module if it can be written as a direct sum of subgroups � M = M j such that R i M j ⊆ M i + j ∀ i , j ≥ 0 . j ≥ 0 Example If R is a graded ring and I is a homogeneous ideal then the ideal I as well as the quotient ring R / I are graded R -modules.

  6. Graded Modules Definition A module M over a graded ring R is called a graded module if it can be written as a direct sum of subgroups � M = M j such that R i M j ⊆ M i + j ∀ i , j ≥ 0 . j ≥ 0 Example If R is a graded ring and I is a homogeneous ideal then the ideal I as well as the quotient ring R / I are graded R -modules.

  7. Hilbert Function From now ◮ R = F [ x 1 , . . . , x n ] ◮ M a finitely generated graded R -module. Definition The Hilbert function of a graded R -module M is given by H M : N → N , H M ( i ) = dim F ( M i ) . Example/Exercise (Polynomial ring) � n + i − 1 � For M = R = F [ x 1 , . . . , x n ] , we have H M ( i ) = . i

  8. Hilbert Function From now ◮ R = F [ x 1 , . . . , x n ] ◮ M a finitely generated graded R -module. Definition The Hilbert function of a graded R -module M is given by H M : N → N , H M ( i ) = dim F ( M i ) . Example/Exercise (Polynomial ring) � n + i − 1 � For M = R = F [ x 1 , . . . , x n ] , we have H M ( i ) = . i

  9. Hilbert Function Example Example I = ( x 3 y , x 2 y 4 ) ⊆ R = F [ x , y ] 0 1 2 3 4 5 6 Figure: A picture of the ideal I i 0 1 2 3 4 5 6 7 8 9 10 11 12 H I ( i ) 0 0 0 0 1 2 4 5 6 7 8 9 10 H R / I ( i ) 1 2 3 4 4 4 3 3 3 3 3 3 3

  10. Hilbert Function Example Example I = ( x 3 y , x 2 y 4 ) ⊆ R = F [ x , y ] i 0 1 2 3 4 5 6 7 8 9 10 11 12 H I ( i ) 0 0 0 0 1 2 4 5 6 7 8 9 10 H R / I ( i ) 1 2 3 4 4 4 3 3 3 3 3 3 3 Patterns ?

  11. Hilbert Function Example Example I = ( x 3 y , x 2 y 4 ) ⊆ R = F [ x , y ] i 0 1 2 3 4 5 6 7 8 9 10 11 12 H I ( i ) 0 0 0 0 1 2 4 5 6 7 8 9 10 H R / I ( i ) 1 2 3 4 4 4 3 3 3 3 3 3 3 Patterns ? ◮ H I ( i ) grows linearly for i ≫ 0: H I ( i ) = i − 2 for i ≥ 6. ◮ H R / I ( i ) eventually constant for i ≫ 0: H R / I ( i ) = 3 for i ≥ 6.

  12. Hilbert Series Definition The Hilbert series of a graded module M is the generating function � H M ( i ) t i . HS M ( t ) = i ≥ 0 Example (Polynomial ring) 1 For M = R = F [ x 1 , . . . , x n ] , we have HS M ( t ) = ( 1 − t ) n .

  13. Hilbert Series Example Example 1 If R = F [ x 1 , . . . , x n ] , then HS R ( t ) = ( 1 − t ) n . Proof: � � n 1 HS R ( t ) = ⇔ 1 − t � ( 1 + t + t 2 + · · · t a + · · · ) n ⇔ dim F ( R i ) t i = i ≥ 0 dim F ( R i ) = # { ( a 1 , a 2 , . . . , a n ) | a 1 + a 2 + · · · + a n = i } ⇔ # { x a 1 1 x a 2 2 · · · x a n dim F ( R i ) = n ∈ R i } � .

  14. Hilbert Series Example Example 1 If R = F [ x 1 , . . . , x n ] , then HS R ( t ) = ( 1 − t ) n . Proof: � � n 1 HS R ( t ) = ⇔ 1 − t � ( 1 + t + t 2 + · · · t a + · · · ) n ⇔ dim F ( R i ) t i = i ≥ 0 dim F ( R i ) = # { ( a 1 , a 2 , . . . , a n ) | a 1 + a 2 + · · · + a n = i } ⇔ # { x a 1 1 x a 2 2 · · · x a n dim F ( R i ) = n ∈ R i } � .

  15. Enter Hilbert Figure: David Hilbert (1862-1943)

  16. Hilbert-Serre Theorem Theorem (Hilbert-Serre) If M is a finitely generated graded module over the polynomial ring R = F [ x 1 , . . . , x n ] then p ( t ) HS M ( t ) = ( 1 − t ) n for some p ( t ) ∈ Z [ t ] . h ( t ) In reduced form one can write HS M ( t ) = ( 1 − t ) d for unique ◮ h -polynomial h = h 0 + h 1 t + . . . + h s t s ∈ Z [ t ] with h ( 1 ) � 0; h 0 , h 1 , . . . , h s is called the h -vector of M ◮ d ∈ N , 0 ≤ d ≤ n called the Krull dimension of M . Corollary (Hilbert) The Hilbert function of M is eventually given by a polynomial function of degree equal to d − 1 called the Hilbert polynomial .

  17. Hilbert-Serre Theorem Theorem (Hilbert-Serre) If M is a finitely generated graded module over the polynomial ring R = F [ x 1 , . . . , x n ] then p ( t ) HS M ( t ) = ( 1 − t ) n for some p ( t ) ∈ Z [ t ] . h ( t ) In reduced form one can write HS M ( t ) = ( 1 − t ) d for unique ◮ h -polynomial h = h 0 + h 1 t + . . . + h s t s ∈ Z [ t ] with h ( 1 ) � 0; h 0 , h 1 , . . . , h s is called the h -vector of M ◮ d ∈ N , 0 ≤ d ≤ n called the Krull dimension of M . Corollary (Hilbert) The Hilbert function of M is eventually given by a polynomial function of degree equal to d − 1 called the Hilbert polynomial .

  18. Hilbert-Serre Theorem Theorem (Hilbert-Serre) If M is a finitely generated graded module over the polynomial ring R = F [ x 1 , . . . , x n ] then p ( t ) HS M ( t ) = ( 1 − t ) n for some p ( t ) ∈ Z [ t ] . h ( t ) In reduced form one can write HS M ( t ) = ( 1 − t ) d for unique ◮ h -polynomial h = h 0 + h 1 t + . . . + h s t s ∈ Z [ t ] with h ( 1 ) � 0; h 0 , h 1 , . . . , h s is called the h -vector of M ◮ d ∈ N , 0 ≤ d ≤ n called the Krull dimension of M . Corollary (Hilbert) The Hilbert function of M is eventually given by a polynomial function of degree equal to d − 1 called the Hilbert polynomial .

  19. Properties of Hilbert Series Proposition 1. Additivity in short exact sequences: if 0 → A → B → C → 0 is a short exact sequence of graded modules and maps then HS B ( t ) = HS A ( t ) + HS C ( t ) . 2. Sensitivity to regular elements: if M is a graded module and f ∈ R d , d ≥ 1 , is a non zero-divisor on M then HS M / fM ( t ) = ( 1 − t d ) HS M ( t ) .

  20. Hilbert Series Example Example For R = F [ x , y , z ] let’s compute the Hilbert Series for M = R / ( x 2 + y 2 + z 2 , x 3 + y 3 + z 3 , x 4 + y 4 + z 4 ) � ���������� �� ���������� � � ���������� �� ���������� � � ���������� �� ���������� � f 1 f 2 f 3 . ◮ f 1 is a non zero-divisor on R , thus HS R / f 1 ) ( t ) = ( 1 − t 2 ) HS R ( t ) ◮ f 2 is a non zero-divisor on R / ( f 1 ) , thus HS R / ( f 1 , f 2 ) ( t ) = ( 1 − t 3 ) HS R / ( f 1 ) ( t ) = ( 1 − t 3 )( 1 − t 2 ) HS R ( t ) ◮ f 3 is a non zero-divisor on R / ( f 1 , f 2 ) , thus ( 1 − t 4 ) HS R / ( f 1 , f 2 ) ( t ) = ( 1 − t 4 )( 1 − t 3 )( 1 − t 2 ) HS R ( t ) HS R / ( f 1 , f 2 , f 3 ) ( t ) = ( 1 − t 4 )( 1 − t 3 )( 1 − t 2 ) = ( 1 − t ) 3 t 6 + 3 t 5 + 5 t 4 + 6 t 3 + 5 t 2 + 3 t + 1 . =

  21. Hilbert Series Example Example For R = F [ x , y , z ] let’s compute the Hilbert Series for M = R / ( x 2 + y 2 + z 2 , x 3 + y 3 + z 3 , x 4 + y 4 + z 4 ) � ���������� �� ���������� � � ���������� �� ���������� � � ���������� �� ���������� � f 1 f 2 f 3 . ◮ f 1 is a non zero-divisor on R , thus HS R / f 1 ) ( t ) = ( 1 − t 2 ) HS R ( t ) ◮ f 2 is a non zero-divisor on R / ( f 1 ) , thus HS R / ( f 1 , f 2 ) ( t ) = ( 1 − t 3 ) HS R / ( f 1 ) ( t ) = ( 1 − t 3 )( 1 − t 2 ) HS R ( t ) ◮ f 3 is a non zero-divisor on R / ( f 1 , f 2 ) , thus ( 1 − t 4 ) HS R / ( f 1 , f 2 ) ( t ) = ( 1 − t 4 )( 1 − t 3 )( 1 − t 2 ) HS R ( t ) HS R / ( f 1 , f 2 , f 3 ) ( t ) = ( 1 − t 4 )( 1 − t 3 )( 1 − t 2 ) = ( 1 − t ) 3 t 6 + 3 t 5 + 5 t 4 + 6 t 3 + 5 t 2 + 3 t + 1 . =

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