“WellorderingPrincipleForNaturalNumbers”的概念、定义、习题解题方法及翻译-数学辞典

单词	WellorderingPrincipleForNaturalNumbers
释义	well-ordering principle for natural numbers Every nonempty set $S$ of natural numbers contains a least element; that is, there is some number $a$ in $S$ such that $a\\leq b$ for all $b$ belonging to $S$ . Beware that there is another statement (which is equivalent to the axiom of choice) called the well-ordering principle. It asserts that every set can be well-ordered. Note that the well-ordering principle for natural numbers is equivalent to the principle of mathematical induction (or, the principle of finite induction).
随便看	proof of bounded linear functionals on L^p⁢(μ) ProofOfBoundsForE proof of bounds for e ProofOfBrahmaguptasFormula proof of Brahmagupta’s formula ProofOfBrouwerFixedPointTheorem proof of Brouwer fixed point theorem proof of Brouwer fixed point theorem ProofOfBrouwerFixedPointTheorem1 ProofOfButterflyTheorem proof of butterfly theorem ProofOfCalculusTheoremUsedInTheLagrangeMethod proof of calculus theorem used in the Lagrange method ProofOfCantorsTheorem proof of Cantor’s theorem ProofOfCapacityGeneratedByAMeasure proof of capacity generated by a measure ProofOfCaratheodorysExtensionTheorem ProofOfCaratheodorysLemma ProofOfCaratheodorysTheorem proof of Carathéodory’s extension theorem proof of Carathéodory’s lemma proof of Carathéodory’s theorem ProofOfCasoratiWeierstrassTheorem proof of Casorati-Weierstrass theorem

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

well-ordering principle for natural numbers