Class 12 PCM . Mathematics . Mathematics Part II . Proofs in Mathematics
Chapter 14: Proofs In Mathematics
Ch 14
Mathematics
Class 12 PCM
Introduction
What Is a Mathematical Proof?
- Proof: A sequence of statements, each justified by a definition, axiom, previously established proposition, or valid rule of logic.
- Purpose: A proof uses deductive reasoning to establish that a mathematical proposition is true.
Direct Proof: Straightforward Approach
Show that if , then or .
- Begin with the given equation.
- Factor the quadratic expression.
- Use the zero-product property.
- Solve each resulting equation.
Mathematical Induction
Prove by induction that for and all .
- Define the matrix and the proposition to be proved.
- Check the base case.
- Assume the proposition is true for an integer .
- Multiply the assumed expression by to obtain the next power.
- Apply the angle-addition identities to obtain the required form for .
- The base case and inductive step establish the result for every integer .
Prove directly that if , then or .
Prove by induction that for every integer .
Quick recap
- A proof is a chain of deductions justified by logic, definitions, axioms, or established results.
- A direct proof begins with the given information and proceeds to the conclusion.
- Equivalent expressions may replace one another in a proof.
- Induction requires a true base case and a valid step from to .
- Once both induction conditions hold, is true for every integer in the stated range.
Proof By Cases Or By Exhaustion
Proof by Cases or by Exhaustion
If is equivalent to the disjunction of exhaustive cases , and each case implies , then implies .
How to prove by cases
- List cases that together cover every possibility in the hypothesis.
- Prove the conclusion separately under each case.
- Conclude that the original hypothesis implies the conclusion.
For triangle , let , , and .
Show that for any triangle , .
- Drop a perpendicular from to the line , meeting it at . Treat distances along as directed, so distances opposite the direction from to are negative.
- If is acute, is positive; may be negative if is obtuse. The directed lengths still add to .
- If is obtuse, the foot lies beyond , so is negative; adding the directed lengths gives the same identity.
- If is right, , so and the identity follows.
- These cases cover all possible values of angle , proving the result for every triangle.
Do not assume the perpendicular foot lies on segment , or use only positive lengths in every case. Directed projections account for a foot outside the segment.
Indirect Proof
- Indirect proof: Establishes a proposition by proving an equivalent statement rather than starting directly from the given hypothesis.
- Methods: Indirect proofs include several approaches for showing that the required conclusion follows logically.
Proof by Contradiction
Prove that the set of all prime numbers is infinite.
- Assume, for contradiction, that there are only finitely many primes, listed as .
- Multiply the listed primes and add one to form .
- Every listed prime leaves remainder one when dividing , so none divides .
- If is prime, it is absent from the list. If is composite, it has a prime divisor absent from the list.
- Both possibilities contradict the claim that the list contains all primes; therefore there are infinitely many primes.
Contradiction can use cases
- Two cases: In the prime proof, is either prime or composite.
- Conclusion: Each possibility contradicts the assumption that all primes were listed.
Proof by Contrapositive
A conditional statement is logically equivalent to its contrapositive.
When to use the contrapositive
- Strategy: Prove the contrapositive when it is easier than proving the original conditional.
- One-one test: A function is one-one if equal outputs imply equal inputs.
Equal outputs of a one-one function must come from equal inputs.
Prove that is one-one on using the contrapositive.
- For defined by , prove one-one by proving the contrapositive.
- Multiplication by the nonzero number preserves inequality.
- Adding preserves inequality, so the function values differ.
- This proves the contrapositive of equal outputs implying equal inputs; hence is one-one.
Matrix application
- Claim: If a matrix is invertible, then it is non-singular.
- Contrapositive: If is singular, then it is not invertible.
- Reason: Singularity means ; thus the inverse formula cannot define an inverse.
Disproof by Counterexample
Disprove the statement “Every continuous function is differentiable.”
- Consider the claim that every continuous function is differentiable.
- The function is continuous everywhere.
- At , its left and right derivatives differ, so it is not differentiable there.
- Thus is a counterexample and the universal claim is false.
Another counterexample
- Claim: is prime for every natural number .
- Small cases: For , the values are , all prime; these examples do not prove the general claim.
- Counterexample: For , , which is composite.
Prove by contrapositive: if is even for an integer , then is even.
Disprove the claim that is prime for every integer .
Quick recap
- Proof by cases requires exhaustive possibilities, with the conclusion proved in every case.
- Directed projections prove the triangle identity even when the perpendicular foot lies outside the side segment.
- Proof by contradiction assumes the claim is false and derives an impossibility.
- A conditional is equivalent to its contrapositive .
- For a one-one function, equal outputs imply equal inputs.
- One valid counterexample disproves a universal statement.
- Examples supporting a general claim do not establish that it is always true.
Formula sheet
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