Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 Iwahori–Matsumoto affine Hecke algebra of a based root datum

Definition

Let R=(X,Φ,Y,Φ∨,Δ) be a reduced based root datum: X,Y are finite-rank free lattices in perfect integral duality, Φ⊂X is the finite root set, Φ∨⊂Y its coroot set, Δ a base, and W0 the finite Weyl group (Abstract root data and their Weyl groups). Its finite simple-reflection set is S0:={sα:α∈Δ}⊂W0; the simple reflections in a chosen base generate W0 (Combinatorics of a reduced root datum). Write Q∨=ZΦ∨⊆Y for the coroot lattice.

Put V=Y⊗ZR. The canonical affine walls are Hα,j={v:⟨α,v⟩=j}, with reflection rα,j(v)=v−(⟨α,v⟩−j)α∨. The base alcove A is the unique alcove in the positive chamber with 0 in its closure; equivalently A is defined by 0<⟨α,v⟩<1 for every positive root α. If there are no roots, put A=V. For a nonsemisimple root datum the alcoves include the whole common root kernel as a factor. Define Waff=Q∨⋊W0, let Saff be its reflections in the walls of A, put We=Y⋊W0, and let Ω=Stab⁡We(A). The canonical affine Coxeter system and the decomposition We=Waff⋊Ω, including central lattice directions, are proved in Canonical affine geometry and wall parameters of a root datum ↗. In particular S0⊂Saff with the finite Weyl product orders. Define length on We as the number of walls separating A from its translate; on Waff it is Coxeter length, and its zero set is Ω. Thus no arbitrary nongeometric affine Coxeter extension is silently compared with the lattice below.

Choose a parameter function q:Saff→R>0 such that qs=qt whenever s,t∈Saff are conjugate as elements of We. This condition compares only elements in the domain of q; conjugation by all of We need not preserve Saff. In particular, every ω∈Ω preserves Saff and satisfies qωsω−1=qs, so its action preserves the quadratic relations. For s,t∈Saff with finite Coxeter label m(s,t), impose the alternating braid relation with m(s,t) factors. Define Haff(R,q) to be the quotient of the free associative C-algebra on (Ts)s∈Saff by those braid relations and

(Ts−qs)(Ts+1)=0(s∈Saff).

The extended Iwahori–Matsumoto affine Hecke algebra is the crossed product HIM(R,q):=Haff(R,q)⋊Ω. Its underlying vector space is Haff(R,q)⊗CC[Ω], with multiplication (hUω)(h′Uη)=h ω(h′)Uωη. Thus it adjoins symbols Uω with UωUη=Uωη and UωTsUω−1=Tωsω−1. The stated parameter condition makes each Ω-conjugation an algebra automorphism. If vs=qs>0 and Ns=qs−1/2Ts, then (Ns−vs)(Ns+vs−1)=0, the symmetric normalization in Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy.

This definition asserts neither an Iwahori–Matsumoto basis nor an equivalence with a Bernstein presentation. It does not identify an arbitrary reductive p-adic group's Iwahori-fixed category with modules over this algebra; that requires a separate group-specific equivalence.

Depends on

Used by

Dependency tree · two levels

19 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