Chapter 1 LOGIC AND PROOF

Size: px
Start display at page:

Download "Chapter 1 LOGIC AND PROOF"

Transcription

1 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 new facts. In this chapter we take a careful look at the rules of logic and the way in which mathematical arguments are constructed. 1.1 Logical statements The study of logic is concerned with the truth of falsity of statements. Definition 1 A statement is a sentence which can be classified as true or false without ambiguity. The truth or falsity of the statement is known as the truth value. For a sentence to be a statement, it is not necessary that we actually know whether it is true or false, but it must be clear that it is one or the other. Example 2 Consider the following sentences: 1. Every continuous function is differentiable is a statement with truth value false. 2. x<2 is true for some x and false for some others. If we have a particular context in mind, then it could be a statement. Otherwise it is not. 3. Every even number greater than 2is the sum of two primes is a statement, whose truth value is not known...yet. Exercise 3 Which of these sentences are statements? 1. If x is a real number, then x Seven is a prime number 3. This sentence is false Some authors also call it proposition.

2 8 Logic and Proof 1.2 Logical Connectives In studying mathematical logic we shall not be concerned with the truth value of any particular simple statement. What will be important is how the truth value of a compound statement is determined from the truth values of its simpler parts. To obtain such compound statements it is necessary to introduce the concept of a connective Definition 4 A sentential connective is a logic symbol representing an operator that combines statements into a new statement. Statements with connectives are called compound statements. Statements without connectives are known as atomic statements. The sentential connectives are not, and, or, if...then, and if and only if. The respective operators for these connectives are negation, conjunction, disjunction, implication and equivalence respectively. We shall introduce each of them now Negation :Letp stand for a given statement. Then p ( read not p )represents the logical opposite of p. When p is true, then p is false and viceversa. This can be summarized in a truth table, which gives the mapping from the truth value of the individual statements to the truth value of the resulting compound statement. Some authors also use for the negation connective. In this case p T F p F T. where T stands for true and F for false. Note that the truth table of a connective is an alternative way of defining a connective, since these are defined in terms of the truth value of the resulting compound statement, given the truth value of its components. Conjunction: If p and q are statements, then the statement p q ( read p and q) is true only when both p and q are true, and is false otherwise. p q p q T T T T F F F T F F F F.

3 Logical Connectives 9 For example, given p : 2> 0 and q : 0> 2 then the compound statement p q : 2> 0and0> 2 is false. (Inclusive)Disjunction : Ifp and q are statements, then the statement p q (read p or q) is true when at least one of the two statements is true, and is false when both are false. p q p q T T T T F T F T T F F F. Note that the inclusive disjunction doesn t complete the list of disjunctions used in everyday life. In fact, we also have the exclusive disjunction, which is true when either p or q is true, but not when both are true. In logic the only use for the connective or is for the inclusive meaning. For example, given p : 2 > 0 and q : 0> 2 then the compound statement p q : 2> 0or0> 2 is true. Implication : A statement of the form If p, then q is called an implication or a conditional statement. The if-statement p is called the antecedent and the then-statement q is called the consequent. The convention adopted for the truth value of the implication is that it will be called false only when the antecedent is true and the consequent is false. If we denote the implication if p, then q by p q, we obtain the following truth table p q p q T T T T F F F T T F F T. The last row of the table may seem counterintuitive. However, the usage of if... then as a connective or as a mathematical language is quite different from that of daily language. The reason for giving truth value T to the last case may be not understandable in the following mathematical expression: = = 2

4 10 Logic and Proof Nevertheless, we can easily prove the implication is indeed true: =7 3=4 so 1 = 4. But then 6 1=6 4=2. In English there are several ways to express the same mathematical condition p q. These are if p, then q q provided that p p implies q q whenever p p only if q q is a necessary condition for p q if p p is a sufficient condition for q Equivalence: The statement p if and only if q is defined as the conjunction of the two implications p q and q p. A statement of this form is called an equivalence and is denoted by p q. In written form, the abbreviation iff is used instead of if and only if. The truth table for equivalence can be obtained by computing the truth table for the compund statement (p q) (q p) p q p q q p p q T T T T T T F F T F F T T F F F F T T T Thus we see that p q is true precisely when p and q have the same truth values. Since p q is equivalent to (p q) (q p) we can use the terminology seen above for the implication connective and say q if p and q only if p p is a sufficient condition for q and p is a necessary condition for q Two compound statements p and q are said to be logically equivalent if one is true if and only if the other is true. In other words, two compound propositions are logically equivalent whenever they display the same truth table. In this case we write p q. Example 5 ( ( p)) is logically equivalent to p p p ( p) T F T F T F

5 Logical Connectives 11 Example 6 (p q) is logically equivalent to [( p) ( q)] p q (p q) p q [( p) ( q)] T T F F F F T F T F T T F T T T F T F F T T T T Exercise 7 (Implication) Show that the implication symbol is not a primitive connector. In other words, show that the implication p q is logically equivalent to [( p) q]. This is actually another convenient way to interpret the implication connector. When two compound statements p and q are logically equivalent, their equivalence is a new statement with a truth value true in all cases. Such a statement is known as a tautology, being its definition Definition 8 A compound proposition is said to be a tautology if it is always true regardless of the truth value of the simple propositions from which it is constructed. It is a contradiction if it is always false. Hence a contradiction and a tautology are a negation of each other. Example 9 p ( p) is a tautology, while p ( p) is a contradiction. p ( p) p ( p) p ( p) T F T F F T T F Example 10 [p (p = q)] = q is a tautology p q p q p (p q) [p (p q)] q T T T T T T F F F T F T T F T F F T F T Lets now prove the equivalence of a compound statement that will be useful when studying methods of proof Example 11 (Contrapositive) p q is logically equivalent to [( q) ( p)] p q p q p q ( q) ( p) (p q) [( q) ( p)] T T T F F T T T F F F T F T F T T T F T T F F T T T T T

6 12 Logic and Proof Exercise 12 (De Morgan s Law) Prove that (p q) is logically equivalent to [( p) ( q)] Exercise 13 Establish the logical equivalence of these compound statements 1. (p q) [p q] 2. (p q) (q p) Remark 14 As you have already proven p q is not logically equivalent to its converse q p. Claiming the opposite is a very common mistake you should not make in the future. Exercise 15 Write the negation of each statement a) If K is closed and bounded, then K is compact. b) If K is compact, then K is closed and bounded. c) A continuous function is differentiable. Exercise 16 Construct a truth table for each statement a) [ p (q q)] p b) (q p) (p q) c) (p q) (q p) (commutative property) d) (p q) (q p) e) [p (q r)] [(p q) r] (associative property) f) [p (q r)] [(p q) r] g) [p (q r)] [(p q) (p r)] (distributive property) h)[p (q r)] [(p q) (p r)] 1.3 Quantifiers In Section 1 we saw that a mathematical sentence that involves a variable, for example x>3, needs to be considered in a particular context in order to become a statement. The quantifiers help create statements bylimiting the role of variables in a mathematical sentence. Definition 17 A variable is a symbol that can assume several specifications. A propositional function is a sentence which becomes a statement once we replace a variable by one of its specifications. Let p(x) denote a propositional function, p being the sentence and x being the variable. Thus p (x) :x > 3 is a propositional function. Let S denote a given set. There are two quantifiers: You may think of a set S as a collection of objects, who are called the elements of S. When x is an element of S we write x S and we read x is an element of S.

7 Quantifiers 13 Universal quantifier ( for all ), denoted by, with the following interpretation: [ x S, p(x)] means that p(x) is true provided it is true for each x in S. A s an example, if S = {4, 5}, then[ x S, p(x) :x>3] [(4 > 3) (5 > 3)]. Sometimes the set S is implicit in the context, and can be omitted. The notation therefore becomes more compact, leading to x, p(x). Existential quantifier ( there exists ), denoted by : [ x S p(x)] reads There exists an x belonging to S such that p (x) meaning that p(x) is true provided there exists at least an x in S for which p(x) is true. As an example, if S = {1, 2, 4}, then[ x S p(x) :x>3] [(1 > 3) (2 > 3) (4 > 3)]. Exercise 18 Let S be a finite set (i.e. {1, 2}). Use de De Morgan s law to show that [ x S p(x)] [ x S, p(x)], and [ x S,p(x)] [ x S, p(x)] are tautologies. Sometimes we use the symbol! x to denote the case when a unique value exists for the variable x that makes p(x) true. The universal and the existential quantifiers are thus seen as extensions of the logical connectives and, to deal with infinitely many assertions, or assertions about infinitely many things, x. Moreover, one can combine the existential quantifier with negation: means there exists no (often written as / ). Example 19 / x > 0 (x + 1)= 0 is logically equivalent to x >0,x+1 0. Exercise 20 Write the negation of the following statements 1. x A, f (x) > 5 2. y>0 0 g(y) 3 3. ε >0 N n, if n>n,then x S, f n (x) f (x) <ε (uniform convergence) As we saw in the last exercise, we can use both and in one statement. It is important to clarify the following point about the order in which quantifiers are used. While [ x, y, p(x, y)] [ y, x, p(x, y)] [ x, y, p(x, y)], the propositions [ y xp(x, y)]and [ x, y p(x, y)]are not logically equivalent. In this case, in fact, the order in which quantifiers appear affects the meaning and the truth value of the statement. The first statement says that for at least one y, p(x, y) is true for all x. In other words, the choice of y is independent of x. On the other hand, the second statement establishes that for all x there exist at least one y such that p(x, y) is true. This means that the choice of y is allowed to depend on x. stands for such that. Another ways of saying such that are given by the symbol : or by writing s.t..

8 14 Logic and Proof As an example consider p(x, y) being given by x +1 = y. The statement [ y xp(x, y)] establishes that there exists an y such that for all x, x +1 = y. This is clearly a false statement. The second proposition,on the other hand,states that for all x there exists an y such that x + 1 = y. Unlike the former,this statement is true. Exercise 21 Find a p (x, y) such that [ y xp(x, y)] and [ x, y the same truth value. p(x, y)] have Exercise 22 The following statements give properties of functions that we shall encounter later in the course. You have to do two things. a) rewrite the defining conditions in logical symbolism and b) write the negation of part a) using the same symbolism. 1. A function f is odd iff for every x, f (x) =f ( x). 2. A function f is even iff for every x, f (x) =f ( x). 3. A function f is periodic iff there exists a k>0such that for every x, f (x + k) = f (x). 4. A function f is increasing iff for every xand for every y, if x y, then f (x) f (y). 5. A function f is strictly decreasing iff for every xand every y, if x y, then f (x) >f(y). 6. A function f : A B is injective iff for every x and y in A, if f (x) =f (y), then x = y. 7. A function f : A B is surjective iff for every y in B there exists an x in A such that f (x) =y. 8. A function f : D R is continuous at c D iff for every ε>0 there exists a δ>0 such that f (x) f (c) <εwhenever x c <δand x D. 9. A function f is uniformly continuous on a set S iff for every ε>0 there is a δ>0 such that f (x) f (y) <εwhenever x and y are in S and x y <δ. 10. The real number L is the limit of the function f : D R at the point c iff for each ε> 0 there is a δ> 0 such that f (x) L <εwhenever x D and 0 < x c <δ.

9 Techniques of Proof Techniques of Proof A proof is a method of establishing the truthfulness of an implication. Typically, one has to prove proposition of the sort if H 1,H 2,...,Hn, then C. Propositions H 1,...,Hn are often referred to as the hypotheses of the proof, whereas proposition C is referred to as the conclusion, or thesis. A formal proof of such a proposition consists of a sequence of valid propositions ending with conclusion C. To be valid, a proposition in the sequence must be either one of the hypotheses H 1,...Hn, or an axiom, a definition, a tautology or a previously proved proposition, or it must be derived from previous propositions using either substitution or logical implications. As an example, if you have to prove that given a set S, [ x S, p(x)], then you need to prove that [x S = p(x)]. Similarly, in case you have to prove that [ x S : p(x)], you just need to find an x in S such that p(x) is true. There are several ways of proving a proposition, all of them being useful in different situations. These methods are enumerated below. Direct To show that p = q is true, we first assume that p is true and conclude that q is true. Example 23 If x>1, then x 2 >x. Here p : x>1 and q : x 2 >x.the direct proof goes as follows: Let p : x>1 (Hypothesis); from the axiom If a > band c > 0, then ac > bc we have x >1 xx > 1 x; But by definition xx = x 2 and 1 x = x; substituting in the above expression leads to xx > 1 x x 2 >x which is the conclusion we wanted x>1 x 2 >x. Contrapositive Associated with the implication p q there is a logically equivalent statement q p, called the contrapositive (see example 11). Thus one way to prove an implication is to give a direct proof of its contrapositive. In other words, assume that q is true and conclude that p is true. Then we can conclude that (p q)is true. Example 24 Consider the statement for m N, If 7m is an odd number, then m is an odd number. The contrapositive of the statement is If m is not an odd number, then 7m is not an odd number, or equivalently If m is an even number, then 7m is an even number. This statement is much easier to prove.

10 16 Logic and Proof Proof. Let q : m is an even number. Then, by definition m = 2k for some k N. But then substituting into m we have 7m =7 (2k) =2(7k) =2k which is also even. Exercise 25 Try the direct proof of the above statement. Decomposition Suppose we want to prove that p q, and that p can be decomposed into two disjoint propositions p 1,p 2 such that p 1 p 2 is a contradiction. Then p (p 1 p 2 ) (p 1 p 2 ) (p 1 p 2 ). Given this choice of p 1 and p 2 we have (p q) ( p q) [ (p 1 p 2 ) q] [( p 1 p 2 ) q] [( p 1 q) ( p 2 q)] [(p 1 q) (p 2 q)] meaning that you only need to show that p 1 q and p 2 q. Note that this method works also if you decompose p into a number of propositions bigger than 2as far as these propositions are mutually exclusive (which means that every pair of them is a contradiction). Example 26 Take the contrapositive of the example given for the direct proof method. The contrapositive is x 2 x x 1. Proof. By definition x 2 0. Then p :0 x 2 x and q : x 1. Decompose p into p 1 : x > 0 and p 2 : x = 0. Then p 1 p 2 is always false and p (p 1 p 2 ) (p 1 p 2 ). To show that p 2 q is trivial since 0 1. To prove p 1 q, we only need to use the implication c>0, x y. x y Given c c that x>0 by assumption, x 2 x x2 x x x x 1 Exercise 27 Show the following statement Let x R. If x 1 x 2 x. Construction This approach is used when the statement includes an existential quantifier. i.e., the conclusion is of the form: x, p(x). To prove this, simply find ( construct ) a value of x such that p(x) is true when H is true. For example, if A = {1, 2, 3, 4, 5} and the proposition is: x A x>2, observe that for x =3we have x>2 and x A. Exercise 28 Show that f (x) =x is a continuous function at every x 0 R. You have to prove that ε >0, δ (x 0,ε) > 0 x x 0 <δ(x 0,ε) f (x) f (x 0 ) < ε.

11 Techniques of Proof 17 Contradiction Suppose we want to prove p q. This method of proof also known as reductio ad absurdum consists of assuming that [p ( q)]is true and deriving a contradiction c. To show that both statements are logically equivalent, we compare their truth tables p q p q q (p q) c (p q) c T T T F F F T T F F T T F F. F T T F F F T F F T T F F T An equivalent way of making a proof by contradiction is given by the following tautology: (p = q) [(p ( q)) = ( p)]. This is a particular case of the general definition, since [(p ( q)) = ( p)]is equivalent to [(p ( q)) = (( p) p)] (since p was already an assumption), and given that (( p) p) c then [(p ( q)) = c].the proof of their equivalence is left as an exercise. Exercise 29 Show that (p = q) [(p ( q)) = ( p)]. Example 30 We will show again that If 7m is odd, then m is odd. Proof. Here the statements are p : 7m is odd and q : m is odd. To prove the result by contradiction we will use the equivalence (p = q) [(p ( q)) = ( p)], so we have to assume first that (p ( q)), that is 7m is odd and m is even. Since m is even by definition we have m=2kforsome k. Then 7m= 7(2k) = 2 (7k) = 2 j for j=7k. But this means that 7m is even ( p), contradicting the assumption. Remark 31 Be very careful when writing proofs by contradiction! A very strong word of caution can be found in Royden All students are enjoined in the strongest possible terms to eschew proofs by contradiction! There are two reasons for the prohibition: First such proofs are very often fallacious,the contradiction on the final page arising from an erroneous deduction on an earlier page,rather than from the incompatibility of p with q. Second,even when correct,such a proof gives little insight into the connection between p and q whereas both the direct proof and the proof by contraposition construct a chain of argument connecting p and q.one reason why mistakes are so much more likely in proofs by contradiction than in direct proofs is that in a direct proof ( assuming the hypothesis is not always false) all deduction from the hypothesis are true in those cases where the hypothesis holds. One is dealing with true statements,and ones s intuition and knowledge about what it is true help to keep one from making erroneous statements. In proofs by contradiction,however,you are (assuming the theorem is true) in the unreal world where any statement can be derived,and so the falsity of a statement is no indication of an erroneous deduction. H.L. Royden Real Analysis pg3.

12 18 Logic and Proof Exercise 32 Let x be a real number. Prove that if x>0 then 1/x>0. Induction It is used for statements of the form p(n), n {m, m +1,m+2,...}. The proof consists of two steps: Basis of Induction Prove that for the first element in the set of interest in this case m, p(m) is true, Inductive step Show p(k) p(k +1), for k m. In other words,assume p(k) is true and prove that p(k + 1) is also true. Exercise 33 The following tautologies are widely used in the methods of proof. Some of them have already been seen before. a) Verify that they are indeed tautologies, b) Interpret them and associate them with the different methods of proof 1. (p q) [(p q) (q p)] 2. (p q) [(p q) ( p q)] 3. (p q) ( q p) 4. p p 5. (p p) c 6. ( p c) p 7. (p q) [(p q) c] 8. [ p (p q)] q 9. [ q (p q)] p 10. [ p (p q)] q 11. (p q) p 12. [(p q) (q r)] (p r) 13. [(p 1 p 2 ) (p 2 p 3 )... (pn 1 pn )] 14. [(p q) r] [p (q r)] 15. [(p q) (r s) (p r)] (q s) 16. [p (q r)] [(p q) r] 17. [(p q) r] [(p r) (q r)] (p 1 pn ) 1.5 References S.R Lay, Analysis with an Introduction to Proof. Chapter 1. Third Edition. Prentice Hall. A. Matozzi, Lecture Notes Econ 897 University of Pennsylvania Summer H.L. Royden, Real Analysis. Third Edition. Prentice Hall.

Handout #1: Mathematical Reasoning

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

More information

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

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

More information

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

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

More information

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

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

More information

DISCRETE MATHEMATICS W W L CHEN

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

More information

1 Proposition, Logical connectives and compound statements

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

More information

Logic, Sets, and Proofs

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

More information

2. Propositional Equivalences

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

More information

Chapter I Logic and Proofs

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

More information

Section 3 Sequences and Limits

Section 3 Sequences and Limits Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

More information

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

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

More information

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

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

More information

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

More information

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

More information

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

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

More information

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

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1 Course Outline CS70 is a course on Discrete Mathematics and Probability for EECS Students. The purpose of the course

More information

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. 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)

More information

Mathematical Induction

Mathematical Induction Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers

More information

Fundamentals of Mathematics Lecture 6: Propositional Logic

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

More information

1.3 Induction and Other Proof Techniques

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.

More information

A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

A set is a Many that allows itself to be thought of as a One. (Georg Cantor) Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

More information

CHAPTER 1. Logic, Proofs Propositions

CHAPTER 1. Logic, Proofs Propositions CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: Paris is in France (true), London

More information

3. Mathematical Induction

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)

More information

INTRODUCTORY SET THEORY

INTRODUCTORY SET THEORY M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

More information

Propositional Logic and Methods of Inference SEEM

Propositional Logic and Methods of Inference SEEM Propositional Logic and Methods of Inference SEEM 5750 1 Logic Knowledge can also be represented by the symbols of logic, which is the study of the rules of exact reasoning. Logic is also of primary importance

More information

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

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

More information

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

More information

CSI 2101 / Rules of Inference ( 1.5)

CSI 2101 / Rules of Inference ( 1.5) CSI 2101 / Rules of Inference ( 1.5) Introduction what is a proof? Valid arguments in Propositional Logic equivalence of quantified expressions Rules of Inference in Propositional Logic the rules using

More information

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

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

More information

Math 3000 Running Glossary

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 (

More information

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

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs 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

More information

0 ( x) 2 = ( x)( x) = (( 1)x)(( 1)x) = ((( 1)x))( 1))x = ((( 1)(x( 1)))x = ((( 1)( 1))x)x = (1x)x = xx = x 2.

0 ( x) 2 = ( x)( x) = (( 1)x)(( 1)x) = ((( 1)x))( 1))x = ((( 1)(x( 1)))x = ((( 1)( 1))x)x = (1x)x = xx = x 2. SOLUTION SET FOR THE HOMEWORK PROBLEMS Page 5. Problem 8. Prove that if x and y are real numbers, then xy x + y. Proof. First we prove that if x is a real number, then x 0. The product of two positive

More information

Inference Rules and Proof Methods

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

More information

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

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

More information

Oh Yeah? Well, Prove It.

Oh Yeah? Well, Prove It. Oh Yeah? Well, Prove It. MT 43A - Abstract Algebra Fall 009 A large part of mathematics consists of building up a theoretical framework that allows us to solve problems. This theoretical framework is built

More information

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

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

More information

Mathematical Induction

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

More information

Chapter 1. Logic and Proof

Chapter 1. Logic and Proof Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known

More information

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

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

More information

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.

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

More information

Problems on Discrete Mathematics 1

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

More information

CS 441 Discrete Mathematics for CS Lecture 2. Propositional logic. CS 441 Discrete mathematics for CS. Course administration

CS 441 Discrete Mathematics for CS Lecture 2. Propositional logic. CS 441 Discrete mathematics for CS. Course administration CS 441 Discrete Mathematics for CS Lecture 2 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administration Homework 1 First homework assignment is out today will be posted

More information

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. 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

More information

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.

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

More information

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.

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,

More information

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

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

More information

Discrete Mathematics

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

More information

Direct Proofs. CS 19: Discrete Mathematics. Direct Proof: Example. Indirect Proof: Example. Proofs by Contradiction and by Mathematical Induction

Direct Proofs. CS 19: Discrete Mathematics. Direct Proof: Example. Indirect Proof: Example. Proofs by Contradiction and by Mathematical Induction Direct Proofs CS 19: Discrete Mathematics Amit Chakrabarti Proofs by Contradiction and by Mathematical Induction At this point, we have seen a few examples of mathematical proofs. These have the following

More information

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

More information

Discrete Mathematics, Chapter : Propositional Logic

Discrete Mathematics, Chapter : Propositional Logic Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.1-1.3 1 / 21 Outline 1 Propositions

More information

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

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

More information

MATH 55: HOMEWORK #2 SOLUTIONS

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

More information

Students in their first advanced mathematics classes are often surprised

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

More information

Applications of Methods of Proof

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

More information

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

More information

An Innocent Investigation

An Innocent Investigation An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number

More information

Artificial Intelligence Automated Reasoning

Artificial Intelligence Automated Reasoning Artificial Intelligence Automated Reasoning Andrea Torsello Automated Reasoning Very important area of AI research Reasoning usually means deductive reasoning New facts are deduced logically from old ones

More information

MATHS 315 Mathematical Logic

MATHS 315 Mathematical Logic MATHS 315 Mathematical Logic Second Semester, 2006 Contents 2 Formal Statement Logic 1 2.1 Post production systems................................. 1 2.2 The system L.......................................

More information

Statements, negations, connectives, truth tables, equivalent statements, De Morgan s Laws, arguments, Euler diagrams

Statements, negations, connectives, truth tables, equivalent statements, De Morgan s Laws, arguments, Euler diagrams Logic Statements, negations, connectives, truth tables, equivalent statements, De Morgan s Laws, arguments, Euler diagrams Part 1: Statements, Negations, and Quantified Statements A statement is a sentence

More information

3.3. INFERENCE 105. Table 3.5: Another look at implication. p q p q T T T T F F F T T F F T

3.3. INFERENCE 105. Table 3.5: Another look at implication. p q p q T T T T F F F T T F F T 3.3. INFERENCE 105 3.3 Inference Direct Inference (Modus Ponens) and Proofs We concluded our last section with a proof that the sum of two even numbers is even. That proof contained several crucial ingredients.

More information

Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

More information

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

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

More information

WUCT121. Discrete Mathematics. Logic

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,

More information

1. R In this and the next section we are going to study the properties of sequences of real numbers.

1. R In this and the next section we are going to study the properties of sequences of real numbers. +a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

More information

CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.

CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r. CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:

More information

DISCRETE MATH: LECTURE 3

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

More information

Mathematical Induction

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,

More information

Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

More information

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

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,

More information

Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

More information

Chapter 6 SEQUENCES. sn 1+1,s 1 =1 is again an abbreviation for the sequence { 1, 1 2, 1 } n N ε,d (s n,s) <ε.

Chapter 6 SEQUENCES. sn 1+1,s 1 =1 is again an abbreviation for the sequence { 1, 1 2, 1 } n N ε,d (s n,s) <ε. Chapter 6 SEQUENCES 6.1 Sequences A sequence is a function whose domain is the set of natural numbers N. If s is a sequence, we usually denote its value at n by s n instead of s (n). We may refer to the

More information

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

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

More information

Propositional Logic. Definition: A proposition or statement is a sentence which is either true or false.

Propositional Logic. Definition: A proposition or statement is a sentence which is either true or false. Propositional Logic Definition: A proposition or statement is a sentence which is either true or false. Definition:If a proposition is true, then we say its truth value is true, and if a proposition is

More information

1.2 Truth and Sentential Logic

1.2 Truth and Sentential Logic Chapter 1 Mathematical Logic 13 69. Assume that B has m left parentheses and m right parentheses and that C has n left parentheses and n right parentheses. How many left parentheses appear in (B C)? How

More information

Mathematical Induction

Mathematical Induction Mathematical Induction MAT30 Discrete Mathematics Fall 016 MAT30 (Discrete Math) Mathematical Induction Fall 016 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)

More information

(Refer Slide Time: 1:41)

(Refer Slide Time: 1:41) Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 10 Sets Today we shall learn about sets. You must

More information

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

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.

More information

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto

More information

6.2 Permutations continued

6.2 Permutations continued 6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

More information

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

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

More information

Exam 1 Answers: Logic and Proof

Exam 1 Answers: Logic and Proof Q250 FALL 2012, INDIANA UNIVERSITY Exam 1 Answers: Logic and Proof September 17, 2012 Instructions: Please answer each question completely, and show all of your work. Partial credit will be awarded where

More information

Introduction to Proofs

Introduction to Proofs Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

More information

Convexity in R N Main Notes 1

Convexity in R N Main Notes 1 John Nachbar Washington University December 16, 2016 Convexity in R N Main Notes 1 1 Introduction. These notes establish basic versions of the Supporting Hyperplane Theorem (Theorem 5) and the Separating

More information

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

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

More information

To formulate more complex mathematical statements, we use the quantifiers there exists, written, and for all, written. If P(x) is a predicate, then

To formulate more complex mathematical statements, we use the quantifiers there exists, written, and for all, written. If P(x) is a predicate, then Discrete Math in CS CS 280 Fall 2005 (Kleinberg) Quantifiers 1 Quantifiers To formulate more complex mathematical statements, we use the quantifiers there exists, written, and for all, written. If P(x)

More information

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

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

More information

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

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,

More information

Introduction to mathematical arguments

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

More information

Lecture 3. Mathematical Induction

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

More information

CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

More information

Climbing an Infinite Ladder

Climbing an Infinite Ladder 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,

More information

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

More information

PRINCIPLE OF 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

More information

Logical Inference and Mathematical Proof

Logical Inference and Mathematical Proof Logical Inference and Mathematical Proof CSE 191, Class Note 03: Logical Inference and Mathematical Proof Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures

More information

MATH20302 Propositional Logic. Mike Prest School of Mathematics Alan Turing Building Room

MATH20302 Propositional Logic. Mike Prest School of Mathematics Alan Turing Building Room MATH20302 Propositional Logic Mike Prest School of Mathematics Alan Turing Building Room 1.120 mprest@manchester.ac.uk April 10, 2015 Contents I Propositional Logic 3 1 Propositional languages 4 1.1 Propositional

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

This section demonstrates some different techniques of proving some general statements.

This section demonstrates some different techniques of proving some general statements. Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

More information

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

More information

In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann) Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

More information

Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q. Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

More information