请输入您要查询的字词:

 

单词 PrincipleOfFiniteInductionProvenFromTheWellorderingPrincipleForNaturalNumbers
释义

principle of finite induction proven from the well-ordering principle for natural numbers


We give a proof for the “strong” formulation.

Let S be a set of natural numbers such that n belongs to S whenever all numbers less than n belong to S (i.e., assume n(m<nmS)nS, where the quantifiersMathworldPlanetmath range over all natural numbersMathworldPlanetmath). For indirect proof, suppose that S is not the set of natural numbers . That is, the complementPlanetmathPlanetmath S is nonempty. The well-ordering principle for natural numbers says that S has a smallest element; call it a. By assumptionPlanetmathPlanetmath, the statement (m<amS)aS holds. Equivalently, the contrapositive statement aSm<amS holds. This gives a contradition since the element a is an element of S and is, moreover, the smallest element of S.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 5:54:13