A cluster automorphism is a Z-algebra automorphism of a cluster algebra A satisfying that it sends a cluster to another and commutes with mutations. Chang and Schiffler conjectured that a cluster automorphism of A is just a Z-algebra homomorphism of a cluster algebra sending a cluster to another. The aim of this article is to prove this conjecture.
Citation: Peigen Cao, Fang Li, Siyang Liu, Jie Pan. A conjecture on cluster automorphisms of cluster algebras[J]. Electronic Research Archive, 2019, 27: 1-6. doi: 10.3934/era.2019006
[1] | Peigen Cao, Fang Li, Siyang Liu, Jie Pan . A conjecture on cluster automorphisms of cluster algebras. Electronic Research Archive, 2019, 27(0): 1-6. doi: 10.3934/era.2019006 |
[2] | Liqian Bai, Xueqing Chen, Ming Ding, Fan Xu . A generalized quantum cluster algebra of Kronecker type. Electronic Research Archive, 2024, 32(1): 670-685. doi: 10.3934/era.2024032 |
[3] | Fang Li, Jie Pan . On inner Poisson structures of a quantum cluster algebra without coefficients. Electronic Research Archive, 2021, 29(5): 2959-2972. doi: 10.3934/era.2021021 |
[4] | Yanni Yang, Quanguo Chen . The criteria for automorphisms on finite-dimensional algebras. Electronic Research Archive, 2024, 32(11): 6140-6152. doi: 10.3934/era.2024285 |
[5] | Qiuning Du, Fang Li . Some elementary properties of Laurent phenomenon algebras. Electronic Research Archive, 2022, 30(8): 3019-3041. doi: 10.3934/era.2022153 |
[6] | Agustín Moreno Cañadas, Robinson-Julian Serna, Isaías David Marín Gaviria . Zavadskij modules over cluster-tilted algebras of type A. Electronic Research Archive, 2022, 30(9): 3435-3451. doi: 10.3934/era.2022175 |
[7] |
Kengo Matsumoto .
|
[8] | Zhuanzhe Zhao, Mengxian Wang, Yongming Liu, Zhibo Liu, Yuelin Lu, Yu Chen, Zhijian Tu . Adaptive clustering algorithm based on improved marine predation algorithm and its application in bearing fault diagnosis. Electronic Research Archive, 2023, 31(11): 7078-7103. doi: 10.3934/era.2023359 |
[9] | Chuang Ma, Helong Xia . A one-step graph clustering method on heterogeneous graphs via variational graph embedding. Electronic Research Archive, 2024, 32(4): 2772-2788. doi: 10.3934/era.2024125 |
[10] | He Ma, Weipeng Wu . A deep clustering framework integrating pairwise constraints and a VMF mixture model. Electronic Research Archive, 2024, 32(6): 3952-3972. doi: 10.3934/era.2024177 |
A cluster automorphism is a Z-algebra automorphism of a cluster algebra A satisfying that it sends a cluster to another and commutes with mutations. Chang and Schiffler conjectured that a cluster automorphism of A is just a Z-algebra homomorphism of a cluster algebra sending a cluster to another. The aim of this article is to prove this conjecture.
Cluster algebras were invented by Fomin and Zelevinsky in a series of papers [9,2,10,11]. A cluster algebra is a
We first recall the definition of cluster automorphisms, which were introduced by Assem, Schiffler and Shamchenko in [1].
Definition 1.1 ([1]). Let
Cluster automorphisms and their related groups were studied by many authors, and one can refer to [6,7,8,14,13,4,5,16] for details.
The following very insightful conjecture on cluster automorphisms is by Chang and Schiffler, which suggests that we can weaken the conditions in Definition 1.1. In particular, it suggests that the second condition in Definition 1.1 can be obtained from the first one and the assumption that
Conjecture 1. [5,Conjecture 1] Let
The following is our main result, which affirms the Conjecture 1.
Theorem 3.6 Let
In this section, we recall basic concepts and important properties of cluster algebras. In this paper, we focus on cluster algebras without coefficients (that is, with trivial coefficients). For a positive integer
Recall that
Fix an ambient field
x′k=n∏i=1x[bik]+i+n∏i=1x[−bik]+ixk |
and
b′ij={−bij,if i=k or j=k;bij+sgn(bik)[bikbkj]+,otherwise. |
where
It can be seen that
Let
Lemma 2.1 ([2]). Let
(1)
(2)
(3)
Definition 2.2 ([9,11]).
xt=(x1;t,x2;t,…,xn;t),Bt=(btij). |
The cluster algebra
Theorem 2.3 (Laurent phenomenon and positivity [11,15,12]). Let
Z≥0[x±11;t0,x±12;t0,…,x±1n;t0]. |
In this section, we will give our main result, which affirms the Conjecture 1.
Lemma 3.1. Let
Proof.. Since
B′=aE(B′)F=a2E2(B′)F2=⋯=asEs(B′)Fs, |
where
Assume by contradiction that
A square matrix
Lemma 3.2. Let
Proof. If there exists
Let
BD=B′AD=(B′D)A. |
By the definition of mutation, we know that
Lemma 3.3. Let
Proof. By the definition of mutation, we know that
Lemma 3.4. Let
Proof. After permutating the rows and columns of
B=diag(B1,B2,⋯,Bs), |
where
Without loss of generality, we assume that
Let
xkx′k=n∏i=1x[bik]+i+n∏i=1x[−bik]+i,andzkz′k=n∏i=1z[b′ik]+i+n∏i=1z[−b′ik]+i. |
Thus
f(x′k)=f(n∏i=1x[bik]+i+n∏i=1x[−bik]+ixk)=n∏i=1z[bik]+i+n∏i=1z[−bik]+izk=n∏i=1z[bik]+i+n∏i=1z[−bik]+in∏i=1z[b′ik]+i+n∏i=1z[−b′ik]+iz′k. |
Note that the above expression is the expansion of
f(x′k)∈f(A)=A⊂Z[z±11,…,(z′k)±1,…,z±1n], |
we can get
n∏i=1z[bik]+i+n∏i=1z[−bik]+in∏i=1z[b′ik]+i+n∏i=1z[−b′ik]+i∈Z[z±11,⋯,z±1k−1,z±1k+1,⋯,z±1n]. |
Since both
n∏i=1z[bik]+i+n∏i=1z[−bik]+in∏i=1z[b′ik]+i+n∏i=1z[−b′ik]+i∈Z[z1,⋯,zk−1,zk+1,⋯,zn]. |
So for each
B=diag(B1,B2,⋯,Bs), |
where
(b1k,b2k,…,bnk)T=ak(b′1k,b′2k,…,b′nk)T=±(b′1k,b′2k,…,b′nk)T. |
Hence,
n∏i=1z[bik]+i+n∏i=1z[−bik]+in∏i=1z[b′ik]+i+n∏i=1z[−b′ik]+i=1. |
Thus we get
f(x′k)=n∏i=1z[bik]+i+n∏i=1z[−bik]+in∏i=1z[b′ik]+i+n∏i=1z[−b′ik]+iz′k=z′k. |
So
Lemma 3.5. Let
(i)
(ii)
Proof. (ⅰ) Since
Since
Hence,
(ⅱ) follows from (ⅰ) and the definition of cluster automorphisms.
Theorem 3.6. Let
Proof. "Only if part": It follows from the definition of cluster automorphism.
"If part": It follows from Lemma 3.4 and Lemma 3.5.
This project is supported by the National Natural Science Foundation of China (No.11671350 and No.11571173) and the Zhejiang Provincial Natural Science Foundation of China (No.LY19A010023).
1. | Siyang Liu, Jie Pan, A Note on Mutation Equivalence, 2025, 13, 2227-7390, 339, 10.3390/math13030339 |