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.

Right duals and the antipode twist on biduals

Statement

Let H be a Hopf algebra over a field k with antipode S, and assume for the right-dual construction that S is bijective. Let V be a finite-dimensional left H-module and let V∗=Hom⁡k(V,k) be its algebraic dual. In this page's convention, define the right-dual action on V∗ by

(h⋅f)(v):=f(S−1(h)⋅v),

with evaluation ev⁡~:V⊗V∗→k, v⊗f↦f(v), and coevaluation coev⁡~:k→V∗⊗V, 1↦∑iei⊗ei. These maps are H-linear and satisfy the two right-dual triangle identities. The bijectivity hypothesis is used only for this S−1 construction; the left-dual construction earlier on the page needs no such hypothesis.

Let jV:V→V∗∗ be the ordinary vector-space bidual map, jV(v)(f)=f(v), where V∗∗ has the twice-applied left-dual action. Then

h⋅jV(v)=jV(S2(h)⋅v).

For a fixed finite-dimensional module V, jV is H-linear exactly when h and S2(h) act identically on V for every h. Thus S2=idH is sufficient for jV to be H-linear on every finite-dimensional module. If H itself is finite-dimensional, the converse follows by taking its regular module. If an invertible group-like element p satisfies S2(h)=php−1, then jp,V(v):=jV(p⋅v) is a natural monoidal H-module isomorphism V→V∗∗ on finite-dimensional modules.

Facts & Assumptions

Given: A field k, a Hopf algebra H with antipode S, a bijective S, a finite-dimensional left H-module V, and, for the final assertion, an invertible group-like p∈H with S2(h)=php−1.

[F1]

Evaluation, coevaluation, and triangle identities for left duals: for the left-dual action h⋅f(v)=f(S(h)v), S is antimultiplicative, evaluation and coevaluation are H-linear, and the two left-dual triangle identities hold without assuming S bijective.

[F2]

The module category of a bialgebra and its tensor action: tensor products carry the diagonal action from Δ, and the unit module carries the action from ε.

[F3]

Finite tensor duality and basis-independent coevaluation: finite dual bases give canonical tensors corresponding to identity maps, and the vector-space evaluation and coevaluation maps satisfy the two triangle identities.

[F4]

Universal property of the tensor product for balanced maps into abelian groups: bilinear pairings define linear evaluation maps on algebraic tensor products.

[F5]

Linear functionals and the algebraic dual V∗=L(V,F): V∗=Hom⁡k(V,k) is the space of all k-linear functionals, with pointwise operations.

[A1]

The antipode equations are ∑S(h(1))h(2)=ε(h)1H=∑h(1)S(h(2)), and S is bijective.

[A2]

In the pivot branch, Δ(p)=p⊗p, ε(p)=1, p is invertible, and S2(h)=php−1 for every h.

Proof

technique · direct
1.1A1F1algebra

Since S is antimultiplicative by [F1] and bijective by [A1], S−1 is also antimultiplicative: applying S to S−1(g)S−1(h) gives hg, so injectivity gives S−1(hg)=S−1(g)S−1(h). Also S−1(1H)=1H.

1.2F1F3algebra

For h∈H, f∈V∗, h⋅jV(v)(f)=jV(v)(S(h)⋅f)=(S(h)⋅f)(v)=f(S2(h)v)=jV(S2(h)v)(f). Thus the bidual formula holds. For finite-dimensional V, jV is a vector-space isomorphism by [F3], so it is H-linear exactly when S2(h)v=hv for all h,v. In particular S2=idH suffices for all finite-dimensional modules. If H is finite-dimensional and this condition holds for every finite-dimensional module, apply it to the regular module H and v=1H to get S2(h)=h.

2.1A1F5step 1.1

For h,g∈H, v∈V, and f∈V∗, 1H⋅f=f and (h⋅(g⋅f))(v)=f(S−1(g)S−1(h)v)=f(S−1(hg)v)=((hg)⋅f)(v) by step 1.1. Linearity follows from linearity of S−1, the action on V, and the algebraic dual operations [F5]. Thus V∗ is a left H-module.

2.2A1step 1.1algebra

Applying S−1 to the two antipode equations in [A1], and using antimultiplicativity of S−1 from step 1.1, yields ∑S−1(h(2))h(1)=ε(h)1H and ∑h(2)S−1(h(1))=ε(h)1H.

2.3A2F2F3step 1.2

Under [A2], h⋅jp,V(v)=jV(S2(h)pv)=jV(php−1pv)=jV(phv)=jp,V(h⋅v), and jp,V is bijective because both jV and multiplication by p on V are bijective. If f:V→W is H-linear, then f(pv)=pf(v), so jp is natural. Finally p acts on V⊗W by p⊗p because it is group-like; therefore jp,V⊗W(v⊗w) corresponds to jp,V(v)⊗jp,W(w) under the canonical finite tensor-dual identification [F3]. Since ε(p)=1, the same compatibility holds on the unit object. Thus jp is monoidal.

3.1F2F4step 2.2

For v∈V and f∈V∗, ev⁡~(h⋅(v⊗f))=∑f(S−1(h(2))h(1)v)=ε(h)f(v)=h⋅ev⁡~(v⊗f) by the first identity in step 2.2. The bilinear evaluation descends to V⊗V∗ by [F4], so it is H-linear.

3.2A1F2F3step 2.2

Let Θ:V∗⊗V→End⁡k(V) send f⊗v to [x↦f(x)v]. By [F3], ∑iei⊗ei corresponds to idV. For x∈V, the image under Θ of h⋅∑iei⊗ei is ∑i(h(1)⋅ei)(x) h(2)ei=∑h(2)S−1(h(1))x=ε(h)x by step 2.2 and the dual-basis identity. Hence h⋅coev⁡~(1)=ε(h)coev⁡~(1)=coev⁡~(h⋅1); coevaluation is H-linear.

4.1F3step 3.1step 3.2

On v∈V, the first triangle composite gives ∑iei(v)ei=v; on f∈V∗, the second gives ∑if(ei)ei=f. These dual-basis expansions prove the two right-dual triangle identities.

5.1A1A2step 4.1step 1.2step 2.3∎

If V=0, all dual spaces and coevaluation tensors are zero and the identities above are the unique maps on zero spaces. If V is one-dimensional, the dual-basis sums have one term and the same computations apply. Choosing a basis of the given finite-dimensional space uses no arbitrary-index choice. The involutive-antipode implication is proved in step 1.2; its converse is stated only when H is finite-dimensional.

Depends on

Used by

Nothing in the library uses this result yet.

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