Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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 reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization

Statement

Let R, vs, H, Ts be as in Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, let (S,m), W, ℓ be as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, and let {Tw:w∈W} be the standard basis of H (The standard basis of the generic Hecke algebra and base change).

  1. Reversal anti-involution. There is a unique R-algebra anti-automorphism #:H→H with Ts#=Ts for all s∈S; it is an involution and satisfies Tw#=Tw−1 for all w∈W.
  2. Invertibility. Each generator is a unit: Ts−1=Ts−(vs−vs−1), and each Tw=Ts1⋯Tsk is a unit with Tw−1=Tsk−1⋯Ts1−1.
  3. Bar operator. The assignment vi↦vi−1 defines an involutive ring automorphism   ˉ:R→R (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields, part 2); there is a unique ring homomorphism   ˉ:H→H which is semilinear over it (i.e. rh‾=rˉ hˉ) and satisfies Ts‾=Ts−1 for all s∈S. It is involutive, and Tw‾=Tw−1−1 for all w∈W.
  4. Multiplicative normalization. Put Qs:=vs2∈R and Ss:=vsTs∈H. Then Ss is a unit and (Ss−Qs)(Ss+1)=0,equivalentlySs2=(Qs−1)Ss+Qs, and Ts=vs−1Ss. If vs=v for all s∈S (one odd component) and Q:=v2, both relations read (Ss−Q)(Ss+1)=0 for every s. This is the multiplicative (or S-) normalization used by the type-A, affine and cyclotomic applications, and it must be matched through the conversion Ts=vs−1Ss before those pages are compared.

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), the group W with length ℓ, the coefficient ring R with parameters vs, and the algebra H with standard basis {Tw}.

[F1]

F=R⟨Ts:s∈S⟩ is free as an R-module on the finite words in the generators, with product concatenation of words; H=F/I where I is the two-sided ideal generated by the relations (Q) and (B), and membership in I is preserved by left and right multiplication. (The free associative R-algebra on a set and descent of relations)

[F2]

H is generated as a ring by the images Ts together with the coefficients from R, the quadratic relation reads Ts2−(vs−vs−1)Ts−1=0, the braid relation identifies the two alternating products of m(s,t) factors for s≠t with m(s,t)<∞, and every vs is a unit of R. (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy)

[F3]

For each w∈W with reduced expression w=s1⋯sk one has the well-defined element Tw=Ts1⋯Tsk, and {Tw:w∈W} is an R-basis of H. (The standard basis of the generic Hecke algebra and base change)

[F4]

ℓ(w) is the least length of a word in S representing w, and a word of that length is a reduced expression. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)

[F5]

The Laurent ring R=ΛZ,c of Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields, part 2 has the universal property that a choice of units u1,…,uc in a commutative ring A extends uniquely to a ring homomorphism R→A with vi↦ui; applied with A=R and ui=vi, this says the identity is the only ring endomorphism of R fixing every vi. (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields)

Proof

Given: A finite Coxeter matrix (S,m), the group W with length ℓ, the parameters R, vs, and the algebra H with standard basis {Tw}.

1.1F1F2F3F4

Define #F:F→F by R-linear extension of word reversal, (Ts1⋯Tsk)#=Tsk⋯Ts1 and the empty word fixed. Reversal is an involutive anti-automorphism of the word monoid, so #F is an R-linear involutive anti-automorphism of F ([F1]). The ideal I is preserved: the quadratic generator Ts2−(vs−vs−1)Ts−1 is a polynomial in Ts with central coefficients and is fixed by #F, and for s≠t with m:=m(s,t)<∞ the alternating products a1=TsTtTs⋯ and a2=TtTsTt⋯ of m factors are each reversed into one of the two: the alternating word s t s⋯ of length m is a palindrome exactly when m is odd, so a1#=a1, a2#=a2 for odd m and a1#=a2, a2#=a1 for even m, and in both cases (a1−a2)#=±(a1−a2); since the two-sided ideal generated by these elements consists of finite sums ∑icixigiyi with gi among the generators ([F1]) and #F reverses products, #F maps each such sum to a sum of the same shape (a generator gi being replaced by ± itself), so #F(I)⊆I. Therefore #(x+I):=#F(x)+I is a well-defined R-linear anti-automorphism of H with #2=id: if x−y∈I then #Fx−#Fy=#F(x−y)∈I. It is determined by Ts#=Ts because H is generated as a ring by the Ts and the coefficients ([F2]), and for a reduced expression w=s1⋯sk one has #(Tw)=Tsk⋯Ts1=Tsk⋯s1=Tw−1, since reversing a word of length k representing w represents w−1, whence ℓ(w−1)=ℓ(w)=k by [F4] and the reversed word is a reduced expression of w−1 ([F3]).

1.2F2algebra

By the quadratic relation of [F2], Ts2−(vs−vs−1)Ts−1=0 in H, so Ts(Ts−(vs−vs−1))=1=(Ts−(vs−vs−1))Ts and Ts−1=Ts−(vs−vs−1). Inverses multiply in reverse order, so for Tw=Ts1⋯Tsk one has Tw−1=Tsk−1⋯Ts1−1, and Tw is a unit.

1.3F5

The assignment vi↦vi−1 gives units of R, so by the universal property of the Laurent ring it extends to a unique ring endomorphism σ:R→R with σ(vi)=vi−1 ([F5]); note that σ is not R-linear (it does not fix the coefficients), only a ring endomorphism, which is all that is used below. Since σ2 is again a ring endomorphism fixing every vi, uniqueness of the extension identifies σ2=id, so σ is an involution.

2.1F1F2F3step 1.2step 1.3

Extend σ to   ˉ on the free algebra: define   ˉ:F→F on words by Ts1⋯Tsk‾:=Tˉs1⋯Tˉsk with Tˉs:=Ts−(vs−vs−1), and on ∑wrww by ∑wσ(rw)w‾; this is the unique σ-semilinear ring endomorphism of F with those generator images, because F is free on the words ([F1]). It maps I into itself: the quadratic generator satisfies (Ts−vs)(Ts+vs−1)‾=(Tˉs−vs−1)(Tˉs+vs)=(Ts−vs)(Ts+vs−1)∈I, using σ(vs)=vs−1 and σ(vs−1)=vs; and for the braid generator, aˉ1=Ts−1Tt−1⋯ equals, by step 1.2, the inverse of the product along the reversed alternating word, and the reversed alternating word has the same length m and alternates between s and t, so its product is the same element A:=a1=a2 of H by relation (B) ([F2]); hence aˉ1=A−1=aˉ2 and (a1−a2)‾∈I; the general element of I is a finite sum as above and   ˉ is additive, so   ˉ(I)⊆I. Hence   ˉ(x+I):=xˉ+I is well defined on H, is a σ-semilinear ring endomorphism, and satisfies Ts‾=Ts−(vs−vs−1)=Ts−1 by step 1.2. It is involutive:   ˉ2 is σ2-semilinear, hence R-linear, and ring-endomorphic, it fixes R pointwise because σ2=id (step 1.3), and it fixes each generator because   ˉ2(Ts)=  ˉ(Ts−1)=  ˉ(Ts)−1=(Ts−1)−1=Ts; since H is generated by these ([F2]),   ˉ2=id. Finally, multiplicativity of   ˉ gives Tw‾=Ts1‾⋯Tsk‾=Ts1−1⋯Tsk−1=(Tsk⋯Ts1)−1=Tw−1−1 for a reduced expression, using step 1.2 and Tsk⋯s1=Tw−1 ([F3]).

2.2F2step 1.2algebra

Put Ss:=vsTs and Qs:=vs2. Substituting Ts=vs−1Ss in (Ts−vs)(Ts+vs−1)=0 ([F2]) gives vs−1(Ss−Qs)⋅vs−1(Ss+1)=0, and multiplying by the unit vs2 gives (Ss−Qs)(Ss+1)=0, equivalently Ss2=(Qs−1)Ss+Qs. Since vs is a unit of R ([F2]) and Ts is a unit with inverse Ts−(vs−vs−1) (step 1.2), also Ss is a unit with Ss−1=vs−1(Ts−(vs−vs−1)), and Ts=vs−1Ss by construction. If vs=v for every s then Qs=Q=v2 for every s, so the displayed relation is uniform in s. No other identification between the parameters is made.

3.1step 1.1step 1.2step 1.3step 2.1step 2.2∎

Assembly: the reversal anti-involution of part 1 is step 1.1, the invertibility statement of part 2 is step 1.2, the bar operator of part 3 is steps 1.3 and 2.1, and the normalization of part 4 is step 2.2. No choice is used: word reversal and the monomial substitution vi↦vi−1 are explicit, and the standard basis is used only to name the elements Tw, never to select them.

Depends on

Used by

Dependency tree · two levels

61 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