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

Modules over the finite double are left-left Yetter–Drinfeld modules

Statement

Let H be a finite-dimensional Hopf algebra over a field with bijective antipode, and let D(H) be the finite double above. Restriction to H and reconstruction of a coaction from the H∗op action give inverse equivalences between left D(H)-modules and left-left Yetter–Drinfeld H-modules. The equivalence preserves tensor products. The Yetter–Drinfeld category is braided by

cV,W(v⊗w)=∑v−1⋅w⊗v0,

with inverse

cV,W−1(w⊗v)=∑v0⊗S−1(v−1)⋅w.

Facts & Assumptions

Given: The finite-dimensional Hopf algebra H, bijective antipode S, candidate D(H), and left-left Yetter–Drinfeld structures of the preceding items. Prove the module equivalence, tensor compatibility and braiding.

[F1]

Finite tensor duality and basis-independent coevaluation: when H is finite-dimensional, evaluation identifies H∗⊗H with End⁡k(H), and its canonical tensor is basis-independent.

[F2]

The module category of a bialgebra and its tensor action: tensor products of left modules carry the diagonal action through the coproduct.

[F3]

Bialgebra module tensor actions and their coherence: the associator and unit constraints are module maps for the diagonal action.

[F4]

Braiding on the module category and triangular structures: a braiding is a natural family of invertible module maps satisfying the two stated hexagons.

[L1]

Finite Drinfeld double: convention and candidate multiplication: D(H)=H∗op⊗H in normal order and the embeddings of its two factors multiply by the stated crossing rule.

[L2]

Left-left Yetter–Drinfeld module: f⋅v=∑f(v−1)v0 is the specified left H∗op-action.

[L3]

Double crossing laws and associativity: χ obeys the two distributive laws, so the normal-order multiplication is associative.

[L4]

Double coalgebra, multiplicativity, and antipode: D(H) is a Hopf algebra and its inverse crossing is fh=∑f1(h1)f3(S(h3))h2f2.

[L5]

Left-left Yetter–Drinfeld module: the left-left compatibility equation is δ(h⋅v)=∑h1v−1S(h3)⊗h2⋅v0.

[F5]

Hopf algebras and antipodes: S satisfies both antipode contractions.

[F6]

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

[F7]

Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode: the antipode is anti-multiplicative, so its inverse is anti-multiplicative when it exists.

[A1]

H is finite-dimensional and S is bijective, as required by the inverse crossing and inverse braiding formulas. Also H≠0: its counit is a unital algebra map, so εH(1H)=1k; consequently the nonzero hypothesis of [F6] is satisfied.

Proof

1.1givenF1L1construct

Let (hi) be a basis of H and (fi) its dual basis. For a left D(H)-module M, restrict the action to H and set δ(v)=∑ihi⊗(fi⊗1H)⋅v. By [F1], ∑ihi⊗fi is the basis-independent tensor representing id⁡H; hence δ is basis-independent and (f⊗id⁡)δ(v)=(f⊗1H)⋅v for every f∈H∗.

1.2givenF1L1L2algebra

The coaction counit identity follows from (εH⊗id⁡)δ(v)=(εH⊗1H)⋅v=v, since εH⊗1H is the unit of D(H). To check coassociativity, pair the first two H factors with arbitrary f,g∈H∗. On (Δ⊗id⁡)δ(v) the result is (f∗g⊗1H)⋅v by the definition of convolution (f∗g)(x)=∑f(x1)g(x2). On (id⁡⊗δ)δ(v) it is (g⊗1H)⋅((f⊗1H)⋅v)=(f∗g⊗1H)⋅v by the H∗op module law in [L2]. Finite dual separation from [F1] gives coassociativity.

1.3givenL1L2construct

Conversely, let V be a left-left Yetter–Drinfeld module. Give it the H∗op action of [L2] and define (f⊗h)⋅v:=f⋅(h⋅v). The H and H∗op factors act by their algebra structures; it remains to check their crossing relation.

1.4A1F5L1L2L5algebra

For h∈H, f∈H∗ and v∈V, the left side of the forward crossing acts as h⋅(f⋅v)=∑f(v−1)h⋅v0. The right side acts as ∑f1(S(h1))f3(h3)f2⋅(h2⋅v)=∑f(S(h1)h2v−1S(h4)h5)h3⋅v0 by [L5]. The tensor antipode cancellation ∑S(h1)h2⊗h3⊗S(h4)h5=1⊗h⊗1 follows by applying the two equations [F5] successively and reduces this to ∑f(v−1)h⋅v0. Therefore the action respects the crossing.

1.5F1F2F3L1L2L3algebra

By the diagonal-action definition [F2], the H action on V⊗W is the tensor action, and the H∗op action is f⋅(v⊗w)=∑f1⋅v⊗f2⋅w. Pairing with every f shows that its reconstructed coaction is δ(v⊗w)=∑v−1w−1⊗v0⊗w0. The associator and unit maps are module maps by [F3] and are the same underlying vector-space maps under the two functors, so the equivalence is monoidal.

1.6A1F5F6F7L2algebra

Define cV,W by the displayed formula and use the displayed candidate inverse. Applying S−1 to the two antipode equations in [F5] and reversing products by [F7] gives ∑S−1(x2)x1=ε(x)1H=∑x2S−1(x1). On w⊗v, the composite cV,WcV,W−1 is ∑v−1,2S−1(v−1,1)⋅w⊗v0=w⊗v by the second identity; the other composite is ∑v0⊗S−1(v−1,2)v−1,1⋅w=v⊗w by the first. Thus the maps are inverse.

2.1F1L4L5step 1.1algebra

The inverse crossing of [L4], acting on v, gives (f⊗1H)⋅((1⊗h)⋅v)=∑f1(h1)f3(S(h3))h2⋅(f2⋅v)=∑f(h1v−1S(h3))h2⋅v0. By the reconstruction identity in step 1.1, this is (f⊗id⁡)δ(h⋅v); since it holds for every f, finite dual separation yields δ(h⋅v)=∑h1v−1S(h3)⊗h2⋅v0, which is the compatibility condition [L5]. Thus restriction and reconstruction produce a Yetter–Drinfeld module.

2.2step 1.1construct

A D(H)-module map preserves the restricted H-action and commutes with every f⊗1H action. The reconstruction identity of step 1.1 then shows it preserves the coaction, so restriction defines a functor to Yetter–Drinfeld modules.

2.3L1L2L3step 1.4algebra

For f,g∈H∗ and h,k∈H, first apply the crossing identity of step 1.4 to h⋅(g⋅(k⋅v)), obtaining ∑g1(S(h1))g3(h3) g2⋅(h2⋅(k⋅v)). Applying f on the left and using the H∗op action law gives ∑g1(S(h1))g3(h3)(g2∗f)⋅((h2k)⋅v), exactly the action of (fh)(gk) in [L1]. Bilinearity extends this identity to all elements of D(H). Thus every Yetter–Drinfeld module determines a left D(H)-module, and maps preserving both structures are exactly the resulting module maps.

2.4F1L1step 1.1step 1.3algebra

Starting with a D(H)-module, reconstructing its coaction and then the action of step 1.3 returns the original action, because f⊗h=(f⊗1H)(εH⊗h) in normal order. Starting with a Yetter–Drinfeld module, the reconstructed coaction has the same evaluation against every f as the original coaction, so finite dual separation makes the coactions equal. The two functors are inverse.

2.5F5L5step 1.5algebra

The map cV,W is H-linear: applying the Yetter–Drinfeld equation [L5] to h1⋅v gives c(h⋅(v⊗w))=∑(h1v−1S(h3)h4)⋅w⊗h2⋅v0=∑(h1v−1)⋅w⊗h2⋅v0=h⋅c(v⊗w), where S(h3)h4 contracts by [F5].

3.1F5L5step 1.5step 2.5algebra

The map is H-colinear as well. The coaction of its output is ∑v−1,1w−1S(v−1,3)v−1,4⊗v−1,2⋅w0⊗v0,0. The adjacent factors S(v−1,3)v−1,4 contract to the unit by [F5], leaving ∑v−1,1w−1⊗v−1,2⋅w0⊗v0,0, which is (id⁡⊗c)δ(v⊗w) by coassociativity and the tensor-product coaction. Pairing this identity with every f∈H∗ proves H∗op-linearity; together with step 2.5, c is a D(H)-module map.

4.1F4L2step 1.5step 1.6algebra∎

Naturality follows because Yetter–Drinfeld morphisms preserve both the action and coaction. The two hexagons required by [F4] follow by expanding the tensor-product coaction: cV,W⊗U(v⊗w⊗u)=∑v−1,1⋅w⊗v−1,2⋅u⊗v0, and cV⊗W,U(v⊗w⊗u)=∑(v−1w−1)⋅u⊗v0⊗w0; these are exactly the two iterated composites of the displayed c. Hence the family is a braiding.

Remarks

The inverse-braiding formula uses S−1, and [F6] establishes bijectivity for nonzero finite-dimensional H; [A1] verifies nonzeroness here. The proof uses the left-left convention fixed in the definition and does not transfer formulas from an H∗cop convention.

Depends on

Used by

Dependency tree · two levels

36 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