基于复数恒等式方法与消元的平面几何自动证明
Automated proving in planar geometry based on the complex number identity method and elimination
AI总结:
本文基于消元理想改进复数恒等式几何证明方法,实现全自动化平面几何证明流程,在多款计算机代数系统中验证,并在GeoGebra中开发了原型。
摘要:
我们基于消元理想将复数恒等式证明方法改进为全自动化流程。通过使用声明性方程,或将每个实关系假设$h_i$改写为$h_i-r_i$、待证命题$t$改写为$t-r$,随后消去分母并引入带松弛变量的额外表达式,我们消去所有自由点变量和关系点变量。从得到的有理系数多项式环$\mathbb{Q}[r,r_1,r_2,\ldots]$中的理想$I$出发,我们可得到确定性结论。其中关键性质为:若$r_1,r_2,\ldots$均为实数,当理想$I$中存在关于$r$的一次多项式$p(r)$时,$r$必为实数,除非在表示$r$时出现除零情况。我们的结果已在Mathematica、Maple以及新版Giac计算机代数系统中实现。最后,我们在动态几何软件GeoGebra的实验版本中实现了该自动化流程的原型。
英文摘要:
We improve the complex number identity proving method to a fully automated procedure, based on elimination ideals. By using declarative equations or rewriting each real-relational hypothesis $h_i$ to $h_i-r_i$, and the thesis $t$ to $t-r$, clearing the denominators and introducing an extra expression with a slack variable, we eliminate all free and relational point variables. From the obtained ideal $I$ in $\mathbb{Q}[r,r_1,r_2,\ldots]$ we can find a conclusive result. It plays an important role that if $r_1,r_2,\ldots$ are real, $r$ must also be real if there is a linear polynomial $p(r)\in I$, unless division by zero occurs when expressing $r$. Our results are presented in Mathematica, Maple and in a new version of the Giac computer algebra system. Finally, we present a prototype of the automated procedure in an experimental version of the dynamic geometry software GeoGebra.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。