EECS 1019 Lecture 6: Set Operations + Intervals

• School: York University
• Department: Electrical Engineering and Computer Science
• Course: EECS 1019
• Professor: John Michael Machacek

Document Summary

Chapter 2: basic structures sets, functions, sequences, sum and matrices. Let a and b be two sets inside a universal set u. Union: a b = { x: x a x b} Intersection: a b = {x: x a x b} Two sets a and b are called disjoint if a b = . There is analogy between and . Rules for set operations are similar to logic rules (table 1, textbook page 130) e. g: prove a (b c) = (a b) (a c) 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) } = (a b) (a c) e. g: prove (cid:1827)(cid:1514)(cid:1828)=(cid:1827)(cid:1515)(cid:1828) (cid:1827)(cid:1514)(cid:1828) = {x u: x a b} We can generalize intersections and union to more than two sets.