# Discrete Mathematics. Some related courses. Assessed work. Motivation: functions. Motivation: sets. Exercise. Motivation: relations

Save this PDF as:

Size: px
Start display at page:

Download "Discrete Mathematics. Some related courses. Assessed work. Motivation: functions. Motivation: sets. Exercise. Motivation: relations"

## Transcription

1 Discrete Mathematics Philippa Gardner This course is based on previous lecture notes by Iain Phillips. K.H. Rosen. Discrete Mathematics and its Applications, McGraw Hill J.L. Gersting. Mathematical Structures for Computer Science, Freeman J.K. Truss. Discrete Mathematics for Computer Science, Addison-Wesley R. Johnsonbaugh. Discrete Mathematics, Prentice Hall C. Schumacher, Fundamental Notions of Abstract Mathematics, Addison-Wesley Some related courses 1. Mathematical reasoning: logic 2. Mathematical reasoning: programming 3. Mathematical reasoning: discrete maths (continued) 4. Haskell 5. Databases In particular, we will use some of the notation introduced in the logic course: Assessed work Assessed exercises Week 7: submission date Tuesday, November 23th. Week 9: submission date Tuesday, December 7th. Assessed Test in week 11. Exam at the end of the year. A B A B A A B A B x.a x.a 3 4 Sets are like types in Haskell. Motivation: sets Haskell type declaration: data Bool = False True Set of Boolean values: {False, True} List of Boolean values: [True, False, True, False] Set equality {False, True} = {True, False, True, False} Haskell function Motivation: functions myand :: Bool -> Bool -> Bool myand False False = False myand False True = False myand True False = False myand True True = True Computable function described for example using Turing machines. This course explores the notion of mathematical function. 5 6 Motivation: relations 1. The class of the first-year Computer Science students, year George W Bush is the son of George Bush 3. 2 < 3 4. One program is equivalent to another program. Exercise Are these Haskell functions equivalent? myand :: Bool -> Bool -> Bool myand False False = False myand False True = False myand True False = False myand True True = True myand :: Bool -> Bool -> Bool myand False x = False myand True x = x 7 8

2 Answer Equivalence of Haskell Functions The functions myand and myand do not behave in the same way in the presence of the constant function bottom: bottom :: Bool bottom = bottom Is the following function equivalent to myand and myand? myand :: Bool -> Bool -> Bool myand b1 b2 = if b1 then b2 else False Two Haskell functions f : A B and g : A B behave in the same way if and only if, for all terms a in type A, then if f a terminates then g a terminates and f a = g a, and if f a does not terminate then g a does not terminate. In this course, we explore the abstract concept of relations Exercise Are the following Haskell functions equivalent? g [] y False = 1 g [] True False = 2 g xs y z = 3 g [] y False = 1 g xs y z = 3 Informal definition Sets A set is a collection of objects (or individuals) taken from a pool of objects. The objects in a set are also called the elements, or members, of the set. A set is said to contain its elements. We write x A when object x is a member of set A. We write x A, or (x A), when x is not a member of A vowels {a, e, i, o, u} 2. arbitrary (nonsense) set {1, 2, e, f, 5, Imperial} 3. natural numbers N = {0, 1, 2, 3,...} 4. integers Z = {..., 3, 2, 1, 0, 1, 2, 3,...} 5. primes P = {x N : x is a prime number} 6. empty set = { } 7. nested sets, such as {{a, e, i, o, u}, { }} Comparing sets: subsets Let A, B be any two sets, Then A is a subset of B, written A B, if and only if all the elements of A are also elements of B: that is, A B objects x.(x A x B) Object x comes from an underlying universe of discourse, sometimes written U Analogy Similar to sublist from the Haskell course. The following function h takes a list of integers and an integer n, and returns a sublist of elements less than n: h:: [Int] -> Int -> [Int] h xs n = filter (<n) xs Caution: lists are different from sets. A A, A set {a, b} {a, b, c} {c, c, b} {a, b, c, d} N Z {1, 2, 5} 15 16

3 Let A, B, C be arbitrary sets. If A B and B C then A C. Proof Assume that A, B and C are arbitrary sets. Assume that A B and B C. Assume x A. By assumption, we know that A B. By the definition of the subset relation, x B. We also know that B C, and hence x C as required. 17 Comparing sets: equality Let A, B be any two sets. Then A equals B, written A = B, if and only if A B and B A: that is, A = B A B B A The sets {a, b, c} and {b, a, a, c} are equal sets. The lists [a, b, c] and [b, a, a, c] are not equal lists. 18 Constructing Sets List elements inside curly brackets: V = {a, e, i, o, u} N = {0, 1, 2,...} {, {a}, {b}, {a, b}} Define a set by stating the property that its elements must satisfy: Russel s paradox P = {x N : x is a prime number} R = {x : x is a real number} S = {X : X X} is not well-defined. 19 Basic Set Constructors Let A and B be any sets: Union A B = {x : x A x B} Intersection A B = {x : x A x B} Difference A B = {x : x A x B} Symmetric difference A B = (A B) (B A) 20 Example Properties of operators Let A = {1, 3, 5, 7, 9} and B = {3, 5, 6, 10, 11}. Then A B = {1, 3, 5, 6, 7, 9, 10, 11} A B = {3, 5} A B = {1, 7, 9} A B = {1, 7, 9, 6, 10, 11} It is often helpful to illustrate these combinations of sets using Venn diagrams. 21 Commutativity A B = B A A B = B A Associativity A (B C) = (A B) C A (B C) = (A B) C Distributivity A (B C) = (A B) (A C) A (B C) = (A B) (A C) 22 Idempotence A A = A A A = A Empty set A = A A = Absorption A (A B) = A A (A B) = A Proposition Let A, B and C be arbitrary sets. Then A (B C) = (A B) (A C). Proof Let A, B and C be arbitrary sets. We prove 1. A (B C) (A B) (A C) 2. (A B) (A C) A (B C) To prove part 1, assume x A (B C) for arbitrary x. By definition, x A or x B C. By definition, either x A, or x is in both B and C. By distributivity, x A or x B, and x A or x C. This means that x A B and x A C, and hence x (A B) (A C). Exercise Prove part Proposition Let A, B and C be arbitrary sets. Then A (B C) = (A B) (A C). Alternative Proof Let A, B and C be arbitrary sets. A (B C) = {x : x A x (B C)} = {x : x A (x B x C)} = {x : (x A x B) (x A x C)} = {x : (x A B) (x A C)} = {x : x (A B) (A C)} We will go through some more examples in the tutorial. 24

4 The statement A (B C) = (A B) (A C) is false. A simple counter-example is A = {a}, B = {b} and C = {c}, where a, b and c are different. The statement is true when A (B C) = and (B C) A =. The statement A (B C) = (A B) C is false. A counter-example is A = {a}, B = and C = {c} for a different from c. The statement is true when A (B C) = and C (A B) =. Definition Let A be a finite set. The cardinality of A, written A, is the number of elements contained in A. Notice the similarity with the length function over lists. {a, e, i, o, u} = 5 = 0 N = undefined for now Powerset Proposition Let A and B be finite sets. Then A B = A + B A B Informal proof The number A + B counts the elements of A B twice, so we abstract A B to obtain the result. A consequence of this proposition is that, if A and B are disjoint sets, then A B = A + B. Definition Let A be any set. Then the powerset of A, written P(A), is {X : X A}. P({a, b}) = {, {a}, {b}, {a, b}} P( ) = { } P(N ) = {, {1}, {2},..., {1, 2}, {1, 3},..., {2, 3},..., {1, 2, 3},...} Proposition Let A be a finite set with A = n. Then P(A) = 2 n. Proof given in lectures and notes. Not required Cartesian (or binary) product An ordered pair (a, b) is a pair of objects a and b where the order of a and b matters. For any objects a,b, c, d, we have (a, b) = (c, d) if and only if a = c and b = d. Definition Let A and B be arbitrary sets. The Cartesian (or binary) product of A and B, written A B, is {(a, b) : a A b B}. 1. The coordinate system of real numbers R Computer marriage bureau: let M be the set of men registered and W the set of women, then the set of all possible matches is M W. 3. Products are analogous to the product types of Haskell. (Int, Char) is Haskell s notation for the product Int Char. We sometimes write A 2 instead of A A Proposition Let A and B be finite sets. Then A B = A B. Proof Suppose that A and B are arbitrary sets with A = {a 1,..., a m } and B = {b 1,..., b n }. Draw a table with m rows and n columns of the members of A B: (a 1, b 1 ) (a 1, b 2 )... (a 2, b 1 ) (a 2, b 2 ) Such a table has m n entries. You do not need to remember this proof. n-ary product For any n 1, an n-tuple is a sequence (a 1,..., a n ) of n objects where the order of the a i matter. Definition Let A 1,..., A n be arbitrary sets. The n-ary product of the A i, written A 1... A n or n i=1 A i, is {(a 1,..., a n ) : a i A i for 1 i n}. The n-ary product of As is written A n, with A 2 corresponding to the Cartesian product

5 1. The three dimensional space of real numbers R The set timetable = day time room courseno. A typical element is (Wednesday, 11.00, 308, 140). In Haskell notation, this timetable example can be given by: type Day = String type Time = (Int, Int)... type Timetable = (Day, Time, Room, CourseNo) (Wednesday, (11,00), 308, 140) :: Timetable 33 who : Name; height : Real; age : [ ]; eyecolour : Colour; dateofbirth : Date END Just like products, records can be nested: Date = RECORD day : [1...31]; month : [1...12]; year : [ ] 34 END This record is like a Haskell type augmented with projector functions: type Name = String type Colour = String type Date = (Int, Int) type Person = (Name, Float, Int, Colour, Date) who :: Person -> Name height :: Person -> Float age :: Person -> Int eyecolour :: Person -> Colour dateofbirth :: Person -> Date Proposition Let A i be finite sets for each 1 i n. Then A 1... A n = A 1... A n. This fact can be simply proved by the induction principle introduced next term. height (_, h, _, _, _) = h Future We can form the product of three sets in three different ways: A B C (A B) C A (B C) There is a natural correspondence between these three sets. We will make this intuition precise later in the course. 37

### Discrete Maths. Philippa Gardner. These lecture notes are based on previous notes by Iain Phillips.

Discrete Maths Philippa Gardner These lecture notes are based on previous notes by Iain Phillips. This short course introduces some basic concepts in discrete mathematics: sets, relations, and functions.

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

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

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

### Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

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

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

### Discrete Mathematics Set Operations

Discrete Mathematics 1-3. Set Operations Introduction to Set Theory A setis a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects.

### Clicker Question. Theorems/Proofs and Computational Problems/Algorithms MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES Tuesday, 1/21/14 General course Information Sets Reading: [J] 1.1 Optional: [H] 1.1-1.7 Exercises: Do before next class; not to hand in [J] pp. 12-14:

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

### Discrete Mathematics

Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 16, 2009 2.1 Sets 2.1 Sets 2.1 Sets Basic Notations for Sets For sets, we ll use variables S, T, U,. We can

### 2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

### What is a set? Sets. Specifying a Set. Notes. The Universal Set. Specifying a Set 10/29/13

What is a set? Sets CS 231 Dianna Xu set is a group of objects People: {lice, ob, Clara} Colors of a rainbow: {red, orange, yellow, green, blue, purple} States in the S: {labama, laska, Virginia, } ll

### Lecture 1. Basic Concepts of Set Theory, Functions and Relations

September 7, 2005 p. 1 Lecture 1. Basic Concepts of Set Theory, Functions and Relations 0. Preliminaries...1 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2

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

### 1 / Basic Structures: Sets, Functions, Sequences, and Sums - definition of a set, and the use of the intuitive notion that any property whatever there

C H A P T E R Basic Structures: Sets, Functions, Sequences, and Sums.1 Sets. Set Operations.3 Functions.4 Sequences and Summations Much of discrete mathematics is devoted to the study of discrete structures,

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

### Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

### Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi

Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the

### CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

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

### Mathematics for Computer Science

Mathematics for Computer Science Lecture 2: Functions and equinumerous sets Areces, Blackburn and Figueira TALARIS team INRIA Nancy Grand Est Contact: patrick.blackburn@loria.fr Course website: http://www.loria.fr/~blackbur/courses/math

### Definition 14 A set is an unordered collection of elements or objects.

Chapter 4 Set Theory Definition 14 A set is an unordered collection of elements or objects. Primitive Notation EXAMPLE {1, 2, 3} is a set containing 3 elements: 1, 2, and 3. EXAMPLE {1, 2, 3} = {3, 2,

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

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

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

### The Set Data Model CHAPTER 7. 7.1 What This Chapter Is About

CHAPTER 7 The Set Data Model The set is the most fundamental data model of mathematics. Every concept in mathematics, from trees to real numbers, is expressible as a special kind of set. In this book,

### Lecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett

Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.

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

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

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

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

### Basic Set Theory. Chapter Set Theory. can be written: A set is a Many that allows itself to be thought of as a One.

Chapter Basic Set Theory A set is a Many that allows itself to be thought of as a One. - Georg Cantor This chapter introduces set theory, mathematical induction, and formalizes the notion of mathematical

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

### + Section 6.2 and 6.3

Section 6.2 and 6.3 Learning Objectives After this section, you should be able to DEFINE and APPLY basic rules of probability CONSTRUCT Venn diagrams and DETERMINE probabilities DETERMINE probabilities

### Discrete Mathematics: Solutions to Homework (12%) For each of the following sets, determine whether {2} is an element of that set.

Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square

### Logic in Computer Science: Logic Gates

Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers

### 0N1 (MATH19861) Mathematics for Foundation Year. math19861.html. Lecture Notes.

0N1 (MATH19861) Mathematics for Foundation Year http://www.maths.manchester.ac.uk/~avb/ math19861.html Lecture Notes 16 Sep 2016 0N1 Mathematics Course Arrangements 16 Sep 2016 2 Arrangements for the Course

### Basic Set Theory. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX 502 - Semantics I September 11, 2008

Basic Set Theory LX 502 - Semantics I September 11, 2008 1. Motivation When you start reading these notes, the first thing you should be asking yourselves is What is Set Theory and why is it relevant?

### This chapter is all about cardinality of sets. At first this looks like a

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

### Inf1A: Deterministic Finite State Machines

Lecture 2 InfA: Deterministic Finite State Machines 2. Introduction In this lecture we will focus a little more on deterministic Finite State Machines. Also, we will be mostly concerned with Finite State

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

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

### Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### 2.1 Symbols and Terminology

2.1 Symbols and Terminology Definitions: set is a collection of objects. The objects belonging to the set are called elements, ormembers, oftheset. Sets can be designated in one of three different ways:

### Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of

### LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

### Chapter 3: The basic concepts of probability

Chapter 3: The basic concepts of probability Experiment: a measurement process that produces quantifiable results (e.g. throwing two dice, dealing cards, at poker, measuring heights of people, recording

### Problem Set I: Preferences, W.A.R.P., consumer choice

Problem Set I: Preferences, W.A.R.P., consumer choice Paolo Crosetto paolo.crosetto@unimi.it Exercises solved in class on 18th January 2009 Recap:,, Definition 1. The strict preference relation is x y

### Set Theory. 2.1 Presenting Sets CHAPTER2

CHAPTER2 Set Theory 2.1 Presenting Sets Certain notions which we all take for granted are harder to define precisely than one might expect. In Taming the Infinite: The Story of Mathematics, Ian Stewart

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

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

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

### Resolution. Informatics 1 School of Informatics, University of Edinburgh

Resolution In this lecture you will see how to convert the natural proof system of previous lectures into one with fewer operators and only one proof rule. You will see how this proof system can be used

### Set Theory Basic Concepts and Definitions

Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric

### A Course in Discrete Structures. Rafael Pass Wei-Lung Dustin Tseng

A Course in Discrete Structures Rafael Pass Wei-Lung Dustin Tseng Preface Discrete mathematics deals with objects that come in discrete bundles, e.g., 1 or 2 babies. In contrast, continuous mathematics

### 4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### Computability Theory

CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.

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

### Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of sample space, event and probability function. 2. Be able to

### Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common

### Regular Languages and Finite Automata

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

### A Little Set Theory (Never Hurt Anybody)

A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra

### Course Syllabus. MATH 1350-Mathematics for Teachers I. Revision Date: 8/15/2016

Course Syllabus MATH 1350-Mathematics for Teachers I Revision Date: 8/15/2016 Catalog Description: This course is intended to build or reinforce a foundation in fundamental mathematics concepts and skills.

### Basic Probability Concepts

page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes

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

### Regular Expressions and Automata using Haskell

Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions

### FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

### Basic concepts in probability. Sue Gordon

Mathematics Learning Centre Basic concepts in probability Sue Gordon c 2005 University of Sydney Mathematics Learning Centre, University of Sydney 1 1 Set Notation You may omit this section if you are

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### 1 Introduction to Counting

1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can

### Foundations of Mathematics I Set Theory (only a draft)

Foundations of Mathematics I Set Theory (only a draft) Ali Nesin Mathematics Department Istanbul Bilgi University Kuştepe Şişli Istanbul Turkey anesin@bilgi.edu.tr February 12, 2004 2 Contents I Naive

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

### Book of Proof. Richard Hammack Virginia Commonwealth University

Book of Proof Richard Hammack Virginia Commonwealth University Richard Hammack (publisher) Department of Mathematics & Applied Mathematics P.O. Box 842014 Virginia Commonwealth University Richmond, Virginia,

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

### THE PRODUCT SPAN OF A FINITE SUBSET OF A COMPLETELY BOUNDED ARTEX SPACE OVER A BI-MONOID

THE PRODUCT SPAN OF A FINITE SUBSET OF A COMPLETELY BOUNDED ARTEX SPACE OVER A BI-MONOID ABSTRACT The product of subsets of an Artex space over a bi-monoid is defined. Product Combination of elements of

### THE LANGUAGE OF SETS AND SET NOTATION

THE LNGGE OF SETS ND SET NOTTION Mathematics is often referred to as a language with its own vocabulary and rules of grammar; one of the basic building blocks of the language of mathematics is the language

### Deterministic Finite Automata

1 Deterministic Finite Automata Definition: A deterministic finite automaton (DFA) consists of 1. a finite set of states (often denoted Q) 2. a finite set Σ of symbols (alphabet) 3. a transition function

### Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets.

Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets. Logic is the study of reasoning. A language of propositions is fundamental to this study as well as true

### Structural properties of oracle classes

Structural properties of oracle classes Stanislav Živný Computing Laboratory, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK Abstract Denote by C the class of oracles relative

### Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

### All of mathematics can be described with sets. This becomes more and

CHAPTER 1 Sets All of mathematics can be described with sets. This becomes more and more apparent the deeper into mathematics you go. It will be apparent in most of your upper level courses, and certainly

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

### MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

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

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

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

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

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### FIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3

FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges

### Continued Fractions and the Euclidean Algorithm

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

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Georg Cantor and Set Theory

Georg Cantor and Set Theory. Life Father, Georg Waldemar Cantor, born in Denmark, successful merchant, and stock broker in St Petersburg. Mother, Maria Anna Böhm, was Russian. In 856, because of father

### LESSON SUMMARY. Set Operations and Venn Diagrams

LESSON SUMMARY CXC CSEC MATHEMATICS UNIT Three: Set Theory Lesson 4 Set Operations and Venn Diagrams Textbook: Mathematics, A Complete Course by Raymond Toolsie, Volumes 1 and 2. (Some helpful exercises

### Étale groupoids and their morphisms

Étale groupoids and their morphisms Ganna Kudryavtseva University of Ljubljana Semigroup Representations 2013 Edinburgh Ganna Kudryavtseva (Ljubljana) Étale groupoids and their morphisms April 11, 2013