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

Simple and indecomposable-projective crystals agree with B(Λ)

Statement

Assume the Axiom of Choice The Axiom of Choice.

For the standard homogeneous cyclotomic quotient over any field with the general real symmetrizable datum and graded KLR parameters, let BΛ be the normalized Dψ-self-dual simple classes. Set wt⁡(S)=Λ−β, εi(S)=max⁡{r:(Eibasic)rS≠0} and φi(S)=εi(S)+⟨hi,wt⁡(S)⟩. For εi>0, define e~iS by the unique simple isomorphism type in the socle of one-step right restriction, with its unique self-dual normalization, and set e~iS=0 when εi(S)=0; define f~iS by the unique self-dual normalization of the simple head of right induction when nonzero, otherwise zero. The one-step socle/head is one shifted copy, not a quantum-factorial multiplicity. These data form a crystal canonically isomorphic to B(Λ), with vacuum sent to uΛ. The normalized indecomposable projectives carry the same crystal by their normalized simple heads and covers. The projective graph here is explicitly transported from these labels, rather than obtained by applying linear Kashiwara operators to an unspecified projective basis. The highest-weight quotient has simple survivors exactly when εiLEFT(S)≤λi for every i.

Facts & Assumptions

Given: The Axiom of Choice and the standard cyclotomic quotient over any field with general real symmetrizable datum and graded KLR parameters, and the normalized simple and projective labels of Cyclotomic projective covers and dualities descend through the quotient and Cyclotomic diagram duality and graded module duals.

[F1]

The one-step theorem One-step simple restriction and induction, and the first-dot index: for a cyclotomic (or generic) simple S, one-step restriction has a single simple socle and head once, with εi decreasing by one, induction has the unique simple head fiS occurring once, and the first-dot index identifies the first-strand ideal criterion with εiLEFT≤λi; this works over the original field including positive characteristic.

[F2]

The two-colour jump formula and strict elementary embeddings The two-colour jump formula and strict elementary embeddings: the full general-Q jump formula, strictness and everywhere-positive extraction, from actual shuffle filtrations and divided restriction multiplicities; the linear Serre relation is applied in G0, not to a non-linear simple operator.

Proof

Proof technique: inflate to the generic algebra, apply the one-step and two-colour inputs to the simple graph, identify it with the canonical crystal and its highest-weight quotient, and transport the labels to projective covers.

1.1givenF1F2

The simple graph. Inflate a cyclotomic simple to the generic algebra; by [F1] the one-step restriction has a single simple socle and head once and induction has the unique simple head, giving well-defined operators e~i,f~i on shift orbits with εi decreasing by one under e~i and increasing by one under f~i. By [F2] the graph is lowering-generated with strict elementary extractions and positive extraction at every nonvacuum vertex, over every field including positive characteristic. The normalized-label supplier in the Given identifies each simple shift orbit with its unique Dψ-self-dual representative. Taking that representative for each nonzero socle and induction head lifts both operators to BΛ and preserves their partial-inverse identities.

2.1step 1.1F3

Identification with B(Λ). Apply the canonical elementary extraction of [F3]: the generic simple graph is canonically B(∞) and the first-strand cyclotomic survivors are exactly the vertices with ci(b)≤λi for all i, which is the crystal B(Λ) with vacuum uΛ; the survivor criterion is εiLEFT(S)≤λi for every i by the first-dot index of [F1]. The one-step socle/head is one shifted copy, so no quantum-factorial multiplicity enters.

3.1step 2.1F3∎

Projective labels. The normalized indecomposable projectives carry the same crystal by their normalized simple heads and covers: the quotient-cover lemma pairs each projective cover with its simple head without scaling and preserves the label under the quotient, while the two Grothendieck identifications of [F3] record the same labels on K0 and G0. The projective graph is therefore explicitly transported from the simple labels, not obtained by applying linear Kashiwara operators to an unspecified projective basis. The assumed Axiom of Choice supplies the inherited hypotheses of the canonical-extraction and Grothendieck-identification suppliers of [F3], including the integral projective theorem and its restricted-dual consequence; transporting normalized cover labels introduces no further choice.

Depends on

Used by

Dependency tree · two levels

65 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