Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generated
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 W be a finite Coxeter group with finite generator set S, let k be a field of characteristic zero, and form Rk=k[vC±1:C∈C] and HRk(W) as in Finite Hecke specialization and its regular-trace determinant. Let F:=Frac⁡(Rk) be the fraction field and let DW∈Rk be the regular-trace determinant. Then DW≠0 and the generic algebra F⊗RkHRk(W) is semisimple as a left regular module. More generally, for any ring homomorphism to a field ϕ:Rk→K, if ϕ(DW)≠0, then Hϕ is semisimple. No splitness claim is made.

Facts & Assumptions

Given: A finite Coxeter group W with finite generator set S, a characteristic-zero field k, the universal Laurent parameter ring Rk, and the finite free Hecke algebra HRk(W) with basis (Tw)w∈W.

[F1]

The presented Coxeter group is the quotient with relators s2 and (st)m(s,t)=1 for finite m(s,t), 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).

[F2]

The generic Hecke algebra is presented by the quadratic relations (Ts−vs)(Ts+vs−1)=0 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).

[F3]

Presentation base change identifies S⊗R(R⟨X⟩/I) with the quotient by the image ideal generated by the specialized relations (Presentation base change and transport of explicit bases to commutative specializations).

[F4]

Every commutative specialization is free with basis (1⊗Tw)w∈W (The standard basis of the generic Hecke algebra and base change).

[F5]

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).

[F6]

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).

[F7]

The specialized regular-trace Gram determinant is the image of DW under the coefficient homomorphism (Finite Hecke specialization and its regular-trace determinant).

Proof

technique · direct
1.1givenF1F2algebra

Specialize every parameter vC to 1 and call the resulting algebra H1. By [F2], each specialized generator Ts is an involution and the alternating braid relations hold. For involutions a,b, put g:=ab, so ba=g−1. If m=2r, the braid relation is gr=g−r, equivalent to g2r=1. If m=2r+1, its two sides are gra and (ba)rb; right multiplication by a makes equality equivalent to gr=(ba)r+1=g−(r+1), which is equivalent to g2r+1=1. 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].

1.2givenF6F7algebra

If ϕ:Rk→K is a ring homomorphism to a field with ϕ(DW)≠0, [F7] says that the regular-trace Gram matrix of Hϕ has nonzero determinant and is therefore nondegenerate. Applying [F6] shows that Hϕ is semisimple. This criterion does not infer splitness and makes no claim when ϕ(DW)=0.

2.1step 1.1F1F3F4algebra

By the group universal property in [F1], s↦Ts extends to W→H1×, and linear extension gives a k-algebra map kW→H1. Conversely, the group generators in kW satisfy the specialized quadratic and braid relations, so the quotient presentation in [F3] gives a k-algebra map H1→kW. The composites are identity on their algebra generators, hence H1≅kW and Tw corresponds to w. By [F4], (Tw)w∈W is a basis of H1, so dim⁡kH1=∣W∣.

3.1step 2.1F4F7givenalgebra

For g∈W, Lg permutes the group basis by w↦gw. If g=1, all ∣W∣ basis vectors are fixed; if g≠1, gw=w would imply g=1 by right cancellation, so none is fixed. Thus Tr⁡k(Lg)=∣W∣ for g=1 and 0 otherwise. The regular-trace Gram matrix at vC=1 therefore has entries ∣W∣δy,x−1; it is ∣W∣ times a permutation matrix and has determinant ±∣W∣∣W∣≠0 in characteristic zero.

4.1step 3.1F5F6F7algebra

By [F7], this determinant is DW evaluated at vC=1, so DW is not the zero Laurent polynomial. Since k is a field, [F5] makes Rk an integral domain and embeds it into its fraction field F; therefore DW remains nonzero in F. The regular-trace Gram matrix over F is invertible, and [F6] proves that F⊗RkHRk(W) is semisimple.

5.1step 3.1given∎

When ∣W∣=1, the matrix in step 3.1 is [1], so the argument includes the trivial Coxeter group. All bases are finite and specified; no form of Choice is used.

Depends on

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