Alphabeta Math
DefinitionDefinition: 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.

Finite Drinfeld double: convention and candidate multiplication

Definition

Let k be a field and let H be a finite-dimensional Hopf algebra over k with bijective antipode S. Write H∗=Hom⁡k(H,k). Its dual coproduct is the unique map ΔH∗:H∗→H∗⊗H∗ satisfying

ΔH∗(f)(x⊗y)=f(xy)

for all f∈H∗ and x,y∈H; finite tensor duality ensures this is an algebraic tensor. The ordinary convolution product on H∗ is (f∗g)(x)=∑f(x1)g(x2). We use the opposite algebra H∗op, whose product is f⊙g:=g∗f and whose coproduct is the ordinary dual coproduct, not its opposite.

As a vector space set D(H):=H∗op⊗H and write fh for f⊗h in this normal order. Define the crossing map

χ(h⊗f)=∑f1(S(h1))f3(h3)f2⊗h2.

The candidate product and unit are

(f⊗h)(g⊗k)=∑g1(S(h1))g3(h3)(g2∗f)⊗h2k,1D=εH⊗1H.

The appearance of g2∗f is the H∗op product f⊙g2. This item defines the bilinear candidate operation; associativity, the coalgebra structure and the antipode are supplied separately by Double crossing laws and associativity ↗ and Double coalgebra, multiplicativity, and antipode ↗.

Facts & Assumptions

Given: A finite-dimensional Hopf algebra H over k with bijective antipode S. Define the finite-dual coproduct and candidate multiplication on D(H), including their algebraic well-definedness.

[F1]

Finite tensor duality and basis-independent coevaluation: evaluation identifies H∗⊗H∗ with (H⊗H)∗ for finite-dimensional H.

[F2]

Convolution of linear maps is associative and unital: convolution on maps from a coalgebra to an algebra is a bilinear associative multiplication with the stated unit.

[F3]

The dual of a finite-dimensional Hopf algebra is a Hopf algebra: transposed structural maps give H∗ a Hopf structure whose product is convolution and whose coproduct is transposed multiplication.

[F4]

Finite Hopf algebras have one-dimensional integral spaces and bijective antipode: the antipode of a nonzero finite-dimensional Hopf algebra is bijective.

[A1]

H is finite-dimensional and its antipode is bijective, as stated in the Definition. Also H≠0: its counit is a unital algebra map, so εH(1H)=1k; consequently the nonzero hypothesis of [F4] is satisfied.

Proof

1.1givenA1F1F3F4construct

By [F1], transposing multiplication on H gives a unique algebraic tensor ΔH∗(f)∈H∗⊗H∗ characterized by ΔH∗(f)(x⊗y)=f(xy). The dual Hopf structure in [F3] has exactly this coproduct and convolution product. Since [A1] gives H≠0, [F4] applies and supplies the bijectivity of S used by the downstream inverse-crossing and antipode formulas; that bijectivity is also an explicit hypothesis of this Definition.

2.1givenF2F3algebra∎

Each displayed crossing and product is a composite of finite coproducts, evaluation, multiplication in H, and convolution on H∗, so [F2] and [F3] make them well-defined bilinear maps on the stated vector spaces. No associativity claim for the candidate double product is made here.

Remarks

The finite-dimensional and bijective-antipode assumptions are explicit. The HH-8 supplier Finite Hopf algebras have one-dimensional integral spaces and bijective antipode discharges the latter for every nonzero finite-dimensional Hopf algebra; [A1] verifies that its nonzero hypothesis holds here. The H∗op convention is chosen so that direct coaction evaluation gives the left-left Yetter–Drinfeld action. No H∗cop formula is imported.

Depends on

Used by

Dependency tree · two levels

34 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