Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 Bruhat double-coset basis of the finite Hecke algebra

Definition

Keep G=GL⁡n(Fq) with upper triangular Borel B and the idempotent eB=∣B∣−1∑b∈Bb of the group algebra, and let H=eBC[G]eB be the finite Hecke algebra with unit eB (The finite Hecke algebra as a convolution corner and its endomorphism interpretation). For w∈Sn let w˙:=Pw∈G be the permutation matrix of w and let ℓ(w) be its inversion length. Define the standard basis element Tw  :=  qℓ(w) eB w˙ eB  =  1∣B∣∑x∈Bw˙Bx  ∈  H, where the displayed equality is the computation below and uses ∣Bw˙B∣/∣B∣=qℓ(w) (Cardinality of a finite Bruhat cell).

The displayed equality. In the group algebra, eBw˙eB=∣B∣−2∑b,b′∈Bbw˙b′. Each element x∈Bw˙B is hit by exactly ∣S∣ pairs (b,b′), where S:=B∩w˙−1Bw˙: writing x=b0w˙b0′, the equation bw˙b′=x with b,b′∈B is equivalent to b0′b′−1∈S, and then b is determined. Hence eBw˙eB=∣S∣ ∣B∣−2∑x∈Bw˙Bx. The same parametrisation B×B→Bw˙B, (b,b′)↦bw˙b′, shows ∣B∣2=∣S∣⋅∣Bw˙B∣, equivalently ∣B∣/∣S∣=∣Bw˙B∣/∣B∣=qℓ(w); substituting gives qℓ(w)eBw˙eB=∣B∣−1∑x∈Bw˙Bx, as displayed.

Basic properties.

  1. T1=eB is the unit of H: for w=1 the cell is B, the sum ∣B∣−1∑x∈Bx equals eB, and eB is the unit of the corner.
  2. By the Bruhat decomposition G=⨆w∈SnBw˙B (Bruhat decomposition of GL_n over a finite field) the elements Tw=qℓ(w)eBw˙eB, w∈Sn, are linearly independent and form a C-basis of H. Indeed the cells Bw˙B are pairwise disjoint and cover G, so the sums ∣B∣−1∑x∈Bw˙Bx are linearly independent elements of C[G], and they span H because H=eBC[G]eB is spanned by the elements eBgeB with g∈G, while eB(bxb′)eB=(eBb)x(b′eB)=eBxeB for b,b′∈B shows that eBgeB depends only on the double coset BgB; hence eBgeB=q−ℓ(w)Tw for the unique w with g∈Bw˙B. In particular dim⁡CH=n!.
  3. Under the identification of H with the convolution algebra of B-bi-invariant functions on G, the element Tw is the normalized characteristic function of the double coset Bw˙B, taking the value ∣B∣−1 on that cell: an element h∈C[G] is B-bi-invariant precisely when eBheB=h, so H is the space of functions constant on double cosets, and the displayed formula exhibits Tw as ∣B∣−1 times the sum of the basis elements of the cell.

Normalization. This is the Dudas-Michel normalization, used for the rest of this page: the multiplication rules established below on this page take the form in which length-additive products of the standard basis elements are single basis elements, and the rank-one quadratic relation in this normalization is recorded by the page's rank-one relation result, reading Ts2=(q−1)Ts+q T1 for a simple reflection s with corresponding basis element Ts. No choice principle is used: the permutation matrices w˙ are explicit representatives of the double cosets.

Depends on

Used by

Dependency tree · two levels

20 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