Scribd
Upload
45 views13 pages

Methods of Proof

1. There are three main methods of proof: direct proof, proof by contraposition, and proof by contradiction. 2. A direct proof starts with the given conditions and proves the conclusion. A proof by contraposition starts with the negation of the conclusion and proves the negation of the given conditions. A proof by contradiction assumes the negation is true and arrives at a contradiction. 3. The document then provides examples of using each of the three methods to prove various statements about integers, rational numbers, and irrational numbers.

Uploaded by

Ismail
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views13 pages

Methods of Proof

1. There are three main methods of proof: direct proof, proof by contraposition, and proof by contradiction. 2. A direct proof starts with the given conditions and proves the conclusion. A proof by contraposition starts with the negation of the conclusion and proves the negation of the given conditions. A proof by contradiction assumes the negation is true and arrives at a contradiction. 3. The document then provides examples of using each of the three methods to prove various statements about integers, rational numbers, and irrational numbers.

Uploaded by

Ismail
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

METHODS OF PROOFS

Contraposition
Indirect
Methods of Contradiction
proofs
Direct
If we need to prove the statement ∀𝑥(𝑃 𝑥 → 𝑄 𝑥 )
we can prove it using one of the following methods
• Direct proof • Contraposition (indirDirect proof
• ∀𝑥(𝑃 𝑥 → 𝑄 𝑥 ) • ∀𝑥(𝑃 𝑥 → 𝑄 𝑥 )
𝑃(𝑛) for any arbitrary 𝑛 in the domain ¬𝑄(𝑛) for any arbitrary 𝑛 in the domain
∴ 𝑄(𝑛) for any arbitrary 𝑛 in the domain ∴ ¬𝑃(𝑛) for any arbitrary 𝑛 in the domain
We start with the given conditions then we prove We start with the negation of the results then we
the results. prove the given conditions is not satisfied.

𝑝≡𝑇 𝑞≡𝑇 ¬𝑞 ≡ 𝑇 ¬𝑝 ≡ 𝑇
→ →
≡
≡
𝑇 𝑇
CONTRADICTION
• To prove the statement 𝑝 which we can not prove it
with direct proof we will assume that the statement is
false (i.e its negation is true)
• So we let ¬ 𝑝 is true with assumption we expected
that it will lead to a contradiction statement (𝑟 ∧ ¬ 𝑟)
or contradiction with an axiom.
¬𝑝 ≡𝑇 →𝐹 ≡𝐹 ∴¬𝑝 ≡𝐹 ∴ 𝑝 ≡𝑇
that

7. Use a direct proof to show that every odd integer is


the difference of two squares.

• Let 𝑝 𝑥 : 𝑥 is odd and 𝑄(𝑥, 𝑦, 𝑧): 𝑥 is the difference of squares of 𝑦 and 𝑧.


Where 𝑥, 𝑦, 𝑧 are integers.
∀𝑥 𝑝 𝑥 → ∃ 𝑦 ∃𝑧 𝑄 𝑥, 𝑦, 𝑧 ≡ ∀𝑥 ∃ 𝑦 ∃𝑧 𝑝 𝑥 → 𝑄 𝑥, 𝑦, 𝑧 ; 𝑥, 𝑦, 𝑧 ∈ 𝑍
• Let 𝑝 𝑛 true for any integer 𝑛
∴ 𝑛 = 2𝑘 + 1 ; 𝑘 ∈ 𝑍 ∴ 𝑛 = 2𝑘 + 1 + (𝑘)2 − 𝑘 2

∵ 2𝑘 + 1 + 𝑘 2 = (𝑘 + 1)2 ∴ 𝑛 = (𝑘 + 1)2 −𝑘 2
∴ 𝑄(𝑛, 𝑘 + 1, 𝑘) 𝑓𝑜𝑟 𝑎𝑛𝑦 𝑛 = 2𝑘 + 1 ; 𝑦 = 𝑘 + 1 , 𝑧 = 𝑘
This is prove that every odd integer is the difference of two squares.
1
14. Prove that if 𝑥 is rational and 𝑥 ≠ 0, then is
𝑥
rational.

• Let 𝑥 is irrational and 𝑥 ≠ 0


𝑎
∴𝑥= ; 𝑎, 𝑏 ∈ 𝑍 , 𝑏 ≠ 0
𝑏
1 𝑏
∴ = ; 𝑏, 𝑎 ∈ 𝑍 ; 𝑎 ≠ 0.
𝑥 𝑎

Since 𝑥 ≠ 0 , therefore 𝑎 ≠ 0.
1
∴ is rational number.
𝑥
15. Use a proof by contraposition to show that if 𝑥 + 𝑦 ≥ 2,
where 𝑥 and 𝑦 are real numbers, then 𝑥 ≥ 1 or 𝑦 ≥ 1.

• Let 𝑃 𝑥, 𝑦 : 𝑥 + 𝑦 ≥ 2 and 𝑄 𝑥 : 𝑥 ≥ 1. where 𝑥, 𝑦 ∈ 𝑅


∀𝑥 ∀𝑦; 𝑥, 𝑦 ∈ 𝑅: (𝑃 𝑥, 𝑦 → 𝑄 𝑥 ∨ 𝑄 𝑦 )
• Let by contraposition 𝑥 < 1 and 𝑦 < 1
∴𝑥 + 𝑦 <1+1
∴𝑥 + 𝑦<2
Therefore by contraposition if 𝑥 + 𝑦 ≥ 2, then 𝑥 ≥ 1 or 𝑦 ≥ 1.
1
13. Prove that if 𝑥 is irrational, then is irrational.
𝑥
1
• Let by contraposition if is rational, then 𝑥 is rational
𝑥
1 1 𝑎
∵ is rational ∴ = ; 𝑎, 𝑏 ∈ 𝑍 , 𝑏 ≠ 0
𝑥 𝑥 𝑏
𝑏
∴𝑥= ; 𝑏, 𝑎 ∈ 𝑍 ; 𝑎 ≠ 0.
𝑎
1 0
Since if 𝑎 = 0 we note that = , therefore 1 = 0 which is false.
𝑥 𝑏
∴ 𝑥 is rational number.
1
∴ by contraposition if 𝑥 is irrational, then is irrational.
𝑥
8. Prove that if 𝑛 is a perfect square, then 𝑛 + 2 is not
a perfect square.

• Let 𝑛 is a perfect square i.e 𝑛 is a square of an integer 𝑘.


∴ 𝑛 = 𝑘 2 so the next perfect square number is (𝑘 + 1)2
∵ (𝑘 + 1)2 −𝑘 2 = 2𝑘 + 1 ∵ 1 is the minimum perfect
square
∴𝑘≥1 ∴ (𝑘 + 1)2 −𝑘 2 ≥ 3
∴ The difference between two perfect squares at least 3,
∴ 𝑛 + 2 is not a perfect square.
If 𝑎 , 𝑏 ∈ 𝑍, then 𝑎 2 − 4 𝑏 ≠ 2.

• Let by contradiction 𝑎2 − 4 𝑏 = 2
∴ 𝑎2 = 4 𝑏 + 2 = 2 (2𝑏 + 1)
∴ 𝑎2 is even so we can write 𝑎2 = 2 𝑘 ; 𝑘 ∈ 𝑍
∴ (2𝑘)2 = 2 (2𝑏 + 1) ∴ 4 𝑘 2 = 2 (2𝑏 + 1)
∴ 2 𝑘 2 = 2𝑏 + 1
Since the L.H.S is an even integer and R.H.S is an odd integer, we
get a contradiction with our assumption, Therefore 𝑎2 − 4 𝑏 ≠ 2.
31. Show that these statements about the integer 𝑥 are equivalent:
(i) 3𝑥 + 2 is even, (ii) 𝑥 + 5 is odd, (iii) 𝑥 2 is even.
• We need to prove that i ≡ ii ≡ iii (the ≡ means ↔), so we need to prove i ↔ ii ≡ (i →
ii) ∧ (ii → i) and also for (ii , iii) and (iii , i) Instead of this we prove that (i → ii) ∧ (ii →
iii) ∧ (iii → i)
• So we 1st will prove i → ii (if 3𝑥 + 2 is even, then 𝑥 + 5 is odd)
Let by contraposition 𝑥 + 5 is even ∴ 𝑥 + 5 = 2𝑘 ; 𝑘 ∈ 𝑍 ∴ 𝑥 = 2𝑘 − 5
∴ 3𝑥 + 2 = 3 2𝑘 − 5 + 2 = 6𝑘 − 15 + 1 + 1 = 6𝑘 − 14 + 1 = 2 3𝑘 − 7 + 1
∴ 3𝑥 + 2 = 2 𝑟 ; 𝑟 = 3𝑘 − 7 ∈ 𝑍 ∴ 3𝑥 + 2 is odd #
• 2nd we will prove ii → i (𝑥 + 5 is odd , then 𝑥 2 is even)
Let 𝑥 + 5 is odd ∴ 𝑥 + 5 = 2𝑘 + 1 ; 𝑘 ∈ 𝑍 ∴ 𝑥 = 2𝑘 − 4 = 2 𝑘 − 2 = 2 𝑙 ; 𝑙 ∈ 𝑍
∴ 𝑥 2 = 4 𝑙 2 = 2 (2𝑙 2 ) which is even #
• Finally we will prove iii → i (𝑥 2 is even , then 3𝑥 + 2 is even)
• We can not prove this statement using direct prove or contraposition so we
will true the contradiction but we have a conditional statement
¬ ∀𝑥 𝑝 𝑥 → 𝑄 𝑥 ≡ ∃𝑥 𝑝 𝑥 ∧ ¬ 𝑄 𝑥

So we let 𝑥 2 is even and 3𝑥 + 2 is odd


∵ 3𝑥 + 2 = 2𝑘 + 1 ; 𝑘 ∈ 𝑍 ∴ 3𝑥 = 2𝑘 − 1
∵ 𝑥2 = 2 𝑙 ; 𝑙 ∈ 𝑍 ∴ 9𝑥 2 = 4 𝑘 2 − 4𝑘 + 1
∴ 2 9 𝑙 = 2 2 𝑘2 − 2 𝑘 + 1
∴ 2 𝑙1 = 2 𝑘1 + 1 ; 9 𝑙 = 𝑙1 , 2 𝑘 2 − 2𝑘 = 𝑘1 ∈ 𝑍
This is contradiction, therefore 3𝑥 + 2 must be even.
11. Prove or disprove that the product of two irrational
numbers is irrational.

• We will disprove this statement by counter example


Let 𝑥 = 2 and y = 8
∴ 𝑥 ∙ 𝑦 = 2 ∙ 8 = 16 = 4 which is rational number.
12. Prove or disprove that the product of a nonzero
rational number and an irrational number is irrational.
• Let by contradiction 𝑟 is a non zero rational number and 𝑥 is irrational number
and its product is rational
𝑎
∴ 𝑟 = 𝑏 ; 𝑎, 𝑏 ∈ 𝑍 , 𝑏 ≠ 0
𝑎 𝑐
∴𝑟∙𝑥 =𝑏∙𝑥 =𝑑
𝑏∙𝑐 𝑚
∴𝑥= 𝑎 ∙𝑑
= 𝑛
; 𝑚 = 𝑏 ∙ 𝑐 ≠ 0 , 𝑛 = 𝑎 ∙ 𝑑 ≠ 0 ; 𝑚, 𝑛 ∈ 𝑍

∴ 𝑥 is rational number this contradiction with the assumption 𝑥 is rational.


∴ the product of a nonzero rational number and an irrational number is irrational.

You might also like