0% found this document useful (0 votes)
3K views3 pages

Ex2 3

Uploaded by

whyalwaysarnab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
3K views3 pages

Ex2 3

Uploaded by

whyalwaysarnab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 3
152 2/ Basic Suuctures: Sets, Functions, Sequences, Sums, and Matrices DEFINITION 13 EXAMPLE 32, Partial Functions A program designed to evaluate a function may not produce the correct value ofthe function for all elements in the domain of this function, For example, a program may not produce a correct Value because evaluating the function may lead to an infinite Ioop or an overflow. Similarly, in abstract mathematics, we often want to discuss functions that are defined only for a subset of the real numbers, such as 1/x, J, and arcsin (x). Also, we may want to use such notions as the “youngest child” function, which is undefined for a couple having no childsen, or the “time of sunrise,” which is undefined for some days above the Arctic Circle. To study such situations, swe use the concept of a patil function. A partial function f from a set A to a set B is an assignment to each element a in a subset of A, called the domain of definition of fof a unique element b in B. The sets A and B are called the domain and codomain of f., respectively. We say that f is undefined for elements in A that are not in the domain of definition of f. When the domain of definition of f equals A, we say that f is a foral function. Remark: We write f: A> B to denote that f is a partial function from A to B. Note that this is the same notation as is used for functions. The context in which the notation is used determines whether f is a partial function or a total function, Thefunction f : Z— Rowhere f(n) = yisapartial function from ZtoR where the domain of efinition isthe set of nonnegative integers, Note that f is undefined for negative integers. Exercises A. Why is f nota function from R to Rif o fo) =2VGF+D7 @ Downe wheter fs fonction fom 210 Rt a) f{n) = tn. Tr 1/@? - 4). 5. Deumine whether aft fom het of a it fg tobe eto ge jena peciion etait >) Jes isthe numberof isin ©) £(S) is the smallest integer i such that the ith bit of ii yperlerct ec ebenrdiate Seg wih 4. nd te domain ang of hese fasts, Note that seth ceo find he domain determine te tof Plemtereta beeen een St ec or nig toa sameness wuaige 1) the fant at ass he et arg becomabenton Benton ht signs to it aiag he umber of owe hein ig 4) tun at gst iting he er tate mine 5, Find the domain and range of these functions. Note that Jn each case, to find the domain, determine the set of clements assigned values by the function. a) the function that assigns o each bit string the number ‘of ones in the string minus the number of zeros in the string ) the function that assigns to each bit string twice the ‘number of zeros in that string © the function that assigns the number of bits left over ‘when a bit string is spit into bytes (which are blocks of S bits) 4) the function that assigns to each positive integer the largest perfect square not exceeding this integer 6, Find the domain and range of these functions. a) the function that assigns to each pair of positive inte- ‘gers the frst integer ofthe pair by) the function that assigns to each positive integer its largest decimal digit ©) the function tha assigns to a bit string the number of ‘ones minus the number of zeros in the sting 4) the function that assigns to each positive integer the largest integer not exceeding the square root of the integer © the function that assigns fo a bit string the longest string of ones in the string 7. Find the domain and range of these functions. 4) the function that assigns to each pair of positive inte- gers the maximum of these two integers the function that assigns to each positive integer the number ofthe digits 0, 1, 2,3, 4, 5, 6, 7, 8,9 that do not appear as decimal digits ofthe integer (©) the function that assigns to a bit string the number of times the block 11 appears 4) the function that assigns to abit string the numerical position of te first 1 in the string and that assigns the value 0 to abit string consisting ofall Os 8, Find these valves ») Uy bf 9) [-0. @) (01) © (2.99) » 4TH w TUF th Find these values » 18 » 9 [=H ® © [3] p 5 ® E+E » GH 10. Determine whether each of these functions from {a,b €, dt itslf is one-to-one a) f@=b. 0) =a. f=. fad d) Sa) =b. fF) =b. SO =4.fld) =e 9 @=4.fO=b fo =e =d 11. Which functions in Exercise 10 ae onto? 12, Determine whether each of these functions Irom Z to Z is one-to-one a) fn) =n-1 bso =ret © fsn 4) Fe) = [n/2] 13, Which functions in Exercise 12 are onto? 14, Determine whether: x Z > Zis ont it a) f(m.n) =2m—n D) fmm) =m? =n © fmm) mene fom) = ml In ©) fmm =m ad 18, Determine whether the function f: Z x Z > Zis onto it a) fmm) =m ») fom) =m? © finn =m @ Fomm =Inh © Fon) = man 16. Consider these functions from the set of students in a discrete mathematic class, Under what conditions isthe function one-to-one if assigns to a student his or her 4) mobile phone number: ) student identification number. ©) final grade in the clas ) home town 17. Consider these functions from the set of teachers in a school. Under what conditions isthe function one-to-one if iC asigns toa teacher his or her 2.3 Functions 153 2) office, b) assigned bus to chaperone in group of buses taking students om afield trp, ©) salary. 4) social security number 18. Specify a codomain for each ofthe functions in Exercise 16, Under what conditions is each ofthese functions with the codomain you specified onto? 19, Specify a codomain for each ofthe functions in Exercise 17. Under what conditions is each of the functions with the codomain you specified onto? 20, Give an example of a function from N to N that is 4) one-to-one but not onto, B) onto but not one-to-one, ‘) both onto and one-to-one (but different from the iden- sity function). 4) either one-to-one nor onto, 21. Give an explicit formula for a function from the set of integers tothe set of positive integers that is 4) one-to-one, but not onto, B) onto, but not one-to-one, (©) one-to-one and onto, 4) neither one-to-one nor onto 22, Determine whether each of these functions isa bijection from R to R. a) faa n3n+4 b) fa) = -3:2 +7 f= + D/O +2 @ fast Determine whether each ofthese functions is a bijection from Ro R. ® f@)=2041 fast 0 f@=2 4) FO) = 62+ H/C? +2) 24, Lat f: RR and let f(s) > 0 for all x ER. Show that (2) is stiety increasing if and only if the fune- tion g(x) = 1/f (a) is steietly decreasing 28, Let f: RR and let f(x) > 0 for all x ER. Show that f(a) is steietly decreasing if and only if the fune- tion g(x) = 1/f(a) is steely increasing, 26, a) Prove that astctly increasing function from R toi self is one-to-one b) Give an example of an increasing function from R to itself that is not one-to-one. 27. a) Prove that a strictly decreasing function from R to itself s one-to-one, ive an example of a decreasing function from R to itself that is not one-to-one. 28, Show that the function f(x) = e* fom the set of real numbers to the set of real numbers is not invertible, but if the codomain is restricted to the set of positive real ‘numbers, the resulting function is invertible. » 154 2/ Basic Swuctures: Sets, Functions, Sequences, Sums, and Matrices 29. Show that the function f(x) = |x| from the set of real hhumbers to the set of nonnegative real numbers is not invertible, bat ifthe domain is restricted tothe set of non- ‘negative real numbers the retulling function i invertible 30, Let $= (=1,0,2.4.7). Find £(S) if a) sa) =. by SQ) = 2041 ©) so) = fx /31 @) SO) =le? + Y/31 @ bet fe = 27/3 Find f(9 if a) §=(-2,-1,0,1,2,3) b) $= (0,1,2,3,4,5) ©) $= (1.5.7.1) ® $=2.6.10.18) 32 Let f(a) = 2 whet the domain is the et of enum bert Whe a) f(Z)? b) FON)? ©) F(R)? 38. Suppose that gis a function fom At B and fs funtion fom wo 2) Show tha i boh fang are one-one functions, thea fo isle emeto-one 1) Show hat if both f and ge eno fantons, hen f eg isalso onto. #34 AF fand fog ae eneso-one, des ew that gi onasornd? Fast your newer #35. f and f owen, dees it follow that git onto? Tui you answer @eind fo and» f, wher fe x2, ae functions from R (oR + Land g(a) = 37. Find f + and fe for the functions f and g given in Exercise 36. 38 Let f(a) = ax $b and gx) = ex +d, where a,b, and d are constants. Determine necessary and suitic cient conditions on the constants a, ¢, and d s0 that Sos=sef 39. Show that the function f(x) = ax + from R to R is invertible, where a and 6 are constants, with @ #0, and find the inverse off. 40, Let f be a function from the set A to the set B. Let $ and TT be subsets of A. Show that a (SUT) = f(U FT) b) SOT) E FHI FC). 41, 2) Give an example to show that he inclusion in pat (b) in Exercise 40 may be proper. 1b) Show that if fis one-to-one, the inclusion in pat (6) in Exercise 40 is an equality. Let f be a function from the set A to the set B. Let $ be a subset of B. We define the inverse image ofS to be the subset ‘of A whose elements are precisely all pre-images of all ele- ments of S. We denote the inverse image of S by f~"(S), so F7"S) = (ae A | fla) € 8). (Beware; The notation F-* s ‘used in two different ways. Do not confuse the notation intro- duced here with the notation fy) for the value at y of the inverse of the invertible function f. Notice also that f—'(), thie mag ofthe st makes sense forall facto sot jut vet fncons) Let be tention fom RoR defined by FQ) =? Find a stay. by se O

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy