Invertibility and parity in symmetric monoidal categories
Abstract
We introduce a notion of parity for formal morphisms between invertible objects and use it to prove a corresponding coherence theorem. Parity is conceptually similar to the sign of underlying permutations, but not defined as such. To give complete details, this work includes a thorough treatment of the free permutative category on an invertible generator, its skeletal model, known as the super integers, and an equivalence between them classified by the pair of integers 1. Our approach is organized and clarified as an application of 2-monadic algebra, particularly the concept of flexibility and the Lack model structure. The final section contains a number of examples applying the main results.
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.