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.
Universal nondegenerate affine Hecke ordered monomials form a basis
Statement
Let be the universal Laurent parameter ring of Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules, and let be the -algebra presented there by the commuting units , the generators and the quadratic, braid, distant, Bernstein and mixed-commutation relations — without imposing the first-variable cyclotomic relation. Then:
- both families are -bases of , and the same two families are bases after arbitrary base change to a commutative ring in which is a unit;
- left multiplication by any nonzero element of the Laurent polynomial subalgebra is injective;
- after localizing at the differences (), the algebra maps into the rational crossed product of the fraction field of the polynomial ring with , and in that localization the elements satisfy for every (localized) Laurent polynomial .
No cyclotomic basis, Brundan–Kleshchev theorem, trace form or primitive-content assertion is used.
Facts & Assumptions
Given: The universal Laurent parameter ring , the affine presentation of the Statement, the symmetric group with its Coxeter presentation, and the parameters and in the rational crossed product.
In the relations , , for , and for hold, and are commuting units (Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules).
The quadratic relation makes invertible, with ; the generate a quotient of the generic type-A Hecke algebra, whose standard elements () span the subalgebra they generate; their independence in the affine algebra is proved below (The standard basis of the generic type-A Hecke algebra).
has the adjacent-transposition Coxeter presentation (The symmetric group has the Coxeter presentation). Set to be the minimum number of adjacent transpositions expressing ; a reduced expression means one attaining this minimum. The subword length estimate needed below is proved directly in step 1.3.
Proof
Given: The universal domain , its Laurent polynomial ring , the fraction field , and the data of [F1]–[F3].
Ordered spanning without localization. For every the presentation relations give , where . The correction is in : is divisible by , first for ordinary monomials by the difference-of-powers identity, and then for Laurent monomials after multiplying by a symmetric Laurent monomial unit. For this is the Bernstein relation, for it is its conjugate using the quadratic relation, and the general formula follows by addition and the product rule , including inverse generators by applying that rule to . Moving a polynomial across a reduces the number of misplaced polynomial factors, and correction terms reduce the number of factors; the finite Hecke relations then span the remaining words by . Thus is spanned over by the , and the presentation anti-involution fixing gives right ordered spanning too.
A representation of the unlocalized presentation. Form with multiplication . For distinct indices set and , and assign , . The rational identities and give the quadratic relation. For three distinct indices, expansion of the two braid products in their six permutation coefficients agrees: the longest coefficients are in either order; the two length-two coefficients agree by commuting scalar factors; the length-one and identity coefficients agree using together with the preceding quadratic identities. These identities follow by multiplying by the common product of the differences and expanding the polynomial numerators. Distant relations follow from disjoint variable pairs. Finally , so the Bernstein and mixed relations hold. All denominators here are nonzero polynomials in independent variables in the domain . This defines a homomorphism from the unlocalized presented algebra to .
Independence over the base ring. For a reduced word , the coefficient of the group element in the image of is Every factor is a nonzero rational function. Every other term uses at most of the adjacent transpositions, so its permutation has minimum word length at most , directly by the definition of length in [F3]. No Bruhat-order assertion is needed. In a finite relation with , select a label of maximal length with . Its group-element coefficient is and receives no contribution from any other label of that maximal length or from shorter labels, so it is nonzero in , a contradiction. Hence the are -linearly independent and the representation is injective. Since the Laurent monomials are an -basis of , this proves that are an -basis; the anti-involution proves the right basis. Tensoring this free basis with any commutative -algebra preserves it, and tensoring the generators-and-relations presentation gives exactly the same affine presentation over that algebra. As the unused parameters do not enter the relations, any commutative coefficient ring with unit is obtained by sending every to . Thus the asserted arbitrary base change is valid, without inverting differences in the base-changed algebra.
Localization and intertwiners. Let be the multiplicative set generated by all with . It is invariant under . The mixed formula of step 1.1 extends to by the same product rule and by solving the formula for inverses of elements of ; the correction remains in . Consequently adjoining these inverses gives the algebra with free left coefficient module and the same multiplication rules. This realizes the localization: the inverse formulas make it universal among homomorphisms inverting , and its injective representation in follows from the identical maximal-length argument of step 1.3. In it put ; the mixed formula gives for all . Products along reduced words have unitriangular expansions in the , because selecting every gives and selecting any scalar correction leaves strictly shorter words; thus they too form a basis over . No parameter difference , quantum factorial or Gram determinant is inverted.
Polynomial multiplication is injective over the universal domain. If and , then gives for each by step 1.3. Since is a domain, every , so . The right-basis argument gives the analogous right multiplication result. This injectivity assertion is over the universal domain, as in Statement (2), and does not assert injectivity of nonzero zero divisors after arbitrary base change.
Subword support in the localization. Expanding a reduced product and moving coefficients left using step 2.1 gives terms supported on products of subwords of the reduced word. Every coefficient is a sum of products of permuted functions and hence has only variable-difference denominators. Equivalently, in the crossed product , so moving a localized polynomial through such a term replaces it by the corresponding subword permutation applied to . This proves the subword expansion used by consumers and the asserted intertwining throughout the embedded localization.
Conclusion. Step 1.3 proves both ordered bases over and after arbitrary base change with unit ; step 2.2 proves the universal-domain injectivity; and steps 2.1 and 3.1 prove the localized embedding and intertwining identity. For there are no polynomial or Hecke generators, consists of the identity, the lone ordered monomial is , and ; all localization and intertwining clauses are then vacuous. No cyclotomic basis, trace form, primitive-content assertion or Brundan–Kleshchev result is used.
Remarks
The universal statement is stated over the characteristic-zero Laurent domain and then specializes by base change, so all polynomial identities in the proof are identities in . The proof uses no choice principle: all straightening, triangularity and expansion steps are finite.
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
- Mathas, The representation theory of the Ariki–Koike and cyclotomic q-Schur algebras, math/0204025 (standard reference, not scraped)
- Mathas, Hecke algebras and Schur algebras of the symmetric group, complete 79-page manuscript (standard reference, not scraped)
- Lyle–Mathas, Blocks of cyclotomic Hecke algebras, math/0607451v4 (standard reference, not scraped)