Finding a Basis for the Kernel Space of a Matrix - Solving the RREF Method

Click For Summary

Homework Help Overview

The discussion revolves around finding a basis for the kernel space of a given matrix using the row-reduced echelon form (RREF). Participants are exploring the relationship between the kernel space and the row space of the matrix.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster attempts to understand how to derive the basis for the kernel space from the RREF of the matrix. Some participants discuss the orthogonality of the kernel space to the row space and provide interpretations of the equations derived from the RREF.

Discussion Status

Participants are actively engaging with the problem, with some providing clarifications and interpretations that help in understanding the relationship between the kernel and row spaces. The original poster expresses gratitude for the insights received, indicating a productive exchange.

Contextual Notes

There is an emphasis on interpreting the equations from the RREF and understanding the implications for the kernel space. The discussion also touches on the orthogonality concept, which may require further exploration for complete clarity.

theRukus
Messages
49
Reaction score
0

Homework Statement


Find a basis for the kernel space of the following matrix:
-1 -2 -1 2 2
-2 -4 -4 10 2
1 2 2 -5 2
-1 -2 0 -1 0

row reduce to

1 2 0 1 0
0 0 1 -3 0
0 0 0 0 1
0 0 0 0 0


Somehow read the solution as

{ [-2 1 0 0 0]T, [-1 0 3 1 0]T }

.. I don't understand how to read the basis from the RREF. Could someone shed some light for me? Thanks so much!
 
Physics news on Phys.org
The basis for the null space is orthogonal to each vector in the rowspace and so to each vector in the rowspace of the rref form
 
In more "simple-minded" terms, you can think of your row reduced matrix as referring to
\begin{bmatrix}1 & 2 & 0 & 1 & 0 \\ 0 & 0 & 1 & -3 & 0 \\ 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0\end{bmatrix}\begin{bmatrix}x_1 \\ x_2 \\ x_3 \\ x_4 \\ x_5 \\ x_6\end{bmatrix}= \begin{bmatrix}0 \\ 0 \\ 0 \\ 0\end{bmatrix}

or simply the equations x_2+ 2x_2+ 0x_3+ x_4+ 0x_5= 0, 0x_1+ 0x_2+ x_3- 3x_4+ 0x_5= 0, 0x_1+ 0x_2+ 0x_3+ 0x_4+ x_5= 0, 0x_1+ 0x_2+ 0x_3+ 0x_4+ 0x_5= 0.

If you interpret each of those equations as a "dot product" you can see how the vectors in the kernel must be "orthogonal" to the rows of the reduced matrix. Of course, you can also see, from the third equation that x_5 must be 0, from the second that x_3- 3x_4= 0 so that x_3= 3x_4, and from the first equation that x_1+ 2x_2+ x_4= 0 so that x_1= -2x_2- x_4. That is, we can write
\begin{bmatrix}x_1 \\ x_2 \\ x_3 \\ x_4 \\ x_5\end{bmatrix}= \begin{bmatrix}-2x_2- x_4 \\ x_2 \\ 3x_4 \\ x_4 \\ 0\end{bmatrix}
= \begin{bmatrix}-2x_2 \\ x_2 \\ 0 \\ 0 \\ 0\end{bmatrix}+ \begin{bmatrix}-x_4 \\ 0 \\ 3x_4 \\ x_4 \\ 0\end{bmatrix}
= x_2\begin{bmatrix}- 2 \\ 1 \\ 0 \\ 0 \\ 0 \end{bmatrix}+ x_4\begin{bmatrix}-1 \\ 0 \\ 3 \\ 1 \\ 0 \end{bmatrix}
 
Thanks heaps hallsofivy, that cleared things up for me. Wish me luck on my exam!
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K