Compositionality

An often used model for quantum theory is to associate to every physical system a C*-algebra. From a physical point of view it is unclear why operator algebras would form a good description of nature. In this paper, we find a set of physically meaningful assumptions such that any physical theory satisfying these assumptions must embed into the category of finite-dimensional C*-algebras. These assumptions were originally introduced in the setting of effectus theory, a categorical logical framework generalizing classical and quantum logic. As these assumptions have a physical interpretation, this motivates the usage of operator algebras as a model for quantum theory. In contrast to other reconstructions of quantum theory, we do not start with the framework of generalized probabilistic theories and instead use effect theories where no convex structure and no tensor product needs to be present. The lack of this structure in effectus theory has led to a different notion of pure maps. A map in an effectus is pure when it is a composition of a compression and a filter. These maps satisfy particular universal properties and respectively correspond to `forgetting' and `measuring' the validity of an effect. We define a pure effect theory (PET) to be an effect theory where the pure maps form a dagger-category and filters and compressions are adjoint. We show that any convex finite-dimensional PET must embed into the category of Euclidean Jordan algebras. Moreover, if the PET also has monoidal structure, then we show that it must embed into either the category of real or complex C*-algebras, which completes our reconstruction.

John van de Wetering

An effect-theoretic reconstruction of quantum theory

量子理论的效应论重构

Given a representation of a unital $C^*$-algebra $\mathcal{A}$ on a Hilbert space $\mathcal{H}$, together with a bounded linear map $V:\mathcal{K}\to\mathcal{H}$ from some other Hilbert space, one obtains a completely positive map on $\mathcal{A}$ via restriction using the adjoint action associated to $V$. We show this restriction forms a natural transformation from a functor of $C^*$-algebra representations to a functor of completely positive maps. We exhibit Stinespring's construction as a left adjoint of this restriction. Our Stinespring adjunction provides a universal property associated to minimal Stinespring dilations and morphisms of Stinespring dilations. We use these results to prove the purification postulate for all finite-dimensional $C^*$-algebras.

Arthur J. Parzygnat

Stinespring's construction as an adjunction

Stinespring构造作为伴随关系

This note presents a presheaf theoretic approach to the construction of fuzzy sets, which builds on Barr's description of fuzzy sets as sheaves of monomorphisms on a locale. A presheaf-theoretic method is used to show that the category of fuzzy sets is complete and co-complete, and to present explicit descriptions of classical fuzzy sets that arise as limits and colimits. The Boolean localization construction for sheaves and presheaves on a locale L specializes to a theory of stalks if L approximates the structure of a closed interval in the real line. The system V(X) of Vietoris-Rips complexes for a data cloud X becomes both a simplicial fuzzy set and a simplicial sheaf in this general framework. This example is explicitly discussed in this paper, in stages.

John F. Jardine

Fuzzy sets and presheaves

模糊集与预层

Petri networks and network models are two frameworks for the compositional design of systems of interacting entities. Here we show how to combine them using the concept of a "catalyst": an entity that is neither destroyed nor created by any process it engages in. In a Petri net, a place is a catalyst if its in-degree equals its out-degree for every transition. We show how a Petri net with a chosen set of catalysts gives a network model. This network model maps any list of catalysts from the chosen set to the category whose morphisms are all the processes enabled by this list of catalysts. Applying the Grothendieck construction, we obtain a category fibered over the category whose objects are lists of catalysts. This category has as morphisms all processes enabled by some list of catalysts. While this category has a symmetric monoidal structure that describes doing processes in parallel, its fibers also have premonoidal structures that describe doing one process and then another while reusing the catalysts.

John C. Baez

John Foley

Joe Moeller

Network Models from Petri Nets with Catalysts

带有催化剂的Petri网的网络模型

Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches, involving profunctors, monoidal profunctors, an extension of the free finite-product category 2-monad from Cat to Prof, and factorisation systems respectively. We exhibit comparison functors between CAT and each of these new frameworks to show that the distributive laws between the Lawvere theories correspond in a suitable way to distributive laws between their associated finitary monads. The different but equivalent formulations then provide, between them, a framework conducive to generalisation, but also an explicit description of the composite theories arising from distributive laws.

Eugenia Cheng

Distributive laws for Lawvere theories

Lawvere理论的分配律

In this paper we develop a novel mathematical formalism for the modeling of neural information networks endowed with additional structure in the form of assignments of resources, either computational or metabolic or informational. The starting point for this construction is the notion of summing functors and of Segal's Gamma-spaces in homotopy theory. The main results in this paper include functorial assignments of concurrent/distributed computing architectures and associated binary codes to networks and their subsystems, a categorical form of the Hopfield network dynamics, which recovers the usual Hopfield equations when applied to a suitable category of weighted codes, a functorial assignment to networks of corresponding information structures and information cohomology, and a cohomological version of integrated information.

Yuri Manin

Matilde Marcolli

Homotopy Theoretic and Categorical Models of Neural Information Networks

同伦论与范畴论的神经信息网络模型

Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as instances universal Turing machines, universal spin models, NP completeness, top of a preorder, denseness of a subset, and more. By identifying necessary conditions for universality, we show that universal spin models cannot be finite. We also characterize when universality can be distinguished from a trivial one and use it to show that universal Turing machines are non-trivial in this sense. Our framework allows not only to compare universalities within each instance, but also instances themselves. We leverage a Fixed Point Theorem inspired by a result of Lawvere to establish that universality and negation give rise to unreachability (such as uncomputability). As such, this work sets the basis for a unified approach to universality and invites the study of further examples within the framework.

Tomáš Gonda

Tobias Reinhart

Sebastian Stengele

Gemma De les Coves

A Framework for Universality in Physics, Computer Science, and Beyond

物理学、计算机科学与更广泛领域的普遍性框架

Regulatory networks depict promoting or inhibiting interactions between molecules in a biochemical system. We introduce a category-theoretic formalism for regulatory networks, using signed graphs to model the networks and signed functors to describe occurrences of one network in another, especially occurrences of network motifs. With this foundation, we establish functorial mappings between regulatory networks and other mathematical models in biochemistry. We construct a functor from reaction networks, modeled as Petri nets with signed links, to regulatory networks, enabling us to precisely define when a reaction network could be a physical mechanism underlying a regulatory network. Turning to quantitative models, we associate a regulatory network with a Lotka-Volterra system of differential equations, defining a functor from the category of signed graphs to a category of parameterized dynamical systems. We extend this result from closed to open systems, demonstrating that Lotka-Volterra dynamics respects not only inclusions and collapsings of regulatory networks, but also the process of building up complex regulatory networks by gluing together simpler pieces. Formally, we use the theory of structured cospans to produce a lax double functor from the double category of open signed graphs to that of open parameterized dynamical systems. Throughout the paper, we ground the categorical formalism in examples inspired by systems biology.

Rebekah Aduddell

James Fairbanks

Amit Kumar

Pablo S. Ocal

Evan Patterson

Brandon T. Shapiro

A compositional account of motifs, mechanisms, and dynamics in biochemical regulatory networks

生物化学调控网络中基序、机制和动力学的组合性解释

Optics are bidirectional data accessors that capture data transformation patterns such as accessing subfields or iterating over containers. Profunctor optics are a particular choice of representation supporting modularity, meaning that we can construct accessors for complex structures by combining simpler ones. Profunctor optics have previously been studied only in an unenriched and non-mixed setting, in which both directions of access are modelled in the same category. However, functional programming languages are arguably better described by enriched categories; and we have found that some structures in the literature are actually mixed optics, with access directions modelled in different categories. Our work generalizes a classic result by Pastro and Street on Tambara theory and uses it to describe mixed V-enriched profunctor optics and to endow them with V-category structure. We provide some original families of optics and derivations, including an elementary one for traversals. Finally, we discuss a Haskell implementation.

Bryce Clarke

Derek Elkins

Jeremy Gibbons

Fosco Loregian

Bartosz Milewski

Emily Pillmore

Mario Román

Profunctor Optics, a Categorical Update

Profunctor 透镜：一个范畴论的更新

A traced monad is a monad on a traced symmetric monoidal category that lifts the traced symmetric monoidal structure to its Eilenberg-Moore category. A long-standing question has been to provide a characterization of traced monads without explicitly mentioning the Eilenberg-Moore category. On the other hand, a symmetric Hopf monad is a symmetric bimonad whose fusion operators are invertible. For compact closed categories, symmetric Hopf monads are precisely the kind of monads that lift the compact closed structure to their Eilenberg-Moore categories. Since compact closed categories and traced symmetric monoidal categories are closely related, it is a natural question to ask what is the relationship between Hopf monads and traced monads. In this paper, we introduce trace-coherent Hopf monads on traced monoidal categories, which can be characterized without mentioning the Eilenberg-Moore category. The main theorem of this paper is that a symmetric Hopf monad is a traced monad if and only if it is a trace-coherent Hopf monad. We provide many examples of trace-coherent Hopf monads, such as those induced by cocommutative Hopf algebras or any symmetric Hopf monad on a compact closed category. We also explain how for traced Cartesian monoidal categories, trace-coherent Hopf monads can be expressed using the Conway operator, while for traced coCartesian monoidal categories, any trace-coherent Hopf monad is an idempotent monad. We also provide separating examples of traced monads that are not Hopf monads, as well as symmetric Hopf monads that are not trace-coherent.

Masahito Hasegawa

Jean-Simon Pacaud Lemay

Traced Monads and Hopf Monads

迹幺半群与Hopf幺半群

Publication Information	Publisher: Editorial Board of Compositionality，Publishing cycle: ，Journal Type: journal，Open Access Journals: No
Basic data	Year of publication: 2019，Proportion of original research papers: ，Self Citation Rate:， Gold OA Rate:

Compositionality

Journal Citation Format

A journal article with 1 author

A journal article with 2 authors

A journal article with 3 authors

A journal article with 5 or more authors

Books Citation Format

Thesis Citation Format

Web sites Citation Format

Patent Citation Format

Staying up late manually editing references? ivySCI automatically matches journals and helps you generate references with a single click.

Share Submission Experience