How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Homogeneous degree check for the corrected KLR braid relation
Example
In the specialized cyclotomic KLR algebra of The type-A cyclotomic specialization of the QG-KLR algebras use the grading , , (The KLR grading and the diagrammatic multiplication). Fix a triple and put the degree of both three-crossing words and , computed on the successive permuted colour pairs. Then both sides of the corrected braid relation are homogeneous of degree and the correction term has the same degree: it is (degree ) when or , it is (degree ) when (the double edge), and it is otherwise. In particular the single-edge corrected braid relations have degree and the double-edge corrected braid relation has degree ; both match the two sides.
Verification
Given: The specialized cyclotomic KLR algebra with the grading above, a
fixed colour triple , and the cyclic Cartan entries (,
for , and for ).
The common degree of the two words. The three crossings of cross the colour pairs , , of the successive permuted sequences, so its degree is ; the other braid word has the same multiset of crossed pairs, hence the same degree .
The four cases of the correction. Substituting the cyclic Cartan entries: (a) if then and the correction is ; (b) if then and the correction is ; (c) if and , then and , so , matching the degree of ; (d) in all other cases the correction is . This is the source's case list, and the nonzero correction requires equal outer colours, while zero corrections remain homogeneous without asserting that their degree is zero.
Conclusion. In each nonzero case the correction term has degree , equal to the common degree of the two braid words computed in step 1.1; in the remaining cases the correction vanishes, so the identity is homogeneous at degree . Hence the single-edge corrected braid relations have degree and the double-edge corrected braid relation has degree , both matching the two sides. The displayed source word order is , which equals the native opposite-order -difference under . No choice is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Mikhail Khovanov and Aaron D. Lauda, A diagrammatic approach to categorification of quantum groups I, arXiv:0803.4121v3, Represent. Theory 13 (2009) 309–347 (complete 53-page article) (standard reference, not scraped)
- Jonathan Brundan and Alexander Kleshchev, Blocks of cyclotomic Hecke algebras and Khovanov-Lauda algebras, arXiv:0808.2032v3, Invent. Math. 178 (2009) 451–484 (complete 32-page article) (standard reference, not scraped)
- Alexander Kleshchev, Representation theory of symmetric groups and related Hecke algebras, arXiv:0909.4844v1, Bull. AMS 47 (2010) 419–481 (complete 66-page survey) (standard reference, not scraped)