Exploring Methods of Proof in Mathematics

Demystifying Proof Strategies in Mathematics

Photo by Sigmund on Unsplash

Mathematics, often regarded as the language of the universe, is built upon a foundation of rigorous reasoning and logical deduction. Within the realm of mathematical inquiry, proving the truth of statements is a fundamental and intricate process. Various methods of proof have been developed and refined over centuries, each serving as a powerful tool in the mathematician’s toolkit. In this article, we will delve into some of the key methods of proof that mathematicians employ to establish the validity of mathematical propositions.

1. Direct Proof

The direct proof is perhaps the most intuitive method. It involves starting with a known fact or an assumed truth and logically deducing subsequent statements until the desired conclusion is reached. It is akin to building a logical chain, link by link, to connect the initial assumption to the final statement. The elegance of direct proofs lies in their clarity and straightforwardness.

A brief explanation of the steps involved in direct proof is given below

1. Statement of the Theorem or Proposition: Clearly state the mathematical statement you aim to prove.
2. Assumptions or Given Information: List any known facts or assumptions that you can use as a starting point for your proof.
3. Logical Reasoning: Develop a logical argument by applying deductive reasoning, using established theorems, definitions, and axioms.
4. Intermediate Steps: Break down the proof into smaller steps, clearly presenting each one and ensuring logical progression.
5. Use of Definitions and Axioms: Employ relevant definitions and axioms to support your reasoning.
6. Transitive Property and Equality: If applicable, use the transitive property and properties of equality to make connections between equal quantities or statements.
7. Conclusion: Summarize the proof by restating the original statement in the context of your logical argument.
8. QED (Quod Erat Demonstrandum): Conclude the proof with “QED” to signify the successful demonstration of the theorem.
9. Check for Completeness and Clarity: Review the proof to ensure it is complete, clear, and logically sound, checking for any gaps in reasoning.

Example: Proving that the sum of two even integers is even.

1. Statement of Theorem: “For any two even integers a and b, the sum a+b is even.”
2. Assumptions: Let a and b be even integers.
3. Definition of Even Integers: By definition, an even integer can be written as 2k for some integer k. So, let a=2m and b=2n for integers m and n.
4. Expression for the Sum: Now, express the sum a+b=2m+2n
5. Factor out 2: Factor out 2 from the expression: a+b=2(m+n)
6. Conclusion: The expression m+n is also an integer since the sum of two integers is always an integer. Therefore, a+b is divisible by 2, confirming that it is even.
7. Final Statement: “Thus, the sum of two even integers a and b is even.”

In this direct proof, we started with the assumption that a and b are even integers, expressed them in terms of the definition of even integers, manipulated the expression for the sum, and concluded that the sum is divisible by 2. This confirms that the sum of two even integers is indeed even, and we arrived at this conclusion through a series of logical steps.

2. Proof by Contradiction

Proof by contradiction operates on the principle that if assuming the opposite of what needs to be proved leads to a logical contradiction, then the original statement must be true. Mathematicians employ this method by assuming the negation of the statement to be proven, deducing consequences, and showing that these consequences cannot coexist, thereby establishing the truth of the original statement.

The basic steps of a proof by contradiction are as follows:

1. Statement of the Proposition: Clearly state the proposition or theorem you want to prove.
2. Assumption of the Negation: Assume the negation of the proposition. This assumption is made for the sake of contradiction.
3. Logical Reasoning: Develop a logical argument based on the assumption of the negation. Use deductive reasoning and previous facts to derive consequences.
4. Derivation of Contradiction: Show that the assumption of the negation leads to a logical contradiction or an absurdity. This could be a statement that is known to be false or a logically impossible situation.
5. Conclusion: Conclude that because the assumption of the negation leads to a contradiction, the original proposition must be true.
6. QED (Quod Erat Demonstrandum): Conclude the proof with “QED” to signify that which was to be demonstrated has been demonstrated.

Example: Proving that the square root of 2 is irrational.

3. Mathematical Induction

Mathematical induction is a powerful technique for proving statements about integers. It involves proving a base case and then demonstrating that if the statement holds for an arbitrary integer, it must also hold for the next integer. This recursive process allows us to extend the truth of a statement to an infinite number of cases.

It consists of two main steps the base case and the inductive step.

Base Case

• Statement: Prove that the proposition is true for a specific starting value, usually the smallest value in the domain of interest (often n=1 or n=0).
• Verification: Confirm that the proposition holds for this initial value.

Inductive Step

• Hypothesis: Assume that the proposition is true for an arbitrary but fixed value k (the induction hypothesis).
• Inductive Statement: Prove that, under this assumption, the proposition must also be true for k+1.
• Conclusion: Conclude that if the proposition holds for k, it must hold for k+1.

Conclusion

• Generalization: By the inductive step, the proposition is true for the base case (step 1) and is shown to be true for any arbitrary k assuming it is true for k (inductive step).
• Inference: Therefore, by mathematical induction, the proposition is true for all values in the specified domain.

QED (Quod Erat Demonstrandum)

• Conclusion: Conclude the proof with “QED” to signify that which was to be demonstrated has been demonstrated

4. Proof by Contrapositive

The contrapositive of a statement is the negation of its converse. Proof by contrapositive establishes the truth of a statement by proving the contrapositive. If the contrapositive is true, then the original statement must also be true. This method is particularly useful when direct proof encounters difficulties.

The basic steps of a proof by contrapositive are as follows

1. Statement of the Proposition: Clearly state the proposition or theorem you want to prove.
2. Formulation of Contrapositive: Formulate the contrapositive of the original proposition by negating both the conclusion and the hypothesis and switching their order.
3. Logical Reasoning: Develop a logical argument to prove the contrapositive statement. This often involves using deductive reasoning, facts, and theorems.
4. Derivation of Implication: Show that if the contrapositive statement is true, then the original proposition must also be true. This is typically done by demonstrating that the contrapositive implies the original statement.
5. Conclusion: Conclude that since the contrapositive is true, the original proposition must also be true.
6. QED (Quod Erat Demonstrandum): Conclude the proof with “QED” to signify that which was to be demonstrated has been demonstrated.

5. Proof by Exhaustion

Proof by exhaustion, also known as proof by cases, involves considering all possible cases and demonstrating that the statement holds true in each case. While this method is straightforward, it can be impractical for complex problems due to the sheer number of cases.

The basic steps of proof by exhaustion are as follows:

1. Statement of the Proposition: Clearly state the proposition or theorem you want to prove.
2. Identification of Cases: Identify and list all possible cases or scenarios related to the proposition. Ensure that the list is exhaustive, covering all possible situations.
3. Individual Proof for Each Case: For each case, provide a separate and specific proof. This involves applying relevant mathematical techniques, theorems, and logical reasoning to demonstrate the truth of the proposition in that particular case.
4. Completeness Check: Ensure that all possible cases have been considered and proven. There should be no unaddressed scenarios.
5. Conclusion: Conclude that since all possible cases have been considered and the proposition is true in each case, the overall proposition is true.
6. QED (Quod Erat Demonstrandum): Conclude the proof with “QED” to signify that which was to be demonstrated has been demonstrated.

6. Proof by Contradictory Premise

This method involves assuming the negation of the statement to be proven and deriving a contradiction. It differs from proof by contradiction in that it directly assumes the opposite of the statement rather than negating it during the proof.

The basic steps of a proof by contradictory premise are as follows

1. Statement of the Proposition: Clearly state the proposition or theorem you want to prove.
2. Assumption of the Negation: Assume the negation of the proposition. This assumption is made for the sake of contradiction.
3. Logical Reasoning: Develop a logical argument based on the assumption of the negation. Use deductive reasoning and previously facts to derive consequences.
4. Derivation of Contradiction: Show that the assumption of the negation leads to a logical contradiction or an absurdity. This could be a statement that is known to be false or a logically impossible situation.
5. Conclusion: Conclude that because the assumption of the negation leads to a contradiction, the original proposition must be true.
6. QED (Quod Erat Demonstrandum): Conclude the proof with “QED” to signify that which was to be demonstrated has been demonstrated.

Conclusion

In the intricate tapestry of mathematical reasoning, the methods of proof serve as the threads that weave together the truths of the discipline. Each method has its strengths and is suited to particular types of problems. Mathematicians, in their pursuit of certainty and understanding, continue to employ and refine these methods, ensuring that the edifice of mathematics stands on the solid ground of logical justification. Whether through the elegance of direct reasoning, the subtlety of proof by contradiction, or the systematic approach of mathematical induction, these methods illuminate the path toward mathematical truth.