]>
A matrix is just a grid of numbers. That's all. However, matrices can be quite useful…
The size of a matrix is given as , where the matrix has r rows and c columns. Below are two images of a matrix.


Sometimes, subscripts are used to identify the individual elements (cells) in a matrix. Note that the first digit of the subscript is the row, and the second digit is the column.
To refer to a matrix without listing its elements, an italicized capital roman letter is typically used (like the A in the example above). To refer to the elements of a matrix in general, a subscripted lowercase italicized roman letter (the same as the matrix) is used (like in the example above).
Unlike the real numbers, not all matrices can be added or subtracted. In particular, only matrices of the same size (same number of rows; same number of columns) can be added or subtracted.
To add two matrices, add elements in the same position in the two matrices (i.e., The element in row i and column j of is ).
Do exactly the same thing to subtract two matrices!
Like the real numbers, addition of matrices is commutative—the order of addition makes no difference.
If you have an equation made up of matrices—like —and you want to solve for matrix X, then what should you do?
Subtract matrix A, of course! .
[1.] Add .
[2.] Subtract .
[3.] Solve for X: .
A scalar is a regular number. Scalar multiplication means multiplying a scalar against a matrix. To do this, simply multiply each element of the matrix by the scalar.
Matrix multiplication is one matrix times another. However, not all matrices can be multiplied…and just in case that wasn't fun enough, matrix multiplication is not commutative—the order of the matrices matters!
Two matrices can be multiplied if the number of columns in the left hand matrix equals the number of rows in the right hand matrix. The resulting matrix will have the same number of rows as the left hand matrix and the same number of columns as the right hand matrix.

The procedure for actually multiplying the matrices is involved…basically, you will multiply every element in a left hand row with every (corresponding) element in a right hand column, then add. For example:
This will require some practice…
[4.] Multiply: .
[5.] Multiply: .
Here's a way to arrange the matrices to make multiplying a little easier (it lines up the required rows and columns for each element of the answer):

The answer is .
[6.] Multiply .
The arrangement I suggested above may be of some help here!
The answer:
A matrix with an equal number of rows and columns is called a square matrix.
The real numbers have two identities—additive (0) and multiplicative (1). Square matrices have the same things. The zero matrix is . Actually, the symbol 0 is used regardless of the size of the matrix, so this is also the zero matrix: . The zero matrix is the additive identity—adding it results in no change. Also, adding a matrix with its opposite (negation) results in the zero matrix.
The identity matrix is a square matrix with 1's along the left-right diagonal (the main diagonal), and zeros everywhere else. The 2×2 identity matrix is . This is a multiplicative identity—multiplying by this matrix results in no change. Also, due to its nature, it actually doesn't matter which side you multiply on when using the identity matrix.
The inverse of a matrix is another matrix that, when multiplied, results in the (multiplicative) identity: the inverse of A is , so that . In the real numbers, we call this the reciprocal…however, that's the only place that we'll use that term…especially since every real number has an reciprocal, but not every matrix has an inverse.
Finding the inverse of a matrix requires that we learn about…
This is a special number that describes a matrix. Not every matrix has one!
Given a matrix , the determinant of A is .
If the determinant is non-zero, then the matrix has an inverse, and is called non-singular (if the determinant is zero, then the matrix is singular).
Given a non-singular matrix , the inverse of the matrix is .
When last we solved matrix equations, we could only handle matrices that were added or subtracted. Now, we can handle multiplication!
(there is no matrix division)
Specifically, we can solve equations of the form .
How can we get that A off of X and solve? Use the inverse!
Of course, this will require that the inverse exists…
[7.] Find .
It is .
[8.] Find the inverse of the matrix .
First, the determinant: . Thus, .
[9.] Solve .
Isolate the variables: . I'll let my technology find the inverse for me. . Finally, multiply: . Thus, the solution is .
First, note that the multiplicative identity is now .
The determinant of a 3×3 matrix is a little more complicated that that of a 2×2 . There is a fine diagram on page 202 of the text that I'll not attempt to duplicate here.
You'll note that the book doesn't even attempt to show how to find the inverse of a 3×3 matrix by hand…so neither will I (yet). Just use your calculator…of course, I'll be giving instructions on how to do this in class (unless you actually read the manual for your calculator…).
…is exactly the same.
[10.] Find .
My technology tells me that this is 48.
[11.] Find .
Again, my technology tells me that the answer is .
[12.] Solve .
Matrices can be used to solve systems of equations—you just have to know how to translate from the equations into matrices.
First, write your equations in standard form. This will make three matrices—the coefficient matrix (A), the variable matrix (X), and the constant matrix (B). Use our previously learned techniques (and your calculator) to solve.
[13.] Solve .
The three matrices are , and .
The matrix equation is .
The solution is .
Let's say that we have a matrix equation …note that the size of A will be n×n, and B will be n×1. There is another way to solve for the n variables of the system!
Let matrix D1 be the same as matrix A, but replace the first column with the elements from matrix B. Let matrix D2 be the same as A, but replace the second column with the elements from matrix B. Keep this up until you've created n of these matrices (up to Dn).
The solution for the first variable is ; the solution for the second variable is ; and so on, up to the solution for the nth variable .
There is another way to use the elimination method—one that removes all of the variables, and just manipulates the coefficients and constants. The method is called Gaussian Elimination.
Start with a matrix equation, as before: . From this, we will create an augmented matrix by tacking matrix B on as an extra column in matrix A. Typically, we draw a dashed vertical line after the last column of A and before matrix B.
There are three rules (operations) in this method.
There are two possible goals of this method.
When you have row echelon form, then you have solved for the final variable. This can be plugged back in to find the value of the other variables.
However, when you have reduced row echelon form, then you have solved for all variables!
The way to work efficiently is to create a one in the upper left corner, then use that one to make zeros underneath. Next, make a one in row two column 2. Use that one to make zeros above and below. Keep this up until you're done.
If you end up with a row of all zeros, then there are an infinite number of solutions to the system. If you end up with a row that contains all zeros except for the last column, then there is no solution to the system.
There is an extension to this, called Gauss-Jordan Elimination. In this method, augment matrix A with the identity I. Now use the row operations to achieve reduced row echelon form. Where matrix I had been, there is now !
[14.] Convert this to reduced row echelon form: .
There is already a one in the upper left corner. To make a zero underneath, I'll do (add row 1 into row 2). The result is . Now do (multiply row 2 by ). The result is . Finally, do (negative three times row two added into row 1). From that we get . The solution is .
[15.] Solve by Gaussian elimination.
The augmented matrix is . gives . Next, gives . Finally, gives . The solution is .
[16.] Solve by Gaussian elimination.
The augmented matrix is .
The solution is .
Page last validated 2010-08-15