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.
Standard graph bimodules, support filtrations and characters
Definition
Graphs and supports. Keep , with , and the affine scheme , whose -points are . Use the place-permuting action of from The standard type-A reflection realization and its polynomial ring. For let so that and is the graph of the map . A graded -bimodule is the same thing as a graded module over , and the support of is the zero set of its annihilator ideal in . For put a graded sub-bimodule of . Since is closed with radical ideal (an intersection of prime ideals, since each is a linear subspace of complementing the second factor), an element lies in exactly when for some : this is the Nullstellensatz together with the Noetherianity of . The ideal itself need not annihilate such an element — in the class of is supported on but is not killed by — which is why the criterion is stated with a power of the ideal. For we write using the length function of Type-A reduced words and the Coxeter presentation, while for the -indexed symbols denote the Bruhat principal-set cutoffs of Soergel's Notation 6.1, with the elements concentrated on the single graph and the elements concentrated off . The integer-indexed symbols of the previous display are the length cutoffs used to define the flags below, and they must not be confused with the element-indexed Bruhat cutoffs: for in the submodule contains while does not, and the two cutoffs agree at the extremes, and . So is Soergel's -layer quotient; following Soergel's Notation 6.1 we write the two -layer quotients with an underline, so that is the quotient of the lower support submodule by and the quotient of the upper support submodule by the part supported strictly above .
Standard bimodules. For let be the graded -bimodule which equals as a graded -vector space and has where ; is generated by the element of degree . Write for the external shift of Associative graded algebras, bimodules, and internal shifts, so that ; this is the shift convention of the type-A sources, and it is the one in which of The Soergel bimodule of a simple reflection has of degree . Put so that is the standard bimodule with its generator in degree , and is with its generator in degree . Thus , and is generated in degree ; in particular .
For graded free -modules in this type-A page, a homogeneous free generator of degree contributes to graded rank. This is the transform of Soergel's rank convention in his Notation 5.2; all rank formulas below use this convention.
Support filtrations. A -flag of a graded -bimodule is a finite chain of graded sub-bimodules which refines the length filtration of (here for every bimodule supported on , which all bimodules of this page are, and for because no graph with remains) and whose successive quotients are standard bimodules . We require each length layer to be a finite direct sum of shifted graph bimodules of that length, as in Soergel's Definition 5.4. Thus the quotients carry a numbering with and each is one graph, so that has a "support flag" in the sense of Soergel's . A -flag has the same direct-sum condition on its length layers, with the reverse length filtration and . The refinement condition is a condition on supports, not an ordering of incomparable quotients of equal length; only the lengths are ordered. For the graded multiplicity is and, for a -flag, is the multiplicity of in ; a priori both symbols refer to a chosen compatible enumeration (the next items on this page prove that they do not depend on it). With the Hecke basis of The standard basis of the type-A Hecke algebra and its multiplication rule and , the character sums attached to a flag are and they are used only through the items that prove these sums intrinsic.
Small . For there is a single element and every object is a finite direct sum of shifts . Its one-graph flags have these summands as quotients, so and ; in particular both characters send the unit to .
Remark
(a) Maps between standard bimodules. For and , where denotes the free graded -module on one generator of degree . Indeed a bimodule map is determined by , and must equal ; since is a domain this forces for all , hence or . The generator of has degree and maps to , which has degree as an element of , so the homogeneous map has degree and in the case .
(b) Composition. The -balanced assignment where and the product is taken in , is a well-defined degree-zero isomorphism of graded -bimodules. It is well defined because for the relation reads and maps to on both sides; it is left -linear, and it respects the right actions because for . It sends the -tensor of degree to and is therefore surjective, and both sides are free of rank one as left -modules, so it is an isomorphism. In particular (and only when ), while tensoring with shows that the assignment is compatible with the unit. The single assignment does extend uniquely to a bimodule map, and the map it extends to is exactly the twisted one above; what fails is the untwisted formula , which is not balanced when : the equality in would map to on the left and on the right, and these differ for a polynomial moved by .
(c) The rank-one calculus. Let , , , , and with the images of degree and of degree (The Soergel bimodule of a simple reflection); these two elements form a graded left -basis of , and every has a unique decomposition with , given by . The right action on the basis is as follows from and with . Hence so and are sub-bimodules of , generated in degree . Moreover for one has under and under , because and ; both maps are surjective, their kernels are the two displayed sub-bimodules, and all four maps of are degree zero: sources and targets are generated in degree whose shifts match the degree- elements . Finally the two quotients are the image of , a free rank-one -module with right action modulo and modulo respectively, that is and .
(d) Imported statements of Soergel, recorded for the later items. The later items of this page cite the following results of Soergel's Kazhdan–Lusztig-Polynome und unzerlegbare Bimoduln through this definition; we record their content here, in the notation fixed above, so that every later citation has a textual anchor in this item. Let be Soergel's category of special bimodules (Definition 5.11). The concrete criterion of Lemma 5.13 is that precisely when for finite sums of shifted Bott–Samelson products. It does not say that itself is such a sum. Let be the category of direct summands of special bimodules (Bemerkung 6.12). Since every special bimodule is a summand of such a , and every word is special, this is exactly the idempotent completion defining .
-
Closure under tensoring with a generator. (Proposition 5.7(1) and Proposition 5.9(1).) If then , and if then ; in both cases the quotients of the resulting flag are again standard bimodules, indexed by the quotients of the flag of . Moreover (the proofs of the same two propositions) the multiplicities of the new flag are given, for , by the recursions and dually In Notation 5.6 the source uses the shifted reflection functor , with . Read in the other direction, the two recursions say that a flag quotient of with graph and index produces the two quotients with graphs and of : the quotient with graph carries the same index , while the index of the quotient with graph changes by in the -chart when and by when , the two signs being exchanged in the -chart. The two pairs match the two Hecke expansions of and in the basis , which is the source's own interpretation of the recursions.
-
Stability of the flag categories. (Bemerkung 5.5.) The layers are additive in , so is stable under finite direct sums and, by the graded Krull–Schmidt theorem, under direct summands as well; the same holds for with the filtration .
-
Localization at a reflection. (Notation 6.9 and Lemma 6.10.) For a reflection let be the localization of at the homogeneous functions that do not vanish identically on the reflection hyperplane . For every special bimodule its localization is a direct summand of a finite direct sum of graded shifts of and , for . Here is the coordinate bimodule of the union of the two graphs. The two-graph module generally does not split into its two graph modules over : their common reflection equation has not been inverted. After additionally inverting that equation, the two graphs separate and the two-graph piece splits.
-
Sections have graph support, and the four layers. (Bemerkung 6.2.) Let a graded bimodule carry a finite filtration by sub-bimodules whose successive quotients are single graphs . For any section , filter its cyclic -submodule by intersecting with the given filtration. Each successive quotient of this induced filtration embeds in a single-graph module. Every nonzero submodule of a single-graph module has that same support, since its coordinate ring is the domain ; a zero quotient has empty support. Support is the union of the supports of the successive quotients in a finite filtration, so is a union of graphs with . Consequently , so the evident maps and (the second is the composite of the quotient map onto with the inclusion of that quotient in , which is defined because ) are injective, and . Moreover right multiplication by a nonzero does not change supports, , so the localizations below may be formed layer by layer.
-
Top-layer localization. (Notation 6.5 and Satz 6.6, extended in Lemma 6.13.) For put , the product over the finitely many reflections with , using the fixed hyperplane equations of The standard type-A reflection realization and its polynomial ring. For the natural morphisms induce isomorphisms and , where is the -layer quotient of Notation 6.1; the first paragraph of the proof of Lemma 6.13 observes that the isomorphism of Satz 6.6 holds for all as well, and the same holds for the second isomorphism, so both are available for every .
-
Hom formula for the additive closure. (Theorem 5.15, Lemma 6.13 and Satz 6.14(4).) For and , and likewise for and , the graded module is free with and by Satz 6.14(4), where has the stable-sum meaning just specified. For the first step of Lemma 6.13, use item 5 and item 7: the canonical lower layer of is , and its submodule obtained by multiplication by is . Since , its graded rank in our convention is . Item 8 identifies this with ; replacing by subtracts from map degrees, giving , as required. In general one takes of maximal length with for some ; then is a short exact sequence with both outer terms in and , and Theorem 5.15 forces the sequence to be exact for every ; being additive in , it stays exact for every , which closes the induction over the length of a -flag of . The second case is analogous, using the dual maximality argument over a -flag of .
-
Bruhat-refining enumerations. (Lemma 6.3 and its proof.) Let and 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; the analogous statement holds for after reversing the enumeration and replacing the lower layer by : for a descending Bruhat enumeration , and , this upper layer maps isomorphically to and is a direct sum of with multiplicities . The proof compares two such enumerations through the finitely many steps that swap two adjacent incomparable elements: incomparable elements differ by no reflection, so by the extension-vanishing input there is no between the corresponding subquotients, and the two filtrations have the same subquotients up to order.
-
Freeness over the invariant ring of a graph. (Proposition 6.4.) For and the graded modules , , and are free graded right -modules on which the action of factors through the graph ring ; in particular evaluation at the generator gives an isomorphism , and for every .
(e) Opposite bimodules. For a graded -bimodule let be the graded -bimodule with the same underlying graded -module and operations ; since is commutative this is again a graded -bimodule, and the following four remarks are used by the later support-filtration items.
- The flip is a well-defined degree-zero bijection , because maps to in .
- through , and through the flip ; both are degree-zero isomorphisms of graded -bimodules.
- Write for the flip of the two factors of . A nonzero element of a standard bimodule has support exactly the single graph of its standard, since the annihilator of the generator of is the prime ideal ; for the same reason under the flip , so . Since and , the length filtrations satisfy and as -submodules.
- Consequently a -flag of with quotients is a -flag of with quotients in the same order, and a -flag of is a -flag of in the same order: the graph index inverts, the length is unchanged by item 3, and the refined length filtration is preserved by the opposite functor, so this functor preserves each of the two flag categories, and .
Depends on
- The standard type-A reflection realization and its polynomial ring
- The type-A Soergel category $\mathrm{SBim}_n$
- The Bruhat order on $S_n$ by rank inequalities
- Associative graded algebras, bimodules, and internal shifts
- Type-A reduced words and the Coxeter presentation
- The Soergel bimodule $B_i$ of a simple reflection
- The standard basis of the type-A Hecke algebra and its multiplication rule
Used by
- Bott–Samelson words related by a braid need not be isomorphic bimodules Counterexample
- The rank-one Soergel category Example
- The type A₂ rank-two Soergel decomposition Example
- Bott–Samelson bimodules carry delta and nabla support filtrations Lemma
- Special Bott–Samelson Hom formula before reflection localization Lemma
- The rank-one Soergel bimodule square splits Lemma
- The type-A character recursion under simple Soergel tensoring Lemma
- The type-A standard character is multiplicative Lemma
- The type-A support filtration multiplicities are intrinsic Lemma
- Type-A graph-bimodule extension vanishing Lemma
- Type-A top support layers are controlled by reflection localization Lemma
- Light leaf maps form bases of type-A Soergel homs to the unit Theorem
- The type-A Soergel Hom formula Theorem
Dependency tree · two levels
20 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, §§5–6 (standard reference, not scraped)
- Elias–Williamson, Soergel Calculus, §§3.4–3.6 (standard reference, not scraped)