代数的自反策略,再访
Reflexive tactics for algebra, revisited
摘要:
计算反射使我们能够将经过验证的决策过程转化为证明助手中的高效自动推理工具。这种方法的典型应用包括具有可判定理论片段的数学结构,例如,交换环和格的方程理论。然而,已知这样的现有工具不与打包类协作,打包类是一种在依赖类型论中定义数学结构的方法,其允许跨继承层次结构共享词汇表。此外,这样的工具不支持其域和余域类型可能不同的同态。本文演示了如何实现支持打包类和同态的自反策略。作为该方法的应用,我们将Coq的环域策略应用到数学组件库的交换环域结构中,并将得到的策略应用到Chyzak,Mahboubi和Sibut-Pinote对$ζ(3)$不合理性的形式化证明中,以实现更高的证明自动化.
英文摘要:
Computational reflection allows us to turn verified decision procedures into efficient automated reasoning tools in proof assistants. The typical applications of such methodology include mathematical structures that have decidable theory fragments, e.g., equational theories of commutative rings and lattices. However, such existing tools are known not to cooperate with packed classes, a methodology to define mathematical structures in dependent type theory, that allows for the sharing of vocabulary across the inheritance hierarchy. Additionally, such tools do not support homomorphisms whose domain and codomain types may differ. This paper demonstrates how to implement reflexive tactics that support packed classes and homomorphisms. As applications of our methodology, we adapt the ring and field tactics of Coq to the commutative ring and field structures of the Mathematical Components library, and apply the resulting tactics to the formal proof of the irrationality of $ζ(3)$ by Chyzak, Mahboubi, and Sibut-Pinote, to bring more proof automation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。