Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 Schur standards and corner functor control block linkage

Statement

For Cn=End⁡Hn(⨁λmλHn) of Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules over a field F with unit parameters, its standards Δλ have nonzero absolutely simple heads Lλ indexed by all multipartitions, with [Δλ:Lλ]=1 and [Δλ:Lμ]≠0 only if λ⊵μ; the algebra Cn is split quasihereditary. The standard classes form a Z-basis of G0(Cn-mod), and the weight dimensions dim⁡Δλeν=K(λ,ν) form a unitriangular multipartition Kostka matrix. Over the universal ring and the LM deformation DVR the standards and their forms are free and the weight idempotents satisfy eν∗=eν. The exact corner functor V↦Veω gives Δλeω≅Sλ and Lλeω≅Dλ (possibly 0), so that [Δλ:Lμ]=[Sλ:Dμ] whenever Dμ≠0. The centers Z(Cn) and Z(Hn) are canonically isomorphic because Mω=Hn is a summand, and Δλ,Δμ share a Cn-block if and only if Sλ,Sμ share an Hn-block; standard and Specht linkage is exactly shared-simple-factor linkage. No equality-of-residue-contents-to-primitive-block assertion is made.

Facts & Assumptions

Given: The Schur datum of [F1], the semistandard endomorphism basis [F2], the finite cellular-head theory [F3], the block and Grothendieck conventions [F4]–[F5], and the Jucys–Murphy content triangularity [F6].

[F1]

The algebra Hn, the summands Mλ=mλHn, the direct sum M=⨁λMλ with ω=(∅,…,∅,(1n)) and mω=1, the endomorphism algebra Cn=End⁡Hn(M) with ordinary composition, the presentation involution ∗, and the weight projections eν onto Mν (Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules).

[F2]

The maps φST are a free dominance-cellular basis of Cn with φST∗=φTS and φSTφ≡∑Wr(T,W)(φ)φSW(modCn⊳λ), coefficients independent of S (Cyclotomic semistandard sums give the actual Schur endomorphism basis).

[F3]

For a finite-dimensional cellular algebra over a field with cell modules Cλ and quotients Dλ=Cλ/Rλ: every nonzero Dλ is an absolutely simple head, all simple modules occur exactly once, [Cλ:Dμ]≠0⇒λ≥μ and [Cμ:Dμ]=1; every nonzero cell module has all composition factors in one block, and two nonzero cell modules share a block exactly when linked by a finite chain of nonzero cell modules with neighbouring terms sharing a simple factor (Nonzero-form cellular heads, cell purity and shared-factor linkage).

[F4]

Blocks of a finite-dimensional algebra are the primitive-central-idempotent blocks (Blocks of a finite-dimensional algebra via primitive central idempotents).

[F5]

G0 of a finite-dimensional module category with the Jordan–Hölder theorem: composition classes form a Z-basis (Grothendieck group of an essentially small abelian category, Jordan–Hölder theorem for modules).

[F6]

Xr acts dominance-triangularly on Sλ with diagonal Uazj−i at the node carrying r (Arbitrary-level Murphy Jucys–Murphy action is content triangular).

Proof

technique · direct

Given: The data and suppliers of [F1]–[F6].

1.1F1F4algebra

Centers and blocks of an endomorphism algebra containing the regular module. Let M be a finite right H-module containing H as a direct summand with projection e, and C=End⁡H(M). Then eCe=End⁡H(H)≅H by left multiplication, and Ce≅Hom⁡H(H,M)≅M by evaluation at 1. If c∈Z(C), then c restricts on the H-summand to left multiplication by some h; for each m∈M the H-map fm:H→M, a↦ma, is the off-diagonal block jfmπ∈C through H, and commuting it with c and evaluating at 1 gives c(m)=mh. Since c is H-linear, c(ab)=c(a)b for a,b∈H gives abh=ahb, so with a=1 we get hb=bh and h∈Z(H). Conversely every h∈Z(H) defines the H-linear endomorphism m↦mh, which commutes with every H-endomorphism of M, hence is central in C. These constructions are inverse unital algebra maps, so Z(C)≅Z(H) and primitive central idempotents correspond bijectively ([F4]). For M=⨁λMλ we have Mω=Hn, so this applies with e=eω.

1.2F1F2F3algebra

Schur standards and nonzero heads. By [F2] the right cell module Δλ of Cn has basis the vT over semistandard T of shape λ. The unique tableau Tλ of shape and type λ gives φ(Tλ,Tλ)=eλ, the identity projection onto Mλ, an actual idempotent; evaluating the cell form at vTλ gives ⟨vTλ,vTλ⟩=1, so every standard is nonzero with nonzero form. Applying the finite cellular-head theory [F3] to Cn (finite-dimensional and cellular over F by [F2]) shows every head Lλ=Δλ/rad Δλ is nonzero, absolutely simple, the Lλ are pairwise distinct and exhaust the simple Cn-modules, and [Δλ:Lμ]≠0 implies λ⊵μ with [Δλ:Lλ]=1.

1.3F2F3algebra

Split quasiheredity by an explicit heredity chain. Order the multipartitions in a linear extension of dominance and remove the maximal remaining cell layers successively; in the relevant quotient algebra B the next layer J has basis cst with a distinguished index u whose Gram value is G(u,u)=1. Then e=cuu is idempotent, csucut=cst, and the multiplication map Be⊗FeB→J is an isomorphism on these basis elements; also eBe=Fe, since the cell law and maximality of J show every ebe is a scalar multiple of e. Hence Be is projective, J is a direct sum of copies of Be, and e rad(B) e=0 because the corner is a field. Thus J is a split heredity ideal, and iterating gives a split heredity chain whose standards are the cell modules Δλ; so Cn is split quasihereditary over F.

1.4F1F2F6algebra

Weight dimensions and the unitriangular Kostka matrix. The weight projections eν=φ(Tν,Tν) are self-adjoint because φST∗=φTS ([F2]), and the cell action gives vTeν=δtype⁡(T),νvT, so dim⁡Δλeν is the number K(λ,ν) of semistandard tableaux of shape λ and type ν; this already shows the standards and their forms are defined over the universal ring, free on the vT. A semistandard tableau of shape λ and type ν forces λ⊵ν: for a component k and row cutoff r, labels of type components below k cannot occupy physical components at least k, labels of type component k with row at most r cannot occupy physical components greater than k and occupy at most r nodes per column of physical component k by strict column increase, so the count ∑a<k∣ν(a)∣+∑i≤rνi(k) is at most ∑a<k∣λ(a)∣+∑i≤rλi(k), which is exactly the multipartition dominance inequality; and Tλ is the unique tableau of shape and type λ, so the Kostka matrix is unitriangular.

2.1F3F5step 1.2algebra

The standard basis of G0 and block purity. The matrix of standard multiplicities is unitriangular with diagonal 1 by step 1.2, so inverting it by backward substitution shows that the classes [Δλ] form a Z-basis of G0(Cn-mod) ([F5]). Projecting to blocks is exact. Every Δλ is nonzero and block-pure by [F3], so if a class supported in one block equals ∑λaλ[Δλ], then every coefficient of a standard lying in another block vanishes by this basis independence; this is the block-separation input used by the Jantzen equivalence.

2.2F1F2F3step 1.1algebra

The corner functor and the radical comparison. Put e=eω; then eCe≅Hn by step 1.1, and V↦Ve is exact. Semistandard tableaux of type ω are canonically standard multitableaux: replacing the label (r,ℓ) by r is a bijection onto the standard tableaux, and the surviving standard vectors vt of Δλe carry the same right-Hn action as the Murphy vectors mt of Sλ by the cell multiplication [F2]; this is an explicit isomorphism Δλe≅Sλ. The forms also agree: in Cn, ⟨vs,vt⟩eλ≡φ(Tλ,s)φ(t,Tλ) modulo higher Cn-shapes, and evaluating the two factors at mλ gives the product m(tλ,s)m(t,tλ), whose coefficient of mλ modulo higher Hn-shapes is exactly the Specht form entry; a higher Schur map evaluates to a sum of higher Murphy shapes by its explicit definition, so no shape error is lost. Since e∗=e, the e and 1−e parts of Δλ are orthogonal: if x pairs to zero against Δλe, then ⟨x,y(1−e)⟩=⟨x(1−e),y⟩=0, so rad(Δλ)e=rad(Δλ)∩Δλe=rad(Δλe). Hence Lλe≅Dλ for every λ, with Dλ allowed to be zero. Applying the exact functor to a composition series of Δλ, each simple factor Lμ becomes Dμ or 0, and the nonzero Dμ are pairwise distinct and exhaustive by [F3]; hence [Δλ:Lμ]=[Sλ:Dμ] for every μ with Dμ≠0, with no simple-label bijection through e assumed.

3.1F3step 1.1step 2.2algebra∎

Typed Schur/Specht block linkage. The center isomorphism of step 1.1 sends a central block idempotent b of Hn to the same right-action projection on M, hence to the corresponding central idempotent bC of Cn, and on the corner VbCe=(Ve)b. Every Δλ is nonzero and block-pure by [F3], and Δλe≅Sλ is nonzero because Sλ has its Murphy standard-tableau basis; consequently the block supporting Δλ corresponds to exactly the block supporting Sλ. Therefore Δλ,Δμ share a Cn-block if and only if Sλ,Sμ share an Hn-block, and [F3] describes both sides as linkage by chains of cell modules with neighbouring terms sharing a simple composition factor; step 2.2 supplies the multiplicity transfers when a nonzero simple is needed. No equality-of-residue-contents assertion is used.

Remarks

The theorem is the algebraic half of the block theory of this page: it proves that the Schur standards and Specht standards have matching heads and matching block partitions, using the semistandard cellular basis, the explicit center isomorphism, and the corner functor. The residue-content/Jantzen computation that identifies the blocks with combinatorial data is a separate theorem with its own suppliers. No choice principle is used: all cell layers, bases, and composition series are finite.

Depends on

Used by

Cited to discharge well-definedness by Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules.

Dependency tree · two levels

34 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