The geometry of tensor calculus. I (Q1175729)

From MaRDI portal





scientific article; zbMATH DE number 14410
Language Label Description Also known as
default for all languages
No label defined
    English
    The geometry of tensor calculus. I
    scientific article; zbMATH DE number 14410

      Statements

      The geometry of tensor calculus. I (English)
      0 references
      25 June 1992
      0 references
      The goal of this paper is to formalize the use of certain diagrams for a wide variety of situations in pure and applied mathematics. The main examples are the Feynman diagrams. Other examples are given by circuit diagrams, networks, Petri nets, flow charts, and planar diagrams of knots or links. R. Penrose was the first to use the graphical notation for calculations with tensors. It is now currently used by theoretical physicists. The paper consists of four chapters. In the first one, the authors recall the basic algebraic structure, namely that of a tensor category (also called ``monoidal category'') which is simply a category with an associative (up to coherent isomorphism) tensor product operation. The authors introduce the concept of a graph appropriate for both this paper and the next one. They define the concept of a valuation which labels the nodes of a graph with arrows from a tensor category \(\mathcal V\) and labels the edges with objects of \(\mathcal V\). A planar graph \(\Gamma\) equipped with a valuation \(v\) is called a plane diagram in \(\mathcal V\). Then the authors define an arrow \(v(\Gamma)\) in \(\mathcal V\), called the value of the diagram. The main result of this chapter is that the value is invariant under continuous deformation of plane diagrams. In Section 4, the authors check that free tensor categories can be described in terms of isotopy classes of plane diagrams. In the second chapter the authors consider the case of symmetric tensor categories for which the tensor product is equipped with an extra structure of symmetry. In this situation they show that the value \(v(\Gamma)\) of a diagram can be defined even when \(\Gamma\) is abstract (no planarity is needed). In the second section of this chapter the authors construct free symmetric tensor categories using isomorphism classes of abstract diagrams. In Chapter 3 the authors consider the case of braided tensor categories [the authors, Braided monoidal categories, Macquarie Math. Reports (November, 1986)]. In this situation the diagram \(\Gamma\) is embedded in 3-space. They prove that the value of a diagram is invariant under deformation. Then they describe free braided tensor categories using isotopy classes of embedded diagrams in 3-space. In Chapter 4 the authors introduce the concept of balanced tensor category. In this case the embedded graphs \(\Gamma\) are framed, or made of ribbons. Again they prove the invariance of the value of a ribbon diagram under continuous deformation and construct the free balanced tensor category from isotopy classes of ribbon diagrams. The authors announce that their second paper will deal with tensor categories in which the objects are duals.
      0 references
      Feynman diagrams
      0 references
      circuit diagrams
      0 references
      networks
      0 references
      Petri nets
      0 references
      flow charts
      0 references
      planar diagrams of knots or links
      0 references
      tensor category
      0 references
      monoidal category
      0 references
      valuation
      0 references
      plane diagram
      0 references
      free tensor categories
      0 references
      symmetric tensor categories
      0 references
      abstract diagrams
      0 references
      braided tensor categories
      0 references
      isotopy classes
      0 references
      embedded diagrams
      0 references
      balanced tensor category
      0 references
      ribbons
      0 references
      continuous deformation
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers