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) Structural proofs. The definition fixes graph bimodules, canonical support flags and character conventions. The following items supply their structural results locally: Bott–Samelson bimodules carry delta and nabla support filtrations proves generator closure and both flag recursions; Special Bott–Samelson Hom formula before reflection localization proves the two flagged Bott–Samelson Hom cases; Type-A top support layers are controlled by reflection localization proves the four-layer freeness, reflection-localized image equalities and right splitting; and The type-A Soergel Hom formula extends the flagged Hom calculation to arbitrary Soergel summands. These links locate proofs rather than adding imported theorems to this definition's assumptions.
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
- Positivity of Kazhdan-Lusztig polynomials, mu-coefficients and structure constants Corollary
- Bott–Samelson words related by a braid need not be isomorphic bimodules Counterexample
- Equal Euler classes do not by themselves prove homotopy-equivalent complexes Counterexample
- Canonical comparisons between standard graph tensor products Definition
- The regular integral dot-orbit labelling convention Definition
- The coinvariant algebra of S₃ as the Soergel bimodule of the longest element Example
- The rank-one Soergel bimodule: trace form, reduced module and hard Lefschetz Example
- The rank-one Soergel category Example
- The rank-two Bott-Samelson bimodule BₛBₜ: character, decomposition and the braid relation Example
- The Soergel functor on the small regular sl₂ block Example
- The type A₂ rank-two Soergel decomposition Example
- Bott–Samelson bimodules carry delta and nabla support filtrations Lemma
- Derived comparisons give unique normalized homotopy maps Lemma
- Indecomposable labels, characters and filtration ranks agree after real scalar extension Lemma
- Rouquier generator complexes have canonical derived graph models Lemma
- Special Bott–Samelson Hom formula before reflection localization Lemma
- The minimal Rouquier differential supplies the injectivity input of the weak-Lefschetz substitute 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
- Verma-flag multiplicities are standard-filtration ranks under V Proposition
- Indecomposable projectives correspond to indecomposable Soergel modules Theorem
- Light leaf maps form bases of type-A Soergel homs to the unit Theorem
- Positive Rouquier complexes are Delta-split Theorem
- Projective Verma multiplicities are Kazhdan–Lusztig values at one 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)