arXiv subjects

J. R. B. Cockett

Publications and source records attributed to J. R. B. Cockett.

11 recordsLinked to original sources

arXiv2021

Differential equations in a tangent category I: Complete vector fields, flows, and exponentials

This paper describes how to define and work with differential equations in the abstract setting of tangent categories. The key notion is that of a curve object which is, for differential geometry, the structural analogue of a natural number object. A curve object is a preinitial object for dynamical systems; dynamical systems may, in turn, be viewed as determining systems of differential equations. The unique map from the curve object to a dynamical system is a solution of the system, and a dynamical system is said to be complete when for all initial conditions there is a solution. A subtle issue concerns the question of when a dynamical system is complete, and the paper provides abstract conditions for this. This abstract formulation also allows new perspectives on topics such as commutative vector fields and flows. In addition, the stronger notion of a differential curve object, which is the centrepiece of the last section of the paper, has exponential maps and forms a differential exponential rig. This rig then, somewhat surprisingly, has an action on every differential object and bundle in the setting. In this manner, in a very strong sense, such a curve object plays the role of the real numbers in standard differential geometry.

math.CT↗

arXiv2019

Differential Categories Revisited

Differential categories were introduced to provide a minimal categorical doctrine for differential linear logic. Here we revisit the formalism and, in particular, examine the two different approaches to defining differentiation which were introduced. The basic approach used a deriving transformation, while a more refined approach, in the presence of a bialgebra modality, used a codereliction. The latter approach is particularly relevant to linear logic settings, where the coalgebra modality is monoidal and the Seely isomorphisms give rise to a bialgebra modality. Here, we prove that these apparently distinct notions of differentiation, in the presence of a monoidal coalgebra modality, are completely equivalent. Thus, for linear logic settings, there is only one notion of differentiation. This paper also presents a number of separating examples for coalgebra modalities including examples which are and are not monoidal, as well as examples which do and do not support differential structure. Of particular interest is the observation that -- somewhat counter-intuitively -- differential algebras never induce a differential category although they provide a monoidal coalgebra modality. On the other hand, Rota-Baxter algebras -- which are usually associated with integration -- provide an example of a differential category which has a non-monoidal coalgebra modality.

math.CT↗

arXiv2019

The Category TOF

We provide a complete set of identities for the symmetric monoidal category, TOF, generated by the Toffoli gate and computational ancillary bits. We do so by demonstrating that the functor which evaluates circuits on total points, is an equivalence into the full subcategory of sets and partial isomorphisms with objects finite powers of the two element set. The structure of the proof builds -- and follows the proof of Cockett et al.-- which provided a full set of identities for the cnot gate with computational ancillary bits. Thus, first it is shown that TOF is a discrete inverse category in which all of the identities for the cnot gate hold; and then a normal form for the restriction idempotents is constructed which corresponds precisely to subobjects of the total points of TOF. This is then used to show that TOF is equivalent to FPinj2, the full subcategory of sets and partial isomorphisms in which objects have cardinality a power of 2.

cs.LO↗

arXiv2017

Integral Categories and Calculus Categories

Differential categories are now an established abstract setting for differentiation. However not much attention has been given to the process which is inverse to differentiation: integration. This paper presents the parallel development for integration by axiomatizing an integral transformation, $s_A: !A \to !A \otimes A$, in a symmetric monoidal category with a coalgebra modality. When integration is combined with differentiation, the two fundamental theorems of calculus are expected to hold (in a suitable sense): a differential category with integration which satisfies these two theorem is called a {\em calculus category\/}. Modifying an approach to antiderivatives by T. Ehrhard, we define having antiderivatives as the demand that a certain natural transformation, $K: !A \to !A$, is invertible. We observe that a differential category having antiderivatives, in this sense, is always a calculus category. When the coalgebra modality is monoidal, it is natural to demand an extra coherence between integration and the coalgebra modality. In the presence of this extra coherence we show that a calculus category with a monoidal coalgebra modality has its integral transformation given by antiderivatives and, thus, that the integral structure is uniquely determined by the differential structure. The paper finishes by providing a suite of separating examples. Examples of differential categories, integral categories, and calculus categories based on both monoidal and (mere) coalgebra modalities are presented. In addition, differential categories which are not integral categories are discussed and vice versa.

math.CT↗

arXiv2017

Connections in Tangent Categories

Connections are an important tool of differential geometry. This paper investigates their definition and structure in the abstract setting of tangent categories. At this level of abstraction we derive several classically important results about connections, including the Bianchi identities, identities for curvature and torsion, almost complex structure, and parallel transport.

math.CT↗

arXiv2017

Differential bundles and fibrations for tangent categories

Tangent categories are categories equipped with a tangent functor: an endofunctor with certain natural transformations which make it behave like the tangent bundle functor on the category of smooth manifolds. They provide an abstract setting for differential geometry by axiomatizing key aspects of the subject which allow the basic theory of these geometric settings to be captured. Importantly, they have models not only in classical differential geometry and its extensions, but also in algebraic geometry, combinatorics, computer science, and physics. This paper develops the theory of "differential bundles" for such categories, considers their relation to "differential objects", and develops the theory of fibrations of tangent categories. Differential bundles generalize the notion of smooth vector bundles in classical differential geometry. However, the definition departs from the standard one in several significant ways: in general, there is no scalar multiplication in the fibres of these bundles, and in general these bundles need not be locally trivial. To understand how these differential bundles relate to differential objects, which are the generalization of vector spaces in smooth manifolds, requires some careful handling of the behaviour of pullbacks with respect to the tangent functor. This is captured by "transverse" and "display" systems for tangent categories, which leads one into the fibrational theory of tangent categories. A key example of a tangent fibration is provided by the "display" differential bundles of a tangent category with a display system. Strikingly, in such examples the fibres are Cartesian differential categories demonstrating a -- not unexpected -- tight connection between the theory of these categories and that of tangent categories.

math.CT↗

arXiv2012

Differential restriction categories

We combine two recent ideas: cartesian differential categories, and restriction categories. The result is a new structure which axiomatizes the category of smooth maps defined on open subsets of $\R^n$ in a way that is completely algebraic. We also give other models for the resulting structure, discuss what it means for a partial map to be additive or linear, and show that differential restriction structure can be lifted through various completion operations.

math.CT↗

arXiv2007

The logic of message passing

Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we introduce the categorical notion of a linear actegory and the related polycategorical notion of a poly-actegory. Not surprisingly the notation used for the term calculus borrows heavily from the (synchronous) pi-calculus. The cut elimination procedure for the system provides an operational semantics.

math.CT↗

arXiv2006

Restriction categories III: colimits, partial limits, and extensivity

A restriction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of partial maps are restriction categories; conversely, a restriction category is a category of partial maps if and only if the restriction idempotents split. Restriction categories facilitate reasoning about partial maps as they have a purely algebraic formulation. In this paper we consider colimits and limits in restriction categories. As the notion of restriction category is not self-dual, we should not expect colimits and limits in restriction categories to behave in the same manner. The notion of colimit in the restriction context is quite straightforward, but limits are more delicate. The suitable notion of limit turns out to be a kind of lax limit, satisfying certain extra properties. Of particular interest is the behaviour of the coproduct both by itself and with respect to partial products. We explore various conditions under which the coproducts are ``extensive'' in the sense that the total category (of the related partial map category) becomes an extensive category. When partial limits are present, they become ordinary limits in the total category. Thus, when the coproducts are extensive we obtain as the total category a lextensive category. This provides, in particular, a description of the extensive completion of a distributive category.

math.CT↗

arXiv2004

A language for multiplicative-additive linear logic

A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive categories with additives. It is also shown that proof equivalence is decidable by showing that the cut elimination rewrites supply a confluent rewriting system modulo equations.

math.CT↗

arXiv2004

On the complexity of Cockett-Seely polarized games

In this paper the complexity of provability of polarized additive, multiplicative, and exponential formulas in the (initial) Cockett-Seely polarized game logic is discussed. The complexity is ultimately based on the complexity of finding a strategy in a formula which is, for polarized additive formulas, in the worst case linear in their size. Having a proof of a sequent is equivalent to having a strategy for the internal-hom object. In order to show that the internal-hom object can have size exponentially larger than the formulas of the original sequent we develop techniques for calculating the size of the multiplicative formulas. The structure of the internal hom object can be exploited and, using dynamic programming techniques, one can reduce the cost of finding a strategy in such a formula to the order of the product of the sizes of the original formulas. The use of dynamic techniques motivates the consideration of games as acyclic graphs and we show how to calculate the size of these graph games for the multiplicative and additive fragment and, thus, the cost of determining their provability using this dynamic programming approach. The final section of the paper points out that, despite the apparent complexity of the formulas, there is, for the initial polarized logic with all the connectives (additives, multiplicatives, and exponentials) a way of determining provability which is \emph{linear} in the size of the formulas.

math.CT↗