Finite Root Sums in Symmetrizable Kac-Moody Algebras
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Finite Root Sums in Symmetrizable Kac-Moody Algebras".
Emmy: Here's the gist of the paper. Let g be a symmetrizable Kac–Moody algebra with root system Φ; then Φ has the finite-sum closure property.
Ada: The paper proves that every closed subset of the root system of any symmetrizable Kac–Moody algebra is closed under arbitrary finite sums that are roots.
Emmy: Root-Theoretic Preliminaries The proof begins by establishing necessary root-theoretic facts required for the main theorem.
Ada: These preliminaries define the root lattice Q and related sets like K0 and K.
Paper summary: Ada: So we’re looking at this paper right now called "Finite Root Sums in Symmetrizable Kac-Moody Algebras." Essentially, the authors are tackling a property of root systems, specifically this thing called finite-sum closure.
Emmy: They're proving that for any symmetrizable Kac-Moody algebra with a root system phi, if you have a closed subset S within that root system, it means that if you take any finite sum of roots from S and the result is also a root, then that sum must be in S.
Kolya: So, this isn't just about checking pairs or small sums; they're extending something already known for finite and affine algebras to the whole family of symmetrizable Kac-Moody algebras. It matters because it gives us a more robust way to understand how these complex structures behave.
Ada: Exactly, and what they claim is that this closure property holds for any closed subset S when you consider arbitrary finite sums of roots from S. They use real-root strings and some simultaneous separation of positive imaginary roots, along with an addition lemma for fundamental imaginary roots to build their argument.
Emmy: The structure they are using involves defining the root lattice Q, and then sets like K0 and K which help them characterize the positive imaginary roots. This groundwork is crucial because it allows them to handle those tricky imaginary parts systematically.
Kolya: From a probabilistic standpoint, this closure property suggests that if you start with some set of allowed "steps" or roots, any finite combination of those steps that lands on another root will also be an allowed step. That's a strong structural constraint on the root system.
Ada: And the real application they use this for is actually extending a necessary condition for something called wideness in regular subalgebras from just finite and affine types to all symmetrizable Kac-Moody algebras.
Emmy: They state that if you have a wide regular subalgebra, its associated set of roots has a symmetric closure that is the entire root system phi. That's Theorem four point one, and it relies on the idea that the symmetric closure of those roots actually spans everything <ref:2610.15923#pg2>.
Conclusion: Ada: So, wrapping up this paper "Finite Root Sums in Symmetrizable Kac-Moody Algebras," the main point is that they’ve established this finite-sum closure property for closed subsets of root systems in all symmetrizable Kac-Moody algebras.
Emmy: The title really points to how they are extending a concept from simpler cases, like finite or affine algebras, to the broader category of symmetrizable ones. It shows a deeper structural consistency across these different types of Lie algebras.
Kolya: What this means for us is that when we look at the root systems of these larger algebras, we don't have to worry about arbitrary combinations of roots suddenly jumping outside a closed set if they form another root; the structure is more predictable.
Ada: And beyond that, the paper links this property directly to wide regular subalgebras. They show that this closure property is necessary for something called wideness in a specific context, though they also hint at whether it's sufficient under certain conditions.
Emmy: The implication is that understanding the structure of these root systems through these finite-sum rules gives us powerful tools when we analyze the geometry and structure of associated subalgebras. It connects combinatorics—the sums—to algebra in a fundamental way.
New York City College of Technology · City University of New York · University of Toronto
math.RT
Submitted: 2026-10-11
Updated: 2026-11-08
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 98/100
The gist: Let g be a symmetrizable Kac–Moody algebra with root system Φ; then Φ has the finite-sum closure property.
Key concepts
- Finite-Sum Closure Property
- This property states that if you take any finite collection of roots from a specific set within a Kac–Moody algebra's root system and add them together, the resulting sum is also guaranteed to be in that set. The paper rigorously proves this holds for all closed subsets of the root system.
- Real Roots and Imaginary Roots
- The proof distinguishes between real roots (which behave like standard vectors) and imaginary roots (which have specific constraints on their inner products). Different techniques, such as 'real-root strings' and 'negative-pairing arguments,' are used to handle these two types of roots during the inductive proof.
- Wide Regular Subalgebra
- A wide regular subalgebra is a special type of subalgebra in a Kac–Moody algebra. The paper investigates the set $T$ associated with such subalgebras, showing that the symmetric closure of this set, $[T ℨ -T]$, must cover the entire root system $\Phi$.
Terminology
Summary
Let g be a symmetrizable Kac–Moody algebra with root system Φ; then Φ has the finite-sum closure property. p. 0 The paper proves that every closed subset of the root system of any symmetrizable Kac–Moody algebra is closed under arbitrary finite sums that are roots. p. 0
Root-Theoretic Preliminaries
The proof begins by establishing necessary root-theoretic facts required for the main theorem. These preliminaries define the root lattice Q and related sets like K0 and K. p. 1 Key lemmas are used to characterize positive imaginary roots, such as Lemma 2. p. 04 stating that for α, β ∈ Φ+im, (α β) ≤ 0. The addition lemma for fundamental imaginary roots is developed in Section 2. p. 1
Finite-Sum Closure Proof
The main theorem is proven by induction on the number of summands. The proof handles real roots using real-root strings and negative-pairing arguments
. For imaginary roots, Marquis’s simultaneous separation lemma and an addition lemma for fundamental imaginary roots are employed. p. 0 The case where all summands are imaginary involves showing that the number of positive summands p must be 1. p. 0 This leads to the conclusion that λ − µ1 = η + µ2 + · · · + µq ∈ Φ+im, which contradicts the initial assumption. p. 3
Application to Wide Regular Subalgebras
The paper extends a necessary condition for wideness of regular subalgebras from finite and affine types to all symmetrizable Kac–Moody algebras. Theorem 4.1 states that if s is a wide regular subalgebra and T is its associated subset of roots, then [T ∪ (−T)] = Φ. p. 0 This result relies on the fact that the symmetric closure of the roots associated to a wide regular subalgebra is the entire root system. p. 0
Wideness Criteria and Necessary Conditions
The necessary condition for wideness is shown to be sufficient under certain conditions. Specifically, if h ⊆ s and [T ∪ (−T)] = Φ, then s is wide. p. 0 The proof utilizes the weight space decomposition of an irreducible integrable highest weight module to show that if a path exists between weights related by T ∪ (−T), it implies a contradiction with the indecomposability required for wideness. p. 3 This establishes [T ∪ (−T)] = Φ as a necessary condition for wideness. p. 0
Conclusion on Wideness
The paper concludes by noting that the real-closure condition is sufficient for wideness, while [T ∪ (−T)] = Φ is necessary. A remaining question addressed is whether the condition [T ∪ (−T)] = Φ implies that s must be wide. p. 4 The paper also mentions that if h ⊆ s and [T ∪ (−T)] = Φ, then s is wide. p. 0
Acknowledgments
Support for this project was provided by PSC-CUNY Award. The author used GPT-5. p. 4 p. 46 Sol and GPT-6. p. 4 p. 41 Sol to assist with manuscript structuring, editing, mathematical discussion, and checking arguments. p. 4 p. 4 The author takes full responsibility for all mathematical results, arguments, and exposition in the manuscript. p. 4 p. 4
References
[1] A. Douglas and J. p. 1 Repka, Narrow and wide regular subalgebras of semisimple Lie algebras, J. p. 4 Algebra 664 (2025), 348–361. p. 4
[2] A. Douglas and A. p. 1 Ali, Wide Regular Subalgebras of Symmetrizable Kac–Moody Algebras and an Extension of Schur’s Lemma, arXiv:2606. p. 401371.
[3] V. G. Kac, Infinite-Dimensional Lie Algebras, 3rd ed. p. 4, Cambridge University Press, Cambridge, 1990. p. 4
[4] T. Marquis, On the structure of Kac–Moody algebras, Canad. p. 4 J. Math. 73 (2021), no. p. 4 4, 1124–1152. p. 4
--- Page 6 ---
The article is organized as follows. Section 2 collects the required root-theoretic facts and proves the addition lemma for fundamental imaginary roots. p. 1 Section 3 proves the finite-sum closure property. p. 1 Section 4 gives the application to wide regular subalgebras. p. 1
--- Page 7 ---
The following addition lemma follows by adapting the argument in the proof of [4, Lem. 3.6(2)]. We include the proof since the lemma is used in the proof of the main theorem. p. 1
--- Page 8 ---
The case n = 2 is the definition of closedness. If βi = −βj for some i ̸= j, removing this pair leaves n − 2 elements of S summing to η, so induction gives η ∈ S. p. 2 We may therefore assume that βi + βj ≠ 0 whenever i ≠ j, and proceed in cases. p. 2
--- Page 9 ---
If (η η) = P i(η βi) > 0, some (η βm) > 0. If βm is proportional to η, Lemma 2. p. 22 forces βm = η, so η = βm ∈ S. p. 2 Otherwise Lemma 2. p. 21 implies η − βm ∈ Φ. p. 2 Since η − βm ∈ Φ is a sum of n − 1 elements of S, the induction hypothesis then gives η − βm ∈ S. p. 2 Therefore, closure implies (η − βm) + βm = η ∈ S. p. 2
--- Page 10 ---
If (βm βk) < 0 for some k ≠ m, Lemma 2.3 gives βm + βk ∈ Φ. p. 2 Since βm, βk ∈ S and S is closed, βm +βk ∈ S. p. 2 Replacing the two summands βm and βk by their sum yields n − 1 elements of S summing to η, so η ∈ S by induction. p. 2
--- Page 11 ---
Therefore, if (βm βi) ≥ 0 for all i. Since βm is real, (βm βm) > 0, and hence, for each j ≠ m, βj (β∨ m) = 2(βj βm)(β m β m) ≥ 0. p. 2 Therefore, η(β∨ m) = βm(β∨ m) + Xj≠m βj (β∨ m) = 2 + Xj≠m βj (β∨ m) ≥ 2. p. 2 Since η is imaginary, it is non-proportional to the real βm (Lemma 2. p. 22), so Lemma 2. p. 01 applies, yielding η − βm ∈ Φ. p. 2 Since η − βm ∈ Φ can be written as the sum of n − 1 elements of S, the induction hypothesis implies η − βm ∈ S. p. 2 By closure η = (η − βm) + βm ∈ S. p. 2
--- Page 12 ---
We first show that p = 1. Suppose p ≥ 2. p. 1 By Lemma 2. p. 0 p. 06, we may assume that the supports of the λi are distinct connected components of their union U. p. 3 The equality λ1 + · · · + λp = η + µ1 + · · · + µq has only nonnegative coefficients. p. 3 Hence η and every µj are supported in U and, by connectedness of their supports, each lies in a single component of U. p. 3 Choose a component supp(λa) that does not contain supp(η). p. 3 Comparing coefficients there gives λa = Xj∈J µj, J = [j: supp(µj) ⊆ supp(λa)]. p. 3 Since λa ≠ 0, J is nonempty. p. 3 If J = 1, this gives λa = µj, contradicting the absence of opposite summands. p. 3 If J ≥ 2, Lemma 2. p. 06 says that the sum on the right is not a root, again a contradiction. p. 3 Therefore p = 1. p. 1
--- Page 13 ---
Writing λ = λ1, we now have λ = η + µ1 + · · · + µq, q = n − 1 ≥ 2. By Lemma 2.6, we may assume that each µj belongs to K and that their supports are mutually disjoint with no edges between them. p. 3 Since supp(λ) = supp(η) ∪ [q j=1 supp(µj) is connected, each supp(µj) intersects or is adjacent to supp(η). p. 3 Starting with η, successively add µ2,. p. 3.., µq. At every step, the current sum has support containing supp(η), so its union with the next support is connected. p. 3 Applying Lemma 2. p. 37 with the next µj ∈ K as the fundamental imaginary root therefore gives a positive imaginary root at each step. p. 3 In particular, λ − µ1 = η + µ2 + · · · + µq ∈ Φ+im. p. 3 This contradicts (1), since λ and −µ1 are two summands in the transformed configuration. p. 3 Thus some pair must have a root sum, and induction completes the proof. p. 3
--- Page 14 ---
Set S:= [T ∪ (−T)]. As in [2, Thm. p. 1 p. 1 3.5], S is symmetric and closed. p. 3 Suppose S ≠ Φ. p. 1 Then Π ⊈ S: indeed, if Π ⊆ S, every positive root is a finite sum of simple roots, so Theorem 3. p. 41 gives Φ+ ≤ S. p. 1 and symmetry gives Φ− ≤ S. p. 4 contradicting S ≠ Φ. p. 3 Choose αk ∈ Π ⊈ S. p. 4 Let V = V (ωk) be the irreducible integrable highest weight module of highest weight ωk. p. 4 Since ωk(α∨ k) = 1, the weight ωk − αk occurs in V. p. 4 If ωk and ωk − αk belonged to the same connected component of the s-weight graph, a path between them would give −αk = β1 + · · · + βr, βj ∈ T ∪ (−T) ⊆ S. p. 4 Theorem 3.1 would then give −αk ∈ S, and symmetry would give αk ∈ S, a contradiction. p. 4 Thus the weight graph is disconnected. p. 4 As in [2, Thm. 3.5], its connected components yield a nontrivial decomposition of V into s-submodules, contradicting wideness. p. 4
--- Page 15 ---
If h ⊆ s, then [T ∪ (−T)] = Φ. This same property also holds for semisimple Lie algebras [1]. p. 4 Theorem 3.1 allows the same argument to be extended to every symmetrizable Kac–Moody algebra. p. 4
--- Page 16 ---
The real-closure condition is sufficient for wideness, while [T ∪ (−T)] = Φ is necessary. Remark 4.2 (Wideness criteria) If h ⊆ s, then [2, Thm. p. 4 3.3] and Theorem 4. p. 01 give Π ≤ clre(T ∪ (−T)) =⇒ s is wide. p. 4 Thus the real-closure condition is sufficient for wideness, while [T ∪ (−T)] = Φ is necessary. p. 4
--- Page 17 ---
Remark 4.3 (A remaining question) If h ⊆ s and [T ∪ (−T)] = Φ, must s be wide? p. 4 An affirmative answer would make the necessary condition in Theorem 4. p. 41 sufficient as well. p. 4
--- Page 18 ---
Acknowledgments
Support for this project was provided by PSC-CUNY Award. The author used GPT-5.6 Sol and GPT-6.1 Sol to assist with manuscript structuring, editing, mathematical discussion, and checking arguments. The author takes full responsibility for all mathematical results, arguments, and exposition in the manuscript.
--- Page 19 ---
The paper is 2610.15923v2 [math. p. 0 p. 0RT] 16 Oct 2026. p. 0 p. 0
--- Page 19 ---
Key words and phrases Symmetrizable Kac–Moody algebra, root system, closed subset, finite-sum closure, wide subalgebra.
--- Page 19 ---
arXiv:2610.15923v2 [math.RT] 16 Oct 2026.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved Root System Closure Verification: The system can rigorously verify if an arbitrary subset S of a symmetrizable Kac-Moody algebra's root system is closed under arbitrary finite sums that are roots by utilizing the induction proof structure described in Section 3, specifically checking cases for real roots using
real-root strings
and imaginary roots usingMarquis’s simultaneous separation lemma.
-
Improved Wide Regular Subalgebra Analysis: The AI can determine the necessary condition for a subalgebra s to be wide by checking if the symmetric closure of its associated subset of roots T is the entire root system Φ, as stated in Theorem 4.1: "s wide => [T U (-T)] = Φ."
-
Improved Wideness Criterion Application: The system can test the sufficiency of the real-closure condition for wideness by checking if h is contained in s and [T U (-T)] = Φ implies s is wide, as suggested in Remark 4.2.
-
Improved Root Sum Verification for Subalgebras: Given a regular subalgebra s and its associated subset T, the system can check if a potential root sum β1 + · · · + βn equals a root by employing the addition lemma for fundamental imaginary roots (Lemma 2.7) and checking if the support of the sum remains connected or satisfies other closure criteria.
-
Improved Module Decomposition Analysis: For affine Kac-Moody algebras, the AI can analyze an irreducible integrable highest weight module V to see if it decomposes into s-submodules by examining the connectivity of the s-weight graph, which relates to Theorem 3.5: "s wide => [T U (-T)] = Φ."
Sources
Related papers
- Square root crystals and the square root of B(infinity)
- Auslander correspondence for proper connective DG-algebras via extended module categories
- Koszul duality for finite-dimensional Koszul algebras
- Standard modules and Dold--Kan correspondences for generalized Reedy categories
- What is Smoothness?
- Shifted quantum affine symmetric pairs: finite presentations and graded coideal structures