Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Cluster algebras II: Finite type classification

Sergey Fomin, Andrei Zelevinsky

TL;DR

This work establishes a complete finite-type classification for cluster algebras, revealing a precise correspondence with Cartan matrices of finite type and the Cartan-Killing types. The authors develop a deep combinatorial framework using cluster complexes, pseudomanifolds, and generalized associahedra to show that finite-type cluster algebras are governed by root-system data, with cluster variables indexed by almost positive roots and organized into a dual-polytope structure. They additionally prove that every 2-finite diagram is mutation-equivalent to an orientation of a Dynkin diagram, connecting mutation theory to classical Lie-theoretic classifications, and provide geometric realizations of many types as coordinate rings of classical varieties. Overall, the paper links algebraic, combinatorial, and geometric perspectives to illuminate the finite-type landscape of cluster algebras and to enable concrete realizations across types $A$–$D$.

Abstract

This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out to be identical to the Cartan-Killing classification of semisimple Lie algebras and finite root systems, which is intriguing since in most cases, the symmetry exhibited by the Cartan-Killing type of a cluster algebra is not at all apparent from its geometric origin. The combinatorial structure behind a cluster algebra of finite type is captured by its cluster complex. We identify this complex as the normal fan of a generalized associahedron introduced and studied in hep-th/0111053 and math.CO/0202004. Another essential combinatorial ingredient of our arguments is a new characterization of the Dynkin diagrams.

Cluster algebras II: Finite type classification

TL;DR

This work establishes a complete finite-type classification for cluster algebras, revealing a precise correspondence with Cartan matrices of finite type and the Cartan-Killing types. The authors develop a deep combinatorial framework using cluster complexes, pseudomanifolds, and generalized associahedra to show that finite-type cluster algebras are governed by root-system data, with cluster variables indexed by almost positive roots and organized into a dual-polytope structure. They additionally prove that every 2-finite diagram is mutation-equivalent to an orientation of a Dynkin diagram, connecting mutation theory to classical Lie-theoretic classifications, and provide geometric realizations of many types as coordinate rings of classical varieties. Overall, the paper links algebraic, combinatorial, and geometric perspectives to illuminate the finite-type landscape of cluster algebras and to enable concrete realizations across types –.

Abstract

This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out to be identical to the Cartan-Killing classification of semisimple Lie algebras and finite root systems, which is intriguing since in most cases, the symmetry exhibited by the Cartan-Killing type of a cluster algebra is not at all apparent from its geometric origin. The combinatorial structure behind a cluster algebra of finite type is captured by its cluster complex. We identify this complex as the normal fan of a generalized associahedron introduced and studied in hep-th/0111053 and math.CO/0202004. Another essential combinatorial ingredient of our arguments is a new characterization of the Dynkin diagrams.
Paper Structure (30 sections, 55 theorems, 130 equations, 18 figures)

This paper contains 30 sections, 55 theorems, 130 equations, 18 figures.

Table of Contents

  1. Introduction and main results
  2. Introduction
  3. Basic definitions
  4. Finite type classification
  5. Cluster variables in the finite type
  6. Cluster complexes
  7. Organization of the paper
  8. Cluster algebras via pseudomanifolds
  9. Pseudomanifolds and geodesic loops
  10. Sufficient conditions for finite type
  11. Generalized associahedra
  12. Proof of Theorem \ref{['th:finite-type-class-new']}
  13. Proofs of Theorems \ref{['th:cluster-variable-denominators-1']} and \ref{['th:exch-rel-dep-on-vars-only']}--\ref{['th:finite-type-complex']}
  14. Proof of Theorem \ref{['th:cluster-variable-denominators-2']}
  15. $2$-finite matrices
  16. ...and 15 more sections

Key Result

Theorem 1.4

All cluster algebras in any series $\mathcal{A}(B,-)$ are simultaneously of finite or infinite type. There is a canonical bijection between the Cartan matrices of finite type and the strong isomorphism classes of series of cluster algebras of finite type. Under this bijection, a Cartan matrix $A$ of

Figures (18)

  • Figure 1: Logical dependences among the proofs of Theorems \ref{['th:finite-type-class-new']}--\ref{['th:finite-type-complex']}
  • Figure 2: The complex $\Delta(\Phi)$ and the corresponding polytope in type $A_2$
  • Figure 3: Dynkin diagrams of types $E_8$ and $D_4$
  • Figure 4: Fragment of the exchange graph in the type $D_4$
  • Figure 5: Diagram mutation
  • ...and 13 more figures

Theorems & Definitions (88)

  • Definition 1.1
  • Definition 1.2
  • Remark 1.3
  • Theorem 1.4
  • Theorem 1.5
  • Theorem 1.6
  • Theorem 1.7
  • Theorem 1.8
  • Theorem 1.9
  • Theorem 1.10
  • ...and 78 more