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.
The standard basis of the type-A Hecke algebra and its multiplication rule
Statement
For let be the product of the along any reduced expression for , and let be the length function. Then:
- is independent of the reduced expression and is an -basis of ;
- when , and when ;
- the element is independent of the reduced word and is an -basis of ; moreover for a reduced word for the product of the normalized generators is triangular with unit diagonal against it, so any family consisting of one such product for each (one reduced word chosen per element) is again an -basis of ; the product itself does depend on the chosen reduced word in general, since for adjacent colours with one has while both products have leading term .
Facts & Assumptions
Given: The -algebra with generators and , the group with its length function , the place permutation action on with simple roots in the length normalization of The standard type-A reflection realization and its polynomial ring and the root criterion if and only if (the balanced roots of that item carry alternating signs and are not used in this item).
is presented by the with , the braid relations and the distant commutations; satisfies and (The type-A Hecke algebra in Soergel normalization).
Any two reduced words for the same are related by the commutations and adjacent braid moves of the presentation (Type-A reduced words and the Coxeter presentation).
The place permutation action exhibits as the reflection group of the root system of type in the length normalization of The standard type-A reflection realization and its polynomial ring: with , and for the standard pairing of that item, so that fixes for and . The positive system is ; the balanced roots of the same item satisfy , so statements about the roots are read in the length normalization here.
For this root system and every and simple reflection one has ", with the minus sign exactly when " (Finite Weyl strong exchange and deletion).
Proof
Since and , by the same inequality for and the involution , we have for every ; define the free -module and, for each , the -linear endomorphism by when and when . In the first case we say is an ascent at and in the second a descent.
: if is an ascent at then and the last step is a descent, so ; if is a descent at then is an ascent at , so and takes the same value.
Distant braid: if then commute and by [F3] they fix each other's simple roots, so if then , and ; hence by [F4] the descent behaviour at in direction agrees with that at in direction , and likewise with exchanged. Consequently in the four cases according to whether are ascents or descents at , the two compositions and expand to the same combination of : both give if both are ascents, if climbs and descends, the mirror expression if descends and climbs, and if both descend.
Adjacent braid: for adjacent one has and by [F3], so writing for an element , appending sends the pair to and appending sends it to ; by [F4] the ascent/descent behaviour along the six elements of the right coset of is therefore determined by the signs of , of and, when these are mixed, of the root (for both positive the sum is positive and for both negative it is negative, since it is a root equal to the image of the positive root , and it lies in the closed positive or negative cone according to the signs of its two summands). Writing , , , , and , both and applied to expand within the span of these six vectors, and evaluating the two expansions in the four cases gives the same result: when ; when ; when and ; and when and . The remaining two cases have , and exchanging the names and carries each of the four computed cases to one of these while swapping the two compositions.
is a right -module: steps 1.1, 2.1, 2.2 and 3.1 verify the defining relations of [F1] for the operators , so is well defined. If is a reduced word for , then each step of its prefix chain is an ascent, so for every , and by [F2] the element is independent of the chosen reduced word (the braid and commutation relations used to pass between reduced words are relations of by [F1]).
Independence of : if in with , then applying the module action of step 4.1 to gives in the free module , so for every .
Multiplication rule and spanning: let . If then has the reduced word (reduced word for ) followed by , so ; if then is a reduced factorisation, so and . Since every element of is a finite -combination of monomials in the , the rule just proved rewrites any such monomial, by induction on the number of letters, as an -combination of the ; hence the span .
Triangular normalized products and the standard normalized basis: put ; since multiplication by the unit is an -linear automorphism and is an -basis by step 5.1, the family is an -basis of as well, and does not depend on the reduced word because does not. For a reduced word for one has , and by step 5.2 each successive multiplication by replaces a combination with by a combination of and with , the coefficient of being and no term of length other than appearing; so with , which is triangularity with unit diagonal against . Consequently a family with one such product for each element , chosen reduced word by chosen reduced word, is an -basis of : its transition matrix to is triangular with unit diagonal, hence invertible over . The product does depend on the chosen reduced word in general: for adjacent colours with the relation of Elias–Williamson's example for the failure of well-definedness rewrites as , while both products have leading term ; this is why the well-defined normalized basis is and not the family of reduced-word products itself. Adding clause 1, is an -basis of and the displayed product rule of clause 2 holds. ∎
Depends on
Used by
- Standard graph bimodules, support filtrations and characters Definition
- Special Bott–Samelson Hom formula before reflection localization Lemma
- The type-A character recursion under simple Soergel tensoring Lemma
- The type-A standard character is multiplicative Lemma
- The diagrammatic character is the split K₀ Hecke isomorphism Theorem
- The split Grothendieck group of the Soergel category is the type-A Hecke algebra Theorem
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
- Elias–Williamson, Soergel Calculus, §2.1, PDF pp.13–15 (standard reference, not scraped)
- Libedinsky, Gentle Introduction to Soergel Bimodules I, Lemma 3.1, PDF p.13 (standard reference, not scraped)