calabi yau properties of postnikov diagrams
play

CalabiYau properties of Postnikov diagrams Matthew Pressland - PowerPoint PPT Presentation

CalabiYau properties of Postnikov diagrams Matthew Pressland University of Leeds FD Seminar, 21.05.20 Postnikov diagrams 1 A Postnikov diagram D consists 7 of n oriented strands in an oriented disc, 2 connecting marked points t 1 , . . . ,


  1. Calabi–Yau properties of Postnikov diagrams Matthew Pressland University of Leeds FD Seminar, 21.05.20

  2. Postnikov diagrams 1 A Postnikov diagram D consists 7 of n oriented strands in an oriented disc, 2 connecting marked points t 1 , . . . , n u around the boundary, and satisfying 6 (P0) Each marked point is the source of one strand and the target of one strand. 3 (P1) The strands cross transversely, pairwise, and finitely many times. 5 4 (P2) Moving along each strand, the signs of its crossings with other strands alternate. (P3) A strand does not cross itself. (P4) If two strands cross twice, they are oriented in opposite directions between these crossings. D determines σ D P S n by mapping the source of each strand to its target. In the example, σ D “ p 1 , 6 , 3 qp 2 , 4 , 7 , 5 q .

  3. The quiver 1 The strands of D cut the disc into 7 regions, such that the orientation 2 of strands around the boundary of each region is either alternating , 6 clockwise , or anticlockwise . D determines a quiver Q D with 3 ( Q 0 ) vertices corresponding to the alternating regions 5 4 ( Q 1 ) arrows corresponding to crossings of strands Some vertices and arrows are on the boundary, and will sometimes play a different role to the others—we mark them in blue and call them frozen .

  4. The quiver 1 ˛ ˛ ˛ ˛ ˛ ˛ ˛ The strands of D cut the disc into 7 ˛ ˛ ˛ ˛ ˛ ˛ ˛ regions, such that the orientation 2 of strands around the boundary ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ of each region is either alternating , 6 ˛ ˛ ˛ ˛ ˛ ˛ ˛ clockwise , or anticlockwise . ˛ ˛ D determines a quiver Q D with 3 ˛ ˛ ˛ ˛ ˛ ˛ ˛ ( Q 0 ) vertices corresponding to the ˛ ˛ ˛ ˛ ˛ ˛ ˛ alternating regions 5 4 ˛ ˛ ˛ ˛ ˛ ˛ ˛ ( Q 1 ) arrows corresponding to crossings of strands Some vertices and arrows are on the boundary, and will sometimes play a different role to the others—we mark them in blue and call them frozen .

  5. The quiver 1 ˛ ˛ ˛ ˛ ˛ ˛ ˛ The strands of D cut the disc into 7 ˛ ˛ ˛ ˛ ˛ ˛ ˛ regions, such that the orientation 2 of strands around the boundary ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ of each region is either alternating , 6 ˛ ˛ ˛ ˛ ˛ ˛ ˛ clockwise , or anticlockwise . ˛ ˛ D determines a quiver Q D with 3 ˛ ˛ ˛ ˛ ˛ ˛ ˛ ( Q 0 ) vertices corresponding to the ˛ ˛ ˛ ˛ ˛ ˛ ˛ alternating regions 5 4 ˛ ˛ ˛ ˛ ˛ ˛ ˛ ( Q 1 ) arrows corresponding to crossings of strands Some vertices and arrows are on the boundary, and will sometimes play a different role to the others—we mark them in blue and call them frozen .

  6. Two commutative algebras The permutation σ D is a Grassmann permutation, and hence determines a particular positroid subvariety Π ˝ p σ D q Ď Gr n k of the Grassmannian of k -dimensional subspaces of C n [Postnikov]. Our first commutative algebra is the homogeneous coordinate ring C r p Π ˝ p σ D qs of this projective variety. Our second is the cluster algebra A D with invertible frozen variables determined by the quiver Q D . Theorem (Serhiyenko–Sherman-Bennett–Williams, Galashin–Lam) Ñ C r p „ There is an isomorphism A D Π ˝ p σ D qs , mapping the initial cluster variables to restrictions of Plücker coordinates. In particular, A D depends only on σ D ; the choice of D corresponds to a choice of initial seed. For σ D : i ÞÑ i ` k mod n , the variety Π ˝ p σ D q is dense in Gr n k , and the cluster algebra with non-invertible frozen variables attached to Q D is n isomorphic to the homogeneous coordinate ring C r x k s . [Scott] Gr

  7. A non-commutative algebra 1 7 The oriented regions of D are either 2 clockwise ( ˝ ) or anticlockwise ( ‚ ). Thus Q D has a determined set of 6 ‚ -cycles and ˝ -cycles. 3 Let A D be the C -algebra determined by Q D with relations as follows: 5 Each non-boundary (green) arrow a 4 can be completed to either a ‚ -cycle or a ˝ -cycle by unique paths p ‚ a and p ˝ a ; we impose the relation p ‚ a “ p ˝ a for each a . This is an example of a frozen Jacobian algebra , for the potential W “ ř p‚ -cycles q ´ ř p˝ -cycles q . Technical note: we take the complete path algebra of Q D over C , and the quotient by the closure of the ideal generated by the given relations.

  8. A non-commutative algebra 1 ˛ ˛ ˛ ˛ ˛ ˛ ˛ 7 ˛ ˛ ˛ ˛ ˛ ˛ ˛ The oriented regions of D are either 2 clockwise ( ˝ ) or anticlockwise ( ‚ ). ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ Thus Q D has a determined set of 6 ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ ‚ -cycles and ˝ -cycles. ˛ 3 Let A D be the C -algebra determined ˛ ˛ ˛ ˛ ˛ ˛ ˛ by Q D with relations as follows: ˛ ˛ ˛ ˛ ˛ ˛ ˛ 5 Each non-boundary (green) arrow a 4 ˛ ˛ ˛ ˛ ˛ ˛ ˛ can be completed to either a ‚ -cycle or a ˝ -cycle by unique paths p ‚ a and p ˝ a ; we impose the relation p ‚ a “ p ˝ a for each a . This is an example of a frozen Jacobian algebra , for the potential W “ ř p‚ -cycles q ´ ř p˝ -cycles q . Technical note: we take the complete path algebra of Q D over C , and the quotient by the closure of the ideal generated by the given relations.

  9. A non-commutative algebra 1 ˛ ˛ ˛ ˛ ˛ ˛ ˛ 7 ˛ ˛ ˛ ˛ ˛ ˛ ˛ The oriented regions of D are either 2 clockwise ( ˝ ) or anticlockwise ( ‚ ). ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ Thus Q D has a determined set of 6 ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ ‚ -cycles and ˝ -cycles. ˛ 3 Let A D be the C -algebra determined ˛ ˛ ˛ ˛ ˛ ˛ ˛ by Q D with relations as follows: ˛ ˛ ˛ ˛ ˛ ˛ ˛ 5 Each non-boundary (green) arrow a 4 ˛ ˛ ˛ ˛ ˛ ˛ ˛ can be completed to either a ‚ -cycle or a ˝ -cycle by unique paths p ‚ a and p ˝ a ; we impose the relation p ‚ a “ p ˝ a for each a . This is an example of a frozen Jacobian algebra , for the potential W “ ř p‚ -cycles q ´ ř p˝ -cycles q . Technical note: we take the complete path algebra of Q D over C , and the quotient by the closure of the ideal generated by the given relations.

  10. Main goal Objective Use the non-commutative algebra A D to construct an additive categorification Ñ C r p „ of the cluster algebra A D Π ˝ p σ D qs . Our approach will hinge on a particular Calabi–Yau symmetry property of the algebra A D , which we will come to shortly. This requires a non-degeneracy assumption: we ask that D is connected , meaning the union of its strands is a connected set. For the special permutation σ D : i ÞÑ i ` k mod n , a categorification of A D is provided by Jensen–King–Su’s Grassmannian cluster category. We will recover this category for these special diagrams, but via a different approach.

  11. Interlude: dimer models 1 Consider a bipartite graph drawn 7 in our disc, together with half-edges 2 connecting some nodes to the boundary marked points. 6 This is called a dimer model, and it also determines a quiver and frozen Jacobian 3 algebra, called the dimer algebra . This construction makes sense on any 5 4 oriented surface with or without boundary. Theorem (Broomhead) The dimer algebra of a consistent dimer model on the torus is bimodule 3 -Calabi–Yau. The dimer also determines strands—on the disc, consistency means that these strands are a Postnikov diagram.

  12. Interlude: dimer models 1 ˛ ˛ ˛ ˛ ˛ ˛ ˛ Consider a bipartite graph drawn 7 ˛ ˛ ˛ ˛ ˛ ˛ ˛ in our disc, together with half-edges 2 connecting some nodes to the boundary ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ marked points. 6 ˛ ˛ ˛ ˛ ˛ ˛ ˛ ˛ This is called a dimer model, and it also ˛ determines a quiver and frozen Jacobian 3 ˛ ˛ ˛ ˛ ˛ ˛ ˛ algebra, called the dimer algebra . ˛ ˛ ˛ ˛ ˛ ˛ ˛ This construction makes sense on any 5 4 ˛ ˛ ˛ ˛ ˛ ˛ ˛ oriented surface with or without boundary. Theorem (Broomhead) The dimer algebra of a consistent dimer model on the torus is bimodule 3 -Calabi–Yau. The dimer also determines strands—on the disc, consistency means that these strands are a Postnikov diagram.

  13. Interlude: dimer models 1 Consider a bipartite graph drawn 7 in our disc, together with half-edges 2 connecting some nodes to the boundary marked points. 6 This is called a dimer model, and it also determines a quiver and frozen Jacobian 3 algebra, called the dimer algebra . This construction makes sense on any 5 4 oriented surface with or without boundary. Theorem (Broomhead) The dimer algebra of a consistent dimer model on the torus is bimodule 3 -Calabi–Yau. The dimer also determines strands—on the disc, consistency means that these strands are a Postnikov diagram.

  14. Internally Calabi–Yau algebras Our main result is a version of Broomhead’s theorem, adapted to dimer models on the disc by weakening the 3 -Calabi–Yau property at the boundary. Let A be a Noetherian K -algebra, e “ e 2 P A an idempotent, and A ε “ A b C A op its enveloping algebra. Write D b e p A q “ t X P D b p A q : H ˚ p X q P fd p A { AeA qu . Definition A is internally bimodule 3 -Calabi–Yau with respect to e if (1) A P per A ε with projdim A ε A ď 3 , (2) there is a triangle A Ñ R Hom A ε p A, A ε qr 3 s Ñ C Ñ A r 1 s in D p A ε q such that R Hom A p C, M q “ 0 for all M P D b e p A q , and R Hom A op p C, N q “ 0 for all N P D b e p A op q . Consequence: gl . dim A ď 3 and Ext i A p X, Y q “ D Ext 3 ´ i A p Y, X q for any X P mod A and Y P fd p A { AeA q .

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