 7.2.1: The definition of onetoone is stated in two ways: x1, x2 X, if F(...
 7.2.2: Fill in each blank with the word most or least. a. A function F is ...
 7.2.3: When asked to state the definition of onetoone, a student replies...
 7.2.4: Let f : X Y be a function. True or false? A sufficient condition fo...
 7.2.5: All but two of the following statements are correct ways to express...
 7.2.6: Let X = {1, 5, 9} and Y = {3, 4, 7}. a. Define f : X Y by specifyin...
 7.2.7: Let X = {a, b, c, d} and Y = {e, f, g}. Define functions F and G by...
 7.2.8: Let X = {a, b, c} and Y = {w, x, y,z}. Define functions H and K by ...
 7.2.9: Let X = {1, 2, 3}, Y = {1, 2, 3, 4}, and Z = {1, 2}. a. Define a fu...
 7.2.10: a. Define f : Z Z by the rule f (n) = 2n, for all integers n. (i) I...
 7.2.11: a. Define g: Z Z by the rule g(n) = 4n 5, for all integers n. (i) I...
 7.2.12: a. Define F: Z Z by the rule F(n) = 2 3n, for all integers n. (i) I...
 7.2.13: a. Define H: R R by the rule H(x) = x 2, for all real numbers x. (i...
 7.2.14: Explain the mistake in the following proof. Theorem: The function f...
 7.2.15: In each of 1518 a function f is defined on a set of real numbers. D...
 7.2.16: In each of 1518 a function f is defined on a set of real numbers. D...
 7.2.17: In each of 1518 a function f is defined on a set of real numbers. D...
 7.2.18: In each of 1518 a function f is defined on a set of real numbers. D...
 7.2.19: Referring to Example 7.2.3, assume that records with the following ...
 7.2.20: Define Floor: R Z by the formula Floor(x) = x, for all real numbers...
 7.2.21: Let S be the set of all strings of 0s and 1s, and define l: S Znonn...
 7.2.22: Let S be the set of all strings of 0s and 1s, and define D: S Z as ...
 7.2.23: Define F: P({a, b, c}) Z as follows: For all A in P({a, b, c}), F(A...
 7.2.24: Let S be the set of all strings of as and bs, and define N: S Z by ...
 7.2.25: Let S be the set of all strings in as and bs, and define C: S S by ...
 7.2.26: Define S: Z+ Z+ by the rule: For all integers n, S(n) = the sum of ...
 7.2.27: Let D be the set of all finite subsets of positive integers, and de...
 7.2.28: Define G: R R R R as follows: G(x, y) = (2y, x) for all (x, y) R R....
 7.2.29: Define H: R R R R as follows: H(x, y) = (x + 1, 2 y) for all (x, y)...
 7.2.30: Define J : Q Q R by the rule J (r,s) = r + 2s for all (r,s) Q Q. a....
 7.2.31: Define F: Z+ Z+ Z+ and G: Z+ Z+ Z+ as follows: For all (n, m) Z+ Z+...
 7.2.32: a. Is log8 27 = log2 3? Why or why not? b. Is log16 9 = log4 3? Why...
 7.2.33: The properties of logarithm established in 3335 are used in Section...
 7.2.34: The properties of logarithm established in 3335 are used in Section...
 7.2.35: The properties of logarithm established in 3335 are used in Section...
 7.2.36: Exercises 36 and 37 use the following definition: If f : R R and g:...
 7.2.37: Exercises 36 and 37 use the following definition: If f : R R and g:...
 7.2.38: Exercises 38 and 39 use the following definition: If f : R R is a f...
 7.2.39: Exercises 38 and 39 use the following definition: If f : R R is a f...
 7.2.40: Suppose F: X Y is onetoone. a. Prove that for all subsets A X, F1...
 7.2.41: Suppose F:X Y is onto. Prove that for all subsets B Y, F(F1(B)) = B.
 7.2.42: Let X = {a, b, c, d, e} and Y = {s, t, u, v, w}. In each of 42 and ...
 7.2.43: Let X = {a, b, c, d, e} and Y = {s, t, u, v, w}. In each of 42 and ...
 7.2.44: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.45: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.46: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.47: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.48: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.49: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.50: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.51: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.52: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.53: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.54: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.55: In 4455 indicate which of the functions in the referenced exercise ...
 7.2.56: In Example 7.2.8 a onetoone correspondence was defined from the p...
 7.2.57: Write a computer algorithm to check whether a function from one fin...
 7.2.58: Write a computer algorithm to check whether a function from one fin...
Solutions for Chapter 7.2: OnetoOne and Onto, Inverse Functions
Full solutions for Discrete Mathematics with Applications  4th Edition
ISBN: 9780495391326
Solutions for Chapter 7.2: OnetoOne and Onto, Inverse Functions
Get Full SolutionsThis expansive textbook survival guide covers the following chapters and their solutions. This textbook survival guide was created for the textbook: Discrete Mathematics with Applications , edition: 4. Discrete Mathematics with Applications was written by and is associated to the ISBN: 9780495391326. Since 58 problems in chapter 7.2: OnetoOne and Onto, Inverse Functions have been answered, more than 43931 students have viewed full stepbystep solutions from this chapter. Chapter 7.2: OnetoOne and Onto, Inverse Functions includes 58 full stepbystep solutions.

Cholesky factorization
A = CTC = (L.J]))(L.J]))T for positive definite A.

Cyclic shift
S. Permutation with S21 = 1, S32 = 1, ... , finally SIn = 1. Its eigenvalues are the nth roots e2lrik/n of 1; eigenvectors are columns of the Fourier matrix F.

Determinant IAI = det(A).
Defined by det I = 1, sign reversal for row exchange, and linearity in each row. Then IAI = 0 when A is singular. Also IABI = IAIIBI and

Eigenvalue A and eigenvector x.
Ax = AX with x#O so det(A  AI) = o.

Elimination.
A sequence of row operations that reduces A to an upper triangular U or to the reduced form R = rref(A). Then A = LU with multipliers eO in L, or P A = L U with row exchanges in P, or E A = R with an invertible E.

Hermitian matrix A H = AT = A.
Complex analog a j i = aU of a symmetric matrix.

Hessenberg matrix H.
Triangular matrix with one extra nonzero adjacent diagonal.

Iterative method.
A sequence of steps intended to approach the desired solution.

lAII = l/lAI and IATI = IAI.
The big formula for det(A) has a sum of n! terms, the cofactor formula uses determinants of size n  1, volume of box = I det( A) I.

Left inverse A+.
If A has full column rank n, then A+ = (AT A)I AT has A+ A = In.

Length II x II.
Square root of x T x (Pythagoras in n dimensions).

Linearly dependent VI, ... , Vn.
A combination other than all Ci = 0 gives L Ci Vi = O.

Nullspace N (A)
= All solutions to Ax = O. Dimension n  r = (# columns)  rank.

Orthonormal vectors q 1 , ... , q n·
Dot products are q T q j = 0 if i =1= j and q T q i = 1. The matrix Q with these orthonormal columns has Q T Q = I. If m = n then Q T = Q 1 and q 1 ' ... , q n is an orthonormal basis for Rn : every v = L (v T q j )q j •

Positive definite matrix A.
Symmetric matrix with positive eigenvalues and positive pivots. Definition: x T Ax > 0 unless x = O. Then A = LDLT with diag(D» O.

Simplex method for linear programming.
The minimum cost vector x * is found by moving from comer to lower cost comer along the edges of the feasible set (where the constraints Ax = b and x > 0 are satisfied). Minimum cost at a comer!

Spanning set.
Combinations of VI, ... ,Vm fill the space. The columns of A span C (A)!

Stiffness matrix
If x gives the movements of the nodes, K x gives the internal forces. K = ATe A where C has spring constants from Hooke's Law and Ax = stretching.

Symmetric factorizations A = LDLT and A = QAQT.
Signs in A = signs in D.

Unitary matrix UH = U T = UI.
Orthonormal columns (complex analog of Q).