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 be a finite-dimensional Hopf algebra over a field with bijective antipode, and let be the finite double above. Restriction to and reconstruction of a coaction from the action give inverse equivalences between left -modules and left-left Yetter–Drinfeld -modules. The equivalence preserves tensor products. The Yetter–Drinfeld category is braided by
with inverse
Facts & Assumptions
Given: The finite-dimensional Hopf algebra , bijective antipode , candidate , and left-left Yetter–Drinfeld structures of the preceding items. Prove the module equivalence, tensor compatibility and braiding.
Finite tensor duality and basis-independent coevaluation: when is finite-dimensional, evaluation identifies with , and its canonical tensor is basis-independent.
The module category of a bialgebra and its tensor action: tensor products of left modules carry the diagonal action through the coproduct.
Bialgebra module tensor actions and their coherence: the associator and unit constraints are module maps for the diagonal action.
Braiding on the module category and triangular structures: a braiding is a natural family of invertible module maps satisfying the two stated hexagons.
Finite Drinfeld double: convention and candidate multiplication: in normal order and the embeddings of its two factors multiply by the stated crossing rule.
Left-left Yetter–Drinfeld module: is the specified left -action.
Double crossing laws and associativity: obeys the two distributive laws, so the normal-order multiplication is associative.
Double coalgebra, multiplicativity, and antipode: is a Hopf algebra and its inverse crossing is .
Left-left Yetter–Drinfeld module: the left-left compatibility equation is .
Hopf algebras and antipodes: satisfies both antipode contractions.
Finite Hopf algebras have one-dimensional integral spaces and bijective antipode: the antipode of a nonzero finite-dimensional Hopf algebra is bijective.
Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode: the antipode is anti-multiplicative, so its inverse is anti-multiplicative when it exists.
is finite-dimensional and is bijective, as required by the inverse crossing and inverse braiding formulas. Also : its counit is a unital algebra map, so ; consequently the nonzero hypothesis of [F6] is satisfied.
Proof
Let be a basis of and its dual basis. For a left -module , restrict the action to and set . By [F1], is the basis-independent tensor representing ; hence is basis-independent and for every .
The coaction counit identity follows from , since is the unit of . To check coassociativity, pair the first two factors with arbitrary . On the result is by the definition of convolution . On it is by the module law in [L2]. Finite dual separation from [F1] gives coassociativity.
Conversely, let be a left-left Yetter–Drinfeld module. Give it the action of [L2] and define . The and factors act by their algebra structures; it remains to check their crossing relation.
For , and , the left side of the forward crossing acts as . The right side acts as by [L5]. The tensor antipode cancellation follows by applying the two equations [F5] successively and reduces this to . Therefore the action respects the crossing.
By the diagonal-action definition [F2], the action on is the tensor action, and the action is . Pairing with every shows that its reconstructed coaction is . 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.
Define by the displayed formula and use the displayed candidate inverse. Applying to the two antipode equations in [F5] and reversing products by [F7] gives . On , the composite is by the second identity; the other composite is by the first. Thus the maps are inverse.
The inverse crossing of [L4], acting on , gives . By the reconstruction identity in step 1.1, this is ; since it holds for every , finite dual separation yields , which is the compatibility condition [L5]. Thus restriction and reconstruction produce a Yetter–Drinfeld module.
A -module map preserves the restricted -action and commutes with every action. The reconstruction identity of step 1.1 then shows it preserves the coaction, so restriction defines a functor to Yetter–Drinfeld modules.
For and , first apply the crossing identity of step 1.4 to , obtaining . Applying on the left and using the action law gives , exactly the action of in [L1]. Bilinearity extends this identity to all elements of . Thus every Yetter–Drinfeld module determines a left -module, and maps preserving both structures are exactly the resulting module maps.
Starting with a -module, reconstructing its coaction and then the action of step 1.3 returns the original action, because in normal order. Starting with a Yetter–Drinfeld module, the reconstructed coaction has the same evaluation against every as the original coaction, so finite dual separation makes the coactions equal. The two functors are inverse.
The map is -linear: applying the Yetter–Drinfeld equation [L5] to gives , where contracts by [F5].
The map is -colinear as well. The coaction of its output is . The adjacent factors contract to the unit by [F5], leaving , which is by coassociativity and the tensor-product coaction. Pairing this identity with every proves -linearity; together with step 2.5, is a -module map.
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: , and ; these are exactly the two iterated composites of the displayed . Hence the family is a braiding.
Remarks
The inverse-braiding formula uses , and [F6] establishes bijectivity for nonzero finite-dimensional ; [A1] verifies nonzeroness here. The proof uses the left-left convention fixed in the definition and does not transfer formulas from an convention.
Depends on
- Finite Drinfeld double: convention and candidate multiplication
- Left-left Yetter–Drinfeld module
- Double crossing laws and associativity
- Double coalgebra, multiplicativity, and antipode
- Finite tensor duality and basis-independent coevaluation
- The module category of a bialgebra and its tensor action
- Bialgebra module tensor actions and their coherence
- Hopf algebras and antipodes
- Finite Hopf algebras have one-dimensional integral spaces and bijective antipode
- Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode
- Braiding on the module category and triangular structures
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
- G. A. García and C. Vay, Simple modules of small quantum groups at dihedral groups, Doc. Math. 29 (2024), §3.1.3 (standard reference, not scraped)
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych and Victor Ostrik, Tensor Categories, §§7.14–7.15 (standard reference, not scraped)
- Kalle Kytölä, Introduction to Hopf algebras and representations, lecture notes, §4.3 (standard reference, not scraped)