Sets and set operations University of Pittsburgh（匹兹堡大学集和设置操作）.pdf

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square CS 441 Discrete mathematics for CS M. Hauskrecht Basic discrete structures • Discrete math = – study of the discrete structures used to represent discrete objects • Many discrete structures are built using sets – Sets = collection of objects Examples of discrete structures built with the help of sets: • Combinations • Relations • Graphs CS 441 Discrete mathematics for CS M. Hauskrecht 1 Set • Definition: A set is a (unordered) collection of objects. These objects are sometimes called elements or members of the set. (Cantors naive definition) • Examples: – Vowels in the English alphabet V = { a, e, i, o, u } – First seven prime numbers. X = { 2, 3, 5, 7, 11, 13, 17 } CS 441 Discrete mathematics for CS M. Hauskrecht Representing sets Representing a set by: 1) Listing (enumerating) the members of the set. 2) Definition by property, using the set builder notation {x| x has property P}. Example: • Even integers between 50 and 63. 1) E = {50, 52, 54, 56, 58, 60, 62} 2) E = {x| 50 = x 63, x is an even integer} If enumeration of the members is hard we often use ellipses. Example: a set of integers between 1 and 100 • A= {1,2,3 …, 100} CS 441 Discrete mathematics for CS M. Hauskrecht 2 Important sets in discrete math • Natural