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.

Finite-dimensional Hopf algebras are Frobenius

Statement

Let H be a nonzero finite-dimensional Hopf algebra over a field k. For every nonzero left integral functional λ∈∫H∗ℓ, the map

Φ:H→H∗,Φ(a)(b)=λ(ab)

is an isomorphism. Consequently (a,b)↦λ(ab) is an associative nondegenerate bilinear form and H is a Frobenius algebra. More explicitly, for every basis (u1,…,un) of H there is a unique basis (v1,…,vn) satisfying λ(ujvi)=δji, and

a=∑i=1nλ(avi)ui=∑i=1nλ(uia)vi(a∈H).

Facts & Assumptions

Given: A nonzero finite-dimensional Hopf algebra H over a field k, a nonzero λ∈∫H∗ℓ, and a basis (u1,…,un) of H with its dual basis (u1∗,…,un∗).

[F1]

Frobenius functionals and associative pairings: the form (a,b)↦λ(ab) is Frobenius when it is nondegenerate in both variables; associativity follows from multiplication in H.

[F2]

Left and right integrals and integral functionals: λ is a left integral functional precisely when p∗λ=p(1)λ for every p∈H∗.

[F3]

Finite Hopf algebras have one-dimensional integral spaces and bijective antipode: ∫H∗ℓ is one-dimensional and the antipode SH is bijective.

[F4]

The finite dual is a right regular Hopf module: H∗ is a right Hopf module with action (f↼h)(x)=f(xSH(h)).

[F5]

The fundamental theorem of right-right Hopf modules: the map ∫H∗ℓ⊗H→H∗, μ⊗h↦μ↼h, is an isomorphism.

[F6]

The dual family of a finite basis is a basis of the dual space, with the same dimension: a finite basis and its dual basis have the coordinate identities a=∑iui∗(a)ui and f=∑if(ui)ui∗.

Proof

1.1F2F3F4F5algebra

By [F2]–[F3], the nonzero λ spans ∫H∗ℓ. Restricting the isomorphism [F5] to this one-dimensional first factor shows that h↦λ↼h is an isomorphism H→H∗. By [F4], this map sends h to the functional x↦λ(xSH(h)). Since SH is bijective, Θ:H→H∗, Θ(b)(x)=λ(xb), is an isomorphism.

2.1step 1.1F6algebra

Define vi:=Θ−1(ui∗). Then λ(ujvi)=ui∗(uj)=δji. If ∑icivi=0, applying uj↦λ(uj ⋅) gives cj=0 for every j; hence (vi) is a basis. Writing a=∑idiui, the identities in [F6] give λ(avj)=dj, so a=∑iλ(avi)ui. Writing instead a=∑ieivi, the dual-pairing identity gives λ(uja)=ej, so a=∑iλ(uia)vi.

3.1step 1.1step 2.1F1algebra∎

The first dual-basis identity in step 2.1 implies that if Φ(a)=0, then λ(avi)=0 for all i and hence a=0; thus Φ is injective and is surjective because dim⁡H=dim⁡H∗. The second identity and the fact that Θ is an isomorphism show nondegeneracy in the other variable as well. Finally, λ((ab)c)=λ(a(bc)) by associativity of multiplication, so the form is associative. Definition [F1] now makes λ a Frobenius functional and H a Frobenius algebra.

Depends on

Used by

Cited to discharge well-definedness by Frobenius functionals and associative pairings.

Dependency tree · two levels

23 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