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.
Type-A top support layers are controlled by reflection localization
Statement
For a reflection with , fix the hyperplane equation of The standard type-A reflection realization and its polynomial ring. For put . Let be a Bott–Samelson bimodule or a direct summand of one, with its support submodules and and the -layer quotients and of Standard graph bimodules, support filtrations and characters, and write for Soergel's -layer quotient. Then:
- the natural morphism , the inclusion of the -layer into the lower support submodule followed by the quotient map, is injective with image the submodule obtained as the image of right multiplication by , so it becomes an isomorphism after inverting , that is , and the -layer is generated by the lower -layer after inverting the hyperplane equations of the reflections with ;
- dually, the natural morphism is injective with image the image of right multiplication by , so it becomes an isomorphism after the same inversion, that is and the upper -layer is determined by the -layer quotient after inverting ;
- in particular the graded ranks satisfy and , so that each graded rank determines the corresponding -multiplicities of its support flag.
The inclusion chains displayed above are two separate chains: the lower and the upper support submodule are not nested in general, and because the cutoffs of Standard graph bimodules, support filtrations and characters are the Bruhat principal sets and of Soergel's Notation 6.1, their intersection is exactly . This is Soergel's Satz 6.6 in the notation of his Notation 6.1; the localization input is his Lemma 6.10, quoted in the Facts block, and the rank identities are the computation of Satz 6.6's proof.
Facts & Assumptions
Given: An element , the polynomial ring with the reflections of and their fixed hyperplanes in , a Bott–Samelson bimodule or a direct summand of one, and the elements .
is the support sub-bimodule on the single graph ; and are the Bruhat lower and upper support submodules, so that both contain and their intersection is ; and are the two -layer quotients and is the -layer quotient of Notation 6.1; the filtration multiplicity counts in the upper -layer and counts in the lower -layer (Standard graph bimodules, support filtrations and characters).
has finitely many support layers, all of the form for , and each layer is a finite direct sum of standard bimodules, so every -submodule of is finitely generated and the multiplicities of [F1] are defined and intrinsic (The type-A support filtration multiplicities are intrinsic, Bott–Samelson bimodules carry delta and nabla support filtrations).
The two -layer quotients are finite direct sums of shifted standards, and , with the multiplicities of [F1] (Bruhat-refining enumeration of Soergel's Lemma 6.3, recorded in the definition) (Standard graph bimodules, support filtrations and characters).
For a Bott–Samelson bimodule , evaluation at the generator identifies with , and the four -layers , , and are free graded right -modules on which acts through (Soergel Proposition 6.4, recorded in the definition). These properties pass to a direct summand : the support functors, their quotients, and the evaluation map commute with the idempotent , while a graded summand of a finite free module over the positively graded polynomial ring is graded free by graded Nakayama. Thus the same evaluation and freeness statements hold for every in the statement (Standard graph bimodules, support filtrations and characters).
Imported (Soergel Satz 6.6, with the observation at the start of the proof of Lemma 6.13 that the isomorphism of Satz 6.6 holds for every in the additive closure of the Bott–Samelson bimodules as well): for a Bott–Samelson bimodule or a direct summand of one the natural morphisms and are injective with images the images and of right multiplication by , and they induce the isomorphisms and (Standard graph bimodules, support filtrations and characters).
Proof
Injectivity and image: [F5] provides both natural morphisms with their injectivity and their images, and the two localisation statements are equivalent to these: localising the inclusion at gives an equality because every element of the localised target is with in the image, and conversely a morphism which is injective with -divisible image has localisation an isomorphism; the same argument applies to . [F5] 1.2 Ranks of the layer quotients: by [F1] and [F3] the two -layer quotients are direct sums of copies of and of , so their graded ranks are and ; the element is homogeneous of degree , because each is a linear form of degree and the number of reflections with equals , and multiplication by a nonzero homogeneous element of a free graded right -module is injective and raises degrees by its own degree; the sums are finite and their coefficients are the intrinsic multiplicities of [F2]. [F1, F2, F3, F4] 2.1 The two rank identities: by step 1.1 the modules and are isomorphic, so by step 1.2 ; dually is isomorphic to the quotient, inverse to the inclusion, of , so , both computations using that the four modules of [F4] are free and hence -torsion-free. [F4, step 1.1, step 1.2] 3.1 Conclusion: claims (1) and (2) are steps 1.1 and 2.1 read together with [F5], and claim (3) is the pair of rank identities of step 2.1; the result is stated for Bott–Samelson bimodules and their direct summands because [F5] is, and no statement about the full Hom formula for arbitrary summands is used. ∎
Depends on
Used by
- The type-A Soergel Hom formula Theorem
Dependency tree · two levels
16 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, Notation 6.5, Lemma 6.10, Lemma 6.13 and Satz 6.6, PDF pp.19–21 (standard reference, not scraped)
- Elias–Williamson, Soergel Calculus, §3.6 (standard reference, not scraped)