A homogeneous equation is always consistent. TRUE The trivial solution is always a solution.

. The equation Ax = 0 gives an explicit descriptions of it solution set. FALSE - The equation gives an implicit description of the solution set. The homogeneous equation Ax = 0 has the trivial solution if and only if the equation has at least one free variable. FALSE - The trivial solution is always a solution to the equation Ax = 0. The equation x = p + tv describes a line through v parallel top. False. The line goes through p and is parallel to v. The solution set of Ax = b is the set of all vectors of the form w = p + vh where vh is any solution of the equation Ax = 0 FALSE This is only true when there exists some vector p such that Ap = b. If x is a nontrivial solution of Ax = 0, then every entry in x is nonzero. FALSE. At least one entry in x is nonzero. The equation x = x2u + x3v, with x2 and x3 free (and neither u or v a multiple of the other), describes a plane through the origin. TRUE The equation Ax = b is homogeneous if the zero vector is a solution. TRUE. If the zero vector is a solution then b = Ax = A0 = 0. So the equation is Ax = 0, thus homogenous. The effect of adding p to a vector is to move the vector in the direction parallel to p. TRUE. We can also think of adding p as sliding the vector along p. The solution set of Ax = b is obtained by translating the solution set of Ax = 0. FALSE. This only applies to a consistent system. The columns of the matrix A are linearly independent if the equation Ax = 0 has the trivial solution. FALSE. The trivial solution is always a solution. If S is a linearly dependent set, then each vector is a linear combination of the other vectors in S. FALSE- For example,[1; 1] , [2; 2] and [5; 4] are linearly dependent but the last is not a linear combination of the first two. The columns of any 4 x 5 matrix are linearly dependent. TRUE. There are five columns each with four entries, thus by Thm 8 they are linearly dependent. If x and y are linearly independent, and if fx; y; zg is linearly dependent, then z is in Spanfx; yg. TRUE Since x and y are linearly independent, and fx; y; zg is linearly dependent, it must be that z can be written as a linear combination of the other two, thus in in their span. Two vectors are linearly dependent if and only if they lie on a line through the origin. TRUE. If they lie on a line through the origin then the origin, the zero vector, is in their span thus they are linearly dependent. If a set contains fewer vectors then there are entries in the vectors, then the set is linearly independent. FALSE For example, [1; 2; 3] and [2; 4; 6] are linearly dependent. If x and y are linearly independent, and if z is in the Span(x; y) then (x; y; z) is linearly dependent. TRUE If z is in the Span(x; y) then z is a linear combination of the other two, which can be rearranged to show linear dependence. If a set in Rn is linearly dependent, then the set contains more vectors than there are entries in each vector. False. For example, in R3 [1; 2; 3] and [3; 6; 9] are linearly dependent. A linear transformation is a special type of function. TRUE The properties are (i) T(u + v) = T(u) + T(v) and (ii) T(cu) = cT(u). If A is a 3 x 5 matrix and T is a transformation defined by T(x) = Ax, then the domain of T is R3. FALSE The domain is R5. If A is an m x n matrix, then the range of the transformation x |-> Ax is Rm FALSE Rm is the codomain, the range is where we actually land. Every linear transformation is a matrix transformation. FALSE. The converse (every matrix transformation is a linear transformation) is true, however. A linear transformation T : Rn -> Rm is completely determined by its effect on columns of the n x n identity matrix. TRUE The columns on the identity matrix are the basis vectors in Rn. Since every vector can be written as a linear combination of these, and T is a linear transformation, if we know where these columns go, we know everything. If T : R2 -> R2 rotates vectors about the origin through an angle -, then T is a linear transformation. TRUE. To show this we would show the properties of linear transformations are preserved under rotations. When two linear transformations are performed one after another, then combined effect may not always be a linear transformation. FALSE Again, check properties to show it is a linear transformation. A mapping T : Rn -> Rm is onto Rm if every vector x in Rn maps onto some vector in Rm. FALSE A linear transformation is onto is the codomain is equal to the range. If A is a 3 x 2 matrix, the the transformation x -> Ax cannot be one-to-one. FALSE Since the transformation maps from R2 to R3 and 2 < 3 it can be one-to-one but not onto. Not every linear transformation from Rn to Rm is a matrix transformation. FALSE For a linear transformation from Rn to Rm we se where the basis vector in Rn get mapped to. These form the standard matrix. The columns of the standard matrix for a linear transformation from Rn to Rm are the images of the columns of the n x n identity matrix. TRUE The standard matrix of a linear transformation from R2 to R2 that reflects points through the horizontal axis, the vertical axis, or the orign has the form(a o, o d), where a and d are plus or minus 1 TRUE We can check this by checking the images of the basis vectors. A mapping T : Rn ! Rm is one-to-one if each vector in Rn maps onto a unique vector in Rm. FALSE A mapping is one-to-one if each vectors in Rm is mapped to from a unique vector in Rn. If A is a 3 x 2 matrix, then the transformation x ! Ax cannot map R2 onto R3 TRUE You can not map a space of lower dimension ONTO a space of higher dimension.