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.
Integer-color degenerate Hecke–KLR local inverse tables
Statement
Let have characteristic zero, let be a finite interval in , and let be a multiset of colors in . Orient and put Let be the KLR algebra of this finite type-A datum in the native convention of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, and put , . Let be the affine degenerate Hecke algebra with , the symmetric-group braid relations, commuting , and , the same generator presentation as The degenerate affine Hecke algebra, here imposed over . Complete at the central ideal generated by for symmetric polynomials , and complete at the central ideal generated by positive-degree symmetric polynomials in . Denote these completions by and .
The polynomial coefficient algebra of either completion is For choose the following rank-independent two-variable series: All denominators and every have nonzero constant term. There are mutually inverse continuous algebra maps fixing and given by Here series are evaluated at and are multiplied on the indicated right side of the crossing. The identities hold uniformly for all finite intervals, multisets and ranks, including rank zero. They therefore hold after any quotient in which the dots are nilpotent. No finite cyclic quantum-characteristic specialization is used. This lemma proves the local algebra maps; a separate cyclotomic/support/tower argument is needed to identify entire cyclotomic towers.
Facts & Assumptions
Given: The characteristic-zero field, finite integer interval, multiset, presentations, completions and specified series in the Statement.
The native KLR presentation in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum has the two equal-color dot moves for , the quadratic polynomial , and the reversed-word braid numerator . Replacing by gives , , and on colors .
The arbitrary-base degenerate presentation of Affine type-A presentations and charged cyclotomic quotients specialized to k has exactly the relations listed in the Statement. It agrees over with The degenerate affine Hecke algebra; no base-change of an unproved basis is assumed, because its affine basis and faithful action over k are proved below. The generators permute positions; the distinct notation below means actual permutation operators on polynomial or formal coefficient functions.
Proof
Given: The data and conventions of the Statement, and [F1]–[F2].
The coefficient completions. A symmetric polynomial in the commuting is central: the mixed relation gives , first on monomials by induction, then on polynomials. A symmetric has zero correction. The fiber of the elementary symmetric polynomials over their values on consists exactly of the ordered permutations of : the coordinates are roots with multiplicities of . Its radical is the intersection of the finitely many corresponding maximal ideals, by the polynomial factorization and the fact that every coordinate satisfies this monic polynomial. The elementary-symmetric ideal and this radical have cofinal powers, since the fiber is finite dimensional and its radical nilpotent. Chinese remainders and completion therefore give with local coordinates . On the KLR side symmetric dot polynomials are central by [F1], and the same argument at the all-zero fiber shows that its coefficient completion is .
Invertible tables. If the integer is a nonzero unit in , so exists as a formal geometric series. In the backward case , has constant . In the other unequal cases has constant , which could vanish only when , already excluded. Equal colors give constant . For unequal colors . Direct multiplication gives on nonadjacent colors; on a forward arrow it gives since ; on a backward arrow it gives since . Thus in all unequal cases, with no division by a nonunit left unresolved.
A concrete KLR action. On , dots multiply and idempotents project. Define on equal adjacent colors. The numerator is divisible by the denominator for polynomials and formal series, so preserves the coefficient algebra. For unequal source colors define , where if and otherwise. These explicit operators prove the local relations in the following five cases.
Quadratic and dot moves. Write . On equal colors , since is invariant under , and , follow by expanding the numerator. On unequal colors the dot moves are permutation identities and . Indeed these products are on a forward arrow, on a backward arrow, and off edges. Disjoint crossings commute because their variables and their two-color factors are disjoint. Idempotent moves and commutative dot relations hold by construction.
Three distinct colors. Put , , , , . On a source with all colors distinct, direct consecutive application of step 3.1 gives both and equal to in the summand. The three pair factors commute. Hence for every edge pattern among three distinct integer colors.
Exactly the first two equal. On , , put . Consecutive application gives and . The polynomial is symmetric in , including the backward case , so the product rule gives . Finally : both sides equal , with the denominator transformed when the permutation lies to its left. Thus .
Exactly the last two equal. On , , put . The two words give and . Here is symmetric in , including when . The product rule gives . The identity now yields . This explicitly checks the second repeated-neighbor pattern.
Equal outer colors. On , , full expansion of the single middle divided difference gives and . The terms cancel, and step 4.1 gives . Thus the correction is for , for , and zero off edges. The displayed expressions have removable denominators because their original numerators come from divided differences; the final quotient is a polynomial.
All three equal. For , expand the three factors in either order. Moving permutations to the right gives the complete identity . For example the coefficient is , the and coefficients are , the coefficients are , and the identity coefficient is . Both sides preserve formal series by their original divided-difference formulas, so this rational equality proves their equality without inverting dots in the algebra. This supplies the all-equal case omitted in the cited source.
Faithfulness for the KLR action. Moving dots to the right using step 4.1, and replacing repeated crossings and braid differences using steps 5.1–9.1, spans the presented KLR algebra by for fixed reduced words . Termination uses crossing length: every quadratic reduction or braid correction has smaller length; reduced words for a permutation are connected by the elementary symmetric-group braid moves. In the rational-function action each has leading term a nonzero coefficient times , and all other terms have smaller permutation length. Distinct permutations of variables are linearly independent over the rational-function field: a shortest putative relation, evaluated on minus one selected automorphism's value on times its evaluation on , gives a shorter nonzero relation. Hence these spanning monomials are independent. The same triangular argument over fractions of formal series proves faithfulness of the completed action, whose elements are the finite sum over with formal coefficient .
Why formal extension is legitimate. There are finitely many , and each basis vector has a finite crossing degree. Symmetric positive-degree dots form a central ideal with powers cofinal with dot-degree powers in each coefficient algebra by step 1.1. The PBW module just proved is consequently finite free over its right coefficient algebra and completes coefficientwise. Multiplication extends continuously: moving a formal coefficient through a crossing uses a variable permutation or one divided difference, decreasing its order by at most one, so any finite product has a uniform finite order loss. The displayed completed PBW expansion is therefore the actual central completion, rather than an additional relation imposed on .
The common degenerate Hecke operator. In the fraction algebra set and . On an unequal source component the diagonal term is , while its crossing coefficient on the target component is . On equal colors this operator is and preserves formal series. Thus acts on in every case. All identities in the next two steps are computed in the fraction algebra and then hold for these regular operators. This use of auxiliary fractions does not assert that a dot difference is invertible in the completion or its quotients.
Hecke quadratic and mixed identities. Let ; then . Expanding gives identity coefficient and crossing coefficient . Thus , including equal colors. In the crossing terms cancel and the diagonal term is . Disjoint commute, and dots outside the pair commute with . These are precisely the quadratic, mixed and far-commuting relations of [F2].
Complete Hecke braid coefficients. In spectral variables put , , , , , . Both products and have coefficients, in permutation order , equal to . To verify the reductions, multiply using , , , , , and . For example the raw coefficient in the first word is ; its raw identity coefficient is . Interchanging and gives the second word's identical six coefficients.
All five reverse braid cases. Step 14.1 is a rational identity in independent spectral variables, before assigning colors. Substitute on each source component and apply the color-permuting operators. It proves the full Hecke braid separately on with all distinct, , , and , because each is the restriction of the same six-coefficient identity and every preserves by step 12.1. Even when a displayed spectral denominator has zero constant, cancellation occurs in the original regular operators, and injectivity into fractions preserves the equality. Thus the all-equal reverse case also has a complete coefficient computation.
Faithfulness for the Hecke action. The mixed relation moves polynomials to the right of -words and the exact symmetric-group relations reduce each word to , so is spanned by . In the action of steps 12.1–15.1 its leading permutation coefficient is the product of nonzero rational factors along a reduced word. All lower terms have shorter permutation length. The shortest-relation argument of step 10.1 proves independence and therefore the affine Hecke PBW basis. Completing at the central ideal of step 1.1 gives the finite coefficientwise PBW module ; its operator action remains faithful by the same argument over formal fractions. The coefficients need only be nonzero in that field, not units in the coefficient ring.
Comparing the explicit tables. On an unequal source , has only the crossing term. Its target coefficient is , where . Right multiplication by substitutes on that target. If , , giving coefficient ; if , and , giving coefficient ; off edges the quotient is again . On equal colors , and by moving the inverse through . Thus in the faithful action. Equivalently .
Homomorphisms in both directions. Faithfulness in steps 10.1–11.1 and 16.1 transfers the concrete equalities to the completed presented algebras. Step 17.1 identifies the forward images with the operators checked in steps 4.1–9.1, so all KLR relations hold in . It identifies the reverse images with the operators checked in steps 13.1–15.1, so all Hecke relations hold in . The coefficient-algebra maps identify the central completion topologies: the symmetric ideal vanishing at the spectral multiset and the all-zero dot ideal have cofinal powers on by step 1.1. Therefore the maps extend continuously to the stated completions. This proves both directions locally rather than importing a cyclic finite- theorem.
Inverse composites and uniformity. The coefficient maps fix every and invert componentwise. The crossing composites are and , with the same right multiplication order. Hence each composite is the identity on its generators, coefficient series and completion. None of depends on the rank, multiset, interval endpoints, level or cyclotomic charge, so enlarging an interval preserves every formula on the old tuples. Nilpotent dots permit finite evaluation of series, and every proved identity survives a quotient. Rank zero has coefficient algebra and both maps are the identity; empty positive-rank sectors have zero algebra. No assertion about cyclotomic support, based Grothendieck classes or Specht modules is needed for this local comparison.
Remarks
The proof supplies local inverse maps for arbitrary finite integer windows. An all-level cyclotomic tower comparison additionally uses finite support, cyclotomic factorization and tower compatibility, together with the generic nondegenerate local tables. This lemma makes no finite- canonical-basis or Specht-class claim.
Depends on
Used by
Dependency tree · two levels
31 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
- Brundan–Kleshchev, Blocks of cyclotomic Hecke algebras and Khovanov–Lauda algebras, arXiv:0808.2032v4 (standard reference, not scraped)