Mathematical proof
A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning that establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning that establish "reasonable expectation". Presenting many cases in which the statement holds is not enough for a proof, which must demonstrate that the statement is true in all possible cases. A proposition that has not been proved but is believed to be true is known as a conjecture, or a hypothesis if frequently used as an assumption for further mathematical work.
Proofs employ logic expressed in mathematical symbols, along with natural language that usually admits some ambiguity. In most mathematical literature, proofs are written in terms of rigorous informal logic. Purely formal proofs, written fully in symbolic language without the involvement 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, oral traditions in the mainstream mathematical community or in other cultures. The philosophy of mathematics is concerned with the role of language and logic in proofs, and mathematics as a language.
History and etymology
The word proof derives from the Latin probare 'to test'; related words include English probe, probation, and probability, as well as Spanish probar 'to taste', Italian 'to try', and German probieren 'to try'. The legal term probity means authority or credibility, the power of testimony to prove facts when given by persons of reputation or status.Plausibility arguments using heuristic devices such as pictures and analogies preceded strict mathematical proof. It is likely that the idea of demonstrating a conclusion first arose in connection with geometry, which originated in practical problems of land measurement. The development of mathematical proof is primarily the product of ancient Greek mathematics. Thales and Hippocrates of Chios gave some of the first known proofs of theorems in geometry. Eudoxus and Theaetetus formulated theorems but did not prove them. Aristotle said definitions should describe the concept being defined in terms of other concepts already known.
Mathematical proof was revolutionized by Euclid, who introduced the axiomatic method still in use today. It starts with undefined terms and axioms, propositions concerning the undefined terms which are assumed to be self-evidently true. From this basis, the method proves theorems using deductive logic. Euclid's Elements was read by anyone who was considered educated in the West until the middle of the 20th century. In addition to theorems of geometry, such as the Pythagorean theorem, the Elements also covers number theory, including a proof that the square root of two is irrational and a proof that there are infinitely many prime numbers.
Further advances also took place in medieval Islamic mathematics. In the 10th century, the Iraqi mathematician Al-Hashimi worked with numbers as such, called "lines" but not necessarily considered as measurements of geometric objects, to prove algebraic propositions concerning multiplication, division, etc., including the existence of irrational numbers. An inductive proof for arithmetic progressions was introduced in the Al-Fakhri by Al-Karaji, who used it to prove the binomial theorem and properties of Pascal's triangle.
Modern proof theory treats proofs as inductively defined data structures, not requiring an assumption that axioms are "true" in any sense. This allows parallel mathematical theories as formal models of a given intuitive concept, based on alternate sets of axioms, for example axiomatic set theory and non-Euclidean geometry.
Nature and purpose
As practiced, a proof is expressed in natural language and is a rigorous argument intended to convince the audience of the truth of a statement. The standard of rigor is not absolute and has varied throughout history. A proof can be presented differently depending on the intended audience. To gain acceptance, a proof has to meet communal standards of rigor; an argument considered vague or incomplete may be rejected.The concept of proof is formalized in the field of mathematical logic. A formal proof is written in a formal language instead of natural language. A formal proof is a sequence of formulas in a formal language, starting with an assumption, and with each subsequent formula a logical consequence of the preceding ones. This definition makes the concept of proof amenable to study. Indeed, the field of proof theory studies formal proofs and their properties, the most famous and surprising being that almost all axiomatic systems can generate certain undecidable statements not provable within the system.
The definition of a formal proof is intended to capture the concept of proofs as written in the practice of mathematics. The soundness of this definition amounts to the belief that a published proof can, in principle, be converted into a formal proof. However, outside the field of automated proof assistants, this is rarely done in practice. A classic question in philosophy asks whether mathematical proofs are analytic or synthetic. Kant, who introduced the analytic–synthetic distinction, believed mathematical proofs are synthetic, whereas Quine argued in his 1951 "Two Dogmas of Empiricism" that such a distinction is untenable.
Proofs may be admired for their mathematical beauty. The mathematician Paul Erdős was known for describing proofs which he found to be particularly elegant as coming from "The Book", a hypothetical tome containing the most beautiful method of proving each theorem. The book Proofs from THE BOOK, published in 2003, is devoted to presenting 32 proofs its editors find particularly pleasing.
Methods of proof
Direct proof
In direct proof, the conclusion is established by logically combining the axioms, definitions, and earlier theorems. For example, direct proof can be used to prove that the sum of two even integers is always even:This proof uses the definition of even integers, the integer properties of closure under addition and multiplication, and the distributive property.
Proof by mathematical induction
Despite its name, mathematical induction is a method of deduction, not a form of inductive reasoning. In proof by mathematical induction, a single "base case" is proved, and an "induction rule" is proved that establishes that any arbitrary case implies the next case. Since in principle the induction rule can be applied repeatedly, it follows that all cases are provable. This avoids having to prove each case individually. A variant of mathematical induction is proof by infinite descent, which can be used, for example, to prove the irrationality of the square root of two.A common application of proof by mathematical induction is to prove that a property known to hold for one number holds for all natural numbers:
Let be the set of natural numbers, and let be a mathematical statement involving the natural number belonging to such that
- ' is true, i.e., is true for.
- ' is true whenever is true, i.e., is true implies that is true.
- Then is true for all natural numbers.
The shorter phrase "proof by induction" is often used instead of "proof by mathematical induction".
Proof by contraposition
the statement "if p then q" by establishing the logically equivalent contrapositive statement: "if not q then not p".For example, contraposition can be used to establish that, given an integer, if is even, then is even:
Proof by contradiction
In proof by contradiction, also known by the Latin phrase reductio ad absurdum, it is shown that if some statement is assumed true, a logical contradiction occurs, hence the statement must be false. A famous example involves the proof that is an irrational number:To paraphrase: if one could write as a fraction, this fraction could never be written in lowest terms, since 2 could always be factored from numerator and denominator.
Proof by construction
Proof by construction, or proof by example, is the construction of a concrete example with a property to show that something having that property exists. Joseph Liouville, for instance, proved the existence of transcendental numbers by constructing an explicit example. It can also be used to construct a counterexample to disprove a proposition that all elements have a certain property.Proof by exhaustion
In proof by exhaustion, the conclusion is established by dividing it into a finite number of cases and proving each one separately. The number of cases sometimes can become very large. For example, the first proof of the four color theorem was a proof by exhaustion with 1,936 cases. This proof was controversial because the majority of the cases were checked by a computer program, not by hand.Closed chain inference
A closed chain inference shows that a collection of statements are pairwise equivalent.In order to prove that the statements are each pairwise equivalent, proofs are given for the implications,,, and.
The pairwise equivalence of the statements then results from the transitivity of the material conditional.