Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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 w∈Sn let Tw be the product of the Ti along any reduced expression for w, and let ℓ be the length function. Then:

  1. Tw is independent of the reduced expression and {Tw:w∈Sn} is an A-basis of Hn;
  2. TwTi=Twsi when ℓ(wsi)=ℓ(w)+1, and TwTi=(q−1)Tw+qTwsi when ℓ(wsi)=ℓ(w)−1;
  3. the element T~w:=vℓ(w)Tw is independent of the reduced word and {T~w:w∈Sn} is an A-basis of Hn; moreover for a reduced word i1…ik for w the product of the normalized generators is triangular with unit diagonal against it, Hi1⋯Hik=T~w+∑ℓ(u)<kauT~u(au∈A), so any family consisting of one such product for each w (one reduced word chosen per element) is again an A-basis of Hn; the product itself does depend on the chosen reduced word in general, since for adjacent colours with mst=3 one has HsHtHs−HtHsHt=Hs−Ht≠0 while both products have leading term T~sts.

Facts & Assumptions

Given: The A-algebra Hn with generators Ti and Hi=v(Ti+1), the group Sn with its length function ℓ, the place permutation action on h with simple roots βi=xi−xi+1 in the length normalization of The standard type-A reflection realization and its polynomial ring and the root criterion ℓ(xsi)=ℓ(x)−1 if and only if xβi<0 (the balanced roots αi=εiβi of that item carry alternating signs and are not used in this item).

[F1]

Hn is presented by the Ti with Ti2=(q−1)Ti+q, the braid relations and the distant commutations; Hi=vTi+v satisfies Hi2=(v+v−1)Hi and Ti=v−1Hi−1 (The type-A Hecke algebra in Soergel normalization).

[F2]

Any two reduced words for the same w∈Sn are related by the commutations and adjacent braid moves of the presentation (Type-A reduced words and the Coxeter presentation).

[F3]

The place permutation action exhibits Sn as the reflection group of the root system of type An−1 in the length normalization βi=xi−xi+1 of The standard type-A reflection realization and its polynomial ring: with (xa,xb)=δab, βi∨=βi and siβt=βt−(βt,βi)βi for the standard pairing (xa,xb)=δab of that item, so that si fixes βt for ∣i−t∣>1 and siβi±1=βi±1+βi. The positive system is Φ+={βab=xa−xb:a<b}; the balanced roots αi of the same item satisfy αi=εiβi, so statements about the roots are read in the length normalization here.

[F4]

For this root system and every x∈Sn and simple reflection si one has "ℓ(xsi)=ℓ(x)±1, with the minus sign exactly when xβi<0" (Finite Weyl strong exchange and deletion).

Proof

1.1

Since xsisi=x and ℓ(xsi)≤ℓ(x)+1, ℓ(x)≤ℓ(xsi)+1 by the same inequality for xsi and the involution si2=1, we have ℓ(xsi)=ℓ(x)±1 for every x∈Sn; define the free A-module E:=⨁w∈SnAew and, for each i, the A-linear endomorphism ρi by ewρi:=ewsi when ℓ(wsi)=ℓ(w)+1 and ewρi:=(q−1)ew+qewsi when ℓ(wsi)=ℓ(w)−1. In the first case we say i is an ascent at w and in the second a descent.

F1F4
2.1

ρi2=(q−1)ρi+q: if i is an ascent at w then w=(wsi)si and the last step is a descent, so ewρi2=ewsiρi=(q−1)ewsi+qew=(q−1)ewρi+qew; if i is a descent at w then i is an ascent at wsi, so ewρi2=(q−1)ewρi+qew(sisi)=(q−1)((q−1)ew+qewsi)+qew and (q−1)ewρi+qew takes the same value.

step 1.1
2.2

Distant braid: if ∣i−j∣>1 then si,sj commute and by [F3] they fix each other's simple roots, so if γi:=xβi,γj:=xβj then (xsi)βj=γj, (xsj)βi=γi and (xsisj)βi=γi,(xsisj)βj=γj; hence by [F4] the descent behaviour at xsi in direction j agrees with that at x in direction j, and likewise with i,j exchanged. Consequently in the four cases according to whether i,j are ascents or descents at x, the two compositions ρiρj and ρjρi expand to the same combination of ex,exsi,exsj,exsisj: both give exsisj if both are ascents, (q−1)exsi+qexsisj if i climbs and j descends, the mirror expression (q−1)exsj+qexsisj if i descends and j climbs, and (q−1)2ex+q(q−1)exsi+q(q−1)exsj+q2exsisj if both descend.

F3F4step 1.1
3.1

Adjacent braid: for adjacent i,j one has siβj=βi+βj and sjβi=βi+βj by [F3], so writing γi:=xβi,γj:=xβj for an element x, appending si sends the pair to (−γi,γi+γj) and appending sj sends it to (γi+γj,−γj); by [F4] the ascent/descent behaviour along the six elements x,xsi,xsj,xsisj,xsjsi,xsisjsi=xsjsisj of the right coset of ⟨si,sj⟩ is therefore determined by the signs of γi, of γj and, when these are mixed, of the root x(βi+βj)=γi+γj (for γi,γj 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 βi+βj, and it lies in the closed positive or negative cone according to the signs of its two summands). Writing ve=ex, vi=exsi, vj=exsj, vij=exsisj, vji=exsjsi and viji=exsisjsi, both ρiρjρi and ρjρiρj applied to ve expand within the span of these six vectors, and evaluating the two expansions in the four cases gives the same result: viji when γi>0<γj; [(q−1)3+q(q−1)]ve+q(q−1)2(vi+vj)+q2(q−1)(vij+vji)+q3viji when γi<0>γj; (q−1)vij+qviji when γi>0>γj and γi+γj>0; and (q−1)2vi+q(q−1)ve+q(q−1)vij+q2viji when γi>0>γj and γi+γj<0. The remaining two cases have γj>0>γi, and exchanging the names i and j carries each of the four computed cases to one of these while swapping the two compositions.

F3F4step 1.1step 2.2
4.1

E is a right Hn-module: steps 1.1, 2.1, 2.2 and 3.1 verify the defining relations of [F1] for the operators ρi, so ew(Ti1⋯Tir):=ewρi1⋯ρir is well defined. If i1…ik is a reduced word for w, then each step of its prefix chain is an ascent, so eeTi1⋯Tik=ew for every w, and by [F2] the element Tw:=Ti1⋯Tik is independent of the chosen reduced word (the braid and commutation relations used to pass between reduced words are relations of Hn by [F1]).

F1F2step 1.1step 2.1step 2.2step 3.1
5.1

Independence of {Tw}: if ∑wawTw=0 in Hn with aw∈A, then applying the module action of step 4.1 to ee gives ∑wawew=0 in the free module E, so aw=0 for every w.

step 4.1
5.2

Multiplication rule and spanning: let u:=wsi. If ℓ(wsi)=ℓ(w)+1 then wsi has the reduced word (reduced word for w) followed by i, so TwTi=Twsi; if ℓ(wsi)=ℓ(w)−1 then w=(wsi)si is a reduced factorisation, so Tw=TwsiTi and TwTi=TwsiTi2=(q−1)TwsiTi+qTwsi=(q−1)Tw+qTwsi. Since every element of Hn is a finite A-combination of monomials in the Ti, the rule just proved rewrites any such monomial, by induction on the number of letters, as an A-combination of the Tw; hence the Tw span Hn.

F1step 4.1
6.1

Triangular normalized products and the standard normalized basis: put T~w:=vℓ(w)Tw; since multiplication by the unit vℓ(w) is an A-linear automorphism and {Tw} is an A-basis by step 5.1, the family {T~w} is an A-basis of Hn as well, and T~w does not depend on the reduced word because Tw does not. For a reduced word i1…ik for w one has Hi1⋯Hik=∏r(vTir+v), and by step 5.2 each successive multiplication by vTir+v replaces a combination ∑uauTu with ℓ(u)≤r−1 by a combination of Tu and Tusir with ℓ(usir)≤ℓ(u)+1≤r, the coefficient of Tw being vk≠0 and no term of length k other than Tw appearing; so Hi1⋯Hik=vkTw+∑ℓ(u)<kauTu=T~w+∑ℓ(u)<kauT~u with au∈A, which is triangularity with unit diagonal against {T~u}. Consequently a family with one such product for each element w, chosen reduced word by chosen reduced word, is an A-basis of Hn: its transition matrix to {T~w} is triangular with unit diagonal, hence invertible over A. The product does depend on the chosen reduced word in general: for adjacent colours s,t with mst=3 the relation HsHtHs−Hs=HtHsHt−Ht of Elias–Williamson's example for the failure of well-definedness rewrites as HsHtHs−HtHsHt=Hs−Ht≠0, while both products have leading term T~sts; this is why the well-defined normalized basis is {T~w} and not the family of reduced-word products itself. Adding clause 1, {Tw} is an A-basis of Hn and the displayed product rule of clause 2 holds. ∎

F1step 5.1step 5.2

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