---
title: "Cluster algebras I: Foundations"
authors: ["Sergey Fomin", "Andrei Zelevinsky"]
year: 2002
venue: "J. Amer. Math. Soc."
arxiv: "math/0104151"
doi: "10.1090/S0894-0347-01-00385-X"
source: "https://arxiv.org/abs/math/0104151"
topics: [curiosity]
seed_rank: 1086
seed_batch: "curiosity-2026-08-19"
reviewed: "2026-08-19"
pool: "maths-foundations"
relevance_score: 9
lineage: cluster-algebras
cites:
  - title: "Cluster algebras II: Finite type classification"
    url: "https://arxiv.org/abs/math/0208229"
    year: 2003
    arxiv: "math/0208229"
    doi: "10.1007/s00222-003-0302-y"
  - title: "Total positivity, Grassmannians, and networks"
    url: "https://arxiv.org/abs/math/0609764"
    year: 2006
    arxiv: "math/0609764"
    doi: null
  - title: "Canonical bases arising from quantized enveloping algebras"
    url: "https://doi.org/10.1016/0021-8693(90)90099-A"
    year: 1990
    arxiv: null
    doi: "10.1016/0021-8693(90)90099-A"
see:
  - "1023-an-aperiodic-monotile"
  - "1029-a-rig-of-transformations"
  - "018-physics-topology-logic-and-computation-a-rosetta-stone"
  - "1056-reverse-derivative-categories"
---

# Cluster algebras I: Foundations

## One-sentence takeaway

A cluster algebra is a commutative ring generated by overlapping clusters whose binomial exchange relations \(xx'=M_1+M_2\) propagate along an \(n\)-regular tree, and every cluster variable is a Laurent polynomial in any initial cluster — the Laurent phenomenon.

## Why it matters here

Why you might love this: subtraction-free binomial recurrences that *should* explode into rational functions keep cancelling, leaving a single monomial in the denominator. The exchange graph of a rank-2 finite type is a polygon whose length is a Coxeter number plus two (a pentagon for \(A_2\), which *is* \(\mathrm{Gr}(2,5)\)). Matrix mutation of a skew-symmetrizable exchange matrix is an involution that later classifies finite type as Cartan–Killing. Bridge: mutation is a discrete integrable move on a seed — the same flavour as variational integrators and as the exchange of a cluster of gameplay parameters without leaving a Laurent chart.

## Key ideas

- Start from the \(n\)-regular tree \(\mathbb{T}_n\); each vertex carries a cluster of \(n\) variables and an exchange pattern of monomials satisfying four axioms (no self-factors, complementary supports, reciprocity, and a substitution propagation rule).
- The exponents assemble into a sign-skew-symmetric matrix \(B(t)\) mutating by \(\mu_k\); skew-symmetrizable \(B\) is the workhorse class and stays skew-symmetrizable.
- Laurent phenomenon (Thm 3.1, and the more general caterpillar-tree Thm 3.2): any cluster variable is a Laurent polynomial in any other cluster, with coefficients in the group ring of the coefficient group.
- Geometric type uses the tropical semifield, so coefficients themselves mutate by the same rule; the Grassmannian \(\mathrm{Gr}(2,n+3)\) is the prototypical example (clusters = triangulations of an \((n+3)\)-gon).

## Caveats

- This is the *foundations* paper: finite-type classification, positivity of Laurent coefficients, and the full Cartan–Killing coincidence live in the sequels — mint I, cite II.
- Exchange patterns have a large coefficient moduli space unless normalised; most geometric examples are of geometric type and are rigid given \(2n\) initial monomials.
- Not a string-diagram / cluster-category paper; those are later representation-theoretic avatars.

## Links

- arXiv: [math/0104151](https://arxiv.org/abs/math/0104151)
- Journal: [J. Amer. Math. Soc. 15 (2002) 497–529](https://doi.org/10.1090/S0894-0347-01-00385-X)