About: Braided monoidal category     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatQuantumGroups, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FBraided_monoidal_category

In mathematics, a commutativity constraint on a monoidal category is a choice of isomorphism for each pair of objects A and B which form a "natural family." In particular, to have a commutativity constraint, one must have for all pairs of objects . Alternatively, a braided monoidal category can be seen as a tricategory with one 0-cell and one 1-cell. Braided monoidal categories were introduced by André Joyal and Ross Street in a 1986 preprint. A modified version of this paper was published in 1993.

AttributesValues
rdf:type
rdfs:label
  • Braided monoidal category (en)
  • Catégorie monoïdale tressée (fr)
rdfs:comment
  • En mathématiques, une catégorie monoïdale tressée est une catégorie monoïdale particulière, à laquelle on ajoute un analogue de la notion de commutativité. (fr)
  • In mathematics, a commutativity constraint on a monoidal category is a choice of isomorphism for each pair of objects A and B which form a "natural family." In particular, to have a commutativity constraint, one must have for all pairs of objects . Alternatively, a braided monoidal category can be seen as a tricategory with one 0-cell and one 1-cell. Braided monoidal categories were introduced by André Joyal and Ross Street in a 1986 preprint. A modified version of this paper was published in 1993. (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Braid_category_hexagon.svg
  • http://commons.wikimedia.org/wiki/Special:FilePath/Braid_category_inverse_hexagon.svg
  • http://commons.wikimedia.org/wiki/Special:FilePath/Braid_category_triangle.svg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
Link from a Wikipa... related subject.
id
  • braided+monoidal+category (en)
title
  • Braided monoidal category (en)
has abstract
  • In mathematics, a commutativity constraint on a monoidal category is a choice of isomorphism for each pair of objects A and B which form a "natural family." In particular, to have a commutativity constraint, one must have for all pairs of objects . A braided monoidal category is a monoidal category equipped with a braiding—that is, a commutativity constraint that satisfies axioms including the hexagon identities defined below. The term braided references the fact that the braid group plays an important role in the theory of braided monoidal categories. Partly for this reason, braided monoidal categories and other topics are related in the theory of knot invariants. Alternatively, a braided monoidal category can be seen as a tricategory with one 0-cell and one 1-cell. Braided monoidal categories were introduced by André Joyal and Ross Street in a 1986 preprint. A modified version of this paper was published in 1993. (en)
  • En mathématiques, une catégorie monoïdale tressée est une catégorie monoïdale particulière, à laquelle on ajoute un analogue de la notion de commutativité. (fr)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software