Jump to ContentJump to Main Navigation
Quantum Physics and LinguisticsA Compositional, Diagrammatic Discourse$
Users without a subscription are not able to see the full content.

Chris Heunen, Mehrnoosh Sadrzadeh, and Edward Grefenstette

Print publication date: 2013

Print ISBN-13: 9780199646296

Published to Oxford Scholarship Online: May 2013

DOI: 10.1093/acprof:oso/9780199646296.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 30 March 2020

Hopf Algebras—Variant Notions and Reconstruction Theorems

Hopf Algebras—Variant Notions and Reconstruction Theorems

(p.115) chapter-5 Hopf Algebras—Variant Notions and Reconstruction Theorems
Quantum Physics and Linguistics

Joost Vercruysse

Oxford University Press

Hopf algebras are closely related to monoidal categories. More precisely, k-Hopf algebras can be characterized as those algebras whose category of finite-dimensional representations is an autonomous monoidal category such that the forgetful functor to k-vectorspaces is a strict monoidal functor. This result is known as the Tannaka reconstruction theorem (for Hopf algebras). Because of the importance of both Hopf algebras in various fields, over the last few decades, many generalizations have been defined. We will survey these different generalizations from the point of view of the Tannaka reconstruction theorem.

Keywords:   Hopf algebras, autonomous monoidal categories, vector spaces, Tannaka reconstruction theorem

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .