Alphabeta Math
CorollaryStatement: 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.

Cyclotomic Hecke blocks inherit Z-gradings

Statement

In the situation of The Brundan–Kleshchev blockwise Hecke–KLR isomorphism, each fixed choice of admissible local normalising series transports the KLR homogeneous decomposition to a Z-grading on HαΛ. This is the unique grading for those fixed generator images with deg⁡e(i)=0, deg⁡yr=2 and deg⁡ψre(i)=−air,ir+1 (The KLR grading and the diagrammatic multiplication). Different admissible series choices give graded-isomorphic transported algebras via ρ′∘ρ−1; their underlying identity map need not be graded. The grading can be nontrivial, but it may be trivial on an individual block, including the one-dimensional level-one rank-two e=3 blocks. The ordinary Hecke presentation always has the trivial assignment of degree zero to all its generators; the transported grading is generally expressed using the nilpotent dots and local crossings, and ordinary Hecke generators can be sums of different homogeneous pieces and may be homogeneous in special cases. No claim forbids the degree-zero assignment or asserts that every block grading is nontrivial.

Facts & Assumptions

Given: The blockwise Hecke–KLR isomorphism [F1], the KLR grading conventions [F2], the cyclotomic quotient conventions [F3], and the type-A specialization conventions [F4].

[F1]

For every content α with eα≠0 there are mutually inverse F-algebra isomorphisms ρ ⁣:RαΛ→HαΛ and σ, normalized by ρ(e(i))=e(i) and the dot images 1−q−irXr or xr−ir (The Brundan–Kleshchev blockwise Hecke–KLR isomorphism).

[F2]

The KLR algebra RαΛ is graded by deg⁡e(i)=0, deg⁡yr=2 and deg⁡ψre(i)=−air,ir+1, with homogeneous local relations (The KLR grading and the diagrammatic multiplication, The cyclotomic KLR quotient at a dominant integral weight).

[F3]

The charged type-A specialization and its presentation conventions (The type-A cyclotomic specialization of the QG-KLR algebras).

Proof

technique · direct

Given: The field F, the finite quantum characteristic e≥2, the

dominant weight Λ, and the suppliers of [F1]–[F3].

1.1F1F2F3algebra

Transport of the grading. Fix a choice of admissible local normalising series, hence the isomorphism ρ of [F1]. Declare each image of a homogeneous KLR generator to be homogeneous of the same degree; the images generate HαΛ and the KLR relations of [F2] are homogeneous, so the resulting degree assignment is well defined. Products retain degree addition because ρ is an algebra map, so the degree summands are exactly the transported homogeneous summands. Since the generator images span the algebra, their assigned degrees determine every degree summand and give uniqueness of the grading for that fixed choice, with deg⁡e(i)=0, deg⁡yr=2 and deg⁡ψre(i)=−air,ir+1.

2.1F1F2step 1.1

Independence of the series choice. If ρ′ is the isomorphism attached to another admissible series, then ρ′∘ρ−1 sends each homogeneous native generator image of the first choice to the corresponding new image and hence is graded by construction; the two transported algebras are graded-isomorphic, while the underlying identity map on HαΛ need not be graded because the two series differ by units that need not be homogeneous of degree zero.

2.2F1step 1.1

Triviality is not excluded. Assigning degree zero to every ordinary Hecke generator makes all defining relations homogeneous, so the degree-zero assignment is a legitimate grading of the ordinary Hecke presentation and no impossibility statement is asserted. A one-dimensional sector has only degree zero, because its unit has degree zero and it equals F; in particular the one-dimensional level-one rank-two e=3 blocks are trivially graded.

2.3F1F2step 1.1

A concrete nontrivial witness. Consider level one, e=2, rank two. Of the four colour words only (0,1) survives: the first-strand exponent zero kills (1,0), and on (0,0) the equal-colour mixed identities give ψ1y2=1 together with ψ12=0, hence ψ1=0 after left multiplication by ψ1, giving 1=0; so the equal-colour sector is zero, with y1=0 and the crossing zero. The quadratic double-edge relation gives y22=0. Conversely e(0,1)=1, y2=t, y1=ψ1=0 in F[t]/(t2) satisfy all rank-two relations, so that sector is F[t]/(t2) with deg⁡t=2, and its Brundan–Kleshchev image supplies an actual nontrivial transported grading, including in the characteristic-two degeneration. This is a witness that the construction can be nontrivial, not a claim about all sectors.

3.1F1step 1.1step 2.1step 2.3∎

Conclusion. Each fixed admissible series choice transports the KLR homogeneous decomposition to a Z-grading of HαΛ, unique for the induced generator degrees; different choices give graded-isomorphic transported algebras; and the grading may be nontrivial on some blocks while trivial on others, with the ordinary presentation retaining its degree-zero assignment.

Remarks

The corollary records exactly what the blockwise isomorphism yields: a transported grading attached to a chosen normalising series, not a canonical intrinsic grading of the Hecke presentation, and not a claim of nontriviality on every block. No choice principle is used: the series choices and the gradings are explicit and finite.

Depends on

Used by

Dependency tree · two levels

17 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