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 graph-bimodule extension vanishing
Statement
Let and let be the codimension in either graph of the intersection ; here acts on by place permutation, so exactly when is a reflection.
- If , then every graded short exact sequence of graded -bimodules splits.
- If for a reflection , then and every such extension splits after inverting the equation of the hyperplane fixed by the reflection , i.e. after inverting (a unit multiple of ); restricted to the case this is localizing in the hyperplane equation itself.
Facts & Assumptions
Given: Distinct , the graph bimodules , the graded bimodules shifted by and , and, for the reduction, the generators of the graph ideal .
is as a graded -space with left action and right action , and its support is ; also for and for (Standard graph bimodules, support filtrations and characters).
For one has , the Demazure operator satisfies for , and the realization is faithful with all invertible in (The standard type-A reflection realization and its polynomial ring).
Proof
Set , generated by , and fix a homogeneous lift of the generator , so that the sub identifies with through a chosen generator of degree . Since every kills the image of in , one has , so for a unique homogeneous element , and is generated over by and with the single family of relations .
The assignment is additive and satisfies because in the sub-bimodule ; writing for the image of under , , one has for all , since and . Writing , the extension is thus encoded by elements with for all , and nothing else.
The forms lie in the linear span of the variables of , and their images are : acting on one has and . Hence the ideal generated by the is the ideal of the subspace of , the rank of the family is , and , of dimension in either graph.
Splitting: the extension splits iff there is with for all . Indeed a splitting of the sequence is exactly a homogeneous -bimodule section of , which has the form with lifting the generator; writing for some , the section is well defined iff , i.e. iff for all , that is for all . Conversely such an makes a well-defined splitting.
Reduction of the case to two coprime forms: view as a permutation of the coordinate set, so . If some cycle of has length , two consecutive forms of that cycle, and , are distinct irreducible elements of the polynomial ring and hence coprime in the UFD ; if all cycles have length and , there are at least two transposition cycles and one form from each is a pair with disjoint supports, again coprime. In both cases pick such indices .
Conclusion in the case : from and in the UFD we get and ; write and ; substituting gives , hence as is a domain. For every index , forces , since and is a domain. By step 3.1 the extension splits.
The case : then is a reflection, so it exchanges two coordinates and fixes the rest; hence , and for all other . The relations give for and , and by step 3.1 the extension splits iff . In the localization at the obstruction dies because becomes a unit; moreover is a unit multiple of , the equation of the hyperplane of fixed points of , and for that reflection is with equation .
Both assertions follow: for every extension splits by step 4.1, and for with every extension splits in the stated localization by step 4.2. All constructions were made on homogeneous lifts, so the argument applies degree by degree in the graded category. ∎
Depends on
Used by
Dependency tree · two levels
10 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, Lemma 5.8 and §5 (standard reference, not scraped)
- Elias–Williamson, Soergel Calculus, §3.4 (standard reference, not scraped)