computing test ideals of cohen macaulay modules
play

Computing Test Ideals of Cohen-Macaulay Modules Julian Benali, - PowerPoint PPT Presentation

Computing Test Ideals of Cohen-Macaulay Modules Julian Benali, Shrunal Pothagoni under Dr. Rebecca R.G. at George Mason University, MEGL May 3, 2019 J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019


  1. Computing Test Ideals of Cohen-Macaulay Modules Julian Benali, Shrunal Pothagoni under Dr. Rebecca R.G. at George Mason University, MEGL May 3, 2019 J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  2. Preliminaries All rings will be presumed to be commutative, unital, Noetherian, and local. We will use k to denote a field, R to denote a ring, and M to denote an R -module. We will be working primarily with subrings and quotients of polynomial rings and power series rings. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  3. Definitions The Krull dimension of R is the length of the longest proper chain of prime ideals p 0 � p 1 � · · · � p n . J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  4. Definitions The Krull dimension of R is the length of the longest proper chain of prime ideals p 0 � p 1 � · · · � p n . A sequence x 1 , ..., x n of elements in R is said to be a regular sequence over M if ( x 1 , ..., x n ) M � = M and x i is not a zero divisor in M / ( x 1 , ..., x i − 1 ) M for all i ∈ { 1 , ..., n } . In other words, ( x 1 , ..., x n ) M � = M and for all z ∈ M , if z / ∈ ( x 1 , ..., x i ) M then x i +1 z / ∈ ( x 1 , ..., x i ) M as well. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  5. Definitions The Krull dimension of R is the length of the longest proper chain of prime ideals p 0 � p 1 � · · · � p n . A sequence x 1 , ..., x n of elements in R is said to be a regular sequence over M if ( x 1 , ..., x n ) M � = M and x i is not a zero divisor in M / ( x 1 , ..., x i − 1 ) M for all i ∈ { 1 , ..., n } . In other words, ( x 1 , ..., x n ) M � = M and for all z ∈ M , if z / ∈ ( x 1 , ..., x i ) M then x i +1 z / ∈ ( x 1 , ..., x i ) M as well. We say M is a Cohen-Macaulay (CM) module over R if the length of the longest regular sequence over M is the same as the Krull dimension of R . A finitely generated CM module is called a maximal Cohen-Macaulay (MCM) module. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  6. Definitions Given any R -module, M , the test ideal of M is � ( N : R N cl M τ M ( R ) := N ′ ) N , N ′ ∈ R-Mod , N ⊂ N ′ where N cl M N ′ := { u ∈ M : ∀ s ∈ M , s ⊗ u ∈ Im( S ⊗ N → S ⊗ N ′ ) } J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  7. Definitions Rebecca R.G. [RG 2016] showed in the case that R is a complete local domain that we have � τ M ( R ) = f ( M ) f ∈ Hom( M , R ) That is, we find the images of the R -module homomorphisms from M to R and take their sum. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  8. Definitions Rebecca R.G. [RG 2016] showed in the case that R is a complete local domain that we have � τ M ( R ) = f ( M ) f ∈ Hom( M , R ) That is, we find the images of the R -module homomorphisms from M to R and take their sum. Our goal is then to compute the intersection of the test ideals of the MCM modules over R , denoted τ MCM ( R ). J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  9. Computing Test Ideals In practice, we do not need to compute the test ideal of every MCM R -module in order to compute τ MCM ( R ). J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  10. Computing Test Ideals In practice, we do not need to compute the test ideal of every MCM R -module in order to compute τ MCM ( R ). Let M be a nonzero free R -module. Then any projection map from M to R is a surjective R -module homomorphism and thus, τ M ( R ) = R . J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  11. Computing Test Ideals In practice, we do not need to compute the test ideal of every MCM R -module in order to compute τ MCM ( R ). Let M be a nonzero free R -module. Then any projection map from M to R is a surjective R -module homomorphism and thus, τ M ( R ) = R . Every MCM module is a direct sum of indecomposable MCM modules. Furthermore, it follows from the definition that for any CM R -modules, N and L , τ N ⊕ L ( R ) ⊃ τ N ( R ) + τ L ( R ). J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  12. Computing Test Ideals In practice, we do not need to compute the test ideal of every MCM R -module in order to compute τ MCM ( R ). Let M be a nonzero free R -module. Then any projection map from M to R is a surjective R -module homomorphism and thus, τ M ( R ) = R . Every MCM module is a direct sum of indecomposable MCM modules. Furthermore, it follows from the definition that for any CM R -modules, N and L , τ N ⊕ L ( R ) ⊃ τ N ( R ) + τ L ( R ). From these facts, we conclude that τ MCM ( R ) is the intersection of the test ideals of the non-free indecomposable MCM R -modules. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  13. Indecomposable Maximal Cohen-Macaulay Modules Finding all the indecomposable MCM modules of a ring is typically a difficult task. So, we took examples for which all the indecomposable MCM modules were known in order to compute τ MCM ( R ). J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  14. Indecomposable Maximal Cohen-Macaulay Modules Finding all the indecomposable MCM modules of a ring is typically a difficult task. So, we took examples for which all the indecomposable MCM modules were known in order to compute τ MCM ( R ). If a ring has finitely many indecomposable MCM modules up to isomorphism, the ring is said to have finite Cohen-Macaulay type, and if there are countably many, the ring is said to have countable Cohen-Macaulay type. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  15. Known Results A ring is said to be regular if the minimum number of elements needed to generate the maximal ideal is the same as the Krull dimension. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  16. Known Results A ring is said to be regular if the minimum number of elements needed to generate the maximal ideal is the same as the Krull dimension. Theorem (Rebecca R.G. 2016) For any MCM module M over a complete regular local ring R, τ M ( R ) = R and hence τ MCM ( R ) = R where the intersection is over all CM R-modules. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  17. Known Results A ring is said to be regular if the minimum number of elements needed to generate the maximal ideal is the same as the Krull dimension. Theorem (Rebecca R.G. 2016) For any MCM module M over a complete regular local ring R, τ M ( R ) = R and hence τ MCM ( R ) = R where the intersection is over all CM R-modules. Thus, calculating the intersection of the test ideals of the CM modules over a ring gives a sense of how close that ring is to being regular. J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  18. Sample Code i1 : R=QQ[u,v,w]/ideal(u*w-vˆ2) o1 = R o1 : QuotientRing i2 : M=module(ideal(u,v)) o2 = image | u v | o2 : R-module, submodule of Rˆ1 i3 : Hom(M,R) o3 = image { -1 } | v u | { -1 } | w v | o3 : R-module, submodule of Rˆ2 From this Macaulay2 output, we can read that two homomorphisms which generate Hom(( u , v ) , Q [ u , v , w ] / ( uw − v 2 )) are f 1 and f 2 defined by f 1 ( u ) = v , f 1 ( v ) = w , f 2 ( u ) = u , and f 2 ( v ) = v . J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  19. Veronese Ring Let R = k � x 3 , x 2 y , xy 2 , y 3 � . It can be shown that the only indecomposable MCM R -module are xR + yR and x 2 R + xyR + y 2 R (up to isomorphism). Thus, it is sufficient to compute the test ideal of these modules in order to calculate τ MCM ( R ). The homomorphisms which generate Hom( xR + yR , R ) are f 0 , f 1 , and f 2 defined by f 0 ( p ) = x 2 p , f 1 ( p ) = xyp , and f 2 ( p ) = y 2 p for all p ∈ xR + yR . Then we see Im( f 0 ) = ( x 3 , x 2 y ), Im( f 1 ) = ( x 2 y , xy 2 ), and Im( f 2 ) = ( xy 2 , y 3 ). Thus, τ xR + yR ( R ) = ( x 3 , x 2 y ) + ( x 2 y , xy 2 ) + ( xy 2 , y 3 ) = ( x 3 , x 2 y , xy 2 , y 3 ) J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  20. Veronese Ring Next, Hom( x 2 R + xyR + y 2 R , R ) is generated by g 1 and g 2 defined by g 1 ( p ) = xp and g 2 ( p ) = yp for all p ∈ x 2 R + xyR + y 2 R . Then we see Im( g 0 ) = ( x 3 , x 2 y , xy 2 ) and Im( g 1 ) = ( x 2 y , xy 2 , y 3 ). Thus, τ xR + yR ( R ) = ( x 3 , x 2 y , xy 2 ) + ( x 2 y , xy 2 , y 3 ) = ( x 3 , x 2 y , xy 2 , y 3 ) So, τ MCM ( R ) = ( x 2 , x 2 y , xy 2 , y 3 ), the maximal ideal of R . J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

  21. Whitney Umbrella (Type D ∞ ) Let R = k � x , y , z � / ( x 2 y + z 2 ), where k is a field of some arbitrary characteristic. Up to isomorphism, the non-free indecomposable MCM R -modules are cok ( zI − φ ) where φ is one of the following matrices ( j ∈ Z + ): � 0 � � 0 � − y − xy • • x 2 0 x 0  0 0 − xy 0   0 0 − xy 0  − y j +1 − y j 0 0 xy 0 0 x     • •     0 0 0 0 0 0 x x     y j y j − x 0 0 − xy 0 0 J. Benali, & S. Pothagoni (MEGL) Computing Test Ideals of CM Modules May 3, 2019

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