Examples

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 4045678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 4 \\ 0 \\ 4 \\ 5 \\ 6 \\ 7 \\ 8 \end{array}]$

Step 1

Nullity is the dimension of the null space, which is the same as the number of free variables in the system after row reducing. The free variables are the columns without pivot positions.

Step 2

Find the reduced row echelon form.

Tap for more steps...

Step 2.1

Multiply each element of

R_{1}

$R_{1}$ by

\frac{1}{4}

$\frac{1}{4}$ to make the entry at

1, 1

$1, 1$ a

1

$1$ .

Tap for more steps...

Step 2.1.1

Multiply each element of

R_{1}

$R_{1}$ by

\frac{1}{4}

$\frac{1}{4}$ to make the entry at

1, 1

$1, 1$ a

1

$1$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} \frac{4}{4} 045678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} \frac{4}{4} \\ 0 \\ 4 \\ 5 \\ 6 \\ 7 \\ 8 \end{array}]$

Step 2.1.2

Simplify

R_{1}

$R_{1}$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1045678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 4 \\ 5 \\ 6 \\ 7 \\ 8 \end{array}]$

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1045678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 4 \\ 5 \\ 6 \\ 7 \\ 8 \end{array}]$

Step 2.2

Perform the row operation

R_{3} = R_{3} - 4 R_{1}

$R_{3} = R_{3} - 4 R_{1}$ to make the entry at

3, 1

$3, 1$ a

0

$0$ .

Tap for more steps...

Step 2.2.1

Perform the row operation

R_{3} = R_{3} - 4 R_{1}

$R_{3} = R_{3} - 4 R_{1}$ to make the entry at

3, 1

$3, 1$ a

0

$0$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 10 4 - 4 \cdot 1 5678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 4 - 4 \cdot 1 \\ 5 \\ 6 \\ 7 \\ 8 \end{array}]$

Step 2.2.2

Simplify

R_{3}

$R_{3}$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1005678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 5 \\ 6 \\ 7 \\ 8 \end{array}]$

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1005678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 5 \\ 6 \\ 7 \\ 8 \end{array}]$

Step 2.3

Perform the row operation

R_{4} = R_{4} - 5 R_{1}

$R_{4} = R_{4} - 5 R_{1}$ to make the entry at

4, 1

$4, 1$ a

0

$0$ .

Tap for more steps...

Step 2.3.1

Perform the row operation

R_{4} = R_{4} - 5 R_{1}

$R_{4} = R_{4} - 5 R_{1}$ to make the entry at

4, 1

$4, 1$ a

0

$0$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 100 5 - 5 \cdot 1 678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 5 - 5 \cdot 1 \\ 6 \\ 7 \\ 8 \end{array}]$

Step 2.3.2

Simplify

R_{4}

$R_{4}$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 6 \\ 7 \\ 8 \end{array}]$

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000678 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 6 \\ 7 \\ 8 \end{array}]$

Step 2.4

Perform the row operation

R_{5} = R_{5} - 6 R_{1}

$R_{5} = R_{5} - 6 R_{1}$ to make the entry at

5, 1

$5, 1$ a

0

$0$ .

Tap for more steps...

Step 2.4.1

Perform the row operation

R_{5} = R_{5} - 6 R_{1}

$R_{5} = R_{5} - 6 R_{1}$ to make the entry at

5, 1

$5, 1$ a

0

$0$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000 6 - 6 \cdot 1 78 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 6 - 6 \cdot 1 \\ 7 \\ 8 \end{array}]$

Step 2.4.2

Simplify

R_{5}

$R_{5}$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000078 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 7 \\ 8 \end{array}]$

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000078 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 7 \\ 8 \end{array}]$

Step 2.5

Perform the row operation

R_{6} = R_{6} - 7 R_{1}

$R_{6} = R_{6} - 7 R_{1}$ to make the entry at

6, 1

$6, 1$ a

0

$0$ .

Tap for more steps...

Step 2.5.1

Perform the row operation

R_{6} = R_{6} - 7 R_{1}

$R_{6} = R_{6} - 7 R_{1}$ to make the entry at

6, 1

$6, 1$ a

0

$0$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 10000 7 - 7 \cdot 1 8 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 7 - 7 \cdot 1 \\ 8 \end{array}]$

Step 2.5.2

Simplify

R_{6}

$R_{6}$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000008 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 8 \end{array}]$

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000008 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 8 \end{array}]$

Step 2.6

Perform the row operation

R_{7} = R_{7} - 8 R_{1}

$R_{7} = R_{7} - 8 R_{1}$ to make the entry at

7, 1

$7, 1$ a

0

$0$ .

Tap for more steps...

Step 2.6.1

Perform the row operation

R_{7} = R_{7} - 8 R_{1}

$R_{7} = R_{7} - 8 R_{1}$ to make the entry at

7, 1

$7, 1$ a

0

$0$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 100000 8 - 8 \cdot 1 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 8 - 8 \cdot 1 \end{array}]$

Step 2.6.2

Simplify

R_{7}

$R_{7}$ .

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000000 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{array}]$

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000000 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{array}]$

⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣ \begin{matrix} 1000000 \end{matrix} ⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦

$[\begin{array}{c} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{array}]$

Step 3

The pivot positions are the locations with the leading

1

$1$ in each row. The pivot columns are the columns that have a pivot position.

Pivot Positions:

a_{11}

$a_{11}$

Pivot Columns:

1

$1$

Step 4

The nullity is the number of columns without a pivot position in the row reduced matrix.

0

$0$

Enter YOUR Problem