Linear Algebra Examples

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 1 & 1 & 0 1 & 1 & 1 \end{matrix} ⎤ ⎥ ⎦ y = ⎡ ⎢ ⎣ \begin{matrix} 1 & 2 3 & 3 2 & 1 \end{matrix} ⎤ ⎥ ⎦

$[\begin{array}{c} 1 & 0 & 0 \\ 1 & 1 & 0 \\ 1 & 1 & 1 \end{array}] y = [\begin{array}{c} 1 & 2 \\ 3 & 3 \\ 2 & 1 \end{array}]$

Step 1

Find the inverse of

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 1 & 1 & 0 1 & 1 & 1 \end{matrix} ⎤ ⎥ ⎦

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

Tap for more steps...

Step 1.1

Rewrite.

∣ ∣ ∣ ∣ \begin{matrix} 1 & 0 & 0 1 & 1 & 0 1 & 1 & 1 \end{matrix} ∣ ∣ ∣ ∣

$| \begin{array}{c} 1 & 0 & 0 \\ 1 & 1 & 0 \\ 1 & 1 & 1 \end{array} |$

Step 1.2

Find the determinant.

Tap for more steps...

Step 1.2.1

Choose the row or column with the most

0

$0$ elements. If there are no

0

$0$ elements choose any row or column. Multiply every element in row

1

$1$ by its cofactor and add.

Tap for more steps...

Step 1.2.1.1

Consider the corresponding sign chart.

∣ ∣ ∣ ∣ \begin{matrix} + & - & + - & + & - + & - & + \end{matrix} ∣ ∣ ∣ ∣

$| \begin{array}{c} + & - & + \\ - & + & - \\ + & - & + \end{array} |$

Step 1.2.1.2

The cofactor is the minor with the sign changed if the indices match a

-

$-$ position on the sign chart.

Step 1.2.1.3

The minor for

a_{11}

$a_{11}$ is the determinant with row

1

$1$ and column

1

$1$ deleted.

∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣

$| \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} |$

Step 1.2.1.4

Multiply element

a_{11}

$a_{11}$ by its cofactor.

1 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣

$1 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} |$

Step 1.2.1.5

The minor for

a_{12}

$a_{12}$ is the determinant with row

1

$1$ and column

2

$2$ deleted.

∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣

$| \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} |$

Step 1.2.1.6

Multiply element

a_{12}

$a_{12}$ by its cofactor.

0 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣

$0 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} |$

Step 1.2.1.7

The minor for

a_{13}

$a_{13}$ is the determinant with row

1

$1$ and column

3

$3$ deleted.

∣ ∣ ∣ \begin{matrix} 1 & 1 1 & 1 \end{matrix} ∣ ∣ ∣

$| \begin{array}{c} 1 & 1 \\ 1 & 1 \end{array} |$

Step 1.2.1.8

Multiply element

a_{13}

$a_{13}$ by its cofactor.

0 ∣ ∣ ∣ \begin{matrix} 1 & 1 1 & 1 \end{matrix} ∣ ∣ ∣

$0 | \begin{array}{c} 1 & 1 \\ 1 & 1 \end{array} |$

Step 1.2.1.9

Add the terms together.

1 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣ + 0 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣ + 0 ∣ ∣ ∣ \begin{matrix} 1 & 1 1 & 1 \end{matrix} ∣ ∣ ∣

$1 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} | + 0 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} | + 0 | \begin{array}{c} 1 & 1 \\ 1 & 1 \end{array} |$

1 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣ + 0 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣ + 0 ∣ ∣ ∣ \begin{matrix} 1 & 1 1 & 1 \end{matrix} ∣ ∣ ∣

$1 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} | + 0 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} | + 0 | \begin{array}{c} 1 & 1 \\ 1 & 1 \end{array} |$

Step 1.2.2

Multiply

0

$0$ by

∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣

$| \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} |$ .

1 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣ + 0 + 0 ∣ ∣ ∣ \begin{matrix} 1 & 1 1 & 1 \end{matrix} ∣ ∣ ∣

$1 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} | + 0 + 0 | \begin{array}{c} 1 & 1 \\ 1 & 1 \end{array} |$

Step 1.2.3

Multiply

0

$0$ by

∣ ∣ ∣ \begin{matrix} 1 & 1 1 & 1 \end{matrix} ∣ ∣ ∣

$| \begin{array}{c} 1 & 1 \\ 1 & 1 \end{array} |$ .

1 ∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣ + 0 + 0

$1 | \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} | + 0 + 0$

Step 1.2.4

Evaluate

∣ ∣ ∣ \begin{matrix} 1 & 0 1 & 1 \end{matrix} ∣ ∣ ∣

$| \begin{array}{c} 1 & 0 \\ 1 & 1 \end{array} |$ .

Tap for more steps...

Step 1.2.4.1

The determinant of a

2 \times 2

$2 \times 2$ matrix can be found using the formula

∣ ∣ ∣ \begin{matrix} a & b c & d \end{matrix} ∣ ∣ ∣ = a d - c b

$| \begin{array}{c} a & b \\ c & d \end{array} | = a d - c b$ .

1 (1 \cdot 1 - 1 \cdot 0) + 0 + 0

$1 (1 \cdot 1 - 1 \cdot 0) + 0 + 0$

Step 1.2.4.2

Simplify the determinant.

Tap for more steps...

Step 1.2.4.2.1

Multiply

1

$1$ by

1

$1$ .

1 (1 - 1 \cdot 0) + 0 + 0

$1 (1 - 1 \cdot 0) + 0 + 0$

Step 1.2.4.2.2

Subtract

0

$0$ from

1

$1$ .

1 \cdot 1 + 0 + 0

$1 \cdot 1 + 0 + 0$

1 \cdot 1 + 0 + 0

$1 \cdot 1 + 0 + 0$

1 \cdot 1 + 0 + 0

$1 \cdot 1 + 0 + 0$

Step 1.2.5

Simplify the determinant.

Tap for more steps...

Step 1.2.5.1

Multiply

1

$1$ by

1

$1$ .

1 + 0 + 0

$1 + 0 + 0$

Step 1.2.5.2

Add

1

$1$ and

0

$0$ .

1 + 0

$1 + 0$

Step 1.2.5.3

Add

1

$1$ and

0

$0$ .

1

$1$

1

$1$

1

$1$

Step 1.3

Since the determinant is non-zero, the inverse exists.

Step 1.4

Set up a

3 \times 6

$3 \times 6$ matrix where the left half is the original matrix and the right half is its identity matrix.

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 1 & 1 & 0 & 0 & 1 & 0 1 & 1 & 1 & 0 & 0 & 1 \end{matrix} ⎤ ⎥ ⎦

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

Step 1.5

Find the reduced row echelon form.

Tap for more steps...

Step 1.5.1

Perform the row operation

R_{2} = R_{2} - R_{1}

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

2, 1

$2, 1$ a

0

$0$ .

Tap for more steps...

Step 1.5.1.1

Perform the row operation

R_{2} = R_{2} - R_{1}

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

2, 1

$2, 1$ a

0

$0$ .

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 1 - 1 & 1 - 0 & 0 - 0 & 0 - 1 & 1 - 0 & 0 - 0 1 & 1 & 1 & 0 & 0 & 1 \end{matrix} ⎤ ⎥ ⎦

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

Step 1.5.1.2

Simplify

R_{2}

$R_{2}$ .

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 0 & 1 & 0 & - 1 & 1 & 0 1 & 1 & 1 & 0 & 0 & 1 \end{matrix} ⎤ ⎥ ⎦

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

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 0 & 1 & 0 & - 1 & 1 & 0 1 & 1 & 1 & 0 & 0 & 1 \end{matrix} ⎤ ⎥ ⎦

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

Step 1.5.2

Perform the row operation

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

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

3, 1

$3, 1$ a

0

$0$ .

Tap for more steps...

Step 1.5.2.1

Perform the row operation

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

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

3, 1

$3, 1$ a

0

$0$ .

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 0 & 1 & 0 & - 1 & 1 & 0 1 - 1 & 1 - 0 & 1 - 0 & 0 - 1 & 0 - 0 & 1 - 0 \end{matrix} ⎤ ⎥ ⎦

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

Step 1.5.2.2

Simplify

R_{3}

$R_{3}$ .

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 0 & 1 & 0 & - 1 & 1 & 0 0 & 1 & 1 & - 1 & 0 & 1 \end{matrix} ⎤ ⎥ ⎦

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

⎡ ⎢ ⎣ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 0 & 1 & 0 & - 1 & 1 & 0 0 & 1 & 1 & - 1 & 0 & 1 \end{matrix} ⎤ ⎥ ⎦

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

Step 1.5.3

Perform the row operation

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

$3, 2$ a

$0$ .

Tap for more steps...

Step 1.5.3.1

Perform the row operation

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

$3, 2$ a

$0$ .

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

Step 1.5.3.2

Simplify

$R_{3}$ .

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

Step 1.6

The right half of the reduced row echelon form is the inverse.

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

Step 2

Multiply both sides by the inverse of

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

$[\begin{array}{c} 1 & 0 & 0 \\ - 1 & 1 & 0 \\ 0 & - 1 & 1 \end{array}] [\begin{array}{c} 1 & 0 & 0 \\ 1 & 1 & 0 \\ 1 & 1 & 1 \end{array}] y = [\begin{array}{c} 1 & 0 & 0 \\ - 1 & 1 & 0 \\ 0 & - 1 & 1 \end{array}] [\begin{array}{c} 1 & 2 \\ 3 & 3 \\ 2 & 1 \end{array}]$

Step 3

Simplify the equation.

Tap for more steps...

Step 3.1

Multiply

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

Tap for more steps...

Step 3.1.1

Two matrices can be multiplied if and only if the number of columns in the first matrix is equal to the number of rows in the second matrix. In this case, the first matrix is

$3 \times 3$ and the second matrix is

$3 \times 3$ .

Step 3.1.2

Multiply each row in the first matrix by each column in the second matrix.

$[\begin{array}{c} 1 \cdot 1 + 0 \cdot 1 + 0 \cdot 1 & 1 \cdot 0 + 0 \cdot 1 + 0 \cdot 1 & 1 \cdot 0 + 0 \cdot 0 + 0 \cdot 1 \\ - 1 \cdot 1 + 1 \cdot 1 + 0 \cdot 1 & - 0 + 1 \cdot 1 + 0 \cdot 1 & - 0 + 1 \cdot 0 + 0 \cdot 1 \\ 0 \cdot 1 - 1 \cdot 1 + 1 \cdot 1 & 0 \cdot 0 - 1 \cdot 1 + 1 \cdot 1 & 0 \cdot 0 - 0 + 1 \cdot 1 \end{array}] y = [\begin{array}{c} 1 & 0 & 0 \\ - 1 & 1 & 0 \\ 0 & - 1 & 1 \end{array}] [\begin{array}{c} 1 & 2 \\ 3 & 3 \\ 2 & 1 \end{array}]$

Step 3.1.3

Simplify each element of the matrix by multiplying out all the expressions.

$[\begin{array}{c} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{array}] y = [\begin{array}{c} 1 & 0 & 0 \\ - 1 & 1 & 0 \\ 0 & - 1 & 1 \end{array}] [\begin{array}{c} 1 & 2 \\ 3 & 3 \\ 2 & 1 \end{array}]$

Step 3.2

Multiplying the identity matrix by any matrix

$A$ is the matrix

$A$ itself.

$y = [\begin{array}{c} 1 & 0 & 0 \\ - 1 & 1 & 0 \\ 0 & - 1 & 1 \end{array}] [\begin{array}{c} 1 & 2 \\ 3 & 3 \\ 2 & 1 \end{array}]$

Step 3.3

Multiply

$[\begin{array}{c} 1 & 0 & 0 \\ - 1 & 1 & 0 \\ 0 & - 1 & 1 \end{array}] [\begin{array}{c} 1 & 2 \\ 3 & 3 \\ 2 & 1 \end{array}]$ .

Tap for more steps...

Step 3.3.1

Two matrices can be multiplied if and only if the number of columns in the first matrix is equal to the number of rows in the second matrix. In this case, the first matrix is

$3 \times 3$ and the second matrix is

$3 \times 2$ .

Step 3.3.2

Multiply each row in the first matrix by each column in the second matrix.

$y = [\begin{array}{c} 1 \cdot 1 + 0 \cdot 3 + 0 \cdot 2 & 1 \cdot 2 + 0 \cdot 3 + 0 \cdot 1 \\ - 1 \cdot 1 + 1 \cdot 3 + 0 \cdot 2 & - 1 \cdot 2 + 1 \cdot 3 + 0 \cdot 1 \\ 0 \cdot 1 - 1 \cdot 3 + 1 \cdot 2 & 0 \cdot 2 - 1 \cdot 3 + 1 \cdot 1 \end{array}]$

Step 3.3.3

Simplify each element of the matrix by multiplying out all the expressions.

$y = [\begin{array}{c} 1 & 2 \\ 2 & 1 \\ - 1 & - 2 \end{array}]$