|
|
|
|
Constructive proof
|
| |
|
| |
In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object with certain properties by creating or providing a method for creating such an object. This is in contrast to a nonconstructive proof (also known as an existence proof or pure existence theorem) which proves the existence of a mathematical object with certain properties, but does not provide a means of constructing an example.
Many nonconstructive proofs assume the non-existence of the thing whose existence is required to be proven, and deduce a contradiction.
Discussion
Ask a question about 'Constructive proof' Start a new discussion about 'Constructive proof' Answer questions from other users |
Encyclopedia
In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object with certain properties by creating or providing a method for creating such an object. This is in contrast to a nonconstructive proof (also known as an existence proof or pure existence theorem) which proves the existence of a mathematical object with certain properties, but does not provide a means of constructing an example.
Many nonconstructive proofs assume the non-existence of the thing whose existence is required to be proven, and deduce a contradiction. The non-existence of the thing has therefore been shown to be logically impossible, and yet an actual example of the thing has not been found. Nearly every proof which invokes the axiom of choice is nonconstructive in nature because this axiom is fundamentally nonconstructive. The same can be said for proofs invoking König's lemma.
Constructivism is the philosophy that rejects all but constructive proofs in mathematics. Typically, supporters of this view deny that pure existence can be usefully characterized as "existence" at all: accordingly, a non-constructive proof is instead seen as "refuting the impossibility" of a mathematical object's existence, a strictly weaker statement.
Example
Consider the theorem "There exist irrational numbers and such that is rational." This theorem can be proved via a constructive proof, or via a non-constructive proof.
A constructive proof of the theorem would give an actual example, such as:
Both and are irrational numbers according to unique factorization, and 3 is of course rational.
A possible non-constructive proof proceeds as follows:
- Recall that is irrational, and 2 is rational. Consider the number . Either it is rational or it is irrational.
- If is rational, then the theorem is true, with and both being .
- If is irrational, then the theorem is true, with being and being , since
"q" can also be shown to be irrational because of Gelfond–Schneider theorem. This proof is non-constructive because it relies on the statement "Either q is rational or it is irrational" — an instance of the law of excluded middle, which is not valid within a constructive proof. The non-constructive proof does not construct an example a and b; it merely gives a number of possibilities (in this case, two mutually exclusive possibilities) and shows that one of them — but does not show which one — must yield the desired example.
See also
|
| |
|
|
