Strategies for Proofs

Similar documents
Predicate logic. G. Carl Evans. Summer University of Illinois. Propositional Logic Review Predicate logic Predicate Logic Examples

Proof by Contradiction

Proof by contrapositive, contradiction

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:

Sec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

MATH 271 Summer 2016 Practice problem solutions Week 1

What is a proof? Proofing as a social process, a communication art.

CSC165. Larry Zhang, October 7, 2014

Exercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 <

CSE 20 DISCRETE MATH. Winter

Some Review Problems for Exam 1: Solutions

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730

PROBLEM SET 3: PROOF TECHNIQUES

Homework 3: Solutions

3 The language of proof

Lecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook)

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH SPRING

Proofs. Joe Patten August 10, 2018

1.1 Language and Logic

CSC 344 Algorithms and Complexity. Proof by Mathematical Induction

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.

Section 3.1: Direct Proof and Counterexample 1

Meaning of Proof Methods of Proof

CSE 20 DISCRETE MATH. Fall

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

Direct Proof Universal Statements

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

CSE 20 DISCRETE MATH. Winter

2-4: The Use of Quantifiers

1. Propositions: Contrapositives and Converses

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Mat 243 Exam 1 Review

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

Day 6. Tuesday May 29, We continue our look at basic proofs. We will do a few examples of different methods of proving.

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

The Process of Mathematical Proof

Predicate Calculus lecture 1

Lecture 2: Proof Techniques Lecturer: Lale Özkahya

First order Logic ( Predicate Logic) and Methods of Proof

1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...

MATH CSE20 Homework 5 Due Monday November 4

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Logic, Sets, and Proofs

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

Basic Logic and Proof Techniques

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

Section Summary. Proof by Cases Existence Proofs

Discrete Mathematics. Instructor: Sourav Chakraborty. Lecture 4: Propositional Logic and Predicate Lo

Mathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

In Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3

Introducing Proof 1. hsn.uk.net. Contents

Section 2.1: Introduction to the Logic of Quantified Statements

Introduction to Basic Proof Techniques Mathew A. Johnson

Chapter 2: The Logic of Quantified Statements. January 22, 2010

Logic. Def. A Proposition is a statement that is either true or false.

CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about:

Today s Topic: Propositional Logic

Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

Direct Proof and Proof by Contrapositive

Proof worksheet solutions

LECTURE 1. Logic and Proofs

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

(3,1) Methods of Proof

For all For every For each For any There exists at least one There exists There is Some

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1

Notes from How to Prove it: A Structured Approach by Daniel J. Velleman

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Disjunction/Conjunction Normal Form

Normal Forms Note: all ppts about normal forms are skipped.

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Example ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.

MA103 STATEMENTS, PROOF, LOGIC

Proofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement.

Definitions Chapter 1 Proof Technique (Pg.1): Proof (Pg.2): Statement (Pg.2): Conditional Statement/Implication (Pg3.): Hypothesis(Pg.

Group 5. Jeremy Gutierrez. Jesus Ochoa Perez. Alvaro Gonzalez. MATH 170: Discrete Mathematics. Dr. Lipika Deka. March 14, 2014.

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

x P(x) x P(x) CSE 311: Foundations of Computing announcements last time: quantifiers, review: logical Inference Fall 2013 Lecture 7: Proofs

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

COMP Intro to Logic for Computer Scientists. Lecture 13

Proof techniques (section 2.1)

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction

Supplementary exercises in propositional logic

More examples of mathematical. Lecture 4 ICOM 4075

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques

Section 1.7 Proof Methods and Strategy. Existence Proofs. xp(x). Constructive existence proof:

Today. Proof using contrapositive. Compound Propositions. Manipulating Propositions. Tautology

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

MATH 215 Final. M4. For all a, b in Z, a b = b a.

CITS2211 Discrete Structures Proofs

Quantifiers For and There exists D

Quantifiers. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, 2018

Elementary Linear Algebra, Second Edition, by Spence, Insel, and Friedberg. ISBN Pearson Education, Inc., Upper Saddle River, NJ.

Transcription:

G. Carl Evans University of Illinois Summer 2013

Today Practice with proofs Become familiar with various strategies for proofs

Review: proving universal statements Claim: For any integer a, if a is odd, then a 2 is also odd. Definition: integer a is odd iff a = 2m + 1 for some integer m Suppose a Z is odd. Then by definition of odd, a = 2m + 1 for some m Z. So a 2 = (2m + 1) 2 = 4m 2 + 4m + 1 = 2(2m 2 + 2m) + 1 2m 2 + 2m is an integer since m Z. So a 2 is odd by definition QED.

Proving Existential Statements Claim: There exists a real number x, such that x 3 < x 2 Let x = 1 2. Then x 3 = 1 8 and x 2 = 1/4. Since 1 8 < 1 4 an x where x 3 < x 2 QED. there exists

Disproving Existential Statements Claim to disprove: There exists a real x, x 2 2x + 1 < 0

Disproving Existential Statements Claim to disprove: There exists a real x, x 2 2x + 1 < 0 In general, ( x, P(x)) x, P(x) ( x R, x 2 2x + 1 < 0) x R, (x 2 = 2x + 1 < 0) x R, x 2x + 1 0 Let x be a real number. x 2 2x + 1 = (x 1) 2. (x 1) 2 0 since x 1 is a real number and the square of a real number is non-negative QED.

Disproving Universal Statements Claim to disprove: For all real x, (x + 1) 2 > 0

Disproving Universal Statements Claim to disprove: For all real x, (x + 1) 2 > 0 In general, ( x, P(x)) x, P(x) ( x R, (x + 1) > 0) x R, (x + 1) 2 0) If x = 1, (x + 1) 2 = 0. So since 1 is a real there then exists a real that proves the negation of the claim and thus the original claim is disproved QED.

Proof By Cases Claim: for every real x, if x + 7 > 8, then x > 1 Suppose x R and x + 7 > 8. Then there are two cases. If x + 7 > 8, then x > 1, so x > 1. If x + 7 < 8, then x < 15, so x > 1. The conclusion holds for both cases QED.

Rephrasing Claims Claim: There is no integer k, such that k is odd and k 2 is even. ( k Z, odd(k) even(k 2 ) k Z, (odd(k) even(k 2 )) k Z, odd(k) even(k 2 ) k Z, even(k) odd(k 2 ) At this point there is a proof by cases.

Proof By Contrapositive Claim: For all integers a and b, (a + b 15) (a b 8) Contrapositive: a, b Z (a 8 b 8) (a + b 15) a, b Z, a < 8 b < 8 a + b < 15 To prove the claim we will prove the contrapositive, a, b Z, a < 8 b < 8 a + b < 15. Suppose a Z, a < 8 and a Z, b < 8. Then a 7 and b 7. So a + b 14 < 15 QED.

Proof strategies Does this proof require showing that the claim holds for all cases or just an example? Show all cases: prove universal, disprove existential Example: disprove universal, prove existential Can you figure a straightforward solution? If so, sketch it and then write it out clearly, and youre done If not, try to find an equivalent form that is easier Divide into subcases that combine to account for all cases OR in hypothesis is a hint that this may be a good idea Try the contrapositive OR in conclusion is a hint that this may be a good idea More generally rephrase the claim: convert to propositional logic and manipulate into something easier to solve

Claim: For integers j and k, if j is even or k is even, then jk is even. Definition: integer a is even iff a = 2m for some integer m

Claim: For all integers k, if 3k + 5 is even, then k is odd.

Disprove: For all real k, if k is rational, then k3 k is rational.

Alternate proof, by cases Claim: For any real k, if k is rational, then k 2 is rational. Definition: real k is rational iff k = m n for some integers m and n with n 0

Claim: For all integers x, if x is odd, then x = 4k + 1 or x = 4k 1 for some integer k.