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.

Bernstein PBW basis for the affine Hecke algebra of type A

Statement

Let n≥2, R0=Z[Q,Q−1], A=R0[X1±1,…,Xn±1], and Hnaff be the algebra of The multiplicative Bernstein presentation of the affine Hecke algebra of type A. For λ∈Zn and w∈Sn, write Xλ=X1λ1⋯Xnλn and let Tw be the finite Hecke product along a reduced expression of w. Then the coefficient map A→Hnaff is injective and

{XλTw:λ∈Zn, w∈Sn}

is an R0-basis of Hnaff. For every commutative R0-algebra R′, the scalar extension R′⊗R0Hnaff has basis (1⊗XλTw)λ,w and is the affine presentation with its relations mapped to R′.

Facts & Assumptions

Given: The universal affine presentation, the Laurent monomial algebra A, the finite type-A Coxeter group, and the polynomial-module homomorphism.

[F1]

The multiplicative Bernstein presentation of the affine Hecke algebra of type A: Hnaff is generated by Xj±1 and Ti, with the stated finite Hecke, braid, and Bernstein relations.

[F2]

The finite type-A Hecke basis over the multiplicative parameter ring: the finite algebra on the Ti with (Ti−Q)(Ti+1)=0 and type-A braids has basis (Tw)w∈Sn over R0.

[F3]

Demazure–Lusztig operators satisfy the affine type-A relations: the presented algebra maps to K⋊Sn; each operator is ci[1]+di[si] with di≠0, has the full Bernstein relation, and preserves A.

[F4]

The type-A weight lattice, Laurent ring, and divided differences: the monomials (Xλ)λ∈Zn are an R0-basis of A and A embeds in its fraction field K.

[F5]

Presentation base change and transport of explicit bases to commutative specializations: a presented algebra base-changes to the quotient by the images of its relations; tensoring a free module with a basis preserves the basis over every commutative specialization.

[F6]

The free associative R-algebra on a set and descent of relations: the free associative algebra is the free module on finite generator words, so every element of its quotient has a finite expression as a sum of generator words.

Proof

Given: The data of the Statement.

1.1F1F2F3F6givenconstruct

The images of the Laurent generators commute and are units by [F1], so their finite Laurent monomials define the coefficient map from A. Every element of the presented algebra is represented by a finite linear combination of words in Ti and Xj±1 by [F6]. To show spanning, take such a word and count its pairs in which a Ti occurs to the left of an Xj±1. If the count is positive, an adjacent out-of-order pair can be rewritten by the Bernstein relation of [F3] as a Laurent term with that pair reversed plus a finite Laurent sum with one fewer T; the second assertion uses that Di maps A to A. Induction first on the number of T factors and then on this pair count moves every Laurent factor to the left. The finite Ti generators in [F1] satisfy the presentation of Hn,Qfin, so its universal property maps Hn,Qfin to Hnaff; its basis in [F2] then expresses the remaining finite word as an R0-linear combination of Tw. Thus the displayed family spans.

1.2F2F3algebra

For a reduced expression w=si1⋯sim, expand the image of Tw under [F3] as a product of m factors cik[1]+dik[sik]. Each term is supported at a permutation expressed using at most m adjacent transpositions, so its Coxeter length is at most m. The coefficient of [w] can only come from choosing every reflection term: omitting one leaves fewer than m=ℓ(w) factors. Thus that coefficient is bw=∏k=1m(si1⋯sik−1)(dik), with the empty prefix acting as the identity. Every dik is nonzero by [F3] and each prefix acts by a field automorphism, so bw≠0 in K.

2.1F3F4step 1.2

Suppose ∑wfwTw=0 with fw∈A and finite support. If any coefficient is nonzero, choose the maximum length L of a w with fw≠0. Apply the homomorphism of [F3] and compare the coefficient of [w] for each such w with ℓ(w)=L. Terms indexed by v with ℓ(v)<L cannot contribute to [w] by step 1.2; terms with ℓ(v)=L contribute to [w] only when v=w, since a length-L permutation in the expansion requires choosing all L reflection terms and then equals v. Thus the coefficient of [w] is fwbw=0 in K. Since bw≠0 and A↪K by [F4], fw=0, a contradiction. Hence the family (Tw) is A-linearly independent.

3.1F4step 1.1step 2.1

Every h∈Hnaff has a finite expansion ∑wfwTw by step 1.1; step 2.1 makes that expansion unique. Expanding each fw in the Laurent monomial basis of [F4] proves that (XλTw)λ,w is an R0-basis. In particular, the coefficient map A→Hnaff is injective, since a finite relation among its Laurent monomials would be an R0-linear relation among the basis elements with w=1.

4.1F1F5step 3.1

For a commutative R0-algebra R′, [F5] identifies R′⊗R0Hnaff with the quotient of the free associative R′-algebra by the images of the defining relations, and carries the R0-basis of step 3.1 to the stated R′-basis. No generic-faithfulness argument after specialization is used; no flatness assumption on R′ is needed.

5.1F2F3F4F5step 1.1step 1.2step 2.1step 3.1step 4.1∎

The preceding steps prove spanning, independence over the universal domain, the faithful Laurent coefficient map, and transport of the explicit basis to every commutative base change. The proof is choice-free: it selects only a maximum from a finite support and uses the explicit monomial and operator bases.

Depends on

Used by

Cited to discharge well-definedness by The multiplicative Bernstein presentation of the affine Hecke algebra of type A.

Dependency tree · two levels

41 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