Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Generic Coxeter Hecke Algebras and the Standard Basis — Examples

1 · Prerequisites

2 · Summary

This companion works out the smallest computations of generic-coxeter-hecke-algebras-and-the-standard-basis and the one obstruction that the parameter rule removes. The rank-one example records the complete multiplication in both normalizations: the normalized table generated by Ts2=(v−v−1)Ts+1 and the multiplicative table generated by (Ss−Q)(Ss+1)=0 with Ss=vTs and Q=v2, together with the conversion Ss=vTs and the domain statement for R=Z[v±1].

For S3 the example gives the complete 6×6 left-multiplication table in both normalizations, computed from the length-multiplication rules: the normalized table in Tw and the multiplicative table in Sw=vℓ(w)Tw, with the explicit entry Sw0Sw0 and the sanity checks of the braid identity, associativity and the specialization at v=1.

The third example isolates what unequal parameters can and cannot do in dihedral type. For odd m the two standard reflections are conjugate, and the two length operators fail to commute at the longest alternating element unless the two parameter differences agree: the difference is (ut−us) times an explicit basis vector, and in the universal Laurent ring equality holds exactly for vt=vs or vt=−vs−1. For even m the two generators lie in different odd components, no length configuration obstructs commutation, and the standard basis exists for every pair of independent unit parameters. The last example specializes the generic algebra: at us=1 the quotient is the group ring A[W] with Ts↦s and Tw↦w, on matching bases; for general units the quadratic relation reads Ts2=(us−us−1)Ts+1, so the substitution Ts↦s is an algebra map exactly when us2=1, and both v↦1 and v↦−1 give the group ring.

The examples use the A-page items of generic-coxeter-hecke-algebras-and-the-standard-basis and its prerequisite closure; the specialization also uses the published group-ring construction and basis theorem from the-group-algebra-and-representations. This companion is a dependency leaf: it supplies no theorem to another page, and the two application pages named in the specialization example are reading pointers only, not dependencies.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Unequal parameters in the dihedral cases: the odd-edge obstruction and the even-edge freedom

Example

Let S={s,t} with m:=m(s,t) finite and W the dihedral group of order 2m (Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups, part 3). For the operator test, let R be any commutative ring and let vs,vt∈R× be arbitrary units, without imposing the odd-component rule. Put E:=R(W) with basis (ew) and define Ps,Qt by the length formulas of The commuting left and right length operators and their Hecke relations, using ux:=vx−vx−1 for x∈{s,t}. These formulas define linear maps even when the parameters fail the rule; the commutation test below determines the obstruction. For the generic Hecke algebra itself, the coefficient ring and class-constant parameters are those of Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy.

  1. m odd forces equal differences. Suppose m is odd, so that s and t are conjugate and Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy gives them one parameter. If instead one tries independent parameters us,ut, the commutation check of The commuting left and right length operators and their Hecke relations fails: at the weight w=sts (the case m=3) one has sw=wt=ts and PsQt(ew)−QtPs(ew)=(ut−us) ets, and for general odd m the same computation at the longest element w=stst⋯ of length m gives (ut−us) ewt with wt the alternating element of length m−1; the difference vanishes if and only if us=ut. Since the quadratic relation depends on the parameter only through the difference ux (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, convention (ii)), the condition us=ut means precisely that the quadratic relations of Ts and Tt coincide; for unit-valued parameters in an integral domain its solutions are vt=vs and vt=−vs−1; over an arbitrary commutative ring the exact condition is (vt−vs)(vt+vs−1)=0. The class-constant assignment of the A page satisfies this condition on an odd edge; it is a canonical choice of unit parameters, rather than the only choice with these quadratic relations.

  2. m even allows unequal parameters. Suppose m is even, e.g. m=4 or 6. Then s and t lie in different components of the odd-edge graph and are not conjugate; the assignment vs=u, vt=w with independent units u,w is a legitimate instance of Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, and for every z∈W the two expansions of PsQt(ez) and QtPs(ez) agree term by term with no relation imposed between u and w. Consequently PsQt=QtPs, and the standard basis theorem The standard basis of the generic Hecke algebra and base change applies with distinct parameters u≠w.

  3. Conclusion. Independent parameter differences are allowed across generators that are not conjugate. Within an odd component the differences must agree; distinct unit parameters can still give the same difference, as in vt=−vs−1 over an integral domain. This is the local (rank-two) content of the parameter rule of Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy.

Facts & Assumptions

Given: S={s,t} with m=m(s,t) finite, the dihedral group W of order 2m, the free module E with basis (ew)w∈W and the operators Ps, Qt built from the parameters us, ut.

[F1]

Simple generators are conjugate in W if and only if they are joined by a chain of odd edges; in the generic presentation the units are assigned equally on each conjugacy class, while the quadratic relation depends on vs only through us=vs−vs−1. (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy)

[F2]

The operators Ps,Qt are defined by the two length clauses, so on each basis vector ez they act by the clause determined by ℓ(sz) and ℓ(zt); whenever ℓ(szt)=ℓ(z) and ℓ(sz)=ℓ(zt) one has sz=zt (the two-length lemma). (The commuting left and right length operators and their Hecke relations, Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action)

[F3]

The group on s,t with finite m(s,t)=m is dihedral of order 2m (Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups, part 3). Alternating dihedral words are reduced in the ambient group: for q≤m the alternating word of length q has length exactly q in W. (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness)

[F4]

{Tw:w∈W} is an R-basis of the Hecke algebra whenever the parameters are constant on odd-edge components; in particular the standard basis theorem applies to the two-parameter algebra of the even case m, where s and t lie in different odd components. (The standard basis of the generic Hecke algebra and base change)

[F5]

The integers are a commutative ring (The integers form a commutative ring) with no zero divisors (The integers have no zero divisors; multiplicative cancellation), and 0≠1 by injectivity of the natural-number embedding (The naturals embed in the integers), hence an integral domain. The Laurent polynomial ring in finitely many variables over an integral domain is an integral domain; in an integral domain a product is zero only if one factor is zero. The independent formal variables vs,vt in Z[vs±1,vt±1] do not satisfy either factor equation; the two alternatives describe unit-valued specializations into integral domains. (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields)

Verification

technique · direct
1.1F2algebra

Fix x∈W and expand PsQt(ex) and QtPs(ex) from the two length clauses. The intermediate length ℓ(sxt) differs from both ℓ(sx) and ℓ(xt) by ±1, so only the following length configurations occur: (i) ℓ(sx)=ℓ(xt)=ℓ(x)+1, ℓ(sxt)=ℓ(x)+2; (ii) ℓ(sx)=ℓ(xt)=ℓ(x)−1, ℓ(sxt)=ℓ(x)−2; (iii) ℓ(sx)=ℓ(x)−1, ℓ(xt)=ℓ(x)+1, ℓ(sxt)=ℓ(x); (iv) ℓ(sx)=ℓ(x)+1, ℓ(xt)=ℓ(x)−1, ℓ(sxt)=ℓ(x); (v) ℓ(sx)=ℓ(xt)=ℓ(x)−1, ℓ(sxt)=ℓ(x); (vi) ℓ(sx)=ℓ(xt)=ℓ(x)+1, ℓ(sxt)=ℓ(x). In (i)-(iv) the two expansions agree identically for all values of us,ut; in (v) they are PsQt(ex)=esxt+utesx+usutex and QtPs(ex)=esxt+usext+usutex, and in (vi) they are PsQt(ex)=esxt+usext and QtPs(ex)=esxt+utesx; moreover in (v) and (vi) the hypotheses ℓ(sxt)=ℓ(x) and ℓ(sx)=ℓ(xt) hold, so sx=xt ([F2]).

2.1F1F3F5step 1.1algebra

Let m=2k+1 be odd and let ξ:=(st)ks, the alternating word of length m; by [F3] ℓ(ξ)=m, and sξ=s(st)ks=(ts)k=(st)−k=(st)k+1 while ξt=(st)kst=(st)k+1, the middle identities using (st)−1=ts and the relator (st)m=1 together with m−k=k+1 (the values here are elements of W, not literal words). Put z:=sξ=ξt; then z is the alternating element of length m−1, so ℓ(sξ)=ℓ(ξt)=ℓ(z)=m−1=ℓ(ξ)−1 by [F3], while sξt=zt=(st)k+1t=(st)kstt=(st)ks=ξ gives ℓ(sξt)=ℓ(ξ). This is configuration (v) of 1.1 at the weight ξ, so PsQt(eξ)−QtPs(eξ)=(ut−us)ez with z=ξt the alternating element of length m−1; for m=3 this is the displayed identity with z=ts. The difference vanishes in E if and only if ut−us=0 in the coefficient ring, because (ew) is a basis. Consequently independent parameters with us≠ut violate the commutation of the length operators, while us=ut holds exactly when the quadratic relations of Ts and Tt coincide ([F1]); the identity vt(ut−us)=(vt−vs)(vt+vs−1) shows that us=ut is equivalent to (vt−vs)(vt+vs−1)=0, since vt is a unit. For unit-valued specializations into an integral domain this holds exactly when vt=vs or vt=−vs−1 by [F5]; over a ring with zero divisors only the product-zero condition is asserted.

2.2F1F2F4step 1.1

Let m be even. If some x satisfied ℓ(sxt)=ℓ(x) and ℓ(sx)=ℓ(xt), then sx=xt by [F2], so s=xtx−1 is conjugate to t; but for m even the odd-edge graph on S={s,t} has no edge, so s and t are not conjugate by [F1]. Hence no x realizes configurations (v) or (vi) of 1.1, and only the configurations (i)-(iv) occur, in which the expansions agree identically for arbitrary us,ut; therefore PsQt=QtPs in the two-parameter algebra, and by [F4] the standard basis theorem applies there with independent parameters u≠w.

3.1F1step 2.1step 2.2algebra∎

By 2.1 the parameter difference is forced within the odd component {s,t}: commutation of the length operators requires us=ut, equivalently the two quadratic relations coincide, and over an integral domain these are the assignments vt=vs or vt=−vs−1. The first is class-constant, as in [F1]; the second has the same quadratic relation and hence the same length operators as the first. By 2.2, when s and t lie in different odd components the parameter difference is free and the standard basis exists for any independent units. This is precisely the rank-two content of the parameter rule [F1], and no choice is used: all expansions are computed from the explicit length clauses, and the two equations solved above are quadratic identities in units.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Rank-one Hecke multiplication in both normalizations

Example

Let S={s} with m(s,s)=1, so that W={1,s}≅Z/2 with ℓ(1)=0 and ℓ(s)=1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). The odd-edge graph has one vertex and one component, so R=Z[v±1] with v:=vs is the coefficient ring of Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, and H is the quotient of the free associative R-algebra R⟨Ts⟩ by the single relation (Ts−v)(Ts+v−1)=0.

  1. Normalized table. {1,Ts} is an R-basis of H (The standard basis of the generic Hecke algebra and base change), and 1⋅1=1,1⋅Ts=Ts=Ts⋅1,Ts2=(v−v−1)Ts+1, equivalently (Ts−v)(Ts+v−1)=0. Moreover Ts−1=Ts−(v−v−1), so Ts−1Ts=TsTs−1=1 (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization).

  2. Multiplicative table. Put Q:=v2 and Ss:=vTs. Then {1,Ss} is again an R-basis, Ss is a unit, and 1⋅1=1,1⋅Ss=Ss=Ss⋅1,Ss2=(Q−1)Ss+Q, equivalently (Ss−Q)(Ss+1)=0; indeed Ss−1=Q−1(Ss+1−Q).

  3. Conversion. The two tables are interconverted by Ss=vTs, Ts=v−1Ss: substituting in Ts2=(v−v−1)Ts+1 gives v−2Ss2=(1−v−2)Ss+1, i.e. Ss2=(Q−1)Ss+Q; conversely Ts2=v−2Ss2=v−2((Q−1)Ss+Q)=(v−v−1)Ts+1. In particular R is a domain, both bases persist after every base change by The standard basis of the generic Hecke algebra and base change, part 4, and no choice or finiteness hypothesis beyond ∣S∣=1 is used.

Facts & Assumptions

Given: The one-element generator set S={s}, the group W={1,s}, the Laurent ring R=Z[v±1] and the algebra H=R⟨Ts⟩/((Ts−v)(Ts+v−1)).

[F1]

R=ΛZ,1 is a commutative ring in which v is a unit, H is presented by the generator Ts and the single quadratic relation (Ts−v)(Ts+v−1)=0, and each vs is a unit; there are no braid relations because ∣S∣=1. (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy)

[F2]

For S={s} the presentation of W has the single generator s and the relation s2=1. Its universal property extends any assignment of s to an involution in a group, and ℓ is the least word length. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)

[F3]

{Tw:w∈W} is an R-basis of H, and after base change along any ring homomorphism the specialized family is an R′-basis; in particular T1=1 and {1,Ts} is a basis. (The standard basis of the generic Hecke algebra and base change)

[F4]

Ts is a unit with Ts−1=Ts−(v−v−1); with Qs=vs2 and Ss=vsTs, the element Ss is a unit, Ts=vs−1Ss, and (Ss−Qs)(Ss+1)=0. (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization)

[F5]

The integers are a commutative ring (The integers form a commutative ring) with no zero divisors (The integers have no zero divisors; multiplicative cancellation), and 0≠1 because the natural-number embedding is injective (The naturals embed in the integers). Thus Z is an integral domain, and the Laurent construction over a domain makes ΛZ,1=Z[v±1] an integral domain (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields, part 2).

Verification

technique · direct
1.1F1F2F3F4

By [F2] every word in the single generator reduces using s2=1 to 1 or s. The assignment s↦−1 extends by the universal property to a homomorphism W→{±1}, so s≠1; thus W={1,s} and the reduced expressions are the empty word and the one-letter word s, with lengths 0 and 1; by [F3] the family {T1,Ts} is an R-basis of H and T1=1 is the empty product. The unit axioms give 1⋅Ts=Ts=Ts⋅1, and expanding (Ts−v)(Ts+v−1)=0 from [F1] gives Ts2=(v−v−1)Ts+1; the inverse formula Ts−1=Ts−(v−v−1) and Ts−1Ts=TsTs−1=1 are [F4]. This is the normalized table of part 1.

1.2F1F3F4algebra

Put Q:=v2 and Ss:=vTs. Since v is a unit of R ([F1]) and multiplication by it is an invertible R-linear map, {1,Ss} is again an R-basis of H ([F3]); Ss is a unit with Ss−1=v−1Ts−1 as a product of units ([F4]). Multiplying Ts2=(v−v−1)Ts+1 by v2 gives Ss2=v(v−v−1)Ss+v2=(Q−1)Ss+Q, because v(v−v−1)=v2−1=Q−1; equivalently (Ss−Q)(Ss+1)=Ss2+(1−Q)Ss−Q=0. Finally Ss(Ss+1−Q)=Ss2+Ss−QSs=((Q−1)Ss+Q)+Ss−QSs=Q, so Ss−1=Q−1(Ss+1−Q). This is the multiplicative table of part 2.

2.1F3F4F5step 1.1step 1.2∎

The two tables are interconverted by Ss=vTs and Ts=v−1Ss ([F4]). Substituting Ts=v−1Ss into Ts2=(v−v−1)Ts+1 gives v−2Ss2=(v−v−1)v−1Ss+1, and multiplying by the unit v2 gives Ss2=v(v−v−1)Ss+v2=(Q−1)Ss+Q; conversely, substituting Ss=vTs into Ss2=(Q−1)Ss+Q and multiplying by v−2 returns Ts2=(v−v−1)Ts+1. The ring R=Z[v±1] is a domain by [F5], both bases persist under every base change by [F3], and no choice is used: all identities are explicit polynomial identities in v involving no selection. This completes the conversion of part 3 and with 1.1 and 1.2 all three parts of the example.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The complete S3 multiplication table in both normalizations

Example

Let S={s,t} with m(s,t)=3, so that W=⟨s,t∣s2=t2=(st)3=1⟩≅S3 with elements 1,s,t,st,ts,w0:=sts=tst of lengths 0,1,1,2,2,3 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups; the identification with S3 is the type-A clause of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification). The odd-edge graph is connected, so R=Z[v±1], vs=vt=v, and H is free with basis {Tw} (The standard basis of the generic Hecke algebra and base change).

  1. Normalized table. With u:=v−v−1 and the columns indexed by 1,s,t,st,ts,w0, the complete 6×6 left-multiplication table of H is Tx\TyT1TsTtTstTtsTw0T1T1TsTtTstTtsTw0TsTsuTs+T1TstTt+uTstTw0Tts+uTw0TtTtTtsuTt+T1Tw0Ts+uTtsTst+uTw0TstTstTw0Ts+uTstTts+uTw0T1+uTs+uTw0Tt+uTst+uTts+u2Tw0TtsTtsTt+uTtsTw0T1+uTt+uTw0Tst+uTw0Ts+uTts+uTst+u2Tw0Tw0Tw0Tst+uTw0Tts+uTw0Ts+uTst+uTts+u2Tw0Tt+uTts+uTst+u2Tw0T1+u(Ts+Tt)+u2(Tst+Tts)+(u3+u)Tw0 In particular TsTt=Tst, TtTs=Tts, the braid identity TsTtTs=Tw0=TtTsTt holds, and Ts2=uTs+T1, Tt2=uTt+T1 (Reduced-word independence of T_w and the length-multiplication rules; the table is a finite computation from those rules).

  2. Multiplicative table. Put Q:=v2, Ss:=vTs, St:=vTt and Sw:=Ss1⋯Ssk=vℓ(w)Tw for a reduced expression w=s1⋯sk (well defined, since the S's satisfy the braid relations). Then SsSw={Ssw,ℓ(sw)=ℓ(w)+1,Q Ssw+(Q−1)Sw,ℓ(sw)=ℓ(w)−1, and the same rule holds with St. With a:=Q−1, the complete multiplicative table is Sx\SyS1SsStSstStsSw0S1S1SsStSstStsSw0SsSsQS1+aSsSstQSt+aSstSw0QSts+aSw0StStStsQS1+aStSw0QSs+aStsQSst+aSw0SstSstSw0QSs+aSstQSts+aSw0Q2S1+QaSs+aSw0Q2St+Qa(Sst+Sts)+a2Sw0StsStsQSt+aStsSw0Q2S1+QaSt+aSw0QSst+aSw0Q2Ss+Qa(Sts+Sst)+a2Sw0Sw0Sw0QSst+aSw0QSts+aSw0Q2Ss+Qa(Sst+Sts)+a2Sw0Q2St+Qa(Sts+Sst)+a2Sw0Q3S1+Q2a(Ss+St)+Qa2(Sst+Sts)+(a3+Qa)Sw0 The rows for Sst, Sts and Sw0 are obtained by composing the generator rows; in expanded Q-notation, Sw0Sw0=Q3S1+(Q3−Q2)(Ss+St)+(Q3−2Q2+Q)(Sst+Sts)+(Q3−2Q2+2Q−1)Sw0 (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization, part 4). The conversion between the two tables is Tw=v−ℓ(w)Sw; it maps the normalized table above to the multiplicative one.

  3. Sanity checks. Both tables satisfy the braid identity and are associative, because they are the tables of the associative algebras H and its rescaling; the substitution v=1 (so Q=1) turns them into the multiplication table of the group ring Z[S3] (Specialization of the generic Hecke algebra to the group ring).

Facts & Assumptions

Given: The generators s,t with m(s,t)=3, the group W≅S3 with its six elements and lengths, the ring R=Z[v±1] and the algebra H with standard basis {Tw}.

[F1]

R=ΛZ,1, H is the quotient of the free associative R-algebra on Ts,Tt by the quadratic relations and the single braid relation TsTtTs=TtTsTt, and v is a unit. (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy)

[F2]

For every reduced expression w=s1⋯sk the element Tw=Ts1⋯Tsk is well defined, and TsTw=Tsw if ℓ(sw)=ℓ(w)+1 while TsTw=Tsw+(v−v−1)Tw if ℓ(sw)=ℓ(w)−1; the analogous right-multiplication rule holds. (Reduced-word independence of T_w and the length-multiplication rules)

[F3]

{Tw:w∈W} is an R-basis of H. (The standard basis of the generic Hecke algebra and base change)

[F4]

Ts is a unit with Ts−1=Ts−(v−v−1); for Qs=v2 and Ss=vTs one has Ts=v−1Ss, Ss is a unit, and (Ss−Qs)(Ss+1)=0. (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization)

[F5]

W≅S3 via s↦(12), t↦(23); its six elements 1,s,t,st,ts,w0=sts=tst have lengths 0,1,1,2,2,3, and ℓ agrees with the inversion number of the corresponding permutation. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification)

Verification

technique · direct
1.1F1F3F5

The six elements of W and their lengths are those recorded in [F5], and the odd-edge graph on S={s,t} (the single edge {s,t}, since m(s,t)=3 is odd) is connected, so c=1, R=Z[v±1] and vs=vt=v by the parameter rule of [F1]. By [F3] the family {Tw:w∈W} is an R-basis of H, so all tables below record well-defined elements.

1.2F2F3algebra

Expansion from the rules of [F2] gives the normalized table of part 1. For example TsTst: s⋅(st)=t has length 1<2, so the entry is Tt+uTst; TsTts: s⋅(ts)=w0 has length 3>2, so the entry is Tw0; Tw0Ts: w0s=st has length 2<3, so the entry is Tst+uTw0; TstTw0: (st)w0=t has length 1<2, so TstTw0=Ts(TtTw0)=Ts(Tst+uTw0)=TsTst+uTsTw0=(Tt+uTst)+u(Tts+uTw0)=Tt+uTst+uTts+u2Tw0; and Tw0Tw0=(Tw0Tst)Ts=(Ts+uTst+uTts+u2Tw0)Ts=T1+u(Ts+Tt)+u2(Tst+Tts)+(u3+u)Tw0, using TstTs=Tw0, TtsTs=Tt+uTts, Tw0Ts=Tst+uTw0 and Ts2=T1+uTs. The remaining entries are computed in the same way by left multiplication by a reduced expression of the row element; the displayed table records all 36 products.

2.1F2F4step 1.1step 1.2algebra

Multiplying the rules of 1.2 by vℓ(w)+1 gives the multiplicative rule SsSw=Ssw when ℓ(sw)=ℓ(w)+1 and SsSw=QSsw+(Q−1)Sw when ℓ(sw)=ℓ(w)−1, and similarly for St: for instance SsSs=v2Ts2=v2(uTs+T1)=v2u v−1Ss+QS1=(Q−1)Ss+QS1 because vu=v2−1=Q−1; and SsSw0=v4TsTw0=v4(Tts+uTw0)=QSts+(Q−1)Sw0. The Ss- and St-rows are the translations of the corresponding rows of the normalized table; since Sst=SsSt, Sts=StSs and Sw0=SsSts (each Sw is the product of the S's along a reduced expression), associativity of H composes the generator rows into the other displayed rows, with a=Q−1; and converting the entry Tw0Tw0=T1+u(Ts+Tt)+u2(Tst+Tts)+(u3+u)Tw0 with Sw=vℓ(w)Tw gives the stated Sw0Sw0.

3.1F1F4step 1.2step 2.1∎

The two tables are converted into one another by Tw=v−ℓ(w)Sw, which is Ts=v−1Ss on generators and extends to products; it maps each entry of the normalized table to the corresponding entry of the multiplicative table by the computation of 2.1. Both tables satisfy the braid identity TsTtTs=Tw0=TtTsTt because it is the defining braid relation of H ([F1]), and both are associative because H is a quotient of an associative algebra; the substitution v=1 (so u=0 and Q=1) turns the normalized table into the group-ring table of Z[S3], as recorded in Specialization of the generic Hecke algebra to the group ring, and the multiplicative table into the same table since Sw=Tw and Q=1 there. All computations are over Z[v±1] and use no choice.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Specialization of the generic Hecke algebra to the group ring

Example

Let (S,m), W, R, vs, H, Ts be as in Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy and let A be a commutative ring with units us∈A× constant on the classes [s], inducing φ:R→A with vs↦us (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields, part 2). Write HA:=A⊗RH for the specialization.

  1. The specialization at us=1. If us=1 for all s, then there is an isomorphism of A-algebras HA⟶A[W],Ts⟼s,Tw⟼w, where A[W] is the group ring (The group ring R[G] of finitely supported formal R-linear combinations of group elements); it is an isomorphism of free A-modules on the specialized standard basis {1⊗Tw} and the group basis {w} (The standard basis of the generic Hecke algebra and base change, part 4).

  2. Why the relation specializes. In A[W] one has s2=1, so the specialized quadratic relation (s−1)(s+1)=s2−1=0 holds, and the braid relations are the defining relations of W; conversely, sending Ts↦s kills the specialized relations, so it factors through HA by the universal property. This is the case Q=1 of the normalization (Ss−Qs)(Ss+1)=0 of The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization, part 4.

  3. Other specializations. For arbitrary units us the specialization is still free with basis (1⊗Tw) (The standard basis of the generic Hecke algebra and base change, part 4), but the quadratic relation reads Ts2=(us−us−1)Ts+1, so Ts↦s is an algebra map only when us2=1 in A, i.e. us−us−1=0 (over a field this means us=±1); in particular v↦1 and v↦−1 both give the group ring, since u−u−1=0 in either case. Applications: the specialization v=1 is the bridge from this generic algebra to the type-A principal-series page principal-series-representations-of-gl-n-over-a-finite-field and to the Hecke-Markov trace page hecke-markov-traces-and-polynomial-link-invariants, both of which work in the multiplicative normalization of The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization.

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), the group W, the parameters R, vs, the algebra H with standard basis {Tw}, a commutative ring A with units us and the induced homomorphism φ:R→A.

[F1]

H is the quotient of the free associative R-algebra on (Ts)s∈S by the relations (Q) and (B), and for every unital associative R-algebra B and every family (ts) in B satisfying (Q) and (B) there is a unique unital R-algebra homomorphism H→B with Ts↦ts; the images of the Ts, together with the coefficient image of R, generate H as a ring. (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy)

[F2]

{Tw:w∈W} is an R-basis of H, and for every ring homomorphism R→R′ the scalar extension R′⊗RH is free with basis (1⊗Tw)w∈W; there is no flatness or torsion hypothesis. (The standard basis of the generic Hecke algebra and base change)

[F3]

Each Ts is a unit, Ts=vs−1Ss with Ss=vsTs, and (Ss−Qs)(Ss+1)=0 with Qs=vs2. (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization)

[F4]

The scalar extension of a presented algebra is presented by the images of the relations: R′⊗R(R⟨X⟩/I)≅(R′⊗RR⟨X⟩)/im⁡(R′⊗RI), with no flatness or freeness of R′ over R; the scalar extension of a free module with basis (ai) is free with basis (1⊗ai). (Presentation base change and transport of explicit bases to commutative specializations)

[F5]

Applying the Laurent universal property over Z, a choice of units u1,…,uc in the commutative Z-algebra A extends uniquely to a Z-algebra homomorphism φ:R=ΛZ,c→A with vi↦ui; equivalently, φ(vs)=us when the units us are constant on the classes [s]. (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields, part 2)

[F6]

The group ring A[W] carries a unique multiplication with [w][w′]=[ww′], making it a unital A-algebra with A-basis {[w]:w∈W} whose identity is [1] and whose every basis element [w] is a unit with inverse [w−1]. (The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G], The group ring R[G] of finitely supported formal R-linear combinations of group elements)

[F7]

W is presented by the generators s∈S and the relators s2 and (st)m(s,t) (s≠t, m(s,t)<∞); a map from S into a group that kills every relator extends uniquely to a group homomorphism W→G. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)

[F8]

For a commutative ring A and a set X, the free associative A-algebra A⟨X⟩ has the universal property that every map X→B into a unital A-algebra B extends uniquely to a unital A-algebra homomorphism A⟨X⟩→B; and a unital A-algebra homomorphism out of A⟨X⟩ that kills a set E⊆A⟨X⟩ factors uniquely through the quotient A⟨X⟩/(E), the presented A-algebra with generators X and relations E. (The free associative R-algebra on a set and descent of relations)

Verification

technique · direct
1.1F1F4F6F7F8

By [F4] the specialization HA=A⊗RH is the quotient of the free associative A-algebra on (Ts)s∈S by the images under φ of the relations (Q) and (B) of [F1]. When us=1 for all s, those images are Ts2−1 and the braid relations. The assignment Ts↦s extends uniquely to a unital A-algebra homomorphism from the free algebra to A[W] ([F8], first assertion); it kills Ts2−1 because s2=1 in W, and it kills each braid relation because the defining relator (st)m(s,t)=1 holds in W ([F7]). By the quotient universal property ([F8], second assertion) it therefore factors uniquely through HA, giving a unital A-algebra homomorphism Φ:HA→A[W] with Φ(Ts)=s.

1.2F3F4F6F7

Conversely, in HA the images of the relations give Ts2=1 (the image of (Q) at us=1) and the braid relations, and each Ts is a unit ([F3]). For s≠t with m:=m(s,t)<∞ put a:=Ts, b:=Tt and x:=ab; then a2=b2=1, so x−1=ba and x−k=(ba)k for every k≥0. The braid relation says that the two alternating products of m factors coincide: if m=2k it reads xk=x−k, whence x2k=1, while if m=2k+1 it reads xka=x−kb, and multiplying on the right by b=b−1 gives xk+1=x−k, whence x2k+1=1. Thus (TsTt)m(s,t)=xm=1; with Ts2=1 this shows that the assignment s↦Ts kills every defining relator of W ([F7]), so it extends to a group homomorphism φ:W→HA× with φ(w)=Tw for every w∈W (the product along a reduced expression). Since ([w])w∈W is an A-basis of A[W] and [w][w′]=[ww′] ([F6]), the formula Ψ(∑waw[w]):=∑wawφ(w) defines a unital A-algebra homomorphism Ψ:A[W]→HA with Ψ(w)=Tw: it is A-linear by construction, multiplicativity reduces on basis elements to φ(ww′)=φ(w)φ(w′), and Ψ([1])=φ(1)=1.

2.1F1F2F6step 1.1step 1.2

The two maps are mutually inverse: Φ(Ψ(s))=Φ(Ts)=s for every s∈S and Ψ(Φ(Ts))=Ψ(s)=Ts, and both composites fix A because the maps are A-linear; they fix every Tw since each is a product of the Ts, and every group basis element w since each is a product of the generators s. The A-bases ([F2], [F6]) therefore make the composites the respective identities. Hence Φ is an isomorphism of A-algebras. On bases, Φ(Tw)=s1⋯sk=w for a reduced expression w=s1⋯sk by multiplicativity, so Φ carries the A-basis (1⊗Tw) of HA ([F2]) to the A-basis (w) of A[W] ([F6]) and is an isomorphism of free A-modules.

2.2F2F4F6step 1.1

For arbitrary units us, the image of (Q) under φ reads Ts2−(us−us−1)Ts−1=0 in HA ([F4]), and HA is free with basis (1⊗Tw) ([F2]). If an A-algebra homomorphism HA→A[W] with Ts↦s existed, applying it to that relation would give 0=s2−(us−us−1)s−1=−(us−us−1)s in A[W]; since the elements w form an A-basis of A[W] ([F6]), this forces us−us−1=0, i.e. us2=1, and over a field us=±1. Conversely, if every us2=1, all specialized quadratics are Ts2−1, so the constructions of 1.1–2.1 apply and give the same basis-preserving isomorphism HA≅A[W]. Consequently, when R=Z[v±1] is the one-component coefficient ring, the specializations v↦1 and v↦−1 both satisfy u−u−1=0; for u=±1 the image of (Q) is Ts2−1 in either case, so the construction of 1.1-2.1 applies verbatim and both give the group ring, whereas any specialization to a unit with us2≠1 admits no such map Ts↦s: the standard basis (1⊗Tw) still exists by [F2] but the quadratic relation is not the group relation.

3.1F2F3F5step 1.1step 1.2step 2.1step 2.2∎

Assembly: part 1 is steps 1.1, 1.2 and 2.1, the specialization mechanism of part 2 is steps 1.1 and 2.2 (the case Qs=1 of the normalization [F3]), and part 3 is step 2.2 together with the base-change freeness of [F2]. No choice is used: the coefficient homomorphism is unique by [F5], both maps are defined on explicit generators, and no selection occurs. The two application pages named in the statement are reading pointers only; no item of this pair depends on them.

Sources