constructions of derived equivalences of finite posets
play

Constructions of Derived Equivalences of Finite Posets Sefi - PDF document

Constructions of derived equivalences of finite posets Constructions of Derived Equivalences of Finite Posets Sefi Ladkani Einstein Institute of Mathematics The Hebrew University of Jerusalem http://www.ma.huji.ac.il/~sefil/ 1 Constructions


  1. Constructions of derived equivalences of finite posets Constructions of Derived Equivalences of Finite Posets Sefi Ladkani Einstein Institute of Mathematics The Hebrew University of Jerusalem http://www.ma.huji.ac.il/~sefil/ 1

  2. Constructions of derived equivalences of finite posets Notions X – Poset (finite partially ordered set). The Hasse diagram G X of X is a directed acyclic graph. • Vertices: the elements x ∈ X . • Edges x → y for pairs x < y with no z such that x < z < y . X carries a natural topology : U ⊆ X is open if x ∈ U , y ≥ x ⇒ y ∈ U We get a finite T 0 topological space. Equivalence of notions: Posets ⇔ Finite T 0 spaces For a field k , the incidence algebra kX of X is a matrix subalgebra spanned by e xy for x ≤ y . 2

  3. � � Constructions of derived equivalences of finite posets Example Poset X = { 1 , 2 , 3 , 4 } with 1 < 2 , 1 < 3 , 1 < 4 , 2 < 3 , 2 < 4 , 3 < 4 Hasse diagram 1 � � � ������� � � � � � 2 3 � � � ������� � � � � � 4 Topology The open sets are: φ, { 4 } , { 2 , 4 } , { 3 , 4 } , { 2 , 3 , 4 } , { 1 , 2 , 3 , 4 } Incidence algebra ( ∗ can take any value)   ∗ ∗ ∗ ∗ 0 0 ∗ ∗     0 0 ∗ ∗     0 0 0 ∗ 3

  4. Constructions of derived equivalences of finite posets Three Equivalent Categories A – Abelian category. • Sheaves over X with values in A : U �→ F ( U ) U ⊆ X open with restriction maps F ( U ) → F ( V ) ( U ⊇ V ), pre-sheaf and gluing conditions. • Commutative diagrams of shape G X over A , or functors X → A : r xy − − → F y x → y F x with r xy ∈ hom A ( F x , F y ) and commutativity relations. Fix a field k , and specialize: A – finite dimensional vector spaces over k • Finitely generated right modules over the incidence algebra of X over k . 4

  5. Constructions of derived equivalences of finite posets The Problem D b ( X ) – Bounded derived category of sheaves / diagrams / modules (over X ). Two posets X, Y are equivalent ( X ∼ Y ) if D b ( X ) ≃ D b ( Y ) Problem. When X ∼ Y for two posets X, Y ? No known algorithm that decides if X ∼ Y ; however one can use: • Invariants of the derived category; If D b ( X ) ≃ D b ( Y ) then X and Y must have the same invariants. Examples of invariants are: • The number of points of X . • The Euler bilinear form on X . • Constructions Start with some “nice” X and get many Y -s with X ∼ Y . 5

  6. � � � � � � � Constructions of derived equivalences of finite posets Known Constructions • BGP Reflection When X is a tree and s ∈ X is a source (or a sink ), invert all arrows from (to) s and get a new tree X ′ with X ′ ∼ X . Example. • and • • � ������� � ������� • • • • � ������� • are equivalent. • The square and D 4 • and • � � ������� � � � � � � • • • � � � � � ������� � ������� � � � � � � � � � � • • • are equivalent. 6

  7. Constructions of derived equivalences of finite posets New Construction A few definitions Given a poset S , denote by S op the opposite poset , with S op = S and s ≤ s ′ in S op if and only if s ≥ s ′ in S . A poset S is called a bipartite graph if we can partition S = S 0 ∐ S 1 with S 0 , S 1 discrete with the property that s < s ′ in S implies s ∈ S 0 , s ′ ∈ S 1 . Let X = { X s } s ∈ S be a collection of posets indexed by the elements of another poset S . The lexicographic sum of the X s along S , denoted ⊕ S X , is a new poset ( X, ≤ ); Its elements are X = � s ∈ S X s , with the order x ≤ y for x ∈ X s , y ∈ X t if either s < t (in S ) or s = t and x ≤ y (in X s ). 7

  8. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � Constructions of derived equivalences of finite posets New Construction – Theorem Theorem. If S is a bipartite graph and X = { X s } s ∈ S is a collection of posets, then ⊕ S X ∼ ⊕ S op X Example. = S op S = • • • • • � � � � � ������� � ������� � � � � � � � � � � • • • • • • • • • • • X = • � � � ������� � � ������� � � � � � � � � � � � • • • • • • ⊕ S X ⊕ S op X • • • • • • � � � � � ������� � ������� � � � � � � � � � � • • • • • • • � � � � � � � � � � � � ������� � � � ������� � � � � � � ������� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � • • • • • • • � � � � ������� � � ������� � � � � � � � � � � • • • • • • 8

  9. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � Constructions of derived equivalences of finite posets Idea of the Proof Let Y ⊂ X be closed, U = X \ Y . Denote by i : Y → X , j : U → X the inclusions. P y = i ∗ i − 1 P y , ˜ Consider the truncations ˜ I u = j ! j − 1 I u for y ∈ Y , u ∈ U . Example. X = Y ∪ U . ���� ���� ���� ���� 0 0 k k � ������� � ������� 0 0 0 0 k k � � � � � � � � � � � � � � � � � � � � � � � ������� � � � � � ������� � � ������� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � 0 0 0 0 0 0 k k k k � � � � � � � � ������� � � ������� � � � � � � � � � � � � � � � � � � � � � 0 0 0 k k k ˜ P y P y Then { ˜ P y } y ∈ Y ∪ { ˜ I u [1] } u ∈ U is a strongly ex- ceptional collection in D b ( X ), hence D b ( X ) ≃ D b ( A Y ) where A Y = End D b ( X ) (( ⊕ Y ˜ P y ) ⊕ ( ⊕ U ˜ I u )[1]). 9

  10. Constructions of derived equivalences of finite posets Proof – continued k -basis of the algebra A Y e u ′ u : u ′ ≤ u � e yy ′ : y ≤ y ′ � � � ∪ ∪ { e uy : y < u } where y, y ′ ∈ Y , u ′ , u ∈ U . Multiplication formulas e yy ′ e y ′ y ′′ = e yy ′′ , e u ′′ u ′ e u ′ u = e u ′′ u if y ′ < u and 0 otherwise. = e uy ′ e uy e yy ′ if y < u ′ and 0 otherwise. = e u ′ y e u ′ u e uy Define a binary relation ≤ ′ on X ′ = U ∐ Y by u ′ ≤ ′ u ⇔ u ′ ≤ u y ≤ ′ y ′ ⇔ y ≤ y ′ u < ′ y ⇔ y < u ≤ ′ is a partial order if and only if y ≤ y ′ ∈ Y , u ′ ≤ u ∈ U , y < u ⇒ y ′ < u ′ In this case, the algebra A Y is isomorphic to the incidence algebra of ( X ′ , ≤ ′ ). 10

  11. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � Constructions of derived equivalences of finite posets Ordinal Sums Corollary. X ⊕ Y ∼ Y ⊕ X . Proposition. Assume that for any X, Y, Z , ( ⋆ ) X ⊕ Y ⊕ Z ∼ Y ⊕ X ⊕ Z Then, for all X 1 , . . . , X n and π ∈ S n , X π (1) ⊕ · · · ⊕ X π ( n ) ∼ X 1 ⊕ · · · ⊕ X n Counterexample to ( ⋆ ) . • • • • • � ��������������� � � � ������� � � ������� � ��������������� � � � � � � � � � � • • • � � � � � � � � � � � � � ��������������� � � � � � � � � � � � � � � � � � � � � � � � � • � • • � • � � � � � � � ��������������� � � � � � � � � � � � ������� � � ������� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � • • � • • • � • � ��������������� � ��������������� � � � ������� � � ������� � ������� � � ������� � � � � � � � � � � • • • • • • X ⊕ Y ⊕ Z Y ⊕ X ⊕ Z are not equivalent! 11

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