Sets & Functions. x A. 7 Z, 2/3 Z, Z pow(r) Examples: {7, Albert R., π/2, T} x is a member of A: x A

Similar documents
Three Profound Theorems about Mathematical Logic

Relations & Functions

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.

Mathematics Review for Business PhD Students

RELATIONS AND FUNCTIONS

mcs 2015/5/18 1:43 page 87 #95

Sets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions

Chapter 2 - Basics Structures

CS100: DISCRETE STRUCTURES

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth

Relations. Functions. Bijection and counting.

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60

Functions. Given a function f: A B:

MATH 3300 Test 1. Name: Student Id:

1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9

Propositional Logic, Predicates, and Equivalence

Today s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions

Practice Exam 1 CIS/CSE 607, Spring 2009

Functions Functions and Modeling A UTeach/TNT Course

Functions as Relations

Chapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.

Selected problems from past exams

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.

Background for Discrete Mathematics

Chapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability

Mathematics Review for Business PhD Students Lecture Notes

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

Introduction to Automata

Definition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.

9/21/2018. Properties of Functions. Properties of Functions. Properties of Functions. Properties of Functions. Properties of Functions

Chapter 7. Inclusion-Exclusion a.k.a. The Sieve Formula

Cartesian Products and Relations

1 Take-home exam and final exam study guide

Section 4.4 Functions. CS 130 Discrete Structures

REVIEW FOR THIRD 3200 MIDTERM

Paradox and Infinity Problem Set 6: Ordinal Arithmetic

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Math Fall 2014 Final Exam Solutions

CHAPTER 7 FUNCTIONS. Alessandro Artale UniBZ - artale/

Section 7.2: One-to-One, Onto and Inverse Functions

Reading 11 : Relations and Functions

Automata Theory and Formal Grammars: Lecture 1

AMB111F Notes 1: Sets and Real Numbers

CSCE 222 Discrete Structures for Computing

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Sets McGraw-Hill Education

Discussion Summary 10/16/2018

A function is a special kind of relation. More precisely... A function f from A to B is a relation on A B such that. f (x) = y

CITS2211 Discrete Structures (2017) Cardinality and Countability

MATH 22 FUNCTIONS: COMPOSITION & INVERSES. Lecture N: 10/16/2003. Mad world! mad kings! mad composition! Shakespeare, King John, II:1

S15 MA 274: Exam 3 Study Questions

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.

Review of Functions. Functions. Philippe B. Laval. Current Semester KSU. Philippe B. Laval (KSU) Functions Current Semester 1 / 12

SET THEORY. Disproving an Alleged Set Property. Disproving an Alleged Set. Example 1 Solution CHAPTER 6

Automata and Languages

Mathematical Preliminaries. Sipser pages 1-28

MATH 2200 Final Review

Functions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014

Chapter 9: Relations Relations

Review Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which

Exclusive Disjunction

Numbers, sets, and functions

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Real Analysis. Joe Patten August 12, 2018

9/19/2018. Cartesian Product. Cartesian Product. Partitions

INFINITY: CARDINAL NUMBERS

Solutions to In Class Problems Week 4, Mon.

Algebraic Geometry Spring 2009

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Spring

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)

Set Notation and the Real Numbers

1.1 Introduction to Sets

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall

Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006

Math 5801 General Topology and Knot Theory

Outline. Sets. Relations. Functions. Products. Sums 2 / 40

Principles of Real Analysis I Fall I. The Real Number System

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Sets. Introduction to Set Theory ( 2.1) Basic notations for sets. Basic properties of sets CMSC 302. Vojislav Kecman

SETS AND FUNCTIONS JOSHUA BALLEW

4 Mathematical Data Types

All numbered readings are from Beck and Geoghegan s The art of proof.

Section Summary. Definition of a Function.

Relations, Functions, and Sequences

ABOUT THE CLASS AND NOTES ON SET THEORY

COMP9020 Lecture 3 Session 2, 2016 Sets, Functions, and Sequences. Revision: 1.3

φ(a + b) = φ(a) + φ(b) φ(a b) = φ(a) φ(b),

Algebraic Geometry

1. Decide for each of the following expressions: Is it a function? If so, f is a function. (i) Domain: R. Codomain: R. Range: R. (iii) Yes surjective.

Lecture 5: Minimizing DFAs

Chapter 1 : The language of mathematics.

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Section Summary. Definition of a Function.

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Axioms for Set Theory

CHAPTER THREE: RELATIONS AND FUNCTIONS

Transcription:

Mathematics for Computer Science MIT 6.042J/18.062J Sets & Functions What is a Set? Informally: set is a collection of mathematical objects, with the collection treated as a single mathematical object. (This is circular of course: what s a collection?) lec 2F.1 lec 2F.2 Some sets real numbers, R complex numbers, C integers, Z empty set, set of all subsets of integers, pow(z) the power set Some sets {7, lbert R., π/2, T} set with 4 elements: two numbers, a string, and a oolean. Same as {T, lbert R., 7, π/2} -- order doesn t matter lec 2F.3 lec 2F.4 Membership x is a member of : x π/2 {7, lbert R., π/2, T} π/3 {7, lbert R., π/2, T} 14/2 {7, lbert R., π/2, T} Synonyms for Membership x x is an element of x is in Examples: 7 Z, 2/3 Z, Z pow(r) lec 2F.5 lec 2F.6 1

In or Not In n element is in or not in a set: {7, π/2, 7} is same as {7, π/2} (No notion of being in the set more than once) Subset ( ) is a subset of is contained in Every element of is also an element of : x [x IMPLIES x ] lec 2F.7 lec 2F.8 examples: Subset Z R, R C, {3} {5,7,3}, every set everything def: x [x IMPLIES x ] false true lec 2F.9 lec 2F.10 New sets from old union Venn Diagram for 2 Sets lec 2F.14 lec 2F.15 2

intersection set difference lec 2F.16 lec 2F.17 set-theoretic equality set-theoretic equality ( C) = ( ) ( C) proof: Show these have the same elements, namely, x Left Hand Set iff x RHS for all x. ( C) = ( ) ( C) proof uses fact from last time: P OR (Q ND R) equiv (P OR Q) ND (P OR R) lec 2F.18 lec 2F.19 set-theoretic equality set-theoretic equality ( C) = ( ) ( C) proof: x ( C) x OR x ( C) iff (def of ) iff x OR (x ND x C) (def ) iff (x OR x ) ND (x OR x C) (by the equivalence) proof: (x OR x )ND(x OR x C) iff (x )ND(x C) (def ) iff x ( ) ( C) (def ). QED lec 2F.20 lec 2F.21 3

is taking subject relation Relations & Functions students is taking subjects 6.042 6.003 6.012 lec 2F.25 Feb 17 Image by MIT OpenCourseWare. Copyright lec 2F.26 formula evaluation relation arithmetic formulas numbers evaluates to 1+2 3 nonstop bus trip relation cities cities nonstop bus oston oston sqrt(9) Providence Providence 50/10 3 2 New York New York Feb 17 Copyright lec 2F.27 lec 2F.28 inary relations binary relation, R, from a set to a set associates of elements of with elements of. inary relation R from to domain R: codomain b 1 a 1 b 2 a 2 b 3 a 3 arrows b 4 lec 2F.33 Feb 17 lec 2F.34 4

inary relation R from to domain R: codomain b 1 inary relation R from to R: b 1 a 1 b 2 a 1 b 2 a 2 b 3 a 2 b 3 a 3 b 4 Feb. 17, a 3 graph(r) ::= the arrows b 4 lec 2F.35 Feb. 17, graph(r) = {(a 1,b 2 ), (a 1,b 4 ), (a 3,b 4 )} lec 2F.37 archery on relations,, = 1 arrow out,,= 1 arrow in f: function, f, from to is a relation which associates each element, a, of with at most one element of. called f(a) Feb. 17, 2009 lec 2F.38 Feb. 17, lec 2F.39 function archery function archery 1 arrow out 1 arrow out Feb. 17, 2009 lec 2F.40 Feb. 17, 2009 lec 2F.41 5

function archery 1 arrow out f( ) = total relations R: is total iff every element of is associated with at least one element of Feb. 17, 2009 lec 2F.42 Feb. 17, 2009 lec 2F.44 total relation archery total relation archery 1 arrow out 1 arrow out Feb. 17, 2009 lec 2F.45 Feb. 17, 2009 lec 2F.46 1 arrow out total relation archery total & function archery exactly 1 arrow out f( ) = Feb. 17, 2009 lec 2F.47 Feb. 17, 2009 lec 2F.49 6

surjections (onto) R: is a surjection iff every element of is associated with some element of surjection archery 1 arrow in Feb. 17, 2009 lec 2F.53 Feb. 17, 2009 lec 2F.54 surjection archery surjection archery 1 arrow in 1 arrow in Feb. 17, 2009 lec 2F.55 Feb. 17, 2009 lec 2F.56 surjective & function injection archery 1 arrow out 1 arrow in 1 arrow in Feb. 17, 2009 lec 2F.58 Feb. 17, 2009 lec 2F.62 7

injection archery injection archery 1 arrow in 1 arrow in Feb. 17, 2009 lec 2F.63 Feb. 17, 2009 lec 2F.64 bijection archery exactly 1 arrow out exactly 1 arrow in Team Problems Problems 1 3 Feb. 17, 2009 Copyright lbert R. February Meyer, 12, 2009. 2010 ll rights reserved. lec 2F.69 lec 2F.71 8

MIT OpenCourseWare http://ocw.mit.edu 6.042J / 18.062J Mathematics for Computer Science Spring 2010 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.