Goodstein定理的一个新证明
A new proof of Goodstein's Theorem
摘要:
古德斯坦序列是一个数字序列,其中一个自然数m,表示为一个给定的基a的完全范式,通过将基a的值增加一个单位并从所得表达式中减去一个单位来修改。正如最初定义的那样,古德斯坦序列的首项是m以2为底的完全范式。古德斯坦定理指出,对于所有自然数,古德斯坦序列最终终止于零。古德斯坦定理最初是用超限序数的良序性质证明的。该定理也被证明是不可证明的PA(皮亚诺算术)使用超穷归纳法和哥德尔的第二不完全定理。这篇文章描述了Goodstein定理在一阶算术中的证明,它与该定理在PA中的不可证明性相矛盾。证明使用数学归纳法,并适用于(通过超指数函数)的广义版本的古德斯坦序列。这样的证明表明了经典集合论的不一致性,更确切地说,是Zermelo-Fraenkel公理和选择公理(ZFC)的结合。
英文摘要:
Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting expression. As initially defined, the first term of the Goodstein sequence is the complete normal form of m to base 2. Goodstein's Theorem states that, for all natural numbers, the Goodstein sequence eventually terminates at zero. Goodstein's Theorem was originally proved using the well-ordered properties of transfinite ordinals. The theorem was also shown to be unprovable-in-PA (Peano Arithmetic) using transfinite induction and Godel's Second Incompleteness Theorem. This article describes a proof of Goodstein's Theorem in first-order arithmetic that contradicts the theorem's unprovability-in-PA. The proof uses mathematical induction and is applied (via the super-exponential function) to a generalized version of the Goodstein sequences. Such a proof demonstrates the inconsistency of classical set theory, more precisely the combination of the Zermelo-Fraenkel axioms and the axiom of choice (ZFC).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。