Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 dual of a finite-dimensional Hopf algebra is a Hopf algebra

Statement

Let k be a field and H=(H,m,u,Δ,ε,S) a finite-dimensional Hopf k-algebra. Give H∗=Hom⁡k(H,k) the transposed Hopf structure: multiplication is convolution,

(ϕψ)(h)=(ϕ⊗ψ)(Δ(h)),

the unit is ε, coproduct is the transpose m∗:H∗→H∗⊗H∗ under finite tensor duality, the counit is ϕ↦ϕ(1H), and the antipode is S∗(ϕ)=ϕ∘S. Then H∗ is a Hopf algebra. No bijectivity assumption on S is required.

Facts & Assumptions

Given: A field k and a finite-dimensional Hopf k-algebra H, with the structural maps in the Statement.

[F1]

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

[F2]

Finite-dimensional algebra-coalgebra duality: for finite-dimensional algebras and coalgebras, full duality transposes multiplication/unit and coproduct/counit, reverses structure maps, and identifies each object with its bidual.

[F3]

Finite tensor duality and basis-independent coevaluation: for finite-dimensional V,W, V∗⊗W∗≅(V⊗W)∗, and the isomorphism is induced by (f⊗g)(v⊗w)=f(v)g(w).

[F4]

Bialgebras and bialgebra maps: Δ and ε are unital algebra maps, and the tensor-product algebra uses (a⊗b)(c⊗d)=ac⊗bd.

[F5]

Counit uniqueness and finite Sweedler calculus: Sweedler notation records a finite tensor expression, and every contraction is a well-defined linear map on that tensor.

Proof

technique · direct
1.1givenF1F2F3

Since H is finite-dimensional, [F3] identifies (H⊗H)∗ with H∗⊗H∗; thus for each ϕ∈H∗, the transpose m∗(ϕ) is a tensor ∑iϕi⊗ψi characterized by ϕ(ab)=∑iϕi(a)ψi(b). The same finite tensor duality for H⊗H permits transposing every structural identity in [F1] and [F2].

2.1givenF1F5step 1.1algebra

The convolution product on H∗ is associative: evaluating (ϕψ)θ and ϕ(ψθ) on h gives respectively ∑ϕ(h1)ψ(h2)θ(h3) through the two iterated coproducts of H, which agree by coassociativity; the counit identities make ε its left and right unit.

2.2givenF2step 1.1algebra

The coproduct m∗ on H∗ is coassociative because evaluating (m∗⊗id)m∗(ϕ) and (id⊗m∗)m∗(ϕ) on a⊗b⊗c gives ϕ((ab)c) and ϕ(a(bc)), equal by associativity of H; evaluation at 1H is a two-sided counit by 1Ha=a=a1H.

2.3givenF1F2F4F5step 1.1algebra

The coproduct on H∗ preserves convolution products: for ϕ,ψ∈H∗ and a,b∈H, ΔH∗(ϕψ)(a⊗b)=(ϕψ)(ab)=∑ϕ(a1b1)ψ(a2b2)=(ΔH∗(ϕ)ΔH∗(ψ))(a⊗b), where the second equality uses that ΔH is an algebra map. Finite tensor duality makes equality on all a⊗b equality of tensors.

3.1step 2.1step 2.2step 2.3F4givenalgebra

The unit εH is group-like for ΔH∗, since εH(ab)=εH(a)εH(b); the counit ϕ↦ϕ(1H) preserves convolution products because ΔH(1H)=1H⊗1H. Thus the maps in the Statement make H∗ a bialgebra.

4.1givenF1F5step 1.1step 3.1

Define S∗(ϕ)=ϕ∘S. If ΔH∗(ϕ)=∑iϕi⊗ψi, then for h∈H, (S∗(ϕ(1))ϕ(2))(h)=∑(h),iϕi(S(h1))ψi(h2)=∑(h)ϕ(S(h1)h2)=ε(h)ϕ(1H). The last equality is the left antipode equation in [F1]; this is the left antipode equation for S∗ in H∗.

5.1givenF1F5step 1.1step 3.1step 4.1∎

Likewise, (ϕ(1)S∗(ϕ(2)))(h)=∑(h),iϕi(h1)ψi(S(h2))=∑(h)ϕ(h1S(h2))=ε(h)ϕ(1H), using the right antipode equation in [F1]. Both convolution equations hold, so S∗ is an antipode on H∗, and no step uses S−1.

Depends on

Used by

Dependency tree · two levels

30 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