Professional Documents
Culture Documents
Contradiction
SHARMANE F. SANORJO
Discussant
Definition
Proof by contradiction in logic and
mathematics is a proof that
determines the truth of a statement
by assuming the proposition is false,
then working to show its falsity until
the result of that assumption is a
contradiction.
Let R be a proposition.
A proof of R by contradiction
consists of proving that not(R)
implies a contradiction,
thus concluding that not(R) is false,
which implies that R is true.
Indirect Proof
No two ways
1. A statement cannot be true and
false at the same time
2. If the statement can be proven true,
then it cannot be false
3. If the statement can be proven false,
then it cannot be true
4. If the statement cannot be proven
true, then it is false
5. If the statement cannot be proven
false, then it is true
Steps we follow when using
proof of contradiction
Below is the basic process describing the approach of the proof by
contradiction:
1. State that the original statement is false. The original
statement is the one you want to prove. That is to say, it is your
desired result.
2. Assume that the opposite or negation of the original
statement is true.
3. Try to prove the assumption, as usual, using other proof
techniques such as direct or contrapositive proof.
4. While proving the assumption, give it the benefit of the doubt
that it is true unless you stumble upon a contradiction.
5. Once you find a contradiction, declare that the assumption is
false.
6. Since the assumption is false, state that the original statement
must be true.
Example 1:
Example 2:
Prove: No integers y and z exist for which
24y + 12z = 1