Sets. Subsets. for any set A, A and A A vacuously true: if x then x A transitivity: A B, B C = A C N Z Q R C. C-N Math Massey, 72 / 125
|
|
- Egbert Jonathan Parker
- 5 years ago
- Views:
Transcription
1 Subsets Sets A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A x A x B A B means A is a proper subset of B A B but A B, so x B x / A Illustrate with a Venn diagram. C-N Math Massey, 71 / 125
2 Subsets Sets for any set A, A and A A vacuously true: if x then x A transitivity: A B, B C = A C N Z Q R C C-N Math Massey, 72 / 125
3 Sets Union / Intersection / Complement union A B = {x x A or x B} intersection A B = {x x A and x B} Let U be the universe that contains all objects under consideration. complement A = A c = {x U x / A} A and B are disjoint if A B = relative complement A\B = A B = {x A x / B} = A B C-N Math Massey, 73 / 125
4 Set Example Sets U = {x N x 10} A = {x U x is odd } B = {x U x is prime } Illustrate with a Venn diagram. C-N Math Massey, 74 / 125
5 Algebra of Sets Sets A U = U and A U = A what about? A A = U ; A A = A = A A (B C ) = (A B) C Demonstrate that A (B C ) (A B) C with a VD, and construct a specific counter-example. distributive laws, DeMorgan s laws, etc. C-N Math Massey, 75 / 125
6 United Kingdom Sets C-N Math Massey, 76 / 125
7 Nerds Sets C-N Math Massey, 77 / 125
8 Symmetric Difference Sets symmetric difference A B = (A B) (A B) (A or B) but not (A and B) equilalently A B = (A B) (B A) Show that is commutative and associative. Sketch the Venn diagram of A B C see [wiki] C-N Math Massey, 78 / 125
9 Cardinality Sets S is the cardinality or size of the S Inclusion-Exclusion Principle: if A and B are finite, then A B = A + B A B. Generalize to obtain a formula for A B C. C-N Math Massey, 79 / 125
10 Power Set Sets A meta-set is often referred to as a collection of sets. power set of A: the set of all subsets of A P(A) = {B B A} remember that sets are unordered P(A) = 2 A C-N Math Massey, 80 / 125
11 Partitions Sets Let S be a nonempty set. The collection of nonempty subsets {A i } is a partition of S if each x S belongs to exactly one of the A i. The A i are called cells or blocs. S = A i A i A j = if i j evens / odds conferences C-N Math Massey, 81 / 125
12 Cartesian Product Sets Cartesian product is the set of ordered pairs: A B = {(a, b) a A, b B} one coordinate from each set generalize to n-tuples, e.g. A B C A 2 = A A find the formula for A B C-N Math Massey, 82 / 125
13 Ordered vs Unordered Counting Let A = {1, 2, 3, 4, 5} Cartesian product: ordered ( ) A 2 = {(a, b) a, b A} sets: unordered { } S 2 = {B A B = 2} a permutation is an ordered list, e.g. L 2 = {(a, b) a, b A, and a b} count the members of A 2, S 2, L 2 P(A) = 5 k=0 S k = 2 5 C-N Math Massey, 83 / 125
14 Counting Subsets Counting permuatations: 5P2 is the number of ways you can rank 2 out of 5 items combinations: 5C 2 is the number of ways you can choose 2 out of 5 items fundamental counting rule - multiply the number of choices you have at each step Select 2 out of 5 in 5P2 = (5)(4) = 20 ways. But since {1, 2} = {2, 1}, you ve double-counted each set, so 5C 2 = 10 ways. C-N Math Massey, 84 / 125
15 Counting Subsets Counting 8P3 = (8)(7)(6) = 8! 5! Each of these lists: (a, b, c), (a, c, b), (b, a, c), (b, c, a), (c, a, b), (c, b, a) corresponds to just one set {a, b, c}. there are 3! = 6 permutations of 3 items 8C 3 = 8P3 3! C-N Math Massey, 85 / 125
16 Counting Subsets Counting Generalize to lists and subsets with k out of n npk = n! (n k)! each list corresponds to k! ways of writing the same ( subset ) n nck = = k npk k! = n! k!(n k)! ( ) ( ) n n Explain the identity = k n k C-N Math Massey, 86 / 125
17 Counting Examples Counting 1. How many permutations of all people in this classroom? 2. How many top 5 rankings in FBS football? 3. How many 7 member Senate committees? C-N Math Massey, 87 / 125
18 Counting Partitions Counting Are they distinguishable? 1. How many ways can you partition a set of 12 objects into blocks of 3, 4, and 5? 2. How many ways could the new Pac-12 football conference split into North, Central, and South divisions of 4 teams each? 3. How many ways could the new Pac-12 split into three unnamed divisions? C-N Math Massey, 88 / 125
19 Binomial Theorem Counting Consider the binomial expansion of (x +y) 5 = (x +y)(x +y)(x +y)(x +y)(x +y). Each term will select either x or ( y, so( the 5 5 number of ways to get x 3 y 2 is =. 3) 2) binomial theorem: n ( ) (x + y) n n = x k k y n k k=0 C-N Math Massey, 89 / 125
20 Binomial Theorem Counting 1. ( n k ) is often called the binomial coefficient 2. Expand ( 3 x + 5x ) Coefficient of the x 5 term in (2x 7) 8 4. Prove that ( n n k=0 = 2 k n by computing (1 + 1) n with the binomial theorem. ) C-N Math Massey, 90 / 125
21 Pascal s Triangle Counting Prove Pascal s triangle theorem: ( ) ( ) ( ) n n 1 n 1 = + k k 1 k C-N Math Massey, 91 / 125
22 Pizza Toppings Counting How many 3 topping pizzas if: 1. no repeats, CPB BCP 2. no repeats, CPB = BCP 3. repeats, CCP CPC 4. repeats, CCP = CPC Find general formulas for counting k topping pizzas from n available toppings. pineapple Bacon Cheese Ham Mushroom Onion Pepperoni C-N Math Massey, 92 / 125
23 Relation Relations R A B is called a relation from A to B. if B = A, then R is a relation on A if (a, b) R, we may write arb domain: Dom(R) = {a A b B, (a, b) R} range: Ran(R) = {b B a A, (a, b) R} C-N Math Massey, 93 / 125
24 Visualizing Relations Relations Consider the relation on A = {1, 2, 3}. Represent as: Cartesian graph matrix (grid, pixels) directed graph C-N Math Massey, 94 / 125
25 Relation Examples Relations 1. A = B = Z; arb iff b a 2 2. A = B = R; arb iff a 2 + b 2 = 1 3. A = B = N; arb iff gcd(a, b) = 1 4. A = Z 3, B = Z 5 R = {(0, 4), (2, 1), (1, 2), (0, 1), (0, 2), (2, 2)} 5. A = B = R; a < b 6. A = R, B = Z; a < b 7. A = B = people; arb iff a is ancestor of b C-N Math Massey, 95 / 125
26 Counting Relations Relations List all relations on Z 2 Given A and B, how many relations exist from A to B? C-N Math Massey, 96 / 125
27 Reflexive Relations The relation R on A is reflexive if (a, a) R for all a A irreflexive if (a, a) / R for all a A. The graph of a reflexive relation contains the diagonal. a b, a loves b (reflexive) a > b (irreflexive) Given a set A, how many reflexive relations are possible? C-N Math Massey, 97 / 125
28 Symmetric Relations The relation R on A is symmetric if arb = bra anti-symmetric if arb, bra = a = b The graph of a symmetric relation has symmetry across the diagonal. a = b, a is married to b (symmetric) a b (anti-symmetric) find R that is neither sym nor anti-sym find R that is both sym and anti-sym C-N Math Massey, 98 / 125
29 Transitive Relations The relation R on A is transitive if arb and brc implies arc a > b a ancestor of b [Ipso-facto] C-N Math Massey, 99 / 125
30 Equivalence Relation Relations R is an equivalence relation if it is reflexive, symmetric, and transitive. example: a b if R is an equivalence, it is sometimes denoted by If R is an equivalence relation on Z 5 and {(1, 3), (4, 3), (2, 2), (2, 0)} R, list all other ordered pairs that must be in R. C-N Math Massey, 100 / 125
31 Relations Equivalence Relations and Partitions Let be an equivalence relation on A. equivalence class of a A [a] = {b A a b} either [a] = [b] or [a] [b] = the set of equivalence classes form a partition of A (quotient set of A mod ) visualize by block structure in matrix representation C-N Math Massey, 101 / 125
32 Relation Grids Relations reflexive X X X X X X X X - X - irreflexive X - X X - neither? both? C-N Math Massey, 102 / 125
33 Relation Grids Relations symmetric anti-symmetric neither? both? X X X X X X X X X X X - - X X - X X C-N Math Massey, 103 / 125
34 Relation Grids Relations intransitive ( not transitive) X 2 X 3 X X 4 X Which others must be filled in to make it transitive? C-N Math Massey, 104 / 125
35 Relation Grids equivalence relation (R,S,T) Relations X X 2 X X X 3 X X X 4 X X 5 X X X reorder to reveal partitions (blocks) X X 4 X X 2 X X X 3 X X X 5 X X X C-N Math Massey, 105 / 125
36 Classify the Relation Relations R, IR, S, AS, T, E 1. a is the boss of b 2. card a has the same suit as card b 3. actor a was in a movie with actor b 4. team a played team b 5. webpage a links to webpage b 6. set A is a subset of set B 7. (A, B) R iff A > B 8. xry iff y < x 2 C-N Math Massey, 106 / 125
37 Relation Operations Relations identity relation I = {(a, a) a A} I is R, S, AS, T, E R 1 = {(b, a) (a, b) R} R I is the reflexive closure of R R R 1 is the symmetric closure of R C-N Math Massey, 107 / 125
38 Composition of Relations Relations Let R A B and S B C The composition of S with R is S R = {(a, c) (a, b) R, (b, c) S} direct paths from Dom(R) to Ran(S) composition is associative C-N Math Massey, 108 / 125
39 Composition Examples Relations 1. Relational database table R (school, city) table S (city, state) (CN, TN ) S R 2. let P, S, C be parent, sibling, child relations P 2 S P P S S = C P cousin? C-N Math Massey, 109 / 125
40 Functions Functions Definition: the relation f P(A B) is a function (map, correspondence) from A to B if Dom(f ) = A if (x, y) f and (x, z ) f, then y = z Note that We may write f : A B. If (x, y) f we say y = f (x ). Each member of A maps to exactly one member of B ( vertical line test ) C-N Math Massey, 110 / 125
41 Functions Functions Let f : A B be a function from A to B. Ran(f ) is often called the image of A. The target set B is called the codomain. f is onto (surjective) if Ran(f ) = B f is one-to-one (injective) if f (x 1 ) = f (x 2 ) = x 1 = x 2 If Ran(g) Dom(f ), then define the composition function f g where (f g)(x ) = f (g(x )). C-N Math Massey, 111 / 125
42 Grid Representation Functions The function {(1, 2), (2, 5), (3, 1)} could be represented as: X 2 X 3 X How many functions from {1, 2, 3} to {1, 2, 3, 4, 5} are possible? One-to-one functions? Onto functions? C-N Math Massey, 112 / 125
43 Inverse Functions Functions Let f : A B be 1-1 and onto f is called bijective or a 1-1 correspondence f is said to be invertible since f 1 : B A is a function from B to A. The identity function I A : A A is defined by I (x ) = x. For an invertible function, f 1 f = I A and f f 1 = I B. Show that (f g) 1 = g 1 f 1 C-N Math Massey, 113 / 125
44 Function Example Functions The formula y = x 2 needs to be given a domain/codomain to fully specify a function. f : R R f : [0, ) R f : [0, ) [0, ) f : Z 5 Z 5 C-N Math Massey, 114 / 125
45 Function Example Functions Let f (x ) = 3e x /2 Specify a domain/codomain so that f is a bijection. Find f 1 by solving y = 3e x /2 for x. Notice how the domain/range flip-flop. C-N Math Massey, 115 / 125
46 Circle Functions x 2 + y 2 = 1 is a relation, not a function f : [ 1, 1] R, f (x ) = 1 x 2 is a function, not invertible f : [0, 1] [0, 1], f (x ) = 1 x 2 invertible function C-N Math Massey, 116 / 125
47 Function Examples Functions f : Z Z defined by f (n) = gcd(30, n) piecewise { f : N N defined by 5 n n 5 f (n) = 0 n > 5 C-N Math Massey, 117 / 125
48 Sequences Functions A sequence is a function whose domain is some subset of Z (often N). Examples: f : N + N defined by f (n) equals the sum of the proper factors of n n is a perfect number if f (n) = n geometric sequence: f n = cr n geometric series: s n = n k=0 cr n C-N Math Massey, 118 / 125
49 Recursive Sequences Functions A sequence may be seeded and then defined recursively f (0) = 1, f (n) = f (n 1)/2 f 0 = 1, f n = nf n 1 Mortgage balance B n = (1 +.06/12)B n Fibonacci sequence f 0 = 0, f 1 = 1, f n = f n 2 + f n 1 C-N Math Massey, 119 / 125
50 Pigeonhole Principle Functions If m pigeons must be put into n < m holes, then there must be at least one hole containing more than one pigeon. If f : A B and A > B, then f cannot be one-to-one. If f : A B and A < B, then f cannot be onto. C-N Math Massey, 120 / 125
51 Pigeonhole Principle Functions Write down any six natural numbers. Prove that there must be some consecutive number(s) in your list whose sum is divisible by six. Let a k be the numbers, and s k the partial sums. If 6 s k for some k, you are done. Otherwise, each s k is an alias of 1, 2, 3, 4, or 5 (mod 6). By the PHP, k < l with s k s l (mod 6). Therefore a k+1 + a l 0 (mod 6). C-N Math Massey, 121 / 125
52 Acquaintances Functions There are several people in the room. Some are acquaintances (a symmetric, non-reflexive relation), others are not. Prove that some pair of people have exactly the same number of acquaintances. Each person can have between 0 and n 1 acquantances. But it can t be that one person has 0 and another n 1. C-N Math Massey, 122 / 125
53 1-1 Correspondence Functions Find a bijection from N to Z (0, 1) R [0, 1) [0, ) C-N Math Massey, 123 / 125
54 Infinite Sets Infinity We say A = B if there exists a 1-1 correspondence between A and B. A set is finite if it can be put in 1-1 corresponence with Z n for some n N. A set is infinite if it can be put in 1-1 correspondence with a proper subset of itself. When we ve been here ten thousand years Bright shining as the sun. We ve no less days to sing God s praise Than when we ve first begun. C-N Math Massey, 124 / 125
55 Countable Sets Infinity A set is called countably infinite if it can be put in 1-1 correspondence with N. In this case we say A = ℵ 0. Countable (listable) refers to finite or countably infinite sets. Z and Q are countable. R is not countable. C-N Math Massey, 125 / 125
A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A. A B means A is a proper subset of B
Subsets C-N Math 207 - Massey, 71 / 125 Sets A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A x A x B A B means A is a proper subset of B
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationRelations, Functions, and Sequences
MCS-236: Graph Theory Handout #A3 San Skulrattanakulchai Gustavus Adolphus College Sep 13, 2010 Relations, Functions, and Sequences Relations An ordered pair can be constructed from any two mathematical
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationNotation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationReading 11 : Relations and Functions
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Reading 11 : Relations and Functions Instructor: Beck Hasti and Gautam Prakriya In reading 3, we described a correspondence between predicates
More informationMATH 363: Discrete Mathematics
MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationChapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
More informationHL Topic. Sets, relations and groups. (Further Mathematics SL Topic 3) Sets Ordered pairs Functions Binary operations Groups Further groups
HL Topic (Further Mathematics SL Topic 3) 9 This topic explores the fundamental nature of algebraic structures and the relationships between them. Included is an extension of the work covered in the Core
More informationMATH 201 Solutions: TEST 3-A (in class)
MATH 201 Solutions: TEST 3-A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets. - Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define
More informationNotes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Combinatorics Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 4.1-4.6 & 6.5-6.6 of Rosen cse235@cse.unl.edu
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationSets. 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
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 century. Most students have seen sets before. This is intended
More informationChapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60
MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences
More informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More informationRelations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)
Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationMathematics Review for Business PhD Students Lecture Notes
Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804
More informationSets. A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set.
Sets A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set. If A and B are sets, then the set of ordered pairs each
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationEQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS
EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationMath 2534 Solution to Test 3A Spring 2010
Math 2534 Solution to Test 3A Spring 2010 Problem 1: (10pts) Prove that R is a transitive relation on Z when given that mrpiff m pmod d (ie. d ( m p) ) Solution: The relation R is transitive, if arb and
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationCopyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction
Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis
More information1.4 Equivalence Relations and Partitions
24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationRED. Fall 2016 Student Submitted Sample Questions
RED Fall 2016 Student Submitted Sample Questions Name: Last Update: November 22, 2016 The questions are divided into three sections: True-false, Multiple Choice, and Written Answer. I will add questions
More informationCombinatorics. But there are some standard techniques. That s what we ll be studying.
Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More information4) Have you met any functions during our previous lectures in this course?
Definition: Let X and Y be sets. A function f from the set X to the set Y is a rule which associates to each element x X a unique element y Y. Notation: f : X Y f defined on X with values in Y. x y y =
More informationMATH 556: PROBABILITY PRIMER
MATH 6: PROBABILITY PRIMER 1 DEFINITIONS, TERMINOLOGY, NOTATION 1.1 EVENTS AND THE SAMPLE SPACE Definition 1.1 An experiment is a one-off or repeatable process or procedure for which (a there is a well-defined
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationDefinition: 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.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More informationFoundations Revision Notes
oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationFunctions as Relations
Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The
More informationProblem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More informationNotes on Sets, Relations and Functions
PURE MTH 3002 Topology & Analysis III (3246) 2002 Notes on Sets, Relations and Functions These are some notes taken from Mathematical Applications (now Mathematics for Information Technology (MIT)). They
More informationRelations, Functions & Binary Operations
Relations, Functions & Binary Operations Important Terms, Definitions & Formulae 0 TYPES OF INTERVLS a) Open interval: If a and b be two real numbers such that a b then, the set of all the real numbers
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationWhat are relations? f: A B
What are relations? Ch 9.1 What are relations? Notation Informally, a relation is a set of pairs of objects (or in general, set of n-tuples) that are related to each other by some rule. We will focus first
More informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationChapter 2 Sets, Relations and Functions
Chapter 2 Sets, Relations and Functions Key Topics Sets Set Operations Russell s Paradox Relations Composition of Relations Reflexive, Symmetric and Transitive Relations Functions Partial and Total Functions
More informationWorksheet on Relations
Worksheet on Relations Recall the properties that relations can have: Definition. Let R be a relation on the set A. R is reflexive if for all a A we have ara. R is irreflexive or antireflexive if for all
More informationSets McGraw-Hill Education
Sets A set is an unordered collection of objects. The objects in a set are called the elements, or members of the set. A set is said to contain its elements. The notation a A denotes that a is an element
More informationLecture 7: Relations
Lecture 7: Relations 1 Relation Relation between two objects signify some connection between them. For example, relation of one person being biological parent of another. If we take any two people at random,
More informationBinary Relation Review Questions
CSE 191 Discrete Structures Fall 2016 Recursive sets Binary Relation Review Questions 1. For each of the relations below, answer the following three questions: Is the relation reflexive? Is the relation
More informationLogic. Facts (with proofs) CHAPTER 1. Definitions
CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies
More informationMATH1240 Definitions and Theorems
MATH1240 Definitions and Theorems 1 Fundamental Principles of Counting For an integer n 0, n factorial (denoted n!) is defined by 0! = 1, n! = (n)(n 1)(n 2) (3)(2)(1), for n 1. Given a collection of n
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationDiscrete Math Notes. Contents. William Farmer. April 8, Overview 3
April 8, 2014 Contents 1 Overview 3 2 Principles of Counting 3 2.1 Pigeon-Hole Principle........................ 3 2.2 Permutations and Combinations.................. 3 2.3 Binomial Coefficients.........................
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationScott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:
Equivalence MA Relations 274 and Partitions Scott Taylor 1. EQUIVALENCE RELATIONS Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: (1) is reflexive. That is, (2) is
More informationSet Basics. P. Danziger
- 5 Set Basics P. Danziger 1 Set Basics Definition 1 (Cantor) A set is a collection into a whole of definite and separate objects of our intuition or thought. (Russell) Such that given an object x and
More information14 Equivalence Relations
14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term 2010 1 / 10 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes
More informationAnnouncements. CSE 321 Discrete Structures. Counting. Counting Rules. Important cases of the Product Rule. Counting examples.
Announcements CSE 321 Discrete Structures Winter 2008 Lecture 16 Counting Readings Friday, Wednesday: Counting 6 th edition: 5.1, 5.2, 5.3, 5 th edition: 4.1, 4.2. 4.3 Lecture 16 video will be posted on
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationSpring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics
1 / 17 L545 Spring 2013 Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics 2 / 17 Why set theory? Set theory sets the foundation for much of mathematics For us: provides precise
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-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
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationIntroduction to Decision Sciences Lecture 11
Introduction to Decision Sciences Lecture 11 Andrew Nobel October 24, 2017 Basics of Counting Product Rule Product Rule: Suppose that the elements of a collection S can be specified by a sequence of k
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More information= A. Example 2. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {4, 6, 7, 9, 10}, and B = {2, 6, 8, 9}. Draw the sets on a Venn diagram.
MATH 109 Sets A mathematical set is a well-defined collection of objects A for which we can determine precisely whether or not any object belongs to A. Objects in a set are formally called elements of
More information0 Logical Background. 0.1 Sets
0 Logical Background 0.1 Sets In this course we will use the term set to simply mean a collection of things which have a common property such as the totality of positive integers or the collection of points
More informationMAD 3105 PRACTICE TEST 2 SOLUTIONS
MAD 3105 PRACTICE TEST 2 SOLUTIONS 1. Let R be the relation defined below. Determine which properties, reflexive, irreflexive, symmetric, antisymmetric, transitive, the relation satisfies. Prove each answer.
More informationR1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member
Chapter R Review of basic concepts * R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member Ex: Write the set of counting numbers
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationREVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms
REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationMath 300: Final Exam Practice Solutions
Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a
More informationRelations. P. Danziger. We may represent a relation by a diagram in which a line is drawn between two elements if they are related.
- 10 Relations P. Danziger 1 Relations (10.1) Definition 1 1. A relation from a set A to a set B is a subset R of A B. 2. Given (x, y) R we say that x is related to y and write xry. 3. If (x, y) R we say
More informationABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationMath 205 April 28, 2009 Final Exam Review
1 Definitions 1. Some question will ask you to statea a definition and/or give an example of a defined term. The terms are: subset proper subset intersection union power set cartesian product relation
More information