Decorated Corelations

MaRDI QIDQ4577990zbMATH OpenFDO

Authors Brendan Fong

Publication date 7 August 2018

Full work available at URL https://arxiv.org/abs/1703.09888, http://www.tac.mta.ca/tac/volumes/33/22/33-22abs.html

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

zbMATH Keywords

corelationdecorated cospanFrobenius monoidhypergraph categorywell-supported compact closed category

Mathematics Subject Classification ID

Theories (e.g., algebraic theories), structure, and semantics (18C10) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: Let $mathcalC$ be a category with finite colimits, and let $(mathcalE,mathcalM)$ be a factorisation system on $mathcalC$ with $mathcalM$ stable under pushouts. Writing $mathcalC;mathcal{M}^{mathrmop}$ for the symmetric monoidal category with morphisms cospans of the form $stackrelcostackrelmleftarrow$, where $cinmathcalC$ and $minmathcalM$, we give method for constructing a category from a symmetric lax monoidal functor $Fcolon(mathcalC;mathcal{M}^{mathrmop},+)o(mathrmSet,imes)$. A morphism in this category, termed a emph{decorated corelation}, comprises (i) a cospan $XoNleftarrowY$ in $mathcalC$ such that the canonical copairing $X+YoN$ lies in $mathcalE$, together with (ii) an element of $FN$. Functors between decorated corelation categories can be constructed from natural transformations between the decorating functors $F$. This provides a general method for constructing hypergraph categories---symmetric monoidal categories in which each object is a special commutative Frobenius monoid in a coherent way---and their functors. Such categories are useful for modelling network languages, for example circuit diagrams, and such functors their semantics.

Recommendations

• scientific article; zbMATH DE number 2039308
• Decorated hypertrees
• On Ramond decorations
• Structured versus decorated cospans
• Decorating proofs
• Decorated cospans
• A bicategory of decorated cospans
• A Categorical Treatment of Ornaments

Cites work

• A categorical approach to open and interconnected dynamical systems
• A categorical semantics of signal flow graphs
• A Compositional Framework for Passive Linear Networks
• An embedding theorem for adhesive categories
• Calculating Colimits Compositionally
• Categories in control
• Categories of relations and functional relations
• Corelations are the prop for extraspecial commutative Frobenius monoids
• Decorated cospans
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 2125662 (Why is no real title available?)
• Interacting Hopf algebras
• Matrices, relations, and group representations
• On colimits in categories of relations
• The geometry of tensor calculus. I
• Toposes Are Adhesive

Cited in

(13)

• Hypergraph categories
• Corelations are the prop for extraspecial commutative Frobenius monoids
• A recipe for black box functors
• Decorated cospans
• A Compositional Framework for Passive Linear Networks
• Custom hypergraph categories via generalized relations
• Props in Network Theory
• Universal constructions for (co)relations: categories, monoidal categories, and props
• String diagrams for regular logic (extended abstract)
• Structured versus decorated cospans
• Structured cospans
• A Categorical Treatment of Ornaments
• A bicategory of decorated cospans

This page was built for publication: Decorated Corelations

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