1 / 27

Chapter 2 - 1

Chapter 2 - 1. Facts about Functions. Section 2.1 Functions: Definitions and Examples. A function ƒ from A to B associates each element of A with exactly one element of B. Write ƒ : A → B and call A the domain and B the codomain.

Download Presentation

Chapter 2 - 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 2 - 1 Facts about Functions

  2. Section 2.1 Functions: Definitions and Examples • A function ƒ from A to B associates each element of A with exactly one element of B. • Write ƒ : A → B and call A the domain and B the codomain. • Write ƒ(x) = y to mean ƒ associates x ∊ A with y ∊ B. Say, “ƒ of x is y” or “ƒ maps x to y.” • If C ⊂ A, the image of C is the set ƒ(C) = {ƒ(x) | x ∊ C}. • The range of ƒ is the image of A. We write range(ƒ) = ƒ(A) = {ƒ(x) | x ∊ A}. • If D ⊂ B, the pre-image (or inverse image) of D is the set ƒ-1(D) = {x | ƒ(x) ∊ D}.

  3. Example • The picture shows a function ƒ : A → B with domain A = {a, b, c, d} and codomain B = {1, 2, 3}. • We have: ƒ(a) = ƒ(b) = 1 and ƒ(c) = ƒ(d) = 3. • Some sample sets are: • range(ƒ) = {1, 3}, • ƒ({a, b}) = {1}, • ƒ-1({2}) = ∅, • ƒ-1({1, 2, 3}) = {a, b, c, d}. A B a b c d 1 2 3

  4. Example • Let ƒ : Z → Z be defined by ƒ(x) = 2x. Let E and O be the sets of even and odd integers, respectively. Some sample sets are: • range(ƒ) = ƒ(Z) = E; • ƒ(E) = {4k | k ∊ Z}; • ƒ(O) = {4k +2 | k ∊ Z}; • ƒ-1(E) = Z; • ƒ-1(O) = ∅.

  5. Quiz (2 minutes) • Let ƒ : N → N by ƒ(x) = if x is odd then x + 1 else x. Find each set, where E and O are the even and odd natural numbers. range(ƒ), ƒ(E), ƒ(O), ƒ-1(N), ƒ-1(E), ƒ-1(O). • Answers: E, E, E – {0}, N, N, ∅.

  6. Floor and Ceiling • The floor and ceiling functions have type R → Z, where floor(x) is the closest integer less than or equal to x and ceiling(x) is the closest integer greater than or equal to x. • e.g., floor(2.6) = 2, floor(–2.1) = –3, ceiling(2.6) = 3, and ceiling(–2.1) = –2. • Notation: ⌊x⌋ = floor(x) and ⌈x⌉ = ceiling(x).

  7. Properties • There are many interesting properties, all of which are easy to prove. • Example. - ⌊x⌋ = ⌈- x⌉ . • Proof: If x ∊ Z, then -⌊x⌋ = - x = ⌈- x⌉. If x ∉ Z, there is an n ∊ Z such that n < x < n + 1, which gives ⌊x⌋ = n. Multiply the inequality by –1 to get – n > – x > –(n + 1), which gives ⌈- x⌉ = – n. So -⌊x⌋ = – n = ⌈- x⌉. QED.

  8. Quiz (1 minute) • Show that ⌈x + 1⌉ = ⌈x⌉ + 1. • Proof: There is an integer n such that n < x ≤ n + 1. Add 1 to get n + 1 < x + 1 ≤ n + 2. So ⌈x + 1⌉ = n + 2 and ⌈x⌉ = n + 1. Therefore, ⌈x + 1⌉ = ⌈x⌉ + 1. QED.

  9. Greatest Common Divisor (gcd) • If x and y are integers, not both zero, then gcd(x, y) is the largest integer that divides x and y. • For example, gcd(12, 15) = 3, gcd(–12, –8) = 4. • Properties of gcd • gcd(a, b) = gcd(b, a) = gcd(a, –b). • gcd(a, b) = gcd(b, a – bq) for any integer q. • gcd(a, b) = ma + nb for some m, n ∊ Z. • If d | ab and gcd(d, a) = 1, then d | b.

  10. Division algorithm • For a, b ∊ Z, b ≠ 0 there are unique q, r ∊ Z such that a = bq + r where 0 ≤ r < | b |. • Euclid’s algorithm for finding gcd(a, b) Assume a, b ∊ N, not both zero. while b > 0 do find q, r so that a = bq + r and 0 ≤ r < b; a := b; b := r od Output(a)

  11. Example • Find gcd(189, 33) 189 = 33 · 5 + 24 33 = 24 · 1 + 9 24 = 9 · 2 + 6 9 = 6 · 1 + 3 6 = 3 · 2 + 0 Output(3). • Quiz (1 minute). How many loop interations in Euclid’s algorithm to find gcd(117, 48)? • Answer: 4 iterations. gcd(117, 48) = 3.

  12. The mod Function • For a, b ∊ Z with b > 0 apply the division algorithm to get a = bq +r with 0 ≤ r < b. The remainder r is the value of the mod function applied to a and b. To get a formula for r in terms of a and b solve the equation for q = a/b – r/b. Since q ∊ Z and 0 ≤ r/b < 1, it follows that q = ⌊a/b⌋. So we have r = a – bq = a – b · ⌊a/b⌋. • The value of r is denoted “a mod b”. So if a, b ∊ Z with b > 0 then a mod b = a – b · ⌊a/b⌋.

  13. Quiz (1 minute) • It is 2am in Paris. What time is it in Portland (9 hours difference)? • Answer: • (12 hr clock): (2 – 9) mod 12 = (–7) mod 12 = –7 – 12 ⌊-7/12⌋ = –7 – 12(–1) = 5. • (24 hr clock) (2 –9) mod 24 = (–7) mod 24 = –7 – 24 ⌊-7/24⌋ = –7 – 24(–1) = 17.

  14. Quiz (1 minute) • What are the elements in the set {x mod 5 | x ∊ Z}? • Answer: {0, 1, 2, 3, 4}.

  15. Nn • Notation: Nn = {0, 1, …, n – 1}. So if n is fixed, the range of values for x mod n is Nn.

  16. Quiz (1 minute) • Convert 13 to binary. • Answer: For any x ≥ 0 we can write x = 2 ⌊x/2⌋ + x mod 2. So 13 = 2 · 6 + 1 6 = 2 · 3 + 0 3 = 2 · 1 + 1 1 = 2 · 0 + 1 The remainders from bottom to top are the binary digits from left to right: 1101.

  17. Log Function • If x and b are positive real numbers and b > 1, then logbx = y means by = x. The graph of the log function is pictured below. • Notice that log is an increasing function: s < t implies logbs < logbt. y x

  18. Properties of log • logb1 = 0 • logbb = 1 • logbbx = x • logbxy = logbx + logby • logbxy = ylogbx • logax = (logab)(logbx)

  19. Quiz (3 minutes) • Estimate log2(5225) by finding upper and lower bounds. • One answer: • log2(5225) = log2(52) + log2 (25) = 2log25 + 5log22 = 2log25 + 5. • Since 4 < 5 < 8, we can apply log2 to the inequality to get 2 < log25 < 3. • Multiply by 2 to get 4 < 2log25 < 6. So 9 < log2(5225) < 11. • Another answer: Use 16 < 52 < 32. Then 4 < log2(52) < 5. So 9 < log2(5225) < 10.

  20. Section 2.2 Constructing Functions • Composition If g : A → B and ƒ : B → C, then the expression ƒ(g(x)) makes sense and the composition of ƒ and g, denoted ƒ ⃘ g : A → C, is the defined by (ƒ ⃘ g)(x) = ƒ(g(x)). • Some examples: • floor(log220) = floor(4…) = 4 • ceiling(log220) = ceiling(4…) = 5 • head(tail(<a, b, c>)) = head(<b, c>) = b.

  21. The Sequence and Distribute Functions • seq : N → lists(N) by seq(n) = <0, 1, …, n>. • dist : A × lists(B) → lists(A × B) by dist(a, <x1, … xk>) = <(a, x1), …, (a, xk)>. • Example. How can we compute ƒ : N → lists(N) defined by ƒ(x) = <1, 2, …, x + 1>? • Solution: Let ƒ(x) = tail(seq(x + 1)).

  22. Quiz (3 minutes) • How can we compute ƒ : N → lists(N × N) defined by ƒ(x) = <(x, 1), (x, 2), …, (x, x)>? • Solution: Let ƒ(x) = dist(x, tail(seq(x))), or equivalently, tail(dist(x, seq(x))).

  23. Map Function • The map function takes a function ƒ and a list and returns the list of values obtained by applying ƒ to each element in the list. So map is defined by map(ƒ, <x1, …, xk>) = <ƒ(x1), …, ƒ(xk)>. • Quiz (2 minutes). Evaluate the expression map(floor ⃘ log2, tail(seq(8))). • Answer: <0, 1, 1, 2, 2, 2, 2, 3>.

  24. Example • Find a definition for ƒ : N → lists(N) defined by ƒ(n) = <0, 2, 4, …, 2n>. • Solution: Transform the list into a composition of known functions. ƒ(n) = <0, 2, 4, …, 2n> = <2 · 0, 2 · 1, 2 · 2, …, 2 · n> = map(· , <(2, 0), (2, 1), …, (2, n)>) = map(· , dist(2, <0, 1, 2, …, n>)) = map(· , dist(2, seq(n))). • So define ƒ(n) = map(· , dist(2, seq(n))).

  25. Example • Find a definition for ƒ : N → lists(N) defined by ƒ(n) = <5, 9, 13, …, 5 + 4n>. • Solution: ƒ(n) = <5, 9, 13, …, 5 + 4n> = <5 + 4 · 0, 5 + 4 · 1, 5 + 4 · 2, …, 5 + 4 · n> = map(+, <(5, 4 · 0), (5, 4 · 1), (5, 4 · 2), …, (5, 4 · n)>) = map(+, dist(5, <4 · 0, 4 · 1, 4 · 2, …, 4 · n>) = map(+, dist(5, map(· , <(4, 0), (4, 1), (4, 2), …, (4, n >) = map(+, dist(5, map(· , dist(4, <0, 1, 2, …, n)>) = map(+, dist(5, map(· , dist(4, seq(n))))). • So we can define ƒ(n) = map(+, dist(5, map(· , dist(4, seq(n))))).

  26. Quiz (3 minutes) • Find a definition for ƒ : N3→ lists(N) defined by ƒ(a, b, n) = <a, a + b, a + 2b, …, a + nb >. • Solution: This is just an abstraction of the previous example, where a = 5 and b = 4. So we can define ƒ(a, b, n) = map(+, dist(a, map(· , dist(b, seq(n))))).

  27. The End of Chapter 2 - 1

More Related