Science:Math Exam Resources/Courses/MATH152/April 2016/Question A 27

MATH152 April 2016

Work in progress: this question page is incomplete, there might be mistakes in the material you are seeing here.

  •  QA 1  •  QA 2  •  QA 3  •  QA 4  •  QA 5  •  QA 6  •  QA 7  •  QA 8  •  QA 9  •  QA 10  •  QA 11  •  QA 12  •  QA 13  •  QA 14  •  QA 15  •  QA 16  •  QA 17  •  QA 18  •  QA 19  •  QA 20  •  QA 21  •  QA 22  •  QA 23  •  QA 24  •  QA 25  •  QA 26  •  QA 27  •  QA 28  •  QA 29  •  QA 30  •  QB 1(a)  •  QB 1(b)  •  QB 1(c)  •  QB 1(d)  •  QB 2(a)  •  QB 2(b)  •  QB 2(c)  •  QB 2(d)  •  QB 3(a)  •  QB 3(b)  •  QB 3(c)  •  QB 4(a)  •  QB 4(b)  •  QB 4(c)  •  QB 4(d)  •  QB 5(a)  •  QB 5(b)  •  QB 5(c)  •  QB 5(d)  •  QB 6(a)  •  QB 6(b)  •  QB 6(c)  •  

   Other MATH152 Exams

  •  April 2016  •  April 2015  •  April 2014  •  April 2022  •  April 2011  •  April 2010  •  April 2012  •  April 2013  •  April 2017  •  

Question A 27
The set of solutions of the homogeneous system $A{\textbf {x}}={\textbf {0}}$ can be written in parametric form ${\textbf {x}}=[0,1,0,1]t+[7,0,1,0]s.$ If $A$ is a $3\times 4$ matrix, what is the reduced row echelon form of $A$?

Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you?

If you are stuck, check the hints below. Read the first one and consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it! If after a while you are still stuck, go for the next hint.

Hint 1
Number of variables in the parametric form tells us the number of pivot columns we have for the row reduced echelon form.

Hint 2
Uniqueness of row reduced echelon form.

Checking a solution serves two purposes: helping you if, after having used all the hints, you still are stuck on the problem; or if you have solved the problem and would like to check your work. If you are stuck on a problem: Read the solution slowly and as soon as you feel you could finish the problem on your own, hide it and work on the problem. Come back later to the solution if you are stuck or if you want to check your work. If you want to check your work: Don't only focus on the answer, problems are mostly marked for the work you do, make sure you understand all the steps that were required to complete the problem and see if you made mistakes or forgot some aspects. Your goal is to check that your mental process was correct, not only the result.

Solution 1

Found a typo? Is this solution unclear? Let us know here. Please rate my easiness! It's quick and helps everyone guide their studies. The null space of A is spanned by $[0,1,0,1]^{T},[7,0,1,0]^{T}$ By Rank–nullity theorem, the rank of A is 2. In the other words, the dimension of space spanned by column vectors are 2. The row reduced echelon form of a matrix is unique. There are two pivot columns. The range of A is the span of column space. From the kernels, we know the third column are seven multiples of the first column, and the fourth column are -1 multiple of the second column of A. Thus, the row reduced echelon form is ${\begin{bmatrix}1&0&-7&0\\0&1&0&-1\\0&0&0&0\\\end{bmatrix}}$

Solution 2

Found a typo? Is this solution unclear? Let us know here. Please rate my easiness! It's quick and helps everyone guide their studies. Since the solution is $x=[0,1,0,1]^{T}s+[7,0,1,0]^{T}t$, we can rewrite it as $x={\begin{bmatrix}7t\\s\\t\\s\end{bmatrix}}={\begin{bmatrix}7x_{3}\\x_{2}\\x_{3}\\x_{2}\end{bmatrix}}$ by changing variables. It means that when we transform the reduced echelon form to equations, we already have $x_{1}=7x_{3},\ \ \ \ x_{4}=x_{2}$ Or equivalently $x_{1}-7x_{3}=0,\ \ \ \ x_{2}-x_{4}=0$ So the echelon form is easily seen to be $\color {blue}{\begin{bmatrix}1&0&-7&0\\0&1&0&-1\\0&0&0&0\\\end{bmatrix}}$ Since when we transform following matrix system to equations, we can attain above equations we want: ${\begin{bmatrix}1&0&-7&0\\0&1&0&-1\\0&0&0&0\\\end{bmatrix}}\cdot {\begin{bmatrix}x_{1}\\x_{2}\\x_{3}\\x_{4}\end{bmatrix}}={\begin{bmatrix}0\\0\\0\\0\end{bmatrix}}$

Click here for similar questions

MER QBS flag, MER QGH flag, MER QGQ flag, MER QGT flag, MER Tag Rank and nullity, Pages using DynamicPageList3 parser function, Pages using DynamicPageList3 parser tag