Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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 Hecke sign automorphism, pullback and contragredient dual

Statement

For every commutative ring R and q∈R×:

  1. θ(Ti):=(q−1)−Ti=−qTi−1 extends uniquely to an involutive R-algebra automorphism θ of H=HR,q(Sn), with θ(Tw)=(−q)ℓ(w)Tw−1−1; θ commutes with the star anti-involution ∗ and is compatible with every base change.

  2. For a right H-module M, the pullback Mθ (same underlying R-module, action m⋅h:=mθ(h)) is a right H-module; (−)θ is exact, preserves submodules, quotients, finite composition multiplicities and simplicity, and (Mθ)θ=M.

  3. The star-contragredient M∘:=Hom⁡R(M,R) with (f⋅h)(m):=f(mh∗) is a right H-module; for finite free M it is finite free of the same rank, (−)∘ commutes with base change, and (Mθ)∘=(M∘)θ.

  4. For every partition λ⊢n, if w0(Sλ) is the longest element of the row subgroup, then θ(xλ)=qℓ(w0(Sλ))yλ,θ(yλ)=q−ℓ(w0(Sλ))xλ. In particular θ(xλ) and yλ differ by the unit qℓ(w0(Sλ)), and this unit factor must be carried through every form comparison. At q=1, θ is the pullback along the sign automorphism w↦sgn⁡(w)w of R[Sn].

No choice principle is used.

Facts & Assumptions

Given: A commutative ring R, q∈R×, n≥0, the Hecke algebra H=HR,q(Sn) with generators Ti, standard basis {Tw} and star anti-involution ∗, a partition λ⊢n with row subgroup Sλ and its longest element w0(Sλ) (of length N:=ℓ(w0(Sλ))), and the elements xλ,yλ of Hecke row permutation modules and ordinary Dipper-James polytabloids.

[F1]

In H the relations (Ti−q)(Ti+1)=0, the braid relations and the distant commutations hold, {Tw} is an R-basis, TwTi=Twsi if ℓ(wsi)=ℓ(w)+1 and TwTi=(q−1)Tw+qTwsi if ℓ(wsi)=ℓ(w)−1; the same rule holds on the left, TiTw=Tsiw respectively TiTw=(q−1)Tw+qTsiw. Moreover Ti−1=q−1(Ti−(q−1)) (The generic type-A Hecke algebra, The standard basis of the generic type-A Hecke algebra).

[F2]

∗ is an R-algebra anti-automorphism with Ti∗=Ti and Tw∗=Tw−1; the generators Ti generate H as an R-algebra (Hecke row permutation modules and ordinary Dipper-James polytabloids).

[F3]

xλTw=qℓ(w)xλ and Twxλ=qℓ(w)xλ for w∈Sλ, and xλ∗=xλ (The row permutation module: distinguished basis and Hecke action).

[F4]

For a commutative ring R and n∈N the map Hom⁡R(Rn,N)→Nn, f↦(f(e1),…,f(en)), is an isomorphism of R-modules (For a commutative ring, Hom⁡R(Rn,N)≅Nn).

[F5]

The specialization construction: HR,q(Sn) is the base change R⊗AHv(n) along v↦q, and all formulas with coefficients in Z[q±1] specialize (The generic type-A Hecke algebra).

Proof

technique · direct
1.1F1F2F5algebra

The automorphism and its first properties. Put θ(Ti):=(q−1)−Ti. Since Ti−1=q−1(Ti−(q−1)) by [F1], one has θ(Ti)=−qTi−1. The assignment satisfies the Hecke relations: θ(Ti)2=(q−1)2−2(q−1)Ti+Ti2=(q−1)2−2(q−1)Ti+(q−1)Ti+q=(q−1)θ(Ti)+q; the braid relation holds because θ(Ti)=−qTi−1 multiplies every generator by the same scalar −q, and inverses satisfy the braid relations; the distant commutation holds similarly, and the scalar squares cancel. Since H is presented by these relations, the assignment extends uniquely to an R-algebra endomorphism θ of H; applying it twice fixes each generator, so θ2=idH by [F2] and θ is an involutive automorphism. For a reduced word w=si1⋯siℓ one gets θ(Tw)=(−q)ℓTi1−1⋯Tiℓ−1=(−q)ℓ(w)Tw−1−1, and θ commutes with ∗ because both sides of θ(Tw∗)=(−q)ℓ(w)Tw−1 and θ(Tw)∗=(−q)ℓ(w)Tw−1−∗=(−q)ℓ(w)Tw−1 agree. All generator images have coefficients in Z[q±1], so θ is compatible with base change by [F5].

1.2F2algebra

Pullback of modules. If M is a right H-module, then Mθ with m⋅h:=mθ(h) is a right H-module, because (m⋅h)⋅k=mθ(h)θ(k)=mθ(hk)=m⋅(hk). Since θ is an involutive automorphism, the assignments M↦Mθ on modules and N↦N on underlying R-modules are inverse bijections on submodules: a subset N⊆M is closed under the old action if and only if it is closed under the new one, since θ is bijective and θ(H)=H. Hence (−)θ is exact, preserves submodules and quotients, and (Mθ)θ=M; it also carries simple modules to simple modules and preserves the length of finite composition series with multiplicities, because the two module structures have exactly the same submodule lattice.

2.1step 1.1F2F4algebra

Contragredient modules. For a right H-module M, put M∘:=Hom⁡R(M,R) with (f⋅h)(m):=f(mh∗). Then ((f⋅h)⋅k)(m)=f(mk∗h∗)=f(m(hk)∗) by [F2], so f⋅(hk)=(f⋅h)⋅k and M∘ is a right H-module. If M≅Rr is finite free, then M∘≅Rr by [F4] applied with N=R, and the dual-basis identification is natural in R, so (−)∘ commutes with base change. Finally (Mθ)∘=(M∘)θ: both have underlying module Hom⁡R(M,R), and for the two actions one computes (f⋅h)(m)=f(mθ(h∗)) for the first and (f⋅h)(m)=f(mθ(h)∗)=f(mθ(h∗)) for the second, using that θ commutes with ∗ by step 1.1.

2.2step 1.1F1F3algebra

The common eigenspace. Let Hλ be the R-span of {Tw:w∈Sλ}, the subalgebra generated by the Ti with si∈Sλ; it is θ-stable because θ(Ti)=(q−1)−Ti∈Hλ. The element θ(xλ) lies in Hλ and satisfies Tiθ(xλ)=θ(θ(Ti)xλ)=θ(((q−1)−Ti)xλ)=θ((q−1)xλ−qxλ)=−θ(xλ) for every generator Ti of Sλ, by [F3]; so it is a common left eigenvector for eigenvalue −1. Conversely let a=∑w∈SλawTw∈Hλ satisfy Tia=−a for all these generators. Comparing in the expansion Tia=∑wawTiTw, using the left multiplication rule of [F1], the coefficient of Tv equals qasiv when ℓ(siv)=ℓ(v)+1 and equals (q−1)av+asiv when ℓ(siv)=ℓ(v)−1, and it must equal −av; the first case gives asiv=−q−1av, and the second gives the same relation with the roles of v and siv exchanged. Hence asiu=−q−1au whenever ℓ(siu)=ℓ(u)+1. Every nonidentity w∈Sλ is a length-increasing product of generators of Sλ: the permutation w−1 restricted to some row block Br is not the identity, hence has an adjacent descent, which exhibits a generator si of Sλ with ℓ(siw)=ℓ(w)−1. Iterating, aw=(−q)−ℓ(w)a1 for all w∈Sλ, so a=a1yλ: the common eigenspace is exactly the free line Ryλ, and it contains θ(xλ).

2.3step 1.1F5algebra

The case q=1. At q=1 the quadratic relation is Ti2=1, so Tw−1−1=Tw and step 1.1 gives θ(Tw)=(−1)ℓ(w)Tw=sgn⁡(w)Tw. The relations Ti2=1, braid and distant commutation are the Coxeter relations of the adjacent transpositions of Sn, so the specialization HR,1(Sn) is the group algebra R[Sn] with Tw the group basis element w; the displayed identity then says that θ is the pullback along the sign automorphism w↦sgn⁡(w)w. For N=0, as in the shapes ∅ and (1n), the unit below is q0=1.

3.1step 2.2step 1.1F1algebra

The unit. By step 2.2 write θ(xλ)=c yλ with c∈R. In the expansion θ(Tw)=∏jθ(Tij)=∏j((q−1)−Tij) of a reduced word, every term other than the full product of the −Tij has fewer than ℓ(w) generator factors and so cannot contribute to the standard basis element of length N; hence the coefficient of Tw0(Sλ) in θ(xλ)=∑w∈Sλθ(Tw) is (−1)N, the contribution of w=w0(Sλ) alone. In c yλ the coefficient of Tw0(Sλ) is c(−q)−N, so c=(−1)N(−q)N=qN. Therefore θ(xλ)=qNyλ, and applying the involution θ and using θ(qN)=qN gives θ(yλ)=q−Nxλ.

4.1step 1.1step 1.2step 2.1step 2.3step 3.1∎

Statements (1), (2), (3) and (4) are established by steps 1.1, 1.2, 2.1 and 3.1, with the q=1 clause in step 2.3 and the unit qℓ(w0(Sλ)) displayed in step 3.1. Only the presentation of H, inversion counts, the standard basis and finite free duality are used; no choice principle is used.

Depends on

Used by

Dependency tree · two levels

13 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