Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

Specializing the grading variable to one forgets graded decomposition information

Statement refuted

Assume inherited AC The Axiom of Choice for the Fock/global-basis and graded-decomposition identifications used below; the explicit finite block and polynomial calculations make no additional choices.

The claim under refutation is that specializing the grading variable q to 1 determines the graded decomposition data: that the forgetful map is injective on the graded Grothendieck classes of the block, or equivalently that the graded transition polynomials, graded Cartan entries and shift classes are recovered from their values at q=1.

Facts & Assumptions

Given: Assume the inherited AC above. Use the example's field C, Hecke parameter ξ=−1, level-one weight Λ0 and rank 2, so e=2 and the block has content α0+α1. The symbol q is the formal grading variable, distinct from the numerical Hecke parameter ξ.

[F1]

In the example's block [P]=(1+q2)[D], [S(1,1)]=[D] and [S(2)]=q[D], with the graded Cartan pairing and shift action there recorded (Projective and simple Grothendieck classes in a small non-semisimple block).

[F2]

The level-one transition polynomials in the e=2 case are d(1,1),(1,1)(q)=1 and d(1,1),(2)(q)=q (Level-one global-basis transition polynomials in the symmetric-group convention).

[F3]

The graded decomposition theorem identifies the graded multiplicities with the transition polynomials (Graded decomposition numbers equal canonical-basis coefficients in characteristic zero).

Counterexample

technique · direct
1.1F1

The polynomials and the class [P]. In Z[q,q−1] the elements 1+q2 and 2 differ (their difference q2−1 is nonzero) while (1+q2)∣q=1=2; multiplying by the nonzero class [D] gives distinct classes [P]=(1+q2)[D] and 2[D] in the free A-module G0gr(Hα0+α1Λ), whose images under the forgetful map ζ (which satisfies ζ(qm)=ζ(m)) both equal 2[D] Graded module and projective Grothendieck groups of the KLR and Hecke towers [F1].

1.2F1F2

The Specht classes and the transition polynomials. The example computes [S(1,1)]=[D] and [S(2)]=q[D], which are distinct because q≠1; the forgetful map sends both to [D]. The corresponding transition polynomials are d(1,1),(1,1)(q)=1 and d(1,1),(2)(q)=q in the recorded e=2 Fock computation, distinct in Z[q,q−1] and equal at q=1 (Projective and simple Grothendieck classes in a small non-semisimple block, Level-one global-basis transition polynomials in the symmetric-group convention) [F2].

2.1F1F2F3∎

Conclusion. By the graded decomposition theorem the classes are read through the transition polynomials, so the failure above is exactly the statement that the specialization q↦1 loses the graded multiplicities and shift data (Graded decomposition numbers equal canonical-basis coefficients in characteristic zero). The displayed finite block and polynomial computations introduce no new choice; AC is inherited only through the invoked Fock/global-basis and graded-decomposition identifications.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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