The equation Ax = 0 gives an explicit descriptions of its solution set.
answer
FALSE - The equation gives an implicit description of the solution set
question
The homogeneous equation Ax = 0 has the trivial solution if and only if the equation has at least one free variable.
answer
FALSE - The trivial solution is always a solution to the equation
Ax = 0.
question
The equation x=p+tv describes a line through v parallel to p.
answer
False. The line goes through p and is parallel to v
question
The solution set of Ax = b is the set of all vectors of the form w=p+vh wherevh isanysolutionoftheequationAx=0
answer
FALSE This is only true when there exists some vector p such that Ap = b.
question
If x is a nontrivial solution of Ax = 0, then every entry in x is nonzero.
answer
FALSE. At least one entry in x is nonzero.
question
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
answer
TRUE
question
The equation Ax = b is homogeneous if the zero vector is a solution.
answer
TRUE. If the zero vector is a solution then b=Ax=A0=0. So the equation is Ax=0, thus homogenous.
question
The effect of adding p to a vector is to move the vector in the direction parallel to p
answer
TRUE. We can also think of adding p as sliding the vector along p.
question
The solution set of Ax = b is obtained by translating the solution set of Ax = 0.
answer
FALSE. This only applies to a consistent system.
question
The columns of the matrix A are linearly independent if the equation Ax = 0 has the trivial solution.
answer
FALSE. The trivial solution is always a solution.
question
If S is a linearly dependent set, then each vector is a linear combination of the other vectors in S
answer
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.
question
The columns of any 4 × 5 matrix are linearly dependent.
answer
TRUE. There are five columns each with four entries, thus by Thm 8 they are linearly dependent.
question
If x and y are linearly independent, and if {x,y,z} is linearly dependent, then z is in Span{x, y}.
answer
TRUE Since x and y are linearly independent, and {x, y, z} is linearly dependent, it must be that z can be written as a linear combination of the other two, thus in in their span.
question
Two vectors are linearly dependent if and only if they lie on a line through the origin.
answer
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.
question
If a set contains fewer vectors then there are entries in the vectors, then the set is linearly independent.
answer
FALSE For example, [1, 2, 3] and [2, 4, 6] are linearly dependent
question
If x and y are linearly independent, and if z is in the Span{x, y} then {x, y, z} is linearly dependent.
answer
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.
question
If a set in Rn is linearly dependent, then the set contains more vectors than there are entries in each vector
answer
False. For example, in R3 [1, 2, 3] and [3, 6, 9] are linearly dependent.
question
A linear transformation is a special type of function.
answer
TRUE The properties are (i) T(u + v) = T(u) + T(v) and (ii) T(cu) = cT(u).
question
If A is a 3×5 matrix and T is a transformation defined by T(x) = Ax, then the domain of T is R3.
answer
FALSE The domain is R5.
question
If A is an m × n matrix, then the range of the transformation x → Ax is Rm
answer
FALSE Rm is the codomain, the range is where we actually land.
question
Every linear transformation is a matrix transformation.
answer
FALSE. The converse (every matrix transformation is a linear transformation) is true, however. We (probably) will see examples of when the original statement is false later.
question
A transformation T is linear if and only if
T(c1v1 + c2v2) = c1T(v1) + c2T(v2) for all v1 and v2 in the domain of T and for all scalars c1 and c2.
answer
TRUE If we take the definition of linear transformation we can derive these and if these are true then they are true for c1, c2 = 1 so the first part of the definition is true, and if v = 0, then the second part if true.
question
Every matrix transformation is a linear transformation
answer
TRUE To actually show this, we would have to show all matrix transformations satisfy the two criterion of linear transformations.
question
The codomain of the transformation x → Ax is the set of all linear combinations of the columns of A.
answer
FALSE The If A is m × n codomain is Rm. The original statement in describing the range.
question
IfT :Rn →Rm isalineartransformationandifcisinRm, then a uniqueness question is "Is c is the range of T."
answer
FALSE this is an existence question
question
A linear transformation preserves the operations of vector addition and scalar multiplication.
answer
TRUE This is part of the definition of a linear transformation.
question
The superposition principle is a physical description of a linear transformation.
answer
TRUE
question
A linear transformation T : Rn → Rm is completely determined by its effect on columns of the n × n identity matrix.
answer
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.
question
If T : R2 → R2 rotates vectors about the origin through an angle φ, then T is a linear transformation.
answer
TRUE. To show this we would show the properties of linear transformations are preserved under rotations.
question
When two linear transformations are performed one after another, then combined effect may not always be a linear transformation.
answer
FALSE Again, check properties to show it is a linear transformation.
question
A mapping T :Rn →Rm is onto Rm if every vector x in Rn maps onto some vector in Rm.
answer
FALSE A linear transformation is onto is the codomain is equal to the range.
question
IfAisa3×2matrix,thethetransformationx→Axcannot be one-to-one.
answer
FALSE Since the transformation maps from R2 to R3 and 2 < 3 it can be one-to-one but not onto.
question
Not every linear transformation from Rn to Rm is a matrix transformation.
answer
FALSE For a linear transformation from Rn to Rmwe se where the basis vector in Rn get mapped to. These form the standard matrix.
question
The columns of the standard matrix for a linear transformation from Rn to Rm are the images of the columns of the n × n identity matrix.
answer
TRUE
question
The standard matrix of a linear transformation from R2 to R2 that reflects points through the horizontal axis, the vertical
a 0 axis,ortheorignhastheform 0 d ,whereaandd are
±1
answer
TRUE We can check this by checking the images of the basis vectors.
question
A mapping T : Rn → Rm is one-to-one if each vector in Rn maps onto a unique vector in Rm.
answer
FALSE A mapping is one-to-one if each vectors in Rm is mapped to from a unique vector in Rn.
TRUE You can not map a space of lower dimension ONTO a space of higher dimension
question
Every elementary row operation is reversible.
answer
TRUE You can reverse multiplying by a constant by multiplying by its inverse. If you add row one to row two and replace row two, then you can subtract row one from row two to get it back.
question
A 5×6 matrix has six rows
answer
FALSE 5 rows and 6 columns
question
The solution set of a linear system involving variables x1,...,xn is a list of numbers (s1,...sn) that makes each equation in the system a true statement when the values s1, ..., sn are substituted for x1, ..., xn, respectively.
answer
FALSE This describes one element of the solution set, not the entire set
question
Two fundamental questions about a linear system involve existence and uniqueness
answer
True pg. 7
question
Elementary row operations on an augmented matrix never change the solution set of the associated linear system.
answer
TRUE because they can be changed back to original matrix
question
Two matrices are row equivalent if they have the same number of rows.
answer
FALSE They are row equivalent if you can get from one to the other using elementary row operations.
question
An inconsistent system has more than one solution
answer
FALSE Inconsistent system has no solutions!
question
Two linear systems are equivalent if they have the same solution set
answer
TRUE If they have the same solution set, they both reduce to the same matrix in reduced row echelon form, since row operations are reversible, we can then reverse one set of these to get from one matrix to the other by row operations, thus they are row equivalent.
question
In some cases a matrix may be row reduced to more than one matrix in reduced row echelon form, using different sequences of row operations
answer
FALSE Can only be reduced to one matrix (row reduced echelon form)
question
The row reduction algorithm applies only to augmented matrices for a linear system
answer
FALSE it can apply to coefficient Matrices
question
A basic variable in a linear system is a variable that corresponds to a pivot column in the coefficient matrix
answer
TRUE it is in the same place as the pivot position is
question
Finding a parametric description of the solution set of a linear system is the same as solving the system.
answer
TRUE you need to solve the system in order to find parametric description of solution set
question
If one row in an echelon form of an augmented matrix is
[0 0 0 5 0 ], then the associated linear system is inconsistent.
answer
FALSE this is only true for the trivial solution
question
The echelon form of a matrix is unique
answer
FALSE unique means it only has 1 solution
question
The pivot positions in a matrix depend on whether row
interchanges are used in the row reduction process
answer
FALSE it does not matter on the row interchanges, it only matters on row reduced echelon form
question
Reducing a matrix to echelon form is called the forward phase of the row reduction process.
answer
TRUE definition part of echelon form
question
Whenever a system has free variables, the solution set contains many solutions
answer
TRUE the solution set does contain many solutions because the free variable can be anything
question
A general solution of a system is an explicit description of all solutions of the system
answer
TRUE it tells the solutions
question
The equation Ax = b is referred to as the vector equation
answer
FALSE
question
The vector b is a linear combination of the columns of a matrix A if and only if the equation Ax = b has at least one solution
answer
TRUE
question
The equation Ax = b is consistent if the augmented matrix [A b] has a pivot position in every row
answer
FALSE
question
The first entry in the product Ax is a sum of products.
answer
TRUE
question
If the columns of an m×n matrix span Rm, then the equation
Ax = b is consistent for each b in Rm
answer
TRUE
question
If A is an m×n matrix and if the equation Ax=b is inconsistent for some b in Rm, then A cannot have a pivot position in every row.
answer
TRUE
Haven't found what you need?
Search for quizzes and test answers now
Quizzes.studymoose.com uses cookies. By continuing you agree to our cookie policy
