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, Type-A graph-bimodule extension vanishing, Soergel generators and Bott–Samelson products are finite free on both sides).
The two -layer quotients are finite direct sums of shifted standards, and , with the multiplicities of [F1] (The type-A support filtration multiplicities are intrinsic, whose adjacent-incomparable-swap proof establishes the canonical Bruhat-layer identification).
The special Hom formula is proved for arbitrary flagged sources and Bott–Samelson targets, and for Bott–Samelson sources and arbitrary flagged targets (Special Bott–Samelson Hom formula before reflection localization). Tensoring on the left by a generator preserves each flag category, with its explicitly proved rank-one recursion (Bott–Samelson bimodules carry delta and nabla support filtrations). Graph extensions split away from their reflection hyperplane, as shown by the explicit cocycle calculation (Type-A graph-bimodule extension vanishing).
Proof
The two natural maps are injective. A flagged module is right-free, and after passing to the fraction field its graph summands separate. A section supported on two disjoint sets of graphs is zero, since it is zero in this localization. This proves and , giving the two injections. Support cuts and quotients commute with idempotents: write a word sum as and take each cut componentwise. Its canonical flag layers therefore split into those of . A graded projective summand of a finite free graded polynomial module is graded free: lift a homogeneous basis of to obtain a free graded module mapping onto , using its lower degree bound to prove surjectivity by successive degree reduction. Projectivity splits this surjection; its finite graded kernel has zero reduction and hence is zero by the same lower-degree argument. Thus the two canonical layers in [F3] remain free for all summands.
Evaluation at identifies with for a word : in its fraction-field graph decomposition every section supported on satisfies the graph relations, and right torsion-freeness gives them before localization. By the special Hom formula this module is free. The quotient is free as well: twist the right action by , identifying this quotient with the identity-graph quotient of . This twisted word has a flag, since it is obtained by successive left generator tensors from the single flagged graph using [F4]. Its identity quotient is its length-zero layer and is free. Evaluation, cuts, and these identifications commute with summand idempotents, so the graded-projective argument in step 1.1 gives freeness of all four layers for . The sequence consequently splits on the right. The same argument gives right freeness of : the twisted word also has a flag by the same left-generator closure from . Its identity support is its length-zero submodule, and the quotient has a flag of the remaining right-free layers. Thus its identity submodule, and hence , splits on the right; applying the summand idempotent retains a right-free quotient and a right splitting. In particular the inclusion is right-saturated: if with , then the graph relations kill , and right torsion-freeness implies that they kill , so . This saturation is the consequence needed for reduction in a minimal generator degree.
Fix a reflection and localize the right polynomial ring at the prime hyperplane equation ; all homogeneous polynomials not divisible by become invertible. A word becomes a direct sum of shifted graph modules with , and two-graph union modules , with . We prove this by induction on the word. It holds for the unit, since . Tensoring a graph with has the two graph layers from rank-one calculus; if , their extension splits in this localization, and both singleton labels still have positive direction. Indeed means is a positive coordinate root; a simple permutation preserves positivity of every positive root except its own, and the exception is exactly . In that exceptional case the tensor is the two-graph union module by the rank-one presentation. For a two-graph union module the same rank-one exact sequence gives the old pair and the translated pair . When these pairs differ, every cross extension splits by [F4], since its hyperplane is invertible; hence the tensor splits into these two pair modules. When the pairs coincide, , the rank-one invariant decomposition gives two shifted copies of the pair module directly. This proves the claimed decomposition for words. For a summand, retain the description as a summand of that direct sum; no localized classification theorem is required.
In a two-graph union ring the explicit presentation is the pullback of its two graph rings with equal values on their common hyperplane. A section supported on the high label has value divisible by on that graph, while the lower-layer quotient is the unrestricted value there. If , a singleton cannot occur in step 2.2, so in the localized word the image of is exactly times the lower layer. Dually the image of the upper layer into is times that quotient. These image descriptions commute with idempotents and hence hold for . In a homogeneous basis of either free target, the image coordinates are therefore divisible by after localization, and hence in itself: is a polynomial UFD and no factor coprime to can remove this divisibility. Doing this for every distinct reflection with shows that both images are contained in times their targets.
The special Hom formula computes first for words by evaluation in step 2.1; for a summand its Hom is the corresponding graded summand, and its layer is the matching idempotent component of the free layer. The same localization image containment and the word's equality descend to that component, so it suffices to compare the word first. In the positive-degree rank convention of this page, the word's special Hom calculation gives . The lower layer has rank ; multiplying by raises degrees by and gives exactly the former polynomial. Since the injection of step 3.1 is a comparison of free graded modules with equal graded rank polynomials, their Hilbert series agree; in each degree it is an injection of finite-dimensional spaces of equal dimension, hence surjective. Thus , and applying its commuting idempotent gives the first equality for . The dual special Hom formula applied to graph targets gives the identical dimension comparison for the second image, proving .
Inverting makes the two image equalities isomorphisms. The first equality and the lower-layer rank just computed give ; the second and the upper-layer rank give . This proves the original two image assertions and both rank formulas without assuming those assertions as facts.
Depends on
- The type-A support filtration multiplicities are intrinsic
- Special Bott–Samelson Hom formula before reflection localization
- Standard graph bimodules, support filtrations and characters
- Bott–Samelson bimodules carry delta and nabla support filtrations
- Type-A graph-bimodule extension vanishing
- Soergel generators and Bott–Samelson products are finite free on both sides
Used by
- Embedding theorem: local intersection forms are isometric to primitive Lefschetz forms Lemma
- Indecomposable labels, characters and filtration ranks agree after real scalar extension Lemma
- Indecomposable type-A Soergel bimodules are classified by their normalized top support Lemma
- Normalized type-A Soergel bimodules are self-dual and have length degree bounds Lemma
- 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)