Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 cyclotomic anti-involution fixes the affine and Murphy generators

Statement

For r,n≥1, let Hr,n be the multiplicative cyclotomic Hecke algebra of The multiplicative cyclotomic Hecke algebra. There is a unique R-linear involutive algebra anti-automorphism ∗ of Hr,n fixing every Ti and every Xj±1. Since Lj=Xj by Cyclotomic Jucys–Murphy generators and their transport relations, it fixes every Lj. Its restriction to the finite type-A Hecke subalgebra is the reversal anti-involution.

Facts & Assumptions

Given: Integers r,n≥1, the coefficient ring R=Z[Q±1,u1±1,…,ur±1], and the generators and relations in The multiplicative cyclotomic Hecke algebra.

[F1]

The algebra is the quotient of the free associative R-algebra on Ti,Xj,Xj−1 by the displayed quadratic, braid, commuting, affine, inverse, and cyclotomic relations. (The multiplicative cyclotomic Hecke algebra, The free associative R-algebra on a set and descent of relations)

[F2]

The involution on the free algebra obtained by reversing each word and fixing its letters descends to a quotient whenever it preserves the two-sided ideal of defining relations. (The free associative R-algebra on a set and descent of relations)

[F3]

The recursively defined Murphy generators satisfy Lj=Xj for all j. (Cyclotomic Jucys–Murphy generators and their transport relations)

Proof

Given: The free presentation and relations of Hr,n.

1.1givenF1F2construct

On the free associative algebra define ∗ by r∗=r for r∈R, Ti∗=Ti, Xj∗=Xj, (Xj−1)∗=Xj−1, and (ab)∗=b∗a∗, extending R-linearly. Word reversal is an involutive anti-automorphism, so this defines an involutive anti-automorphism of the free algebra.

2.1F1step 1.1algebra

The quadratic relation is a polynomial in one fixed generator and is fixed by reversal. Each braid word in the Ti is palindromic, each distant commutation relation reverses to the same equality with sides exchanged, each relation XjXk=XkXj and TiXj=XjTi reverses to its equivalent reversed equality, and TiXiTi=QXi+1 is fixed because its left word is palindromic and Q is central. The inverse relations reverse to the other inverse equations, and the cyclotomic relation p(X1)=0 is fixed because it is a polynomial in X1. Thus reversal sends every defining relator into the defining ideal. As the ideal is two-sided, it is preserved under reversal, so ∗ descends to an involutive anti-automorphism of Hr,n.

3.1F1F3step 2.1∎

The quotient is generated by the displayed letters and R, so any anti-homomorphism fixing them is unique. By [F3], Lj=Xj, hence Lj∗=Lj. On words in the finite generators Ti, reversal sends a reduced word for w to the reversed reduced word for w−1; therefore Tw∗=Tw−1, as for the finite reversal anti-involution.

Depends on

Used by

Dependency tree · two levels

28 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