Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 type-A quantum presentation admits its displayed antipode

Statement

Let F=Q(q), let N≥1, and let UN be the presented algebra and bialgebra of The type-A quantum algebra and its tensor-action formulas and The type-A quantum presentation descends to its coproduct tensor action. The candidate S~ of The candidate antipode for the type-A quantum algebra descends to a well-defined F-linear map S:UN→UN satisfying S(xy)=S(y)S(x). It obeys

m(S⊗id⁡)Δ=uϵ=m(id⁡⊗S)Δ.

Here a Hopf algebra means a unital associative algebra with the coassociative coproduct and counit of a bialgebra and a linear map satisfying these two identities; no bijectivity of S is asserted. Thus UN is a Hopf algebra in this sense.

Facts & Assumptions

Given: F=Q(q), N≥1, the generators and relations of UN, its coproduct and counit, and the candidate S~. In step 5.1, Δ(a)=∑a(1)⊗a(2) denotes a finite expression for the actual tensor Δ(a); each displayed sum is a contraction induced by the algebra multiplication and the specified linear maps, so it does not depend on that expression.

[F1]

The Lj commute and LjLj−1=Lj−1Lj=1 (The type-A quantum algebra and its tensor-action formulas).

[F2]

The weights are LjEiLj−1=qδj,i−δj,i+1Ei and LjFiLj−1=q−δj,i+δj,i+1Fi (The type-A quantum algebra and its tensor-action formulas).

[F3]

The mixed commutator relation is [Ei,Fj]=δij(Ki−Ki−1)/(q−q−1) (The type-A quantum algebra and its tensor-action formulas).

[F4]

For ∣i−j∣>1 the Ei,Ej and Fi,Fj commute, and for ∣i−j∣=1 both families satisfy the displayed quantum Serre relation (The type-A quantum algebra and its tensor-action formulas).

[F5]

The candidate reverses words and sends Lj↦Lj−1, Lj−1↦Lj, Ei↦−EiKi−1, and Fi↦−KiFi, where Ki=LiLi+1−1 (The candidate antipode for the type-A quantum algebra).

[F6]

A map from the free associative algebra descends through a presentation when it preserves the two-sided ideal generated by the displayed relations; that ideal consists of finite sums arb with r a defining relation (The free associative R-algebra on a set and descent of relations).

[F7]

The displayed coproduct and counit descend to algebra homomorphisms, the coproduct is coassociative, and both counit identities hold (The type-A quantum presentation descends to its coproduct tensor action).

Proof

Given: The data in [F1]–[F7].

1.1givenF1F2F5algebra

Put ars=2δrs−δr,s+1−δr+1,s for 1≤r,s<N. Multiplying the two L-weight formulas in [F2], and using that the Lj commute by [F1], gives KrEsKr−1=qarsEs and KrFsKr−1=q−arsFs. In particular arr=2, ars=asr, adjacent distinct indices have ars=−1, and nonadjacent distinct indices have ars=0. Reversing the words Kr=LrLr+1−1 and Kr−1=Lr+1Lr−1 gives S~(Kr)=Kr−1 and S~(Kr−1)=Kr.

2.1givenF1F2F5step 1.1algebra

The inverse relations map to LjLj−1=Lj−1Lj=1, and each commutator LjLk−LkLj maps to Lk−1Lj−1−Lj−1Lk−1=0 by [F1]. For w=δj,i−δj,i+1, the positive weight relation maps to Lj(−EiKi−1)Lj−1−qw(−EiKi−1)=0, since Lj commutes with Ki and [F2] gives LjEiLj−1=qwEi. The negative weight relation maps to Lj(−KiFi)Lj−1−q−w(−KiFi)=0 by the same commutation and [F2].

2.2givenF2F3F5step 1.1algebra

Write Ci=(Ki−Ki−1)/(q−q−1). By [F5], S(Ci)=−Ci, so the image of EiFj−FjEi−δijCi is KjFjEiKi−1−EiKi−1KjFj+δijCi. If i≠j, [F3] gives FjEi=EiFj; the two first terms become respectively qajiEiKjFjKi−1 and qaijEiKjFjKi−1, which are equal by aij=aji. If i=j, then KiFiEiKi−1=(KiFiKi−1)(KiEiKi−1)=FiEi, so the first two terms equal FiEi−EiFi=−Ci by [F3] and cancel +Ci. Thus every mixed commutator relation is preserved.

2.3givenF2F4F5step 1.1algebra

If ∣i−j∣>1, then aij=aji=0. Hence Ki,Kj commute with the opposite-index E and F generators; [F4] gives that the original Ei,Ej and Fi,Fj commute. The formulas in [F5] therefore show directly that the images of both distant commutators are zero.

2.4givenF2F4F5step 1.1algebra

Let γ=q+q−1 and take adjacent i,j. Set Xr=ErKr−1 and Yr=KrFr. Moving the Cartan factors with the weights from step 1.1 gives Xi2Xj=Ei2EjKi−2Kj−1, XiXjXi=EiEjEiKi−2Kj−1, and XjXi2=EjEi2Ki−2Kj−1; hence the X-Serre polynomial is the original E-Serre polynomial followed by Ki−2Kj−1. The same weight moves give Yi2Yj=Ki2KjFi2Fj, YiYjYi=Ki2KjFiFjFi, and YjYi2=Ki2KjFjFi2, so the Y-Serre polynomial is Ki2Kj followed by the original F-Serre polynomial. Both vanish by [F4]. Reversing each cubic word and accounting for its three minus signs gives S~(Ei2Ej−γEiEjEi+EjEi2)=−(Xi2Xj−γXiXjXi+XjXi2) and the analogous equality with F,Y; thus both Serre relations are preserved.

3.1givenF5F6step 2.1step 2.2step 2.3step 2.4algebra

Steps 2.1–2.4 show that the image of every defining relation under S~ lies in the defining ideal. By [F6] every element of that ideal is a finite sum of terms arb; reversal sends each such term to S~(b)S~(r)S~(a), which remains in the ideal. Therefore S(a+I):=S~(a)+I is well-defined on the quotient and is an anti-algebra map. The empty word maps to 1, so S(1)=1.

4.1givenF5F7step 3.1algebra

On Lj±1, both products S(x(1))x(2) and x(1)S(x(2)) equal 1=ϵ(x)1. On Ei, the two products from [F7] are S(Ei)Ki+Ei=0 and EiS(Ki)+S(Ei)=0. On Fi, they are S(Fi)+S(Ki−1)Fi=0 and Fi+Ki−1S(Fi)=0. Thus both antipode identities hold on every algebra generator and its inverse.

5.1givenF7step 4.1algebra∎

For products ab, anti-multiplicativity and the fact that Δ,ϵ are algebra homomorphisms [F7] give ∑S(a(1)b(1))a(2)b(2)=∑S(b(1))(S(a(1))a(2))b(2)=ϵ(a)ϵ(b)1 whenever the left identity holds for a,b; likewise ∑a(1)b(1)S(a(2)b(2))=∑a(1)(b(1)S(b(2)))S(a(2))=ϵ(a)ϵ(b)1 for the right identity. Induction extends both identities from the generators in step 4.1 to every word, and F-linearity extends them to all of UN. If N=1, there are no Ei,Fi or Serre relations, and the same generator checks on L1±1 prove the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by The candidate antipode for the type-A quantum algebra.

Dependency tree · two levels

32 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