Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Graded decomposition numbers equal canonical-basis coefficients in characteristic zero

Statement

In branch (C0) of the regime of The nondegenerate root-of-unity level-one Hecke regime, for every partition μ with content α and every λ∈RPα, the graded composition multiplicity satisfies [S(μ):D(λ)]q=dλ,μ(q), where dλ,μ is the level-one global-basis transition polynomial of Level-one global-basis transition polynomials in the symmetric-group convention; equivalently [S(μ)]=∑λ∈RPαdλ,μ(q)[D(λ)] in G0gr(HαΛ), and dλ,μ=0 unless λ⊴μ. Specializing q=1 gives Ariki's ungraded decomposition-number theorem [S(μ):D(λ)]=dλ,μ(1). Choice is inherited only through the QG-8 global-basis suppliers.

Facts & Assumptions

Given: Branch (C0) of the regime, a partition μ with content α, the graded Specht module S(μ), and the transported identification ΨcanHecke.

[F1]

The transported identification sends [S(μ)] to the standard Fock vector Sμ=π(Mμ) (Graded Specht classes realize the standard Fock vectors); and Sμ=∑λd(λ,μ)(q)G∗(λ) over the restricted labels, with the same coefficients as the lower expansion, by Standard Fock vectors expand in the upper global basis.

[F2]

In branch (C0) the transported normalized self-dual simples D(λ) map to the upper global basis vectors G∗(λ) under ΨcanHecke (Ariki's canonical basis theorem in characteristic zero (2)), and the simple classes form a basis of the free A-module G0gr(HαΛ) (The QG-8 categorification transports across the blockwise Hecke-KLR bridge (2)).

[F3]

The transition polynomials have off-diagonal entries in qZ[q] and are supported on λ⊴μ with diagonal 1 (Level-one global-basis transition polynomials in the symmetric-group convention); the graded module group is the restricted direct sum of the blockwise groups with forgetful maps ζ satisfying ζ(qm)=ζ(m) (Graded module and projective Grothendieck groups of the KLR and Hecke towers).

[F4]

The graded Specht module and its basis are those of The graded Specht module by homogeneous standard tableaux; the regime is branch (C0) of The nondegenerate root-of-unity level-one Hecke regime.

[C1]

Choice is inherited only through the QG-8 global-basis and Fock suppliers (The Axiom of Choice, Ariki's canonical basis theorem in characteristic zero).

Proof

technique · direct
1.1F1F3

Transport the Specht class. Applying ΨcanHecke to [S(μ)] gives Sμ by [F1], and the expansion of the standard vector in the upper family is Sμ=∑λ∈RPαd(λ,μ)(q)G∗(λ) by [F1]; the coefficients are the transition polynomials of [F3].

2.1F1F2step 1.1

Replace the upper basis by the simple classes. By [F2] the vectors G∗(λ) are the images of the simple classes [D(λ)] under the same isomorphism; applying (ΨcanHecke)−1 to step 1.1 therefore gives the expansion [S(μ)]=∑λd(λ,μ)(q)[D(λ)] in G0gr(HαΛ) [F1, F2].

3.1F2F3step 2.1

Read off multiplicities and support. Since the simple classes form a basis of the free A-module G0gr(HαΛ) by [F2], the coefficient of [D(λ)] in the expansion of step 2.1 is the graded composition multiplicity [S(μ):D(λ)]q, and it equals d(λ,μ)(q); the support statement d(λ,μ)=0 unless λ⊴μ is the triangularity of [F3].

4.1C1F3F4given∎

The ungraded specialization. The forgetful map ζ specializes q to 1 and sends a graded composition series to an ungraded one with the same multiplicities [F3]; applying ζ to the expansion of step 2.1 gives [S(μ):D(λ)]=d(λ,μ)(1), Ariki's ungraded decomposition-number theorem. No new choice is made: [C1] is inherited.

Depends on

Used by

Dependency tree · two levels

64 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