# CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

Download "CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs"

## Transcription

1 CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce one statement from others. A theorem is a proposition that can be proved using definitions, axioms, other theorems, and rules of inference. In most of the mathematics classes that are prerequisites to this course, such as calculus, the main emphasis is on using facts and theorems to solve problems. Theorems were often stated, and you were probably shown a few proofs. But it is very possible you have never been asked to prove a theorem on your own. In this module we introduce the basic structures involved in a mathematical proof. One of our main objectives from here on out is to have you develop skills in recognizing a valid argument and in constructing valid mathematical proofs. When you are first shown a proof that seemed rather complex you may think to yourself How on earth did someone figure out how to go about it that way? As we will see in this chapter and the next, a proof must follow certain rules of inference, and there are certain strategies and methods of proof that are best to use for proving certain types of assertions. It is impossible, however, to give an exhaustive list of strategies that will cover all possible situations, and this is what makes mathematics so interesting. Indeed, there are conjectures that mathematicians have spent much of their professional lives trying to prove (or disprove) with little or no success More Terminology. A lemma is a pre-theorem or a result which is needed to prove a theorem. A corollary is a post-theorem or a result which follows from a theorem (or lemma or another corollary). 56

2 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 57 The terms lemma and corollary are just names given to theorems that play particular roles in a theory. Most people tend to think of a theorem as the main result, a lemma a smaller result needed to get to the main result, and a corollary as a theorem which follows relatively easily from the main theorem, perhaps as a special case. For example, suppose we have proved the Theorem: If the product of two integers m and n is even, then either m is even or n is even. Then we have the Corollary: If n is an integer and n 2 is even, then n is even. Notice that the Corollary follows from the Theorem by applying the Theorem to the special case in which m = n. There are no firm rules for the use of this terminology; in practice, what one person may call a lemma another may call a theorem. Any mathematical theory must begin with a collection of undefined terms and axioms that give the properties the undefined terms are assumed to satisfy. This may seem rather arbitrary and capricious, but any mathematical theory you will likely encounter in a serious setting is based on concrete ideas that have been developed and refined to fit into this setting. To justify this necessity, see what happens if you try to define every term. You define a in terms of b, and then you define b in terms of c, etc. If a, b, c,... are all different terms, you are lead to an infinite chain of definitions; otherwise, one of them is repeated and you are left with a circular chain of definitions. Neither of these alternatives is logically acceptable. A similar criticism can be made for any attempt to prove every assertion. Here are a few important examples of mathematical systems and their basic ingredients. In plane geometry one takes point and line as undefined terms and assumes the five axioms of Euclidean geometry. In set theory, the concept of a set and the relation is an element of, or, are left undefined. There are five basic axioms of set theory, the so-called Zermelo- Fraenkel axioms, which we will use informally in this course, rather than giving them a rigorous exposition. In particular, these axioms justify the set builder notation we discussed in Module 1.1: Sets and the existence of the power set of a set, which we shall discuss later in Module 4.1: Set Operations. The real number system begins with the four Peano Postulates for the positive integers, taking the elements, numbers, in the set of positive integers as undefined, as well as the relation is a successor of between positive integers. (To say x is a successor of y turns out to mean that x = y + 1.) The fourth Peano Postulate is the Principle of Mathematical Induction, which we shall use extensively in the next module. From these modest beginnings, and with a little help from set theory, one can construct the entire set of real numbers, including its order and completeness properties. As with our treatment of set theory, we shall, with the one exception mentioned above, use these axioms informally, assuming the familiar model of the real

3 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 58 number line together with its important subsets, the natural numbers, the integers, and the rational numbers. Once we have the undefined terms and axioms for a mathematical system, we can begin defining new terms and proving theorems (or lemmas, or corollaries) within the system Formal Proofs. To prove an argument is valid: Assume the hypotheses are true. Use the rules of inference and logical equivalences to show that the conclusion is true. What is a proof? A proof is a demonstration, or argument, that shows beyond a shadow of a doubt that a given assertion is a logical consequence of our axioms and definitions. Thus, in any problem in which you are asked to provide a proof, your solution will not simply be a short answer that you circle. There are certain rules that must be followed (which we will get to shortly), and certain basic knowledge must be assumed. For example, one may assume the axioms and any previously stated theorems (unless the instructions state otherwise). A large number of proofs simply involve showing that a certain definition is satisfied. In almost every case, the assertions we will be proving are of the form if p, then q, where p and q are (possibly compound) propositions. The proposition p is the hypothesis and q is the conclusion. It is almost always useful to translate a statement that must be proved into an if..., then... statement if it is not already in that form. To begin a proof we assume the hypotheses. For example, consider the argument Every dog will have his day. Fido is a dog. Therefore, Fido will have his day. The hypotheses of this argument are Every dog will have his day and Fido is a dog. The conclusion is Fido will have his day.

4 1.4. Rules of Inference. 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 59 Modus Ponens or the Law of Detachment Disjunction Introduction Conjunction Elimination p p q..q p..p q p q..p Modus Tollens q p q Hypothetical Syllogism Disjunctive Syllogism Conjunction Introduction.. p p q q r..p r p q p..q p q..p q Constructive Dilemma (p q) (r s) p r..q s An argument is valid if it is uses only the given hypotheses together with the axioms, definitions, previously proven assertions, and the rules of inference, which are listed above. In those rules in which there is more than one hypothesis, the order

5 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 60 of the hypotheses is not important. For example, modus tollens could be just as well stated: p q q.. p The notation used in these slides is commonly used in logic to express an argument symbolically. The proposition(s) before the horizontal line are the hypotheses and the proposition below the line is the conclusion. The symbol.. is a common shorthand for therefore. Each of the rules of inference is a tautology expressed in a different form. For example, the rule of modus ponens, when stated as a propositional form, is the tautology [p (p q)] q. (This can be verified using a truth table.) Remark An argument of the form h 1 is valid if and only if the proposition [h 1 h 2 h n ] c is a tautology Example h 2. h n..c Example The following is a valid logical argument: 1. If the dog eats the cat food or scratches at the door, then the parrot will bark. 2. If the cat eats the parrot, then the parrot will not bark. 3. If the cat does not eat the parrot, then it will eat the cat food. 4. The cat did not eat the cat food. 5. Therefore, the dog does not eat the cat food either. Here is how the hypotheses give us the conclusion:

6 1. LOGICAL ARGUMENTS AND FORMAL PROOFS Assign propositional variables to the component propositions in the argument: d the dog eats the cat food s the dog scratches at the door p the parrot will bark c the cat eats the parrot e the cat eats the cat food 2. Represent the formal argument using the variables: (d s) p c p c e e.. d 3. Use the hypotheses, the rules of inference, and any logical equivalences to prove that the argument is valid: Assertion Reason 1. c e hypothesis 3 2. e hypothesis 4 3. c steps 1 and 2 and modus tollens 4. c p hypothesis 2 5. p steps 3 and 4 and modus ponens 6. (d s) p hypothesis 1 7. (d s) steps 5 and 6 and modus tollens 8. d s step 7 and De Morgan s law 9. d step 8 and conjunction elimination We could also determine if the argument is valid by checking if the proposition [((d s) p) (c p) ( c e) ( e)] ( d) is a tautology. In practice, though, it is more useful to recognize if the rules of inference have been applied appropriately or if one of the common fallacies have been used to determine if an argument is valid or not. It will serve you better later on to understand the two column proof of a valid argument and to recognize how the rules of inference are applied. Exercise Give a formal proof that the following argument is valid. Provide reasons.

7 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 62 a b c b a..c Exercise Determine whether the following argument is valid. Give a formal proof. Provide reasons. ( p q) z s s (p q) z r..r

8 1. LOGICAL ARGUMENTS AND FORMAL PROOFS Rules of Inference for Quantifiers. Universal Instantiation xp (x)..p (c) Universal Generalization P (c) for arbitrary member, c, of the universe.. xp (x) Existential Generalization P (c) for some member, c, of the universe.. xp (x) Existential Instantiation xp (x)..p (c) Here is the list of additional rules of inference related to quantifiers. The symbol c represents some particular element from the universe of discourse for the variable x. In Universal Instantiation, c may be any element from the universe of discourse for x. For example, suppose the universe of discourse is the set of real numbers, and P (x) is the predicate x 2 0. Since x 2 0 for all x, we may conclude (a b) 2 0 for arbitrary real numbers a and b. Here, c = a b. We may also conclude ( π) 2 0. In Existential Instantiation, c must be chosen so that P (c) is true. For example, suppose the universe of discourse is the set of integers, and let P (x) be the predicate, x is a divisor of and 1 < x < Then xp (x) is a true statement (e.g., P (3)). We may then assume c is a divisor of and 1 < c < for some integer c.

9 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 64 Sometimes we may know a statement of the form xp (x) is true, but we may not know exactly for what x in the domain of discourse gives us that this is true. In a proof when we know the truth of xp (x) we can define a variable, say c, to stand for a fixed element of the domain where P (c) is true. This is what Existential Instantiation gives you. An example in which we have this situation is by using the Intermediate Value Theorem from algebra. Let f : R R be the polynomial f(x) = 3x 4 + x 3 + 2x + 1. Since f(1) = 1, f(2) = 35, and f is continuous, there must be a solution to f(x) = 0 in the interval [1, 2]. It may not possible to find this solution algebraically, though, and may only be possible to numerically approximate the root. However, if we needed to use the solution for some purpose we could simply say let c [1, 2] be such that f(c) = 0 and this fixes c as the solution we know exists in [1, 2]. Universal Generalization is a subtle and very useful rule and the meaning may not be clear to you yet. The variable x stands for any arbitrary element of the universe of discourse. You only assume x is a member of the universe and do not place any further restrictions on x. If you can show P (x) is true, then it will also be true for any other object satisfying the same properties you ve claimed for x. In other words, P (x) is true for all the members of the universe, xp (x). You will see a standard approach in proving statements about sets is to use Universal Generalization Example Example Here is a simple argument using quantifiers. 1. Every dog will have his day. 2. Fido is a dog. 3. Therefore, Fido will have his day. To verify this is a valid argument we use the same technique as before. Define the predicates M(x): x is a dog D(x): x has his day and let F represent Fido, a member of the universe of discourse. The argument becomes

10 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 65 x[m(x) D(x)] M(F )..D(F ) The proof is 1. x[m(x) D(x)] hypothesis 1 2. M(F ) D(F ) step 1 and universal instantiation 3. M(F ) hypothesis 2 4. D(F ) steps 2 and 3 and modus ponens Exercise Determine whether the following argument is valid or invalid. Give a formal proof. Provide reasons. There is someone in this class who has taken Calculus III. Everyone who takes Calculus III also takes Physics (concurrently). Therefore, someone in this class has taken Physics Fallacies. The following are not valid argument forms. Affirming the Consequent Denying the Antecedent Begging the Question or Circular Reasoning p q q..p p q p.. q Use the truth of the consequent in the argument There are several common mistakes made in trying to create a proof. Here we list three of the most common fallacies or errors in logic. Since they are not valid arguments, obviously you should not use them in a proof. Just as important, you should be able to recognize one of them if you were to encounter it in someone else s argument.

11 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 66 The fallacy of affirming the consequent occurs when the converse of a premise is used to prove a statement. For example, here is an argument using the fallacy of affirming the consequent. Example If Jack lands the new account, then he will get a raise. Jack got a raise. Therefore, he landed the new account. Note that [(p q) q] p] is not a tautology, so this is not a valid argument. The if..., then... statement is not equivalent to its converse. In the above example, just because Jack got a raise, you can t conclude from the hypothesis that he landed the new account. The fallacy of denying the antecedent comes from the fact that an implication is not equivalent to its inverse. Here is an example of incorrect reasoning using the fallacy of denying the antecedent: Example If the cat is purring, then he ate the canary. purring. Therefore, the cat didn t eat the canary. The cat is not In this example, the hypothesis does not allow you to conclude anything if the cat is not purring, only if he is purring. The fallacy results from the fact that the propositional form [(p q) p] q is not a tautology. Begging the question, or circular reasoning, occurs when the conclusion itself is used in the proof. Here is an example of this type of fallacy: Example Prove: If xy is divisible by 5, then x is divisible by 5 or y is divisible by 5. Incorrect Proof: If xy is divisible by 5, then xy = 5k for some k. Then x = 5l for some l, or y = 5l for some l. Hence, x is divisible by 5 or y is divisible by 5. This argument breaks down once we assert, without justification, that either x = 5l for some l, or y = 5l for some l. This, of course, is what we are trying to prove, and it doesn t follow directly from xy = 5k. Exercise Give a careful proof of the statement: For all integers m and n, if m is odd and n is even, then m + n is odd. Example Prove: for all real x, x < x + 1.

12 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 67 Proof. First we fix an arbitrary real number: Let x R. We wish to show x < x+1. This inequality is equivalent to 0 < (x+1) x. But by the commutative and associative properties of real numbers this inequality is equivalent to 0 < 1 + (x x) or equivalently, 0 < 1. We know the last inequality is true and so the equivalent expression x < x + 1 is also true. In the previous example we took the expression we wished to show was true and rewrote it several times until we reached an expression that we knew to be true. This is a useful tool but one must be extremely cautious in using this technique. Notice we did not actually assume what we wished to prove. Instead, we used equivalences to rephrase what we needed to show. Example Now, here is an incorrect proof of the same statement in Exercise This proof would be marked wrong. Incorrect proof of Exercise Let x R. Then x < x < (x + 1) x 0 < (x x) < 1 by the associative and commutative properties of real numbers We know 0 < 1. Exercise Consider the following hypotheses: If the car does not start today, then I will not go to class. If I go to class today then I will take the quiz. If I do not take the quiz today then I will ask the teacher for an extra credit assignment. I asked the teacher for an extra credit assignment. Determine whether each of the following are valid or invalid conclusions of the above hypotheses. Why or why not? (1) I did not go to class today. (2) Remove the hypothesis I asked the teacher for an extra credit assignment from the above assumptions. Can one now conclude If the car does not start today, then I will ask the teacher for an extra credit assignment for the remaining assumptions? Exercise Find the error in the proof of the following statement.

13 1. LOGICAL ARGUMENTS AND FORMAL PROOFS 68 Suppose x is a positive real number. Claim: the sum of x and its reciprocal is greater than or equal to 2. Incorrect proof. Multiplying by x we get x x. By algebra, x 2 2x Thus (x 1) 2 0. Any real number squared is greater than or equal to 0, so x2 +1 x 2 is true. Exercise Find the fallacy associated with the following: Problem: Solve for x given the equation x + x a = 2, where a is a real number. Incorrect Solution : The given equation also implies that 1 x + x a = 1 2, so x x a = a x + x a = a 2. Adding the original equation with this one gives 2 x = 2 + (a/2) and thus x = (1 + a 4 )2. Notice, however, if a = 8 then x = 9 according to the solution, but this does not satisfy the original equation.

### Inference Rules and Proof Methods

Inference Rules and Proof Methods Winter 2010 Introduction Rules of Inference and Formal Proofs Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument

### Chapter I Logic and Proofs

MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than

### The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

### def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### LOGICAL INFERENCE & PROOFs. Debdeep Mukhopadhyay Dept of CSE, IIT Madras

LOGICAL INFERENCE & PROOFs Debdeep Mukhopadhyay Dept of CSE, IIT Madras Defn A theorem is a mathematical assertion which can be shown to be true. A proof is an argument which establishes the truth of a

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### 1.5 Methods of Proof INTRODUCTION

1.5 Methods of Proof INTRODUCTION Icon 0049 Two important questions that arise in the study of mathematics are: (1) When is a mathematical argument correct? (2) What methods can be used to construct mathematical

### What is logic? Propositional Logic. Negation. Propositions. This is a contentious question! We will play it safe, and stick to:

Propositional Logic This lecture marks the start of a new section of the course. In the last few lectures, we have had to reason formally about concepts. This lecture introduces the mathematical language

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

### CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers

CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### Rules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05

Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example Re-Revisited Our Old Example: Suppose we have: All human beings

### CHAPTER 2. Inequalities

CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential

### n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

### Definition 10. A proposition is a statement either true or false, but not both.

Chapter 2 Propositional Logic Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. (Lewis Carroll, Alice s Adventures

### It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

### Logic will get you from A to B. Imagination will take you everywhere.

Chapter 3 Predicate Logic Logic will get you from A to B. Imagination will take you everywhere. A. Einstein In the previous chapter, we studied propositional logic. This chapter is dedicated to another

### vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

### Logic, Sets, and Proofs

Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical

### Review Name Rule of Inference

CS311H: Discrete Mathematics Review Name Rule of Inference Modus ponens φ 2 φ 2 Modus tollens φ 2 φ 2 Inference Rules for Quantifiers Işıl Dillig Hypothetical syllogism Or introduction Or elimination And

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### Logic and Incidence Geometry

Logic and Incidence Geometry February 27, 2013 1 Informal Logic Logic Rule 0. No unstated assumption may be used in a proof. 2 Theorems and Proofs If [hypothesis] then [conclusion]. LOGIC RULE 1. The following

### 31 is a prime number is a mathematical statement (which happens to be true).

Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### PRINCIPLE OF MATHEMATICAL INDUCTION

Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION Analysis and natural philosophy owe their most important discoveries to this fruitful means, which is called induction Newton was indebted to it for his theorem

### Chapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.

Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to

### Discrete Mathematics Lecture 1 Logic of Compound Statements. Harper Langston New York University

Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University Administration Class Web Site http://cs.nyu.edu/courses/summer05/g22.2340-001/ Mailing List Subscribe at

### Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

### Introduction to mathematical arguments

Introduction to mathematical arguments (background handout for courses requiring proofs) by Michael Hutchings A mathematical proof is an argument which convinces other people that something is true. Math

### 2. Propositional Equivalences

2. PROPOSITIONAL EQUIVALENCES 33 2. Propositional Equivalences 2.1. Tautology/Contradiction/Contingency. Definition 2.1.1. A tautology is a proposition that is always true. Example 2.1.1. p p Definition

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### Chapter 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

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

### Likewise, we have contradictions: formulas that can only be false, e.g. (p p).

CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula

### Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

### Even Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.

MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation

### Formula Sheet. 1 The Three Defining Properties of Real Numbers

Formula Sheet 1 The Three Defining Properties of Real Numbers For all real numbers a, b and c, the following properties hold true. 1. The commutative property: a + b = b + a ab = ba. The associative property:

Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior

### Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

### Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

### Mathematical Induction

Chapter 4 Mathematical Induction 4.1 The Principle of Mathematical Induction Preview Activity 1 (Exploring Statements of the Form.8n N/.P.n//) One of the most fundamental sets in mathematics is the set

### Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

### Chapter 1 LOGIC AND PROOF

Chapter 1 LOGIC AND PROOF To be able to understand mathematics and mathematical arguments, it is necessary to have a solid understanding of logic and the way in which known facts can be combined to prove

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### Discrete Mathematics

Slides for Part IA CST 2014/15 Discrete Mathematics Prof Marcelo Fiore Marcelo.Fiore@cl.cam.ac.uk What are we up to? Learn to read and write, and also work with, mathematical

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method

### Mathematical Induction. Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition)

Mathematical Induction Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition) Mathmatical Induction Mathmatical induction can be used to prove statements that assert that P(n) is true for all positive

### CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo

Propositional Logic CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 37 Discrete Mathematics What is Discrete

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### 7.1 An Axiomatic Approach to Mathematics

Chapter 7 The Peano Axioms 7.1 An Axiomatic Approach to Mathematics In our previous chapters, we were very careful when proving our various propositions and theorems to only use results we knew to be true.

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

### CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 2 Logic: Predicate Calculus 1 Outline Predicates Quantifiers Binding Applications Logical Equivalences 2 Predicates In mathematics arguments, we will often see sentences

### Reading, Discovering and Writing Proofs Version 1.0. c Faculty of Mathematics, University of Waterloo

Reading, Discovering and Writing Proofs Version 1.0 c Faculty of Mathematics, University of Waterloo Contents I Introduction to Proof Methods 9 1 In the beginning 10 1.1 What Makes a Mathematician a Mathematician?..............

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### Mathematics Georgia Performance Standards

Mathematics Georgia Performance Standards K-12 Mathematics Introduction The Georgia Mathematics Curriculum focuses on actively engaging the students in the development of mathematical understanding by

### The Mean Value Theorem

The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers

### Predicate in English. Predicates and Quantifiers. Propositional Functions: Prelude. Predicate in Logic. Propositional Function

Predicates and Quantifiers By Chuck Cusack Predicate in English In English, a sentence has 2 parts: the subject and the predicate. The predicate is the part of the sentence that states something about

### Math 3000 Running Glossary

Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (

### Axiom A.1. Lines, planes and space are sets of points. Space contains all points.

73 Appendix A.1 Basic Notions We take the terms point, line, plane, and space as undefined. We also use the concept of a set and a subset, belongs to or is an element of a set. In a formal axiomatic approach

### Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

### Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

### LAKE ELSINORE UNIFIED SCHOOL DISTRICT

LAKE ELSINORE UNIFIED SCHOOL DISTRICT Title: PLATO Algebra 1-Semester 2 Grade Level: 10-12 Department: Mathematics Credit: 5 Prerequisite: Letter grade of F and/or N/C in Algebra 1, Semester 2 Course Description:

### Properties of Real Numbers

16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should

### CSI 2101 Discrete Structures Winter 2012

CSI 2101 Discrete Structures Winter 2012 Prof. Lucia Moura University of Ottawa Homework Assignment #1 (100 points, weight 5%) Due: Thursday Feb 9, at 1:00 p.m. (in lecture); assignments with lateness

### If f is a 1-1 correspondence between A and B then it has an inverse, and f 1 isa 1-1 correspondence between B and A.

Chapter 5 Cardinality of sets 51 1-1 Correspondences A 1-1 correspondence between sets A and B is another name for a function f : A B that is 1-1 and onto If f is a 1-1 correspondence between A and B,

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### Predicate Logic. Lucia Moura. Winter Predicates and Quantifiers Nested Quantifiers Using Predicate Calculus

Predicate Logic Winter 2010 Predicates A Predicate is a declarative sentence whose true/false value depends on one or more variables. The statement x is greater than 3 has two parts: the subject: x is

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### DISCRETE MATH: LECTURE 3

DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false

### Midterm Examination 1 with Solutions - Math 574, Frank Thorne Thursday, February 9, 2012

Midterm Examination 1 with Solutions - Math 574, Frank Thorne (thorne@math.sc.edu) Thursday, February 9, 2012 1. (3 points each) For each sentence below, say whether it is logically equivalent to the sentence

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### Mathematical Induction

Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

### COMP 250 Fall Mathematical induction Sept. 26, (n 1) + n = n + (n 1)

COMP 50 Fall 016 9 - Mathematical induction Sept 6, 016 You will see many examples in this course and upcoming courses of algorithms for solving various problems It many cases, it will be obvious that

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### Fundamentals of Mathematics Lecture 6: Propositional Logic

Fundamentals of Mathematics Lecture 6: Propositional Logic Guan-Shieng Huang National Chi Nan University, Taiwan Spring, 2008 1 / 39 Connectives Propositional Connectives I 1 Negation: (not A) A A T F

### Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

### 1 Proposition, Logical connectives and compound statements

Discrete Mathematics: Lecture 4 Introduction to Logic Instructor: Arijit Bishnu Date: July 27, 2009 1 Proposition, Logical connectives and compound statements Logic is the discipline that deals with the

### MATH 55: HOMEWORK #2 SOLUTIONS

MATH 55: HOMEWORK # SOLUTIONS ERIC PETERSON * 1. SECTION 1.5: NESTED QUANTIFIERS 1.1. Problem 1.5.8. Determine the truth value of each of these statements if the domain of each variable consists of all

### Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering

Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24

### 3.3 MATHEMATICAL INDUCTION

Section 3.3 Mathematical Induction 3.3.1 3.3 MATHEMATICAL INDUCTION From modus ponens: p p q q basis assertion conditional assertion conclusion we can easily derive double modus ponens : p 0 p 0 p 1 p

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

### Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

### 4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

### WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,

### Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications