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

单词

proof by contradiction

释义

proof by contradiction

A direct proof of a statement is a logically correct argument establishing the truth of the statement. A proof by contradiction instead assumes that a statement is false and derives a conclusion which is false, thus proving the original statement using the principle of the excluded middle. Two commonly used proofs by contradiction are showing the $inline$ is irrational and that there are infinitely many primes.

If wishing to prove p⇒q by contradiction, we prove ¬(p∧(¬q)), that is, the hypotheses p are still assumed, and the negation ¬q of the conclusion, and then p∧(¬q) is shown to be false. This is equivalent to direct proof by De Morgan's Laws.

随便看

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