Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 R:=Z[z±1,U1±1,…,Uℓ±1] be the universal Laurent parameter ring of Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules, and let Hnaff be the R-algebra presented there by the commuting units X1,…,Xn, the generators T1,…,Tn−1 and the quadratic, braid, distant, Bernstein and mixed-commutation relations — without imposing the first-variable cyclotomic relation. Then:

  1. both families XaTwandTwXa(a∈Zn, w∈Sn) are R-bases of Hnaff, and the same two families are bases after arbitrary base change to a commutative ring in which z is a unit;
  2. left multiplication by any nonzero element of the Laurent polynomial subalgebra R[X1±1,…,Xn±1]⊆Hnaff is injective;
  3. after localizing at the differences Xi−Xj (i≠j), the algebra maps into the rational crossed product of the fraction field of the polynomial ring with Sn, and in that localization the elements Φi:=Ti−(z−1)Xi+1Xi+1−Xi=Ti−ci,i+1,cij:=(z−1)XjXj−Xi, satisfy Φif=si(f)Φi for every (localized) Laurent polynomial f.

No cyclotomic basis, Brundan–Kleshchev theorem, trace form or primitive-content assertion is used.

Facts & Assumptions

Given: The universal Laurent parameter ring R, the affine presentation Hnaff of the Statement, the symmetric group Sn with its Coxeter presentation, and the parameters cij=(z−1)Xj/(Xj−Xi) and dij=(Xj−zXi)/(Xj−Xi) in the rational crossed product.

[F1]

In Hnaff the relations (Ti−z)(Ti+1)=0, TiTi+1Ti=Ti+1TiTi+1, TiTj=TjTi for ∣i−j∣>1, TiXiTi=zXi+1 and XjTi=TiXj for j∉{i,i+1} hold, and X1,…,Xn are commuting units (Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules).

[F2]

The quadratic relation makes Ti invertible, with Ti−1=z−1(Ti−(z−1)); the Ti generate a quotient of the generic type-A Hecke algebra, whose standard elements Tw (w∈Sn) span the subalgebra they generate; their independence in the affine algebra is proved below (The standard basis of the generic type-A Hecke algebra).

[F3]

Sn has the adjacent-transposition Coxeter presentation (The symmetric group has the Coxeter presentation). Set ℓ(w) to be the minimum number of adjacent transpositions expressing w; a reduced expression means one attaining this minimum. The subword length estimate needed below is proved directly in step 1.3.

Proof

technique · direct

Given: The universal domain R, its Laurent polynomial ring P=R[X1±1,…,Xn±1], the fraction field K=Frac⁡(P), and the data of [F1]–[F3].

1.1F1F2algebra

Ordered spanning without localization. For every f∈P the presentation relations give Tif=si(f)Ti+ci,i+1(f−si(f)), where ci,i+1=(z−1)Xi+1/(Xi+1−Xi). The correction is in P: f−si(f) is divisible by Xi+1−Xi, first for ordinary monomials by the difference-of-powers identity, and then for Laurent monomials after multiplying by a symmetric Laurent monomial unit. For f=Xi this is the Bernstein relation, for f=Xi+1 it is its conjugate using the quadratic relation, and the general formula follows by addition and the product rule fg−si(fg)=(f−si(f))g+si(f)(g−si(g)), including inverse generators by applying that rule to ff−1=1. Moving a polynomial across a T reduces the number of misplaced polynomial factors, and correction terms reduce the number of T factors; the finite Hecke relations then span the remaining words by Tw. Thus Hnaff is spanned over P by the Tw, and the presentation anti-involution fixing Xi,Ti gives right ordered spanning too.

1.2F1algebra

A representation of the unlocalized presentation. Form K⋊Sn with multiplication (fσ)(gτ)=fσ(g)στ. For distinct indices set cij=(z−1)Xj/(Xj−Xi) and dij=(Xj−zXi)/(Xj−Xi)=z−cij, and assign Ti↦ci,i+1+di,i+1si, Xj↦Xj. The rational identities cij+cji=z−1 and dijdji=z+(z−1)cij−cij2 give the quadratic relation. For three distinct indices, expansion of the two braid products in their six permutation coefficients agrees: the longest coefficients are dijdikdjk in either order; the two length-two coefficients agree by commuting scalar factors; the length-one and identity coefficients agree using cijcjk=cik(cij+cjk−(z−1)) 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 Tif−si(f)Ti=ci,i+1(f−si(f)), so the Bernstein and mixed relations hold. All denominators here are nonzero polynomials in independent variables in the domain P. This defines a homomorphism from the unlocalized presented algebra to K⋊Sn.

1.3F3step 1.1step 1.2algebra

Independence over the base ring. For a reduced word w=si1⋯sik, the coefficient of the group element w in the image of Tw is Dw=di1,i1+1 si1(di2,i2+1)⋯(si1⋯sik−1)(dik,ik+1)≠0. Every factor is a nonzero rational function. Every other term uses at most k−1 of the k adjacent transpositions, so its permutation has minimum word length at most k−1, directly by the definition of length in [F3]. No Bruhat-order assertion is needed. In a finite relation ∑wfwTw=0 with fw∈P, select a label w of maximal length with fw≠0. Its group-element coefficient is fwDw and receives no contribution from any other label of that maximal length or from shorter labels, so it is nonzero in K, a contradiction. Hence the Tw are P-linearly independent and the representation is injective. Since the Laurent monomials Xa are an R-basis of P, this proves that XaTw are an R-basis; the anti-involution proves the right basis. Tensoring this free basis with any commutative R-algebra preserves it, and tensoring the generators-and-relations presentation gives exactly the same affine presentation over that algebra. As the unused U parameters do not enter the relations, any commutative coefficient ring with unit z is obtained by sending every Ua to 1. Thus the asserted arbitrary base change is valid, without inverting differences in the base-changed algebra.

2.1step 1.1step 1.2step 1.3algebra

Localization and intertwiners. Let S be the multiplicative set generated by all Xi−Xj with i≠j. It is invariant under Sn. The mixed formula of step 1.1 extends to S−1P by the same product rule and by solving the formula for inverses of elements of S; the correction remains in S−1P. Consequently adjoining these inverses gives the algebra with free left coefficient module ⨁w(S−1P)Tw and the same multiplication rules. This realizes the localization: the inverse formulas make it universal among homomorphisms inverting S, and its injective representation in K⋊Sn follows from the identical maximal-length argument of step 1.3. In it put Φi=Ti−ci,i+1; the mixed formula gives Φif=si(f)Φi for all f∈S−1P. Products Φw along reduced words have unitriangular expansions in the Tv, because selecting every T gives Tw and selecting any scalar correction leaves strictly shorter words; thus they too form a basis over S−1P. No parameter difference Ua−Ub, quantum factorial or Gram determinant is inverted.

2.2step 1.3algebra

Polynomial multiplication is injective over the universal domain. If 0≠f∈P and h=∑wfwTw, then fh=0 gives ffw=0 for each w by step 1.3. Since P is a domain, every fw=0, so h=0. 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.

3.1F3step 2.1algebra

Subword support in the localization. Expanding a reduced product Tw=∏t(Φit+cit,it+1) 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 c functions and hence has only variable-difference denominators. Equivalently, in the crossed product Φi=di,i+1si, so moving a localized polynomial f through such a term replaces it by the corresponding subword permutation applied to f. This proves the subword expansion used by consumers and the asserted intertwining throughout the embedded localization.

4.1step 1.3step 2.2step 2.1step 3.1algebra∎

Conclusion. Step 1.3 proves both ordered bases over R and after arbitrary base change with unit z; step 2.2 proves the universal-domain injectivity; and steps 2.1 and 3.1 prove the localized embedding and intertwining identity. For n=0 there are no polynomial or Hecke generators, S0 consists of the identity, the lone ordered monomial is 1, and H0aff=R; 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 R. 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