CHAPTER 0. Introduction

Similar documents
Direct Proof and Counterexample I:Introduction

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.

Introducing Proof 1. hsn.uk.net. Contents

Ch 3.2: Direct proofs

HOW TO WRITE PROOFS. Dr. Min Ru, University of Houston

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

3 The language of proof

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

Section 29: What s an Inverse?

Basics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On

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

Direct Proofs. the product of two consecutive integers plus the larger of the two integers

Some Review Problems for Exam 1: Solutions

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. (x 1) 2 > 0.

, p 1 < p 2 < < p l primes.

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

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011

Writing Mathematical Proofs

Mathematical Writing and Methods of Proof

Proofs. Chapter 2 P P Q Q

Mathematical induction

35 Chapter CHAPTER 4: Mathematical Proof

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

Proofs. Chapter 2 P P Q Q

Reading and Writing. Mathematical Proofs. Slides by Arthur van Goetham

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

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

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

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

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

More examples of mathematical. Lecture 4 ICOM 4075

Writing proofs. Tim Hsu, San José State University. May 31, Definitions and theorems 3. 2 What is a proof? 3. 3 A word about definitions 4

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

Introduction to Basic Proof Techniques Mathew A. Johnson

Proof Techniques (Review of Math 271)

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

Section 3.1: Direct Proof and Counterexample 1

Mathematical Induction

PROBLEM SET 3: PROOF TECHNIQUES

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

Preparing for the CS 173 (A) Fall 2018 Midterm 1

1.1 Statements and Compound Statements

Solving Equations by Adding and Subtracting

Homework assignment 1: Solutions

1. Prove that the number cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3).

Logic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

MATH 13 FINAL EXAM SOLUTIONS

Quantifiers and Statements

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1

Stepping stones for Number systems. 1) Concept of a number line : Marking using sticks on the floor. (1 stick length = 1 unit)

Basic Logic and Proof Techniques

CHAPTER 1. REVIEW: NUMBERS

REVIEW PROBLEMS FOR SECOND 3200 MIDTERM

Tutorial on Mathematical Induction

Math 3000 Section 003 Intro to Abstract Math Midterm 1

Constructing and Writing Proofs in Mathematics

Mathematics for Computer Science Exercises from Chapter 3

Properties of Arithmetic

Section 2.3: Statements Containing Multiple Quantifiers

Proofs. 29th January 2014

CH 59 SQUARE ROOTS. Every positive number has two square roots. Ch 59 Square Roots. Introduction

ASSIGNMENT 1 SOLUTIONS

CS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016

What is proof? Lesson 1

Proof techniques (section 2.1)

Provide Computational Solutions to Power Engineering Problems SAMPLE. Learner Guide. Version 3

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

Mathematical Statements

e π i 1 = 0 Proofs and Mathematical Induction Carlos Moreno uwaterloo.ca EIT-4103 e x2 log k a+b a + b

STEP Support Programme. Hints and Partial Solutions for Assignment 1

Computer Science Foundation Exam

Summer Induction Work

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

Solving Systems of Linear Equations with Linear Combinations (The Elimination Method)

Homework 3: Solutions

Ask. Don t Tell. Annotated Examples

Lecture 4: Constructing the Integers, Rationals and Reals

A Guide to Proof-Writing

Discrete Structures Proofwriting Checklist

Meaning of Proof Methods of Proof

Unit 2: Logic and Reasoning. start of unit

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Midterm Preparation Problems

COT 2104 Homework Assignment 1 (Answers)

STRATEGIES OF PROBLEM SOLVING

Spring 2018 Math Week Week 1 Task List

HOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating

Lecture Notes on Inductive Definitions

Why write proofs? Why not just test and repeat enough examples to confirm a theory?

Proofs. An (informal) proof is an essay that will persuade a logical reader that a mathematical theorem is true.

Adding and Subtracting Terms

AQA Level 2 Further mathematics Further algebra. Section 4: Proof and sequences

8. TRANSFORMING TOOL #1 (the Addition Property of Equality)

Solving with Absolute Value

Calculus II (Fall 2015) Practice Problems for Exam 1

Conceptual Explanations: Simultaneous Equations Distance, rate, and time

Lesson 9: Radicals and Conjugates

Conjectures and proof. Book page 24-30

Transcription:

M361 E. Odell

CHAPTER 0 Introduction Mathematics has an advantage over other subjects. Theorems are absolute. They are not subject to further discussion as to their correctness. No sane person can write a paper disputing the Pythagorean theorem and expect to be taken seriously. Once you have proved a theorem, it is forever true. On the other hand your theorem will not be accepted until it is proved. You cannot argue that you have checked 79 right triangles and have always found a 2 + b 2 = c 2 and thus have proved the Pythagorean theorem. Your study of examples is good work and leads you to conjecture that a 2 +b 2 = c 2 in any right triangle. But the result will only be a mathematical conjecture until it is proved. Some conjectures in mathematics have been checked for trillions of cases and mathematicians are 99.9999% certain they are valid but until a proof is supplied they are considered unsolved problems. A theorem is not established until it is proved. The statement in the theorem must be shown to always hold. A proof is a thoroughly convincing explanation, an explanation that leaves no shadow of doubt, as to why something is true. The amount of explanation and detail in this explanation depends upon the audience for the proof. The amount of explanation required between professors might be much less than that required between a professor and a student. Of course a purported theorem (a conjecture) can be shown to be false by the presentation of just one exception to the statement. Let s suppose that your friend Emile says that he has discovered the following two part theorem. Emile s Theorem. A) The sum of any even integer and any odd integer is an odd integer. B) The product of any even integer and any odd integer is an odd integer. Emile, like ALL OF US, is sometimes wrong so you decide the best way to check this out is to try to prove the theorem yourself. For A) you first try to understand the statement by considering some examples: 5 + 4 = 9, 11 + 20 = 31, 2 + 1 = 3. To prove the statement you need to know exactly what it says. This means knowing the definitions. What is an even integer? You could say an even integer is any of the numbers 2, 4, 6, 8,... Is this 3

4 0. INTRODUCTION correct? What about 0? Is 0 even? What about 2or 10? Are they even. Yes, they are. Reading the statement of A) carefully we do not see the words positive even integer (2, 4, 6, 8,...) or nonnegative even integer (0, 2, 4,...). Now, is this listing of all even integers the right description to use in our proof? We could make a similar listing of all odd integers (..., 3, 1, 1, 3, 5,...) but then to establish the result we need to show that if we add any number on the first list to any number on the second we have a number on the second list. We cannot check this by hand or by computer (there are infinitely many cases). So this is not the best definition of even and odd to use. However when you check your notes you see the following definitions: Definition. An integer m is odd if there exists an integer n so that m =2n +1. An integer m is even if there exists an integer n so that m =2n. Now let s give your proof of A): Proof. Let m 1 be an even integer and let m 2 be an odd integer. Then there exist integers n 1 and n 2 so that m 1 =2n 1 and m 2 =2n 2 +1. Som 1 + m 2 =2n 1 +2n 2 +1= 2(n 1 + n 2 )+1. So if n 3 = n 1 + n 2 then m 1 + m 2 =2n 3 +1. n 3 is an integer and so m 1 + m 2 is odd by the definition of odd. Note that your proof required you to choose some notation. You could not let m 1 =2n and m 2 =2n + 1 as one might be tempted to do from the definition. Indeed this would mean that m 2 = m 1 + 1 which would be a restrictive case of the theorem and your proof would not be in full generality. Next you try to understand Theorem B). You first try is 2 3 = 6. You can stop now! You have shown that Theorem B) is false. The statement means that if you multiply any even integer by any odd integer you get an odd integer. But 2 3 = 6 shows this to be false. You investigate further: 4 7 = 28, 9 10 = 90 and you posit a revised Theorem B). The product of an even integer and an odd integer is an even integer. 0.1. Prove Theorem B). 0.2. Formulate and prove an improvement of Theorem B). In this course you will be proving many theorems. While they will often be more difficult than the examples above, the methodology you should use will be similar. First you should know all the definitions and previous results. This may seem impossible but if you have faithfully worked out the problems you will find that you DO know them. Maybe you

0. INTRODUCTION 5 need a peek now and then to refresh your memory but they are your results. You own them. They are friendly companions. The harder you work and the more problems you solve the easier the next problem will be. It may still be hard and challenging but you can do it. Read the theorem. Read it again. Make sure you understand precisely what it says. What is assumed. What must be proved. Try to construct examples that illustrate the theorem. How can you use the hypothesis to deduce the conclusion? When you have finished your proof, review it carefully. What was your argument? How did your use the hypothesis? Did you actually prove what had to be proved? You will likely often find mistakes, glitches, omissions... Rewrite your argument! As first written it probably looks like your cat scratched on the page. You want to make it neat, not just in appearance but in mathematical organization. You will then likely want to rewrite it a third time. Take pride in your work. A well written explanation will serve you well as the course progresses. It makes for easy review and future use. It will be much much easier to present in class. Now all of this takes practice and effort and time. As we go along you will become better and better at it, unless you don t do the work. You cannot expect to succeed on a basketball team unless you attend practice, exercise and keep in shape and play the games. You should always come to class, do the homework in advance of class and come to class prepared to show your solutions. In class when others are presenting you should listen attentively to their arguments. If you don t understand something, ask a question. If you think you see an error, politely point it out. These notes are your pre-text. More will be distributed as needed. This pre-text along with your solutions to the problems will form your text. You are writing you own textbook! Before we start with chapter 1, let s discuss some general things from logic. Many of the theorems/problems you will be asked to prove/solve are of the form (P ) (Q), or (P ) implies (Q). (P )isthehypothesisand(q) is the conclusion. The theorem (P ) (Q) is false only if (P ) holds and (Q) doesnot. Thetheorem(P ) (Q) is actually two statements: (P ) (Q) and(q) (P ) and often you will need to write separate proofs for each part. We read (P ) (Q) as (P ) if and only if (Q). (P )onlyif(q) means (P ) (Q). (P ) if (Q) means (Q) (P ). The converse of (P ) (Q) is(q) (P ). The contrapositive of (P ) (Q) isnotq not (P ). The contrapositive of an implication is logically equivalent to the implication: both are valid or both are false. 0.3. The theorem If John is 6 5 tall then he is smart is true if and only if?. Replace?bythecontrapositive.

6 0. INTRODUCTION Some statements will involve quantifiers. means for all and means there exists. Sometimes these quantifiers may be hidden in a statement. Consider the Theorem. If x is an odd integer then x 2 is an odd integer. This involves the universal quantifier,. it can be restated as (Z denotes the set of all integers) x Z, ifx is odd then x 2 is an odd integer. (Here x Z just means x is an element of the set Z or x is an integer.) 0.4. Prove or disprove each of the following. a) If x is an integer then x 2 > 9 if and only if x>3. b) If 5 > 3 then 4 is an even integer. c) If 5 < 3 then 4 is an odd integer. d) If 5 is an even integer then 4 > 3.