For each of the following mappings
a.
c.
e.
g.
i.
k.
m.
Want to see the full answer?
Check out a sample textbook solutionChapter 1 Solutions
Elements Of Modern Algebra
- 3. For each of the following mappings, write out and for the given and, where.arrow_forward2. For each of the mappings given in Exercise 1, determine whether has a left inverse. Exhibit a left inverse whenever one exists. For each of the following mappings exhibit a right inverse of with respect to mapping composition whenever one exists. a. b. c. d. e. f. g. h. i. j. k. l. m. n.arrow_forwardFor each of the following mappings f:ZZ, determine whether the mapping is onto and whether it is one-to-one. Justify all negative answers. a. f(x)=2x b. f(x)=3x c. f(x)=x+3 d. f(x)=x3 e. f(x)=|x| f. f(x)=x|x| g. f(x)={xifxiseven2x1ifxisodd h. f(x)={xifxisevenx1ifxisodd i. f(x)={xifxisevenx12ifxisodd j. f(x)={x1ifxiseven2xifxisoddarrow_forward
- 5. For each of the following mappings, determine whether the mapping is onto and whether it is one-to-one. Justify all negative answers. (Compare these results with the corresponding parts of Exercise 4.) a. b. c. d. e. f.arrow_forwardFor each of the following parts, give an example of a mapping from E to E that satisfies the given conditions. a. one-to-one and onto b. one-to-one and not onto c. onto and not one-to-one d. not one-to-one and not ontoarrow_forwardLet f:AA, where A is nonempty. Prove that f a has right inverse if and only if f(f1(T))=T for every subset T of A.arrow_forward
- 18. Let and be defined as follows. In each case, compute for arbitrary . a. b. c. d. e.arrow_forward27. Let , where and are nonempty. Prove that has the property that for every subset of if and only if is one-to-one. (Compare with Exercise 15 b.). 15. b. For the mapping , show that if , then .arrow_forward10. Let and be mappings from to. Prove that if is invertible, then is onto and is one-to-one.arrow_forward
- For the given f:ZZ, decide whether f is onto and whether it is one-to-one. Prove that your decisions are correct. a. f(x)={ x2ifxiseven0ifxisodd b. f(x)={ 0ifxiseven2xifxisodd c. f(x)={ 2x+1ifxisevenx+12ifxisodd d. f(x)={ x2ifxisevenx32ifxisodd e. f(x)={ 3xifxiseven2xifxisodd f. f(x)={ 2x1ifxiseven2xifxisoddarrow_forward(See exercise 24.) Show that the relation f(x)Rg(x) if and only if f(x)=g(x) is an equivalence relation on R[ x ]. Describe the equivalence class [ f(x) ]. For each f(x)=i=0naixi in R[ x ], the formal derivative of f(x) is the polynomial f(x)=i=1niaixi1. (For n=0, f(x)=0 by definition.) Prove that [ f(x)+g(x) ]=f(x)+g(x). Prove that [ f(x)g(x) ]=f(x)g(x)+f(x)g(x).arrow_forwardFor an element x of an ordered integral domain D, the absolute value | x | is defined by | x |={ xifx0xif0x Prove that | x |=| x | for all xD. Prove that | x |x| x | for all xD. Prove that | xy |=| x || y | for all x,yD. Prove that | x+y || x |+| y | for all x,yD. Prove that | | x || y | || xy | for all x,yD.arrow_forward
- Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning