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 generic type-A Hecke algebra

Definition

Let n≥0 be an integer, with S0={1} as in Partitions, English diagrams, and conjugation. Let A:=Z[v±1] be the ring of Laurent polynomials in one indeterminate v over Z. For n≥2 the generic type-A Hecke algebra Hv(n) is the associative unital A-algebra presented by generators T1,…,Tn−1 and the relations Ti2=(v−1)Ti+v(1≤i<n),TiTi+1Ti=Ti+1TiTi+1(1≤i≤n−2),TiTj=TjTi(1≤i,j<n, ∣i−j∣>1), that is, the quotient of the free unital associative A-algebra on T1,…,Tn−1 by the two-sided ideal generated by these relators. The first relation is written in the RG-13 quadratic normalization (Ti−v)(Ti+1)=0, equivalent to the displayed form over A. For n≤1 there are no generators and we set Hv(n):=A.

Standard basis elements. Let Sn=Sym⁡({1,…,n}) with simple transpositions si=(i i+1) (The symmetric group Sym⁡(X): the bijections of a set X under composition), and let w∈Sn have inversion length ℓ(w)=ℓ (Permutation Weyl group and inversion length). Choose a reduced expression w=si1⋯siℓ, that is, a word of the minimal length ℓ(w) representing w, and put Tw:=Ti1⋯Tiℓ∈Hv(n), the empty product when w is the identity of Sn, so that Tw=1 for that element. That Tw is independent of the chosen reduced expression, and that the elements Tw form an A-basis of Hv(n), is proved in the standard-basis theorem below (The standard basis of the generic type-A Hecke algebra ↗); the notation distinguishes the generator Ti with 1≤i≤n−1 from Tw for the group element w.

Specializations. Let R be a commutative A-algebra with structure map Z[v±1]→R, v↦v0, and suppose v0∈R×. The specialization of Hv(n) at v0 is the R-algebra R⊗AHv(n); it is presented over R by the images of T1,…,Tn−1 subject to the same relations with v replaced by v0, and we write Hv0(n) for it. Two specializations are used on this page: v↦1, where the quadratic relation becomes Ti2=1 together with the braid and commutation relations, and v↦q, where q is the prime power defining GL⁡n(Fq); the latter specializes the generic algebra to the Hecke algebra attached to the finite general linear group. The condition v0∈R× is part of the definition of a specialization and, for a nonzero coefficient ring R, excludes v0=0. The zero ring is allowed: its unique element is a unit and its specialization is the zero algebra.

Remarks

Dictionary to the Soergel normalization. The type-A Soergel item def-type-a-hecke-algebra-in-soergel-normalization, homed later in the reading order, uses AS=Z[vS±1] and q=vS−2. Its algebra is the base change AS⊗A, v↦vS−2Hv(n): substitution makes its quadratic, braid and commutation relations identical to the ones here. This coefficient map is not a Laurent-ring isomorphism; its image is Z[vS±2], and AS is free of rank two over that image with basis 1,vS. Numerical specializations must therefore satisfy vhere=vS−2. This comparison is orientation only and is not a premise of the definition or its standard-basis proof.

Depends on

Used by

Dependency tree · two levels

15 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