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.
Cyclotomic Murphy elements
Definition
Fix and work in the universal cyclotomic algebra of The multiplicative cyclotomic Hecke algebra, with parameters , commuting Jucys–Murphy generators , and finite generators . For an -multipartition , put and define Let be the row-standard initial multitableau from Cell data, multipartition dominance, and higher-cell ideals. Let be the subgroup of that permutes labels within each row of , and set and . The anti-involution is the generator-fixing map of The cyclotomic anti-involution fixes the affine and Murphy generators.
For a standard multitableau , use the right entry action , where the left action applies to every entry. Let be the unique permutation with . Standardness implies that is the distinguished minimal representative for its row-stabilizer coset. For standard of shape , define These are specified elements of ; this definition does not assert their linear independence or cellularity.
Facts & Assumptions
Given: , the universal parameters, the presentation of , and a multipartition of with standard multitableaux .
commute, , and for every polynomial in these variables, ; the quotient is a polynomial. (Cyclotomic Jucys–Murphy generators and their transport relations)
The affine Hecke generators are units, the cyclotomic parameters are units, and the quotient relation is imposed on only. (The multiplicative cyclotomic Hecke algebra)
The finite type-A elements are well-defined from reduced words, and parabolic row subgroups have unique distinguished coset representatives with length additivity. (The standard basis of the generic Hecke algebra and base change, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification)
The -linear anti-involution fixes every and satisfies . (The cyclotomic anti-involution fixes the affine and Murphy generators, The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization)
In component , the labels of form the consecutive interval ; each row of is a consecutive subinterval. (Multipartitions, standard multitableaux, and generic contents, Cell data, multipartition dominance, and higher-cell ideals)
Verification
The commuting property in [F1] makes each product in a defined polynomial element. The presentation [F2] supplies the coefficient ring, unit parameters, and quotient in which these polynomials live. The row subgroup is a product of finite symmetric groups on consecutive row intervals, so every in is a defined finite Hecke element by [F3]. For standard , the equality determines uniquely because the entry action is free; row-increasing entries mean that this representative is minimal in the row-stabilizer coset, by the parabolic description in [F3]. Thus all displayed expressions are elements of .
It remains to verify the stated commutation. Let generate a row factor belonging to component , so lie in that component's label interval. For a factor with index , [F5] gives , so every in is distant from and commutes with it by [F1]. For a factor with , [F5] gives , so the factor contains both and ; the entire product over is invariant under swapping . The divided-difference term in [F1] is then zero, and [F1] gives commutation with . Therefore commutes with every generator of , hence with every in that group and with their sum .
Since the row subgroup is closed under inversion, . Also by [F4]. The commutation proved in step 2.1 gives . Applying the anti-involution to the defining formula for now yields .
Depends on
- The multiplicative cyclotomic Hecke algebra
- Cell data, multipartition dominance, and higher-cell ideals
- Multipartitions, standard multitableaux, and generic contents
- Cyclotomic Jucys–Murphy generators and their transport relations
- The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization
- The cyclotomic anti-involution fixes the affine and Murphy generators
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- The standard basis of the generic Hecke algebra and base change
Used by
- Rank-one cyclotomic cell modules and their forms Example
- Rank-two type-A cell modules at a singular parameter Example
- Componentwise initial-row straightening Lemma
- Cyclotomic component shift and multipartition dominance ideals Lemma
- Integral type-A Garnir straightening and the Murphy cell law Lemma
- Ordinary Murphy straightening preserves both tableau prefixes Lemma
- The cyclotomic Murphy basis and cellularity Theorem
Dependency tree · two levels
36 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
- Richard Dipper, Gordon James, and Andrew Mathas, Cyclotomic q-Schur algebras, Mathematische Zeitschrift 229 (1998), 385–416 (standard reference, not scraped)
- Andrew Mathas, Hecke algebras with cyclotomic parameters, in Iwahori-Hecke Algebras and Schur Algebras of the Symmetric Group, complete preliminary lecture manuscript (standard reference, not scraped)
- Jun Hu and Andrew Mathas, Seminormal forms and cyclotomic quiver Hecke algebras of type A, arXiv:1304.0906v3 (2014) (standard reference, not scraped)