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.

The bar involution and the contravariant anti-involution preserve UA

Statement

Let ψ (the bar involution) and τ (the contravariant anti-involution) be the semilinear maps of The Chevalley involution, bar involution, and contravariant anti-involution preserve the Drinfeld–Jimbo ideal, so that ψ(q)=q−1, ψ(Ei)=Ei, ψ(Fi)=Fi, ψ(Kh)=Kh−1 and τ(q)=q−1, τ(Ei)=Fi, τ(Fi)=Ei, τ(Kh)=Kh−1, with τ anti-multiplicative. Let A=Z[q,q−1] and let UA be the Lusztig divided-power integral form with its generators Ei(r), Fi(r), Kh±1 and toral binomials Ti,c,t (The Lusztig divided-power integral form UA). Then ψ(UA)=UA and τ(UA)=UA. Explicitly, on the generators,

ψ(Ei(r))=Ei(r),ψ(Fi(r))=Fi(r),ψ(Kh)=Kh−1,ψ(Ti,c,t)=Ti,c,t,

τ(Ei(r))=Fi(r),τ(Fi(r))=Ei(r),τ(Kh)=Kh−1,τ(Ti,c,t)=Ti,c,t.

In particular both maps restrict to bijections of UA: ψ to a semilinear algebra involution of UA and τ to a semilinear anti-involution of UA, while q±1∈A keeps all coefficients in A. These are the two involutions under which the bar lattice and the contravariant duality of the later constructions are taken; neither formula is the Chevalley involution ω, which changes signs, exchanges the two halves and is treated in The Chevalley involution, bar involution, and contravariant anti-involution preserve the Drinfeld–Jimbo ideal. No choice is used.

Facts & Assumptions

Given: The Drinfeld–Jimbo algebra Uq(g) (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations), the involution lemma defining ψ,τ and their semilinearity (The Chevalley involution, bar involution, and contravariant anti-involution preserve the Drinfeld–Jimbo ideal), and the A-algebra UA with its listed generators (The Lusztig divided-power integral form UA).

[F1]

ψ is an involutive semilinear algebra automorphism and τ an involutive semilinear anti-automorphism of Uq(g) with the stated values on generators; both apply the field involution σ(q)=q−1 (The Chevalley involution, bar involution, and contravariant anti-involution preserve the Drinfeld–Jimbo ideal).

[F2]

The field involution σ preserves A=Z[q,q−1], since σ(∑kakqk)=∑kakq−k; and σ fixes [r]i and [r]i! for every r≥0, because [r]i is invariant under qi↦qi−1 (Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F3]

UA is the A-subalgebra generated by the Ei(r), Fi(r), Kh±1 and Ti,c,t; its elements are finite A-linear combinations of finite products of these generators (The Lusztig divided-power integral form UA).

[F4]

Ti,c,t=∏s=1tKiqic−s+1−Ki−1qi−c+s−1qis−qi−s with the empty product Ti,c,0=1 (The Lusztig divided-power integral form UA).

Proof

Proof technique: compute both (anti-)maps on each family of generators of UA and conclude by semilinearity and [F3].

1.1givenF1F2F4algebra

For every r≥0 one has ψ(Ei(r))=ψ(Ei)r/ψ([r]i!)=Eir/[r]i!=Ei(r) and ψ(Fi(r))=Fi(r), since ψ fixes Ei,Fi and fixes the scalar [r]i! by [F2]; on the torus ψ(Kh)=Kh−1. For the toral binomial, applying ψ factor by factor and using ψ(Ki±1)=Ki∓1, ψ(qi±1)=qi∓1 gives ψ(Kiqic−s+1−Ki−1qi−c+s−1)=−(Kiqic−s+1−Ki−1qi−c+s−1) and ψ(qis−qi−s)=−(qis−qi−s); the two signs cancel, so each factor and hence the product Ti,c,t of [F4] is fixed: ψ(Ti,c,t)=Ti,c,t.

2.1step 1.1F1F2F4algebra

For τ, which is anti-multiplicative, τ(Ei(r))=τ(Eir)/τ([r]i!)=τ(Ei)r/[r]i!=Fir/[r]i!=Fi(r) by [F2], and symmetrically τ(Fi(r))=Ei(r); τ(Kh)=Kh−1; and on each factor of [F4], τ(Kiqic−s+1−Ki−1qi−c+s−1)=Ki−1qi−(c−s+1)−Kiqic−s+1=−(Kiqic−s+1−Ki−1qi−c+s−1) while τ(qis−qi−s)=−(qis−qi−s), so τ fixes every factor; since the factors commute, τ(Ti,c,t)=Ti,c,t as well.

3.1step 1.1step 2.1F1F2F3algebra∎

Consequently each of ψ,τ sends every generator of UA into UA by steps 1.1 and 2.1, and sends scalars a∈A into A by [F2]. From [F3], an element of UA is a finite sum ∑jajgj,1⋯gj,mj with aj∈A and generators gj,l; applying the semilinear algebra map ψ gives ∑jσ(aj)ψ(gj,1)⋯ψ(gj,mj)∈UA, and applying the semilinear anti-algebra map τ gives ∑jσ(aj)τ(gj,mj)⋯τ(gj,1)∈UA. Hence ψ(UA)⊆UA and τ(UA)⊆UA; since ψ,τ are involutions on Uq(g) by [F1], the reverse inclusions hold as well, so ψ(UA)=UA and τ(UA)=UA and the restrictions are bijections of the stated (anti-)multiplicative types. No choice is used.

Depends on

Used by

Dependency tree · two levels

15 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