Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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 Taft algebra: PBW basis and Hopf structure

Statement

Let k be a field, N>1, and ζ∈k a primitive N-th root of unity, with char⁡(k)∤N. On the N2-dimensional vector space with basis gixj, 0≤i,j<N, define multiplication on basis elements by (gixj)(gaxb)=ζ−ajg i+a mod Nxj+b if j+b<N, and by 0 if j+b≥N. Then this is an associative unital algebra and is the presented algebra k⟨g,x⟩/(gN−1, xN, gx−ζxg); the displayed basis is a basis of that quotient. It becomes a Hopf algebra with Δ(g)=g⊗g, Δ(x)=1⊗x+x⊗g, ε(g)=1, ε(x)=0, S(g)=g−1, and S(x)=−xg−1.

Facts & Assumptions

Given: A field k, an integer N>1, and a primitive N-th root of unity ζ∈k with char⁡(k)∤N.

[F1]

Hopf algebras and antipodes: a Hopf algebra is a bialgebra with an antipode satisfying both convolution equations; no compositional bijectivity is required.

[F2]

The free associative R-algebra on a set and descent of relations: the free associative algebra on generators has the quotient universal property for a two-sided ideal of relations.

[F3]

Scalars, tensor powers, the empty tensor, opposite algebras and finite sums and Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors: tensor products are over k, iterated tensor products are identified by the stated associators, and elementary tensors span.

[F4]

Counit uniqueness and finite Sweedler calculus: Sweedler notation abbreviates finite tensor expressions, and contractions are well-defined linear maps on those tensors.

Proof

technique · direct
1.1givenF3constructalgebra

Let T be the vector space with basis ei,j, i∈Z/NZ, 0≤j<N, and extend bilinearly the rule ei,jea,b=ζ−ajei+a,j+b when j+b<N, and 0 otherwise. For a triple of basis elements, if j+b+d≥N, both parenthesizations vanish: if an intermediate degree reaches N it is truncated, and otherwise the final multiplication truncates. If j+b+d<N, the scalar in (ei,jea,b)ec,d is ζ−aj−c(j+b), while the scalar in ei,j(ea,bec,d) is ζ−cb−(a+c)j; these exponents are equal, and both outputs are ei+a+c,j+b+d. Hence multiplication is associative by bilinearity, and e0,0 is its two-sided unit.

2.1step 1.1F2algebra

Put g=e1,0 and x=e0,1. The formula gives gN=e0,0, xN=0, gx=e1,1, and xg=ζ−1e1,1, so gx=ζxg. Thus the relations define a surjective algebra map from the presented quotient Q=k⟨g,x⟩/(gN−1,xN,gx−ζxg) to T, since each ei,j is the image of gixj, by [F2].

3.1step 2.1algebra

In Q, the relation xg=ζ−1gx moves every g to the left of every x; reducing g-powers modulo N and setting any x-power at least N to zero shows that the N2 words gixj, 0≤i,j<N, span Q. Their images in T are its distinct basis vectors ei,j, hence are linearly independent in Q as well. Therefore Q→T is an isomorphism and the claimed PBW basis is valid.

3.2givenstep 2.1F2F3algebra

Define Δ on the free algebra by the stated generator images. They preserve the relations: Δ(g)N=1, and with A=1⊗x, B=x⊗g one has BA=ζAB and Δ(x)=A+B. If (A+B)n=∑r=0nCn,rAn−rBr, then C0,0=1 and Cn+1,r=ζrCn,r+Cn,r−1, since BrA=ζrABr. For 0≤n<N and 0≤r≤n, the recurrence gives Cn,r=∏s=1r(1−ζn−r+s)/(1−ζs): for 1≤r≤n, set P=∏s=1r−1(1−ζn−r+1+s) and D=∏s=1r(1−ζs); then Cn,r=P(1−ζn−r+1)/D and Cn,r−1=P(1−ζr)/D, so ζrCn,r+Cn,r−1=P(1−ζn+1)/D=Cn+1,r. For n=N and 0<r<N, the same formula has nonzero denominator factors and a numerator factor 1−ζN=0; hence (A+B)N=AN+BN=0. Also Δ(g)Δ(x)=g⊗gx+gx⊗g2=ζ(g⊗xg+xg⊗g2)=ζΔ(x)Δ(g), so Δ(gx−ζxg)=0, and Δ descends to Q.

3.3step 2.1algebra

Extend S as an anti-algebra map from the free algebra using S(g)=g−1 and S(x)=−xg−1. The relation ideal is killed: S(gN−1)=g−N−1=0; reordering with g−1x=ζ−1xg−1 shows S(xN)=(−xg−1)N is a scalar multiple of xNg−N=0; and S(gx−ζxg)=S(x)S(g)−ζS(g)S(x)=−xg−2+ζg−1xg−1=0. Thus S descends to Q.

4.1step 2.1step 3.2F2F3algebra

The assignment ε(g)=1,ε(x)=0 kills gN−1, xN, and gx−ζxg, so it descends to an algebra map Q→k. Coassociativity holds on g immediately; on x, both iterates equal 1⊗1⊗x+1⊗x⊗g+x⊗g⊗g. The two counit equations hold on g,x by the given values. These maps are algebra maps, and the presented algebra is generated by g,x, so the identities extend to all of Q.

5.1step 3.2step 4.1step 3.3F1F4algebra∎

On g, both m(S⊗id)Δ and m(id⊗S)Δ give 1=ε(g)1. On x, the left product is x+(−xg−1)g=0, and the right product is −xg−1+xg−1=0=ε(x)1. For products ab of elements on which both identities hold, anti-multiplicativity of S and multiplicativity of Δ give ∑S(a1b1)a2b2=∑S(b1)(S(a1)a2)b2=ε(a)ε(b)1, and ∑a1b1S(a2b2)=∑a1(b1S(b2))S(a2)=ε(a)ε(b)1. Induction on word length and linearity extend both antipode equations to all of Q. Thus the given maps make Q a Hopf algebra, with the interface of [F1].

Depends on

Used by

Dependency tree · two levels

39 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