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 , , , and be the algebra of The multiplicative Bernstein presentation of the affine Hecke algebra of type A. For and , write and let be the finite Hecke product along a reduced expression of . Then the coefficient map is injective and
is an -basis of . For every commutative -algebra , the scalar extension has basis and is the affine presentation with its relations mapped to .
Facts & Assumptions
Given: The universal affine presentation, the Laurent monomial algebra , the finite type-A Coxeter group, and the polynomial-module homomorphism.
The multiplicative Bernstein presentation of the affine Hecke algebra of type A: is generated by and , with the stated finite Hecke, braid, and Bernstein relations.
The finite type-A Hecke basis over the multiplicative parameter ring: the finite algebra on the with and type-A braids has basis over .
Demazure–Lusztig operators satisfy the affine type-A relations: the presented algebra maps to ; each operator is with , has the full Bernstein relation, and preserves .
The type-A weight lattice, Laurent ring, and divided differences: the monomials are an -basis of and embeds in its fraction field .
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.
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.
The images of the Laurent generators commute and are units by [F1], so their finite Laurent monomials define the coefficient map from . Every element of the presented algebra is represented by a finite linear combination of words in and by [F6]. To show spanning, take such a word and count its pairs in which a occurs to the left of an . 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 ; the second assertion uses that maps to . Induction first on the number of factors and then on this pair count moves every Laurent factor to the left. The finite generators in [F1] satisfy the presentation of , so its universal property maps to ; its basis in [F2] then expresses the remaining finite word as an -linear combination of . Thus the displayed family spans.
For a reduced expression , expand the image of under [F3] as a product of factors . Each term is supported at a permutation expressed using at most adjacent transpositions, so its Coxeter length is at most . The coefficient of can only come from choosing every reflection term: omitting one leaves fewer than factors. Thus that coefficient is , with the empty prefix acting as the identity. Every is nonzero by [F3] and each prefix acts by a field automorphism, so in .
Suppose with and finite support. If any coefficient is nonzero, choose the maximum length of a with . Apply the homomorphism of [F3] and compare the coefficient of for each such with . Terms indexed by with cannot contribute to by step 1.2; terms with contribute to only when , since a length- permutation in the expansion requires choosing all reflection terms and then equals . Thus the coefficient of is in . Since and by [F4], , a contradiction. Hence the family is -linearly independent.
Every has a finite expansion by step 1.1; step 2.1 makes that expansion unique. Expanding each in the Laurent monomial basis of [F4] proves that is an -basis. In particular, the coefficient map is injective, since a finite relation among its Laurent monomials would be an -linear relation among the basis elements with .
For a commutative -algebra , [F5] identifies with the quotient of the free associative -algebra by the images of the defining relations, and carries the -basis of step 3.1 to the stated -basis. No generic-faithfulness argument after specialization is used; no flatness assumption on is needed.
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
- The multiplicative Bernstein presentation of the affine Hecke algebra of type A
- The type-A weight lattice, Laurent ring, and divided differences
- The finite type-A Hecke basis over the multiplicative parameter ring
- Demazure–Lusztig operators satisfy the affine type-A relations
- Presentation base change and transport of explicit bases to commutative specializations
- The free associative R-algebra on a set and descent of relations
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
- Alexander A. Kirillov, Jr., Lectures on the affine Hecke algebras and Macdonald conjectures (Harvard lectures, 1994; arXiv:math/9501219v1) (standard reference, not scraped)
- I. G. Macdonald, Affine Hecke algebras and orthogonal polynomials, Séminaire Bourbaki 797, Astérisque 237 (1996), pp. 189–207 (standard reference, not scraped)
- Eric Opdam and Maarten Solleveld, Homological algebra for affine Hecke algebras (2007) (standard reference, not scraped)