Introduction to Basic Proof Techniques Mathew A. Johnson
|
|
- Hilary Brent Neal
- 6 years ago
- Views:
Transcription
1 Introduction to Basic Proof Techniques Mathew A. Johnson Throughout this class, you will be asked to rigorously prove various mathematical statements. Since there is no prerequisite of a formal proof class, I think it is wise to take this time and introduce a few of the basic methods of mathematical proof. The four we shall discuss here are mathematical induction, direct proof, proof by contradiction, and proof by contrapositive. Also, we will briefly discuss the structure of proofs of if and only if statements. For tips on how to write clear mathematical proofs, see an accompanying handout on the course website. 1 Mathematical Induction We have discussed this method in detail in class. Your text also has a nice readable summary of this method. For the sake of completeness, we state the method here and give an example. Principle of Mathematical Induction: Let m Z and let P m, P m+1, P m+2,... represent statements which may be true or false. Then all statements {P j } j=m are true if P m is true and if P k+1 is true whenever P k is true. Notice this statement contains a slight generalization of the principle of mathematical induction described on the first day of class. Mainly, the base case need not always correspond to m = 1. Example 1. Prove that 3 divides n 3 + 2n for all n N. Solution: We are asked to prove a list of statements which can be indexed by the natural numbers, and hence it is natural to use mathematical induction. The base case here corresponds to n = 1, and hence we must verify that 3 divides n 3 +2n = 1+2 = 3, which is true. Now for the induction step: assume that 3 divides n 3 + 2n for some n N. We want to show this implies that 3 divides (n + 1) 3 + 2(n + 1). Well (n + 1) 3 + 2(n + 1) = n 3 + 3n 2 + 3n n + 2 = (n 3 + 2n) + 3 ( n 2 + n + 1 ). Since 3 divides n 3 + 2n by the induction hypothesis and since 3 clearly divides 3 (n 2 + n + 1), it follows that 3 divides (n + 1) 3 + 2(n + 1) as claimed. Thus, the induction step holds and hence the proof is complete by mathematical induction. 1
2 2 Direct Proof This is probably the most used form of proof. The idea is that if you want to show a statement P is true, then you start from known results and use the rules of inference to show that P is true. No logical tricks or gimmicks, just a straight forward brute force attack! Lets illustrate with an example. Example 2. Prove that if n is odd, then n 2 is odd. Solution: If n is odd, then by definition there must be a k Z such that n = 2k + 1 (definition of an odd integer). Substituting this into the expression n 2 gives n 2 = (2k + 1) 2 = 4k 2 + 4k + 1 = 2(2k 2 + 2) + 1. Setting l = 2k and noting that l Z, it follows that n 2 = 2l + 1 and hence n 2 must also be odd, as claimed. Notice in the special case where the statement you want to prove is an implication of the form if P, then Q, written in logic symbols as P Q, then you are essentially proving that the combination that P is true and Q is false never happens!! 3 Proof by Contradiction The method of proof by contradiction works as follows. Suppose you have a particular statement, say P, that you want to show is true. In order to prove P by contradiction, one assumes on the contrary that P is false and tries to prove this assumption leads to some logical contradiction. This method is particularly useful in trying to prove statements of the form if P then Q, i.e. P Q. The method of proof by contradiction would approach this by assuming that the desired result is actually false (here, meaning that P is true but that Q is false) and showing this leads to some sort of logical contradiction. This method is probably best illustrated by an example. Example 3. Prove that 3n + 2 is odd whenever n is odd. Solution: This can be proved by a direct proof similar to that given in the previous section. Here, we wish to provide a proof by contradiction. To this end, we assume that the statement 3n+2 is odd whenever n is odd is false. Well, if this statement is false then there must exist some odd number n for which 3n+2 is not odd, and hence is even 1. Since n is odd (by assumption), there exists a k Z such that n = 2k Indeed, notice this statement can be rephrased as if n is odd, then 3n + 2 is odd, which is in the P = Q form with P meaning n is odd and Q meaning 3n + 2 is odd. 2
3 Substituting this into the expression 3n + 2 we see 3n + 2 = 3(2k + 1) + 2 = 6k + 5 Since 3n + 2 is even (by assumption), there exists a l Z such that 3n + 2 = 2l (definition of an even integer). From above, it follows that 6k + 5 = 2l, which can be rewritten as 2(l 3k) = 5. This latter equality implies that 5 is divisible by 2 and hence that 5 is an even integer, which is clearly false! Thus, our assumption that 3n + 2 was even for some odd n must be false, and hence 3n + 2 must be odd for all odd n, as claimed. Remark 1. Notice that my first step in the above proof was to simply write down the definitions of what means for n to be odd and for 3n + 2 to be even. It is often good practice to begin a proof with simply writing down the definitions of the information that you are given... if nothing else, this always gives you a place to start! Example 4. Prove that if the integer n is odd, then n 2 is odd. Solution: We have already seen a direct proof of this fact. Here, for comparison purposes, we proceed with a proof by contradiction. To this end, we begin by assuming that the implication if n is odd, then n 2 is odd is false. What does this mean? It means that there is some n Z such that n is odd and n 2 is even. If this is true then since n is odd and n 2 is even, there exists k, l Z such that n = 2k + 1 and n 2 = 2l. Substituting n = 2k + 1 into the formula for n 2, it follows that (2k + 1) 2 = 2l which can be expanded to read as 2l = 4k 2 + 4k + 1 = 2(2k 2 + 2k) + 1. Setting j = 2k 2 + 2k and noting that j Z, it follows that 2l = 2j + 1, which is impossible (the left hand side is clearly even, while the right hand side is clearly odd). Thus, our assumption that n 2 is even for some odd n must be false. Therefore, it must be the case that if n is an odd integer, then n 2 is also odd, as claimed. Remark 2. Notice that proofs by contradiction sometimes seem quite circular and difficult to follow. This is essentially because when using a proof by contradiction, you have no clear set goal in mind: you just assume what you want to show is false and then try to show that this leads to some sort of logical contradiction. Thus, when trying to prove an implication if P, then Q, as a rule of thumb (to some 2 ) proofs by contradiction are discouraged. A much better (again, in the opinion of some) technique in this case is to use a proof by contrapositive, which we discuss below. In fact, a common mistake is to write a proof by contradiction that is really a proof by contrapositive in disguise... see Remark 3 below. 2 Not necessarily in the opinion of your professor. 3
4 4 Proof by Contrapositive (or Indirect Proof) We now proceed to consider indirect proofs, which are better known as proofs by contrapositive. To prove an implication if P, then Q, where P and Q are statements, by contrapositive, one assumes that Q is false and tries to prove that P is also false. Notice that if this is true, then it must be that if P is true then Q is true, which is what you originally wanted to prove! Said another way, the statement if P, then Q and the statement if not Q, then not P are logically equivalent!! The benefit of this method over a proof by contradiction is that it provides a very clear goal: while in a proof by contradiction one would assume that P is true and Q is false try to derive some kind of logical contradiction (again, no clear cut goal in mind... you just know that you are trying to derive something which can t possibly be true), when using a proof by contrapositive you assume that Q is false and your goal is to prove that P must also be false. This difference is very subtle, but is an important one. Lets illustrate this method with a few examples. Example 5. Prove that 3n + 2 is odd whenever n is odd. Solution: We saw above how to prove this using contradiction and we now proceed with a proof by contrapositive. To this end, notice that the statement we are trying to prove is if n is odd, then 3n + 2 is odd. Thus, for a proof by contrapositive we begin by assuming that 3n + 2 is not odd, and is hence even. Our goal is then to prove that this implies that n is also not odd, and hence is also even. Since we are assuming that 3n + 2 is even, there exists a k Z such that 3n + 2 = 2k. Thus, 3n = 2(k 1) and hence the product of the numbers 3 and n must be even. Since 3 is odd (it can be written as ), it follows that n must be even as claimed. Thus, whenever the conclusion of the statement if n is odd, then 3n+2 is odd is false the hypothesis must also be false. Therefore, whenever the hypothesis (n is odd) is true the conclusion (3n + 2 is odd) must also be true as claimed. Example 6. Prove that if n Z and n is odd, then n must be even. Solution 1: We will prove this statement first by contradiction and then by contrapositive. We begin with contradiction. To this end, we assume that there exists a n Z such that both n and n are odd. By definition, it follows that there exists k, l Z such that n = 2k + 1 and n = 2l + 1. Substituting n = 2k + 1 into the 4
5 formula for n 3 + 5, it follows that the integers k and l satisfy 2l + 1 = n = (2k + 1) = 8k k 2 + 6k + 6 = 2(4k 3 + 6k 2 + 3k + 3). Setting j = 4k 3 + 6k 2 + 3k + 3 and noting that j Z, it follows that l and j satisfy 2l + 1 = 2j, which is impossible (the left hand side is odd while the right hand side is even). This contradiction implies that our original assumption that n is odd implies n is also odd must be false. Hence, it must be that if n is odd then n must be even, as claimed. Solution 2: Here, we prove the statement by contrapositive. To this end, we assume only that the conclusion that n is even is false, and hence we assume that n is odd, and our goal is to prove this implies that n is even. Since n was assume to be odd, there exists a k Z such that n = 2k + 1 and hence n = (2k + 1) = 8k k 2 + 6k + 6 = 2 ( 4k 3 + 6k 2 + 3k + 3 ). Thus, we see that n must be even and hence whenever n is odd it must be the case that n is even, as claimed. Remark 3. It is often the case that students (and professors!) claim to write a proof by contradiction when in fact what they have written would be better interpreted as a proof by contrapositive. Here is an example where this could arise... Example 7. Prove that if n Z and n is odd, then n must be even. Solution: To illustrate the above remark, I want to provide a proof by contradiction that is actually a proof by contrapositive in disguise. In an effort to form a contradiction, we assume that n is odd and that n is also odd. Since n is assumed to be odd there exists a k Z such that n = 2k + 1 and hence n = (2k + 1) = 8k k 2 + 6k + 6 = 2 ( 4k 3 + 6k 2 + 3k + 3 ). It follows that n is even, which contradicts our assumption that n was odd. This contradiction implies that our original assumption that n is odd implies n
6 is also odd must be false. Hence, if n 3 +5 is ever odd it must be the case that n is even. Now, notice that while the above is technically a completely correct proof by contradiction 3, it is really a proof by contrapositive. Why? Let P denote the statement n 3 +5 is odd and let Q denote the statement n is even so that what we are trying to prove is P Q. In the above proof by contradiction, we began by assuming (as one should in any proof by contradiction) that P is true and that Q is false. However, what we did from this point was to prove that Q being false implies that P can not be true 4. Said differently, we proved that if Q is false then P is false. But this is EXACTLY the strategy of a proof by contrapositive! 5 A Note on If and Only If Proofs Throughout this course, there will be several times when you need to prove a statement of the form P is true if and only if 5 Q is true. Essentially, the statement P Q means that the only way P can be true is if Q is true, and vice versa, and hence you can see why such statements are so important in mathematics. The main observation is that the statement P iff Q is equivalent with both of the statements if P, then Q and if Q, then P being true. Thus, in order to prove P Q it is necessary to prove both of the statements P Q and Q P. Lets illustrate this with an example. Example 8. Prove that the integer n is odd if and only if n 2 is odd. Solution: We must prove both of the statements if n is odd, then n 2 is odd and if n 2 is odd, then n is odd. We begin with the former. If n is odd then there exists a k N such that n = 2k + 1 and hence n 2 = (2k + 1) 2 = 4k 2 + 4k + 1 = 2 ( 2k ) + 1 and hence n is odd as claimed. Now, we must prove the implication if n 2 is odd then n is odd. To do this, we use an indirect proof, i.e. a proof by contrapositive. To this end, we assume that n is even and try to prove that n 2 is also even. Well, if n is even then there exists a m Z such that n = 2m and hence n 2 = (2m) 2 = 4m 2 = 2 ( 2m 2). 3 In particular, students would never lose points for submitting such a proof. 4 Indeed, the assumption that P is true was only used to provide the contradiction, and not in the steps leading up to the contradiction. 5 The phrase if and only if is used so much in mathematics that it is given its own special abbreviations: it is written either as iff or as the symbol. 6
7 Thus, n 2 is also even and hence we have proven the implication if n 2 is odd then n is odd by contrapositive. Remark 4. The above example shows that when proving iff type statements, one often uses different methods of proofs for each implication. Thus, when confronted with and iff type statement, don t be afraid to just start trying various proof techniques until you find one that works for you! 7
3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationContradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationCS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques
CS 30, Winter 2011 Morphology of Proof: An introduction to rigorous proof techniques 1 Methodology of Proof An example Deep down, all theorems are of the form If A then B, though they may be expressed
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
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)
More informationMeaning of Proof Methods of Proof
Mathematical Proof Meaning of Proof Methods of Proof 1 Dr. Priya Mathew SJCE Mysore Mathematics Education 4/7/2016 2 Introduction Proposition: Proposition or a Statement is a grammatically correct declarative
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationModern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked
More informationDay 6. Tuesday May 29, We continue our look at basic proofs. We will do a few examples of different methods of proving.
Day 6 Tuesday May 9, 01 1 Basic Proofs We continue our look at basic proofs. We will do a few examples of different methods of proving. 1.1 Proof Techniques Recall that so far in class we have made two
More informationMath 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution
Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and
More information9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.
Fermat s last theorem CS 220: Discrete Structures and their Applications Theorem: For every integer n > 2 there is no solution to the equation a n + b n = c n where a,b, and c are positive integers Proofs
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationWriting Mathematical Proofs
Writing Mathematical Proofs Dr. Steffi Zegowitz The main resources for this course are the two following books: Mathematical Proofs by Chartrand, Polimeni, and Zhang How to Think Like a Mathematician by
More informationHOW TO WRITE PROOFS. Dr. Min Ru, University of Houston
HOW TO WRITE PROOFS Dr. Min Ru, University of Houston One of the most difficult things you will attempt in this course is to write proofs. A proof is to give a legal (logical) argument or justification
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationElementary Linear Algebra, Second Edition, by Spence, Insel, and Friedberg. ISBN Pearson Education, Inc., Upper Saddle River, NJ.
2008 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. APPENDIX: Mathematical Proof There are many mathematical statements whose truth is not obvious. For example, the French mathematician
More informationmeans 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.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationDirect Proof and Counterexample I:Introduction
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting :
More informationDirect Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting statement:
More informationProof by contrapositive, contradiction
Proof by contrapositive, contradiction Margaret M. Fleck 9 September 2009 This lecture covers proof by contradiction and proof by contrapositive (section 1.6 of Rosen). 1 Announcements The first quiz will
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationMathematical Writing and Methods of Proof
Mathematical Writing and Methods of Proof January 6, 2015 The bulk of the work for this course will consist of homework problems to be handed in for grading. I cannot emphasize enough that I view homework
More informationCHAPTER 4 SOME METHODS OF PROOF
CHAPTER 4 SOME METHODS OF PROOF In all sciences, general theories usually arise from a number of observations. In the experimental sciences, the validity of the theories can only be tested by carefully
More informationCS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016
CS 173: Induction Madhusudan Parthasarathy University of Illinois at Urbana-Champaign 1 Induction February 7, 016 This chapter covers mathematical induction, and is an alternative resource to the one in
More informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More informationProof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:
Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a
More informationMCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof
MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationMAT 300 RECITATIONS WEEK 7 SOLUTIONS. Exercise #1. Use induction to prove that for every natural number n 4, n! > 2 n. 4! = 24 > 16 = 2 4 = 2 n
MAT 300 RECITATIONS WEEK 7 SOLUTIONS LEADING TA: HAO LIU Exercise #1. Use induction to prove that for every natural number n 4, n! > 2 n. Proof. For any n N with n 4, let P (n) be the statement n! > 2
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More informationIntroduction to Metalogic 1
Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,
More informationManual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
More informationWhat is a proof? Proofing as a social process, a communication art.
Proof Methods What is a proof? Proofing as a social process, a communication art. Theoretically, a proof of a mathematical statement is no different than a logically valid argument starting with some premises
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationSets and Logic Linear Algebra, Spring 2012
Sets and Logic Linear Algebra, Spring 2012 There is a certain vocabulary and grammar that underlies all of mathematics, and mathematical proof in particular. Mathematics consists of constructing airtight
More informationAnnouncements. Problem Set 1 out. Checkpoint due Monday, September 30. Remaining problems due Friday, October 4.
Indirect Proofs Announcements Problem Set 1 out. Checkpoint due Monday, September 30. Grade determined by attempt rather than accuracy. It's okay to make mistakes we want you to give it your best effort,
More informationSec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs
Section 1.7 Sec$on Summary Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction 2 Proofs of Mathema$cal Statements
More informationPROBLEM SET 3: PROOF TECHNIQUES
PROBLEM SET 3: PROOF TECHNIQUES CS 198-087: INTRODUCTION TO MATHEMATICAL THINKING UC BERKELEY EECS FALL 2018 This homework is due on Monday, September 24th, at 6:30PM, on Gradescope. As usual, this homework
More informationProof: If (a, a, b) is a Pythagorean triple, 2a 2 = b 2 b / a = 2, which is impossible.
CS103 Handout 07 Fall 2013 October 2, 2013 Guide to Proofs Thanks to Michael Kim for writing some of the proofs used in this handout. What makes a proof a good proof? It's hard to answer this question
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
More informationBasics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On
Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen
More informationFILE NAME: PYTHAGOREAN_TRIPLES_012-( WED).DOCX AUTHOR: DOUG JONES
FILE NAME: PYTHAGOREAN_TRIPLES_01-(0090107WED.DOCX AUTHOR: DOUG JONES A. BACKGROUND & PURPOSE THE SEARCH FOR PYTHAGOREAN TRIPLES 1. Three positive whole numbers ( a,b,c which are such that a + b = c are
More information4 Derivations in the Propositional Calculus
4 Derivations in the Propositional Calculus 1. Arguments Expressed in the Propositional Calculus We have seen that we can symbolize a wide variety of statement forms using formulas of the propositional
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationMath 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes
Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes Written by Santiago Cañez These are notes which provide a basic summary of each lecture for Math 300, Foundations of Higher
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.
Formal Methods Name: Key Midterm 2, Spring, 2007 Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.. Determine whether each of
More information1. Propositions: Contrapositives and Converses
Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement
More informationCS1800: Mathematical Induction. Professor Kevin Gold
CS1800: Mathematical Induction Professor Kevin Gold Induction: Used to Prove Patterns Just Keep Going For an algorithm, we may want to prove that it just keeps working, no matter how big the input size
More informationLECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationCheckpoint Questions Due Monday, October 1 at 2:15 PM Remaining Questions Due Friday, October 5 at 2:15 PM
CS103 Handout 03 Fall 2012 September 28, 2012 Problem Set 1 This first problem set is designed to help you gain a familiarity with set theory and basic proof techniques. By the time you're done, you should
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.
Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth
More informationMathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.
Mathematical Reasoning Rules of Inference & Mathematical Induction Example. If I take the day off it either rains or snows 2. When It rains, my basement floods 3. When the basement floods or it snows,
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationSolution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
More informationCSCE 222 Discrete Structures for Computing. Proofs. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Proofs Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 What is a Proof? A proof is a sequence of statements, each of which is either assumed, or follows
More informationMI 4 Mathematical Induction Name. Mathematical Induction
Mathematical Induction It turns out that the most efficient solution to the Towers of Hanoi problem with n disks takes n 1 moves. If this isn t the formula you determined, make sure to check your data
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More informationTIPS FOR WRITING PROOFS IN HOMEWORK ASSIGNMENTS. 1. Simple rules
TIPS FOR WRITING PROOFS IN HOMEWORK ASSIGNMENTS MARK SKANDERA 1 Simple rules I require my students to follow the rules below when submitting problem sets While other instructors may be more lenient than
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationOutline for Today. What is an Implication? Negations and their Applications. Proof by Contrapositive. Proof by Contradiction
Indirect Proofs Outline for Today What is an Implication? Understanding a key type of mathematical statement. Negations and their Applications How do you show something is not true? Proof by Contrapositive
More informationCh 3.2: Direct proofs
Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informatione π i 1 = 0 Proofs and Mathematical Induction Carlos Moreno uwaterloo.ca EIT-4103 e x2 log k a+b a + b
Proofs and Mathematical Induction Carlos Moreno cmoreno @ uwaterloo.ca EIT-4103 N k=0 log k 0 e x2 e π i 1 = 0 dx a+b a + b https://ece.uwaterloo.ca/~cmoreno/ece250 Proofs and Mathematical Induction Today's
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationTechniques for Proof Writing
Appendix B Techniques for Proof Writing This guide includes some things that I like to keep in mind when I am writing proofs. They will hopefully become second-nature after a while, but it helps to actively
More informationA Brief Introduction to Proofs
A Brief Introduction to Proofs William J. Turner October, 010 1 Introduction Proofs are perhaps the very heart of mathematics. Unlike the other sciences, mathematics adds a final step to the familiar scientific
More informationProving Programs Correct
Proving Programs Correct Page 1 of 9 Proving Programs Correct How can we be sure that a piece of code does what we want it to do? One way is to try testing the code on a large group of data. Another is
More informationDay 5. Friday May 25, 2012
Day 5 Friday May 5, 01 1 Quantifiers So far, we have done math with the expectation that atoms are always either true or false. In reality though, we would like to talk about atoms like x > Whose truth
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationMATH 135 Fall 2006 Proofs, Part IV
MATH 135 Fall 006 s, Part IV We ve spent a couple of days looking at one particular technique of proof: induction. Let s look at a few more. Direct Here we start with what we re given and proceed in a
More information- 1.2 Implication P. Danziger. Implication
Implication There is another fundamental type of connectives between statements, that of implication or more properly conditional statements. In English these are statements of the form If p then q or
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 5
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes wish to work over a
More informationFoundations of Advanced Mathematics, version 0.8. Jonathan J. White
Foundations of Advanced Mathematics, version 0.8 Jonathan J. White 1/4/17 2 Chapter 1 Basic Number Theory and Logic Forward These notes are intended to provide a solid background for the study of abstract
More informationOutline for Today. What is an Implication? Negations and their Applications. Proof by Contrapositive. Proof by Contradiction
Indirect Proofs Outline for Today What is an Implication? Understanding a key type of mathematical statement. Negations and their Applications How do you show something is not true? Proof by Contrapositive
More informationMathematical Induction
Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values
More informationLecture 5 : Proofs DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/3/2011 Lecture 5 : Proofs Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Up until now, we have been introducing mathematical notation
More informationIntroduction to Proofs
Introduction to Proofs Many times in economics we will need to prove theorems to show that our theories can be supported by speci c assumptions. While economics is an observational science, we use mathematics
More informationMathematical Induction
Chapter 6 Mathematical Induction 6.1 The Process of Mathematical Induction 6.1.1 Motivating Mathematical Induction Consider the sum of the first several odd integers. produce the following: 1 = 1 1 + 3
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationDefinitions Chapter 1 Proof Technique (Pg.1): Proof (Pg.2): Statement (Pg.2): Conditional Statement/Implication (Pg3.): Hypothesis(Pg.
Definitions Chapter 1 Proof Technique (Pg.1): Any method for proving that the statement A implies B is true. Proof (Pg.2): A convincing argument expressed in the language of mathematics that a statement
More informationResearch Methods in Mathematics Homework 4 solutions
Research Methods in Mathematics Homework 4 solutions T. PERUTZ (1) Solution. (a) Since x 2 = 2, we have (p/q) 2 = 2, so p 2 = 2q 2. By definition, an integer is even if it is twice another integer. Since
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
More informationGuide to Proofs on Discrete Structures
CS103 Handout 17 Spring 2018 Guide to Proofs on Discrete Structures In Problem Set One, you got practice with the art of proofwriting in general (as applied to numbers, sets, puzzles, etc.) Problem Set
More informationCITS2211 Discrete Structures Proofs
CITS2211 Discrete Structures Proofs Unit coordinator: Rachel Cardell-Oliver August 13, 2017 Highlights 1 Arguments vs Proofs. 2 Proof strategies 3 Famous proofs Reading Chapter 1: What is a proof? Mathematics
More informationTopic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
More informationReading and Writing. Mathematical Proofs. Slides by Arthur van Goetham
Reading and Writing Mathematical Proofs Slides by Arthur van Goetham What is a proof? Why explanations are not proofs What is a proof? A method for establishing truth What establishes truth depends on
More informationTutorial on Mathematical Induction
Tutorial on Mathematical Induction Roy Overbeek VU University Amsterdam Department of Computer Science r.overbeek@student.vu.nl April 22, 2014 1 Dominoes: from case-by-case to induction Suppose that you
More informationAssignment 3 Logic and Reasoning KEY
Assignment 3 Logic and Reasoning KEY Print this sheet and fill in your answers. Please staple the sheets together. Turn in at the beginning of class on Friday, September 8. Recall this about logic: Suppose
More informationDiscrete Mathematics and Probability Theory Fall 2014 Anant Sahai Midterm 1
EECS 70 Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Midterm 1 Exam location: 10 Evans, Last name starting with A-B or R-T PRINT your student ID: PRINT AND SIGN your name:, (last)
More informationFINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
More informationCS 340: Discrete Structures for Engineers
CS 340: Discrete Structures for Engineers Instructor: Prof. Harry Porter Office: FAB 115-06 harry@cs.pdx.edu Hours: Mon 3-4, Wed 3-4, or by appointment Website: web.cecs.pdx.edu/~harry/discrete Class Mailing
More information