Class 12 PCM . Mathematics . Mathematics Part II . Proofs in Mathematics
Chapter 14: Proofs In Mathematics
Ch 14
Mathematics
Class 12 PCM
Introduction to Proofs
Proofs are fundamental to Mathematics, serving as the rigorous justification of mathematical statements. A proof consists of a sequence of logical deductions starting from axioms, definitions, or previously established results, leading to the conclusion.
In this chapter, we explore various methods of proving mathematical propositions, focusing on procedural techniques aligned with the NCERT syllabus for Classes 9 to 11.
Direct Proof Method
Direct proof involves starting from the given assumptions and using logical deductions to arrive at the statement to be proved.
Straightforward Approach
This approach uses a chain of logical arguments, applying axioms, definitions, and previously proved theorems to deduce the conclusion directly.
Worked Illustration
Example 1: Show that if , then or .
Solution:
Given:
Factorize the quadratic:
By the zero product property:
Solving each:
Hence, the statement is proved.
Explanation
The proof uses factorization and the zero product property to deduce the roots of the quadratic equation.
Example 2: Prove that the function defined by is one-one.
Solution:
To prove is one-one, show that .
Assume :
Subtract 5 from both sides:
Divide both sides by 2:
Hence, is one-one.
Practice Set
- Show that if , then or .
- Prove that the function is one-one.
- Prove that the sum of two even numbers is even using direct proof.
Answer Key
- Factorize , so or .
- Assume , then , so , hence one-one.
- Let two even numbers be and . Their sum is , which is even.
Quick Reference
| Concept | Key Formula/Property |
|---|---|
| Zero Product Property | |
| One-One Function |
Glossary
- Direct Proof: A method of proof starting from given assumptions to reach the conclusion directly.
- One-One Function: A function where each output corresponds to exactly one input.
- Zero Product Property: If the product of two numbers is zero, then at least one of the numbers is zero.
Mathematical Induction
Mathematical induction is a method of proving statements that are asserted for all natural numbers , where is a starting integer.
The principle states that if:
- Base Case: The statement is true for .
- Inductive Step: Assuming the statement is true for , it is also true for .
Then the statement is true for all .
Worked Illustration
Example 3: Show that for the matrix ,
Solution:
Define the statement .
Base Case (n=1):
So, is true.
Inductive Step: Assume is true:
We want to prove :
Multiply the matrices:
Using trigonometric identities:
Thus, is true.
By the principle of mathematical induction, is true for all .
Practice Set
- Prove by induction that .
- Show by induction that \(2^n > n^2\) for .
- Prove that by induction.
Answer Key
- Base case : . Inductive step: Assume true for , prove for by adding to both sides.
- Base case : \(2^5=32 > 25=5^2\). Inductive step: Assume true for , prove for using \(2^{k+1} = 2 \cdot 2^k > 2k^2\) and compare with .
- Use base case and inductive step by adding to the sum.
Quick Reference
| Step | Description |
|---|---|
| Base Case | Verify statement for initial value |
| Inductive Step | Assume true for , prove for |
Glossary
- Mathematical Induction: A proof technique to establish statements for all natural numbers.
- Base Case: The initial step verifying the statement for the starting value.
- Inductive Hypothesis: The assumption that the statement holds for .
- Inductive Step: The step proving the statement for using the hypothesis.
Proof by Cases
Proof by cases involves splitting the hypothesis into several mutually exclusive cases and proving the conclusion for each case.
Worked Illustration
Example 4: Show that in any triangle ,
Solution:
Let be any triangle. Draw a perpendicular from vertex to side (extended if necessary).
Since any triangle is either acute, obtuse, or right angled, split into three cases:
- Case (i): is acute.
- Case (ii): is obtuse.
- Case (iii): is right angle.
For each case, use trigonometric ratios in right triangles and to express in terms of , , and cosines of angles.
For example, in Case (i):
Similarly, verify for other cases.
Since the statement holds in all cases, it is proved by cases.
Practice Set
- Prove that the absolute value function satisfies if and if \(x < 0\) by cases.
- Show that for any integer , by cases.
- Prove that the function is increasing for and decreasing for by cases.
Answer Key
- Check definition of absolute value for and \(x < 0\) separately.
- Consider cases and for integer and compute .
- Analyze derivative or difference for and .
Quick Reference
| Case | Condition | Result |
|---|---|---|
| 1 | ||
| 2 | \(x < 0\) |
Glossary
- Proof by Cases: A method where the hypothesis is divided into cases and the conclusion is proved in each.
- Mutually Exclusive Cases: Cases that do not overlap and cover all possibilities.
Indirect Proof Methods
Indirect proofs establish the truth of a statement by proving an equivalent or related statement, often by contradiction or contrapositive.
Proof by Contradiction
Assume the negation of the statement to be proved. If this assumption leads to a contradiction, the original statement is true.
Worked Illustration
Example 5: Prove that the set of all prime numbers is infinite.
Solution:
Assume the contrary: the set of prime numbers is finite, listed as .
Consider:
Since is greater than any listed prime, it is either prime or composite.
- If is prime, it is not in the list, contradiction.
- If is composite, it has a prime divisor not in the list, contradiction.
Hence, the assumption is false, and there are infinitely many primes.
Proof by Contrapositive
To prove , prove its contrapositive .
Worked Illustration
Example 6: Prove that the function is one-one using contrapositive.
Solution:
Original statement: .
Contrapositive: .
Assume , then:
Thus, , proving the contrapositive and hence the original statement.
Proof by Counterexample
To disprove a universal statement, provide a single example where the statement fails.
Worked Illustration
Example 8: Disprove the statement: "For each natural number , is prime."
Solution:
Check :
This number is composite since:
Thus, the statement is false, and is a counterexample.
Practice Set
- Use proof by contradiction to show is irrational.
- Prove by contrapositive: If is even, then is even.
- Find a counterexample to disprove: "All continuous functions are differentiable."
Answer Key
- Assume is rational, express as , derive contradiction on parity.
- Contrapositive: If is odd, then is odd; prove by direct calculation.
- Counterexample: is continuous but not differentiable at .
Quick Reference
| Method | Description |
|---|---|
| Contradiction | Assume negation leads to contradiction |
| Contrapositive | Prove instead of |
| Counterexample | Single example disproving a universal statement |
Glossary
- Proof by Contradiction: Proving a statement by showing its negation leads to a contradiction.
- Contrapositive: The statement equivalent to .
- Counterexample: An example that disproves a universal statement.
Mathematics — ALL CHAPTERS
1
Relations And Functions
2
Inverse Trigonometric Functions
3
Matrices
4
DETERMINANTS
5
Continuity And Differentiability
6
Application Of Derivatives
7
Integrals
8
APPLICATION OF INTEGRALS
9
DIFFERENTIAL EQUATIONS
10
VECTOR ALGEBRA
11
Three Dimensional Geometry
12
Linear Programming
13
Probability
14
Proofs In Mathematics
15
Mathematical Modelling