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

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

The Process of Mathematical Proof

Basic Proof Examples

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

Introduction to proofs. Niloufar Shafiei

Proofs. Joe Patten August 10, 2018

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

Readings: Conjecture. Theorem. Rosen Section 1.5

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

Direct Proof and Proof by Contrapositive

9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.

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.

In 1854, Karl Weierstrauss gave an example of a continuous function which was nowhere di erentiable: cos(3 n x) 2 n. sin(3 n x), 2

CSE 1400 Applied Discrete Mathematics Proofs

(4) Using results you have studied, show that if x, y are real numbers,

Proofs. Chapter 2 P P Q Q

Proof by Contradiction

Properties of the Integers

Lecture 2: Proof Techniques Lecturer: Lale Özkahya

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

Chapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures

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

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

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

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Geometry - Chapter 2 Corrective 1

1. Propositions: Contrapositives and Converses

Proofs. Chapter 2 P P Q Q

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH SPRING

Mat 243 Exam 1 Review

Homework 3: Solutions

CSE 20 DISCRETE MATH. Winter

Disjunction/Conjunction Normal Form

MATH CSE20 Homework 5 Due Monday November 4

(3,1) Methods of Proof

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

means is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.

CSC Discrete Math I, Spring Propositional Logic

Recitation 7: Existence Proofs and Mathematical Induction

Some Review Problems for Exam 1: Solutions

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

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

1 The Foundation: Logic and Proofs

Packet #1: Logic & Proofs. Applied Discrete Mathematics

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

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

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

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

1 The Foundation: Logic and Proofs

Quiz 1. Directions: Show all of your work and justify all of your answers.

Foundations of Discrete Mathematics

Tools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:

Foundations of Advanced Mathematics, version 0.8. Jonathan J. White

1.1 Language and Logic

Continuity. Chapter 4

Contribution of Problems

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

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

5 Set Operations, Functions, and Counting

LECTURE 1. Logic and Proofs

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

A Guide to Proof-Writing

Chapter 1 : The language of mathematics.

EECS 1028 M: Discrete Mathematics for Engineers

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University

Foundation of proofs. Jim Hefferon.

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

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

1.1 Language and Logic

CSE 20 DISCRETE MATH. Fall

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

1. Mathematical Proofs

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

CITS2211 Discrete Structures Proofs

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

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

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

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.

Solutions to Assignment 1

CHAPTER 8: EXPLORING R

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

Math.3336: Discrete Mathematics. Proof Methods and Strategy

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

Math 10850, fall 2017, University of Notre Dame

Math 3320 Foundations of Mathematics

MATH 271 Summer 2016 Practice problem solutions Week 1

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.

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction

Continuity. Chapter 4

Midterm Exam Solution

CSE 20 DISCRETE MATH. Winter

Mathematical Reasoning & Proofs

Chapter 1 Elementary Logic

Practice Midterm Exam Solutions

3.6. Disproving Quantified Statements Disproving Existential Statements

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Logical Reasoning. Chapter Statements and Logical Operators

Transcription:

Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition) - Proof by contradiction - Proof by cases - (later) mathematical induction A vacuous proof of an implication happens when the hypothesis of the implication is always false. Example 1 (Vacuous proof) Prove that if x is a positive integer and x = -x, then x 2 = x. proof. An implication is trivially true when its conclusion is always true. A declared mathematical proposition whose truth-value is unknown is called a conjecture. One of the main functions of a mathematician (and a computer scientist) is to decide the truth-value of their claims (or someone else s claims). If a conjecture is proven true we call is a theorem, lemma or corollary; if it proven false, then usually discarded. A proof is a sequence of statements bound together by the rules of logic, definitions, previously proven theorems, simple algebra and axioms. Definition An integer n is even if there exists an integer k such that n = 2k. An integer n is odd if there exists an integer k such that n = 2k + 1. Exercise Give and example of an integer that satisfies the definition and of one that does not satisfy the definition.

Axiom (Closure of addition over the integers) If a and b are integers, then a + b is an integer. Axiom (Closure of multiplication over the integers) If a and b are integers, then a b is an integer. Example 2 Provide a counterexample to the statement that the product of two irrational numbers is irrational. Lemma 1. If n is even, then n 2 is even. Proof Lemma 2. If n 2 is even, then n is even. Proof Theorem 1 An integer n is even if and only if n 2 is even. Proof If n is even, then n 2 is even is true by Lemma 1. The converse, if n 2 is even, then n is even is true by Lemma 2. Hence the biconditional statement n is even if and only if n 2 is even is true. Example 5 Prove that the sum of two odd integers is even. i.e. If p and q are odd integers, then p + q is an even integer. Proof

Summary of the form of 2 techniques. If we are proving p q, then A direct proof begins by assuming p An indirect proof begins by is true. assuming ~q is true. until we conclude q. until we conclude ~p. Example 6 Prove that 2 is irrational. Proof Assume by way of contradiction that 2 can be represented as a quotient of two integers p/q where q is not zero. Further, we assume that p/q is in lowest terms, i.e. we assume that the integers p and q have no common factor. (1) Thus, by assumption 2 = p/q, and now squaring both sides yields 2 p 2 2 2 = or p = 2q (2) 2 q This implies that p 2 is even, and by Theorem 1, p must also be even. So p = 2k for some integer k and substitute into the second equation of (2). Now by cancellation we see that 2 2 q = 2k. (3) This says that q 2 is even, and again by Theorem 1, q must also be even. From statements (2) and (3), it follows that p and q both have 2 as a common factor. (4) Statements (1) and (4) are contradictory. Thus, Summary. If we are proving p q, then A direct proof An indirect proof begins begins by assuming by assuming ~q is true. p is true. until we conclude ~p. until we conclude q. 2 is not rational. An proof by contradiction begins by assuming p ~q is true. until we reach a contradiction

Example 7 Prove that if 3n + 2 is odd, then n is odd. i. Write the proposition in symbolic logic notation. ii. Write the negation of the proposition in symbolic logic notation. iii. Give a proof by contradiction Proof Example 8 Prove that there is an even prime number. x if x 0 Definition. Let x be a real number. Then x = x if x < 0. Example 9 Prove if x is a real number, then -x = x.

Definition. A function fa B is one-to-one if and only if x y ( f(x) = f(y) x = y ), which is logically equivalent to its contrapositive x y ( x y f ( x) f ( y)). Example 10 Prove that the real valued function f(x) = x + 1 is one-to-one. Example 11 Prove the following statements about an integer x are equivalent. (i) 3x+2 is even (ii) x+5 is odd (iii) x 2 is even