Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

The cyclotomic Murphy basis and cellularity

Statement

Let R=Z[Q±1,u1±1,…,ur±1] and let Hr,n be the multiplicative cyclotomic Hecke algebra of The multiplicative cyclotomic Hecke algebra. For every r-multipartition λ and standard multitableaux s,t of shape λ, form mst=Td(s)∗uλxλTd(t) using Cyclotomic Murphy elements. Then the elements mst form an R-basis of Hr,n, satisfy mst∗=mts, and obey the dominance cell law msth≡∑v∈Std⁡(λ)rt,v(h)msv(modN▹λ) for every h∈Hr,n, with coefficients independent of s. The dominance spans N⊵λ and N▹λ are two-sided ideals. The basis and cell law hold over the universal ring and after every commutative base change; no semisimplicity or invertibility of quantum integers is assumed after specialization; the identities descend from the universal integral ring.

Here N⊵λ is the R-span of all muv whose common shape μ satisfies μ⊵λ, and N▹λ is the span of those with μ▹λ.

Facts & Assumptions

Given: The universal coefficient ring, the multiplicative cyclotomic presentation, the multipartition dominance order, and the standard Murphy elements.

[F1]

Cyclotomic component shift and multipartition dominance ideals: the component shift identity and the asserted dominance support and ideal closure under X1 and finite generators.

[F2]

Componentwise initial-row straightening: componentwise composition straightening, dominance support, and coefficient independence in the finite-generator cell law.

[F3]

Integral type-A Garnir straightening and the Murphy cell law: the ordinary type-A integral Murphy basis and dominance cell law.

[F4]

The Ariki–Koike PBW basis and generic splitness: Hr,n is free over R of rank rnn!, with the stated basis after arbitrary commutative base change.

[F5]

Colored RSK and the multipartition square count: the number of pairs of standard multitableaux of equal shape is ∑λ∣Std⁡(λ)∣2=rnn!.

[F6]

Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace: a square spanning family of a finite free module of equal rank has a coordinate matrix with right inverse and unit determinant.

[F7]

Cell data, multipartition dominance, and higher-cell ideals: a basis, involution, and dominance-independent coefficient law define a cell datum; the higher-cell spans are ideals.

Proof

Given: Hr,n, the Murphy elements, and the facts in the Statement.

1.1F1F2F3algebra

For every λ, the componentwise and shift lemmas [F1]–[F3] give two-sided ideals N⊵λ,N▹λ and show that right multiplication by any algebra generator preserves shape dominance. They also give the fixed-initial-row law for mtλ,t: modulo N▹λ it is a linear combination of mtλ,v, with coefficients independent of the first index after left multiplication. To see closure under the full generator set, use the finite generators Ti and X1 from [F1]; the cyclotomic polynomial has unit constant coefficient, so X1−1 is a polynomial in X1, while Ti−1=Q−1(Ti−(Q−1)) and the recursion expresses every Xj as a word in Ti,X1.

2.1F1F2F3step 1.1

Let Uλ be the span of mtλ,v for standard v of shape λ. The fixed-initial-row law shows Uλ+N▹λ is a right ideal. For any h∈Hr,n there are coefficients rt,v(h) such thatmtλ,th≡∑vrt,v(h)mtλ,v(modN▹λ). Since N▹λ is a two-sided ideal, multiplying by Td(s)∗ gives the displayed cell law for every s, and the coefficients remain independent of s. The generator-fixing anti-involution gives mst∗=mts.

3.1F1F2step 2.1algebra

The row-filled multipartition λ0=(∅,…,∅,(1n)) is dominated by every multipartition. Before the final component its cumulative counts are zero. At the first k rows of the final component its count is min⁡(k,n). If a multipartition has a boxes in earlier components and final component γ, then ∣γ∣=n−a and the first k rows of the partition γ contain at least min⁡(k,n−a) boxes; thus its cumulative count is at least a+min⁡(k,n−a)≥min⁡(k,n). Its row subgroup is trivial and its cyclotomic factor uλ0 is empty, so mtλ0,tλ0=1. Taking λ=λ0 in step 2.1 expresses every h∈Hr,n as a linear combination of the one initial-row layer elements plus elements of N▹λ0, which by definition are in the span of the standard Murphy family. Hence the family spans Hr,n.

4.1F4F5F6F7step 2.1step 3.1∎

By [F5] the spanning family has rnn! elements, and by [F4] the algebra is free of rank rnn! over R. Its square coordinate matrix is surjective, so [F6] gives a right inverse; taking determinants shows its determinant is a unit. Therefore the family is an R-basis. Together with step 2.1 this gives a cellular basis and the stated dominance ideals by [F7]. Tensoring the universal basis and its multiplication congruences along any commutative base change gives the same basis and cell law after specialization.

Depends on

Used by

Dependency tree · two levels

59 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