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.
Double crossing laws and associativity
Statement
For the candidate crossing and product on in Finite Drinfeld double: convention and candidate multiplication, is unital and satisfies both distributive laws for multiplication in and . Consequently the candidate product is associative and unital, with injective algebra embeddings and in normal order.
Facts & Assumptions
Given: A finite-dimensional Hopf algebra over a field with bijective antipode , and the candidate and of Finite Drinfeld double: convention and candidate multiplication. Prove the crossing laws and associativity.
Hopf algebras and antipodes: has a coassociative coproduct and counit, and its antipode satisfies .
Finite tensor duality and basis-independent coevaluation: for finite-dimensional spaces, the dual of a tensor product is identified with the tensor product of the duals, so evaluation separates elements of the finite dual tensor.
Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode: is anti-multiplicative and anti-comultiplicative, and .
Convolution of linear maps is associative and unital: the convolution product on is associative and unital, so its opposite product is also associative and unital.
The finite-dimensional Hopf algebra with bijective antipode is the explicit hypothesis of Finite Drinfeld double: convention and candidate multiplication.
Proof
Pairing the first tensor factor of with gives , because evaluates on the three consecutive factors of . This determines uniquely by finite tensor separation.
The unit identities are and : the first contracts the first and third dual factors by , and the second uses from [F3] and the two counit identities in [F1].
For , the two sides of , paired with , both equal . On the left use from [F3]; on the right, the successive crossings evaluate , which is the same dual coproduct evaluation.
For , pairing the first tensor factor of the left side of with gives the -valued expression ; the factor remains from . Since by [F3] and multiplicativity of , this is , which is also the result of the two successive crossings on the right.
Write , , and, for each such term, . Starting with , the left association first crosses past , then crosses the product past ; the distributive law of step 1.3 expands that second crossing as first crossing past , then past the resulting . It therefore gives . The right association first crosses past , then crosses past the product ; the distributive law of step 1.4 expands that crossing as first crossing past , then past , giving the same sum. Associativity of both factor products follows for from [F1] and for from [F4]. Thus the associations agree on simple tensors and, by multilinearity, everywhere. The unit identities of step 1.2 make a two-sided unit.
The maps and preserve products by step 1.2 and the defining multiplication. They are injective because applying or recovers the input; .
Remarks
The paired multiplication-law calculations use only finite tensor evaluations; they do not use a presentation of or an unproved PBW theorem. The antipode anti-multiplication and anti-comultiplication identities used above are supplied by Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode.
Depends on
- Finite Drinfeld double: convention and candidate multiplication
- Scalars, tensor powers, the empty tensor, opposite algebras and finite sums
- Finite tensor duality and basis-independent coevaluation
- Hopf algebras and antipodes
- Convolution of linear maps is associative and unital
- Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode
Used by
- Double coalgebra, multiplicativity, and antipode Lemma
- Modules over the finite double are left-left Yetter–Drinfeld modules Theorem
Cited to discharge well-definedness by Finite Drinfeld double: convention and candidate multiplication.
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
- Kalle Kytölä, Introduction to Hopf algebras and representations, lecture notes, §4.3 (standard reference, not scraped)
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych and Victor Ostrik, Tensor Categories, §7.14 (standard reference, not scraped)
- 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)