Class 8

Discrete Math

Transcript

1. Class 8: Sequences, Relations, Functions cs2102: Discrete Mathematics David Evans and Mohammad Mahmoody
2. Plan 1. Sequences 2. Relations 3. Functions
3. Sequence vs. Set • Set 1. Has elements 2. Unordered 3. Distinct elements 4. finite or infinite • Sequence 1. Has components 2. Ordered 3. Might have repetition 4. finite or infinite -4 2102 1/2
4. Operations on Sequences • Sets , 1. ∈ 2. Union: ∪ 3. Intersection ∩ 4. Complement 5. Size: |A| • Sequences , 1. is a component of 2. Concatenation: || 3. ? 4. ? 5. Length: |S| -4 2102 1/2 = (−4, 2101, , 1/2) = (−4, −4,2101, , 1/2,4)
5. Terminology • Tuple: same thing as a sequence • Pair: a sequence of length 2 • triple, quadruple, quintuple, … • -tuple
6. Sets of Sequences and Vice Versa • Set of sequences • Sequence of Sets (a,b) (1,2,3,1) (x, {y,z}) ( , , , {, , })
7. Cartesian Product: Getting a set of -tuples from sets Definition. A Cartesian product of sets 1 × 2 × ⋯ × is a set consisting of all possible sequences of elements where the th element is chosen from . × = , ∈ , ∈ } 1 × 2 × ⋯ × = 1 , 2 … , ∈ }
8. Definition. A Cartesian product of sets 1 × 2 × ⋯ × is a set consisting of all possible sequences of elements where the th element is chosen from . × = , ∈ , ∈ } 1 × 2 × ⋯ × = 1 , 2 … , ∈ } How many elements are in × ? Cartesian Product: Getting a set of -tuples from sets
9. Relations and Functions
10. Relations: Subsets of Cartesian Products = 1 × 2 × ⋯ × = 1 , 2 … , ∈ } If ⊆ , then describes a `relation’ between some elements from 1 , … , Example: = { , , , ∣ person drove car in street on day } Important special case: when = 2 called binary relations.
11. Binary Relation
12. Functions: an important form of binary relations Domain Codomain Main property: every element in Domain is in relation with exactly one element in Codomain
13. Steps of Defining a Function 1. Domain (Set) 2. Codomain (Set) 3. Describe how to map every element of Domain to one element of Codomain
14. Notation Function Relation (, ) ∈
15. Example: NOT (Boolean Function) Domain Codomain P NOT(P ) T F F T
16. Example: XOR as Boolean Function Domain Codomain A B XOR(A, B) T T F T F T F T T F F F
17. Example: Doubling ∷= 2 Domain Codomain
18. Example: Absolute Value ∷= || Domain Codomain
19. Example: Division , ∷= / Domain Codomain
20. Example: Square Root ∷= Domain Codomain
21. Charge • PS3 Due Friday (6:29pm) • Next week: – Cardinality (MCS 4.5) – Start Induction (MCS 5.1)