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

Reversal preserves the negative-half integral and crystal lattices

Statement

Let ⋆ be the Q(q)-linear anti-involution of Uq− fixing each generator Fi, so that for a word Fi1⋯Fir one has (Fi1⋯Fir)⋆=Fir⋯Fi1, and let B be the normalized Kashiwara half form of The negative-half bilinear form is symmetric, nondegenerate and integral. Then ⋆ is a well-defined anti-involution of the Serre quotient, reverses negative words, preserves the divided-power integral form UA− of The Lusztig divided-power integral form UA, commutes with the bar involution ψ, and preserves B: B(P⋆,Q⋆)=B(P,Q). Consequently ⋆ preserves the crystal lattice L(∞) of Crystal lattice polarizations are perfect at q=0, the integral residue lattice LZ(∞)=UA−∩L(∞), and the bar lattice LZ−=UA−∩ψ(L(∞)) of Integral residues of the negative half: freeness, the crystal basis and the form characterization. On the integral crystal residue the induced map permutes B(∞)∪(−B(∞)). Only this signed lattice preservation is asserted, not an unsigned ⋆-crystal theorem; the sign is what the gluing of the string-ideal global lifts requires.

Facts & Assumptions

Given: The negative half Uq− with generators Fi, its divided-power form UA−, the normalized half form B, and the lattices L(∞),LZ(∞).

[F1]

The word Gram formula and norm characterization (Crystal lattice polarizations are perfect at q=0, The negative-half bilinear form is symmetric, nondegenerate and integral): B is the symmetric normalized form with B(FiP,Q)=B(P,ei′Q); its value on two words is a finite sum over color-matching permutations with crossing exponents; L(∞)={P:B(P,P)∈A0}={P:B(P,L(∞))⊆A0} and B is positive definite on L(∞)/qL(∞) with orthonormal basis B(∞).

[F2]

Integral residues (Integral residues of the negative half: freeness, the crystal basis and the form characterization): LZ(∞) is a Z[q]-module whose residue image is ⨁b∈B(∞)Zb, the residue pairing is Z-valued, and the norm-1 elements of the integral residue are exactly the signed basis classes B(∞)∪(−B(∞)) modulo qLZ.

[F3]

Divided-power form (The Lusztig divided-power integral form UA): UA− is the A-span of finite products of divided powers Fi(r), graded by −Q+.

Proof

technique · direct
1.1F3algebra

⋆ is a well-defined anti-involution. The assignment Fi↦Fi extended antimultiplicatively is defined on the free algebra, and applying it to a negative Serre relation ∑r(−1)r(1−aijr)iFi1−aij−rFjFir=0 and reversing the order of each monomial gives ∑r(−1)r(1−aijr)iFirFjFi1−aij−r, which is (−1)1−aij times the same relation after the substitution r↦1−aij−r and the exact symmetry (mr)i=(mm−r)i of the Gaussian binomials. Hence ⋆ descends to Uq−, fixes Fi, and is an anti-involution: it reverses words and its square is the identity.

1.2F3algebra

Integral and bar compatibility. Since ⋆ fixes each divided power Fi(r) (it fixes Fi and the scalar [r]i!), it maps each generator of UA− to a generator, so ⋆(UA−)=UA−. It commutes with ψ because ⋆ is Q(q)-linear while ψ sends q↦q−1, and on generators ψ⋆(Fi)=ψ(Fi)=Fi=⋆ψ(Fi).

2.1F1step 1.1algebra

Isometry for the half form. Write P=Fi1⋯Fir, Q=Fj1⋯Fjs as words. Reversing both words, P⋆=Fir⋯Fi1, Q⋆=Fjs⋯Fj1, and the word Gram formula of [F1] expands both B(P,Q) and B(P⋆,Q⋆) as sums over bijections between matched colors with the same crossing exponents read backwards; reversing a permutation preserves the weight and the crossing number, so the two sums are termwise equal. Hence B(P⋆,Q⋆)=B(P,Q) on words and, by bilinearity and descent through the Serre ideal, on all of Uq−.

3.1F1step 1.2step 2.1

Lattice stability. For P∈L(∞) one has B(P⋆,P⋆)=B(P,P)∈A0 by step 2.1 and the norm characterization of [F1]; hence P⋆∈L(∞) and ⋆ preserves L(∞). It preserves UA− by step 1.2, so it preserves LZ=UA−∩L(∞); since it commutes with ψ and ψ(LZ)=LZ−, it also preserves the bar lattice LZ−.

4.1F2step 2.1step 3.1algebra

The signed residue permutation. Steps 2.1–3.1 induce an integral involutive isometry of LZ/qLZ. Each b has residue norm 1, so its image also has residue norm 1 and is ±b′ by [F2]. Involutivity makes this a signed permutation. No representative of b is required to have exact field norm 1.

5.1step 1.1step 1.2step 2.1step 3.1step 4.1∎

Conclusion. Steps 1.1–1.2 prove that ⋆ is an anti-involution preserving UA− and commuting with bar, step 2.1 proves that it is an isometry of the normalized half form, step 3.1 proves preservation of L(∞), LZ and LZ−, and step 4.1 gives the signed permutation of the integral crystal residue. No unsigned star-crystal theorem is asserted.

Depends on

Used by

Dependency tree · two levels

23 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