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 generic type-A Hecke algebra
Definition
Let be an integer, with as in Partitions, English diagrams, and conjugation. Let be the ring of Laurent polynomials in one indeterminate over . For the generic type-A Hecke algebra is the associative unital -algebra presented by generators and the relations that is, the quotient of the free unital associative -algebra on by the two-sided ideal generated by these relators. The first relation is written in the RG-13 quadratic normalization , equivalent to the displayed form over . For there are no generators and we set .
Standard basis elements. Let with simple transpositions (The symmetric group : the bijections of a set under composition), and let have inversion length (Permutation Weyl group and inversion length). Choose a reduced expression , that is, a word of the minimal length representing , and put the empty product when is the identity of , so that for that element. That is independent of the chosen reduced expression, and that the elements form an -basis of , is proved in the standard-basis theorem below (The standard basis of the generic type-A Hecke algebra ↗); the notation distinguishes the generator with from for the group element .
Specializations. Let be a commutative -algebra with structure map , , and suppose . The specialization of at is the -algebra ; it is presented over by the images of subject to the same relations with replaced by , and we write for it. Two specializations are used on this page: , where the quadratic relation becomes together with the braid and commutation relations, and , where is the prime power defining ; the latter specializes the generic algebra to the Hecke algebra attached to the finite general linear group. The condition is part of the definition of a specialization and, for a nonzero coefficient ring , excludes . The zero ring is allowed: its unique element is a unit and its specialization is the zero algebra.
Remarks
Dictionary to the Soergel normalization. The type-A Soergel item
def-type-a-hecke-algebra-in-soergel-normalization, homed later in the reading
order, uses and . Its algebra is the
base change : substitution makes
its quadratic, braid and commutation relations identical to the ones here.
This coefficient map is not a Laurent-ring isomorphism; its image is
, and is free of rank two over that image with
basis . Numerical specializations must therefore satisfy
. This comparison is orientation only and is not
a premise of the definition or its standard-basis proof.
Depends on
Used by
- The Markov trace on the type-A Hecke tower Definition
- The Temperley-Lieb quotient and the Jones specialization Definition
- The Hecke trace skein calculation for a three-crossing braid Example
- The Jones specialization of a two-strand closure Example
- The Hecke generators satisfy the Artin relations and are units Lemma
- The Hecke tower is free over the previous level Lemma
- The Markov trace of an inverse Hecke generator Lemma
- Group algebra and finite-field specializations of the generic Hecke algebra Proposition
- The endomorphism algebra of a general finite principal series Theorem
- The Ocneanu Markov trace exists and is unique Theorem
- The standard basis of the generic type-A Hecke algebra Theorem
- The type-A Iwahori-Hecke presentation of the finite Hecke algebra Theorem
Dependency tree · two levels
15 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
- Olivier Dudas and Jean Michel, Lectures on Finite Reductive Groups and Their Representations - Definition 11.3 (generic Hecke algebra $H_q(W,S)$), printed p. 46 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Definition 5.13 and Remark 5.14 (generic Hecke algebra $H(W,J)$ over $R=\mathbb Q[u_s]$), printed pp. 44-45 (standard reference, not scraped)
- Ivan Losev, Lecture 8: Representations of GL_n(F_q) - Section 2.2 (the algebra $H_v(n)$ over $\mathbb Z[v^{\pm1}]$), PDF p. 4 (standard reference, not scraped)