Mathematical Proof
(Redirected from mathematical argument)
Jump to navigation
Jump to search
A Mathematical Proof is a formal argument/formal proof designed to show that a Mathematical Statement is necessarily True.
- AKA: Mathematical Argument, Proof.
- Context:
- It can make use of Deductive Reasoning.
- It can be a part of a Proven Mathematical Statement.
- It is Logically Deduced from Axioms or from other Proven Mathematical Statements.
- It can be a Proof By Contradiction.
- It can be a line of Reasoning.
- Example(s):
- Euclid's Proof by Contradiction.
- a Convergence Proof.
- an Optimality Proof.
- …
- Counter-Example(s):
- See: Proven Mathematical Statement, Formal Argument, Deductive Logic, ProofWiki.
References
2013
- (Wikipedia, 2013) ⇒ http://en.wikipedia.org/wiki/Mathematical_proof
- In mathematics, a proof is a deductive argument for a mathematical statement. In the argument, other previously established statements, such as theorems, can be used. In principle, a proof can be traced back to generally accepted statements, known as axioms.[1][2] Proofs are examples of deductive reasoning and are distinguished from inductive or empirical arguments; a proof must demonstrate that a statement is always true (occasionally by listing all possible cases and showing that it holds in each), rather than enumerate many confirmatory cases. An unproven statement that is believed true is known as a conjecture.
Proofs employ logic but usually include some amount of natural language which usually admits some ambiguity. In fact, the vast majority of proofs in written mathematics can be considered as applications of rigorous informal logic. Purely formal proofs, written in symbolic language instead of natural language, are considered in proof theory. The distinction between formal and informal proofs has led to much examination of current and historical mathematical practice, quasi-empiricism in mathematics, and so-called folk mathematics (in both senses of that term). The philosophy of mathematics is concerned with the role of language and logic in proofs, and mathematics as a language.
- In mathematics, a proof is a deductive argument for a mathematical statement. In the argument, other previously established statements, such as theorems, can be used. In principle, a proof can be traced back to generally accepted statements, known as axioms.[1][2] Proofs are examples of deductive reasoning and are distinguished from inductive or empirical arguments; a proof must demonstrate that a statement is always true (occasionally by listing all possible cases and showing that it holds in each), rather than enumerate many confirmatory cases. An unproven statement that is believed true is known as a conjecture.
2009
- http://planetmath.org/encyclopedia/Proof.html
- A proof is an argument designed to show that a statement (usually a theorem) is true.
- The mathematical concept of proof differs from the scientific concept in that in mathematics, a proof is logically deduced from axioms or from other theorems which have also been logically deduced, whereas for a scientific proof a preponderance of evidence is sufficient. Thus, a valid mathematical proof assures there are no counterexamples to the proven statement.
- There are several kinds of proofs, one commonly used one being proof by contradiction. A proof by contradiction starts by assuming that the opposite of the theorem is true, and then proceeds to work out the consequences of that assumption until encountering a contradiction, thus proving the theorem.
- According to Paul Nahin, the most famous proof by contradiction is Euclid's proof of the infinitude of primes, which starts by assuming that there is in fact a largest prime number (and thus the primes are finite). Proofs that a given number is irrational (such as $ \pi$ or $ \sqrt{5}$) also tend to prove the irrationality of the number by at first assuming that the number is in fact rational and that there are two integers which form a ratio for the given number.
- Another kind of proof is the proof by induction, which starts by showing the statement is true for a small case (such as $ n = 1$ when dealing with integers) and that the statement is true for a larger case when it is true for the immediately smaller case (e.g., that if it's true for $ n$ it is also true for $ n + 1$). Thus, showing that it is true for the small case proves that it is also true for the next larger case, and the next larger case after that, and therefore all the larger cases.
- A proof by construction shows that a specified object actually exists by showing how to construct that object. For example, to prove that it is possible to draw by compass and straightedge an isosceles triangle with an angle that is half of any of the two other angles, a constructive proof would give the instructions on how to draw such a triangle.