Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Category O, KLR, and Hecke route conventions

Definition

This page uses the following route convention. Category O means the BGG category for a fixed finite-dimensional complex semisimple Lie algebra and a chosen positive system, as defined in The classical BGG category O. The Arakawa–Suzuki route is the degenerate affine route over C: on M⊗(CN)⊗d use the operators xj and si of Arakawa-Suzuki Casimir operators on tensor functors, with the verified right Hd-action of The Casimir and place-permutation operators satisfy the degenerate affine Hecke relations. The source-normalized operators are yj=xj−1NzM+N−12; they are not new generators to be identified with a nondegenerate Hecke generator. Here zM is the central endomorphism specified in the cited definition. This convention asserts no extension of the cited hypotheses on M, origin, or tensor functor.

The finite cyclic type-A Hecke/KLR route uses a field F, a finite quantum characteristic e≥2, and its declared residue and cyclotomic conventions (Affine and cyclotomic type-A Hecke algebras). In the nondegenerate branch write the Hecke parameter as ξ≠1 and reserve q for the grading and Laurent-polynomial variable. The blockwise identification is exactly The Brundan–Kleshchev blockwise Hecke–KLR isomorphism: write ξBK for its Hecke parameter (denoted q in that theorem), independent of the grading variable q. Its ξBK=1 branch requires char⁡F=e, while its ξBK≠1 branch is separate. For level-one Ariki statements, use only the regime in The nondegenerate root-of-unity level-one Hecke regime. In characteristic zero the canonical-basis and graded-decomposition conclusions are those of Ariki's canonical basis theorem in characteristic zero and Graded decomposition numbers equal canonical-basis coefficients in characteristic zero. In positive characteristic retain the adjustment factorization of Positive-characteristic decomposition polynomials factor through adjustment; no identity adjustment matrix is part of this route.

The negative-half KLR categorification and the cyclotomic highest-weight projective-K0 theorem are distinct routes, respectively The KLR category categorifies the negative quantum half and The cyclotomic projective K0 is the integral highest-weight module. Each keeps its own field, grading, weight and Axiom-of-Choice hypotheses (The Axiom of Choice). Likewise, the type-A Hecke cellular result The Murphy tableau elements form a cellular basis, the local type-A character theorem Soergel's character conjecture for type A, the singular spherical formula Singular category O multiplicities are parabolic Kazhdan–Lusztig values, and the regular-ambient parabolic antispherical formula Parabolic category O multiplicities are parabolic Kazhdan–Lusztig values retain their distinct statements and ranges. This route convention introduces no new theorem, grading, equivalence, or cross-characteristic transfer.

Remarks

The shifted-Yangian PBW result Ordered monomial PBW basis for the shifted Yangian is not a supplier for these Category-O, Hecke, or KLR conventions; the link records a scope boundary only.

Depends on

Used by

Dependency tree · two levels

174 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