Mathematical proof

File:P. Oxy. I 29.jpg

CitationClass=web }}</ref>

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,<ref>Template:Cite book</ref><ref name="nutsandbolts">Template:Cite book</ref><ref>Template:Cite book</ref> 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 {{#invoke:Lang|lang}} 'to test'; related words include English probe, probation, and probability, as well as Spanish {{#invoke:Lang|lang}} 'to taste' (sometimes 'to touch' or 'to test'),<ref>"proof" New Shorter Oxford English Dictionary, 1993, OUP, Oxford.</ref> Italian Template:Tlit 'to try', and German {{#invoke:Lang|lang}} '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.<ref>Template:Cite book</ref>

Plausibility arguments using heuristic devices such as pictures and analogies preceded strict mathematical proof.<ref name="Krantz"/> It is likely that the idea of demonstrating a conclusion first arose in connection with geometry, which originated in practical problems of land measurement.<ref>Template:Cite book</ref> The development of mathematical proof is primarily the product of ancient Greek mathematics, and one of its greatest achievements.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> Thales (624–546 BCE) and Hippocrates of Chios (c. 470–410 BCE) gave some of the first known proofs of theorems in geometry. Eudoxus (408–355 BCE) and Theaetetus (417–369 BCE) formulated theorems but did not prove them. Aristotle (384–322 BCE) said definitions should describe the concept being defined in terms of other concepts already known.

Mathematical proof was revolutionized by Euclid (300 BCE), 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 Greek Template:Tlit 'something worthy'). 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.<ref>Template:Cite book</ref> 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.<ref>Template:Citation</ref> An inductive proof for arithmetic progressions was introduced in the Al-Fakhri (1000) 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.<ref>Template:Citation. See in particular p. 3: "The study of Proof Theory is traditionally motivated by the problem of formalizing mathematical proofs; the original formulation of first-order logic by Frege [1879] was the first successful step in this direction."</ref> 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.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

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(s) of proving each theorem. The book Proofs from THE BOOK, published in 2003, is devoted to presenting 32 proofs its editors find particularly pleasing.

Template:AnchorMethods of proof

Direct proof

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

In direct proof, the conclusion is established by logically combining the axioms, definitions, and earlier theorems.<ref>Cupillari, p. 20.</ref> For example, direct proof can be used to prove that the sum of two even integers is always even:

Consider two even integers x and y. Since they are even, they can be written as x = 2a and y = 2b, respectively, for some integers a and b. Then the sum is x + y = 2a + 2b = 2(a+b). Therefore x+y has 2 as a factor and, by definition, is even. Hence, the sum of any two even integers is 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

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} 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 (starting from the proved base case), it follows that all (usually infinitely many) cases are provable.<ref>Cupillari, p. 46.</ref> 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:<ref>Examples of simple proofs by mathematical induction for all natural numbers</ref> Let Template:Math} be the set of natural numbers, and let Template:Math be a mathematical statement involving the natural number Template:Math belonging to Template:Math such that

• (i) Template:Math is true, i.e., Template:Math is true for Template:Math.
• (ii) Template:Math is true whenever Template:Math is true, i.e., Template:Math is true implies that Template:Math is true.
• Then Template:Math is true for all natural numbers Template:Math.

For example, we can prove by induction that all positive integers of the form Template:Math are odd. Let Template:Math represent "Template:Math is odd":

(i) For Template:Math, Template:Math, and Template:Math is odd, since it leaves a remainder of Template:Math when divided by Template:Math. Thus Template:Math is true.

(ii) For any Template:Math, if Template:Math is odd (Template:Math), then Template:Math must also be odd, because adding Template:Math to an odd number results in an odd number. But Template:Math, so Template:Math is odd (Template:Math). So Template:Math implies Template:Math.

Thus Template:Math is odd, for all positive integers Template:Math.

The shorter phrase "proof by induction" is often used instead of "proof by mathematical induction".<ref>Proof by induction Template:Webarchive, University of Warwick Glossary of Mathematical Terminology</ref>

Proof by contraposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Proof by contraposition infers 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 <math>x</math>, if <math> x^2 </math> is even, then <math>x</math> is even:

Suppose <math>x</math> is not even. Then <math>x</math> is odd. The product of two odd numbers is odd, hence <math> x^2 = x\cdot x </math> is odd. Thus <math> x^2 </math> is not even. Thus, if <math> x^2 </math> is even, the supposition must be false, so <math> x </math> has to be even.

Proof by contradiction

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} In proof by contradiction, also known by the Latin phrase reductio ad absurdum (by reduction to the absurd), 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 <math>\sqrt{2}</math> is an irrational number:

Suppose that <math>\sqrt{2}</math> were a rational number. Then it could be written in lowest terms as <math>\sqrt{2} = {a\over b}</math> where a and b are non-zero integers with no common factor. Thus, <math>b\sqrt{2} = a</math>. Squaring both sides yields 2b² = a². Since the expression on the left is an integer multiple of 2, the right expression is by definition divisible by 2. That is, a² is even, which implies that a must also be even, as seen in the proposition above (in #Proof by contraposition). So we can write a = 2c, where c is also an integer. Substitution into the original equation yields 2b² = (2c)² = 4c². Dividing both sides by 2 yields b² = 2c². But then, by the same argument as before, 2 divides b², so b must be even. However, if a and b are both even, they have 2 as a common factor. This contradicts our previous statement that a and b have no common factor, so we must conclude that <math>\sqrt{2}</math> is an irrational number.

To paraphrase: if one could write <math>\sqrt{2}</math> 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

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} 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

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} 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.<ref>See Four color theorem#Simplification and verification.</ref>

Closed chain inference

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

A closed chain inference shows that a collection of statements are pairwise equivalent.

In order to prove that the statements <math>\varphi_1,\ldots,\varphi_n</math> are each pairwise equivalent, proofs are given for the implications <math>\varphi_1\Rightarrow\varphi_2</math>, <math>\varphi_2\Rightarrow\varphi_3</math>, <math>\dots</math>, <math>\varphi_{n-1}\Rightarrow\varphi_n</math> and <math>\varphi_{n}\Rightarrow\varphi_1</math>.<ref>Template:Cite book</ref><ref>Template:Cite book</ref>

The pairwise equivalence of the statements then results from the transitivity of the material conditional.

Probabilistic proof

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} A probabilistic proof is one in which an example is shown to exist, with certainty, by using methods of probability theory. Probabilistic proof, like proof by construction, is one of many ways to prove existence theorems.

In the probabilistic method, one seeks an object having a given property, starting with a large set of candidates. One assigns a certain probability for each candidate to be chosen, and then proves that there is a non-zero probability that a chosen candidate will have the desired property. This does not specify which candidates have the property, but the probability could not be positive without at least one.

A probabilistic proof is not to be confused with an argument that a theorem is 'probably' true, a 'plausibility argument'. The work toward the Collatz conjecture shows how far plausibility is from genuine proof, as does the disproof of the Mertens conjecture. While most mathematicians do not think that probabilistic evidence for the properties of a given object counts as a genuine mathematical proof, a few mathematicians and philosophers have argued that at least some types of probabilistic evidence (such as Rabin's probabilistic algorithm for testing primality) are as good as genuine mathematical proofs.<ref>Davis, Philip J. (1972), "Fidelity in Mathematical Discourse: Is One and One Really Two?" American Mathematical Monthly 79:252–63.</ref><ref>Fallis, Don (1997), "The Epistemic Status of Probabilistic Proof." Journal of Philosophy 94:165–86.</ref>

Combinatorial proof

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} A combinatorial proof establishes the equivalence of different expressions by showing that they count the same object in different ways. Often a bijection between two sets is used to show that the expressions for their two sizes are equal. Alternatively, a double counting argument provides two different expressions for the size of a single set, again showing that the two expressions are equal.

Nonconstructive proof

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} A nonconstructive proof establishes that a mathematical object with a certain property exists—without explaining how such an object can be found. Often, this takes the form of a proof by contradiction in which the nonexistence of the object is proved to be impossible. In contrast, a constructive proof establishes that a particular object exists by providing a method of finding it. The following famous example of a nonconstructive proof shows that there exist two irrational numbers a and b such that <math>a^b</math> is a rational number. This proof uses that <math>\sqrt{2}</math> is irrational (an easy proof is known since Euclid), but not that <math>\sqrt{2}^{\sqrt{2}}</math> is irrational (this is true, but the proof is not elementary).

Either <math>\sqrt{2}^{\sqrt{2}}</math> is a rational number and we are done (take <math>a=b=\sqrt{2}</math>), or <math>\sqrt{2}^{\sqrt{2}}</math> is irrational so we can write <math>a=\sqrt{2}^{\sqrt{2}}</math> and <math>b=\sqrt{2}</math>. This then gives <math>\left (\sqrt{2}^{\sqrt{2}}\right )^{\sqrt{2}}=\sqrt{2}^{2}=2</math>, which is thus a rational number of the form <math>a^b.</math>

Statistical proofs in pure mathematics

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} The expression "statistical proof" may be used technically or colloquially in areas of pure mathematics, such as involving cryptography, chaotic series, and probabilistic number theory or analytic number theory.<ref>"in number theory and commutative algebra... in particular the statistical proof of the lemma." [1]</ref><ref>"Whether constant π (i.e., pi) is normal is a confusing problem without any strict theoretical demonstration except for some statistical proof"" (Derogatory use.)[2]</ref><ref>"these observations suggest a statistical proof of Goldbach's conjecture with very quickly vanishing probability of failure for large E" [3]</ref> It is less commonly used to refer to a mathematical proof in the branch of mathematics known as mathematical statistics. See also the "Statistical proof using data" section below.

Computer-assisted proofs

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Until the twentieth century it was assumed that any proof could, in principle, be checked by a competent mathematician to confirm its validity.<ref name="Krantz">The History and Concept of Mathematical Proof, Steven G. Krantz. 1. February 5, 2007</ref> However, computers are now used both to prove theorems and to carry out calculations that are too long for any human or team of humans to check; the first proof of the four color theorem is an example of a computer-assisted proof. Some mathematicians are concerned that the possibility of an error in a computer program or a run-time error in its calculations calls the validity of such computer-assisted proofs into question. In practice, the chances of an error invalidating a computer-assisted proof can be reduced by incorporating redundancy and self-checks into calculations, and by developing multiple independent approaches and programs. Errors can never be completely ruled out in case of verification of a proof by humans either, especially if the proof contains natural language and requires deep mathematical insight to uncover the potential hidden assumptions and fallacies involved.

Undecidable statements

A statement that is neither provable nor disprovable from a set of axioms is called undecidable (from those axioms). One example is the parallel postulate, which is neither provable nor refutable from the remaining axioms of Euclidean geometry.

Mathematicians have shown there are many statements that are neither provable nor disprovable in Zermelo–Fraenkel set theory with the axiom of choice (ZFC), the standard system of set theory in mathematics (assuming that ZFC is consistent); see List of statements undecidable in ZFC.

Gödel's (first) incompleteness theorem shows that many axiom systems of mathematical interest will have undecidable statements.

Heuristic mathematics and experimental mathematics

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} While early mathematicians such as Eudoxus of Cnidus did not use proofs, from Euclid to the foundational mathematics developments of the late 19th and 20th centuries, proofs were an essential part of mathematics.<ref>Template:Cite book</ref> With the increase in computing power in the 1960s, significant work began to be done investigating mathematical objects beyond the proof-theorem framework,<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> in experimental mathematics. Early pioneers of these methods intended the work ultimately to be resolved into a classical proof-theorem framework, e.g. the early development of fractal geometry,<ref>Template:Cite book</ref> which was ultimately so resolved.

Related concepts

Elementary proof

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Two-column proof

File:Twocolumnproof.png

A two-column proof published in 1913

A particular way of organising a proof using two parallel columns is often used as a mathematical exercise in elementary geometry classes in the United States.<ref>Template:Cite journal</ref> The proof is written as a series of lines in two columns. In each line, the left-hand column contains a proposition, while the right-hand column contains a brief explanation of how the corresponding proposition in the left-hand column is either an axiom, a hypothesis, or can be logically derived from previous propositions. The left-hand column is typically headed "Statements" and the right-hand column is typically headed "Reasons".<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

Statistical proof using data

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Inductive logic proofs and Bayesian analysis

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Proofs as mental objects

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Ending a proof

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Sometimes, the abbreviation "Q.E.D." is written to indicate the end of a proof. This abbreviation stands for "quod erat demonstrandum", which is Latin for "that which was to be demonstrated". A more common alternative is to use a square or a rectangle, such as □ or ∎, known as a "tombstone" or "halmos" after its eponym Paul Halmos. Often, "which was to be shown" is verbally stated when writing "QED", "□", or "∎" during an oral presentation. Unicode explicitly provides the "end of proof" character, U+220E (∎) (220E(hex) = 8718(dec)).

Further reading

• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Cite book
• Template:Citation.
• Template:Citation.
• Template:Citation.

External links

• Template:Commons category-inline
• Proofs in Mathematics: Simple, Charming and Fallacious
• A lesson about proofs, in a course from Wikiversity