arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.01327cs.LO
收藏

扭曲立方体及其在类型论中的应用

Twisted Cubes and their Applications in Type Theory

Gun Pinyo

AI总结:

本文提出扭曲立方体这一拓扑结构修改,通过图论框架将凸多面体转化为基范畴,并利用扭曲棱柱函子构造扭曲立方体图,以解决立方类型论与有向类型论的不兼容问题,为定义 (∞, n)-范畴提供潜在基础。

摘要:

本论文记录了扭曲立方体的持续发展,扭曲立方体是对立方体(拓扑意义上的)的一种修改,其同伦类型论不要求路径或高阶路径可逆。我发展扭曲立方体的最初动机是解决立方类型论与有向类型论之间的不兼容问题。扭曲立方体的发展仍处于早期阶段,目前的中期目标是定义一个扭曲立方体范畴及其扭曲立方集合,以便用于构造 (∞, n)-范畴的一个潜在定义。上述中期目标引导我发现了一个新颖的框架,该框架利用图论将凸多面体(如单纯形和(标准)立方体)转化为基范畴。直观地说,一个 n 维多面体被转化为一个有向图,该图以多面体的 0-面(极点)为节点,以多面体的 1-面为边。然后,我们将基范畴定义为由图范畴中由所有 n 维情形下的这些图族所诱导的全子范畴。借助这一框架,从立方体到扭曲立方体的修改可以通过反转立方体图的某些边来形式化地完成。等价地,扭曲 n-立方体图是将某个自函子作用于单点图 n 次的结果;这个自函子(称为扭曲棱柱函子)复制输入,反转第一份副本中的所有边,然后将第一份副本中的节点与第二份副本中的节点逐对连接起来。扭曲图的核心特征是其唯一的哈密顿路径,这对于证明扭曲立方体的许多性质非常有用。特别地,扭曲图的自反传递闭包与对应的单纯形图同构,这显著地表明扭曲立方体不仅与(标准)立方体相关,还与单纯形相关。

英文摘要:

This thesis captures the ongoing development of twisted cubes, which is a modification of cubes (in a topological sense) where its homotopy type theory does not require paths or higher paths to be invertible. My original motivation to develop the twisted cubes was to resolve the incompatibility between cubical type theory and directed type theory. The development of twisted cubes is still in the early stages and the intermediate goal, for now, is to define a twisted cube category and its twisted cubical sets that can be used to construct a potential definition of (infinity, n)-categories. The intermediate goal above leads me to discover a novel framework that uses graph theory to transform convex polytopes, such as simplices and (standard) cubes, into base categories. Intuitively, an n-dimensional polytope is transformed into a directed graph consists 0-faces (extreme points) of the polytope as its nodes and 1-faces of the polytope as its edges. Then, we define the base category as the full subcategory of the graph category induced by the family of these graphs from all n-dimensional cases. With this framework, the modification from cubes to twisted cubes can formally be done by reversing some edges of cube graphs. Equivalently, the twisted n-cube graph is the result of a certain endofunctor being applied n times to the singleton graph; this endofunctor (called twisted prism functor) duplicates the input, reverses all edges in the first copy, and then pairwisely links nodes from the first copy to the second copy. The core feature of a twisted graph is its unique Hamiltonian path, which is useful to prove many properties of twisted cubes. In particular, the reflexive transitive closure of a twisted graph is isomorphic to the simplex graph counterpart, which remarkably suggests that twisted cubes not only relate to (standard) cubes but also simplices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑