Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

The type-A character recursion under simple Soergel tensoring

Statement

Let M be a graded R-bimodule in FΔ∩F∇, so that by The type-A support filtration multiplicities are intrinsic the multiplicities (M:Δx(d)), (M:∇x(d)) and the characters hΔ(M),h∇(M) are defined and intrinsic. Then for every simple reflection s=si:

  1. Bi⊗RM and M⊗RBi lie in FΔ∩F∇, with finitely many flag quotients;
  2. hΔ(Bi⊗RM)=Hi hΔ(M) and h∇(Bi⊗RM)=Hi h∇(M), where Hi=v(Ti+1)=T~i+v and T~x=vℓ(x)Tx is the normalized basis of The standard basis of the type-A Hecke algebra and its multiplication rule;
  3. for the internal shift and all k∈Z, hΔ(M{k})=v−khΔ(M) and h∇(M{k})=vkh∇(M); in the Elias–Williamson notation of the sources, whose shift (1)={−1} lowers every generating degree by one, this says that (1) multiplies hΔ by v and h∇ by v−1;
  4. on M=R the recursion reads hΔ(Bi)=h∇(Bi)=Hi.

This is a statement about the action of the generators only: multiplicativity of hΔ and h∇ for arbitrary tensor products is proved on this page only after the categorification theorem.

Facts & Assumptions

Given: A graded R-bimodule M∈FΔ∩F∇, a simple reflection s=si, the generator Bi=R⊗RsiR(1), and the Hecke algebra Hn with its normalized basis T~x=vℓ(x)Tx.

[F1]

Δx(d)=Rx{ℓ(x)−d}, ∇x(d)=Rx{−ℓ(x)−d}, and the characters are hΔ(M)=∑(M:Δx(d))vdT~x, h∇(M)=∑(M:∇x(d))v−dT~x (Standard graph bimodules, support filtrations and characters).

[F2]

The rank-one sequences 0→R{1}→Bs→Rs{−1}→0 and 0→Rs{1}→Bs→R{−1}→0; in particular the Δ-flag of Bs has quotients Rs{1}=Δs(0) and R{−1}=Δe(1), and the ∇-flag has quotients R{1}=∇e(−1) and Rs{−1}=∇s(0), all maps of degree zero (Standard graph bimodules, support filtrations and characters).

[F3]

TwTi=Twsi if ℓ(wsi)=ℓ(w)+1 and TwTi=(q−1)Tw+qTwsi if ℓ(wsi)=ℓ(w)−1, with q=v−2; {Tw} is an A-basis; and Hi=v(Ti+1) satisfies Hi2=(v+v−1)Hi (The standard basis of the type-A Hecke algebra and its multiplication rule, The type-A Hecke algebra in Soergel normalization).

[F4]

Imported from Soergel's Propositions 5.7 and 5.9 together with their proofs, for B∈FΔ∩F∇, a simple s and x with ℓ(x)>ℓ(sx): (Bs⊗RB:Δx(d))=(B:Δx(d+1))+(B:Δsx(d)), (Bs⊗RB:Δsx(d))=(B:Δx(d))+(B:Δsx(d−1)), and the dual pair of recursions for the ∇-multiplicities; the same source matches these recursions with the two Hecke formulas ((T~s+v)H:vdT~x)=(H:vd+1T~x)+(H:vdT~sx) and ((T~s+v)H:vdT~sx)=(H:vdT~x)+(H:vd−1T~sx) (Standard graph bimodules, support filtrations and characters).

[F5]

Bi is finite free of rank two on both sides, so Bi⊗R− and −⊗RBi are exact while flag preservation follows from [F4] and the opposite argument; Bi≅Biop (Soergel generators and Bott–Samelson products are finite free on both sides, The Soergel bimodule Bi of a simple reflection).

Proof

1.1

Flag membership (1): by [F4] the functor Bs⊗R− carries FΔ into FΔ and F∇ into F∇ (the closure clause of each of the two imported propositions recorded there), and by [F5] it is exact and preserves finite freeness, so Bs⊗RM∈FΔ∩F∇ with finitely many flag quotients. For the right tensor, the opposite identification (M⊗RBs)op≅Bsop⊗RMop together with Bsop≅Bs expresses M⊗RBs as the opposite of Bs⊗RMop; the opposite functor preserves each of the two flag categories, as recorded in Standard graph bimodules, support filtrations and characters, and Mop again lies in both with the same shift data, so the left-closure clause applied to Mop gives M⊗RBs∈FΔ∩F∇. Exactness and preservation of finite freeness for −⊗RBs hold by [F5] because Bs is free of rank two as a left R-module.

F4F5
1.2

Multiplicities in the two charts: for ℓ(x)>ℓ(sx) the imported recursions of [F4] express the Δ-multiplicities of Bs⊗RB in terms of those of B, and the matching Hecke formulas of [F4] are the expansion of T~sT~x and T~sT~sx in the standard basis of [F3]: since T~x=vℓ(x)Tx, the left-multiplication rule is TsTx=Tsx when ℓ(sx)=ℓ(x)+1 and TsTx=(q−1)Tx+qTsx when ℓ(sx)=ℓ(x)−1, so T~sT~x=T~sx in the ascent case and T~sT~x=T~sx+(v−1−v)T~x in the descent case, with coefficient one on T~sx; this coefficient one is exactly what the recursions of [F4] assert, and the diagonal term (v−1−v)T~x is the shift by one of the diagonal that the recursion moves.

F3F4
1.3

Base case: for M=R the two flags of [F2] give hΔ(Bs)=v1T~e+v0T~s=v+vTs and h∇(Bs)=v1T~e+v0T~s=v+vTs, both equal to Hs⋅1=Hs; and hΔ(R)=h∇(R)=T~e=1.

F1F2F3
1.4

Shift rule: Δx(d){k}=Rx{ℓ(x)−d+k}=Δx(d−k) and ∇x(d){k}=∇x(d−k), so the multiplicity of Δx(d) in M{k} equals that of Δx(d+k) in M, whence hΔ(M{k})=∑d(M:Δx(d+k))vdT~x=v−khΔ(M); the same computation with the weights v−d gives h∇(M{k})=vkh∇(M).

F1
2.1

Comparing coefficients in step 1.2 term by term shows hΔ(Bs⊗RB)=∑x,d(Bs⊗RB:Δx(d))vdT~x=(T~s+v)hΔ(B)=HshΔ(B), so the Δ-recursion of claim (2) holds.

F1F3step 1.2
2.2

The dual chart is the same computation with the weights v−d: the ∇-recursions of [F4] give h∇(Bs⊗RB)=Hsh∇(B), since the two charts are exchanged by d↦−d in the displayed Hecke formulas of [F4].

F1F3step 1.2
3.1

Intrinsicness and conclusion: by The type-A support filtration multiplicities are intrinsic the multiplicities used in steps 2.1 to 3.1 depend only on the bimodules involved, so the displayed identities are identities between the characters of M, Bi⊗RM and M{k}; claims (1) to (4) follow, the case M=R of claim (4) being step 1.3. ∎

step 1.1step 2.1step 2.2step 1.3step 1.4

Depends on

Used by

Dependency tree · two levels

15 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