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 support filtration multiplicities are intrinsic
Statement
Let be a graded -bimodule lying in , so that it carries a -flag and a -flag. Then:
- the graded multiplicities and of Standard graph bimodules, support filtrations and characters are independent of the compatible enumeration of the flag, so that the character sums and are functions of alone;
- if with , then and likewise for ; more generally the same holds for any direct summand of which itself lies in .
Facts & Assumptions
Given: A graded -bimodule , its length filtration and , and standard bimodules with graph index and generator degree .
A -flag refines the length filtration , a -flag refines , and is the multiplicity of in for , with , and the multiplicity of in (Standard graph bimodules, support filtrations and characters).
Imported from Soergel Bemerkung 5.5 (with Krull–Schmidt 1.3 there): is stable under finite direct sums and under direct summands, and the same holds for (Standard graph bimodules, support filtrations and characters).
Imported (Soergel Lemma 6.3 with its proof, recorded in the definition item): let , let be an enumeration of in which Bruhat-larger elements have larger index, put and . Then the evident map is an isomorphism, both sides are finite direct sums of objects of the form , and occurs in this quotient exactly times as a direct summand; for the corresponding enumeration is descending in Bruhat order and the canonical layer is , a direct sum of with the -multiplicities. The proof compares two such enumerations through finitely many steps swapping two adjacent incomparable elements: incomparable elements of differ by no reflection, so vanishes between the corresponding standard subquotients and the two filtrations have the same subquotients up to order (Standard graph bimodules, support filtrations and characters).
Proof
Intrinsicness: choose a Bruhat-compatible enumeration of , listing larger elements later, and group the flag quotients by their graph index. For each , [F3] identifies the quotient at that position with the canonical Bruhat layer and says it is a direct sum of with multiplicities exactly . This canonical layer depends only on , so the multiplicities are independent of the compatible enumeration; the analogous assertion for follows from the clause of [F3] and its canonical upper Bruhat layer. For a fixed graph, the multiplicities of its shifts are determined by the graded dimension after quotienting its free graph module by ; thus they are intrinsic even among repeated copies of that graph. The comparison in [F3] swaps distinct incomparable graph indices, with the extension-vanishing argument already included there; grouping by graph index means no swap of repeated copies of one standard is needed. Hence both character sums depend only on .
Additivity: for every support set one has . Indeed the support of is the union of the two component supports, so it lies in exactly when each component does. Taking consecutive length cutoffs therefore identifies every length layer of with the direct sum of the corresponding layers of and . Decomposing these layers into shifted graph modules adds their multiplicities. Equivalently one interleaves the two flags in length order, preserving the order within each flag. This proves additivity for both charts.
Direct summands: if is a direct summand of and , write . By [F2], the complement is also in . Additivity from step 2.1 shows that each multiplicity in is the sum of the corresponding multiplicities in and , and therefore the intrinsic formulas also apply to the summands. The flags are finite by the definition of these classes. ∎
Depends on
Used by
- Bott–Samelson words related by a braid need not be isomorphic bimodules Counterexample
- Special Bott–Samelson Hom formula before reflection localization Lemma
- The type-A character recursion under simple Soergel tensoring Lemma
- The type-A standard character is multiplicative Lemma
- Type-A top support layers are controlled by reflection localization Lemma
- The type-A Soergel Hom formula Theorem
Dependency tree · two levels
14 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, Bemerkung 5.5 and 5.12, PDF pp.12, 17 (standard reference, not scraped)
- Elias–Williamson, Soergel Calculus, §§3.4–3.6 (standard reference, not scraped)