Practice Test 1 — Chapter 1

100 points · 5 extra credit

Practice Test 1 — Linear Equations in Linear Algebra (Chapter 1)

Practice for Test 1 · 100 points core + 5 points extra credit · time 90 minutes. No calculator. Show all reasoning; partial credit is given. Justify every "yes/no" answer with a theorem, a computation, or a counterexample.


Worked solutions are available for every problem.
  1. 1. Row Reduction (12 points). Consider the system

    x1−3x2+2x3−x4=23x1−9x2+7x3−x4=8−2x1+6x2−3x3+4x4=−2\begin{aligned} x_1 - 3x_2 + 2x_3 - x_4 &= 2 \\ 3x_1 - 9x_2 + 7x_3 - x_4 &= 8 \\ -2x_1 + 6x_2 - 3x_3 + 4x_4 &= -2 \end{aligned}

    (a) (6 pts) Write the augmented matrix and row reduce it to reduced echelon form.

    (b) (2 pts) Identify the pivot columns, the basic variables, and the free variables.

    (c) (4 pts) Write the general solution, solving for the basic variables in terms of the free variables.

    #
  2. 2. Existence & Uniqueness (8 points). Consider the system

    x1−x2+2x3=33x1−2x2+5x3=72x1+x2+hx3=k\begin{aligned} x_1 - x_2 + 2x_3 &= 3 \\ 3x_1 - 2x_2 + 5x_3 &= 7 \\ 2x_1 + x_2 + hx_3 &= k \end{aligned}

    Find all values of hh and kk for which the system has

    (a) (3 pts) a unique solution;

    (b) (3 pts) no solution;

    (c) (2 pts) infinitely many solutions.

    #
  3. 3. Span (10 points). Let a1=[1−23]\mathbf a_1=\begin{bmatrix}1\\-2\\3\end{bmatrix}, a2=[3−57]\mathbf a_2=\begin{bmatrix}3\\-5\\7\end{bmatrix}, a3=[−14−7]\mathbf a_3=\begin{bmatrix}-1\\4\\-7\end{bmatrix}, and let A=[ a1 a2 a3 ]A=[\,\mathbf a_1\ \mathbf a_2\ \mathbf a_3\,].

    (a) (5 pts) Find the condition on b1,b2,b3b_1,b_2,b_3 for b=[b1b2b3]\mathbf b=\begin{bmatrix}b_1\\b_2\\b_3\end{bmatrix} to lie in Span⁡{a1,a2,a3}\operatorname{Span}\{\mathbf a_1,\mathbf a_2,\mathbf a_3\}.

    (b) (3 pts) Is b=[2−34]\mathbf b=\begin{bmatrix}2\\-3\\4\end{bmatrix} in Span⁡{a1,a2,a3}\operatorname{Span}\{\mathbf a_1,\mathbf a_2,\mathbf a_3\}? If so, write b\mathbf b as a linear combination of a1,a2,a3\mathbf a_1,\mathbf a_2,\mathbf a_3.

    (c) (2 pts) Do the columns of AA span R3\mathbb R^3? Justify.

    #
  4. 4. Solution Sets (12 points). Let A=[1−2123−649−24−1−1]A=\begin{bmatrix}1&-2&1&2\\3&-6&4&9\\-2&4&-1&-1\end{bmatrix} and b=[150]\mathbf b=\begin{bmatrix}1\\5\\0\end{bmatrix}.

    (a) (5 pts) Write the solution set of Ax=0A\mathbf x=\mathbf 0 in parametric vector form.

    (b) (5 pts) Write the solution set of Ax=bA\mathbf x=\mathbf b in parametric vector form.

    (c) (2 pts) Describe both solution sets geometrically and say how they are related.

    #
  5. 5. Linear Independence (10 points). Let v1=[12−1]\mathbf v_1=\begin{bmatrix}1\\2\\-1\end{bmatrix}, v2=[37−2]\mathbf v_2=\begin{bmatrix}3\\7\\-2\end{bmatrix}, v3=[−1h4]\mathbf v_3=\begin{bmatrix}-1\\h\\4\end{bmatrix}.

    (a) (5 pts) Find all values of hh for which {v1,v2,v3}\{\mathbf v_1,\mathbf v_2,\mathbf v_3\} is linearly dependent.

    (b) (5 pts) For that value of hh, find a linear dependence relation among v1,v2,v3\mathbf v_1,\mathbf v_2,\mathbf v_3 with integer weights.

    #
  6. 6. Balancing a Chemical Equation (6 points). Ethane burns in oxygen:

    x1 C2H6+x2 O2  →  x3 CO2+x4 H2Ox_1\,\mathrm{C_2H_6} + x_2\,\mathrm{O_2} \;\to\; x_3\,\mathrm{CO_2} + x_4\,\mathrm{H_2O}

    Set up the vector equation (one vector per molecule, counting C, H, O), solve the resulting homogeneous system, and give the balanced equation with the smallest positive whole-number coefficients.

    #
  7. 7. The Matrix of a Linear Transformation (12 points).

    (a) (5 pts) Let T:R2→R2T:\mathbb R^2\to\mathbb R^2 first rotate points clockwise through π/2\pi/2 radians and then reflect them through the line x2=x1x_2=x_1. Find the standard matrix of TT.

    (b) (2 pts) TT is a single familiar geometric transformation. Which one?

    (c) (5 pts) Let S:R2→R3S:\mathbb R^2\to\mathbb R^3 be a linear transformation with S ⁣([12])=[305]S\!\left(\begin{bmatrix}1\\2\end{bmatrix}\right)=\begin{bmatrix}3\\0\\5\end{bmatrix} and S ⁣([01])=[1−12]S\!\left(\begin{bmatrix}0\\1\end{bmatrix}\right)=\begin{bmatrix}1\\-1\\2\end{bmatrix}. Find the standard matrix of SS.

    #
  8. 8. One-to-One & Onto (10 points). Let T:R3→R4T:\mathbb R^3\to\mathbb R^4 be defined by

    T(x1,x2,x3)=(x1+2x2,    −x1+x2+3x3,    2x1+x2−2x3,    3x2+4x3).T(x_1,x_2,x_3)=(x_1+2x_2,\;\;-x_1+x_2+3x_3,\;\;2x_1+x_2-2x_3,\;\;3x_2+4x_3).

    (a) (2 pts) Find the standard matrix AA of TT.

    (b) (4 pts) Is TT one-to-one? Justify.

    (c) (4 pts) Does TT map R3\mathbb R^3 onto R4\mathbb R^4? Justify.

    #
  9. 9. True or False (12 points, 2 each). State whether each statement is true or false, and justify: cite a theorem or definition if true, give a counterexample if false.

    (a) If an augmented matrix has a pivot in every row, then the system it represents is consistent.

    (b) If AA is a 3×33\times3 matrix and Ax=0A\mathbf x=\mathbf 0 has only the trivial solution, then the columns of AA span R3\mathbb R^3.

    (c) If AA is a 4×34\times3 matrix, then Ax=bA\mathbf x=\mathbf b has a solution for every b\mathbf b in R4\mathbb R^4.

    (d) The solution set of Ax=bA\mathbf x=\mathbf b is always a translate of the solution set of Ax=0A\mathbf x=\mathbf 0.

    (e) If TT is linear and T(u)=T(v)T(\mathbf u)=T(\mathbf v) for some u≠v\mathbf u\neq\mathbf v, then TT is not one-to-one.

    (f) Any set of vectors in Rn\mathbb R^n that contains the zero vector is linearly dependent.

    #
  10. 10. Proofs (8 points).

    (a) (4 pts) Let AA be an m×nm\times n matrix. Prove that if p\mathbf p and q\mathbf q are both solutions of Ax=bA\mathbf x=\mathbf b, then p−q\mathbf p-\mathbf q is a solution of Ax=0A\mathbf x=\mathbf 0.

    (b) (4 pts) Let T:Rn→RmT:\mathbb R^n\to\mathbb R^m be a one-to-one linear transformation. Prove that if {v1,v2,v3}\{\mathbf v_1,\mathbf v_2,\mathbf v_3\} is linearly independent, then {T(v1),T(v2),T(v3)}\{T(\mathbf v_1),T(\mathbf v_2),T(\mathbf v_3)\} is linearly independent.

    #
  11. Extra Credit (5 points ••)

    Let AA be an m×nm\times n matrix. Prove that if Ax=bA\mathbf x=\mathbf b has exactly one solution for some b\mathbf b, then Ax=cA\mathbf x=\mathbf c has at most one solution for every c\mathbf c in Rm\mathbb R^m.

    #