Matrix taxonomy and Bourn localization

Abstract

In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to include matrix properties involving pointedness of a category, such as the properties of a category to be unital, strongly unital or subtractive, for example. Moreover, this extended algorithm can also be used to determine whether a given matrix property is the Bourn localization of another, thus leading to new characterizations of Mal'tsev, majority and arithmetical categories. Using a computer implementation of our algorithm, we can display all such properties given by matrices of fixed dimensions, grouped according to their Bourn localizations, as well as the implications between them.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…