[Paper Review] Polytopal realizations of generalized associahedra

Frédéric Chapoton, Sergey Fomin+1 more|ArXiv.org|Feb 1, 2002

Botanical Research and Chemistry4 citations

TL;DR

This paper proves that generalized associahedra—polytopal realizations associated with finite root systems—exist as convex polytopes by constructing explicit families of such realizations using piecewise-linear automorphisms τ₊ and τ₋ on the root lattice. The key result establishes that the normal fan of the simplicial fan from [5] is indeed polytopal, confirming a long-standing conjecture and providing new realizations even for classical types Aₙ and Bₙ (associahedra and cyclohedra).

ABSTRACT

In hep-th/0111053, a complete simplicial fan was associated to an arbitrary finite root system. It was conjectured that this fan is the normal fan of a simple convex polytope (a generalized associahedron of the corresponding type). Here we prove this conjecture by explicitly exhibiting a family of such polytopal realizations.

Motivation & Objective

• To prove the conjecture that the simplicial fan associated with a finite root system in [5] is the normal fan of a simple convex polytope (the generalized associahedron).
• To provide explicit polytopal constructions for generalized associahedra across all irreducible root systems, including types A, B, D, and the exceptional types.
• To extend the known polytopal realizations of associahedra (type A) and cyclohedra (type B/C) to new families of realizations, even in classical cases.
• To lay foundational geometric structures for future applications in cluster algebras, moduli spaces, and operad theory, motivated by the theory of dual canonical bases and total positivity.
• To verify the polytopality of generalized associahedra in exceptional types (E₆, E₇, E₈) using computational verification of linear inequalities derived from cluster expansions.

Proposed method

• Define piecewise-linear involutions τ₊ and τ₋ on the real vector space Qℝ associated with a root system, using the Cartan matrix and root lattice.
• Use the action of τ₊ and τ₋ on the set Φ≥−1 = Φ>0 ∪ (−Π) to define orbits and establish a bijection between orbits and negative simple roots via Ω ↦ Ω ∩ (−Π).
• Construct a family of polytopal realizations by defining a system of linear inequalities F(β) > 0 for each positive root β, where F(−αᵢ) are variables fᵢ.
• Derive the inequalities (2.6) from cluster expansions of positive roots α − αⱼ in terms of fundamental weights, using the algorithm in Section 5.4.
• Verify that the system of inequalities (2.6) is implied by the core inequalities (1.8) by checking that the coefficient matrix of the latter is the transpose inverse of the former’s coefficient matrix.
• Perform computational verification using Maple for exceptional types (E₆, E₇, E₈), confirming that all required inequalities (5.13) are implied by the core system (5.12), thus proving Lemma 2.5.

Experimental results

Research questions

• RQ1 Can the simplicial fan constructed from a finite root system in [5] be realized as the normal fan of a convex polytope?
• RQ2 Do generalized associahedra exist as convex polytopes for all irreducible root systems, including types Dₙ and the exceptional types?
• RQ3 Are there new, non-traditional polytopal realizations of classical associahedra (type Aₙ) and cyclohedra (type Bₙ/Cₙ)?
• RQ4 Can the cluster expansion algorithm be used to systematically derive and verify the linear inequalities defining the polytope in exceptional types?
• RQ5 Is the system of inequalities (1.8) sufficient to imply all inequalities (2.6) arising from cluster expansions in the exceptional types?

Key findings

• The generalized associahedron associated with any finite irreducible root system is proven to be a convex polytope, confirming the conjecture from [5].
• Explicit polytopal realizations are constructed via a system of linear inequalities F(β) > 0, where F(−αᵢ) are variables fᵢ and the inequalities are derived from the action of τ₊ and τ₋.
• For type E₆, the system of core inequalities (5.12) implies all 24 inequalities (5.13) corresponding to cluster expansions, verified computationally using Maple.
• The method yields new realizations even for classical types: the Aₙ associahedron and Bₙ cyclohedron receive novel polytopal constructions not previously known.
• The verification for E₆ took only a few minutes of processor time using Maple, demonstrating the feasibility of extending the method to E₇ and E₈.
• The cluster expansion algorithm successfully generates all required inequalities (2.6) and confirms their implication by the core system (1.8), completing the proof of Lemma 2.5.