Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 center of the universal affine Hecke algebra of type A

Statement

Let Hnaff be the universal algebra over R0=Z[Q,Q−1] from The multiplicative Bernstein presentation of the affine Hecke algebra of type A, and let A=R0[X1±1,…,Xn±1]. Write Z(Hnaff):={z∈Hnaff:zh=hz for every h∈Hnaff} and ASn:={f∈A:w(f)=f for every w∈Sn}. Then, over this universal coefficient ring,

Z(Hnaff)=ASn.

This theorem is stated only over R0; it makes no assertion that the center of an arbitrary scalar specialization is the scalar extension of this center.

Facts & Assumptions

Given: The universal affine algebra, its Bernstein generators, its PBW basis, and the rational skew group representation.

[F1]

Bernstein PBW basis for the affine Hecke algebra of type A: every element of Hnaff has a unique finite expansion ∑w∈SnfwTw with fw∈A, and the coefficient map A→Hnaff is injective.

[F2]

Demazure–Lusztig operators satisfy the affine type-A relations: the map ρ:Hnaff→K⋊Sn is an algebra homomorphism, with each simple operator of the form ci[1]+di[si] and di≠0.

[F3]

The rational skew group algebra for type A: K⋊Sn has basis [u] over K and multiplication (a[u])(b[v])=a u(b)[uv]; in particular [u]Xj=u(Xj)[u].

[F4]

The multiplicative Bernstein presentation of the affine Hecke algebra of type A: Tif−si(f)Ti=(Q−1)Di(f) for f∈A, and Di(f)=(f−si(f))/(1−Xi/Xi+1).

[F5]

The type-A weight lattice, Laurent ring, and divided differences: A is an integral domain with Laurent monomial basis (Xλ)λ∈Zn and embeds injectively in its fraction field K.

Proof

Given: The data of the Statement.

1.1F1F3F5givenalgebra

Let z∈Z(Hnaff) and write its unique PBW expansion z=∑wfwTw using [F1]. Its image p=ρ(z) commutes with each Xj[1]. Write p=∑u∈Sngu[u] in the skew-group basis of [F3]. The coefficient of [u] in pXj−Xjp is gu(u(Xj)−Xj) by [F3]. Since this is zero for every j, any u with gu≠0 fixes each Laurent variable. The variables are distinct basis monomials in A and remain distinct in its fraction field K by [F5], so a permutation fixing them all is the identity. Therefore p=g1[1]∈K[1].

2.1F1F2F5step 1.1algebra

Suppose some fw≠0 for a nonidentity permutation. Choose the maximum L>0 among lengths of such w. For a reduced expression w=si1⋯siL, expansion of the factors cik[1]+dik[sik] from [F2] shows that every term in ρ(Tw) has length at most L, and its coefficient at [w] is the nonzero product bw=∏k=1L(si1⋯sik−1)(dik): omitting any reflection factor leaves fewer than L simple transpositions, so cannot produce w. A different v of length L contributes to [w] only if v=w, and one of smaller length cannot contribute. But step 1.1 shows p has no nonidentity permutation coefficient. Thus fwbw=0 in K, and since bw≠0 and A↪K by [F5], every such fw=0, contradicting the choice of L. It follows that z=f1∈A.

3.1F1F4step 2.1algebra

Since z is central and z∈A by step 2.1, [F4] gives 0=Tiz−zTi=(si(z)−z)Ti+(Q−1)Di(z). The PBW basis of [F1] is an A-basis, so the coefficients of Tsi=Ti and Tid=1 vanish separately. Thus si(z)=z for each i, and the adjacent transpositions generate Sn, so z∈ASn.

4.1F1F4step 3.1∎

If f∈ASn, then si(f)=f and Di(f)=0 for every i by [F4], so the Bernstein relation gives Tif=fTi. Since A is commutative and the algebra is generated by A and the Ti, f commutes with every generator and is central. This reverse inclusion with step 3.1 proves Z(Hnaff)=ASn over R0. No specialization or Choice principle is used.

Depends on

Used by

Dependency tree · two levels

14 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