20.04.2014 Views

Proceedings of the 44th Symposium on Ring Theory and ...

Proceedings of the 44th Symposium on Ring Theory and ...

Proceedings of the 44th Symposium on Ring Theory and ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

(6) T a <strong>and</strong> T b do not have comm<strong>on</strong> summ<strong>and</strong>s.<br />

Remark 17. In <str<strong>on</strong>g>the</str<strong>on</strong>g> previous <str<strong>on</strong>g>the</str<strong>on</strong>g>orem, <str<strong>on</strong>g>the</str<strong>on</strong>g> existence <strong>and</strong> uniqueness, regarding <str<strong>on</strong>g>the</str<strong>on</strong>g> first<br />

two c<strong>on</strong>diti<strong>on</strong>s, are automatic, except <str<strong>on</strong>g>the</str<strong>on</strong>g> fact that <str<strong>on</strong>g>the</str<strong>on</strong>g> extremities <str<strong>on</strong>g>of</str<strong>on</strong>g> <str<strong>on</strong>g>the</str<strong>on</strong>g> two short exact<br />

sequences coincide up to order. This fact str<strong>on</strong>gly relies <strong>on</strong> <str<strong>on</strong>g>the</str<strong>on</strong>g> stably 2-Calabi-Yau<br />

property. It implies that µ i is involutive.<br />

Definiti<strong>on</strong> 18. In <str<strong>on</strong>g>the</str<strong>on</strong>g> previous <str<strong>on</strong>g>the</str<strong>on</strong>g>orem, µ i is called <str<strong>on</strong>g>the</str<strong>on</strong>g> mutati<strong>on</strong> in directi<strong>on</strong> i. The<br />

short exact sequences appearing are called exchange sequences.<br />

Example 19. Let<br />

T = 1 ❁ 3 ❁ ✂<br />

2<br />

✂✂ ⊕ ✂<br />

2<br />

✂✂3<br />

⊕ 1 1[dr]<br />

❁ ❁❁<br />

2 ⊕<br />

(<br />

Using Propositi<strong>on</strong> 11, we get a left add T/<br />

2❁ ❁❁<br />

✂<br />

2❁ ⊕ ❁❁<br />

1<br />

✂✂<br />

❁ 3 ⊕ ❁ ✂ ✂✂<br />

3 2<br />

)<br />

-approximati<strong>on</strong> <str<strong>on</strong>g>of</str<strong>on</strong>g><br />

✂<br />

2<br />

✂✂3<br />

✂<br />

2<br />

✂✂3 → 1 ❁ 3 ❁ ✂<br />

2<br />

✂✂<br />

<strong>and</strong> computing <str<strong>on</strong>g>the</str<strong>on</strong>g> cokernel, we get <str<strong>on</strong>g>the</str<strong>on</strong>g> exchange sequence:<br />

so that<br />

µ 2 (T ) = 1 ❁ 3 ❁ ✂<br />

2<br />

✂✂<br />

0 → 3<br />

✂ ✂✂<br />

2<br />

⊕ S 1 ⊕ 1 1[dr]<br />

❁ ❁❁<br />

2 ⊕<br />

Doing mutati<strong>on</strong> in <str<strong>on</strong>g>the</str<strong>on</strong>g> reverse directi<strong>on</strong>:<br />

0 → S 1 →<br />

→ 1 ❁ 3 ❁ ✂<br />

2<br />

✂✂ → S 1 → 0<br />

✂ ✂✂3<br />

✂<br />

1<br />

✂✂2<br />

2 ❁ ❁❁<br />

3<br />

→ 3<br />

✂ ✂✂<br />

2<br />

✂ ✂✂3<br />

✂<br />

1<br />

✂✂2 .<br />

✂<br />

2<br />

✂✂3 :<br />

2❁ ❁❁<br />

✂<br />

⊕ 1<br />

✂✂<br />

✂<br />

❁ 3 ⊕<br />

✂✂3<br />

❁ ✂<br />

2<br />

✂✂ ✂<br />

1<br />

✂✂2 .<br />

→ 0.<br />

Let us now compute µ 1 µ 2 (T ) with its two exchange sequences:<br />

µ 1 µ 2 (T ) =<br />

0 → 1 ❁ 3 ❁ ✂<br />

2<br />

✂✂ → S 1 ⊕<br />

0 → 2<br />

✂ ✂✂<br />

1<br />

✂ ✂✂2<br />

1<br />

1<br />

2❁ ❁❁<br />

✂ ✂✂<br />

❁ 3 ❁ ✂<br />

2<br />

✂✂<br />

→ 2<br />

✂ ✂✂<br />

1<br />

→ 0<br />

→ 1<br />

3<br />

❁ ❁❁<br />

2 ⊕ ✂ ✂✂<br />

✂<br />

1<br />

✂✂2 → 1 ❁ 3 ❁ ✂<br />

2<br />

✂✂ → 0<br />

⊕ S 1 ⊕ 1 1[dr]<br />

2❁ ❁❁<br />

❁ ❁❁<br />

2 ⊕ ✂<br />

2❁ ⊕ ❁❁<br />

1<br />

✂✂<br />

❁ 3 ⊕ ❁ ✂ ✂✂<br />

3 2<br />

–37–<br />

✂ ✂✂3<br />

✂<br />

1<br />

✂✂2 .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!