正数 $n=9$ 的 Vasc 不等式的一个有限证书
A Finite Certificate for the Positive $n=9$ Vasc Inequality
AI总结:
通过人工引导的 AI 代理 MechMath Agent Team,将有理不等式转化为齐次多项式不等式,并利用累积间隙参数化所有排序的固定最大值锥体,生成覆盖 40320 个锥体的有限证书,从而证明了正实数 $n=9$ 情况下的 Vasc 循环不等式。
摘要:
我们证明了正实数 $n=9$ 情况下的 Vasc 循环不等式。该证明是在 AI 代理 MechMath Agent Team 的人工引导协助下获得的:人类可读部分将有理不等式简化为齐次多项式不等式,固定一个循环最大值,并通过累积间隙参数化每个排序的固定最大值锥体;有限部分是一个覆盖所有 $8!=40320$ 个排序锥体的证书。MechMath Agent Team 通过 Python 工具调用生成了证书验证工作流,包括情况划分、验证程序和终端分类。已发布的证书包含 36815 个系数叶子、2236 个普通 Polya 乘子叶子和 1269 个 AM-GM 中点覆盖叶子。人类作者审计了数学简化和验证逻辑,一个单独的工件包含证书、独立验证器和从源代码重建的路径。
英文摘要:
We prove the positive-real $n=9$ case of the Vasc cyclic inequality. The proof was obtained with human-guided assistance from the AI agent MechMath Agent Team: the human-readable part reduces the rational inequality to a homogeneous polynomial inequality, fixes a cyclic maximum, and parametrizes each sorted fixed-maximum cone by cumulative gaps; the finite part is a certificate covering all $8!=40320$ sorted cones. MechMath Agent Team generated the certificate verification workflow through Python tool calls, including the case split, verification programs, and terminal classifications. The published certificate has $36815$ coefficient leaves, $2236$ ordinary Polya multiplier leaves, and $1269$ AM-GM midpoint overlay leaves. Human authors audited the mathematical reductions and verification logic, and a separate artifact contains the certificate, an independent verifier, and a from-source rebuild route.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。