Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 rank-one root-power quotient is a finite-dimensional Hopf algebra

Statement

Let ℓ>2 be odd and let ζ∈C be a primitive ℓ-th root of unity. In the rank-one De Concini–Kac specialization Dζ=UζDK(sl2) of De Concini–Kac, Lusztig, and small quantum-group forms at roots of unity, the ordered monomials FaKbEc(a,c∈Z≥0, b∈Z) form a C-basis. With the local coproduct convention Δ(K)=K⊗K,Δ(E)=E⊗K−1+1⊗E,Δ(F)=F⊗1+K⊗F, the two-sided ideal Jℓ=(Eℓ,Fℓ,Kℓ−1) is stable under the coproduct, counit ε(K)=1, ε(E)=ε(F)=0, and antipode S(K)=K−1, S(E)=−EK, S(F)=−K−1F. The quotient uζ(sl2)=Dζ/Jℓ is a Hopf algebra with basis {F‾ aK‾ bE‾ c:0≤a,b,c<ℓ}, and therefore has dimension ℓ3.

Facts & Assumptions

Given: The rank-one root forms of De Concini–Kac, Lusztig, and small quantum-group forms at roots of unity, a primitive odd root ζ of order ℓ>2, and the Hopf-algebra axioms of Hopf algebras and antipodes.

[F1]

The rank-one De Concini–Kac algebra is generated by E,F,K±1 with relations KEK−1=ζ2E, KFK−1=ζ−2F, and EF−FE=H, where H=(K−K−1)/(ζ−ζ−1) (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations, De Concini–Kac, Lusztig, and small quantum-group forms at roots of unity).

[F2]

Since ζ is primitive of odd order ℓ>2, ζ−ζ−1≠0 and ζ2 is primitive of order ℓ (De Concini–Kac, Lusztig, and small quantum-group forms at roots of unity).

[F3]

A Hopf algebra is a bialgebra with a two-sided convolution inverse S of its identity map; equivalently, the two antipode equations hold (Hopf algebras and antipodes).

[F4]

In the generic rank-one algebra generated by E,F,K±1, the ordered monomials FaKbEc span and are linearly independent (Divided-power commutation and the simple Uqi(sl2) string modules, clause (i)).

Proof

technique · prove spanning by a terminating rewriting system, use the choice-free generic rank-one basis for independence, verify the specialized Hopf maps on the presentation, and then descend them to the root-power quotient
1.1givenF1F2constructalgebra

Work first over R=C[v,v−1,(v−v−1)−1] with Hv=(K−K−1)/(v−v−1). Combine adjacent powers of K as elements Kb of the group algebra R[K,K−1], and rewrite KbF→v−2bFKb, EKb→v−2bKbE, and EF→FE+Hv. Count inversions in the order F<K<E, with a second measure equal to the number of E and F symbols. The first two rules decrease the inversion count; the FE term of the third decreases it and its Hv term lowers the second measure. Thus every word reduces after finitely many steps to an R-linear combination of the ordered monomials FaKbEc. The same rules remain valid after v=ζ by [F2].

1.2givenF1F2algebra

Define a unital algebra-map candidate Δ and a counit candidate ε by the displayed formulas, with Δ(1)=1⊗1 and ε(1)=1; define an anti-algebra-map candidate S by the displayed formulas, with S(1)=1. For toral conjugation, direct multiplication gives Δ(K)Δ(E)Δ(K−1)=ζ2Δ(E) and Δ(K)Δ(F)Δ(K−1)=ζ−2Δ(F). For the mixed relation, expand the coproduct commutator: the two cross terms cancel since EK=ζ−2KE and K−1F=ζ2FK−1, leaving [E,F]⊗K−1+K⊗[E,F]=H⊗K−1+K⊗H=Δ(H). The counit assignments preserve each relation. For the antipode assignment, applying the anti-map to the two toral relations gives −KE+ζ2EK=0 and −FK−1+ζ−2K−1F=0. Applying it to EF−FE−H gives K−1FEK−EF+H=FE−EF+H=0. Thus Δ,ε,S descend to Dζ.

1.3givenF1F2algebra

For n≥1, telescoping gives EnF−FEn=∑j=0n−1Ej[E,F]En−1−j; moving K±1 through Ej by EjK=ζ−2jKEj and EjK−1=ζ2jK−1Ej gives EnF−FEn=∑j=0n−1ζ−2jK−∑j=0n−1ζ2jK−1ζ−ζ−1En−1. At n=ℓ both geometric sums vanish because for t=ζ±2 one has t≠1, tℓ=1, and ∑j=0ℓ−1tj=(1−tℓ)/(1−t)=0 by [F2]; hence Eℓ commutes with F and it commutes with E,K as well. Similarly, FnE−EFn=∑j=0n−1Fj[F,E]Fn−1−j; using FjK=ζ2jKFj and FjK−1=ζ−2jK−1Fj gives FnE−EFn=−∑j=0n−1ζ2jK−∑j=0n−1ζ−2jK−1ζ−ζ−1Fn−1, whose sums also vanish at n=ℓ, so Fℓ commutes with E and already commutes with F,K. Finally Kℓ commutes with E,F since ζ2ℓ=1. Thus Eℓ,Fℓ,Kℓ−1 are central and Jℓ is a two-sided ideal.

2.1step 1.1F1F4F2algebra

The map from the rank-one algebra over R presented by the three relations in [F1] with v in place of ζ onto the R-subalgebra generated by E,F,K±1 is surjective by construction, and step 1.1 shows that its source is spanned by FaKbEc. Their images are linearly independent in the generic algebra by [F4]; hence the map is injective and the R-source is free with that basis. Tensoring this free module along v↦ζ preserves the basis. Thus Dζ has the stated rank-one presentation and PBW basis.

2.2step 1.2F1F3algebra

On K the two iterated coproducts are K⊗K⊗K. On E they both equal E⊗K−1⊗K−1+1⊗E⊗K−1+1⊗1⊗E, and on F they both equal F⊗1⊗1+K⊗F⊗1+K⊗K⊗F; hence coassociativity holds on generators. The two counit composites give K,E,F on each generator: for E they are 0+E and E+0, and for F they are 0+F and F+0, while K is sent to 1⋅K and K⋅1. Both counit composites and both iterated coproducts are algebra maps, so these identities hold on all of Dζ. For the antipode equations, on K they are K−1K=1=KK−1; on E they are S(E)K−1+E=0 and EK+S(E)=0; on F they are S(F)+K−1F=0 and F+KS(F)=0. Since S(1)=1, both equations also hold on the unit. If both equations hold for x and y, then anti-multiplicativity of S and multiplicativity of Δ give ∑S(x(1)y(1))x(2)y(2)=ε(x)ε(y)1 and ∑x(1)y(1)S(x(2)y(2))=ε(x)ε(y)1. Induction on word length proves the antipode equations on all of Dζ, so it is a Hopf algebra by [F3].

3.1step 1.2step 2.2step 1.3F2algebra

If AB=tBA, induction starts at n=0 with (A+B)0=1 and C0,0=1 and gives (A+B)n=∑r=0nCn,rBn−rAr, where Cn,0=Cn,n=1 and, for 0<r<n, Cn,r=∏j=1r(1−tn−r+j)/(1−tj). Multiplying the expansion on the right by A+B shows the coefficient recurrence Cn+1,r=Cn,r−1+trCn,r. For the product formula, putting those two terms over ∏j=1r(1−tj) leaves the common numerator ∏k=n−r+2n(1−tk) times (1−tr)+tr(1−tn−r+1)=1−tn+1, exactly the product formula for Cn+1,r. Thus the formula follows inductively whenever its denominators are nonzero. For t=ζ2 or t=ζ−2 and 0<r<ℓ, the denominator is nonzero and the numerator contains 1−tℓ=0, so all intermediate coefficients vanish. In Δ(E) the summands A=E⊗K−1 and B=1⊗E satisfy AB=ζ−2BA; in Δ(F) the summands A=F⊗1 and B=K⊗F satisfy AB=ζ2BA. Applying the formula to these two pairs gives Δ(Eℓ)=Eℓ⊗K−ℓ+1⊗Eℓ and Δ(Fℓ)=Fℓ⊗1+Kℓ⊗Fℓ. Also Δ(Kℓ−1)=(Kℓ−1)⊗Kℓ+1⊗(Kℓ−1). The counit kills all three generators. Since ℓ is odd, (EK)ℓ=ζ−ℓ(ℓ−1)EℓKℓ and (K−1F)ℓ=ζℓ(ℓ−1)FℓK−ℓ, with ζℓ(ℓ−1)=1, we have S(Eℓ)=−EℓKℓ and S(Fℓ)=−K−ℓFℓ, both in Jℓ; also S(Kℓ−1)=K−ℓ−1=−K−ℓ(Kℓ−1)∈Jℓ. The sum Jℓ⊗Dζ+Dζ⊗Jℓ is a two-sided ideal of Dζ⊗Dζ, so the coproduct inclusions for the three generators extend to all of Jℓ because Δ is multiplicative. The counit kills the ideal because it kills its generators, and the anti-multiplicative antipode preserves the ideal because it sends each generator into Jℓ. Therefore the quotient operations are well-defined and satisfy the Hopf identities inherited from Dζ.

4.1step 2.1step 1.3step 3.1algebra∎

By the PBW basis in step 2.1 and centrality in step 1.3, the ideal generated by Eℓ,Fℓ is spanned by monomials with c≥ℓ or a≥ℓ, leaving a basis indexed by 0≤a,c<ℓ and b∈Z. Modulo Kℓ−1 one has K−1=Kℓ−1, so each toral coefficient is represented by a polynomial in K; division by the monic polynomial Kℓ−1 gives a unique remainder of degree less than ℓ. Thus the quotient basis is exactly FaKbEc with 0≤a,b,c<ℓ. There are ℓ3 such elements, so the quotient has dimension ℓ3.

Depends on

Used by

Dependency tree · two levels

18 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