[Paper Review] Symmetrizable intersection matrices and their root systems

Liangang Peng, Mang Xu|ArXiv.org|Dec 5, 2009

Advanced Topics in Algebra5 references3 citations

TL;DR

This paper classifies positive semi-definite symmetrizable intersection matrices up to braid-equivalence using d-fold affinization matrices, which generalize standard affinizations by incorporating single and double roots. It establishes that every such matrix is braid-equivalent to a d-fold affinization matrix and provides an explicit construction of the Weyl root system in terms of the root system of the underlying Cartan matrix and special null roots.

ABSTRACT

In this paper we study symmetrizable intersection matrices, namely generalized intersection matrices introduced by P. Slodowy such that they are symmetrizable. Every such matrix can be naturally associated with a root basis and a Weyl root system. Using $d$-fold affinization matrices we give a classification, up to braid-equivalence, for all positive semi-definite symmetrizable intersection matrices. We also give an explicit structure of the Weyl root system for each $d$-fold affinization matrix in terms of the root system of the corresponding Cartan matrix and some special null roots.

Motivation & Objective

• To classify all positive semi-definite symmetrizable intersection matrices up to braid-equivalence.
• To generalize the notion of d-fold affinization matrices beyond single-root additions to include double roots.
• To provide an explicit structure of the Weyl root system for each d-fold affinization matrix.
• To show that any such matrix is braid-equivalent to a d-fold affinization matrix, extending known results for corank ≤1.
• To establish a complete classification using type-invariants of d-fold affinization matrices.

Proposed method

• Introduce d-fold affinization matrices by adding single and double roots to a Cartan matrix, generalizing prior constructions.
• Define APR-transformations as compositions of braid-transformations inspired by Auslander-Platzeck-Reiten tilts in representation theory.
• Use braid-equivalence to relate arbitrary positive semi-definite symmetrizable intersection matrices to d-fold affinization matrices.
• Construct the Weyl root system as a union of the root system of the base Cartan matrix and additional null roots from the affinization.
• Employ reflection groups and root string analysis to prove inclusion and closure properties of the root system under Weyl group actions.
• Use induction on the number of added roots (measured by coefficients in linear combinations) to show full root system containment.

Experimental results

Research questions

• RQ1 How can positive semi-definite symmetrizable intersection matrices be classified up to braid-equivalence?
• RQ2 What is the structure of the Weyl root system associated with a d-fold affinization matrix?
• RQ3 Can every positive semi-definite symmetrizable intersection matrix be braid-equivalent to a d-fold affinization matrix?
• RQ4 How do null roots from the affinization process interact with the root system of the original Cartan matrix?
• RQ5 What is the role of APR-transformations in relating different root bases and enabling classification?

Key findings

• Every positive semi-definite symmetrizable intersection matrix with corank ≤1 is braid-equivalent to a finite or affine generalized Cartan matrix.
• The intersection matrix Lie algebra associated with such a matrix is isomorphic to a semi-simple or affine Kac-Moody Lie algebra.
• All positive semi-definite symmetrizable intersection matrices are braid-equivalent to some d-fold affinization matrix.
• The Weyl root system of a d-fold affinization matrix is explicitly described as the union of the root system of the corresponding Cartan matrix and specific null roots arising from the affinization process.
• The classification of such matrices up to braid-equivalence is complete and parameterized by the type of the d-fold affinization matrix.
• The root system is closed under Weyl group reflections, and all roots are generated by reflections on the base roots and the added null roots, with coefficients constrained by parity conditions.