Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Generic KLR induction and restriction adjunctions preserve projectives

Statement

Let Q be a KLR datum as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum and β,γ∈Q+. Put A=R(β+γ), B=R(β)⊗kR(γ), e=e(β,γ) and c=(β∣γ). The bimodules eA and Ae are ungraded free respectively as left and right B-modules, of rank (∣β∣+∣γ∣∣β∣). As GRADED modules they are finite projective direct sums of the appropriate principal idempotent B-modules with labelled shuffle shifts: for each concatenated word ξ=ν∗η the right-module summand e(ξ)B has shift δR(w,ξ)=deg⁡(τwe(ξ)) and the left-module summand Be(ξ) has shift δL(w,ξ)=deg⁡(e(ξ)τw)=δR(w,w−1ξ), using respectively the corresponding right and left minimal shuffle representatives w; these degrees depend on the labels, and no common shift for an entire B copy is asserted. The functors Ind=Ae⊗B− and Res=e(−) of Induction and restriction bimodules for KLR algebras are exact, commute with internal shifts, and preserve finitely generated graded projectives. Ind is left adjoint to Res. The right adjoint of Res is Coind=HOM⁡B(eA,−), with (a⋅f)(t)=f(ta), and the exact generic second-adjunction formula is Coindβ,γ(M⊠N)≅Indγ,β(N⊠M){c}. Thus the second adjunction reverses the two blocks and has the displayed shift; same-ordered unshifted biadjunction is not asserted. The formula is an isomorphism of functors and holds on arbitrary graded B-modules after interpreting the right side with the block-flip equivalence. This is distinct from the cyclotomic Ei/Fi biadjunction theorem. Moreover eR(β+γ)e′ has a finite Mackey filtration indexed by nonnegative four-block weight matrices with row sums β,γ and column sums β′,γ′, whose subquotient is the corresponding composite four-block restriction, flip of the middle blocks and induction bimodule, shifted by −(b∣c); the same statement holds for arbitrary numbers of blocks.

Facts & Assumptions

Given: A KLR datum Q, weights β,γ∈Q+, the algebra A=R(β+γ) with idempotent e=e(β,γ), the tensor algebra B=R(β)⊗kR(γ), the bimodules eA and Ae, and the functors Ind=Ae⊗B−, Res=e(−) of Induction and restriction bimodules for KLR algebras.

[F1]

PBW basis (The PBW (monomial) basis theorem for KLR algebras): monomials τwx1a1⋯xnane(ν) form a basis; every permutation w has a unique decomposition w=wPwshuffle as a product of a parabolic element of S∣β∣×S∣γ∣ and a minimal-length shuffle, with additive length.

[F2]

Exactness and projectives (Bimodule tensor exactness and preservation of finite projectives have separate hypotheses): if M is flat as an underlying right A-module then M⊗A− is exact on graded left modules; if M is finite graded projective as a left B-module then M⊗A− carries finite graded projective left A-modules to finite graded projective left B-modules.

[F3]

Tensor-Hom adjunction (Associative and graded bimodule tensor–Hom adjunction): Hom⁡B,0(M⊗AX,Y)≅Hom⁡A,0(X,HOM⁡B(M,Y)) naturally, with HOM⁡ the graded hom of finite sums of homogeneous maps.

[F4]

Shifts (Graded balanced tensor product and homogeneous Hom): the balanced tensor product carries the total-degree internal grading, and outer actions by graded algebras are homogeneous; all shifts below are internal shifts.

Proof

technique · direct; decompose $Ae$ as a right block module and $eA$ as a left block module, then establish exactness, projectivity, adjunctions and the double-coset filtration
1.1givenF1algebra

(Shuffle decomposition and freeness.) Choose reduced PBW words adapted to the parabolic subgroup S∣β∣×S∣γ∣. For each concatenated word ξ=ν∗η and minimal right coset representative w, the vectors τwe(ξ)b, with b ranging through the PBW basis of e(ξ)B, form precisely the PBW basis of the right B-module Ae: the permutation is a minimal shuffle followed by an internal block permutation, with additive length, and the right idempotent records the source word in the corner e. Thus Ae≅⨁w,ξe(ξ)B{δR(w,ξ)}, with the displayed degree of τwe(ξ). Reversal of products fixing dots, crossings and idempotents preserves the defining relations and is an anti-involution; it sends Ae to eA and τwe(ξ) to e(ξ)τw−1, giving the left B-module decomposition of eA into the corresponding Be(ξ) with shifts δL(w,ξ)=deg⁡(e(ξ)τw). Both decompositions are finite sums of principal graded projectives. Ungraded, for each shuffle the sum over all concatenated ξ is one copy of B, so both ranks are (∣β∣+∣γ∣∣β∣). Neither bimodule is replaced by eAe: its unconstrained opposite endpoint is essential for the shuffle basis.

1.2givenF3algebra

(Left adjunction.) For a graded left B-module X and a graded left A-module L, currying gives the natural degree-zero bijection Hom⁡A,0(Ae⊗BX,L)→Hom⁡B,0(X,eL), Φ↦(x↦Φ(e⊗x)), with inverse f↦(ae⊗x↦a f(x)), well defined on balanced tensors and inverse by the idempotence of e; this is the adjunction of [F3] for the (A,B)-bimodule Ae.

2.1step 1.1F2F4algebra

(Exactness and projectivity.) The right B-module Ae is projective, hence flat, by step 1.1, so Ind=Ae⊗B− is exact by [F2]. Idempotent restriction is exact on left modules: for a surjection L→N, a vector en∈eN lifts to eℓ∈eL, and kernels and images commute with multiplication by the degree-zero idempotent e; no right action on L is required. A finitely generated graded projective left B-module is a summand of a finite sum of shifts of B, so its induction is a summand of the corresponding sum of shifts of Ae. As a left A-module Ae is the image of the degree-zero idempotent endomorphism a↦ae of A, hence is finitely generated graded projective. Similarly, if P is a finitely generated graded projective left A-module, realize P as a summand of a finite sum of shifts of A and apply e(−) to its split inclusion and projection. Then eP is a summand of the corresponding sum of shifts of eA, which is finitely generated graded projective as a left B-module by step 1.1. Internal shifts commute with induction and restriction because their balance relations and idempotent action have degree zero. This proves exactness, shift compatibility and both finite-projective preservation clauses.

2.2step 1.1F1F3algebra

(Coinduction and the longest shuffle.) The right adjoint of Res is Coind=HOM⁡B(eA,−) by [F3] applied to M=eA, and explicit currying gives (a⋅f)(t)=f(ta). For the second-adjunction formula let y be the longest block shuffle of the two blocks, of degree −c (each of the ∣β∣∣γ∣ crossed positions contributes the negative pairing of the two colours), and let e′=e(γ,β) be the reversed-block idempotent. By PBW there is a well-defined B-balanced coefficient map t:eAe′→B projecting onto the y-coefficient, where the reversed block order is read in B through the flip equivalence R(β)⊗kR(γ)→R(γ)⊗kR(β); dot slides and block crossings preserve the longest-shuffle coefficient, while every dot or braid correction in a shorter shuffle has strictly smaller shuffle length and is killed by t. Hence the map Φ:Ae′→HOM⁡B(eA,B), z↦(u↦t(uz)), is a degree-c map of (A,B)-bimodules, and it is compatible with the flip identification.

2.3step 1.1F1algebra

(Mackey filtration.) Fix a second flag with idempotent e′=e(β′,γ′) and choose reduced double-coset representatives for the row block permutation group and the column block permutation group acting on the ∣β∣+∣γ∣ positions. Partition the PBW monomials of the corner eAe′ by the four intersection blocks (a,b;c,d) with row sums β,γ and column sums β′,γ′, and filter by the crossing length of the double-coset representatives. The span of the double cosets of strictly smaller length is a (B,B′)-sub-bimodule: sliding a block generator across a representative either stays in its double coset with an internal block permutation, or produces a quadratic/braid correction of strictly smaller length, which lies in the smaller span. In the associated quotient only the monomials whose permutation is the minimal double-coset representative survive; they are exactly tensor products of the PBW bases of the four blocks composed with the row and column induced bimodules and the unique minimal crossing of the two middle blocks, which carries the shift −(b∣c) because the crossed colours are precisely b and c. The basis bijection defines inverse maps between the associated quotient and the composite four-block restriction/induction bimodule, so the filtration is proved and not merely a character identity; iterating the same permutation argument gives the multi-block statement.

3.1step 2.2F1F3algebra

(Triangularity and the functor formula.) Pair the right B-module shuffle basis of Ae′ (through the block flip) with the left B-module shuffle basis of eA by complementary shuffles. Ordered by shuffle length, the coefficient matrix of the pairing u↦t(uz) is triangular: a complementary pair is exactly the reduced longest shuffle with coefficient 1 up to the absorbed equal-colour signs, and a noncomplementary pair either misses its permutation or reduces by a quadratic or braid correction to strictly smaller length, hence vanishes in the associated graded. Finite triangular elimination over B (division by the diagonal units 1) inverts the matrix, so Φ is an isomorphism of graded (A,B)-bimodules; consequently HOM⁡B(eA,B)≅Ae′{c} with the B-action transported by the block flip. Since eA is finite projective over B by step 1.1, evaluation identifies HOM⁡B(eA,B)⊗BX≅HOM⁡B(eA,X) for every graded B-module X (checked on finite free modules and finite summands), and tracking the outer right B-action through the flip gives the functorial isomorphism Coindβ,γ(M⊠N)≅Indγ,β(N⊠M){c}.

4.1step 1.1step 2.1step 1.2step 2.2step 3.1step 2.3algebra∎

All clauses of the statement are now proved: step 1.1 gives the freeness and the labelled shuffle shifts, step 2.1 the exactness, shift compatibility and projective preservation, step 1.2 the left adjunction, steps 2.2 and 3.1 the right adjoint and its exact reversed-block formula, and step 2.3 the finite Mackey filtration and its multi-block version.

Depends on

Used by

Dependency tree · two levels

24 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