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 with invertible nondegenerate parameter, use the defining relations of Affine type-A presentations and charged cyclotomic quotients, writing for the nondegenerate Hecke parameter. For a monic cyclotomic polynomial of degree , with unit constant term in the nondegenerate branch, the quotient by is spanned by and the degenerate quotient by is spanned by In particular, over a field each quotient has dimension at most . This applies to and in the two finite-quantum-characteristic branches, with . No independence and no separate relation or for is asserted. If and , the imposed relation gives the zero algebra with empty spanning family; for the algebra is with the singleton empty monomial.
Facts & Assumptions
Given: The two presentations of Affine type-A presentations and charged cyclotomic quotients over , a monic cyclotomic polynomial of degree , and the quotients of the Statement.
In the nondegenerate presentation the mixed relation is with invertible, , the distant and braid relations hold, and is invertible with ; in the degenerate presentation , , for , and the Coxeter relations hold (Affine type-A presentations and charged cyclotomic quotients, The generic type-A Hecke algebra).
The generate a quotient of the generic type-A Hecke algebra with standard basis , and the generate the quotient of with basis ; finite straightening in the Coxeter group reduces each word in the (respectively ) 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
Given: The two presentations over , the cyclotomic quotient by
(nondegenerate) or (degenerate), and the data of
[F1]–[F2].
Elementary straightening of polynomials past a simple generator. In the nondegenerate branch the mixed relation gives, for a polynomial in the commuting variables, and in the degenerate branch Both divided differences are polynomials: for the first identity is , which follows from [F1] by induction on , and the second is , again by induction; the general case follows from the divided-difference product rule for the two variable replacements and . Consequently any word in the generators and polynomial variables rewrites as an -linear combination of ordered monomials in the nondegenerate branch (the -word reduced by [F2], polynomial factors collected by commutation) and of in the degenerate branch. The nondegenerate straightening preserves total polynomial degree; the degenerate one lowers degree by one in the correction term.
The nondegenerate quotient is generated by positive powers. In the nondegenerate branch the relation has nonzero constant term , so is a polynomial in ; and from one gets by inverting the equation. Starting from the displayed polynomial expression for and iterating this forward recursion expresses every through positive powers of and the 's, since is a polynomial in . Therefore the quotient is already generated, as an -module, by words in and the , and step 1.1 applies to them.
The transported relations in the nondegenerate branch. Put and ; each is zero in the quotient. We claim by induction on that ordered straightening writes where , , , and no variable of index above occurs. The case is the definition, with constant coefficient rearranged. For the induction step, direct summation of the mixed relation gives, for , and for one uses . Transporting the leading term therefore produces exactly plus terms of -degree below . Each remainder monomial has -degree ; variables of index below commute with and with , and for , so applying the displayed formula to and then straightening the finite words , by [F2] produces terms of -degree at most and total polynomial degree at most . This proves the claim.
The transported relations in the degenerate branch. Put and . Straightening and induction on show where , all occurring variables have index at most , and : conjugation transports by so the leading term produces plus correction terms of total degree , and every old remainder, when straightened, stays of degree below .
Termination of the nondegenerate reduction. Order exponent vectors lexicographically as , larger first differing coordinate larger; this is a well-order on preserved by addition. Suppose for some and some spanning monomial . Multiplying the zero relation of step 2.2 on the left by and on the right by gives a relation whose leading term is and whose remaining terms all have the same coordinates above and a strictly smaller -th coordinate (increases in coordinates below do not affect the lexicographic comparison), with and finite straightening changing no dot exponents. Since is a unit, this solves for 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 . Hence the bounded ordered monomials span the nondegenerate quotient, over and after any base change.
Termination of the degenerate reduction. If , multiply the zero relation of step 2.3 on the left by and on the right by ; the leading term is , and every other term has total degree strictly below (all other coefficients come from the remainder of , of degree ). Induction on the total degree therefore expresses every element in terms of monomials with all . This also shows that no relation for is claimed: at level one , and gives , which is exactly the form of the reduced spanning family.
Conclusion. Steps 1.1, 2.1 and 3.1 give the spanning statement for the nondegenerate quotient by , and steps 1.1, 2.3 and 3.2 for the degenerate quotient by , with all exponents in both branches and no independence asserted. Since the spanning families have at most elements, each quotient has dimension at most over a field. The specialisations and are instances of the two branches with . For the imposed relation is , giving the zero algebra for and for , 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
- Basis and dimension of the cyclotomic Hecke algebra Lemma
- Generic cyclotomic type-A support is bounded by rank Lemma
- Polynomial spectra and central content sectors of finite cyclotomic Hecke algebras Lemma
- The degenerate cyclotomic Hecke center is the symmetric polynomial image Lemma
- Universal cyclotomic Hecke ordered monomials form a basis Lemma
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
- Brundan and Kleshchev, Blocks of cyclotomic Hecke algebras and Khovanov-Lauda algebras, arXiv:0808.2032v4 (standard reference, not scraped)