关联$n$ -范畴的Z字形规范化
Zigzag normalisation for associative $n$-categories
摘要:
结合$n$ -范畴理论是最近提出的一种严格结合的、统一的高级范畴理论。作为一个证明助手的基础,这是潜在的吸引力,因为它有可能允许简单的形式证明复杂的高维代数现象。然而,该理论依赖于一个隐式的长期规范化程序来识别正确的复合材料,没有递归的方法可用于计算it.here,我们描述了一种新的方法来长期规范化的关联$n$类别,根据类别的曲折建设。这从根本上简化了理论,并产生一个递归算法的规范化,我们证明是正确的。我们使用的范畴提升性能,使我们能够有效地证明我们的结果。这种规范化算法形成了一个核心组成部分的证明助手homotopy.io,我们说明了我们的计划与工作的例子。
英文摘要:
The theory of associative $n$-categories has recently been proposed as a strictly associative and unital approach to higher category theory. As a foundation for a proof assistant, this is potentially attractive, since it has the potential to allow simple formal proofs of complex high-dimensional algebraic phenomena. However, the theory relies on an implicit term normalisation procedure to recognize correct composites, with no recursive method available for computing it. Here we describe a new approach to term normalisation in associative $n$-categories, based on the categorical zigzag construction. This radically simplifies the theory, and yields a recursive algorithm for normalisation, which we prove is correct. Our use of categorical lifting properties allows us to give efficient proofs of our results. This normalisation algorithm forms a core component of the proof assistant homotopy.io, and we illustrate our scheme with worked examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。