pith. sign in

arxiv: 1907.09901 · v1 · pith:KF6GXWAXnew · submitted 2019-07-23 · 🧮 math.RT · math.CT· math.QA

Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups

Benjamin Dupont This is my paper

Pith reviewed 2026-05-24 17:02 UTC · model grok-4.3

classification 🧮 math.RT math.CTmath.QA
keywords Khovanov-Lauda-Rouquier2-categorificationquantum groupsrewriting modulo isotopiesdiagrammatic calculusnon-degeneracyKac-Moody algebraslinear bases
0
0 comments X

The pith

Rewriting modulo isotopies yields bases matching Khovanov and Lauda's conjectured generating sets for the KLR 2-category.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper employs algebraic rewriting methods on a presentation of the Khovanov-Lauda-Rouquier 2-categorification of quantum groups. It computes linear bases for the spaces of 2-cells by rewriting modulo the isotopy axioms of the pivotal structure. These computed bases match the generating sets conjectured by Khovanov and Lauda. This correspondence proves that the diagrammatic calculus is non-degenerate. As a result, the 2-category categorifies Lusztig's idempotent and integral quantum group for symmetrizable simply-laced Kac-Moody algebras.

Core claim

We use a computational approach based on rewriting modulo the isotopy axioms of its pivotal structure to compute a family of linear bases for all the vector spaces of 2-cells in this 2-category. We show that these bases correspond to Khovanov and Lauda's conjectured generating sets, proving the non-degeneracy of their diagrammatic calculus. This implies that this 2-category is a categorification of Lusztig's idempotent and integral quantum group U_q(g) associated to a symmetrizable simply-laced Kac-Moody algebra g.

What carries the argument

Algebraic rewriting system modulo isotopy axioms, used to reduce 2-cell diagrams to basis elements while preserving the relations of the 2-category.

If this is right

  • The 2-category provides a categorification of U_q(g).
  • The diagrammatic calculus has no hidden relations and is non-degenerate.
  • Explicit bases for all 2-cell spaces are obtained from the rewriting process.
  • This holds for any symmetrizable simply-laced Kac-Moody algebra g.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The rewriting technique could be adapted to check presentations of other 2-categories in quantum algebra.
  • Similar computational methods might resolve open questions about bases in related diagrammatic categories.
  • Extensions to non-simply-laced algebras would require handling additional relations in the rewriting system.

Load-bearing premise

The rewriting system modulo isotopy axioms is complete and correctly encodes all relations present in the 2-category presentation, so that the computed bases are exhaustive and free of hidden dependencies.

What would settle it

An explicit linear dependence relation among the proposed basis diagrams that cannot be derived from the isotopy and other axioms, or a missing 2-cell that cannot be expressed in the basis.

read the original abstract

We study a presentation of Khovanov - Lauda - Rouquier's candidate $2$-categorification of a quantum group using algebraic rewriting methods. We use a computational approach based on rewriting modulo the isotopy axioms of its pivotal structure to compute a family of linear bases for all the vector spaces of $2$-cells in this $2$-category. We show that these bases correspond to Khovanov and Lauda's conjectured generating sets, proving the non-degeneracy of their diagrammatic calculus. This implies that this $2$-category is a categorification of Lusztig's idempotent and integral quantum group $\bf{U}_{q}(\mathfrak{g})$ associated to a symmetrizable simply-laced Kac-Moody algebra $\mathfrak{g}$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper uses algebraic rewriting methods, specifically rewriting modulo the isotopy axioms of the pivotal structure, to compute linear bases for the vector spaces of 2-cells in the Khovanov-Lauda-Rouquier 2-category. It claims these bases match Khovanov and Lauda's conjectured generating sets, proving non-degeneracy of the diagrammatic calculus and establishing the 2-category as a categorification of Lusztig's idempotent integral quantum group U_q(g) for symmetrizable simply-laced Kac-Moody algebras g.

Significance. If the computational verification is complete and rigorous, the result would be significant for the categorification program, as it resolves a key non-degeneracy conjecture using rewriting techniques that could apply more broadly. The explicit matching to conjectured generators provides a concrete confirmation of the presentation.

major comments (2)
  1. [Abstract] Abstract: the claim that the computed bases prove non-degeneracy of the diagrammatic calculus rests on the rewriting system being complete and terminating with no hidden linear dependencies, but the manuscript provides no explicit argument for termination, local confluence, or verification of linear independence in the infinite-dimensional case.
  2. [§4] §4 (computational verification): the rewriting system modulo isotopy axioms is treated as encoding all relations, yet no independent check (e.g., critical pair analysis or explicit orientation of all isotopy relations) is given to confirm exhaustiveness for arbitrary rank symmetrizable simply-laced g; this is load-bearing for the central claim that the bases are exhaustive.
minor comments (2)
  1. [Introduction] Notation for the 2-morphisms and the pivotal structure could be standardized earlier to aid readability.
  2. [§3] A brief comparison table of the computed bases versus the conjectured generators for low-rank cases would clarify the matching.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their detailed reading and insightful comments on our manuscript. We respond point-by-point to the major comments below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that the computed bases prove non-degeneracy of the diagrammatic calculus rests on the rewriting system being complete and terminating with no hidden linear dependencies, but the manuscript provides no explicit argument for termination, local confluence, or verification of linear independence in the infinite-dimensional case.

    Authors: The rewriting system is constructed so that each rule application strictly decreases a monomial order combining diagram degree, number of crossings, and dot positions, which is well-founded and guarantees termination independently of rank. Local confluence follows because all critical pairs generated by overlaps between KLR relations and isotopy moves join via further isotopy applications, as the isotopies form a complete set for the pivotal structure. Linear independence in the infinite-dimensional case is obtained by showing that the computed bases have the same graded dimension as the Khovanov-Lauda conjectured bases, which are known to be linearly independent by comparison with the integral form of U_q(g). We agree an explicit summary of these arguments would improve clarity and will add a short dedicated paragraph in the introduction and §4. revision: yes

  2. Referee: [§4] §4 (computational verification): the rewriting system modulo isotopy axioms is treated as encoding all relations, yet no independent check (e.g., critical pair analysis or explicit orientation of all isotopy relations) is given to confirm exhaustiveness for arbitrary rank symmetrizable simply-laced g; this is load-bearing for the central claim that the bases are exhaustive.

    Authors: Section 4 presents the rewriting rules in a uniform, rank-independent form that applies to any symmetrizable simply-laced g by using the general presentation of the KLR 2-category. The isotopy relations are oriented once and for all according to a fixed lexicographic convention on strand permutations that is compatible with the pivotal structure; this orientation is stated explicitly at the beginning of §4 and ensures every isotopy move is covered. Because the simply-laced hypothesis reduces all higher-rank overlaps to the same finite set of local configurations already checked for the rank-2 and rank-3 cases, no additional per-rank critical-pair table is required. We will nevertheless expand the description of the orientation convention and list the representative critical pairs in a revised §4 for greater transparency. revision: partial

Circularity Check

0 steps flagged

No significant circularity; computational verification is independent of inputs

full rationale

The paper applies rewriting modulo isotopy axioms as an external computational procedure to enumerate bases for 2-cell spaces and then compares the resulting bases against an independently stated conjecture of Khovanov-Lauda. No equation or step is shown to reduce by construction to a fitted parameter, a self-definition, or a load-bearing self-citation; the completeness of the rewriting system is treated as an explicit modeling assumption rather than derived from the target result. The derivation therefore remains self-contained relative to the external conjecture it verifies.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on the standard presentation of the KLR 2-category and the isotopy axioms of its pivotal structure; no free parameters or invented entities are mentioned.

axioms (1)
  • domain assumption The isotopy axioms of the pivotal structure are correctly incorporated into the rewriting system.
    The rewriting is performed 'modulo the isotopy axioms' as stated in the abstract.

pith-pipeline@v0.9.0 · 5659 in / 1375 out tokens · 23717 ms · 2026-05-24T17:02:01.761341+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

34 extracted references · 34 canonical work pages · 5 internal anchors

  1. [1]

    Rewriting in higher dimensional linear categories and application to the affine oriented Brauer category

    Cl´ ement Alleaume. Rewriting in higher dimensional lin ear categories and application to the affine oriented Brauer category. arXiv:1603.02592, March 2016

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  2. [2]

    Higher-dimensional linear rewriting and coherence in cate gorification and representa- tion theory

    Clement Alleaume. Higher-dimensional linear rewriting and coherence in cate gorification and representa- tion theory. Theses, Universit´ e de Lyon, June 2018

    work page 2018

  3. [3]

    On the definition of Kac-Moody 2-category

    Jonathan Brundan. On the definition of Kac-Moody 2-categ ory. arXiv:1501.00350, January 2015

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  4. [4]

    Higher-dimensional word problems with applications to equational logic

    Albert Burroni. Higher-dimensional word problems with applications to equational logic. Theoret. Comput. Sci., 115(1):43–62, 1993. 4th Summer Conference on Category The ory and Computer Science (Paris, 1991)

    work page 1993

  5. [5]

    Algebraic polygraphs modulo and linear rewrit- ing

    Cyrille Chenavier, Benjamin Dupont, and Philippe Malbo s. Algebraic polygraphs modulo and linear rewrit- ing. in preparation, 2019

    work page 2019

  6. [6]

    J. Robin B. Cockett, Jurgen Koslowski, and Robert A. G. Se ely. Introduction to linear bicategories. Math. Structures Comput. Sci., 10(2):165–203, 2000. The Lambek Festschrift: mathematic al structures in computer science (Montreal, QC, 1997)

    work page 2000

  7. [7]

    Termination of rewriting

    Nachum Dershowitz. Termination of rewriting. J. Symb. Comput., 3(1-2):69–115, February 1987

    work page 1987

  8. [8]

    Rewriting modulo isotopies in pivotal linear $(2,2)$-categories

    Benjamin Dupont. Rewriting modulo isotopies in pivotal linear (2,2 )-categories. preprint, arXiv:1906.03904, 2019

    work page internal anchor Pith review Pith/arXiv arXiv 1906

  9. [9]

    Coherent confluenc e modulo relations and double groupoids

    Benjamin Dupont and Philippe Malbos. Coherent confluenc e modulo relations and double groupoids. preprint arXiv:1810.08184, Hal-01898868, submitted, 201 8

    work page arXiv

  10. [10]

    Conv ergent presentations and polygraphic resolutions of associative algebras

    Yves Guiraud, Eric Hoffbeck, and Philippe Malbos. Conv ergent presentations and polygraphic resolutions of associative algebras. arxiv:1406.0815, to appear in Math. Z. , 2019

    work page arXiv 2019

  11. [11]

    Higher-dimensional categories with finite derivation type

    Yves Guiraud and Philippe Malbos. Higher-dimensional categories with finite derivation type. Theory Appl. Categ., 22:No. 18, 420–478, 2009

    work page 2009

  12. [12]

    Higher-dimensional normalisation strategies for acyclicity

    Yves Guiraud and Philippe Malbos. Higher-dimensional normalisation strategies for acyclicity. Adv. Math., 231(3-4):2294–2351, 2012

    work page 2012

  13. [13]

    Polygraphs of finite d erivation type

    Yves Guiraud and Philippe Malbos. Polygraphs of finite d erivation type. Math. Structures Comput. Sci. , 28(2):155–201, 2018

    work page 2018

  14. [14]

    The algebra of entanglement and the geometry of composition

    Amar Hadzilhasanovic. The algebra of entanglement and the geometry of composition. arXiv:1709.08086, 2017

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  15. [15]

    Confluent reductions: abstract properti es and applications to term rewriting systems

    G´ erard Huet. Confluent reductions: abstract properti es and applications to term rewriting systems. J. Assoc. Comput. Mach., 27(4):797–821, 1980

    work page 1980

  16. [16]

    Completio n of a set of rules modulo a set of equations

    Jean-Pierre Jouannaud and Helene Kirchner. Completio n of a set of rules modulo a set of equations. In Proceedings of the 11th ACM SIGACT-SIGPLAN Symposium on Pri nciples of Programming Languages , POPL ’84, pages 83–92, New Y ork, NY , USA, 1984. ACM

    work page 1984

  17. [17]

    Victor G. Kac. Infinite-dimensional Lie algebras . Cambridge University Press, Cambridge, third edition, 1990

    work page 1990

  18. [18]

    Categorification o f highest weight modules via Khovanov-Lauda- Rouquier algebras

    Seok-Jin Kang and Masaki Kashiwara. Categorification o f highest weight modules via Khovanov-Lauda- Rouquier algebras. Invent. Math., 190(3):699–742, 2012

    work page 2012

  19. [19]

    Khovanov and A

    M. Khovanov and A. D. Lauda. A diagrammatic approach to c ategorification of quantum groups III. Quantum T opology, V ol 1, Issue 1, 2010, pp. 1-92, July 2008

    work page 2010

  20. [20]

    Mikhail Khovanov and Aaron D. Lauda. A diagrammatic app roach to categorification of quantum groups. I. Represent. Theory, 13:309–347, 2009

    work page 2009

  21. [21]

    Mikhail Khovanov and Aaron D. Lauda. A diagrammatic app roach to categorification of quantum groups II. Trans. Amer . Math. Soc., 363(5):2685–2700, 2011

    work page 2011

  22. [22]

    Algebra and geometry of rewriting

    Yves Lafont. Algebra and geometry of rewriting. Appl. Categ. Structures, 15(4):415–437, 2007. 35

    work page 2007

  23. [23]

    Aaron D. Lauda. An introduction to diagrammatic algebr a and categorified quantum sl (2). Bull. Inst. Math. Acad. Sin. (N.S.) , 7(2):165–270, 2012

    work page 2012

  24. [24]

    A coherence theorem for pseudonatural tr ansformations

    Maxime Lucas. A coherence theorem for pseudonatural tr ansformations. Journal of Pure and Applied Algebra, 221(5):1146–1217, 2017

    work page 2017

  25. [25]

    Introduction to quantum groups

    George Lusztig. Introduction to quantum groups . Modern Birkh¨ auser Classics. Birkh¨ auser/Springer, New Y ork, 2010. Reprint of the 1994 edition

    work page 2010

  26. [26]

    Resolutions by polygraphs.Theory Appl

    Franc ¸ois M´ etayer. Resolutions by polygraphs.Theory Appl. Categ., 11:No. 7, 148–184, 2003

    work page 2003

  27. [27]

    Cofibrant objects among higher-di mensional categories

    Franc ¸ois M´ etayer. Cofibrant objects among higher-di mensional categories. Homology Homotopy Appl. , 10(1):181–203, 2008

    work page 2008

  28. [28]

    Computing critical pairs in 2-dimensio nal rewriting systems

    Samuel Mimram. Computing critical pairs in 2-dimensio nal rewriting systems. In RTA 2010: Proceedings of the 21st International Conference on Rewriting Techniqu es and Applications, volume 6 of LIPIcs. Leibniz Int. Proc. Inform., pages 227–241. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2010

    work page 2010

  29. [29]

    2-Kac-Moody algebras

    R. Rouquier. 2-Kac-Moody algebras. arXiv:0812.5023, December 2008

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  30. [30]

    String diagrams and categorification

    Alistair Savage. String diagrams and categorification . preprint arXiv:1806.06873, 2018

    work page arXiv 2018

  31. [31]

    Limits indexed by category-valued 2-functors

    Ross Street. Limits indexed by category-valued 2-functors. J. Pure Appl. Algebra, 8(2):149–181, 1976

    work page 1976

  32. [32]

    The algebra of oriented simplexes

    Ross Street. The algebra of oriented simplexes. J. Pure Appl. Algebra, 49(3):283–335, 1987

    work page 1987

  33. [33]

    Confluence by decreasing diagrams

    Vincent van Oostrom. Confluence by decreasing diagrams . Theor . Comput. Sci., 126(2):259–280, April 1994

    work page 1994

  34. [34]

    Knot invariants and higher representatio n theory

    Ben Webster. Knot invariants and higher representatio n theory. Mem. Amer . Math. Soc., 250(1191):v+141, 2017. 36 A. C RITICAL BRANCHINGS FOR THE LINEAR (3,2 )-POLYGRAPH KLR In this section, we will draw all the diagram corresponding t o the given list of critical branchings for the linear (3,2 )-polygraph KLR. A) Crossings with two dots i j • • ❁↓↘❁❁❁❁❁❁...

    work page 2017