"Rank 2 cluster algebra"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
 
(사용자 3명의 중간 판 40개는 보이지 않습니다)
1번째 줄: 1번째 줄:
−
<h5>introduction</h5>
+
==introduction==
  
 
* cluster algebra defined by a 2x2 matrix
 
* cluster algebra defined by a 2x2 matrix
 +
* Laurent phenomenon
 +
* Positivity conjecture
 +
* finite classification
  
−
 
+
  
−
 
+
  
−
 
+
==cluster variables and exchange relations==
 +
* Fix two positive integers b and c.
 +
* Let <math>y_1</math> and <math>y_2</math> be variable in the field <math>F=\mathbb{Q}(y_1,y_2)</math>
 +
* Define a sequence <math>\{y_n\}</math> by
 +
:<math>
 +
y_{m-1}y_{m+1}=
 +
\begin{cases}
 +
y_m^b+1, & \text{if <math>m</math> is odd}\\
 +
y_m^c+1, & \text{if <math>m</math> is even} \\
 +
\end{cases}
 +
</math>
 +
* We call this ''''exchange relation''''
 +
* <math>y_m</math>'s are called ''''cluster variable''''
 +
* <math>\{y_i,y_{i+1}\}</math> "'''cluster'''"
 +
* <math>\{y_m^py_{m+1}^q\}</math> "'''cluster monomials'''" (supported on a given cluster)
 +
* Note : we can use the exchange relation any <math>y_m</math> in terms of arbitrary cluster <math>\{y_i,y_{i+1}\}</math> (rational expression)
  
−
<h5>cluster variables and exchange relations</h5>
 
  
−
Fix two positive integers b and c.
+
  
−
Let y_1 and y_2 be variable. Define a sequence {y_n}.
+
===matrix formulation===
 +
:<math>B=\begin{bmatrix} 0 & -b\\ c  &\,0 \end{bmatrix}</math>
 +
:<math>\mu_{1}(B)=\begin{bmatrix} 0 & b\\ -c  &\,0 \end{bmatrix}</math>
 +
:<math>\mu_{2}(B)=\begin{bmatrix} 0 & b\\ -c  &\,0 \end{bmatrix}</math>
 +
* <math>x_1x_1'=x_2^c+1</math> call <math>x_1'=x_3</math>
 +
* <math>x_2x_2'=x_1^b+1</math> call <math>x_2'=x_4</math>
  
−
<math>y_{m-1}y_{m+1}=y_m^b+1</math> if m odd
 
  
−
<math>y_{m-1}y_{m+1}=y_m^c+1</math> if m even
+
  
−
We call this ''''exchange relation''''
+
==observations==
 +
;theorem (FZ) : For any <math>b,c</math>, <math>y_m</math> is a Laurent polynomial.
 +
* Positivity conjecture: coefficients of these Laurent polynomials are positive (numerator and denomonator always have )
 +
* In this example, <math>bc\leq 3</math> iff the recurrence is periodic
  
−
y_m's are called ''''cluster variable''''
+
  
−
<math>\{y_i,y_{i+1}\}</math> "cluster"
+
  
−
Note : we can use the exchange relation any y_m in terms of arbitrary cluster {y_i,y_{i+1}} (rational expression)
+
==cluster algebra associated to Cartan matrices==
 +
* Finite type classification <math>A(b,c)</math> related to root systems of Cartan matrix
 +
:<math> \begin{bmatrix} 2 & -b \\ -c & 2 \end{bmatrix}</math>
 +
* Say <math>A(b,c)</math> is of finite/affine/indefinite type if <math>bc\leq 3</math>, <math>bc=4</math>, <math>bc>4</math>
 +
* when <math>bc\leq 3</math>, <math>y_m=y_n</math> if and only if <math>m\equiv n \mod (h+2)</math> where h is [[Coxeter number and dual Coxeter number|Coxeter number]]
 +
* <math>bc=1, h=2</math>
 +
* <math>bc=2, h=4</math>
 +
* <math>bc=3, h=6</math>
 +
* <math>bc\geq 4, h=\infty</math>
 +
* If <math>bc\geq 4</math>, all <math>y_m</math> are distinct
 +
  
−
 
+
==algebraic structure==
 +
* By "Laurent phenomenon" each element in <math>A(b,c)</math> can be uniquely expressed as Laurent polynomial in <math>y_m</math> and <math>y_{m+1}</math> for any <math>m</math>
 +
;theorem (Berenstein, Fomin and Zelevinsky) :
 +
:<math>A(b,c)=\cap_{m\in\mathbb{Z}}\mathbb{Z}[y_m^{\pm 1},y_{m+1}^{\pm 1}] =\cap_{m=0}^{2}\mathbb{Z}[y_m^{\pm 1},y_{m+1}^{\pm 1}]</math>
 +
* standard monomial basis : the following set  is a <math>\mathbb{Z}</math>-basis of <math>A(b,c)</math>
 +
:<math>\{y_0^{a_0}y_1^{a_1}y_2^{a_2}y_3^{a_3} : a_{m}\in\mathbb{Z}_{\geq 0}, a_0a_2=a_1a_3=0\}</math>
 +
* Here support of any such monomial is
 +
:<math>\{y_0,y_1\},\{y_1,y_2\},\{y_2,y_3\},\{y_0,y_3\}</math>
 +
* <math>A(b,c)</math> is finitely generated. In fact,
 +
:<math>A(b,c)=\mathbb{Z}[y_0,y_1,y_2,y_3]/\langle y_0y_2-y_1^b-1,y_1y_3-y_2^c-1\rangle</math>
  
−
 
+
  
−
<h5>example 1</h5>
+
==related items==
 +
* [[Rank 2 cluster algebra examples]]
 +
  
−
Put b=c=1
+
==articles==
 +
* '''[SZ2003]'''Sherman, Paul, and Andrei Zelevinsky. 2003. Positivity and canonical bases in rank 2 cluster algebras of finite and affine types. math/0307082 (July 7). http://arxiv.org/abs/math/0307082.
  
−
<math>y_{m-1}y_{m+1}=y_m+1</math>
+
[[분류:cluster algebra]]
 +
[[분류:math and physics]]
 +
[[분류:math]]
 +
[[분류:migrate]]
  
−
Start with two variables <math>y_1,y_2</math>.
+
==메타데이터==
−
 
+
===위키데이터===
−
<math>y_3y_1=y_2+1</math>. so <math>y_3=\frac{y_2+1}{y_1}</math>
+
* ID :  [https://www.wikidata.org/wiki/Q944095 Q944095]
−
 
+
===Spacy 패턴 목록===
−
<math>y_2y_4=y_3+1 </math>implies <math>y_4=\frac{y_3+1}{y_2}=\frac{y_1+y_2+1}{y_1y_2}</math>
+
* [{'LOWER': 'kaluza'}, {'OP': '*'}, {'LOWER': 'klein'}, {'LEMMA': 'theory'}]
−
 
 
−
<math>y_3y_5=y_4+1</math> implies <math>y_5=\frac{y_4+1}{y_3}= \frac{y_1+1}{y_2}</math> we are getting Laurent polynomials
 
−
 
 
−
<math>y_4y_6=y_5</math> implies <math>y_6=\frac{y_5+1}{y_4}= \frac{\frac{y_1+1}{y_2}+1}{\frac{y_1+y_2+1}{y_1y_2}}=\frac{y_1(y_1+1)+y_1y_2}{y_1+y_2+1}=y_1</math>
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>example 2</h5>
 
−
 
 
−
Put b=1, c=3
 
−
 
 
−
y_1,y_2
 
−
 
 
−
<math>y_3y_1=y_2^3+1</math>. so <math>y_3=\frac{y_2^3+1}{y_1}</math>
 
−
 
 
−
<math>y_2y_4=y_3+1 </math>implies <math>y_4=\frac{y_3+1}{y_2}=\frac{y_1+y_2^3+1}{y_1y_2}</math>
 
−
 
 
−
<math>y_3y_5=y_4^3+1</math> implies <math>y_5=\frac{y_4^3+1}{y_3}= \frac{(y_1+1)^3+y_2^3(y_2^3+3y_1+2)}{y_1^2y_2^3}</math>[http://www.wolframalpha.com/input/?i=%28%28x%2By%5E3%2B1%29%5E3%2B%28xy%29%5E3%29/%28x%5E2y%5E3%28y%5E3%2B1%29%29 http://www.wolframalpha.com/input/?i=((x%2By^3%2B1)^3%2B(xy)^3)/(x^2y^3(y^3%2B1))]
 
−
 
 
−
Note that we are getting Laurent polynomials.
 
−
 
 
−
<math>y_6=\frac{(y_1+1)^2+y_2^3}{y_1y_2^2}</math>
 
−
 
 
−
<math>y_7=\frac{(y_1+1)^3+y_2^3}{y_1y_2^3}</math>
 
−
 
 
−
<math>y_8=\frac{y_1+1}{y_2}</math>
 
−
 
 
−
<math>y_9=y_1</math>
 
−
 
 
−
<math>y_{10}=y_2</math>
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>example 3</h5>
 
−
 
 
−
Put b=c=2.
 
−
 
 
−
y_1
 
−
 
 
−
y_2
 
−
 
 
−
y_3=\frac{y_2^2+1}{y_1}
 
−
 
 
−
y_4=\frac{1+y_1^2+2y_2^2+y_2^4}{y_1^2y_2}
 
−
 
 
−
y_5 has denominator y_1^3y_2^2
 
−
 
 
−
y_6 has denominator y_1^4y_2^3
 
−
 
 
−
y_0=\frac{y_1^2+1}{y_2}
 
−
 
 
−
 
 
−
 
 
−
<h5>matrix formulation</h5>
 
−
 
 
−
<math>B=\begin{bmatrix} 0 & -b\\ c  &\,0 \end{bmatrix}</math>
 
−
 
 
−
<math>\mu_{1}(B)=\begin{bmatrix} 0 & b\\ -c  &\,0 \end{bmatrix}</math>
 
−
 
 
−
<math>\mu_{2}(B)=\begin{bmatrix} 0 & b\\ -c  &\,0 \end{bmatrix}</math>
 
−
 
 
−
For <math>k\in \{1,2,\cdots, n\}</math>,  <math>x_kx_k' = \prod_{b_{ik}>0} x_i^{b_{ik}}+\prod_{b_{ik}<0} x_i^{|b_{ik}|}</math>
 
−
 
 
−
x_1x_1'=x_2^c+1 call x_1'=x_3
 
−
 
 
−
x_2x_2'=x_1^b+1 call x_2'=x_4
 
−
 
 
−
 
 
−
 
 
−
<math>\mu_k(B)</math>
 
−
 
 
−
<math>-b_{ij}</math> if k=i or j
 
−
 
 
−
<math>b_{ij}</math> if <math>b_{ik}b_{kj}\leq 0</math>
 
−
 
 
−
 
 
−
 
 
−
<math>b_{ij}+b_{ik}b_{kj}</math> if <math>b_{ik}, b_{kj}>0</math>
 
−
 
 
−
<math>b_{ij}-b_{ik}b_{kj}</math> if <math>b_{ik},{b_{kj}< 0</math>
 
−
 
 
−
<math>\mu_{1}(B)=\begin{bmatrix} 0 & b\\ -c  &\,0 \end{bmatrix}</math>
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>observations</h5>
 
−
 
 
−
(FZ) For any b,c, y_m is a Laurent polynomial.
 
−
 
 
−
Positivity conjecture: coefficients of these Laurent polynomials are positive (numerator and denomonator always have )
 
−
 
 
−
In this example, 
 
−
 
 
−
<math>bc\leq 3</math> iff the recurrence is periodic
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>1/25/2011</h5>
 
−
 
 
−
lecture following http://arxiv.org/abs/math/0307082v2
 
−
 
 
−
y_m cluster variables<br> \{y_m,y_{m+1}\} clusters<br> \{y_m^py_{m+1}^q\} cluster monomials (supported on a given cluster)<br> Goal : define and construct 'canonical basis' B in A(b,c) for bc\leq 4<br> By "Leurant phenomenen" each element in A(b,c) can be uniquely expressed as Laurent polynomial in y_m and y_{m+1} for any m<br> B.F.Zelevinsky 's result :<br> A(b,c) =\cup_{m\in\mathbb{Z}\mathbb{Z}[y_n^{\pm 1,\y_{m+1}^{\pm 1]=\cup_{m=0}^{\alpha}\mathbb{Z}[y_n^{\pm 1,\y_{m+1}^{\pm 1]<br> standard monomial basis : the set \{y_0^{a_0}y_1^{a_1}y_2^{a_2}y_3^{a_3} : a_{m}\in\mathbb{Z}_{\geq 0}, a_0a_2=a_1a_3=0\} is a \mathbb{Z}-basis of A(b,c).<br> Here support of any such monomial is \{y_0,y_1\},\{y_1,y_2\},\{y_2,y_3\},\{y_0,y_3\}.<br><br> A(b,c) is finitely generated,<br> A(b,c)=\mathbb{y_0,y_1,y_2,y_3]/<y_0y_2-y_1^b-1,y_1y_3-y_2^c-1>
 
−
 
 
−
Finite type classification :
 
−
 
 
−
A(b,c) related to root systems of Cartan matrix
 
−
 
 
−
<math> \begin{bmatrix} 2 & -b \\ -c & 2 \end{bmatrix}</math>
 
−
 
 
−
Say A(b,c) is of finite/affine/indefinite type if bc\leq 3/bc=4/bc>4
 
−
 
 
−
when bc\leq 3
 
−
 
 
−
y_m=y_n if and only if m\equiv n mod (h+2) where h is coxeter number
 
−
 
 
−
bc=1, h=2
 
−
 
 
−
bc=2, h=4
 
−
 
 
−
bc=3, h=6
 
−
 
 
−
bc\geq 4, h=\infity
 
−
 
 
−
If bc\geq 4, all y_m distinct
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
\def
 
−
 
 
−
A nonzero element y\in A(b,c) is positive if for any m\in \mathbb{Z}, all coefficients in the expansion of y as Laurent polynomial in y_m and y_{m+1} are positive.
 
−
 
 
−
A^{+}(b,c) = set of positive elements in A(b,c) semiring
 
−
 
 
−
\thm (Sherman/Zelevinsky)
 
−
 
 
−
Suppose bc\leq 4. Then there exists a unique basis B of A(b,c) such that A^{+}(b,c) = set of positive integer linear combinations of elements of B.
 
−
 
 
−
 
 
−
 
 
−
\remark
 
−
 
 
−
If exists, then the uniqueness follows : must consist of all indecomposable elements of A^{+}(b,c) i.e. those one cannot be written as positive sum of 2 elements in A^{+}(b,c).
 
−
 
 
−
Let Q=\mathbb{Z}^2 be rank2 lattice with basis \{\alpha_1, \alpha_2\}. \alpha=a_1\alpha_1+a_2\alpha_2 <-> (a_1,a_2)
 
−
 
 
−
 
 
−
 
 
−
\Theorem *
 
−
 
 
−
When bc\leq 4, for each \alpha=(a_1,a_2)\in Q, there exists unique basis element \chi[\alpha]\in B of form \chi[\alpha]=\frac{N_{\alpha}(y_1,y_2)}{y_1^{a_1}y_2^{a_2}} where N_{\alpha} is a polynomial with constant term 1.
 
−
 
 
−
Map \alpha \to \chi[\alpha] is bijection \mathbb{Z}^2\to B
 
−
 
 
−
when bc\leq 3, B=\{cluster monomials\}
 
−
 
 
−
 
 
−
 
 
−
examples : b=c=1 case and b=c=2 case
 
−
 
 
−
 
 
−
 
 
−
From definition, B is invariant under any automorphism of A(b,c) preserving A^{+}(b,c) (Call such a map positive)
 
−
 
 
−
For all p\in \mathbb{Z}, there exists a positive automorphism \sigma_{p} of A(b,c) defined by \sigma_p(y_m)=y_{2p-m}.
 
−
 
 
−
<\sigma_i : i\in \mathbb{Z}> = <\sigma_p,\sigma_{p+1}> for any p
 
−
 
 
−
Theorem : Bijection B<-> Q translates action of each \sigma_p on B into piecewise linear transformation of Q ;
 
−
 
 
−
\sigma_1(a_1,a_2) = (a_1 , c \max (a_1,0) -a_2)
 
−
 
 
−
\sigma_2(a_1,a_2) = (b \max (a_2,0)-a_1, a_2)
 
−
 
 
−
Thm 1 : If bc\leq 3, then B =\{
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>history</h5>
 
−
 
 
−
* http://www.google.com/search?hl=en&tbs=tl:1&q=
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>related items</h5>
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5 style="line-height: 3.428em; margin: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic',dotum,gulim,sans-serif; font-size: 1.166em; background-position: 0px 100%;">encyclopedia</h5>
 
−
 
 
−
* http://en.wikipedia.org/wiki/
 
−
* http://www.scholarpedia.org/
 
−
* http://www.proofwiki.org/wiki/
 
−
* Princeton companion to mathematics([[2910610/attachments/2250873|Companion_to_Mathematics.pdf]])
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>books</h5>
 
−
 
 
−
 
 
−
 
 
−
* [[2011년 books and articles]]
 
−
* http://library.nu/search?q=
 
−
* http://library.nu/search?q=
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>expositions</h5>
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5 style="line-height: 3.428em; margin: 0px; color: rgb(34, 61, 103); font-family: 'malgun gothic',dotum,gulim,sans-serif; font-size: 1.166em; background-position: 0px 100%;">articles</h5>
 
−
 
 
−
 
 
−
 
 
−
* http://www.ams.org/mathscinet
 
−
* http://www.zentralblatt-math.org/zmath/en/
 
−
* http://arxiv.org/
 
−
* http://www.pdf-search.org/
 
−
* http://pythagoras0.springnote.com/
 
−
* [http://math.berkeley.edu/%7Ereb/papers/index.html http://math.berkeley.edu/~reb/papers/index.html]
 
−
* http://dx.doi.org/
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>question and answers(Math Overflow)</h5>
 
−
 
 
−
* http://mathoverflow.net/search?q=
 
−
* http://mathoverflow.net/search?q=
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>blogs</h5>
 
−
 
 
−
*  구글 블로그 검색<br>
 
−
**  http://blogsearch.google.com/blogsearch?q=<br>
 
−
** http://blogsearch.google.com/blogsearch?q=
 
−
* http://ncatlab.org/nlab/show/HomePage
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>experts on the field</h5>
 
−
 
 
−
* http://arxiv.org/
 
−
 
 
−
 
 
−
 
 
−
 
 
−
 
 
−
<h5>links</h5>
 
−
 
 
−
* [http://detexify.kirelabs.org/classify.html Detexify2 - LaTeX symbol classifier]
 
−
* [http://pythagoras0.springnote.com/pages/1947378 수식표현 안내]
 
−
* [http://www.research.att.com/%7Enjas/sequences/index.html The On-Line Encyclopedia of Integer Sequences]
 
−
* http://functions.wolfram.com/
 

2021년 2월 17일 (수) 03:01 기준 최신판

introduction

  • cluster algebra defined by a 2x2 matrix
  • Laurent phenomenon
  • Positivity conjecture
  • finite classification



cluster variables and exchange relations

  • Fix two positive integers b and c.
  • Let \(y_1\) and \(y_2\) be variable in the field \(F=\mathbb{Q}(y_1,y_2)\)
  • Define a sequence \(\{y_n\}\) by

\[ y_{m-1}y_{m+1}= \begin{cases} y_m^b+1, & \text{if \(m\] is odd}\\ 

y_m^c+1, & \text{if <math>m\) is even} \\

\end{cases} </math>

  • We call this 'exchange relation'
  • \(y_m\)'s are called 'cluster variable'
  • \(\{y_i,y_{i+1}\}\) "cluster"
  • \(\{y_m^py_{m+1}^q\}\) "cluster monomials" (supported on a given cluster)
  • Note : we can use the exchange relation any \(y_m\) in terms of arbitrary cluster \(\{y_i,y_{i+1}\}\) (rational expression)



matrix formulation

\[B=\begin{bmatrix} 0 & -b\\ c &\,0 \end{bmatrix}\] \[\mu_{1}(B)=\begin{bmatrix} 0 & b\\ -c &\,0 \end{bmatrix}\] \[\mu_{2}(B)=\begin{bmatrix} 0 & b\\ -c &\,0 \end{bmatrix}\]

  • \(x_1x_1'=x_2^c+1\) call \(x_1'=x_3\)
  • \(x_2x_2'=x_1^b+1\) call \(x_2'=x_4\)



observations

theorem (FZ)
For any \(b,c\), \(y_m\) is a Laurent polynomial.
  • Positivity conjecture: coefficients of these Laurent polynomials are positive (numerator and denomonator always have )
  • In this example, \(bc\leq 3\) iff the recurrence is periodic



cluster algebra associated to Cartan matrices

  • Finite type classification \(A(b,c)\) related to root systems of Cartan matrix

\[ \begin{bmatrix} 2 & -b \\ -c & 2 \end{bmatrix}\]

  • Say \(A(b,c)\) is of finite/affine/indefinite type if \(bc\leq 3\), \(bc=4\), \(bc>4\)
  • when \(bc\leq 3\), \(y_m=y_n\) if and only if \(m\equiv n \mod (h+2)\) where h is Coxeter number
  • \(bc=1, h=2\)
  • \(bc=2, h=4\)
  • \(bc=3, h=6\)
  • \(bc\geq 4, h=\infty\)
  • If \(bc\geq 4\), all \(y_m\) are distinct


algebraic structure

  • By "Laurent phenomenon" each element in \(A(b,c)\) can be uniquely expressed as Laurent polynomial in \(y_m\) and \(y_{m+1}\) for any \(m\)
theorem (Berenstein, Fomin and Zelevinsky)

\[A(b,c)=\cap_{m\in\mathbb{Z}}\mathbb{Z}[y_m^{\pm 1},y_{m+1}^{\pm 1}] =\cap_{m=0}^{2}\mathbb{Z}[y_m^{\pm 1},y_{m+1}^{\pm 1}]\]

  • standard monomial basis : the following set is a \(\mathbb{Z}\)-basis of \(A(b,c)\)

\[\{y_0^{a_0}y_1^{a_1}y_2^{a_2}y_3^{a_3} : a_{m}\in\mathbb{Z}_{\geq 0}, a_0a_2=a_1a_3=0\}\]

  • Here support of any such monomial is

\[\{y_0,y_1\},\{y_1,y_2\},\{y_2,y_3\},\{y_0,y_3\}\]

  • \(A(b,c)\) is finitely generated. In fact,

\[A(b,c)=\mathbb{Z}[y_0,y_1,y_2,y_3]/\langle y_0y_2-y_1^b-1,y_1y_3-y_2^c-1\rangle\]


related items


articles

  • [SZ2003]Sherman, Paul, and Andrei Zelevinsky. 2003. Positivity and canonical bases in rank 2 cluster algebras of finite and affine types. math/0307082 (July 7). http://arxiv.org/abs/math/0307082.

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'kaluza'}, {'OP': '*'}, {'LOWER': 'klein'}, {'LEMMA': 'theory'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=Rank_2_cluster_algebra&oldid=51879"