1. 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.
|
|
- Ashlyn Jackson
- 5 years ago
- Views:
Transcription
1 Homework 2 2/14/2018 SOLUTIONS Exercise 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? (iv) is it invertible? (a) f : R R defined by x x 3 f is a function. (i) Domain: R. Codomain: R. Range: R. (ii) Yes injective. (iii) Yes surjective. (iv) Yes invertible. (b) f : R R defined by x x f is not a function, since, for example, 1 1 and 1. (c) f : Z Z Q defined by (a, b) a/b f is not a function since it s not defined on Z {0}. (d) f : R Z Z defined by (r, z) r z f is a function. (i) Domain: R Z. Codomain: Z. Range: Z. (ii) f is not injective. For example, (2, 1) and (1.5, 1) both map to 2. (iii) f is surjective, since for every integer z, (1, z) z. (iv) f is not invertible since its not injective. 1
2 2 f (e) k j i c b a f is a function. (i) Domain: {i, j, k}. Codomain: {a, b, c}. Range: {a, b, c}. (ii) f is injective. (iii) f is surjective. (iv) f is invertible. A B f k c (f) j b f is not a function since j has no image and i has two elements in its image. i a A B 2. For those examples which were not functions in the previous problems, can you restrict the domain and/or codomain to make them functions? i.e. pick a reasonable subset of the given domain/codomain such that the expression is a function on that domain. (b) Some examples: Restrict the domain to R 0, or to R 0, or to {1}, or.... (c) Some examples: Restrict the domain to R Z >0, or to R (Z >0 Z <0, or to { 3} {2}, or.... (f) Restrict the domain to {k} (only possibility). 3. Choose a domain and codomain for the following expressions to make them into functions satisfying (i) f is an injective but not surjective function; (ii) f is a surjective but not injective function; (iii) f is an invertible function; (iv) f is not a function; where f is given by: (a) f(x) = x (i) injective but not surjective: Domain R >0, Codomain R. (ii) surjective but not injective: Domain R, Codomain R 0. (iii) invertible function: Domain R >0, Codomain R >0. (iv) not a function: Domain R >0, Codomain {0}. (b) f(x) = 1/x (i) injective but not surjective: Domain R >0, Codomain R. (ii) surjective but not injective: Not possible within C. (iii) invertible function: Domain R >0, Codomain R >0.
3 3 (iv) not a function: Domain R, Codomain anything. (c) f(x) = 6 (i) injective but not surjective: Domain {1}, Codomain R. (ii) surjective but not injective: Domain {1, 2}, Codomain {6}. (iii) invertible function: Domain {1}, Codomain {6}. (iv) not a function: Domain {1, 2}, Codomain {0}. (d) f(x, y) = xy (i) injective but not surjective: Domain Z >0 {1}, Codomain R. (ii) surjective but not injective: Domain Z >0 {0}, Codomain {0}. (iii) invertible function: Domain {0} {0}, Codomain {0}. (iv) not a function: Domain {1} {1}, Codomain {±1}. (e) f is determined by the set {(1, 5), (2, 3), (1, 10), (3, 3)}. (i) injective but not surjective: Domain {1}, Codomain {5, 6}. (ii) surjective but not injective: Domain {2, 3}, Codomain { 3}. (iii) invertible function: Domain {1}, Codomain {5}. (iv) not a function: Domain {5}, Codomain anything. 4. Let f be a function from the set A to the set B. Let S and T be subsets of A. Show that (a) f(s T ) = f(s) f(t ): Proof. First we show that f(s T ) f(s) f(t ): If x f(s T ), then x = f(a) for a S T. So either x = f(a) for a S, or x = f(a) for a T. Thus x f(s) f(t ), implying that f(s T ) f(s) f(t ). Next, we show that f(s T ) f(s) f(t ): If x f(s) f(t ), then x f(s) f(s T ) or x f(t ) f(s T ). So x f(s T ). Thus f(s T ) f(s) f(t ). So f(s T ) = f(s) f(t ). (b) f(s T ) f(s) f(t ). Proof. If x f(s T ) then x = f(a) for a S and a T. So x f(s) and x f(t ), implying x f(s) f(t ). Thus f(s T ) f(s) f(t ). Can you think of an example where the inclusion in part (b) could be proper (not equal)? and Example: Let f : {a, b} {x} be the function f(a) = f(b) = x. With S = {a} and T = {b}, f(s T ) = f( ) = f(s) f(t ) = {x} {x} = {x}. Exercise 7. Let f : A B and g : B C be functions. Draw some pictures (like our previous example) and make some conjectures about the following questions.
4 4 1. Is g f always a function? Yes. 2. What are the conditions on f, g, A, B, and/or C for g f to be surjective? It must be the case that g is surjective. Then for each c C, f(a) g 1 (c) must be nonempty. 3. What are the conditions on f, g, A, B, and/or C for g f to be injective? It must be the case that f is injective, and that g restricted to f(a) must also be injective. 4. What are the conditions on f, g, A, B, and/or C for g f to be bijective? In this case, f must be injective, and g restricted to f(a) must be bijective. 5. What are the conditions on f, g, A, B, and/or C for f g to be a function? In order for f to be defined on g(b), we must have g(b) A 6. If g and g f are injective, is it necessarily true that f is injective? Yes, as we guessed before, for g f to be injective at all, f must be injective. 7. If g and g f are surjective, is it necessarily true that f is surjective? No. Exercise 8. Show that if both f : A B and g : B C are surjective functions, then g f is also surjective. Proof. Pick any c C. Since g is a surjective function, there is some b B such that g(b) = c. And since f is a surjective function, there is some a A such that f(a) = b. So g(f(a)) = g(b) = c, so that c (g f)(a). Since this was true for any c C, we have C (g f)(a). Therefore g f is surjective. Exercise Decide if the following sequences are arithmetic, geometric, or neither. If it s arithmetic or geometric, find a formula expressing the nth term of the sequence. (a) 5, 1, 3, 7, 11,... Check: 4 = 1 5 = 3 1 = 7 ( 3) = 11 ( 7) =, so the sequence is arithmetic, given by a n = 4n + 5 (starting at a 0 ). (b) 1, 4, 9, 16, 25,... Check: the differences and ratios are not constant ( and 4/1 9/4), so this sequence is neither arithmetic nor geometric. (c) 3, 9, 27, 81, 243,... Check: 3 = 9/3 = 27/9 = 81/27 = 243/81 =, so this sequence is geometric, given by a n = 3 3 n (starting at a 0 ). (d) The sequence satisfying a 0 = 2 and a n = 1 2 a n 1. This sequence starts out like 2, 1, 1/2, 1/4, 1/8,.... Check: a n /a n 1 = 1 2 a n 1/a n 1 = 1 2. So this sequence is geometric with a n = 2(1/2) n (starting at a 0 ).
5 (e) The sequence satisfying a 0 = 1 and a n = a n This sequence starts out like 1, 4, 9, 14,.... Check: a n a n 1 = a n a n 1 = 5, so this sequence is arithmetic with a n = 1 + 5n (starting at a 0 ). (f) The sequence satisfying a 0 = 1, a 1 = 1 and a n = a n 2 a n 1. This sequence starts out like 1, 1, 1, 1, 1, 1, 1, 1,.... Check: a n /a n 1 = 1/ 1 or 1/1, and is either way the constant 1. So this sequence is geometric, given by a n = ( 1) n (starting from a 0 ). 2. For each of the following, try to find a closed formula. (a) The sequence satisfying a 0 = 2 and a n = 1 2 a n 1. a n = 1 2 a n 1 for n = 0, 1, 2,.... (see part (1)(d)) (b) The sequence satisfying a 0 = 1 and a n = a n a n = a n for n = 0, 1, 2,.... (see part (1)(e)) (c) The sequence satisfying a 0 = 2 and a n = a n 1. This sequence starts out like 2, 2, 2, 2, 2,..., so that it is a geometric sequence with a n = 2( 1) n for n = 0, 1, 2, Exercise 10. (1) Calculate the following: 8 (a) (1 + ( 1) j ) = = 10 (b) j=0 2 j= 1 i=2 j= 1 i=2 3 (2i + 3j) (2i + 3j) = (( j) + ( j)) j= 1 2 = (10 + 6j) j= 1 = (10 + 6( 1)) + (10 + 6(0)) + (10 + 6(1)) + (10 + 6(2)) = ( ) = 52 (c) (d) 2 = = 6 j { 1,4,15} j j {z Z z 2} Since {z Z z 2} = { 2, 1, 0, 1, 2}, we have j = = 0 j {z Z z 2}
6 6 (e) 5 (a n a n 1 ) where a n = n! n=2 5 (a n a n 1 ) = (a 2 a 1 ) + (a 3 a 2 ) + (a 4 a 3 ) + (a 5 a 4 ) = a 5 a 1 = 5! 1! = 5! 1 n=2 (f) 2000 i = /2 = 2, 001, 000 (2) Use partial sums to explain why, for any sequence a 0, a 1,..., a n, that n a i a i 1 = a n a 0. [Let S n = n a i a i 1. Write out S 1, S 2, S 3, and so on until you see the pattern. Then use the fact that S n = S n 1 + (a n a n 1 ).] Let S n = n a i a i 1, so that S 1 = a 1 a 0 S 2 = a 1 a 0 + a 2 a 1 = a 2 a 0 S 3 = a 1 a 0 + a 2 a 1 + a 3 a 2 = a 3 a 0. Note that S n = S n 1 + (a n a n 1 ). So starting with S 1 = a 1, adding the next term to S n 1 to get S n always cancels the highest index term of S n 1 (a n 1 ) and adds a n. What s left if a n a #2 Determine whether f is a function from Z to R if (a) f(n) = ±n Ans: no, since 1 ±1 (b) f(n) = n Ans: Yes, if we always take the positive root, no if not. (c) f(n) = 1/(n 2 4) Ans: No, since f(2) is not defined. 2.3 #6 Find the domain and range of these functions. (a) the function that assigns to each pair of positive integers the first integer of the pair. Ans: Domain Z >0 Z >0, Range Z >0. (b) the function that assigns to each positive integer its largest decimal digit. Ans: Domain Z >0, Range {0}. (d) the function that assigns to each positive integer the largest integer not exceeding the square root of the integer. Ans: Domain Z >0 Z >0, Range Z > #16 Consider these functions from the set of students in a discrete math class. Under what conditions is the function one-to-one if it assigns to a student his of her (a) mobile phone number Ans: If no two students share a phone
7 7 (b) student identification number Ans: If the registrar hasn t messed up (c) final grade in the class Ans: If no two students get the same final grade (small class!) (d) home town Ans: If no two students come from the same town 2.3 #32 Let f(x) = 2x where the domain is the set of real numbers. (a) f(z) = { even integers } (b) f(n) = { positive even integers } (c) f(r) = R 2.3 #42 Let f be the function from R to R defined by f(x) = x 2. (a) f 1 ({1}) = {±1} (b) f 1 ({x 0 < x < 1}) = {x 0 < x < 1} {x 0 > x > 1} (c) f 1 ({x x > 4}) = {x x > 2} {x x < 2} 2.4 #4 What are the terms a 0, a 1, a 2, and a 3 of the sequence {a n }, where a n equals (a) ( 2) n : a 0 = 1, a 1 = 2, a 2 = 4, and a 3 = 8. (b) 3: a 0 = 3, a 1 = 3, a 2 = 3, and a 3 = 3. (c) n : a 0 = 8, a 1 = 11, a 2 = 23, and a 3 = 71. (d) 2 n + (?2) n : a 0 = 2, a 1 = 0, a 2 = 8, and a 3 = #8 Find at least three different sequences beginning with the terms 3, 5, 7 whose terms are generated by a simple formula or rule. a n = 2n + 3 a n = a n Some examples, each beginning with a 0 : n 2, a 0 = 3 a n = a n 1 + 2f n, a 0 = 3, where f n is the Fibbonacci sequence starting with f 0 = 0, f 1 = 1 The day value of dates that MWFs fall on, beginning with August 3rd, #10 (b,c) Find the first six terms of the sequence defined by each of these recurrence relations and initial conditions. (b) a n = a n 1 a n 2, a 0 = 2, a 1 = 1 2, 1, 3, 2, 1, 3,... (c) a n = 3a 2 n 1, a 0 = 1 1, 3, 3 3, 3 7, 3 15, #12 (b,c)show that the sequence {a n } is a solution of the recurrence relation a n = 3a n 1 + 4a n 2 if (b) a n = 1: Check: a n = 1 = 3(1) + 4(1) = 3a n 1 + 4a n 2.
8 8 (c) a n = ( 4) n : Check: 3a n 1 + 4a n 2 = 3 ( 4) n ( 4) n 2 = 3 ( 4) n 1 ( 4) n 1 = ( 4) n = a n. 2.4 #14 (c,d,e) For each of these sequences find a recurrence relation satisfied by this sequence. (The answers are not unique because there are infinitely many different recurrence relations satisfied by any sequence.) (c) a n = 2n + 3 For example, a 0 = 3 and a n = a n (d) a n = 5 n For example, a 0 = 1 and a n = 5a n 1. (e) a n = n 2 For example, a 0 = 0 and a n = a n 1 +2n 1 (since (n 1) 2 = n 2 2n+1). 2.4 #43 (a,b,c) What are the values of the following products? (a) (b) (c) 10 i=0 i = = 0 8 i = = 1680 i=5 100 ( 1) i 100 ( 1) i = ( 1)( 1) 2 ( 1) 3 ( 1) #44 Express n! using product notation. = ( 1) = ( 1) /2 = ( 1) 5050 = 1 n! = n i.
MATH 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 informationFunctions. 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 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 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 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 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 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 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 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 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 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 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 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 informationFunctions as Relations
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
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 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 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 informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
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 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 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 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 informationMath 300 Introduction to Mathematical Reasoning Autumn 2017 Inverse Functions
Math 300 Introduction to Mathematical Reasoning Autumn 2017 Inverse Functions Please read this pdf in place of Section 6.5 in the text. The text uses the term inverse of a function and the notation f 1
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 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 informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
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 informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
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 informationIntroduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION
Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from
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 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 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 informationLecture 3: Sizes of Infinity
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 3: Sizes of Infinity Week 2 UCSB 204 Sizes of Infinity On one hand, we know that the real numbers contain more elements than the rational
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
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 informationMODEL ANSWERS TO THE SEVENTH HOMEWORK. (b) We proved in homework six, question 2 (c) that. But we also proved homework six, question 2 (a) that
MODEL ANSWERS TO THE SEVENTH HOMEWORK 1. Let X be a finite set, and let A, B and A 1, A 2,..., A n be subsets of X. Let A c = X \ A denote the complement. (a) χ A (x) = A. x X (b) We proved in homework
More informationChapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60
MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences
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 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 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
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 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 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 information, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8
Warm Up Look for a pattern and predict the next number or expression in the list. 1. 1000, 500, 250, 125, 62.5 2. 1, 2, 4, 7, 11, 16, 22 3. 1, 3, 9, 27, 81 4. 8, 3, 2, 7, -12 5. 2, 2 2, 4, 4 2, 8 6. 7a
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
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 informationMath 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets
Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets Introduction In this short article, we will describe some basic notions on cardinality of sets. Given two
More informationMATH 2001 MIDTERM EXAM 1 SOLUTION
MATH 2001 MIDTERM EXAM 1 SOLUTION FALL 2015 - MOON Do not abbreviate your answer. Write everything in full sentences. Except calculators, any electronic devices including laptops and cell phones are not
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 informationMath 300: Final Exam Practice Solutions
Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a
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 informationFinite and Infinite Sets
Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following
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 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 informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
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 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 informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationLecture Notes on Discrete Mathematics. October 15, 2018 DRAFT
Lecture Notes on Discrete Mathematics October 15, 2018 2 Contents 1 Basic Set Theory 5 1.1 Basic Set Theory....................................... 5 1.1.1 Union and Intersection of Sets...........................
More informationHomework 5. Solutions
Homework 5. Solutions 1. Let (X,T) be a topological space and let A,B be subsets of X. Show that the closure of their union is given by A B = A B. Since A B is a closed set that contains A B and A B is
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 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 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 information2 Functions. 2.1 What is a function?
Functions After working through this section, you should be able to: (a) determine the image of a given function; (b) determine whether a given function is one-one and/or onto; (c) find the inverse of
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 information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationChapter12. Relations, Functions, and Induction
. Relations. Functions. Seuences.4 Mathematical Induction.5 Recurrence Relations Chapter Review Chapter Relations, Functions, and Induction In this chapter we introduce the concepts of a relation and a
More informationcan only hit 3 points in the codomain. Hence, f is not surjective. For another example, if n = 4
.. Conditions for Injectivity and Surjectivity In this section, we discuss what we can say about linear maps T : R n R m given only m and n. We motivate this problem by looking at maps f : {,..., n} {,...,
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 informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationMTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1
MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use
More informationAlgebra 1 S1 Lesson Summaries. Lesson Goal: Mastery 70% or higher
Algebra 1 S1 Lesson Summaries For every lesson, you need to: Read through the LESSON REVIEW which is located below or on the last page of the lesson and 3-hole punch into your MATH BINDER. Read and work
More informationIntroduction to Functions
Mathematics for Economists Introduction to Functions Introduction In economics we study the relationship between variables and attempt to explain these relationships through economic theory. For instance
More informationDefinition of a function. Elementary Functions. A function machine. Inputs and unique outputs of a function. Sam Houston State University
We study the most fundamental concept in mathematics, that of a In this lecture we first define a function and then examine the domain of functions defined as equations involving real numbers. Part, Functions
More informationSolutions to Tutorial 7 (Week 8)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 7 (Week 8) MATH2962: Real and Complex Analysis (Advanced) Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 1.4.2, 1.4.4, 1.4.9, 1.4.11,
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 informationName (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)
MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question
More informationECS 120 Lesson 18 Decidable Problems, the Halting Problem
ECS 120 Lesson 18 Decidable Problems, the Halting Problem Oliver Kreylos Friday, May 11th, 2001 In the last lecture, we had a look at a problem that we claimed was not solvable by an algorithm the problem
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 informationHomework in Topology, Spring 2009.
Homework in Topology, Spring 2009. Björn Gustafsson April 29, 2009 1 Generalities To pass the course you should hand in correct and well-written solutions of approximately 10-15 of the problems. For higher
More informationFoundations Revision Notes
oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,
More informationAll numbered readings are from Beck and Geoghegan s The art of proof.
MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2
More informationMath 127 Homework. Mary Radcliffe. Due 29 March Complete the following problems. Fully justify each response.
Math 17 Homework Mary Radcliffe Due 9 March 018 Complete the following problems Fully justify each response NOTE: due to the Spring Break, this homework set is a bit longer than is typical You only need
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 informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationIntroduction to Real Analysis
Christopher Heil Introduction to Real Analysis Chapter 0 Online Expanded Chapter on Notation and Preliminaries Last Updated: January 9, 2018 c 2018 by Christopher Heil Chapter 0 Notation and Preliminaries:
More informationMATH 13 FINAL EXAM SOLUTIONS
MATH 13 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. T F
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
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 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 informationNOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.
EXAM 2 solutions (COT3100, Sitharam, Spring 2017) NAME:last first: UF-ID Section NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. (1) Are the following functions one-to-one
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 informationMTH 299 In Class and Recitation Problems SUMMER 2016
MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation
More information