[论文解读] Reasoning with !-Graphs

Alexander Merry|arXiv (Cornell University)|Jan 1, 2013

Logic, programming, and type systems参考文献 35被引用 9

一句话总结

本文引入了!-图，作为字符串图的扩展，通过!-盒子实现对无限图族及重写规则的有限表示。它形式化了基于图的归纳与等式推理，使在紧致闭合及迹对称单子范畴中进行严格的归纳证明成为可能——尤其适用于具有交换弗罗贝尼乌斯代数的量子图推理。

ABSTRACT

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can be built on this to allow the formalisation of inductive proofs in the string diagrams of compact closed and traced symmetric monoidal categories. String diagrams provide an intuitive method for reasoning about monoidal categories. However, this does not negate the ability for those using them to make mistakes in proofs. To this end, there is a project (Quantomatic) to build a proof assistant for string diagrams, at least for those based on categories with a notion of trace. The development of string graphs has provided a combinatorial formalisation of string diagrams, laying the foundations for this project. The prevalence of commutative Frobenius algebras (CFAs) in quantum information theory, a major application area of these diagrams, has led to the use of variable-arity nodes as a shorthand for normalised networks of Frobenius algebra morphisms, so-called "spider notation". This notation greatly eases reasoning with CFAs, but string graphs are inadequate to properly encode this reasoning. This dissertation extends string graphs to allow for variable-arity nodes to be represented at all, and then introduces !-box notation (and structures to encode it) to represent string graph equations containing repeated subgraphs, where the number of repetitions is abitrary. It then demonstrates how we can reason directly about !-graphs, viewed as (typically infinite) families of string graphs. Of particular note is the presentation of a form of graph-based induction, allowing the formal encoding of proofs that previously could only be represented as a mix of string diagrams and explanatory text.

研究动机与目标

• 将字符串图扩展至支持变元数节点及无限图族。
• 开发一种基于图重写与归纳的!-图推理形式逻辑。
• 实现在紧致闭合及迹对称单子范畴中的形式化归纳证明。
• 支持关键量子图定律的正式化，如蜘蛛律与广义双代数律。
• 为自动化推理工具（如Quantomatic）提供形式化基础。

提出的方法

• 引入!-盒子符号以表示可重复任意次数的子图。
• 将!-图定义为具有嵌套与重叠!-盒子的图，扩展字符串图理论。
• 开发!-图的图重写系统，确保展开后语义等价性得以保持。
• 基于展开标准形与深度有序实例化，建立!-图的可靠且完备的匹配算法。
• 提出!-图的逻辑体系，包含!-盒子归纳与等式推理，包括蜘蛛律的形式化。
• 引入正规形式（深度有序与展开标准形），以确保匹配的完备性与可判定性。

实验结果

研究问题

• RQ1 如何在保持语义等价性的前提下，对无限字符串图族进行有限表示？
• RQ2 能否在单子范畴的图示逻辑中形式化基于图的归纳？
• RQ3 如何使!-图重写在等式推理中保持可靠与完备？
• RQ4 !-盒子结构在实现图方程归纳证明中起什么作用？
• RQ5 如何设计!-图的匹配算法，以确保正确性与完备性？

主要发现

• 本文成功通过!-盒子符号扩展字符串图，支持变元数节点，实现对无限图族的紧凑表示。
• 建立了!-图的形式逻辑体系，包含!-盒子归纳，支持图方程的严格归纳证明。
• 利用!-盒子归纳形式化证明了蜘蛛律，展示了该系统在复杂量子图推理中的能力。
• 提出了一种完备且正确的匹配算法，其完备性在展开标准形下且无野生!-盒子时得到保证。
• 在!-图框架下正式化并证明了广义双代数律，展示了其在交互弗罗贝尼乌斯代数中的适用性。
• 该框架已集成至Quantomatic证明助手，支持图示方程的自动化推理。