foundations of computer science lecture 4 proofs
play

Foundations of Computer Science Lecture 4 Proofs Proving If . . . - PowerPoint PPT Presentation

Foundations of Computer Science Lecture 4 Proofs Proving If . . . then . . . (Implication): Direct proof; Contraposition Contradiction Proofs About Sets Last Time 1 How to make precise statements. 2 Quantifiers which allow us to make


  1. Foundations of Computer Science Lecture 4 Proofs Proving “ If . . . then . . . ” (Implication): Direct proof; Contraposition Contradiction Proofs About Sets

  2. Last Time 1 How to make precise statements. 2 Quantifiers which allow us to make statements about many things. Creator: Malik Magdon-Ismail Proofs: 2 / 8 Today →

  3. Today: Proofs Proving “ if . . . , then . . . ”. 1 Proof Patterns 2 Direct Proof Creator: Malik Magdon-Ismail Proofs: 3 / 8 Reasoning Without Facts →

  4. Implications: Reasoning in the Absence of Facts Reasoning: It rained last night (fact); the grass is wet (“deduced”). Creator: Malik Magdon-Ismail Proofs: 4 / 8 Proving an Implication →

  5. Implications: Reasoning in the Absence of Facts Reasoning: It rained last night (fact); the grass is wet (“deduced”). Reasoning in the absense of facts: if it rained last night, then the grass is wet. Creator: Malik Magdon-Ismail Proofs: 4 / 8 Proving an Implication →

  6. Implications: Reasoning in the Absence of Facts Reasoning: It rained last night (fact); the grass is wet (“deduced”). Reasoning in the absense of facts: if it rained last night, then the grass is wet. We like to prove such statements even though, at this moment, it is not much use. Later, you may learn that it rained last night and infer the grass is wet Creator: Malik Magdon-Ismail Proofs: 4 / 8 Proving an Implication →

  7. Implications: Reasoning in the Absence of Facts Reasoning: It rained last night (fact); the grass is wet (“deduced”). Reasoning in the absense of facts: if it rained last night, then the grass is wet. We like to prove such statements even though, at this moment, it is not much use. Later, you may learn that it rained last night and infer the grass is wet More Relevant Example: Friendship cliques and radio frequencies. if we can quickly find the largest friend-clique in a friendship network, then we can quickly determine how to assign non-conflicting frequencies to radio stations using a minimum number of frequencies. Creator: Malik Magdon-Ismail Proofs: 4 / 8 Proving an Implication →

  8. Implications: Reasoning in the Absence of Facts Reasoning: It rained last night (fact); the grass is wet (“deduced”). Reasoning in the absense of facts: if it rained last night, then the grass is wet. We like to prove such statements even though, at this moment, it is not much use. Later, you may learn that it rained last night and infer the grass is wet More Relevant Example: Friendship cliques and radio frequencies. if we can quickly find the largest friend-clique in a friendship network, then we can quickly determine how to assign non-conflicting frequencies to radio stations using a minimum number of frequencies. More Mathematical Example: Quadratic formula. √ √ b 2 − 4 ac b 2 − 4 ac if ax 2 + bx + c = 0 and a � = 0 , then x = − b + or x = − b − . 2 a 2 a Creator: Malik Magdon-Ismail Proofs: 4 / 8 Proving an Implication →

  9. Proving an Implication if x and y are rational , then x + y is rational . � �� � � �� � p q ∀ ( x, y ) ∈ Q 2 : x + y is rational . � �� � P ( x,y ) Creator: Malik Magdon-Ismail Proofs: 5 / 8 Direct proof →

  10. Proving an Implication if x and y are rational , then x + y is rational . � �� � � �� � p q ∀ ( x, y ) ∈ Q 2 : x + y is rational . � �� � P ( x,y ) p q p → q We must show that the row p = t , q = f can’t happen. Proof. f f t f t t t f f t t t Creator: Malik Magdon-Ismail Proofs: 5 / 8 Direct proof →

  11. Proving an Implication if x and y are rational , then x + y is rational . � �� � � �� � p q ∀ ( x, y ) ∈ Q 2 : x + y is rational . � �� � P ( x,y ) p q p → q We must show that the row p = t , q = f can’t happen. Proof. f f t Let us see what happens if p = t : x, y ∈ Q . f t t t f f t t t Creator: Malik Magdon-Ismail Proofs: 5 / 8 Direct proof →

  12. Proving an Implication if x and y are rational , then x + y is rational . � �� � � �� � p q ∀ ( x, y ) ∈ Q 2 : x + y is rational . � �� � P ( x,y ) p q p → q We must show that the row p = t , q = f can’t happen. Proof. f f t Let us see what happens if p = t : x, y ∈ Q . f t t t f f x = a b and y = c d , where a, c ∈ Z and b, d ∈ N . t t t Creator: Malik Magdon-Ismail Proofs: 5 / 8 Direct proof →

  13. Proving an Implication if x and y are rational , then x + y is rational . � �� � � �� � p q ∀ ( x, y ) ∈ Q 2 : x + y is rational . � �� � P ( x,y ) p q p → q We must show that the row p = t , q = f can’t happen. Proof. f f t Let us see what happens if p = t : x, y ∈ Q . f t t t f f x = a b and y = c d , where a, c ∈ Z and b, d ∈ N . t t t x + y = a b + c d = ad + bc ∈ Q . bd Creator: Malik Magdon-Ismail Proofs: 5 / 8 Direct proof →

  14. Proving an Implication if x and y are rational , then x + y is rational . � �� � � �� � p q ∀ ( x, y ) ∈ Q 2 : x + y is rational . � �� � P ( x,y ) p q p → q We must show that the row p = t , q = f can’t happen. Proof. f f t Let us see what happens if p = t : x, y ∈ Q . f t t t f f x = a b and y = c d , where a, c ∈ Z and b, d ∈ N . t t t x + y = a b + c d = ad + bc ∈ Q . bd That means q is t . Creator: Malik Magdon-Ismail Proofs: 5 / 8 Direct proof →

  15. Proving an Implication if x and y are rational , then x + y is rational . � �� � � �� � p q ∀ ( x, y ) ∈ Q 2 : x + y is rational . � �� � P ( x,y ) p q p → q We must show that the row p = t , q = f can’t happen. Proof. f f t Let us see what happens if p = t : x, y ∈ Q . f t t t f f x = a b and y = c d , where a, c ∈ Z and b, d ∈ N . t t t x + y = a b + c d = ad + bc ∈ Q . bd That means q is t . The row p = t , q = f cannot occur and the implication is proved. Creator: Malik Magdon-Ismail Proofs: 5 / 8 Direct proof →

  16. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

  17. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. 1: Start by assuming that the statement claimed in p is t . Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

  18. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. 1: Start by assuming that the statement claimed in p is t . 2: Restate your assumption in mathematical terms. Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

  19. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. 1: Start by assuming that the statement claimed in p is t . 2: Restate your assumption in mathematical terms. 3: Use mathematical and logical derivations to relate your assumption to q . Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

  20. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. 1: Start by assuming that the statement claimed in p is t . 2: Restate your assumption in mathematical terms. 3: Use mathematical and logical derivations to relate your assumption to q . 4: Argue that you have shown that q must be t . Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

  21. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. 1: Start by assuming that the statement claimed in p is t . 2: Restate your assumption in mathematical terms. 3: Use mathematical and logical derivations to relate your assumption to q . 4: Argue that you have shown that q must be t . 5: End by concluding that q is t . Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

  22. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. 1: Start by assuming that the statement claimed in p is t . 2: Restate your assumption in mathematical terms. 3: Use mathematical and logical derivations to relate your assumption to q . 4: Argue that you have shown that q must be t . 5: End by concluding that q is t . Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

  23. Template for Direct Proof of an Implication p → q Proof . We prove the implication using a direct proof. 1: Start by assuming that the statement claimed in p is t . 2: Restate your assumption in mathematical terms. 3: Use mathematical and logical derivations to relate your assumption to q . 4: Argue that you have shown that q must be t . 5: End by concluding that q is t . Theorem. If x, y ∈ Q , then x + y ∈ Q . Proof . We prove the theorem using a direct proof. 1: Assume that x, y ∈ Q , that is x and y are rational. 2: Then there are integers a, c and natural numbers b, d such that x = a/b and y = c/d (because this is what it means for x and y to be rational). 3: Then x + y = ( ad + bc ) /bd (high-school algebra). 4: Since ad + bc ∈ Z and bd ∈ N , ( ad + bc ) /bd is rational. 5: Thus, we conclude (from steps 3 and 4) that x + y ∈ Q . Creator: Malik Magdon-Ismail Proofs: 6 / 8 Writing Readable Proofs →

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend