Props in Network Theory

zbMATH Open1400.18004arXiv1707.08321MaRDI QIDQ4585017FDOQ4585017

Franciscus Rebro, John Baez, Brandon Coya

Publication date: 5 September 2018

Abstract: Long before the invention of Feynman diagrams, engineers were using similar diagrams to reason about electrical circuits and more general networks containing mechanical, hydraulic, thermodynamic and chemical components. We can formalize this reasoning using props: that is, strict symmetric monoidal categories where the objects are natural numbers, with the tensor product of objects given by addition. In this approach, each kind of network corresponds to a prop, and each network of this kind is a morphism in that prop. A network with $m$ inputs and $n$ outputs is a morphism from $m$ to $n$, putting networks together in series is composition, and setting them side by side is tensoring. Here we work out the details of this approach for various kinds of electrical circuits, starting with circuits made solely of ideal perfectly conductive wires, then circuits with passive linear components, and then circuits that also have voltage and current sources. Each kind of circuit corresponds to a mathematically natural prop. We describe the "behavior" of these circuits using morphisms between props. In particular, we give a new proof of the black-boxing theorem proved by Fong and the first author; unlike the original proof, this new one easily generalizes to circuits with nonlinear components. We also use a morphism of props to clarify the relation between circuit diagrams and the signal-flow diagrams in control theory. Technically, the key tools are the Rosebrugh-Sabadini-Walters result relating circuits to special commutative Frobenius monoids, the monadic adjunction between props and signatures, and a result saying which symmetric monoidal categories are equivalent to props.

Full work available at URL: https://arxiv.org/abs/1707.08321

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A Compositional Framework for Passive Linear Networks
• Diagrammatic Semantics for Digital Circuits.
• Bicategories of processes
• scientific article; zbMATH DE number 1522999
• scientific article; zbMATH DE number 3871197
• The calculus of signal flow diagrams. I: Linear relations on streams.
• scientific article; zbMATH DE number 1787164
• A recipe for black box functors
• scientific article; zbMATH DE number 2125662
• scientific article; zbMATH DE number 1522866

zbMATH Keywords

networkcircuitsymmetric monoidal categoryPROPfunctorial semantics

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Applications of graph theory to circuits and networks (94C15) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Cites Work

• The geometry of tensor calculus. I
• Compact closed bicategories
• Categorical quantum mechanics
• Dagger compact closed categories and completely positive maps (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A general coherence result
• Cartesian bicategories. I
• Two-dimensional monad theory
• Resolution of coloured operads and rectification of homotopy algebras
• Categorical algebra
• Interacting Hopf algebras
• Title not available (Why is that?)
• A Categorical Semantics of Signal Flow Graphs
• Symplectic geometry
• A categorical approach to open and interconnected dynamical systems
• The Behavioral Approach to Open and Interconnected Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Space-Time Approach to Quantum Electrodynamics
• Symplectic categories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lawvere theories enriched over a general base
• The cartesian closed bicategory of generalised species of structures
• Decorated Cospans
• A Compositional Framework for Passive Linear Networks
• Categories in Control
• Title not available (Why is that?)
• A bicategory of decorated cospans
• Title not available (Why is that?)
• Colored operads
• An introduction to partition logic
• A compositional framework for Markov processes
• Corelations are the prop for extraspecial commutative Frobenius monoids
• Decorated Corelations

Cited In (26)

• Title not available (Why is that?)
• An axiomatic approach to differentiation of polynomial circuits
• Categorifying equivariant monoids
• A recipe for black box functors
• Editorial -- Recent trends in international reserves: theory and evidence
• Universal Properties in Quantum Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Categories of Differentiable Polynomial Circuits for Machine Learning
• Graphical piecewise-linear algebra
• DisCoPy: Monoidal Categories in Python
• Structured Cospans
• Bidirectional processes -- in category theory, physics, engineering, \dots
• Towards a compositional framework for convex analysis (with applications to probability theory)
• Title not available (Why is that?)
• An algebraic axiomatisation of ZX-calculus
• Categorifying the ZX-calculus
• A Compositional Framework for Passive Linear Networks
• Open systems in classical mechanics
• Title not available (Why is that?)
• A Finite Axiomatisation of Finite-State Automata Using String Diagrams
• A compositional framework for Petri nets
• Spans of cospans in a topos
• A bicategory of decorated cospans
• A compositional approach to parity games
• A practical type theory for symmetric monoidal categories

Uses Software

• DYNAMO

This page was built for publication: Props in Network Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4585017)