Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Lusztig's canonical basis and Kashiwara's lower global basis agree in symmetric finite ADE type

Statement

Assume symmetric finite ADE type, so di=1 for all i. Transport Lusztig's parameter by v=q−1, the abstract half generators by θi(n)↦Fi(n), and the full torus by KhL↦K−h, as in The Lusztig–Kashiwara form, parameter and coproduct dictionary. Under this exact dictionary the divided-power integral forms and the bar involutions agree, and the half forms agree through the root-color factor BL=CνBK, not by an unqualified identity. Then Lusztig's canonical lower basis equals the Kashiwara lower global basis of U−, and Lusztig's canonical highest-module quotient bases equal the corresponding lower global bases of The lower global basis of Uq− and of a highest weight module for every dominant label λ in the explicit regular realization. The signed canonical set equals ±G∞, and the positive canonical choice is matched by its actual Ti,n top-string recursion. No equality of upper and lower bases, and no unitriangular word-basis characterization, is asserted.

Facts & Assumptions

[F1]

Dictionary (The Lusztig–Kashiwara form, parameter and coproduct dictionary): the semilinear source-to-library isomorphism φ carries source relations, coproduct ΔL and divided powers to the library presentation with φ(θi(n))=Fi(n) and φ(KhL)=K−h; on homogeneous degree ν, BL=CνBK with Cν a unit of the form ∏i(1−qi2)−νi≡1 mod q, and ±1 sign conventions are fixed by the generator values.

[F2]

Norm and integral criteria (Crystal lattice polarizations are perfect at q=0, Integral residues of the negative half: freeness, the crystal basis and the form characterization): L(∞)={u∈Uq−:BK(u,u)∈A0} (maximality), the pairing takes values on LZ=UA−∩L(∞) in AZ=Z[q,(1−q2n)−1:n≥1], and its residue pairing is Z-valued with orthonormal crystal classes in B(∞), and the norm-1 elements of LZ/qLZ are exactly B(∞)∪(−B(∞)); the balanced intersection is ⨁bZG∞(b) with BK(G∞(b),G∞(b′))≡δbb′ modulo q.

[F3]

String partition and top-string transition (The highest weight and negative half integral crystal triples are balanced, The string-ideal triples are balanced: the induction step (Kashiwara 7.4.1 / JKK 10.4)): the adapted bases of the string ideals I(i,n)A partition G∞(B(∞)) by exact string position, and for e~ib=0 one has G∞(f~inb)−Fi(n)G∞(b)∈I(i,n+1)A, an exact congruence modulo the strictly higher string ideal with coefficient 1.

[F4]

Based quotient of the half (The based quotient: projection of the lower global basis to a highest weight module): πλ is a based quotient; G∞(b) maps to 0 precisely for the killed crystal classes and otherwise to Gλ(πλ(b)), bijectively onto the integral highest-module basis.

[F5]

Auxiliary transport (Finite-support regularization of quantum label-weight modules): the source Y-regularity hypotheses are discharged in the explicit primitive-coroot regular datum, and characters and labels are transported back to the original lattice; the highest weight eigenvalue v⟨h,λ⟩=q−⟨h,λ⟩ agrees with the action of K−h.

Proof

technique · direct
1.1F1

Form and norm transport. For x∈UA−[−ν] one has BL(x,x)=CνBK(x,x) by [F1], with Cν and Cν−1=∏i(1−qi2)νi in 1+qZ[ ⁣[q] ⁣]. Hence BL(x,x)∈1+qZ[ ⁣[q] ⁣] if and only if BK(x,x)∈1+qZ[ ⁣[q] ⁣]; since a rational function with a power-series expansion has no pole at zero, the signed norm condition BL(x,x)∈1+qZ[ ⁣[q] ⁣] implies BK(x,x)∈A0.

1.2F1F2

The signed set contains ±G∞. Each G∞(b) is integral and bar fixed by [F2]; its BK-norm belongs to AZ and is 1 modulo q, so BL(G∞(b),G∞(b))=CνBK(G∞(b),G∞(b))∈1+qZ[ ⁣[q] ⁣]. Thus both signs of every lower global vector satisfy the source signed norm condition.

2.1F1F2step 1.1step 1.2algebra

Conversely, the signed set is contained in ±G∞. Let x∈UA− be bar fixed with BL(x,x)∈1+qZ[ ⁣[q] ⁣], and write its finite homogeneous decomposition x=∑νxν. For each nonzero xν choose its zero-chart order tν∈Z, so yν=q−tνxν∈L(∞)−ν∖qL(∞)−ν. By [F2], BK(yν,yν) is a unit of A0 with positive rational residue. Since every Cν has constant term 1, the terms Cνq2tνBK(yν,yν) of BL(x,x) with least order have positive leading coefficients and cannot cancel. Regularity therefore forces every tν≥0, so x∈L(∞). Bar fixedness puts x∈ψ(L(∞)), hence x∈EZ=⨁bZG∞(b), say x=∑babG∞(b) with integers ab and finite support. Homogeneity gives BL(x,x)=∑νCν∑b,c∈B(∞)−νabacBK(G∞(b),G∞(c)), whose residue is ∑bab2 by [F2]. This equals 1, so exactly one ab is ±1 and the rest vanish; thus x=±G∞(b). Together with step 1.2 this proves equality of the full signed sets.

3.1F3step 2.1

String partition and Ti,n transition. The source defines Bi,n by the left string ideals; write Ti,n for its transported map πi;n, which selects the unique signed element of exact string position n whose difference from Fi(n) times a lower position is an integral combination of strictly higher string positions. The adapted global bases of [F3] identify that partition with the crystal εi-partition of B(∞), and the exact top-string transition of [F3] gives Ti,n(G∞(b))=G∞(f~inb) whenever e~ib=0, with sign +1 fixed by the coefficient-1 quotient relation.

4.1step 2.1step 3.1

The positive canonical recursion. The source constructs its positive canonical basis from 1 by the transitions Ti,n; the Kashiwara crystal satisfies the same recursion because every positive-height class b has some εi(b)=n>0 with e~inb of strictly smaller height and b=f~in(e~inb). Induction on height using step 3.1 therefore identifies the positive canonical basis with G∞(B(∞)), removing the sign ambiguity of step 2.1 by the actual recursion and not merely by the almost-orthonormal norms.

5.1F4F5step 4.1

Highest-module quotient bases. The source defines its highest-module canonical basis by the based quotient of the half, omitting precisely the killed right-string-ideal elements; [F4] gives exactly the same zero-or-survive formula on G∞, and [F5] matches the highest eigenvalue v⟨h,λ⟩=q−⟨h,λ⟩ with the action of K−h and discharges the regularity hypotheses. Hence the quotient canonical bases coincide with the lower global bases Gλ for every dominant label λ.

6.1step 2.1step 4.1step 5.1∎

Conclusion. Steps 1.1–2.1 prove the signed-set equality {±G∞}; steps 3.1–4.1 prove the positive basis identification by the actual top-string recursion; step 5.1 proves the highest-module quotient identification under the exact transport dictionary. No upper basis and no unitriangular word characterization was used.

Depends on

Used by

Dependency tree · two levels

45 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