Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 star anti-automorphism of the type-A Hecke algebra

Statement

Let R be a commutative ring, q∈R×, and let H=HR,q(Sn) be the specialized type-A Hecke algebra with generators T1,…,Tn−1 and relations Ti2=(q−1)Ti+q, the braid relations and the distant commutations (The generic type-A Hecke algebra, The standard basis of the generic type-A Hecke algebra). Then the assignment Ti↦Ti (1≤i<n) extends uniquely to an R-algebra anti-automorphism ∗:H→H, i.e. an R-linear map with (ab)∗=b∗a∗ and 1∗=1; it is an involution, ∗∗=idH, and on the standard basis Tw∗=Tw−1(w∈Sn). In particular (TwTw−1)∗=TwTw−1 and, for the symmetrizers mλ=∑w∈SλTw, one has mλ∗=mλ.

Facts & Assumptions

Given: A commutative ring R, a unit q∈R×, and the specialized type-A Hecke algebra H=HR,q(Sn), presented over R by generators T1,…,Tn−1 with the relations Ti2=(q−1)Ti+q, TiTi+1Ti=Ti+1TiTi+1 (1≤i≤n−2) and TiTj=TjTi (∣i−j∣>1).

[F1]

The generic algebra and its specialization: Hv(n) is the quotient of the free unital associative A-algebra, A=Z[v±1], on the Ti by the two-sided ideal generated by the quadratic and braid relators; a reduced expression of w∈Sn is a word w=si1⋯siℓ of minimal length ℓ(w) representing w, and Tw:=Ti1⋯Tiℓ, the empty product for w=1; the specialization at v0 is the R-algebra R⊗AHv(n), and for v0=q it is H, presented over R by the images of the Ti subject to the relations above (The generic type-A Hecke algebra).

[F2]

Standard basis of the generic algebra: {Tw:w∈Sn} is an A-basis of Hv(n), so Tw is independent of the reduced expression chosen for w (The standard basis of the generic type-A Hecke algebra).

[F3]

Length is inversion invariant: ℓ(w−1)=ℓ(w) for every w∈Sn (Permutation Weyl group and inversion length).

[F4]

For a set X, the finite words X∗ form a monoid under concatenation with the empty word as identity (Finite words satisfy the free-monoid universal property).

[F5]

The free R-module R(X∗) on the set X∗ has the words as an R-basis: every element is a unique finite R-linear combination ∑waww (The free module on a set and its standard basis).

[F6]

Two-sided ideals are additive subgroups closed under multiplication on both sides; for S⊆F the ideal (S) is the intersection of all two-sided ideals containing S, so any two-sided ideal containing S contains (S) (Left, right and two-sided ideals, The ideal generated by a subset and principal ideals).

[F7]

The quotient ring F/I has additive cosets with (x+I)(y+I)=xy+I and R-scalar action inherited from F (The quotient ring R/I with (r+I)(s+I)=rs+I).

Proof

technique · direct
1.1givenF1F4F5F7

Put X:={1,…,n−1} and F:=R(X∗), the free R-module with the finite words in X as basis [F5]; write the basis word corresponding to i1,…,ik as Ti1⋯Tik and the empty word as 1. Extending concatenation of words R-bilinearly makes F a unital associative R-algebra: concatenation is associative with two-sided identity the empty word by [F4], and distributivity holds by the bilinear extension. Let I⊆F be the two-sided ideal generated by the relators ri:=Ti2−(q−1)Ti−q⋅1, bi:=TiTi+1Ti−Ti+1TiTi+1 and dij:=TiTj−TjTi, and put H:=F/I, which by [F1] is the presented algebra HR,q(Sn), the image of Ti being again written Ti; every element of H is the image of an R-linear combination of words in the Ti, so H is generated as an R-algebra by T1,…,Tn−1.

1.2F4F5algebra

Define ρ:F→F on the word basis by ρ(Ti1⋯Tik):=Tik⋯Ti1 and ρ(1):=1, extended R-linearly. Then ρ is an R-linear involution and reverses products, ρ(xy)=ρ(y)ρ(x), because reversal of a concatenation is the concatenation of the reversals in the opposite order and both sides are R-bilinear; in particular ρ2=idF and ρ(Ti)=Ti for each generator.

2.1step 1.2F6algebra

ρ preserves I, i.e. ρ(I)⊆I: the relators are fixed up to sign, ρ(ri)=ri, ρ(bi)=bi and ρ(dij)=−dij by step 1.2, so each lies in I; the set J:={x∈F:ρ(x)∈I} contains 0, is closed under addition and additive inverses because ρ is R-linear and I is an additive subgroup, and for x∈J and a∈F one has ρ(ax)=ρ(x)ρ(a)∈I and ρ(xa)=ρ(a)ρ(x)∈I because I is a two-sided ideal [F6]; hence J is a two-sided ideal containing all relators, so (S)⊆J and I=(S)⊆J, that is, ρ(I)⊆I.

3.1step 1.1step 1.2step 2.1F7algebra

Consequently ρˉ:H→H, ρˉ(x+I):=ρ(x)+I, is well defined: if x−y∈I then ρ(x)−ρ(y)=ρ(x−y)∈I by step 2.1. It is an R-linear anti-automorphism of H with ρˉ2=id and ρˉ(Ti)=Ti: the quotient operations of [F7] and step 1.2 give ρˉ((x+I)(y+I))=ρ(xy)+I=ρ(y)ρ(x)+I=ρˉ(y+I)ρˉ(x+I), and similarly for addition, scalars and the unit.

4.1step 1.1step 3.1algebra

ρˉ is the unique R-algebra anti-automorphism of H with ρˉ(Ti)=Ti for all i: if α is any such anti-automorphism, then α and ρˉ agree on 1, and for a word Ti1⋯Tik one has α(Ti1⋯Tik)=α(Tik)⋯α(Ti1)=Tik⋯Ti1=ρˉ(Ti1⋯Tik); the words span H by step 1.1, so α=ρˉ by R-linearity.

4.2givenF1F2F3step 3.1algebra

For w∈Sn and a reduced expression w=si1⋯siℓ one has Tw=Ti1⋯Tiℓ in the generic algebra and hence Tw=Ti1⋯Tiℓ∈H; thus Tw∗=ρˉ(Ti1⋯Tiℓ)=Tiℓ⋯Ti1 by step 3.1. The reversed word siℓ⋯si1 represents w−1 and has ℓ letters, and ℓ=ℓ(w)=ℓ(w−1) by [F3], so it is a reduced expression of w−1 and therefore Tw−1=Tiℓ⋯Ti1∈H; hence Tw∗=Tw−1 for every w, and Tw is well defined in H independently of the chosen reduced expression by [F1] and [F2].

5.1step 3.1step 4.1step 4.2algebra∎

The assertions of the statement follow: ∗:=ρˉ is the unique extension of the assignment Ti↦Ti, an involution by step 3.1; Tw∗=Tw−1 is step 4.2; therefore (TwTw−1)∗=Tw−1∗Tw∗=T(w−1)−1Tw−1=TwTw−1; and for the parabolic subgroup Sλ the map w↦w−1 is a bijection of Sλ, so mλ∗=∑w∈SλTw−1=∑v∈SλTv=mλ. No choice principle is used: the constructions are explicit on the word basis.

Depends on

Used by

Dependency tree · two levels

32 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