Introduction to Proofs

Slides:



Advertisements
Similar presentations
With examples from Number Theory
Advertisements

Discrete Math Methods of proof 1.
Introduction to Proofs
PROOF BY CONTRADICTION
Chapter 3 Elementary Number Theory and Methods of Proof.
Chapter 3 Direct Proof and Proof by Contrapositive
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
(CSC 102) Lecture 12 Discrete Structures. Previous Lecture Summary Floor and Ceiling Functions Definition of Proof Methods of Proof Direct Proof Disproving.
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
More Number Theory Proofs Rosen 1.5, 3.1. Prove or Disprove If m and n are even integers, then mn is divisible by 4. The sum of two odd integers is odd.
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/01/11
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
So far we have learned about:
Copyright © Zeph Grunschlag,
1 Indirect Argument: Contradiction and Contraposition.
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Methods of Proof Lecture 4: Sep 16 (chapter 3 of the book)
Lecture , 3.1 Methods of Proof. Last time in 1.5 To prove theorems we use rules of inference such as: p, p  q, therefore, q NOT q, p  q, therefore.
1 Number Theory and Methods of Proof Content: Properties of integer, rational and real numbers. Underlying theme: Methods of mathematical proofs.
Methods of Proof & Proof Strategies
Chapter 4: Elementary Number Theory and Methods of Proof 4.2 Direct Proof and Counter Example II: Rational Numbers 1 Such, then, is the whole art of convincing.
Introduction to Proofs
Introduction to Proofs
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
Proofs 1/25/12.
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
CSci 2011 Discrete Mathematics Lecture 6
1 Methods of Proof. 2 Consider (p  (p→q)) → q pqp→q p  (p→q)) (p  (p→q)) → q TTTTT TFFFT FTTFT FFTFT.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Chapter 5 Existence and Proof by contradiction
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
Discrete Structures & Algorithms More on Methods of Proof / Mathematical Induction EECE 320 — UBC.
Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems and pg. 171.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Methods of Proof Dr. Yasir Ali. Proof A (logical) proof of a statement is a finite sequence of statements (called the steps of the proof) leading from.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
321 Section Natalie Linnell. The importance of domains Domain is part of the function definition A predicate is a function from some domain to {T,F} If.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Proof Techniques CS160/CS122 Rosen: 1.5, 1.6, 1.7.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
The Foundations: Logic and Proofs
CSE15 Discrete Mathematics 02/01/17
Direct Proof by Contraposition Direct Proof by Contradiction
Methods of Proof CS 202 Epp, chapter 3.
Chapter 1: The Foundations: Logic and Proofs
Proof Techniques.
Indirect Argument: Contradiction and Contraposition
The Foundations: Logic and Proofs
Indirect Proof by Contradiction Direct Proof by Cases
CS 220: Discrete Structures and their Applications
CS 220: Discrete Structures and their Applications
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Indirect Argument: Contradiction and Contraposition
Dr. Halimah Alshehri MATH 151 Dr. Halimah Alshehri Dr. Halimah Alshehri.
Introduction to Proofs
Introduction to Proofs
Presentation transcript:

Introduction to Proofs Section 1.6

Proof Techniques Direct Proofs Indirect Proofs Proof by contraposition Proof by contradiction

Direct Proofs For “p  q” Or  x ( P(x)  q(x) ) Can be done by assuming that p is true and using all possible facts, lemmas, theorems, and rules of inferences And trying to prove that q is true.

Definition nZ is even   kZ s.t. n = 2k nZ is odd   kZ s.t. n = 2k+1 nZ is a perfect square  n=k2 for some kZ. Note: nZ  n is even  n is odd

Theorem If nZ is odd, then n2 is odd, i.e.,  nZ (n is odd  n2 is odd ) Proof. (Direct) Assume that nZ is odd, then by definition  k Z s.t. n=2k+1 Then n2 = (2k+1)2 = 4 k2 + 4 k + 1 = 2(k2 + 2 k) + 1 = 2 m + 1 And so n2 is odd.

Theorem If n, mZ are perfect squares, then nm is also a perfect square. Proof. (direct) Let n, m be perfect squares. Then n=k2 and m=l2 for some k, lZ. Then nm=k2 l2= (k l) 2. And so nm is a perfect square.

Indirect Proofs. Proof by contraposition: Note that pq  q  p So to prove pq we need to assume q and try to prove p

Examples If nZ and 3n+2 is odd, then n is odd Proof. (by contraposition) Assume that n is even Then n = 2 k for some integer k So 3n+2 = 6 k +2 = 2 (3k+1) = 2 m Thus 3n+2 is even

a  sqrt(n) or b  sqrt(n) If n= a b where a & b are positive integers, then a  sqrt(n) or b  sqrt(n) Proof. (by contraposition) assume a > sqrt(n) & b > sqrt(n) Then a b > n, i.e., a b  n

Vacuous & Trivial Proofs Consider p  q Vacuous Proof: if p is false then the statement is always true. Trivial Proof: if q is true then the statement is always true.

Examples If 0>1, then n2 > n for any integer n. (vacuous) If a > b, then a2  0. (trivial)

Definition Any real number r is rational iff there are two integers n and m s.t. m  0 and r =n/m. r is irrational iff it is not rational. We write Q for the set of all rational.

Theorem  x, yQ, x + yQ Or  x, yR ( x,y Q  x + yQ ) Proof. (direct) Let x, yQ. Then x = n1/m1 and y =n2/m2, and m1  0  m2 Then x+y = n1/m1 + n2/m2 = (n1m2 + n2m1 )/ (m1m2 ) So x + yQ

Theorem If nZ and n2 is odd, then n is odd Proof Direct: n2 = 2k+1, and so n = sqrt(2k+1), and then ....??? Contraposition: n is even  n = 2k  n2 = 4 k2 = 2(2k2)  n2 is even

Proofs by contradiction To prove that p is true, we show that p leads to some kind of a contradiction proposition like (r r).

Example Sqrt(2) is irrational. Proof. (by contradiction) Assume not, i.e., sqrt(2) = n/m for some integers n and m0. We can assume that n and m have no common factors. Then 2 = n2/m2, or indeed 2 m2= n2 Which means that n2 is even So n is even (by theorem)

Continue .. So n = 2k and hence n2= 4k2 =2 m2 Or 2 k2 = m2, and so m2 is even This means that both n and m are even, i.e. They have a common factors! Which is a contradiction with what we have assume at the beginning.

Theorem The following are equivalent P: n is even Q: n-1 is odd R: n2 is even This means that P  Q  R OR (P Q) (Q R)  (R p)

Proof (P) n is even  n = 2k n-1 = 2k-1 = 2(k-1) + 1  n-1 is odd (Q) (Q) n-1 is odd  n-1 = 2k+1  n = 2(k+1)  n2 = 2 (2 (k+1)2)  n2 is even (R) (R) n2 is even  n is even (P)

Counter Examples Every positive integer is the sum of the squares of two integers. Not true: by counter example

Mistakes in Proofs Theorem: 1 = 2 Proof: Let a and b be equal integers Then a = b and so a2 = ab so a2 – b2 = ab – b2 (a-b)(a+b) = b(a-b) a+b = b 2b = b 2=1 !!!