Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

Degenerate Ariki decomposition numbers in small rank

Example

Assume inherited AC The Axiom of Choice for the categorification and based-module identifications; the explicit finite calculations below are choice-free.

Take I={0}, so I+={0,1}, level l=2 and Λ=2Λ0 with charge (0,0). Here the tower means the I-SUPPORTED central cut, not the full degree-d cyclotomic algebra. The Fock space is V⊗V with monomials 00,01,10,11 (The higher-level wedge-tensor Fock module), and Std={00,01,11}, Rev={00,10,11} with source Bruhat order 01<10. Write MA for the monomial, π for the normalized highest projection and DA=πLA as in The dual-canonical, canonical and quasi-canonical Fock bases. In the source parameter s (the library parameter is t=s−1),

L00=M00,L01=M01,L10=M10−sM01,L11=M11,

and M10=L10+sL01, so the FULL ambient d-matrix is the inverse of the L-in-M matrix, with diagonal 1 and d01,10=s; it is not its transpose. Moreover T10=M10+s−1M01 and P01=M01+sM10=sT10. The actual projection is D01=T10/(s+s−1), πM10=sD01, πL10=0, and D00=M00, D11=M11; in particular at parameter one D01=(M01+M10)/2, not the unprojected L01=M01.

The decomposition matrix at parameter one has rows 00,01,11 and columns 00,01,10,11:

(100001100001).

Thus S00=D00, S01≅S10≅D01 and S11≅D11: the nonstandard Specht label 10 has a nonzero decomposition entry, but there is no simple D10. If SB denotes πMB, it is defined for all four columns, but only SStd is a basis, and the displayed 3×4 matrix is not an invertible unitriangular square matrix. The supported blocks are C, C[x]/x2 and M2(C) at 0,α0,2α0 respectively, with simple dimensions 1,1,2; these are all simples of this finite-I tower and higher supported degrees vanish. The whole degree-2 algebra has two additional adjacent-residue blocks, retained in the I=Z companion showcase. All displayed Specht decomposition entries are 0 or 1 (the relevant Weyl group is S2).

Facts & Assumptions

Given: Assume inherited AC The Axiom of Choice for the invoked suppliers. The data I={0}, Λ=2Λ0, charge (0,0), the Fock monomial and projection dictionary of The dual-canonical, canonical and quasi-canonical Fock bases and Standard tableau monomials form a basis of the highest weight Fock submodule, and the decomposition dictionary at parameter one of Degenerate Specht decomposition numbers are canonical basis coefficients at one. We verify the displayed transition, projection, decomposition and block statements.

[F1]

At parameter one, for every Specht label B and every simple label A one has [S(B):D(A)]=dA,B(1), where dA,B(s) is defined by MB=∑AdA,B(s)LA, and the matrix D(s)=(dA,B) is the inverse of the L-in-M chart, not its transpose (Degenerate Specht decomposition numbers are canonical basis coefficients at one).

[F2]

The simple classes of the supported tower are indexed by StdΛ and the Specht classes satisfy [S(B)]↦SB, the identification being exact and compatible with the residue functors (The degenerate Ariki categorification theorem).

Verification

technique · direct
1.1givenalgebra

The four monomials and the label sets. The finite alphabet is I+={0,1} and each charge-zero factor is its one-box natural module. Hence its tensor-square basis is M00,M01,M10,M11. Weakly increasing rows select 00,01,11, and weakly decreasing rows select 00,10,11, so these are respectively Std and Rev; the mixed Bruhat order is 01<10. The actual coordinate weights are 2δ0,δ0+δ1,δ0+δ1,2δ1; subtracting each from the vacuum weight 2δ0 gives contents 0,α0,α0,2α0. In particular Iα0={(0)} and I2α0={(0,0)}: residue sequences have length equal to tower degree, independently of the two tensor factors.

1.2givenalgebra

The transition vectors and the reciprocal convention. On this mixed space the ordinary Fock bar is ψM01=M01 and ψM10=M10+(s−1−s)M01, with coefficient bar s↦s−1. Direct substitution shows that L10=M10−sM01 and T10=M10+s−1M01 are bar fixed in their respective positive- and negative-power triangular charts; the endpoints and L01 equal their monomials. Thus M10=L10+sL01, and the ambient inverse-chart coefficient is d01,10=s. Its row gives P01=M01+sM10=sT10. Under t=s−1 these same formulas become L10=M10−t−1M01, T10=M10+tM01 and P01=M01+t−1M10; reciprocating the parameter does not transpose the inverse transition matrix.

2.1givenstep 1.2algebra

The normalized projection. The source coproduct gives F0M00=M10+s−1M01=T10 and F0T10=(s+s−1)M11. Hence T10 lies in the ground-generated constituent and is fixed by its normalized projection. The ground highest vector is M00; E0M01=M00, so M01 is not highest. The same coproduct gives E0M10=sM00, F0M01=M11 and F0M10=sM11, so both E0 and F0 kill L10. Its weight is zero for h0, hence it spans a trivial constituent, complementary to the three-dimensional ground constituent since T10 and L10 are linearly independent. Projection onto the ground constituent along this line is a module map fixing the ground, so this directly constructs the normalized projection and its off-standard kernel Q(s)L10. Since T10−L10=(s+s−1)M01, applying the projection gives D01=πM01=T10/(s+s−1) and πM10=sD01. The endpoints are fixed, and πL10=0. At s=1 this is the half-sum (M01+M10)/2. All divisions here take place over Q(s); they do not identify the projected costandard lattice with the ambient integral monomial lattice.

2.2step 1.1givenalgebra

The supported blocks. Set x=x1, y=x2, u=s1. The defining relations of The degenerate cyclotomic Hecke algebra give u2=1, [x,y]=0, ux=yu−1, uy=xu+1 and x2=0 in the relevant degree; from ux2=0 and the cross relations one obtains y2u=x+y, hence y2=(x+y)u, and reducing the relation y2=(x+y)u decreases the y-exponent while killing x-exponents at least 2, so the eight words 1,x,y,xy,u,xu,yu,xyu span the degree-2 algebra. Map these generators to (N,−N,−J) on M2(C) with N=E12 and J the swap matrix, to (ϵ,1+ϵ,1) on B+=C[ϵ]/ϵ2, and to (ϵ,−1+ϵ,−1) on B−=C[ϵ]/ϵ2; direct matrix computation verifies u2=1, [x,y]=0, x2=0, ux=yu−1 and uy=xu+1 in all three factors. The central element z=x+y has images 0, 1+2ϵ and −1+2ϵ, and the Hermite polynomials E0=(1−z2)2, E±=(1−E0±(3z−z3)/2)/2 map to the three separate identities; each factor is generated by its images of x and u, so the map from the span of the eight words onto the eight-dimensional product is surjective and hence, by the spanning bound, an isomorphism. The I={0} spectral content cut keeps the factor M2(C) at content 2α0 and discards the adjacent-content factors, so the supported degree-2 block is M2(C) with simple dimension 2; degree one is C[x]/x2 with simple dimension 1 at content α0, and degree zero is C. To verify vanishing independently of categorification, suppose an all-zero-residue supported module exists in degree at least three. Its restriction to the first two strands lies in the displayed M2 factor, hence x2=−x1 and x12=0. Since s2 commutes with x1, it also commutes with x2. The affine recursion gives x3=s2x2s2+s2=x2+s2. But a commuting sum of a square-zero operator and an involution has generalized eigenvalues only 1,−1: on the two s2 eigenspaces it is ±1+x2, each invertible with inverse ±1−x2. This contradicts the nilpotence required by residue zero for x3. Every nonzero finite-dimensional algebra has its nonzero regular module, so no such supported algebra exists in degree three or higher.

3.1F2step 1.2step 2.1step 2.2givenalgebra

The decomposition matrix by intrinsic modules. The intrinsic affine-induced Specht presentation in Schur functor images of standard, simple, projective and tilting objects gives, for either single-box label 01 or 10, the degree-one module H1/H1x=C; the two different singleton components have the same charge zero. For 11, with one box in each component, it gives H2/(H2x+H2y), since the inducing algebra is the polynomial algebra on the two strand variables and both act as zero on its one-dimensional inducing module. In the three factors of step 2.2, x,y generate the whole left ideal in B+ and B− because y−x=±1; in the matrix factor y=−x=−N, so the quotient is M2/M2N. Here M2N consists of matrices with first column zero, and the first-column map identifies the quotient with the defining simple C2. The degree-zero Specht is C. Thus each of these four Spechts is the indicated simple, directly giving the displayed 3×4 multiplicity matrix. Independently step 1.2 gives d01,10(1)=1 and identity on standard columns, so these actual multiplicities agree with [F1]. There is one simple in each of the three supported blocks by step 2.2, so there is no additional simple D10. The standard square submatrix is the identity; the rectangular matrix is not asserted invertible.

4.1step 3.1step 2.2given∎

Conclusion. Steps 1.1-3.1 verify the transition, projection and decomposition statements, including the inverse-chart entry d01,10(1)=1 in place of any negative transposed-inverse value, the identity on standard columns and the absence of an off-standard simple D10; step 2.2 verifies the block dimensions 1,1,2 at contents 0,α0,2α0 of the supported tower and the vanishing of higher supported degrees. The two further adjacent-residue degree-2 blocks of the full algebra are outside this supported window and are treated in the companion showcase; no unprojected monomial is used as a simple class.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

84 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