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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

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

2 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement which is either true or false (that is, it has a definite truth value). Questions, instructions, interjections, etc. are not propositions. Compound propositions can be formed by conjunction, that is p q, read p and q, which is understood to be true when both p and q are true, and false otherwise. Similarly the disjunction of p and q is p q, read p or q, which is defined to be true when either p or q is true (or both). This is the so-called inclusive or, as opposed to the exclusive or more often used in computing, which means p or q but not both. All these things are defined by truth tables, which list all possible truth values for the simple propositions p, q, etc., and the corresponding truth values for the compound proposition. Similarly, we can define the negation of p, written p and read not p, to be true if p is false and false if p is true. Examples such as (p q) r and p (q r) show that brackets are essential, as these two propositions have different truth values in some circumstances. They can both be read as p and q or r, but with the comma in different places, thus: p and q, or r versus p, and q or r. Alternatively, you can think of it as the distinction between either p and q, or r and p and either q or r. Conditional propositions are statements of the form if p then q. In order to give this a truth value in all circumstances, we define it by the following truth table. Lecture no. 2. p q p q T T T T F F F T T F F T 1

3 2 CHAPTER 1. LOGIC Heuristic justification for this definition: if p is true and q is false, then the statement if p is true then q is true obviously cannot be true, and therefore must be false. On the other hand, if p is false, then the statement if p is true then... is an empty statement it is saying nothing at all, and therefore cannot be false. So it must be true. If you work out the truth table of p q, you will see that it is identical to the truth table for p q. Thus from a logical point of view there is no difference between them: one is just a re-wording of the other. We say they are logically equivalent, and write p q p q. Other useful examples include DeMorgan s laws: p q p q and p q p q. These can easily be proved by working out the truth tables. Similarly p p. One very important result is that p q q p. The statement q p is called the contrapositive of p q. This result can be proved by truth tables as before, or alternatively we can argue as follows. q p q p q p p q p q. Warning: the statement q p (called the converse of p q) is not logically equivalent to p q. In order to be able to dispense with truth tables altogether, you need also the distributive laws p (q r) (p q) (p r) and p (q r) (p q) (p r). Introduce quantifiers: x > 3 is not a proposition, since its truth value depends on the value of x. But we want to talk about mathematical statements of the form if x > 3 then x 2 > 9, which is undoubtedly a true statement! It really means for any x, if x > 3 then x 2 > 9. We introduce propositional functions such as P (x) to denote statements which become propositions when we give a particular value to the variable x. Thus if P (x) denotes x > 3, we can see that P (1) is false, while P (5) is true. Now let Q(x) denote x 2 > 9, so we can write our full statement as x(p (x) Q(x)), which we read as for any x, if P (x) is true then Q(x) is true. Lecture no. 3. The symbol is called the universal quantifier. Similarly there is the existential quantifier, which can be read as there exists. Thus the statement xp (x) is true if there is some value of x for which P (x) is true. Now to show in a given instance that xp (x) is false, we need only find one value of x for which P (x) is false. Such an x is called a counterexample. This leads us to another form of DeMorgan s laws: xp (x) xp (x). Similarly, if xp (x) is false, then there is no x for which P (x) is true, so for all x, P (x) is false, and we obtain the other of DeMorgan s laws: xp (x) xp (x). In all these examples, we need to understand the context of a given statement: that is, if we say there exists an x with P (x) true, we are only talking about x

4 being within a certain domain of discourse, typically the set of real numbers, or the set of integers. Mathematical results are often of the form x(p (x) Q(x)). To prove something like this, all we need to do is to consider all those values of x for which P (x) is actually true, and show that in these cases Q(x) is also true. Such a proof is called a direct proof. But just as p q is logically equivalent to q p, we can see that x(p (x) Q(x)) is logically equivalent to x(q(x) P (x)). Thus an alternative strategy is to consider all those values of x for which Q(x) is false, and show that in these cases P (x) is also false. This is called a proof by contrapositive. For example, let the domain of discourse be the set of integers, and let P (n) be n 2 is an even number, and Q(n) be n is an even number. In this case a direct proof of n(p (n) Q(n)) is hard to find, but a proof by contrapositive is easier: we consider all values of n for which Q(n) is false, that is all n such that n is not even, so is odd. Then n = 2k + 1 for some integer k, so n 2 = (2k + 1) 2 = 4k 2 +4k +1, which is odd. In other words we have proved that P (n) is false in all circumstances where Q(n) is false. Thus we have given a proof by contrapositive of the proposition if n is an integer such that n 2 is an even number, then n is an even number. 3 Lecture no. 4. A more powerful method of proof than either a direct proof or a proof by contrapositive, is a proof by contradiction. This uses the fact that p q p q r r. As usual, we prove this equivalence by examining a truth-table, or we can argue heuristically by saying that to prove that p implies q, it is enough to prove that you cannot have p true and q false that is, p q is a contradiction. For example, to prove that is m and n are positive integers, then ( ) m 2 n 2, we assume p q and try to deduce a contradiction. That is, we assume that m and n are positive integers, and ( ) m 2 n = 2. Now, if such positive integers exist, then n < m, and we can assume that m and n are as small as possible. Then m 2 = 2n 2, so m 2 is even, so m is even, so m = 2k for some integer k. Therefore 2n 2 = m 2 = (2k) 2 = 4k 2, and so n 2 = 2k 2. This implies that ( ) n 2 k = 2, with smaller numbers than before since n < m. This is a contradiction, and therefore we have proved the required result. Having examined the overall outline of a proof, let us look more closely at the detailed deductions or arguments used as individual steps in the proof. Each of these is essentially of the same form: we know some propositions p, q,... (called the hypotheses) to be true already, and we deduce a conclusion r, say. This

5 4 CHAPTER 1. LOGIC argument may be written in the form p q.... r Such an argument is said to be valid if whenever the hypotheses are all true, the conclusion is also true. Otherwise, it is invalid, which means that under some circumstances, all the hypotheses can be true, but the conclusion is not true. For example, the argument p q p... q is valid. We can prove this using a truth table: the only case where both of the hypotheses are true is the case when both p and q are true, and in particular the conclusion is true. On the other hand, the argument p q q... p is invalid. To see this, we find one case where the hypotheses are both true but the conclusion is false, such as the case p is false and q is true. Lecture no. 5. More complicated examples can be analysed with truth tables. The first example above can be extended to p p q q r... r or p p q q r... p q r which is again a valid argument. Indeed, if we have a whole series of propositions

6 5 P (1), P (2), and so on, we can construct a valid argument in the form P (1) P (1) P (2) P (2) P (3).... P (1) P (2) P (3)... which can also be written more compactly as P (1) k(p (k) P (k + 1))... np (n) This form of argument is called the Principle of Mathematical Induction. It is understood that the domain of discourse for these quantifiers is the set of positive integers. Example: prove that for all positive integers n, n = n(n + 1) 2 We let P (n) denote the given statement n = n(n+1), so that P (1) 2 is the statement 1 = 1 2, which is true. Now we assume that P (k) is true, that 2 is k = k(k+1) and deduce that k + (k + 1) = 2 k(k+1) + (k + 1) = (k+1)(k+2), in other words P (k + 1) is true. Thus we have 2 2 proved mathematically that P (1) is true, and that for all k, if P (k) is true then P (k + 1) is true. Hence by the Principle of Mathematical Induction, it follows that np (n) is true. Lecture no. 6. More examples of induction: 1. Prove that for all integers n, 5 n 1 is divisible by 4. For n = 1, the statement is 5 1 is divisible by 4, which is true. Now if 5 k 1 is divisible by 4, then 5 k+1 1 = 5 5 k 1 = (4 + 1) 5 k 1 = 4 5 k + 5 k 1, which is divisible by 4, since both parts 4 5 k and 5 k 1 are divisible by Prove that for all integers n 4, n! > 2 n. (Here we first define n! = n, called n factorial.) For n = 4, the statement is 4! > 2 4, i.e. 24 > 16, which is true. Now if k! > 2 k, then (k + 1)! = (k + 1) k! > (k + 1) 2 k > 2 2 k = 2 k+1.

7 6 CHAPTER 1. LOGIC The Principle of Mathematical Induction can also be expressed in the so-called strong form: k(( j(j < k P (j)) P (k))..,. np (n) which is a shorthand for T P (1) P (1) P (2) P (1) P (2) P (3) P (1) P (2) P (3) P (4).... P (1) P (2) P (3)... One example where we need the strong form is the following: prove that every positive integer (is either 1, or a prime, or) can be factorised as a product of primes. (Here we do not count 1 as a prime.)

8 Chapter 2 Basic concepts Lecture no. 7. The idea of a set as a collection of elements, without regard to ordering or repetitions. Examples {1, 2, 3, 4} and {x x is an even integer }. If a is an element of the set A we write a A. The cardinality of set X is the number of elements in it, written X. The empty set = {} has no elements in it. Two sets are equal if they have the same elements, that is, X = Y if and only if x(x X x Y and x Y x X). A set X is a subset of a set Y, written X Y, if all elements of X are elements of Y. If also X Y, then X is a proper subset of Y, written X Y or sometimes X Y. For example, A = and A A for any set A. The set of all subsets of a set X is called the power set of X, written P(X). If X = n then P(X) = 2 n this can be proved by induction. Lecture no. 8. There are various ways of combining sets: the union X Y of X and Y is the set of elements that are either in X or in Y, or both, X Y = {x x X or x Y }. Similarly the intersection X Y consists of those elements that are in both, X Y = {x x X and x Y }. These operations obey many rules analogous to the rules of logic we studied earlier. For example, A (B C) = (A B) (A C) for the same reason that in logic p (q r) = (p q) (p r). To introduce an analogue of negation, we need to introduce first the notion of a universal set U (cf. domain of discourse) which all elements of all our sets are supposed to belong to. Then the complement A of a set A is the set of all elements which are not elements in A, that is A = {x x U and x A}. Then we can write down DeMorgan s laws for sets: A B = A B and A B = A B. Moreover, we can identify the empty set with a contradiction (something that is always false), and the universal set with a tautology (something that is always true). Then there are several other useful rules such as A A = corresponding to p p = F, and A A = U corresponding to p p = T. 7

9 8 CHAPTER 2. BASIC CONCEPTS All these things can be illustrated in Venn diagrams. If we have infinitely many sets, we may take the union (or intersection) of all of them, as follows. Suppose S is a set whose elements are themselves sets. We define S = {x x S for some S S} and S = {x x S for all S S}. Thus we obtain analogues of the two quantifiers also. In particular, if S = {A 1, A 2,...}, we write S = i=1 A i = A 1 A 2 and similarly for intersections. Lecture no. 9. The difference or relative complement of two sets A and B is A B = {x x A and x B}. This is a generalisation of the complement B = U B where U is the universal set. The symmetric difference A B = (A B) (B A) is the set of elements in one or other (but not both) of A and B. Two sets are called disjoint if their intersection is the empty set. A partition is obtained by chopping up a set into non-empty, non-overlapping (i.e. pairwise disjoint) subsets. More formally, S is a partition of A if S = A, S, and if S S and T S with S T, then S T =. Examples: {{1, 2, 4}, {3, 6}, {5, 7, 8}} is a partition of the set {1, 2, 3, 4, 5, 6, 7, 8}, and {{even integers}, {odd integers}} is a partition of the set Z of all integers. Lecture no. 10. Ordered pairs, where order does matter, are written (a, b) to distinguish them from sets {a, b} where order does not matter (cf. vector notation). The Cartesian product of two sets A and B is the set of all ordered pairs where the first element is in A and the second is in B: that is, A B = {(a, b) a A and b B}. We can generalise to ordered triples (a, b, c) and the Cartesian product of three sets A B C = {(a, b, c) a A, b B, c C}, and so on. Notion of a string of length n an ordered n-tuple, but often written without the brackets and commas. Notation n i=1 a i = a 1 + a a n and n i=1 a i = a 1 a 2 a n. Compare also n i=1 A i = A 1 A 2 A n, etc. Concatenation of two strings over an alphabet A: if (a 1, a 2,..., a m ) and (b 1, b 2,..., b n ) are two strings over A (i.e. a i A and b j A), then their concatenation is (a 1, a 2,..., a m, b 1, b 2,..., b n ), of length m + n. A sequence is like an infinite string, written a 1, a 2,... or sometimes {a i } i=1 (note that, confusingly, curly brackets are usually used instead of round brackets here). Lecture no. 11. Define relations between two sets as subsets of the Cartesian product. Informal discussion as tables. Examples. The special case of relations on a set: illustration in a digraph. A relation R on a set A is reflexive if everything is related to itself, i.e. x A(xRx). It is anti-symmetric if two things cannot be related both ways round, unless they are equal, i.e. x A y A(xRy yrx x = y). It is symmetric if two things are always related both ways round or not at all, i.e. x A(xRy yrx). Examples in pictures.

10 Lecture no. 12. Definition and examples of transitive relations. Examples of relations which are (i) symmetric and not anti-symmetric, (ii) anti-symmetric and not symmetric, (iii) both, (iv) neither. An equivalence relation is one which is reflexive, symmetric and transitive. Examples: is the same colour as corresponds to a partition into different colours. We will see later that an equivalence relation always corresponds to a partition. A partial order is a relation which is reflexive, anti-symmetric and transitive. Examples: on Z, and on P(X). First look at the example X = {1, 2}, then arbitrary sets. If we have a partial order relation we can simplify the digraph to a Hasse diagram by leaving out redundant information, i.e. loops, arrows (all assumed to go up the page), and all edges which can be deduced from transitivity. Lecture no. 13. Example: the Hasse diagram of the relation on A = P(X), where X = {1, 2, 3}. Now equivalence relations correspond to partitions in the following way. If S is a partition of A, define a relation R on A by arb whenever a and b are in the same part of the partition, i.e. whenever there is a set T S with a T and b T. Then we show that R is an equivalence relation. Example: S = {{1, 3, 4}, {5}, {2, 6}}. Conversely, if R is an equivalence relation on A, we first define [a] = {x A arx}, the equivalence class of a, for each a A. Then we prove that if arb then [a] = [b]. For if arb and x [a], then arx, so xra, so xrb by transitivity, so brx, i.e. x [b]. This gives [a] [b], and a similar argument gives [b] [a], and so [a] = [b]. This enables us to prove that the equivalence classes form a partition of A. So, let S = {[a] a A}. First, for any a A we have ara and so a [a], so a S, whence A = S. Second, since a [a], it is obvious that [a]. Third, if [a] [b], then there is some x [a] [b], so arx and brx, so xrb, so arb, and by what we have already proved, [a] = [b]. These are the three conditions that define a partition, so we have proved that S is a partition of A. Example: Let A = {1, 2, 3, 4, 5, 6, 7, 8}, and define R by arb whenever a b is an integer multiple of 3. Then R is reflexive, since for all a, a a = 0 is a multiple of 3; and R is symmetric, since if arb, then a b = 3x, so b a = 3( x) and bra; and R is transitive, since if arb and brc then a b = 3x and b c = 3y, so a c = (a b)+(b c) = 3(x+y), and therefore arc. The equivalence classes are [1] = {1, 4, 7} = [4] = [7] and [2] = {2, 5, 8} = [5] = [8] and [3] = {3, 6} = [6], and the set of equivalence classes, S = {{1, 4, 7}, {2, 5, 8}, {3, 6}}, forms a partition of A. Lecture no. 14. Return to considering more general relations. Define the matrix of a relation, useful for computer storage of some relations, and we can recognise reflexive and symmetric relations from the matrix. The inverse relation of R A B is 9

11 10 CHAPTER 2. BASIC CONCEPTS R 1 = {(b, a) (a, b) R} B A. If R A B and S B C, then the composition of R and S is S R defined by S R = {(a, c) b B such that (a, b) R and (b, c) S}. So far we have only considered binary relations, that is subsets of Cartesian products A B. Similarly we can define ternary relations, which are subsets of A B C, or more generally, n-ary relations, which are subsets of A 1 A 2 A n, say. Example: between is a ternary relation on real numbers. Informal definition of functions. Examples. Lecture no. 15. Also more formal: a relation f A B is a function if and only if for all a A, there is a unique b B with (a, b) f. More normal notation for (a, b) f is f(a) = b, and if f A B we prefer to write f : A B. Almost everything in computer programming can be considered to be a function: e.g. + is a function from R R to R. If f is a function from A to B, then (in the sense defined earlier for relations) the domain of f is A, and in general the range is a subset of B. If the range is actually the whole of B, then f is called onto, or surjective. This means that every element of B occurs as f(a) for some a. In general it may occur as f(a) for many different values of a: a function where this does not happen is called one-to-one, or injective. A function which is both injective and surjective is called bijective in such a function, each element of A gives rise to a unique element of B, and vice versa, so this is sometimes called a one-to-one-correspondence. Lecture no. 16. Examples of functions which are or are not injective, surjective, bijective. Definition of inverse relation of a function f. Discussion of when it is an inverse function: we need f to be surjective and injective, i.e. bijective. In fact f has an inverse function if and only if it is bijective. Examples: f = {(1, c), (2, a), (3, b)} is a bijection between A = {1, 2, 3} and B = {a, b, c} and has an inverse function f 1 = {(c, 1), (a, 2), (b, 3)}. Similarly f : R R defined by f(x) = x 3 has inverse function f 1 (y) = 3 y. Lecture no. 17. The idea of an algorithm as a precise set of instructions for computing a function. Thus it should have the properties of: 1. Precision. To enable a computer to follow the instructions. 2. Input. 3. Output. 4. Uniqueness. The output (and intermediate steps) are uniquely determined by the input.

12 11 5. Generality. It should apply to a whole set of possible inputs. 6. Finiteness. It must stop and output the answer after a finite nunber of steps. Example: the Division Algorithm If a and b are positive integers, to divide a by b and get a quotient q and remainder r (satisfying a = bq +r and 0 r < b). Example: Euclid s algorithm. If a and b are positive integers, then c is a common divisor if c divides a and c divides b. Define also the greatest common divisor, written g.c.d.(a, b). Then if a = bq + r we can show that g.c.d.(a, b) = g.c.d.(b, r). Hence by repeated application of the division algorithm we eventually get a remainder of 0, at which point b is the greatest common divisor. Working backwards, we can express g.c.d.(a, b) in the form ax + by where x and y are integers (in fact one will be positive and the other negative). Examples.

13 12 CHAPTER 2. BASIC CONCEPTS

14 Chapter 3 Counting methods Lecture no. 18. Multiplication principle. That is, A B = A B. Example: if a set has n elements, then it has 2 n subsets. Addition principle. That is, if A and B are disjoint sets, then A B = A + B. In general, A B = A + B A B, since the elements of A B have been counted twice. (This is the simplest case of inclusion exclusion.) Generalize this to A B C = A + B + C A B A C B C + A B C. First proof: how many times is each element counted? Second proof: formally from the previous result. Examples. Lecture no. 19. Permutations and combinations. Define: r-permutation of n things. The number of such is P (n, r) = n(n 1)... (n r + 1). Define: r-combinations of n things. Here the ordering of the r things doesn t matter, so the number of such things is C(n, r) = P (n, r)/n! Examples. (Poker hands, etc.) Lecture no. 20. Generalised permutations and combinations. Example: number of anagrams 11! of MISSISSIPPI is. The general formula. Another example; number of 4!4!2!1! ways of distributing six pints of beer between John, Fred and Tom. Another example: the coefficient of x 2 y 3 z 4 in the expansion of (x + y + z) 9. Lecture no. 21. Either some formulae like n C(n, k) = 2 n k=0 and the binomial theorem; or more examples of what we ve just done; or revision. Lecture no. 22. Revision. Unfortunately, the graph theory seems to have fallen off the end of the syllabus. 13

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

### Sets, Relations and Functions

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

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

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

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

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

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

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

### SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

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

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

### Classical Analysis I

Classical Analysis I 1 Sets, relations, functions A set is considered to be a collection of objects. The objects of a set A are called elements of A. If x is an element of a set A, we write x A, and if

### Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

### The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

### Solutions to In-Class Problems Week 4, Mon.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

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

### Introducing Functions

Functions 1 Introducing Functions A function f from a set A to a set B, written f : A B, is a relation f A B such that every element of A is related to one element of B; in logical notation 1. (a, b 1

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

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

### 1.1 Logical Form and Logical Equivalence 1

Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic

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

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

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

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

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

### This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

### Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

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)

### S(A) X α for all α Λ. Consequently, S(A) X, by the definition of intersection. Therefore, X is inductive.

MA 274: Exam 2 Study Guide (1) Know the precise definitions of the terms requested for your journal. (2) Review proofs by induction. (3) Be able to prove that something is or isn t an equivalence relation.

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

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

### Discrete Mathematics. Hans Cuypers. October 11, 2007

Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................

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

### Sets and set operations: cont. Functions.

CS 441 Discrete Mathematics for CS Lecture 8 Sets and set operations: cont. Functions. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Set Definition: set is a (unordered) collection of objects.

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### Foundations of Logic and Mathematics

Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic

### Week 5: Binary Relations

1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all

### Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Colin Stirling Informatics Slides originally by Kousha Etessami Colin Stirling (Informatics) Discrete Mathematics (Chapter 6) Today 1 /

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

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

### Examination paper for MA0301 Elementær diskret matematikk

Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750

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

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

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

### Relations Graphical View

Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary

### In mathematics there are endless ways that two entities can be related

CHAPTER 11 Relations In mathematics there are endless ways that two entities can be related to each other. Consider the following mathematical statements. 5 < 10 5 5 6 = 30 5 5 80 7 > 4 x y 8 3 a b ( mod

### CS 341 Homework 9 Languages That Are and Are Not Regular

CS 341 Homework 9 Languages That Are and Are Not Regular 1. Show that the following are not regular. (a) L = {ww R : w {a, b}*} (b) L = {ww : w {a, b}*} (c) L = {ww' : w {a, b}*}, where w' stands for w

Some Definitions about Sets Definition: Two sets are equal if they contain the same elements. I.e., sets A and B are equal if x[x A x B]. Notation: A = B. Recall: Sets are unordered and we do not distinguish

### Notes. Sets. Notes. Introduction II. Notes. Definition. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.

Sets Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction

### Sets. A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object.

Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

### Discrete Mathematics Lecture 5. Harper Langston New York University

Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = -1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of

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

### CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### Induction. Mathematical Induction. Induction. Induction. Induction. Induction. 29 Sept 2015

Mathematical If we have a propositional function P(n), and we want to prove that P(n) is true for any natural number n, we do the following: Show that P(0) is true. (basis step) We could also start at

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

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### Math 223 Abstract Algebra Lecture Notes

Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### 4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

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

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

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

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

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

### Basic Concepts of Set Theory, Functions and Relations

March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2 1.3. Identity and cardinality...3

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

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

### You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

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

### Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.

Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is

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

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

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

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

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

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

### We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

### CHAPTER 1. Basic Ideas

CHPTER 1 asic Ideas In the end, all mathematics can be boiled down to logic and set theory. ecause of this, any careful presentation of fundamental mathematical ideas is inevitably couched in the language

### Introduction Russell s Paradox Basic Set Theory Operations on Sets. 6. Sets. Terence Sim

6. Sets Terence Sim 6.1. Introduction A set is a Many that allows itself to be thought of as a One. Georg Cantor Reading Section 6.1 6.3 of Epp. Section 3.1 3.4 of Campbell. Familiar concepts Sets can

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

### Lecture 4 -- Sets, Relations, Functions 1

Lecture 4 Sets, Relations, Functions Pat Place Carnegie Mellon University Models of Software Systems 17-651 Fall 1999 Lecture 4 -- Sets, Relations, Functions 1 The Story So Far Formal Systems > Syntax»

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

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

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

### Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

### Lecture Notes on Discrete Mathematics

Lecture Notes on Discrete Mathematics A. K. Lal September 26, 2012 2 Contents 1 Preliminaries 5 1.1 Basic Set Theory.................................... 5 1.2 Properties of Integers.................................

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering