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 type-A Iwahori-Hecke presentation of the finite Hecke algebra
Statement
Let with Borel , let , and for let be the standard basis element attached to the simple transposition (The Bruhat double-coset basis of the finite Hecke algebra, Permutation Weyl group and inversion length). Throughout, denotes the unit of , so that the generators are distinct from ; in particular in the quadratic relation below the right hand side is a scalar multiple of the unit. Then:
- the elements generate ;
- they satisfy
- these relations present : if is the abstract unital -algebra with generators and these relations, then the natural map , , is an isomorphism. Equivalently, under . In particular has dimension and the images of the standard basis form a basis. No choice principle is used.
Facts & Assumptions
Given: with Borel , the idempotent , the finite Hecke algebra with standard basis , the simple transpositions with inversion length , the generic type-A Hecke algebra over , and the specialization , .
is the quotient of the free unital associative -algebra on by the two-sided ideal generated by , the braid relators and the distant commutation relators ; its specialization at a unit is , presented over by the same relations with replaced by and with the unit written explicitly (The generic type-A Hecke algebra).
is free over with basis the products along reduced words, so it has rank ; its multiplication rule rewrites every monomial in the generators as an -linear combination of the (The standard basis of the generic type-A Hecke algebra).
The elements , , form a -basis of , with the unit, and (The Bruhat double-coset basis of the finite Hecke algebra).
If satisfy , then ; in particular a product of generators along a reduced word for equals (Length-additive products in the finite Hecke algebra).
For every simple transposition one has in (The rank-one quadratic relation in the finite Hecke algebra).
, , and length is the inversion count (Permutation Weyl group and inversion length).
Tensoring over a commutative ring preserves cokernels and surjections (Tensoring is right exact).
Proof
For every choose a reduced word ; step by step the partial products have length , so repeated application of [F4] gives . Since the form a basis of by [F3], every element of is a finite linear combination of products of the generators : clause (1).
The quadratic relation of clause (2) is [F5]. For the simple transpositions commute, and both products in are length-additive because has exactly two inversions and by [F6]; [F4] applies. If , the two permutations and are equal, as is checked by their action on and on the remaining points, and each product of the three generators is length-additive since these permutations have exactly three inversions by [F6]; applying [F4] to both sides gives .
Let be the free unital associative -algebra on and the two-sided ideal generated by the relators of [F1], so that , and put . By right exactness of tensoring [F7], as -algebras; the base change of the free algebra is the free unital -algebra on the images , and the image ideal is generated by the specialized relators: every element of is a finite sum of products with and a defining relator, so its image lies in that ideal, while every specialized relator and its products lie in the image. These relators are , the braid relators and the commutation relators, with the unit. Hence is presented by the three families of relations of clause (2), that is, ; the unit is the algebra unit in both cases, so the relation is .
By [F2] the algebra is free over with basis , so its base change has -basis and dimension . The assignment defines a unital -algebra homomorphism because the three families of relations hold in by step 1.2; it is surjective by step 1.1. Since by [F3], a surjection between vector spaces of equal finite dimension is an isomorphism, so under : clause (3). Under the basis element of maps to the product along a reduced word, which is by [F4]; hence the images of the standard basis form a basis of , in agreement with [F3].
Step 1.1 proves clause (1), step 1.2 proves clause (2) with the unit displayed explicitly, and steps 1.3 and 2.1 prove clause (3) and the specialization statement; all algebras are finite-dimensional over or free of finite rank over , the generators and permutation matrices are explicit, and no choice principle is used.
Depends on
- Length-additive products in the finite Hecke algebra
- The rank-one quadratic relation in the finite Hecke algebra
- The Bruhat double-coset basis of the finite Hecke algebra
- The generic type-A Hecke algebra
- The standard basis of the generic type-A Hecke algebra
- Permutation Weyl group and inversion length
- Tensoring is right exact
Used by
- The finite Hecke algebra is non-canonically isomorphic to the group algebra of Sₙ Corollary
- The two-dimensional Hecke algebra for GL₂(F_q) Example
- Group algebra and finite-field specializations of the generic Hecke algebra Proposition
- The endomorphism algebra of a general finite principal series Theorem
Dependency tree · two levels
29 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 - Section 11.1, relations (11.1)-(11.2) and the statement that they generate all relations in $H$, printed p. 46 (standard reference, not scraped)
- Ivan Losev, Lecture 8: Representations of GL_n(F_q) - Corollary 2.4 and the presentation of $H_v(n)$, PDF pp. 4-5 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - The relations for $\bar T_s$ and Exercise 5.11 ($q_s=q$ for $GL_n$), printed p. 44 (standard reference, not scraped)