Functions as Relations
|
|
- Geoffrey Lindsey
- 5 years ago
- Views:
Transcription
1 Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The domain of f is A. (ii) If (x, y) f and (x, z) f, then y = z. In other words, for each a A, there is a unique element b B such that (a, b) f. 1
2 Function Notation If f is a function from A to B, we write f : A B, and we say that A is the domain of f and B is the codomain of f. 2
3 Functions Example: Let A = {1, 2, 3} and B = {4, 5, 6}. Determine which of the following relations are functions from A to B.. R = {(1, 4), (2, 5), (3, 6), (2, 6)} R = {(1, 4), (2, 6), (3, 5)} R = {(1, 5), (2, 5), (3, 4)} R = {(1, 4), (3, 6)} 3
4 Functions Example: Let A = {1, 2, 3} and B = {4, 5, 6}. Determine which of the following relations are functions from A to B. R = {(1, 4), (2, 5), (3, 6), (2, 6)} R is not a function, since R is not single-valued: (2, 5) R and (2, 6) R R = {(1, 4), (2, 6), (3, 5)} Function R = {(1, 5), (2, 5), (3, 4)} Function 4
5 R = {(1, 4), (3, 6)} R is not a function from A to B, since Dom(R) = {1, 3} = A.
6 Functions Example: Let F be the relation from Z to Z defined by F = {(x, y) Z Z y = x 2 }. Prove that F is a function from Z to Z. Proof: 5
7 Functions Example: Let F be the relation from Z to Z defined by F = {(x, y) Z Z y = x 2 }. Prove that F is a function Z to Z. Proof: First we ll show that Dom(F ) = Z. Assume x Z. Let y = x 2. Then, y Z. Therefore, (x, y) Z Z and y = x 2, which means (x, y) F. Therefore, x Dom(F ). This proves Dom(F ) = Z. Next, we ll show that F is single-valued. Assume (x, y) F and (x, z) F where x, y, z Z. Then y = x 2 and z = x 2. Therefore y = z. This completes the proof. 6
8 Functions Example: Let F be the relation from R to R defined by F = {(x, y) R R x = y 3 }. Prove that F is a function R to R. Proof: 7
9 Functions Example: Let F be the relation from R to R defined by F = {(x, y) R R x = y 3 }. Prove that F is a function R to R. Proof: First we ll show that Dom(F ) = R. Assume x R. Let y = 3 x. Then, y R. Therefore, (x, y) R R and x = ( 3 x) 3 = y 3, which means (x, y) F. Therefore, x Dom(F ). This proves Dom(F ) = R. Next, we ll show that F is single-valued. Assume (x, y) F and (x, z) F where x, y, z R. Then x = y 3 and x = z 3. Therefore y 3 = z 3. Therefore, y = z. This completes the proof. 8
10 Functions Example: Let F be the relation from R to R defined by F = {(x, y) R R x = y 2 }. Explain why F is not a function from R to R. 9
11 Functions Example: Let F be the relation from R to R defined by F = {(x, y) R R x = y 2 }. Explain why F is not a function from R to R. Solution: If (x, y) F, then x = y 2 0. the domain of F is [0, ), not R. Therefore Also, F is not single-valued. For example, when x = 4, we have y = ±2. That is, (4, 2) F and (4, 2) F. Hence, F is not a function. 10
12 Range of a Function If f : A B and the ordered pair (a, b) belongs to f, then we write f(a) = b and we say b the image of a under f. The range of f, denoted Rng(f), is the set of all images of elements of A. That is, Rng(f) = {b B (a, b) f for some a A} 11
13 Range of a Function Example: Find the range of each function. F : Z Z defined by F (x) = x 2. Rng(F ) = {0, 1, 4, 9, 16,...} F : R R defined by F (x) = sin(x). Rng(F ) = [ 1, 1] F : {1, 2, 3} {4, 5, 6} defined by F = {(1, 5), (2, 5), (3, 4)}. Rng(F ) = {4, 5} 12
14 Composition of Functions Theorem Assume f : A B and g : B C are functions. Then the composite relation g f, given by { } (x, z) A C y [(x, y) f and (y, z) g] is a function from A to C. 14
15 Proof: Assume f : A B and g : B C are functions. We want to show that the relation g f is a function from A to C. First we want to show that the domain of g f is A. Since g f A C, we have Dom(g f) A. Conversely, assume x A. Since f : A B is a function, there exists y B such that (x, y) f. Then, since g : B C is a function, there exists z C such that (y, z) g. Therefore, (x, z) g f, which shows x Dom(g f). This proves Dom(g f) = A. Next, we want to show that g f is singlevalued. Assume (x, z 1 ) g f and (x, z 2 ) g f. Then, there exist y 1 B such that (x, y 1 ) f and (y 1, z 1 ) g, and there exists y 2 B such that (x, y 2 ) f and (y 2, z 2 ) g.
16 In particular, (x, y 1 ) f and (x, y 2 ) f, and since f is single-valued, it follows that y 1 = y 2. Then, (y 1, z 1 ) g and (y 1, z 2 ) = (y 2, z 2 ) g, and since g is single-valued, it follows that z 1 = z 2. This proves g f is single-valued. Therefore, g f is a function from A to B.
17 Composition of Functions Theorem: Assume f : A B, g : B C, and h : C D are functions. Then, (h g) f = h (g f). That is, composition of functions is associative. 15
18 Proof: By the previous theorem, we have Dom((h g) f) = Dom(f) = A, Dom(h (g f)) = Dom((g f)) = Dom(f) = A. This shows that the domains of (h g) f and h (g f) are the same. Next, assume x A. Then, ((h g) f)(x) = (h g)(f(x)) = h(g(f(x))) = h((g f)(x)) = (h (g f))(x). Therefore, (h g) f = h (g f).
19 Composition of Functions Example: Let A = {1, 2, 3, 4, 5} and consider the functions f, g : A A given by f = {(2, 4), (5, 1), (3, 2), (1, 2), (4, 3)} g = {(4, 1), (5, 4), (1, 2), (2, 1), (3, 4)} Determine the following. (g f)(1) = (g f)(2) = (g f)(3) = (g f)(4) = (g f)(5) = g f = Rng(g f) = 16
20 Composition of Functions Example: Let A = {1, 2, 3, 4, 5} and consider the functions f, g : A A given by f = {(2, 4), (5, 1), (3, 2), (1, 2), (4, 3)} g = {(4, 1), (5, 4), (1, 2), (2, 1), (3, 4)} Determine the following. (g f)(1) = g(f(1)) = g(2) = 1 (g f)(2) = g(f(2)) = g(4) = 1 (g f)(3) = g(f(3)) = g(2) = 1 (g f)(4) = g(f(4)) = g(3) = 4 (g f)(5) = g(f(5)) = g(1) = 2 g f = {(1, 1), (2, 1), (3, 1), (4, 4), (5, 2)} Rng(g f) = {1, 2, 4} 17
21 One-To-One Function Let f : A B. We say that f is one-toone, or injective, if and only if (x 1, y) f (x 2, y) f x 1 = x 2 for all x 1, x 2 A and y B. 18
22 One-To-One Function Equivalently, f : A B and only if for all x 1, x 2 A is one-to-one if f(x 1 ) = f(x 2 ) x 1 = x 2 If f is one-to-one, we say f is an injection. 19
23 Onto Function Let f : A B. We say that f is onto, or surjective, if and only if for each y B there exists x A such that f(x) = y. That is, f is onto if and only if the range of f is equal to the codomain of f. If f is onto, we say that f is a surjection. 20
24 Examples Let A = {1, 2, 3, 4}, B = {a, b, c}, C = {α, β, γ} Determine if the given functions are oneto-one, onto, both or neither. 1. f : A B defined by 2. f : B C defined by 3. f : B A defined by 4. f : A C defined by f(1) = a f(2) = b f(3) = a f(4) = b f(a) = β f(b) = γ f(c) = α f(a) = 3 f(b) = 1 f(c) = 4 f(1) = α f(2) = β f(3) = β f(4) = γ 21
25 Proof Strategy To show f is injective Show that if f(x) = f(y), then x = y. To show f is not injective Show that there exist x and y such that f(x) = f(y) and x y. To show f is surjective Show that for each element y in the codomain there exists an element x in the domain such that f(x) = y. To show f is not surjective Show there exists an element y in the codomain such that y f(x) for any x in the domain. 22
26 Example Prove or disprove: The function f : Z Z defined by is injective. f(n) = 2n 3 23
27 Example Prove or disprove: The function f : Z Z defined by is injective. f(n) = 2n 3 f is injective. Proof: For all n, m Z we have f(n) = f(m) iff 2n 3 = 2m 3 iff 2n = 2m iff 2n 2m = 0 iff 2(n m) = 0 iff (n m) = 0 iff n = m. 24
28 In particular, f(n) = f(m) implies n = m for all n, m Z, which proves that f is injective. Note that we did not multiply both sides of the equation 2n = 2m by 1/2, since the codomain of f is Z and 1/2 is not an integer.
29 Example Prove or disprove: The function f : Z Z defined by is surjective. f(n) = 2n 3 25
30 Example Prove or disprove: The function f : Z Z defined by is surjective. f(n) = 2n 3 f is not surjective. The range of f contains only odd integers, therefore Rng(f) Z. For example, 0 / Rng(f) since the equation f(n) = 2n 3 = 0 has no solution in the domain Z. 26
31 Example Prove or disprove: The function f : Z Z defined by f(n) = is injective. n + 1 if n is odd n/2 if n is even 27
32 Example Prove or disprove: The function f : Z Z defined by f(n) = is injective. n + 1 if n is odd n/2 if n is even f is not injective. Let n = 1 and m = 4. Then, f(n) = f(1) = = 2, and f(m) = f(4) = 4/2 = 2. Therefore f(m) = f(n), but m n. proves f is not injective. This 28
33 Example Prove or disprove: The function f : Z Z defined by f(n) = is surjective. n + 1 if n is odd n/2 if n is even 29
34 Example Prove or disprove: The function f : Z Z defined by f(n) = is surjective. n + 1 if n is odd n/2 if n is even f is surjective. Proof: We want to show that for all m Z (codomain), there exists n Z (domain) such that f(n) = m. Assume m Z. Let n = 2m. Then, n is an even integer. Therefore, f(n) = n/2 = 2m/2 = m. 30
35 This proves there exists an integer n, namely n = 2m, such that f(n) = m. Therefore, f is surjective. Note that if n is odd, then f(n) = n + 1 is even. So if m is an even number in the codomain, then there are both even and odd values of n that map to m. Either n = 2m (even) as above, or n = m 1 (odd), which gives f(n) = n + 1 = (m 1) + 1 = m. Since the former choice works even in the case when m is odd, there was no need to consider the latter choice for n.
36 Bijection A function f : A B is said to be a bijection, or one-to-one correspondence if f is both one-to-one and onto. Examples f : Z Z defined by f(n) = n + 1 f : R R defined by f(x) = 2x f : Z + Z + defined by f(n) = { n + 1 if n is odd n 1 if n is even 31
37 Bijection Example: Prove that f : R + (0, 1), defined by is a bijection. f(x) = x 32
38 Proof: We want to show that f is one-toone (injective) and onto (surjective). Step 1. (f is one-to-one.) For all x 1, x 2 R + we have f(x 1 ) = f(x 2 ) iff 1 = x x 2 iff 1 + x 1 = 1 + x 2 iff x 1 = x 2 In particular, f(x 1 ) = f(x 2 ) implies x 1 = x 2 for all x 1, x 2 R +, which proves that f is one-to-one. Step 2. (f is onto.) Let y = 1 1+x. Solving for x in terms of y we obtain x = 1 y 1.
39 Note that if 0 < y < 1, then x = 1 y 1 > = 0. Therefore, for all y (0, 1), there exists x R +, namely x = 1 y 1, such that f(x) = x = ( 1 y 1) = 1 1 y = y This proves f is onto. Therefore, f is a bijection.
40 Image and Preimage If f : A B and S A, then the image of S under f is the set f(s) = {b B b = f(s) for some s S} If T B, then the preimage of T is the set f 1 (T ) = {a A f(a) T } 33
41 Image and Preimage Example: defined by f(x) = x 2. Consider the function f : R R codomain of f: range of f: If S = [ 2, 3), then f(s) = If T = ( 1, 4], then f 1 (T ) = 34
42 Image and Preimage Example: defined by f(x) = x 2. Consider the function f : R R codomain of f: R range of f: [0, ) If S = [ 2, 3), then f(s) = [0, 9) If T = ( 1, 4], then f 1 (T ) = [ 2, 2] 35
43 Image and Preimage Example: Consider the function f : R R defined by f(x) = x 2. (a) Let S = [ 2, 3). Find f(s). 36
44 (b) Let T = ( 1, 4]. Find f 1 (T ).
45 Image and Preimage Let f : A B, where A and B are nonempty sets. Prove that if S 1, S 2 A, then f(s 1 S 2 ) = f(s 1 ) f(s 2 ). 37
46 Proof: First assume y f(s 1 S 2 ). Then, there exists an element s S 1 S 2 such that y = f(s). Therefore y = f(s) for some s S 1, or y = f(s) for some s S 2. That is, y f(s 1 ) or y f(s 2 ). Therefore, y f(s 1 ) f(s 2 ). This proves f(s 1 S 2 ) f(s 1 ) f(s 2 ). Conversely, assume y f(s 1 ) f(s 2 ). Then, y f(s 1 ) or y f(s 2 ). Therefore, y = f(s) for some s S 1, or y = f(s) for some s S 2. Therefore, there exists s S 1 S 2 such that y = f(s). This proves f(s 1 ) f(s 2 ) f(s 1 S 2 ). Therefore, f(s 1 ) f(s 2 ) = f(s 1 S 2 ). 38
47 Image and Preimage Let f : A B, where A and B are nonempty sets. Prove that if T 1, T 2 B, then f 1 (T 1 T 2 ) = f 1 (T 1 ) f 1 (T 2 ) 39
48 Proof: For all a A, we have a f 1 (T 1 T 2 ) iff f(a) T 1 T 2 iff f(a) T 1 and f(a) T 2 iff a f 1 (T 1 ) and a f 1 (T 2 ) iff a f 1 (T 1 ) f 1 (T 2 ). Therefore, f 1 (T 1 T 2 ) = f 1 (T 1 ) f 1 (T 2 ). 40
49 Identity Function Let A be a set. The identity function on A is the function i A : A A defined by i A (x) = x for all x A. That is, i A = {(x, x) x A}. The identity function i A is one-to-one and onto, so it is a bijection. 41
50 Inverse Function Let f : A B be a bijection. The inverse function of f, denoted by f 1, is the function that assigns to an element b B the unique element a A such that f(a) = b. That is, f 1 (b) = a if and only if f(a) = b If f has an inverse function, we say that f is invertible. Note that we use the notation f 1 (T ) to denote the preimage of a set T B, even when f is not invertible. 42
51 Examples Let A = {1, 2, 3, 4}, B = {a, b, c}, C = {α, β, γ}. Determine if each function invertible. If so, find f f : B C defined by f(a) = β f(b) = γ f(c) = α 2. f : A B defined by f(1) = a f(2) = b f(3) = a f(4) = b 43
52 Example Determine if each function invertible. If so, find f f : Z Z defined by f(n) = n f : R R defined by f(x) = 2x f : R R defined by f(x) = x 2 44
Functions. Given a function f: A B:
Functions Given a function f: A B: We say f maps A to B or f is a mapping from A to B. A is called the domain of f. B is called the codomain of f. If f(a) = b, then b is called the image of a under f.
More informationNotes. Functions. Introduction. Notes. Notes. Definition Function. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y.
Functions Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Section 2.3 of Rosen cse235@cse.unl.edu Introduction
More informationCS100: DISCRETE STRUCTURES
1 CS100: DISCRETE STRUCTURES Computer Science Department Lecture 2: Functions, Sequences, and Sums Ch2.3, Ch2.4 2.3 Function introduction : 2 v Function: task, subroutine, procedure, method, mapping, v
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Spring
c Dr Oksana Shatalov, Spring 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More information5 FUNCTIONS. 5.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2017 1 5 FUNCTIONS 5.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to
More information9 FUNCTIONS. 9.1 The Definition of Function. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2018 1 9 FUNCTIONS 9.1 The Definition of Function DEFINITION 1. Let X and Y be nonempty sets. A function f from the set X to the set Y is a correspondence that assigns to each
More informationSection 4.4 Functions. CS 130 Discrete Structures
Section 4.4 Functions CS 130 Discrete Structures Function Definitions Let S and T be sets. A function f from S to T, f: S T, is a subset of S x T where each member of S appears exactly once as the first
More informationSection Summary. Definition of a Function.
Section 2.3 Section Summary Definition of a Function. Domain, Cdomain Image, Preimage Injection, Surjection, Bijection Inverse Function Function Composition Graphing Functions Floor, Ceiling, Factorial
More informationMATH 224 FOUNDATIONS DR. M. P. M. M. M C LOUGHLIN HAND-OUT XIV FUNCTIONS REVISED 2016
ath 224 Dr. c Loughlin Hand-out 14 Functions, page 1 of 9 ATH 224 FOUNDATIONS DR.. P... C LOUGHLIN HAND-OUT XIV FUNCTIONS REVISED 2016 Recall: Let U be a well defined universe. Let V be the well defined
More informationFunc%ons. function f to the element a of A. Functions are sometimes called mappings or transformations.
Section 2.3 Func%ons Definition: Let A and B be nonempty sets. A function f from A to B, denoted f: A B is an assignment of each element of A to exactly one element of B. We write f(a) = b if b is the
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationSec$on Summary. Definition of a Function.
Section 2.3 Sec$on Summary Definition of a Function. Domain, Codomain Image, Preimage Injection, Surjection, Bijection Inverse Function Function Composition Graphing Functions Floor, Ceiling, Factorial
More informationFunctions Functions and Modeling A UTeach/TNT Course
Definition of a Function DEFINITION: Let A and B be sets. A function between A and B is a subset of A B with the property that if (a, b 1 )and(a, b 2 ) are both in the subset, then b 1 = b 2. The domain
More informationREVIEW FOR THIRD 3200 MIDTERM
REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =
More informationDiscussion Summary 10/16/2018
Discussion Summary 10/16/018 1 Quiz 4 1.1 Q1 Let r R and r > 1. Prove the following by induction for every n N, assuming that 0 N as in the book. r 1 + r + r 3 + + r n = rn+1 r r 1 Proof. Let S n = Σ n
More informationCOM S 330 Homework 05 Solutions. Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem. Problem 1. [5pts] Consider our definitions of Z, Q, R, and C. Recall that A B means A is a subset
More informationSection Summary. Definition of a Function.
Section 2.3 Section Summary Definition of a Function. Domain, Codomain Image, Preimage Injection, Surjection, Bijection Inverse Function Function Composition Graphing Functions Floor, Ceiling, Factorial
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationFunctions If (x, y 1 ), (x, y 2 ) S, then y 1 = y 2
Functions 4-3-2008 Definition. A function f from a set X to a set Y is a subset S of the product X Y such that if (, y 1 ), (, y 2 ) S, then y 1 = y 2. Instead of writing (, y) S, you usually write f()
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) : (a A) and (b B)}. The following points are worth special
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationToday s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions
Today s Topics Set identities Methods of proof Relationships to logical equivalences Functions Important definitions Relationships to sets, relations Special functions Set identities help us manipulate
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More information9/21/2018. Properties of Functions. Properties of Functions. Properties of Functions. Properties of Functions. Properties of Functions
How can we prove that a function f is one-to-one? Whenever you want to prove something, first take a look at the relevant definition(s): x, y A (f(x) = f(y) x = y) f:r R f(x) = x 2 Disproof by counterexample:
More information9/21/17. Functions. CS 220: Discrete Structures and their Applications. Functions. Chapter 5 in zybooks. definition. definition
Functions CS 220: Discrete Structures and their Applications Functions Chapter 5 in zybooks A function maps elements from one set X to elements of another set Y. A B Brian C Drew range: {A, B, D} Alan
More informationDefinition: For nonempty sets X and Y, a function, f, from X to Y is a relation that associates with each element of X exactly one element of Y.
Functions Definition: A relation is a correspondence between two sets. If x and y are two elements in these sets and if a relation exists between x and y, then we say that x corresponds to y or that y
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More information1. Decide for each of the following expressions: Is it a function? If so, f is a function. (i) Domain: R. Codomain: R. Range: R. (iii) Yes surjective.
Homework 2 2/14/2018 SOLUTIONS Exercise 6. 1. Decide for each of the following expressions: Is it a function? If so, (i) what is its domain, codomain, and image? (iii) is it surjective? (ii) is it injective?
More informationCS 220: Discrete Structures and their Applications. Functions Chapter 5 in zybooks
CS 220: Discrete Structures and their Applications Functions Chapter 5 in zybooks Functions A function maps elements from one set X to elements of another set Y. A Brian Drew Alan Ben B C D F range: {A,
More informationSection 7.2: One-to-One, Onto and Inverse Functions
Section 7.2: One-to-One, Onto and Inverse Functions In this section we shall developed the elementary notions of one-to-one, onto and inverse functions, similar to that developed in a basic algebra course.
More informationRED. Name: Math 290 Fall 2016 Sample Exam 3
RED Name: Math 290 Fall 2016 Sample Exam 3 Note that the first 10 questions are true false. Mark A for true, B for false. Questions 11 through 20 are multiple choice. Mark the correct answer on your ule
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationQUESTION BANK II PUC SCIENCE
QUESTION BANK II PUC SCIENCE I. Very Short answer questions. (x9=9). Define Symmetric relation. Ans: A relation R on the set A is said to be symmetric if for all a, b, A, ar b Implies bra. i.e. (a, b)
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationSolutions to Homework Problems
Solutions to Homework Problems November 11, 2017 1 Problems II: Sets and Functions (Page 117-118) 11. Give a proof or a counterexample of the following statements: (vi) x R, y R, xy 0; (x) ( x R, y R,
More informationDay 15. Tuesday June 12, 2012
Day 15 Tuesday June 12, 2012 1 Properties of Function So far we have talked about different things we can talk about with respect to a function. So far if f : A B we have the following features: A domain:
More informationRELATIONS AND FUNCTIONS
For more important questions visit : www.4ono.com CHAPTER 1 RELATIONS AND FUNCTIONS IMPORTANT POINTS TO REMEMBER Relation R from a set A to a set B is subset of A B. A B = {(a, b) : a A, b B}. If n(a)
More information447 HOMEWORK SET 1 IAN FRANCIS
7 HOMEWORK SET 1 IAN FRANCIS For each n N, let A n {(n 1)k : k N}. 1 (a) Determine the truth value of the statement: for all n N, A n N. Justify. This statement is false. Simply note that for 1 N, A 1
More informationAMB111F Notes 1: Sets and Real Numbers
AMB111F Notes 1: Sets and Real Numbers A set is a collection of clearly defined objects called elements (members) of the set. Traditionally we use upper case letters to denote sets. For example the set
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More informationSets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth
Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationFunctions. Chapter Continuous Functions
Chapter 3 Functions 3.1 Continuous Functions A function f is determined by the domain of f: dom(f) R, the set on which f is defined, and the rule specifying the value f(x) of f at each x dom(f). If f is
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationQF101: Quantitative Finance August 22, Week 1: Functions. Facilitator: Christopher Ting AY 2017/2018
QF101: Quantitative Finance August 22, 2017 Week 1: Functions Facilitator: Christopher Ting AY 2017/2018 The chief function of the body is to carry the brain around. Thomas A. Edison 1.1 What is a function?
More informationRED. Fall 2016 Student Submitted Sample Questions
RED Fall 2016 Student Submitted Sample Questions Name: Last Update: November 22, 2016 The questions are divided into three sections: True-false, Multiple Choice, and Written Answer. I will add questions
More informationMath 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.
Math 20 Exam 2 - Practice Problems. For each of the following, determine whether the statement is True or False. (a) {a,b,c,d} TRE (b) {a,b,c,d} FLSE (c) {a,b, } TRE (d) {a,b, } TRE (e) {a,b} {a,b} FLSE
More informationSelected problems from past exams
Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence
More informationSets, Functions and Relations
Chapter 2 Sets, Functions and Relations A set is any collection of distinct objects. Here is some notation for some special sets of numbers: Z denotes the set of integers (whole numbers), that is, Z =
More informationChapter 2 Invertible Mappings
Chapter 2 Invertible Mappings 2. Injective, Surjective and Bijective Mappings Given the map f : A B, and I A, theset f (I ) ={f (x) : x I } is called the image of I under f.ifi = A, then f (A) is called
More informationRelations, Functions & Binary Operations
Relations, Functions & Binary Operations Important Terms, Definitions & Formulae 0 TYPES OF INTERVLS a) Open interval: If a and b be two real numbers such that a b then, the set of all the real numbers
More informationINFINITY.THINK BEYOND.
RELATIONS & FUNCTIONS SCHEMATIC DIAGRAM Topic Concepts Degree of importance References NCERT Text Book XII Ed. 007 Relations & (i).domain, Co domain & * (Previous Knowledge) Functions Range of a relation
More informationFunctions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014
Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6 th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. I have omitted some
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 10/10/2018 at 23:28:03 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationSolved Examples. Given are two sets A {1, 2, -2, 3} and B = {1, 2, 3, 5}. Is the function f(x) = 2x - 1 defined from A to B?
Solved Examples Example 1: Given are two sets A {1, 2, -2, 3} and B = {1, 2, 3, 5}. Is the function f(x) = 2x - 1 defined from A to B? Solution : Out of all the ordered pairs, the ordered pairs which are
More informationCLASS12 RELATIONS AND FUNCTIONS
CLASS12 RELATIONS AND FUNCTIONS Deepak sir 9811291604 Relations and functions, domain, co-domain and range have been introduced in Class XI along with different types of specific real valued functions
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More informationLESSON RELATIONS & FUNCTION THEORY
2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular
More information4.1 Real-valued functions of a real variable
Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with co-ordinates in the x-y plane. Instead of coming from R, the first component of an ordered pair comes from
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationPractice Exam 1 CIS/CSE 607, Spring 2009
Practice Exam 1 CIS/CSE 607, Spring 2009 Problem 1) Let R be a reflexive binary relation on a set A. Prove that R is transitive if, and only if, R = R R. Problem 2) Give an example of a transitive binary
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationDiscrete dynamics on the real line
Chapter 2 Discrete dynamics on the real line We consider the discrete time dynamical system x n+1 = f(x n ) for a continuous map f : R R. Definitions The forward orbit of x 0 is: O + (x 0 ) = {x 0, f(x
More informationA function is a special kind of relation. More precisely... A function f from A to B is a relation on A B such that. f (x) = y
Functions A function is a special kind of relation. More precisely... A function f from A to B is a relation on A B such that for all x A, there is exactly one y B s.t. (x, y) f. The set A is called the
More informationSRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY COIMBATORE Discrete Mathematics Functions
1 SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY COIMBATORE 641010 Discrete Mathematics Functions 1. Define function. Let X and Y be any two sets. A relation f from X to Y is called a function if for every x
More informationIntroduction to Decision Sciences Lecture 6
Introduction to Decision Sciences Lecture 6 Andrew Nobel September 21, 2017 Functions Functions Given: Sets A and B, possibly different Definition: A function f : A B is a rule that assigns every element
More informationCardinality and ordinal numbers
Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.
More informationCHAPTER 7 FUNCTIONS. Alessandro Artale UniBZ - artale/
CHAPTER 7 FUNCTIONS Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/ SECTION 7.1 Functions Defined on General Sets Copyright Cengage Learning. All rights reserved. Functions Defined on General
More informationAbout This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018
About This Document This is the examples document for MTH 299. Basically it is a loosely organized universe of questions (examples) that we think are interesting, helpful, useful for practice, and serve
More information4) Have you met any functions during our previous lectures in this course?
Definition: Let X and Y be sets. A function f from the set X to the set Y is a rule which associates to each element x X a unique element y Y. Notation: f : X Y f defined on X with values in Y. x y y =
More informationMATH 22 FUNCTIONS: COMPOSITION & INVERSES. Lecture N: 10/16/2003. Mad world! mad kings! mad composition! Shakespeare, King John, II:1
MATH 22 Lecture N: 10/16/2003 FUNCTIONS: COMPOSITION & INVERSES Mad world! mad kings! mad composition! Shakespeare, King John, II:1 Copyright 2003 Larry Denenberg Administrivia http://denenberg.com/lecturen.pdf
More informationCSCE 222 Discrete Structures for Computing
CSCE 222 Discrete Structures for Computing Sets and Functions Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sets Sets are the most fundamental discrete structure on which all other discrete
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationMath 3450 Homework Solutions
Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the
More informationTopics in Logic, Set Theory and Computability
Topics in Logic, Set Theory and Computability Homework Set #3 Due Friday 4/6 at 3pm (by email or in person at 08-3234) Exercises from Handouts 7-C-2 7-E-6 7-E-7(a) 8-A-4 8-A-9(a) 8-B-2 8-C-2(a,b,c) 8-D-4(a)
More informationFunctions of Several Variables (Rudin)
Functions of Several Variables (Rudin) Definition: Let X and Y be finite-dimensional real vector spaces. Then L(X, Y ) denotes the set of all linear transformations from X to Y and L(X) denotes the set
More informationFunctions. Chapter Introduction to Functions
Chapter 6 Functions 6.1 Introduction to Functions Preview Activity 1 (Functions from Previous Courses) One of the most important concepts in modern mathematics is that of a function. In previous mathematics
More informationTopology Homework Assignment 1 Solutions
Topology Homework Assignment 1 Solutions 1. Prove that R n with the usual topology satisfies the axioms for a topological space. Let U denote the usual topology on R n. 1(a) R n U because if x R n, then
More information9/19/2018. Cartesian Product. Cartesian Product. Partitions
Cartesian Product The ordered n-tuple (a 1, a 2, a 3,, a n ) is an ordered collection of objects. Two ordered n-tuples (a 1, a 2, a 3,, a n ) and (b 1, b 2, b 3,, b n ) are equal if and only if they contain
More informationUWO CS2214 Feb. 4, Assignment #1 Due: Feb. 12, 2017, by 23:55 Submission: on the OWL web site of the course
UWO CS2214 Feb. 4, 2019 Assignment #1 Due: Feb. 12, 2017, by 23:55 Submission: on the OWL web site of the course Format of the submission. You must submit a single file which must be in PDF format. All
More information(So SamID 1 ( ) = Ken W. Smith.)
In an earlier lesson, we introduced functions by assigning US citizens a social security number (SSN ) or by assigning students and staff at Sam Houston State University a student ID (SamID) The function
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Sets and Functions The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Define the
More informationMath 5801 General Topology and Knot Theory
Lecture 3-8/27/2012 Math 5801 Ohio State University August 27, 2012 Course Info Textbook (required) J. R. Munkres, Topology (2nd Edition), Prentice Hall, Englewood Cliffs, NJ, 2000. ISBN-10: 0131816292
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationA Short Review of Cardinality
Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the
More information7. Let K = 15 be the subgroup of G = Z generated by 15. (a) List the elements of K = 15. Answer: K = 15 = {15k k Z} (b) Prove that K is normal subgroup of G. Proof: (Z +) is Abelian group and any subgroup
More informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationSolutions for Chapter Solutions for Chapter 17. Section 17.1 Exercises
Solutions for Chapter 17 403 17.6 Solutions for Chapter 17 Section 17.1 Exercises 1. Suppose A = {0,1,2,3,4}, B = {2,3,4,5} and f = {(0,3),(1,3),(2,4),(3,2),(4,2)}. State the domain and range of f. Find
More informationIntroduction to Abstract Mathematics
Introduction to Abstract Mathematics Notation: Z + or Z >0 denotes the set {1, 2, 3,...} of positive integers, Z 0 is the set {0, 1, 2,...} of nonnegative integers, Z is the set {..., 1, 0, 1, 2,...} of
More information4. We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x
4 We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x x, x > 0 Since tan x = cos x, from the quotient rule, tan x = sin
More informationNumbers, sets, and functions
Chapter 1 Numbers, sets, and functions 1.1. The natural numbers, integers, and rational numbers We assume that you are familiar with the set of natural numbers the set of integers and the set of rational
More information