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 be a graded -bimodule in , so that by The type-A support filtration multiplicities are intrinsic the multiplicities , and the characters are defined and intrinsic. Then for every simple reflection :
- and lie in , with finitely many flag quotients;
- and , where and is the normalized basis of The standard basis of the type-A Hecke algebra and its multiplication rule;
- for the internal shift and all , and ; in the Elias–Williamson notation of the sources, whose shift lowers every generating degree by one, this says that multiplies by and by ;
- on the recursion reads .
This is a statement about the action of the generators only: multiplicativity of and for arbitrary tensor products is proved on this page only after the categorification theorem.
Facts & Assumptions
Given: A graded -bimodule , a simple reflection , the generator , and the Hecke algebra with its normalized basis .
, , and the characters are , (Standard graph bimodules, support filtrations and characters).
The rank-one sequences and ; in particular the -flag of has quotients and , and the -flag has quotients and , all maps of degree zero (Standard graph bimodules, support filtrations and characters).
if and if , with ; is an -basis; and satisfies (The standard basis of the type-A Hecke algebra and its multiplication rule, The type-A Hecke algebra in Soergel normalization).
Imported from Soergel's Propositions 5.7 and 5.9 together with their proofs, for , a simple and with : , , and the dual pair of recursions for the -multiplicities; the same source matches these recursions with the two Hecke formulas and (Standard graph bimodules, support filtrations and characters).
is finite free of rank two on both sides, so and are exact while flag preservation follows from [F4] and the opposite argument; (Soergel generators and Bott–Samelson products are finite free on both sides, The Soergel bimodule of a simple reflection).
Proof
Flag membership (1): by [F4] the functor carries into and into (the closure clause of each of the two imported propositions recorded there), and by [F5] it is exact and preserves finite freeness, so with finitely many flag quotients. For the right tensor, the opposite identification together with expresses as the opposite of ; the opposite functor preserves each of the two flag categories, as recorded in Standard graph bimodules, support filtrations and characters, and again lies in both with the same shift data, so the left-closure clause applied to gives . Exactness and preservation of finite freeness for hold by [F5] because is free of rank two as a left -module.
Multiplicities in the two charts: for the imported recursions of [F4] express the -multiplicities of in terms of those of , and the matching Hecke formulas of [F4] are the expansion of and in the standard basis of [F3]: since , the left-multiplication rule is when and when , so in the ascent case and in the descent case, with coefficient one on ; this coefficient one is exactly what the recursions of [F4] assert, and the diagonal term is the shift by one of the diagonal that the recursion moves.
Base case: for the two flags of [F2] give and , both equal to ; and .
Shift rule: and , so the multiplicity of in equals that of in , whence ; the same computation with the weights gives .
Comparing coefficients in step 1.2 term by term shows , so the -recursion of claim (2) holds.
The dual chart is the same computation with the weights : the -recursions of [F4] give , since the two charts are exchanged by in the displayed Hecke formulas of [F4].
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 , and ; claims (1) to (4) follow, the case of claim (4) being step 1.3. ∎
Depends on
- Bott–Samelson bimodules carry delta and nabla support filtrations
- The type-A support filtration multiplicities are intrinsic
- The type-A Hecke algebra in Soergel normalization
- The standard basis of the type-A Hecke algebra and its multiplication rule
- Standard graph bimodules, support filtrations and characters
- The Soergel bimodule $B_i$ of a simple reflection
- Soergel generators and Bott–Samelson products are finite free on both sides
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
- Soergel, Kazhdan–Lusztig-Polynome und unzerlegbare Bimoduln, Propositions 5.7 and 5.9, PDF pp.13–16 (standard reference, not scraped)
- Elias–Williamson, Soergel Calculus, §§2.1, 3.4, PDF pp.13–15, 24–27 (standard reference, not scraped)