arXiv subjects

Robin Cockett

Publications and source records attributed to Robin Cockett.

27 records · Page 2Linked to original sources

arXiv2020

Generalising the étale groupoid--complete pseudogroup correspondence

We prove a generalisation of the correspondence, due to Resende and Lawson--Lenz, between étale groupoids---which are topological groupoids whose source map is a local homeomorphisms---and complete pseudogroups---which are inverse monoids equipped with a particularly nice representation on a topological space. Our generalisation improves on the existing functorial correspondence in four ways. Firstly, we enlarge the classes of maps appearing to each side. Secondly, we generalise on one side from inverse monoids to inverse categories, and on the other side, from étale groupoids to what we call partite étale groupoids. Thirdly, we generalise from étale groupoids to source-étale categories, and on the other side, from inverse monoids to restriction monoids. Fourthly, and most far-reachingly, we generalise from topological étale groupoids to étale groupoids internal to any join restriction category C with local glueings; and on the other side, from complete pseudogroups to ``complete C-pseudogroups'', i.e., inverse monoids with a nice representation on an object of C. Taken together, our results yield an equivalence, for a join restriction category C with local glueings, between join restriction categories with a well-behaved functor to C, and partite source-étale internal categories in C. In fact, we obtain this by cutting down a larger adjunction between arbitrary restriction categories over C, and partite internal categories in C. Beyond proving this main result, numerous applications are given, which reconstruct and extend existing correspondences in the literature, and provide general formulations of completion processes.

math.CT↗

arXiv2019

Reverse derivative categories

The reverse derivative is a fundamental operation in machine learning and automatic differentiation. This paper gives a direct axiomatization of a category with a reverse derivative operation, in a similar style to that given by Cartesian differential categories for a forward derivative. Intriguingly, a category with a reverse derivative also has a forward derivative, but the converse is not true. In fact, we show explicitly what a forward derivative is missing: a reverse derivative is equivalent to a forward derivative with a dagger structure on its subcategory of linear maps. Furthermore, we show that these linear maps form an additively enriched category with dagger biproducts.

cs.LO↗

arXiv2019

Tangent Categories from the Coalgebras of Differential Categories

Following the pattern from linear logic, the coKleisli category of a differential category is a Cartesian differential category. What then is the coEilenberg-Moore category of a differential category? The answer is a tangent category! A key example arises from the opposite of the category of Abelian groups with the free exponential modality. The coEilenberg-Moore category, in this case, is the opposite of the category of commutative rings. That the latter is a tangent category captures a fundamental aspect of both algebraic geometry and Synthetic Differential Geometry. The general result applies when there are no negatives and thus encompasses examples arising from combinatorics and computer science. This is an extended version of a conference paper for CSL2020.

math.CT↗

arXiv2019

Compact inverse categories

The Ehresmann-Schein-Nambooripad theorem gives a structure theorem for inverse monoids: they are inductive groupoids. A particularly nice case due to Jarek is that commutative inverse monoids become semilattices of abelian groups. It has also been categorified by DeWolf-Pronk to a structure theorem for inverse categories as locally complete inductive groupoids. We show that in the case of compact inverse categories, this takes the particularly nice form of a semilattice of compact groupoids. Moreover, one-object compact inverse categories are exactly commutative inverse monoids. Compact groupoids, in turn, are determined in particularly simple terms of 3-cocycles by Baez-Lauda.

math.CT↗

arXiv2018

Finiteness spaces and generalized power series

We consider Ribenboim's construction of rings of generalized power series. Ribenboim's construction makes use of a special class of partially ordered monoids and a special class of their subsets. While the restrictions he imposes might seem conceptually unclear, we demonstrate that they are precisely the appropriate conditions to represent such monoids as internal monoids in an appropriate category of Ehrhard's finiteness spaces. Ehrhard introduced finiteness spaces as the objects of a categorical model of classical linear logic, where a set is equipped with a class of subsets to be thought of as finitary. Morphisms are relations preserving the finitary structure. The notion of finitary subset allows for a sharper analysis of computational structure than is available in the relational model. For example, fixed point operators fail to be finitary. In the present work, we take morphisms to be partial functions preserving the finitary structure rather than relations. The resulting category is symmetric monoidal closed, complete and cocomplete. Any pair of an internal monoid in this category and a ring induces a ring of generalized power series by an extension of the Ribenboim construction based on Ehrhard's notion of linearization of a finiteness space. We thus further generalize Ribenboim's constructions. We give several examples of rings which arise from this construction, including the ring of Puiseux series and the ring of formal power series generated by a free monoid.

math.CT↗

arXiv2018

The Category CNOT

We exhibit a complete set of identities for CNOT, the symmetric monoidal category generated by the controlled-not gate, the swap gate, and the computational ancillae. We prove that CNOT is a discrete inverse category. Moreover, we prove that CNOT is equivalent to the category of partial isomorphisms of finitely-generated non-empty commutative torsors of characteristic 2. Equivalently this is the category of affine partial isomorphisms between finite-dimensional Z2 vector spaces.

cs.LO↗

arXiv2014

Cartesian Differential Storage Categories

Cartesian differential categories were introduced to provide an abstract axiomatization of categories of differentiable functions. The fundamental example is the category whose objects are Euclidean spaces and whose arrows are smooth maps. Tensor differential categories provide the framework for categorical models of differential linear logic. The coKleisli category of any tensor differential category is always a Cartesian differential category. Cartesian differential categories, besides arising in this manner as coKleisli categories, occur in many different and quite independent ways. Thus, it was not obvious how to pass from Cartesian differential categories back to tensor differential categories. This paper provides natural conditions under which the linear maps of a Cartesian differential category form a tensor differential category. This is a question of some practical importance as much of the machinery of modern differential geometry is based on models which implicitly allow such a passage, and thus the results and tools of the area tend to freely assume access to this structure. The purpose of this paper is to make precise the connection between the two types of differential categories. As a prelude to this, however, it is convenient to have available a general theory which relates the behaviour of "linear" maps in Cartesian categories to the structure of Seely categories. The latter were developed to provide the categorical semantics for (fragments of) linear logic which use a "storage" modality. The general theory of storage, which underlies the results mentioned above, is developed in the opening sections of the paper and is then applied to the case of differential categories.

math.CT↗

arXiv2012

Restriction categories as enriched categories

Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restriction which assigns to every morphism an endomorphism of its domain, to be thought of as the partial identity that is defined to just the same degree as the original map. In this paper, we show that restriction categories can be identified with \emph{enriched categories} in the sense of Kelly for a suitable enrichment base. By varying that base appropriately, we are also able to capture the notions of join and range restriction category in terms of enriched category theory.

math.CT↗

arXiv2009

On the word problem for SP-categories, and the properties of two-way communication

The word problem for categories with free products and coproducts (sums), SP-categories, is directly related to the problem of determining the equivalence of certain processes. Indeed, the maps in these categories may be directly interpreted as processes which communicate by two-way channels. The maps of an SP-category may also be viewed as a proof theory for a simple logic with a game theoretic intepretation. The cut-elimination procedure for this logic determines equality only up to certain permuting conversions. As the equality classes under these permuting conversions are finite, it is easy to see that equality between cut-free terms (even in the presence of the additive units) is decidable. Unfortunately, this does not yield a tractable decision algorithm as these equivalence classes can contain exponentially many terms. However, the rather special properties of these free categories -- and, thus, of two-way communication -- allow one to devise a tractable algorithm for equality. We show that, restricted to cut-free terms s,t : X --> A, the decision procedure runs in time polynomial on |X||A|, the product of the sizes of the domain and codomain type.

cs.LO↗