Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules

Definition

Let R be a commutative ring, let n≥0 and ℓ≥1, and let z,U1,…,Uℓ be units of R (Algebras over a commutative ring, central structure maps, and algebra homomorphisms). The arbitrary-level cyclotomic Hecke algebra Hn=Hn(R;z;U1,…,Uℓ) is the R-algebra presented by invertible commuting elements X1,…,Xn and generators T1,…,Tn−1 subject to the relations (Ti−z)(Ti+1)=0,TiTi+1Ti=Ti+1TiTi+1,TiTj=TjTi(∣i−j∣>1), TiXiTi=zXi+1,XjTi=TiXj(j∉{i,i+1}),∏a=1ℓ(X1−Ua)=0. For n=0 set H0=R. The grading variable of this page is v, not the unit z: the two are identified only where a statement says so explicitly.

Multipartitions and Murphy data. An ℓ-multipartition of n is an ordered tuple λ=(λ(1),…,λ(ℓ)) of partitions with ∑b∣λ(b)∣=n (Tableaux and standard tableaux). Multipartitions are partially ordered by dominance, λ⊵μ meaning that ∑b<k∣λ(b)∣+∑j≤mλj(k)≥∑b<k∣μ(b)∣+∑j≤mμj(k) for all k,m. Fill the diagram tλ with 1,…,n in component order, then row order, then column order. Put ak:=∑b<k∣λ(b)∣, uλ:=∏k=1ℓ∏j≤ak(Xj−Uk), xλ:=∑w∈SλTw, and mλ:=xλuλ, where Sλ is the row subgroup: the subgroup of Sn stabilizing the rows of tλ (The finite symmetric group Sn, one-line notation, and cycle notation, The generic type-A Hecke algebra). Write Mλ:=mλHn for the right Hn-submodule generated by mλ (Unital left and right modules over a ring; unqualified module means left module). The presentation involution ∗ of Hn fixes every Xj and every Ti and reverses products. For standard tableaux s,t of shape λ put mst:=Td(s)∗mλTd(t), where the right tableau action is t⋅w:=w−1⋅t (the left action relabels entries), and d(s) is determined by tλ⋅d(s)=s. Denote by H>λ the span of the higher Murphy shapes once their basis and cell law is established by The arbitrary-level cyclotomic Hecke Murphy basis is cellular ↗, and by Sλ the right cell (Specht) module with basis mt and the action given by that cell law; its cellular form defines Dλ:=Sλ/rad⁡Sλ, which may vanish.

Types. The types used below are exactly all ℓ-multipartitions of n, including tuples with empty components — not all multicompositions. A semistandard tableau S has entries the labels (i,k) (row i in component k) ordered by component first and then by row, weakly increasing along rows, strictly increasing down columns, and a label of component a may occur only in physical component b≤a (Semistandard tableaux and Kostka numbers); the type of S is the multipartition counting each label with the multiplicity of the corresponding row. For standard s let μ(s) be the tableau obtained from s by replacing each entry by its row-and-component in tμ. Put m(S,t):=∑s: μ(s)=Smst,m(S,T):=∑s,t: μ(s)=S, ν(t)=Tmst. Let M:=⨁λ multipartition of nMλ,Cn:=End⁡Hn(M), with ordinary composition (The direct sum of an indexed family of modules). For S,T of shape λ and types μ,ν, the map φST — once justified by Cyclotomic semistandard sums give the actual Schur endomorphism basis ↗ — sends mαh to δα,νm(S,T)h. Its right cell module Δλ has basis vT over the semistandard T of multipartition types, with contravariant cell form and quotient Lλ. Let Tλ be the unique tableau of shape and type λ, and let eλ be the identity projection onto Mλ. Put ω:=(∅,…,∅,(1n)) and e:=eω; then mω=1, so Mω=Hn, and Hn is an actual direct summand of M. The weight projections used by the Jantzen theory below are the eν with ν a multipartition. Write K(λ,ν):=#SStd⁡ν(λ) for the number of semistandard tableaux of shape λ and type ν.

Boundary of the definition. All asserted module, form and map laws are discharged by the linked local suppliers The arbitrary-level cyclotomic Hecke Murphy basis is cellular ↗, Cyclotomic semistandard sums give the actual Schur endomorphism basis ↗ and Cyclotomic Schur standards and corner functor control block linkage ↗; the definition itself claims no proof of them and no primitive residue-content classification. No choice principle is used: only finite bases, finite subgroup and coset decompositions, finite filtrations and explicit polynomial identities occur.

Depends on

Used by

Dependency tree · two levels

16 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