Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 G=GL⁡n(Fq) with Borel B, let H=eBC[G]eB, and for 1≤i≤n−1 let Tsi∈H be the standard basis element attached to the simple transposition si (The Bruhat double-coset basis of the finite Hecke algebra, Permutation Weyl group and inversion length). Throughout, T1:=Tid=eB denotes the unit of H, so that the generators Ts1,…,Tsn−1 are distinct from T1; in particular in the quadratic relation below the right hand side q⋅1H=q T1 is a scalar multiple of the unit. Then:

  1. the elements Ts1,…,Tsn−1 generate H;
  2. they satisfy Tsi2=(q−1)Tsi+q 1H (1≤i<n),TsiTsi+1Tsi=Tsi+1TsiTsi+1 (1≤i≤n−2),TsiTsj=TsjTsi (∣i−j∣>1);
  3. these relations present H: if H(n):=C⟨τ1,…,τn−1⟩/(the three families of relations displayed in (2), with τi in place of Tsi and 1 the unit of H(n)) is the abstract unital C-algebra with generators τi and these relations, then the natural map H(n)→H, τi↦Tsi, is an isomorphism. Equivalently, H≅C⊗Z[v±1]Hv(n) under v↦q. In particular H has dimension n! and the images of the standard basis Tw form a basis. No choice principle is used.

Facts & Assumptions

Given: G=GL⁡n(Fq) with Borel B, the idempotent eB, the finite Hecke algebra H with standard basis Tw, the simple transpositions si=(i i+1) with inversion length ℓ, the generic type-A Hecke algebra Hv(n) over A=Z[v±1], and the specialization A→C, v↦q.

[F1]

Hv(n) is the quotient of the free unital associative A-algebra on T1,…,Tn−1 by the two-sided ideal generated by Ti2−(v−1)Ti−v, the braid relators TiTi+1Ti−Ti+1TiTi+1 and the distant commutation relators TiTj−TjTi; its specialization at a unit v0∈R× is R⊗AHv(n), presented over R by the same relations with v replaced by v0 and with the unit written explicitly (The generic type-A Hecke algebra).

[F2]

Hv(n) is free over A with basis the products Tw along reduced words, so it has rank n!; its multiplication rule rewrites every monomial in the generators as an A-linear combination of the Tw (The standard basis of the generic type-A Hecke algebra).

[F3]

The elements Tw=qℓ(w)eBw˙eB, w∈Sn, form a C-basis of H, with T1=eB the unit, and dim⁡CH=n! (The Bruhat double-coset basis of the finite Hecke algebra).

[F4]

If u,v∈Sn satisfy ℓ(uv)=ℓ(u)+ℓ(v), then TuTv=Tuv; in particular a product of generators along a reduced word for w equals Tw (Length-additive products in the finite Hecke algebra).

[F5]

For every simple transposition si one has Tsi2=(q−1)Tsi+q T1 in H (The rank-one quadratic relation in the finite Hecke algebra).

[F6]

si=(i i+1), ℓ(si)=1, and length is the inversion count (Permutation Weyl group and inversion length).

[F7]

Tensoring over a commutative ring preserves cokernels and surjections (Tensoring is right exact).

Proof

technique · direct
1.1F3F4algebra

For every w∈Sn choose a reduced word w=si1⋯siℓ; step by step the partial products have length 1,2,…,ℓ, so repeated application of [F4] gives Tw=Tsi1⋯Tsiℓ. Since the Tw form a basis of H by [F3], every element of H is a finite linear combination of products of the generators Ts1,…,Tsn−1: clause (1).

1.2F4F5F6algebra

The quadratic relation of clause (2) is [F5]. For ∣i−j∣>1 the simple transpositions commute, and both products in TsiTsj=Tsisj=Tsjsi=TsjTsi are length-additive because sisj has exactly two inversions and ℓ(si)=ℓ(sj)=1 by [F6]; [F4] applies. If ∣i−j∣=1, the two permutations sisi+1si and si+1sisi+1 are equal, as is checked by their action on i,i+1,i+2 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 TsiTsi+1Tsi=Tsisi+1si=Tsi+1sisi+1=Tsi+1TsiTsi+1.

1.3F1F7algebra

Let F be the free unital associative A-algebra on T1,…,Tn−1 and I⊆F the two-sided ideal generated by the relators of [F1], so that Hv(n)=F/I, and put B:=C⊗AHv(n). By right exactness of tensoring [F7], B≅(C⊗AF)/im⁡(C⊗AI→C⊗AF) as C-algebras; the base change of the free algebra is the free unital C-algebra on the images τi:=1⊗Ti, and the image ideal is generated by the specialized relators: every element of I is a finite sum of products arb with a,b∈F and r a defining relator, so its image lies in that ideal, while every specialized relator and its products lie in the image. These relators are τi2−(q−1)τi−q⋅1F, the braid relators and the commutation relators, with 1F the unit. Hence B is presented by the three families of relations of clause (2), that is, B≅H(n); the unit is the algebra unit in both cases, so the relation is τi2=(q−1)τi+q⋅1.

2.1F2F3F4step 1.1step 1.2step 1.3algebra

By [F2] the algebra Hv(n) is free over A with basis {Tw}, so its base change B≅H(n) has C-basis {1⊗Tw} and dimension n!. The assignment τi↦Tsi defines a unital C-algebra homomorphism φ:H(n)→H because the three families of relations hold in H by step 1.2; it is surjective by step 1.1. Since dim⁡CH(n)=n!=dim⁡CH by [F3], a surjection between vector spaces of equal finite dimension is an isomorphism, so H≅H(n)≅C⊗AHv(n) under v↦q: clause (3). Under φ the basis element 1⊗Tw of Hv(n) maps to the product Tsi1⋯Tsiℓ along a reduced word, which is Tw by [F4]; hence the images of the standard basis Tw form a basis of H, in agreement with [F3].

3.1step 1.1step 1.2step 1.3step 2.1∎

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 C or free of finite rank over A, the generators and permutation matrices are explicit, and no choice principle is used.

Depends on

Used by

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