Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Bounded ordered monomials span the cyclotomic Hecke quotients

Statement

Over any commutative base ring A with invertible nondegenerate parameter, use the defining relations of Affine type-A presentations and charged cyclotomic quotients, writing qH for the nondegenerate Hecke parameter. For a monic cyclotomic polynomial f of degree ℓ>0, with unit constant term in the nondegenerate branch, the quotient by f(X1)=0 is spanned by X1a1⋯XdadTw,0≤ar<ℓ, w∈Sd, and the degenerate quotient by f(x1)=0 is spanned by x1a1⋯xdadw,0≤ar<ℓ, w∈Sd. In particular, over a field F each quotient has dimension at most ℓdd!. This applies to f(t)=∏i∈I(t−qHi)λi and f(t)=∏i∈I(t−i)λi in the two finite-quantum-characteristic branches, with ℓ=∑iλi. No independence and no separate relation f(Xr)=0 or f(xr)=0 for r>1 is asserted. If ℓ=0 and d>0, the imposed relation 1=0 gives the zero algebra with empty spanning family; for d=0 the algebra is A with the singleton empty monomial.

Facts & Assumptions

Given: The two presentations of Affine type-A presentations and charged cyclotomic quotients over A, a monic cyclotomic polynomial f of degree ℓ>0, and the quotients of the Statement.

[F1]

In the nondegenerate presentation the mixed relation is TrXrTr=qHXr+1 with qH invertible, Tr2=(qH−1)Tr+qH, the distant and braid relations hold, and Tr is invertible with Tr−1=qH−1(Tr−qH+1); in the degenerate presentation srxr=xr+1sr−1, srxr+1=xrsr+1, srxt=xtsr for t∉{r,r+1}, and the Coxeter relations hold (Affine type-A presentations and charged cyclotomic quotients, The generic type-A Hecke algebra).

[F2]

The Tr generate a quotient of the generic type-A Hecke algebra with standard basis {Tw:w∈Sd}, and the sr generate the quotient of A[Sd] with basis Sd; finite straightening in the Coxeter group reduces each word in the Tr (respectively sr) to a linear combination of the standard words (The standard basis of the generic type-A Hecke algebra, The symmetric group has the Coxeter presentation).

Proof

technique · direct

Given: The two presentations over A, the cyclotomic quotient by

f(X1)=0 (nondegenerate) or f(x1)=0 (degenerate), and the data of

[F1]–[F2].

1.1F1F2algebra

Elementary straightening of polynomials past a simple generator. In the nondegenerate branch the mixed relation gives, for a polynomial p in the commuting variables, Trp=(srp)Tr−(qH−1)Xr+1p−srpXr−Xr+1, and in the degenerate branch srp=(srp)sr−p−srpxr−xr+1. Both divided differences are polynomials: for p=Xrm the first identity is TrXrm=Xr+1mTr−(qH−1)(Xrm−1+Xrm−2Xr+1+⋯+Xr+1m−1)Xr+1, which follows from [F1] by induction on m, and the second is srxrm=xr+1msr−∑k=0m−1xrkxr+1m−1−k, again by induction; the general case follows from the divided-difference product rule for the two variable replacements Xr↔Xr+1 and xr↔xr+1. Consequently any word in the generators and polynomial variables rewrites as an A-linear combination of ordered monomials XaTw in the nondegenerate branch (the T-word reduced by [F2], polynomial factors collected by commutation) and of xaw in the degenerate branch. The nondegenerate straightening preserves total polynomial degree; the degenerate one lowers degree by one in the correction term.

2.1F1step 1.1algebra

The nondegenerate quotient is generated by positive powers. In the nondegenerate branch the relation f(X1)=0 has nonzero constant term a0, so X1−1=−a0−1(X1ℓ−1+aℓ−1X1ℓ−2+⋯+a1) is a polynomial in X1; and from TrXrTr=qHXr+1 one gets Xr+1−1=qHTr−1Xr−1Tr−1 by inverting the equation. Starting from the displayed polynomial expression for X1−1 and iterating this forward recursion expresses every Xr−1 through positive powers of X1 and the T's, since Tr−1=qH−1(Tr−qH+1) is a polynomial in Tr. Therefore the quotient is already generated, as an A-module, by words in X1,…,Xd and the Tr, and step 1.1 applies to them.

2.2F1F2step 1.1algebra

The transported relations in the nondegenerate branch. Put R1:=f(X1) and Rr+1:=TrRrTr; each Rr is zero in the quotient. We claim by induction on r that ordered straightening writes Rr=qHr−1Xrℓ+∑a,wca,wX1a1⋯XrarTw, where w∈Sr, ∑jaj≤ℓ, ar<ℓ, and no variable of index above r occurs. The case r=1 is the definition, with constant coefficient rearranged. For the induction step, direct summation of the mixed relation gives, for m≥1, TrXrmTr=qHXr+1m−(qH−1)∑k=1m−1XrkXr+1m−kTr, and for m=0 one uses Tr2=(qH−1)Tr+qH. Transporting the leading term qHr−1Xrℓ therefore produces exactly qHrXr+1ℓ plus terms of Xr+1-degree below ℓ. Each remainder monomial has Xr-degree ar<ℓ; variables of index below r commute with Tr and with Xr+1, and Tw∈Hr for w∈Sr, so applying the displayed formula to Xrar and then straightening the finite words TrTwTr, TwTr by [F2] produces terms of Xr+1-degree at most ar<ℓ and total polynomial degree at most ℓ. This proves the claim.

2.3F1F2step 1.1algebra

The transported relations in the degenerate branch. Put R1:=f(x1) and Rr+1:=srRrsr. Straightening and induction on r show Rr=xrℓ+∑a,wca,wxaw, where w∈Sr, all occurring variables have index at most r, and ∑jaj<ℓ: conjugation transports xrm by srxrmsr=xr+1m−∑k=0m−1xrkxr+1m−1−ksr, so the leading term xrℓ produces xr+1ℓ plus correction terms of total degree ℓ−1, and every old remainder, when straightened, stays of degree below ℓ.

3.1step 2.2algebra

Termination of the nondegenerate reduction. Order exponent vectors lexicographically as (ad,ad−1,…,a1), larger first differing coordinate larger; this is a well-order on Nd preserved by addition. Suppose ar≥ℓ for some r and some spanning monomial XaTw. Multiplying the zero relation Rr of step 2.2 on the left by Xa−ℓer and on the right by Tw gives a relation whose leading term is qHr−1XaTw and whose remaining terms all have the same coordinates above r and a strictly smaller r-th coordinate (increases in coordinates below r do not affect the lexicographic comparison), with w∈Sr and finite straightening changing no dot exponents. Since qHr−1 is a unit, this solves for XaTw as a combination of spanning monomials with strictly smaller exponent vector; well-founded induction on the lexicographic order terminates and expresses every element using only monomials with every ar<ℓ. Hence the bounded ordered monomials span the nondegenerate quotient, over A and after any base change.

3.2step 2.3algebra

Termination of the degenerate reduction. If ar≥ℓ, multiply the zero relation Rr of step 2.3 on the left by xa−ℓer and on the right by w; the leading term is xaw, and every other term has total degree strictly below ∑jaj (all other coefficients come from the remainder of Rr, of degree <ℓ). Induction on the total degree ∑jaj therefore expresses every element in terms of monomials xaw with all ar<ℓ. This also shows that no relation f(xr)=0 for r>1 is claimed: at level one f(t)=t, and x1=0 gives x2=s1, which is exactly the form of the reduced spanning family.

4.1step 2.1step 3.1step 3.2∎

Conclusion. Steps 1.1, 2.1 and 3.1 give the spanning statement for the nondegenerate quotient by f(X1)=0, and steps 1.1, 2.3 and 3.2 for the degenerate quotient by f(x1)=0, with all exponents ar<ℓ in both branches and no independence asserted. Since the spanning families have at most ℓdd! elements, each quotient has dimension at most ℓdd! over a field. The specialisations f(t)=∏i(t−qHi)λi and f(t)=∏i(t−i)λi are instances of the two branches with ℓ=∑iλi. For ℓ=0 the imposed relation is 1=0, giving the zero algebra for d>0 and A for d=0, as stated.

Remarks

The lemma is a pure spanning statement: no independence of the bounded ordered monomials is asserted here (the later cyclotomic basis theorem supplies it in the finite-dimensional setting). The two straightening identities are the only place where the difference between the nondegenerate and degenerate branches matters, and the reduction terminates by a well-order in the nondegenerate case and by total degree in the degenerate case. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

13 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