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

Simply-laced braid symmetries preserve the full divided-power form

Statement

Assume the inherited Axiom of Choice. For a finite simply-laced root datum with full weight lattice and A=Z[q,q−1], the generic algebra has automorphisms Si with Si(Kh)=Ksih,Si(Ei)=−KiFi,Si(Fi)=−EiKi−1. They fix Ej,Fj for aij=0, while for aij=−1, Si(Ej)=EjEi−qEiEj,Si(Fj)=FiFj−q−1FjFi. They satisfy SiSj=SjSi for nonneighbors and SiSjSi=SjSiSj for neighbors. They and their inverses preserve the entire divided-power form UA, including its toral binomials, and the ordinary-generator form over A[(q−q−1)−1]. They consequently specialize to inverse automorphisms whenever the indicated denominators are invertible. For neighbors, Si(Ej(n))=∑r+s=n(−1)rqrEi(r)Ej(n)Ei(s),Si(Fj(n))=∑r+s=n(−1)rq−rFi(s)Fj(n)Fi(r). No root-of-unity PBW or small-quantum-group theorem is assumed in this assertion.

Facts & Assumptions

Given: The finite ADE datum and its generic and integral algebras.

[F2]

Finite generic integrable modules are semisimple highest-weight modules, and their one-color strings have the displayed divided-power formulas (Integrable bounded-above quantum modules with finite-dimensional weight spaces are direct sums of simple highest weight modules, Divided-power commutation and the simple Uqi(sl2) string modules). This includes restrictions to one- and two-color finite-type subalgebras.

[F3]

Generic triangular decomposition holds; actual finite highest lattices have finite classical characters and exact half kernels generated by the divided powers beyond their highest limits (Triangular decomposition of a quantized enveloping algebra, The based quotient: projection of the lower global basis to a highest weight module, Finitely generated free integral weight lattices and deformation of the classical weight character).

[F4]

The full form has generators Ei(r),Fi(r),Kh,Ti,c,t (The Lusztig divided-power integral form UA). The Axiom of Choice is inherited from [F2]–[F3], as declared in The Axiom of Choice.

Proof

Given: These data. The anti-semilinear involution ψ sends q to q−1, exchanges Ei,Fi, sends Kh to K−h, and reverses products. Each defining relation in [F1] is preserved, so this is an actual involution. For neighbors i,j put X=Ei, Z=Ej, Y=XZ−q−1ZX, and Hi=(Ki−Ki−1)/(q−q−1).

1.1F1algebra

The Serre relation gives XY=qYX and YZ=qZY. Mixed reordering gives [Fi,Y]=EjKi−1 and [Y,Fj]=KjEi. For the first, expand −HiEj+q−1EjHi and move the torus to the right; its coefficient is [−(q−1Ki−qKi−1)+q−1(Ki−Ki−1)]/(q−q−1)=Ki−1. The second similarly has coefficient Hj(qKj)−q−1Hj(Kj)=Kj. Put B=−qY and C=−KiFi. These identities give CB−qBC=Ej, CEj=q−1EjC and EjB=q−1BEj. Thus C2B−(q+q−1)CBC+BC2=q−1[−CBC+qBC2+EjC]=0, and the other Serre relation follows by using EjB=q−1BEj. These are exactly the positive relations involving color i after the proposed assignment. Applying ψ gives the negative relations with their stated orders and coefficients.

2.1F1step 1.1algebra

Here are all other positive Serre checks. On a homogeneous element use d(u)=Eiu−q⟨wt(u),hi⟩uEi, with d(uv)=d(u)v+q⟨wt(u),hi⟩ud(v). For a neighbor, d(Ej)=Yij and d2(Ej)=0; for a nonneighbor d(Ej)=0. If commuting colors j,k both neighbor i, apply d2 to their commutator, obtaining (q+q−1)[Yij,Yik]=0; if just one neighbors i, apply d once. If j,k are neighbors, the ADE diagram has no triangle, so at most one neighbors i. Apply d2 to the Serre relation with that color repeated and d to the other Serre relation. For example the three terms with repeated j become respectively (q+q−1)Yij2Ek, (q+q−1)YijEkYij and (q+q−1)EkYij2. Their Serre combination vanishes. These cases exhaust the pairs away from i; applying ψ gives all negative pairs.

2.2F1step 1.1algebra

For the mixed checks put Zik=FiFk−q−1FkFi. For distinct neighbors j,k, expansion using their commuting opposite colors gives [Yij,Zik]=HiEjFk−q−1FkHiEj−q−1EjHiFk+q−2FkEjHi. Move the torus left. Since EjFk has i-weight zero, the coefficient is (1+q−2)Hi−q−1(Hi(q−1Ki)+Hi(qKi))=0. For j=k, step 1.1 instead gives [Yij,Zij]=−q−1(HjKi−1+KjHi)=−q−1(KiKj−(KiKj)−1)/(q−q−1), exactly the required mixed relation after multiplying Y by −q. Pairs involving i commute because FiZij=qZijFi and KiZij=q−1ZijKi; the exchanged calculation handles the other half. The repeated i mixed relation becomes [−KiFi,−EiKi−1]=−Hi. Pairs with fewer neighboring colors commute immediately. Toral relations follow from the reflected weights. Thus the assignment preserves the full presentation.

2.3F1step 1.1algebra

We record an exact A2 normal-order calculation. Write x=Ei, z=Ej, y=xz−q−1zx and x(a)=xa/[a]!, including y(r)=yr/[r]! in the generic algebra. Then z(c)x(a)=∑r=0min⁡(a,c)(−1)rq(a−r)(c−r)+rx(a−r)y(r)z(c−r). Indeed zx(p)=qpx(p)z−qx(p−1)y and zy(r)=q−ry(r)z. Writing Cr(a,c)=(−1)rq(a−r)(c−r)+r, multiplication by z gives [c+1]Cr(a,c+1)=qa−2r[c−r+1]Cr(a,c)−q[r]Cr−1(a,c), where nonexistent terms are zero. Substitution reduces this to [c+1]=q−r[c−r+1]+qc−r+1[r]. This proves the formula by induction including both endpoints. In particular x(a)z(a+b)x(b)=z(b)x(a+b)z(a): both expand as the sum over 0≤r≤b on x(a+b−r)y(r)z(a+b−r) with coefficient (−1)rq(a+b−r)(b−r)+r[a+b−ra]q.

3.1F1step 1.1step 2.1step 2.2algebra

Its inverse assignment is Ei↦−FiKi−1, Fi↦−KiEi, Kh↦Ksih, and for a neighbor Ej↦EiEj−qEjEi, Fj↦FjFi−q−1FiFj. The same checks with orders reversed prove it is a homomorphism. On a neighboring positive generator one composition is CB−qBC=Ej from step 1.1. For the other put C′=−FiKi−1, B′=EiEj−qEjEi; mixed reordering gives [Fi,B′]=EjKi, hence C′B′=q−1B′C′−q−1Ej and B′C′−qC′B′=Ej. The negative checks apply ψ, and the i and toral compositions cancel directly. Both compositions are the identity on all generators.

4.1F1F2step 3.1algebra

On a finite generic rank-one string of highest label m define Qi(Fi(r)u)=(−1)rqr(m−r+1)Fi(m−r)u. It is invertible and conjugates its one-color action by Si. For a neighbor, Ej commutes Fi, and Ei2Eju=0. By [F2], Eju splits into a highest vector a of label m−1 and Fib, with b highest of label m+1. On the a component, with s=m−r, the coefficient of YFi(s)u is [m−s]−q−1[m−s+1]=−q−m+s−1. Multiplication by −q gives q−r, exactly the ratio between the two Qi string coefficients. On the Fib component it is [m−s+1]([s+1]−q−1[s])=[r+1]qm−r; multiplication by −q and the original string coefficient gives [r+1](−1)r+1q(r+1)(m−r+1), again the coefficient of QiEj. Therefore QiEj=Si(Ej)Qi.

4.2F1F4step 3.1step 2.3algebra

From step 2.3 and quantum Pascal induction one gets y(n)=∑r+s=n(−1)rq−rx(s)z(n)x(r). Multiplying by (−q)n and exchanging r,s gives the stated divided formula for Si(Ej(n)); applying ψ gives the negative formula. On color i ordinary multiplication gives Si(Ei(n))=(−1)nqn(n−1)KinFi(n) and Si(Fi(n))=(−1)nq−n(n−1)Ei(n)Ki−n. Inverses have the same integral formulas with order reversed. Thus they preserve the subalgebra B generated by divided E,F powers and Kh.

5.1F1F2step 4.1algebra

For the negative generator start at a lowest vector l of label −m. Then Qi(Ei(r)l)=dr(m)Ei(m−r)l, where dr(m)=(−1)m−rq(m−r)(r+1). Now Fjl splits into a lowest a of label −(m−1) and Eib, with b lowest of label −(m+1). The coefficient of Si(Fj)Ei(s)l on the first is −q−m+s−1=−q−r−1, and dr(m)(−q−r−1)=dr(m−1). On the second it is [r+1]qm−r, and dr(m)[r+1]qm−r=[r+1]dr+1(m+1). Thus QiFj=Si(Fj)Qi. Nonneighbors commute with the full rank-one action and hence with its explicit Qi. We have proved Qiu=Si(u)Qi on every generator.

6.1F1F2step 2.3step 5.1algebra

In A2 the identity CB−qBC=Ej also gives SiSj(Ei)=Ej and its exchanged version. Applying ψ gives the negative identities. Thus the two three-term products of the S maps agree on the rank-two algebra; both send Ei to −KjFj and Ej to −KiFi. On its highest module of label (a,b) the corresponding Q products send the highest vector to Fi(b)Fj(a+b)Fi(a)u and Fj(a)Fi(a+b)Fj(b)u, equal by step 2.3. Each intermediate vector is highest for the next color: for example EiFj(a+b)Fi(a)u=Fj(a+b)Fi(a−1)u=0, since the latter intermediate highest label for color j is a+b−1. Their conjugations agree, so the Q products agree on the entire cyclic module. By [F2] this holds on every finite module after rank-two restriction. For nonneighbors, restrictions are direct sums of tensor products of two independent strings, on which the two Q operators commute.

7.1F2F3step 4.1step 5.1step 6.1algebra

Finite generic integrable modules separate the algebra. For a nonzero element in triangular form choose an integral toral label ξ at which one nonzero Laurent coefficient stays nonzero; a Laurent polynomial cannot vanish on every grid (qn1,…,qnr). On a lowest-highest tensor of labels −a,b, b−a=ξ, an ordered positive-negative half product has the corresponding pure tensor as leading term, with a Laurent unit coefficient and corrections of smaller total half degree, by the triangular coproduct. Choose a,b large enough that the exact highest/lowest half kernels in [F3], generated by divided singular powers beyond their limits, have degrees greater than every half degree in this finite expression. The leading term survives, giving a finite module on which the element acts nontrivially. Therefore the operator braid relations from step 6.1, together with the conjugations in steps 4.1 and 5.1 and invertibility of Qi, imply the algebra braid relations on every generator, including colors outside the rank-two pair.

8.1F1F4step 4.2algebra∎

This B is the full form. The toral product gives the adjacent-shift identity Ti,c,t=q−tTi,c−1,t+qc−tKiTi,c−1,t−1 for t≥1. Indeed, factor the common t−1 numerator factors with shifts c−1,…,c−t+1 and compare the remaining two terms; their difference is qc−tKi(qt−q−t), which cancels the last denominator. Induct on t, starting with Ti,c,0=1 for every c. In the equal-exponent reordering Ei(t)Fi(t)=∑r=0tFi(t−r)Ti,2r−2t,rEi(t−r), all terms except Ti,0,t belong to B by the induction hypothesis, so Ti,0,t∈B. The shift identity gives every positive shift successively. Solving it as Ti,c−1,t=qtTi,c,t−qcKiTi,c−1,t−1 gives every negative shift successively; all coefficients lie in A. Hence every toral binomial belongs to B. Preservation of B really is preservation of UA, so specialization induces inverse automorphisms of the actual algebra. Their generator formulas also preserve the ordinary form and its inverse map over the stated localization. This proves every assertion, with exactly the inherited Choice in [F4].

Depends on

Used by

Dependency tree · two levels

48 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