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.
Finite Coxeter Hecke algebras are semisimple over the generic characteristic-zero field
Statement
Let be a finite Coxeter group with finite generator set , let be a field of characteristic zero, and form and as in Finite Hecke specialization and its regular-trace determinant. Let be the fraction field and let be the regular-trace determinant. Then and the generic algebra is semisimple as a left regular module. More generally, for any ring homomorphism to a field , if , then is semisimple. No splitness claim is made.
Facts & Assumptions
Given: A finite Coxeter group with finite generator set , a characteristic-zero field , the universal Laurent parameter ring , and the finite free Hecke algebra with basis .
The presented Coxeter group is the quotient with relators and for finite , and any assignment of generators killing those relators extends uniquely to a group homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The generic Hecke algebra is presented by the quadratic relations and the finite alternating braid relations; a family satisfying them in a unital algebra gives a unique algebra homomorphism (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy).
Presentation base change identifies with the quotient by the image ideal generated by the specialized relations (Presentation base change and transport of explicit bases to commutative specializations).
Every commutative specialization is free with basis (The standard basis of the generic Hecke algebra and base change).
A Laurent polynomial ring over an integral domain is an integral domain, and its fraction field contains it injectively (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields).
A nondegenerate regular-trace pairing on a finite-dimensional field algebra forces its left regular module to be semisimple (A nondegenerate regular-trace pairing forces semisimplicity).
The specialized regular-trace Gram determinant is the image of under the coefficient homomorphism (Finite Hecke specialization and its regular-trace determinant).
Proof
Specialize every parameter to and call the resulting algebra . By [F2], each specialized generator is an involution and the alternating braid relations hold. For involutions , put , so . If , the braid relation is , equivalent to . If , its two sides are and ; right multiplication by makes equality equivalent to , which is equivalent to . Thus, for every finite braid label, braid and Coxeter relator are equivalent in the presence of the involution relations. The specialized generators satisfy exactly [F1].
If is a ring homomorphism to a field with , [F7] says that the regular-trace Gram matrix of has nonzero determinant and is therefore nondegenerate. Applying [F6] shows that is semisimple. This criterion does not infer splitness and makes no claim when .
By the group universal property in [F1], extends to , and linear extension gives a -algebra map . Conversely, the group generators in satisfy the specialized quadratic and braid relations, so the quotient presentation in [F3] gives a -algebra map . The composites are identity on their algebra generators, hence and corresponds to . By [F4], is a basis of , so .
For , permutes the group basis by . If , all basis vectors are fixed; if , would imply by right cancellation, so none is fixed. Thus for and otherwise. The regular-trace Gram matrix at therefore has entries ; it is times a permutation matrix and has determinant in characteristic zero.
By [F7], this determinant is evaluated at , so is not the zero Laurent polynomial. Since is a field, [F5] makes an integral domain and embeds it into its fraction field ; therefore remains nonzero in . The regular-trace Gram matrix over is invertible, and [F6] proves that is semisimple.
When , the matrix in step 3.1 is , so the argument includes the trivial Coxeter group. All bases are finite and specified; no form of Choice is used.
Depends on
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Finite Hecke specialization and its regular-trace determinant
- Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy
- Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields
- A nondegenerate regular-trace pairing forces semisimplicity
- Presentation base change and transport of explicit bases to commutative specializations
- The standard basis of the generic Hecke algebra and base change
Used by
Dependency tree · two levels
60 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
- Meinolf Geck, Modular Representations of Hecke Algebras, EPFL course notes (standard reference, not scraped)
- Maarten Solleveld, Affine Hecke Algebras and Their Representations (standard reference, not scraped)