arXiv subjects

Pieter Hofstra

Publications and source records attributed to Pieter Hofstra.

6 recordsLinked to original sources

arXiv2024

Inner automorphisms as 2-cells

Abstract inner automorphisms can be used to promote any category into a 2-category, and we study two-dimensional limits and colimits in the resulting 2-categories. Existing connected colimits and limits in the starting category become two-dimensional colimits and limits under fairly general conditions. Under the same conditions, colimits in the underlying category can be used to build many notable two-dimensional colimits such as coequifiers and coinserters. In contrast, disconnected colimits or genuinely 2-categorical limits such as inserters and equifiers and cotensors cannot exist unless no nontrivial abstract inner automorphisms exist and the resulting 2-category is locally discrete. We also study briefly when an ordinary functor can be extended to a 2-functor between the resulting 2-categories.

math.CT↗

arXiv2024

Inner autoequivalences in general and those of monoidal categories in particular

We develop a general theory of (extended) inner autoequivalences of objects of any 2-category, generalizing the theory of isotropy groups to the 2-categorical setting. We show how dense subcategories let one compute isotropy in the presence of binary coproducts, unifying various known one-dimensional results and providing tractable computational tools in the two-dimensional setting. In particular, we show that the isotropy 2-group of a monoidal category coincides with its Picard 2-group, i.e., the 2-group on its weakly invertible objects.

math.CT↗

arXiv2021

Polymorphic Automorphisms and the Picard Group

We investigate the concept of definable, or inner, automorphism in the logical setting of partial Horn theories. The central technical result extends a syntactical characterization of the group of such automorphisms (called the covariant isotropy group) associated with an algebraic theory to the wider class of quasi-equational theories. We apply this characterization to prove that the isotropy group of a strict monoidal category is precisely its Picard group of invertible objects. Furthermore, we obtain an explicit description of the covariant isotropy group of a presheaf category.

cs.LO↗

arXiv2020

Aspects of categorical recursion theory

We present a survey of some developments in the general area of category-theoretic approaches to the theory of computation, with a focus on topics and ideas particularly close to the interests of Jim Lambek.

math.CT↗

arXiv2012

Martin-Löf Complexes

In this paper we define Martin-Löf complexes to be algebras for monads on the category of (reflexive) globular sets which freely add cells in accordance with the rules of intensional Martin-Löf type theory. We then study the resulting categories of algebras for several theories. Our principal result is that there exists a cofibrantly generated Quillen model structure on the category of 1-truncated Martin-Löf complexes and that this category is Quillen equivalent to the category of groupoids. In particular, 1-truncated Martin-Löf complexes are a model of homotopy 1-types.

math.LO↗

arXiv2012

Combinatorial realizability models of type theory

We introduce a new model construction for Martin-Löf intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines the syntactic model with a notion of realizability; it also encompasses the well-known Hofmann- Streicher groupoid semantics. As our main application, we use the model to analyse the syntactic groupoid associated to the type theory generated by a graph G, showing that it has the same homotopy type as the free groupoid generated by G.

math.LO↗