Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Induction and restriction bimodules for KLR algebras

Definition

Let Q be a KLR datum as in The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum. For β,γ∈Q+ put e(β,γ):=∑ν∈Iβ,ν′∈Iγe(ν∗ν′)∈R(β+γ), where ν∗ν′ is concatenation; this is an idempotent. The block inclusions R(β)↪R(β+γ), r↦r⊗1 and R(γ)↪R(β+γ), s↦1⊗s combine into an injective k-algebra map R(β)⊗kR(γ)→R(β+γ) whose image is the separated-block subalgebra of the corner e(β,γ)R(β+γ)e(β,γ); the inclusion generally is proper; in the diagram calculus it is horizontal concatenation of diagrams. Induction and restriction are the functors on graded left modules Indβ,γ(M⊠N):=R(β+γ)e(β,γ)⊗R(β)⊗kR(γ)(M⊗kN),Resβ,γL:=e(β,γ)L, where ⊗R(β)⊗kR(γ) is the graded balanced tensor product of Graded balanced tensor product and homogeneous Hom (total-degree grading) and M⊗kN carries the graded tensor product structure; Ind is a functor on graded modules over the graded algebra R(β)⊗kR(γ) (through the tensor product of the two graded modules) and, since R(β+γ)e(β,γ) is a graded (R(β+γ),R(β)⊗kR(γ))-bimodule and e(β,γ)R(β+γ) is its right-module counterpart, the two tensor functors are of the two sidedness types of Associative and graded bimodule tensor–Hom adjunction. Both functors are additive and degree-zero on degree-zero maps and extend to the direct sums over weights. Shifts satisfy Indβ,γ(M{r}⊠N{s})≅Indβ,γ(M⊠N){r+s} and Resβ,γ(L{r})≅(Resβ,γL){r} (Graded associativity, units, and internal-shift tensor isomorphisms). For a partial flag β=β1+⋯+βr the iterated functors are defined by iteration, and the parenthesization-independent identification is the one consumed below.

Remarks

Well-definedness. Concatenation sends the two tensor-factor identities to e(β,γ) and respects the relations of each block, so r⊗s↦r⋅(image of s) is a unital algebra homomorphism from R(β)⊗kR(γ) onto the separated-block subalgebra of the corner; note that it is unital into the corner, not into all of R(β+γ), and the two block images commute because separated generators commute by relations (3), (5) and (6) with ∣a−b∣>1. Injectivity is read off the PBW basis of The PBW (monomial) basis theorem for KLR algebras: the monomials whose permutation word lies in the parabolic subgroup S∣β∣×S∣γ∣ (in the appropriate block positions) and whose dot exponents are arbitrary are exactly the images of the tensor products of the two PBW bases, hence are linearly independent. The image can be strictly smaller than the corner: for β=γ=αi the corner is the nil-Hecke algebra R(2αi)≅NH2, while the image is k[x1,x2]e(ii) (with x1,x2 acting blockwise), which does not contain τ1.

Functoriality and shifts. The balanced tensor product of a right and a left module over the graded algebra R(β)⊗kR(γ) is defined by the universal property with respect to balanced bilinear maps of degree 0, and both balance relations and the outer R(β+γ)-action preserve degrees; moving an internal shift through the total-degree tensor grading gives the two displayed shift isomorphisms. For an iterated flag, the maps a⊗(b⊗m)↦ab⊗m identify the balanced tensors of the different parenthesizations, so the iteration is defined up to canonical degree-zero isomorphism; the classes in the Grothendieck groups below are unaffected. The construction is choice-free: no representatives or auxiliary data are selected.

Sources

Source comparison: Khovanov–Lauda I §2.6 (the embedding, the idempotent 1ν,ν′ and the functors); Kang–Kashiwara §3 (3.9)-(3.11) (the R(m)⊗R(n)-balanced form used here); Kleshchev §2.11 (multi-factor embeddings and the induced/restricted functors).

Depends on

Used by

Dependency tree · two levels

26 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