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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 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) is a predicate, then x : P(x) means, There exists an x such that P(x) holds. x : P(x) means, For all x, it is the case that P(x) holds. So for example, if x denotes a real number, then x : x 2 = 4 is true, since 2 is an x for which x 2 = 4. On the other hand, x : x 2 = 4 is clearly false; not all numbers, when squared, are equal to 4. x : x 2 +1 > 0 is true, but x : x 2 > 2 is false, since for example x = 1 doesn t satisfy the predicate. On the other hand, x : x 2 > 2 is true, since x = 2 is an example that satisfies it. Whenever we see a variable in a quantified expression, there s an underlying assumption that the variable comes from some base set. So to go back to x : x > 0, this is true because we specified that x was a real number. But it would be false if we specified that x was drawn from the complex numbers, since then x = i would not satisfy the predicate. Often we ll keep the underlying set implicit, but it is important to be careful about this. Negating quantified statements. Earlier we said that x : x 2 > 2 is false, because we were able to think of an x (x = 1) that fails to satisfy the predicate. This suggests how to negate a statement: we flip to, and then negate the predicate inside. That is, the negation of x : P(x) is x : P(x). This, incidentally, is where the term counterexample comes from. If x : P(x) is false, then x : P(x) and the x that exists to satisfy P(x) is the counterexample to the claim x : P(x). On the other hand, to negate x : P(x), we must claim that P(x) fails to hold for any possible x. So again we flip the quantifier and then negate the predicate: the negation of x : P(x) is x : P(x). 1

2 Quantifiers in standard English usage. If we think about it, this is all familiar from standard English usage. For example, if someone says, Everyone at Cornell is at least 18 years old, you might reply, No, I know someone at Cornell who s under 18. What are you doing when you say this? At least subconsciously, you re interpreting this statement as x at Cornell, x is at least 18 years old. To disagree with this, you re negating the statement by flipping the to and then negating the the predicate: x at Cornell such that x is not at least 18 years old. Note also that we re careful about the set over which x is being quantified: the set is all people at Cornell. The same thing happens in the reverse direction, from to : if someone says, There s an NBA player who makes over ten million dollars a year, you might disagree by saying, No, every NBA player makes under ten million dollars a year. 1.1 Nested Quantifiers Most serious mathematical statements use nested quantifiers. For example, Suppose we claimed, For every real number, there s a real number larger than it. We d write this as x y : y > x. Or if we wanted to claim, There exists a Boolean formula such that every truth assignment to its variables satisfies it, we could write this as formulaf assignmentsa : A satisfies F. The difference between a statement that says x y and a statement that says x y is something to watch out for. For example, if we re talking about real numbers, then our earlier example x y : y > x is true. But writing it with the quantifiers in the other order, it would become false: y x : y > x. This version would require there to be a single number that s greater than every number. Negating Nested Quantifiers. To negate a sequence of nested quantifiers, you flip each quantifier in the sequence and then negate the predicate. So the negation of x y : P(x, y) is x y : P(x, y) and So the negation of x y : P(x, y) and x y : P(x, y). Again, after some thought, this make sense intuitively. For example, let s take the definition of an unbounded sequence from calculus. If we have an infinite sequence of real numbers a 1 a 2 a 3, then we say it s unbounded if for every number x, it eventually grows larger than x. You can already see the quantifiers lurking in here: x n : a n > x. Now, some sequences, like 1, 4, 9, 16, 25, 36,..., are unbounded, and some, like 1 2, 3 4, 7 8,..., are not. What does it mean for a sequence not to be unbounded: there is an upper bound x such that every number in the sequence is at most x. 2

3 In fact, we could have derived this mechanically by negating the definition of unboundedness. If unbounded means x n : a n > x, then not unbounded must mean (flipping quantifiers) x n : a n x. Notice that this is what just said, but here we worked it out without even thinking about what the symbols mean. Nested Quantifiers in Standard English Usage. People manipulate sequences of two nested quantifiers in conversation all the time. For example, if someone says, Everyone experiences moments of doubt, you might reply, No, I know someone who seems never to have experienced any moments of doubt in their whole life. What are you doing here? You re interpreting the statement as people p time t : p experiences doubt at time t. To disagree with this, you re negating the statement by flipping each quantifier and then negating the the predicate: person p times t : p did not experience doubt at time t. (It appears that you added in their whole life just for effect... ) More than two nested quantifiers. There s no problem writing longer sequences of nested quantifiers, but it s a general rule of thumb that people really have to work, cognitively, to handle more than two. This is why most of us have such a hard time digesting the definition of a limit when we first learn it in calculus: lim x a f(x) = b means ǫ δ x : (0 < x a < δ) f(x) b < ǫ. Given their complexity, it s interesting to ask how often sentences with three nested quantifiers come up in standard conversation. There are certainly examples. Here s one that requires a very mild knowledge of baseball, in which all three quantifiers are hidden. In 1941, Joe Dimaggio had a 56-game hitting streak. (A record, by the way, that many people think will never be broken... ) Even if you don t know baseball, just think of the rules this way: over the course of one game, each player comes up to bat several times; in each at-bat, they either get a hit (a good thing) or an out (a bad thing). So here s what the sentence above is really saying: In 1941, there existed a sequence of 56 consecutive games, such that for all games in this sequence, there was at least one at-bat in which Joe Dimaggio got a hit. So sports fans, just like mathematicians and software designers, know how to make up definitions (like hitting streak ) that hide a lot of complexity. Notice by the way that streaks in sports don t generally involve three nested quantifiers; in fact, they usually involve just two. For example, the Kansas City Royals 19-game losing streak this baseball season could be written This past summer, there was a sequence of 15 consecutive Royals games such that for all games in this sequence, the Royals lost. 3

4 1.2 Connections to Game-Playing We used Boolean formulas to model two-player games in the previous lecture; we can also use quantifiers for this purpose, in a very similar way. Suppose we have a game in which players alternate moves, and we want to know whether Player 1 can force a win after at most k moves by each side. If we simply try stating what this means, we notice the quantifier structure very quickly: we want to know if there s a move for Player 1, so that for any possible move by Player 2, there s a move for Player 1, so that for any possible move by Player 2, and so forth, leading to a position that is a win for Player 1. In symbols, let x 1, x 2,..., x k be variables corresponding to the moves by Player 1, and let y 1, y 2,...,y k be variables corresponding to the moves by Player 2. Let the predicate P(x 1, y 1, x 2, y 2,...,x k, y k ) be T when the position after moves x 1, y 1,...,x k, y k in order is a win for Player 1, and let is be F otherwise. Then the question of a forced win is determined simply by the truth or falsehood of a single quantified statement: x 1 y 1 x 2 y 2 x k y k : P(x 1, y 1,...,x k, y k. And again, the strategy for Player 1 shows up here as well: every time a quantifier of the form x i is satisfied, it says that there s a way to set the value of x i (in other words, how to choose the right move) to continue forcing the win. The relationship to quantifiers is so close that people often find it useful to think about the relationship as going in both directions: reasoning about alternating, nested quantifiers is like thinking about a strategy in a two-player game. And this also hints at why it s so hard to play games like chess well. Recall that even three nested quantifiers tends to place a large cognitive load on people; to look k moves out in chess requires manipulating 2k nested quantifiers! In later courses, like CS 482, you ll see actual formal evidence for why manipulating long strings of quantifiers is a computationally intractable problem. 1.3 Connections to Natural Language Processing The analysis of quantifiers also shows up in the field of natural language processing, which the area of computer science concerned with getting computers to understand and communicate in human languages like English, Chinese, Arabic, and so forth. This is a very challenging problem that is far from being solved any time soon: the complexities of any given human language are much more subtle than its native speakers tend to realize. Or to put it another way, our brains our doing all sorts of things to process language, and it s hard to pin down precisely what these are. These issues are also core problems in the field of linguistics, of course, and there are many people who work on the boundary of natural language processing and linguistics. Quantifiers in sentences are one of the linguistic constructs that are hard for computers to handle in general. Some simple examples illustrate why. To begin, there s ambiguity; to paraphrase an old Groucho Marx joke, In America, someone steals a car every fifteen seconds. We have to find that person and stop them. 4

5 There s no better way to ruin a joke than to try writing it out in logical notation, but for our particular purpose here it s useful, since it s entirely about quantifiers. Clearly the first sentence was meant to say: blocks of fifteen seconds, a person who is stealing a car right then. The second sentence then willfully misinterprets this by swapping the quantifiers: a person P such that blocks of fifteen seconds, P is stealing a car right then. But there are much bigger problems than this, if we want to get computers to understand the quantifiers embedded in sentences A real difficulty is that we humans resolve the same ambiguities differently depending on what the sentence is talking about. Here s a nice pair of example dialogues from Lillian Lee that illustrate this. 1. How was the party after I left? It was fun. Everyone had a drink. 2. How was the party after I left? It was fun. Everyone saw a movie. Did everyone have their own drink, or did they all share the same drink? Clearly everyone had their own drink. But did everyone watch a different movie (on little personal video players), or did they all sit around watching the same movie. Clearly everyone watched the same movie. So the first is, people P at the party a drink that P had, while the second is a movie M such that people P, P saw the movie M. In other words, we interpret the order of quantifiers differently, even though the sentences are written exactly the same way. The differences in interpretation come about simply because we know about the differences between drinks and movies. This is the kind of thing that makes life very difficult for natural language processing software. 1.4 Quantifiers and Proofs As we discussed earlier, our main interest in quantifiers for the purposes of this course is to manipulate mathematical statements in a careful way. When faced with a mathematical claim, understanding its quantifier is often a very good strategy for thinking about how to work out a proof. For example: If the statement has the form x : P(x), then the global outline is likely have the form: Consider any possible x, and show that it satisfies the property P(x). If the statement has the form x : P(x), then the global outline is different: One needs to specify a particular x, and then show it satisfies P(x). It s particularly useful to watch for the role that plays in proofs. When you come to a x, it generally means: At this point, you have to describe an x that does what you want. 5

6 Quantifiers and Proofs by Contradiction. Of course, one can try looking for alternate strategies, and proof by contradiction is one useful example of this. If you re trying to prove x : P(x), and you don t see how to describe the x you need, you can try supposing it s false and looking for a contradiction. Supposing it s false, concretely, means assuming x : P(x). You re now in a situation where you can assume that P(x) holds for all x, and start looking for a contradiction. Analogously, if you don t see how to get started proving a statement like x : P(x), you can similarly negate it and start searching for a contradiction. This means you can start by assuming x : P(x), which lets you assume the existence of a counterexample x for which P(x) holds. 6

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

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

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

### Discrete Mathematics, Chapter : Predicate Logic

Discrete Mathematics, Chapter 1.4-1.5: Predicate Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.4-1.5 1 / 23 Outline 1 Predicates

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

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

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

### Calculus for Middle School Teachers. Problems and Notes for MTHT 466

Calculus for Middle School Teachers Problems and Notes for MTHT 466 Bonnie Saunders Fall 2010 1 I Infinity Week 1 How big is Infinity? Problem of the Week: The Chess Board Problem There once was a humble

### Finish Set Theory Nested Quantifiers

Finish Set Theory Nested Quantifiers Margaret M. Fleck 18 February 2009 This lecture does a final couple examples of set theory proofs. It then fills in material on quantifiers, especially nested ones,

### 3. Predicates and Quantifiers

3. PREDICATES AND QUANTIFIERS 45 3. Predicates and Quantifiers 3.1. Predicates and Quantifiers. Definition 3.1.1. A predicate or propositional function is a description of the property (or properties)

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

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

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

### 1 Proofs by Induction

Discrete Math in CS CS 280 Fall 2005 (Kleinberg) Induction and Recursion 1 Proofs by Induction Induction is a method for proving statements that have the form: n : P (n), where n ranges over the positive

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

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

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

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

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

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

### Math 317 HW #5 Solutions

Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show

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

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

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

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

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

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

### It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

### Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets

CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap. 2.3-2.6 Homework 2 due Tuesday Recitation 3 on Friday

### All programs that passed test 1 were written in Java.

. Consider the following statements: (S) Programs that passed test also passed test. (S) Programs passed test unless they failed test. (S) Programs passed test only if they passed test. (a) Rewrite statements

### 5. ABSOLUTE EXTREMA. Definition, Existence & Calculation

5. ABSOLUTE EXTREMA Definition, Existence & Calculation We assume that the definition of function is known and proceed to define absolute minimum. We also assume that the student is familiar with the terms

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

### Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 22

CS 70 Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 22 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette

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

### Rules and Tips for Writing Mathematics Discrete Math

Rules and Tips for Writing Mathematics Discrete Math Adapted from: Writing in Mathematics by Annalisa Crannell Why Should You Have To Write Papers In A Math Class? For most of your life so far, the only

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

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

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

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

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,

Mathematics 0N1 Solutions 1 1. Write the following sets in list form. 1(i) The set of letters in the word banana. {a, b, n}. 1(ii) {x : x 2 + 3x 10 = 0}. 3(iv) C A. True 3(v) B = {e, e, f, c}. True 3(vi)

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

### LESSON 1 PRIME NUMBERS AND FACTORISATION

LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers

### Dedekind Cuts. Rich Schwartz. September 17, 2014

Dedekind Cuts Rich Schwartz September 17, 2014 1 Decimal Expansions How would you define a real number? It would seem that the easiest way is to say that a real number is a decimal expansion of the form

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

### Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists.

11 Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists. The phrases, for all x in R if x is an arbitrary

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

### 2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

### Writing proofs. Tim Hsu, San José State University. Revised February Sets, elements, and the if-then method 11

Writing proofs Tim Hsu, San José State University Revised February 2016 Contents I Fundamentals 5 1 Definitions and theorems 5 2 What is a proof? 5 3 A word about definitions 6 II The structure of proofs

### (Refer Slide Time: 05:02)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 1 Propositional Logic This course is about discrete

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

### Introduction to Series and Sequences Math 121 Calculus II D Joyce, Spring 2013

Introduction to Series and Sequences Math Calculus II D Joyce, Spring 03 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

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

### , for x = 0, 1, 2, 3,... (4.1) (1 + 1/n) n = 2.71828... b x /x! = e b, x=0

Chapter 4 The Poisson Distribution 4.1 The Fish Distribution? The Poisson distribution is named after Simeon-Denis Poisson (1781 1840). In addition, poisson is French for fish. In this chapter we will

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### BLOSSOMS MODULE ARE RANDOM TRIANGLES ACUTE OR OBTUSE? By Gilbert Strang Professor of Mathematics Massachusetts Institute of Technology

BLOSSOMS MODULE ARE RANDOM TRIANGLES ACUTE OR OBTUSE? By Gilbert Strang Professor of Mathematics Massachusetts Institute of Technology Hi! I m Gilbert Strang. I teach math at MIT. Mostly what I teach is

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

### For the purposes of this course, the natural numbers are the positive integers. We denote by N, the set of natural numbers.

Lecture 1: Induction and the Natural numbers Math 1a is a somewhat unusual course. It is a proof-based treatment of Calculus, for all of you who have already demonstrated a strong grounding in Calculus

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

### Chapter 3. Proof. 3.1 The Nature of Proof

Chapter 3 Proof 3.1 The Nature of Proof We begin with a philosophical discussion on the nature of proof. When a person is arrested for a crime and brought to trial, it is assumed that the prosecution has

### Math 1B, lecture 14: Taylor s Theorem

Math B, lecture 4: Taylor s Theorem Nathan Pflueger 7 October 20 Introduction Taylor polynomials give a convenient way to describe the local behavior of a function, by encapsulating its first several derivatives

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 7 Lecture Notes Discrete Probability Continued Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. The Bernoulli

### (Refer Slide Time 6:09)

Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture 3 Combinational Logic Basics We defined digital signal as a signal which

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

### Mathematical induction: variants and subtleties

Mathematical induction: variants and subtleties October 29, 2010 Mathematical induction is one of the most useful techniques for solving problems in mathematics. I m assuming you re familiar with the basic

### Invalidity in Predicate Logic

Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional

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

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

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

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

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

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

### 2.1 The Algebra of Sets

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

### Absolute Value of Reasoning

About Illustrations: Illustrations of the Standards for Mathematical Practice (SMP) consist of several pieces, including a mathematics task, student dialogue, mathematical overview, teacher reflection

### Ian Stewart. Mathematics Institute University of Warwick Coventry CV4 7AL UK

The Never-Ending Chess Game Ian Stewart Mathematics Institute University of Warwick Coventry CV4 7AL UK What is mathematics? It seems impossible to give a succinct definition. The best one I know is 'what

### 3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

### Intelligence and Physical Symbol Systems

Classic AI and the Chinese Room 11.12.13 Outline Introduction Introduction Outline Introduction Introduction Review The Computational Theory of the Mind The Computational Theory of the Mind (CTM) Minds

### Fibonacci Numbers. This is certainly the most famous

Fibonacci Numbers The Fibonacci sequence {u n } starts with 0, then each term is obtained as the sum of the previous two: un = un + un The first fifty terms are tabulated at the right. Our objective here

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

### Announcements. CS243: Discrete Structures. More on Cryptography and Mathematical Induction. Agenda for Today. Cryptography

Announcements CS43: Discrete Structures More on Cryptography and Mathematical Induction Işıl Dillig Class canceled next Thursday I am out of town Homework 4 due Oct instead of next Thursday (Oct 18) Işıl

### DISCRETE MATH: LECTURE 4

DISCRETE MATH: LECTURE 4 DR. DANIEL FREEMAN 1. Chapter 3.1 Predicates and Quantified Statements I A predicate is a sentence that contains a finite number of variables and becomes a statement when specific

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

### 2.3 Bounds of sets of real numbers

2.3 Bounds of sets of real numbers 2.3.1 Upper bounds of a set; the least upper bound (supremum) Consider S a set of real numbers. S is called bounded above if there is a number M so that any x S is less

### Induction and the Division Theorem 2.1 The Method of Induction

2 Induction and the Division Theorem 2.1 The Method of Induction In the Introduction we discussed a mathematical problem whose solution required the verification of an infinite family of statements. We

### Subjects, Predicates and The Universal Quantifier

Introduction to Logic Week Sixteen: 14 Jan., 2008 Subjects, Predicates and The Universal Quantifier 000. Office Hours this term: Tuesdays and Wednesdays 1-2, or by appointment; 5B-120. 00. Results from

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### The Limit of a Sequence of Numbers: Infinite Series

Connexions module: m36135 1 The Limit of a Sequence of Numbers: Infinite Series Lawrence Baggett This work is produced by The Connexions Project and licensed under the Creative Commons Attribution License

### Matthias Beck Ross Geoghegan. The Art of Proof. Basic Training for Deeper Mathematics

Matthias Beck Ross Geoghegan The Art of Proof Basic Training for Deeper Mathematics ! "#\$\$%&#'!()*+!!,-''!.)-/%)/#0! 1)2#3\$4)0\$!-5!"#\$%)4#\$&*'!! 1)2#3\$4)0\$!-5!"#\$%)4#\$&*#6!7*&)0*)'! 7#0!83#0*&'*-!7\$#\$)!90&:)3'&\$;!

### 0 : square root of zero. 1 : square root of one. 2 : square root of two. 3 : square root of three. 4 : square root of four. 5 : square root of five.

Instructor: Math 05 TOPICS IN MATHEMATICS REVIEW OF LECTURES XIII February 8 (Wed), 205 Yasuyuki Kachi Line #: 52920. 3. Square roots. Today we learn square-root/square-rooting. First, notation and pronunciation:

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

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

### Lies My Calculator and Computer Told Me

Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing

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

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

### Grade 7/8 Math Circles Sequences and Series

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Sequences and Series November 30, 2012 What are sequences? A sequence is an ordered

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

### Ummmm! Definitely interested. She took the pen and pad out of my hand and constructed a third one for herself:

Sum of Cubes Jo was supposed to be studying for her grade 12 physics test, but her soul was wandering. Show me something fun, she said. Well I wasn t sure just what she had in mind, but it happened that

### 1.4/1.5 Predicates and Quantifiers

1.4/1.5 Predicates and Quantifiers Can we express the following statement in propositional logic? Every computer has a CPU No Outline: Predicates Quantifiers Domain of Predicate Translation: Natural Languauge