Scholarlink

<p>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 <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\({\pm }\)</EquationSource> <EquationSource Format="MATHML"><math> <mo>±</mo> </math></EquationSource> </InlineEquation>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Invertibility and Parity in Symmetric Monoidal Categories

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月14日

查看全文
  • Nick Gurski,
  • Niles Johnson

摘要

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 \({\pm }\) ± 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.