34
© Jalal Kawash 2010 Elementary Set Theory Peeking into Computer Science

Elementary Set Theory

  • Upload
    xue

  • View
    51

  • Download
    4

Embed Size (px)

DESCRIPTION

Elementary Set Theory. Peeking into Computer Science. Mandatory: Chapter 2 – Sections 2.3 and 2.4. Reading Assignment. Sets and Set Operations. At the end of this section, the you will be able to: Understand the two basic properties of sets - PowerPoint PPT Presentation

Citation preview

Page 1: Elementary Set Theory

© Jalal Kawash 2010

Elementary Set TheoryPeeking into Computer Science

Page 2: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Reading Assignment

Mandatory: Chapter 2 – Sections 2.3 and 2.4

2

Page 3: Elementary Set Theory

Sets and Set Operations3

Page 4: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Objectives

At the end of this section, the you will be able to:1. Understand the two basic properties of sets2. Understand the (one) difference between sets and

multisets3. Define a set and use two types of set

representations4. Perform all 4 operations on sets5. Use Venn diagrams to depict sets and operations on

them6. Define tuples and differentiate them from sets7. Perform multiplication on sets (Cartesian products)

4

Page 5: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Sets

A set is a collection of objects;◦ we call these objects the elements of the set.

Examples:

◦ Students in this class form (ie, are elements of) a set

◦ The set of all positive integers

◦ The set of all of your shirts

Sometimes we call an element of a set a member of that set, instead.

5

Page 6: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Representing Small Sets

Small sets can be represented by listing its members

A = {paper, scissors, rock}◦All possible choices in the game

B = {pawn, rook, knight, bishop, queen, king}◦All chess pieces

C = {1, 2, 3, 4, 5}◦All positive integers less than or equal to 5

6

Page 7: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Representing Big Sets

May not be possible to list all membersSome sets are infinite

A = {x | x is a current student at UofC}◦All current students at UofC

B = {x | x is an even number}◦Infinite set

7

Page 8: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

The Empty Set

An empty set contains no elements.Notation:

A = { }A =

Page 9: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Properties of Sets

Duplicates are not allowed (or do not count)◦ {paper, scissors, rock} is the same as {paper,

scissors, rock, rock} ◦We should not repeat elements

Order of members is irrelevant◦{paper, scissors, rock}◦{scissors, rock, paper}◦{rock, scissors, paper}◦Are all the same set

9

Page 10: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Multi-sets

Duplication is allowed

{Sara, Sam, Frank, Julie, Sam, Frank}

10

Page 11: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Set Inclusion (JT: Subset)

A B means that all members of A are also members of B

Read A is a subset (or equal to) of BExamples:

{1,2} {1,2,7}{a} { | is a letter in the English alphabet}{H,I,T} {H,I,T}

For member elements, H {H,I,T}

11

Page 12: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Set Inclusion: Subsets

A set is also a subset of itself{1,2,3} {1,2,3}

The empty set is also a subset of any set

Page 13: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Set Membership

We write x S to say that x is an element of the set S

Examples:◦2 {1, 2, 3}◦$ {$, ¢, £, ¥, €, ₠}◦a {a}

This is not the same as “set inclusion!”

13

Page 14: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Set Inclusion – Venn Diagram14

H IT

A B

C

D

EF G

K

L

M

N

O

PQ

R

S U

VW

X

Y

Z

Page 15: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Set Inclusion – Venn Diagram15

Mammals

Humans

Elephants

Men

Women

Page 16: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Operations on Sets

Set IntersectionA B = set of all elements that are in A and

in BExample:

◦A = {1, 6, 8}, B = {1, 3, 5, 7}, C = {3, 5, 7}◦A B = ???◦B C = ???◦A C = ???

We say sets S and T are disjoint if ST={}.

16

Page 17: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Intersection– Venn Diagram17

Has Four LegsCarnivorous

CowsLionsHawks

Elephants

Tables

Page 18: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Operations on Sets

Set UnionA B = set of all elements that are in A

or in B

Example:◦A = {1, 6, 8}, B = {1, 3, 5, 7}, C = {3, 5, 7}◦A B =???◦B C =???◦A C =???

18

Page 19: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Union– Venn Diagram19

Page 20: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Union– Venn Diagram20

Male UofC StudentsFemale UofC Students

All UofC Students

Page 21: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Union– Venn Diagram21

Commonwealth CountiesFrancophone Countries

Francophone and Commonwealth Countries

Page 22: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

JT Extra: Prairie Provinces

APopulation of Alberta

CPopulation of Manitoba

BPopulation of Saskatchewan

Page 23: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

JT Extra: Set Union (Prairies)

A B C = D (Population of the Prairie provinces)

Page 24: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Operations on Sets

Set SubtractionA – B = set of all elements that are in A

but not in B

Example:◦A = {1, 6, 8}, B = {1, 3, 5, 7}, C = {3, 5, 7}◦A – B = ???◦B – C = ???◦C – B = ???◦C – A = ???

24

Page 25: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Subtraction– Venn Diagram25

Commonwealth CountriesFrancophone CountriesFrancophone Countries Commonwealth Countries

Francophone countries that are not members of the Commonwealth

Page 26: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Subtraction– Venn Diagram26

Commonwealth CountriesFrancophone Countries Commonwealth CountriesFrancophone Countries

Commonwealth countries that are not Francophone

Page 27: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

JT: Venn Diagram: Set Subtraction

A = Population of the prairie provinces

B = Population of Alberta

Page 28: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

JT: Venn Diagram: Set SubtractionA - B = C

Prairies sans ALTA

Page 29: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Complement29

U

Has Four Legs

Page 30: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Complement30

U

Has Four Legs

Page 31: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Complement

Let A be a setA = {x | x not ∈ A}

A = { x | x is male}A = {x | x is not male}

31

Page 32: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Ordered Tuples

We use curly brackets (braces) to represent sets◦{rock, paper} = {paper, rock}

If order is important we use ordered tuples◦(rock, paper) ≠ (paper, rock)◦Maybe meaning (choice of player 1, choice of

player 2)General form of a tuple: (v1, v2, v3, … vn)In tuples, repetition of elements is allowed:

(1, 2, 1, 3)

32

Page 33: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

Set Multiplication

A x B = {(a,b) | a is in A and b is in B}Example: A = {a}, B = {1, 2}A x B = {(a,1), (a,2)}JT’s extra:

◦ “Takes all combinations from the sets”◦ The operation may be used in decision making

to ensure that all combinations have been covered.

In general A1 x A2 x … x An = {(a1,a2,…, an) | a1 is in A1 and a2 is in A2 … an is in An}

33

Page 34: Elementary Set Theory

© Jalal Kawash 2010Peeking into Computer Science

JT’s Extra: How Set Multiplication May Be Applied

Developing a game where all combinations must be considered in order to determine the outcome.

Each combination is a tuple (not a set).A = {player one, player two}B = {rock, paper, scissors}A x B = {(player one, rock), (player one, paper), (player one, scissors), (player two, rock), (player two, paper), (player two, scissors)}

(Examples from actual software will be much more complex and taking a systematic approach helps ensure that nothing is missed).A = {player one, player two, player three...}B = {completed quest one, completed quest two...}C = {healthy, injured, poisoned, diseased, dead, gone forever}