Class 7

Discrete Math

Transcript

1. cs2102: Discrete Mathematics Class 7: Sets, SAT problem David Evans, Mohammad Mahmoody University of Virginia
2. Plan • Sets (as a Data Type) • Review: SAT problem and its importance Thursday: continue other data types..
3. Type Operations
4. Data Types Mathematical • Defines a set of possible values and operations on those values • Finite or infinite Programming Languages • Defines a set of possible values and operations on those values • Finite (in practice), but often “viewed” as infinite
5. Sets as Data Type Unordered collection of objects Infinite or finite Objects may be of any type not necessarily the same including sets 4 2102 { 1, 2, 3, …} Each object only counts once (multiset has count for each object)
6. Membership (∈) ∈ is true iff is in the set 4 2102 { 1, 2, 3, …}
7. Not being a member (∉) ∉ is true iff is not in the set 4 2102 { 1, 2, 3, …}
8. Subset (⊆) ⊆ iff every element of A is an element of B. 4 2102 { 1, 2, 3, …}
9. Set Equality How should we define = for sets? 4 2102 { 1, 2, 3, …}
10. Set Equality = ⟺ ⊆ ∧ ⊆ 4 2102 { 1, 2, 3, …} How should we define = for sets?
11. More Set Operations Union: ∪ Intersection: ∩ Difference: − A B
12. Defining Union Union: ∪ A B
13. Defining Intersection A B Intersection: ∩
14. Defining Difference A B Difference: −
15. Complement Complement: ҧ A ∀ ∈ . ∈ ⟺ ∉ ҧ . D = “domain of discourse” (Universe) B U 4 2102 { 1, 2, 3, …}
16. ∈ ⟺ is in the set Membership ∉ ⟺ ¬( ∈ ) ∈ ҧ ⟺ ( ∈ ∧ ∉ ) Complement ∀. [ ∈ − ⟺ ∈ ∧ ∉ ] Difference ∀. [ ∈ ∩ ⟺ ∈ ∧ ∈ ] Intersection ∀. [ ∈ ∪ ⟺ ∈ ∨ ∈ ] Union ⊆ ⟺ ∀ ∈ . ∈ Subset Equality = ⟺ ⊆ ∧ ⊆ Non-membership Which ones are necessary?
17. B Exchanging Union wtith Intersection? A B U
18. Self-Membership ? Is there any set where ∈ ? Is it even meaningful to ask ∈ ?
19. Conundrum notself = the set of all sets that are not members of themselves Is notself ∈ notself ? all = the set of all sets notself is a subset of all .
20. notself = the set of all sets that are not members of themselves Is notself ∈ notself ? Slack break…
21. notself = the set of all sets that are not members of themselves Is notself ∈ notself ? Russell’s Paradox! IF Yes, it means notself ∈ notself , so notself is a member of itself and should not be in notself . IF No, it means notself ∉ notself , so notself is not a member of itself and should be in notself .
22. Where did we make a mistake?
23. Conundrum notself = the set of all sets that are not members of themselves Is notself ∈ notself ? all = the set of all sets notself is a well-defined subset of all .
24. Sets as data type Unordered collection of objects Infinite or finite Objects may be of any type... 4 2102 { 1, 2, 3, …} Apple
25. Charge • PS3 Due this Friday (6:29pm) start early • Next session: Other Data Types – Sequences, Functions, etc. – Read MCS Chapter 4