Linear Algebra Review - Radford University
Linear Algebra Review
For
Abstract Algebra
Neil Sigmon
Contents
1. Matrices…..……………………………………………………………………page 1
2. Equality of Matrices…………………………………………………………. page 1
3. Special Types of Matrices – Vectors…………………………………………page 2
4. Addition, Subtraction and Scalar Multiplication of Matrices……………..page 2
5. Matrix Multiplication…………………………………………………………page 3
6. Addition and Multiplicative Identity Matrices……………………………..page 6
7. Upper Triangular and Diagonal Matrices…………………………………..page 6
8. Determinants…………………………………………………………………..page 7
9. Matrix Inverses………………………………………………………………..page 9
1. Matrices
A matrix is a rectangular array of numbers (usually real) made up of rows and columns. The size of a matrix is its (# rows) [pic](# columns).
Example 1: Here are some various matrices with different sizes:
[pic] (Size: 2[pic]4) [pic] (Size: 3[pic]2)
[pic] (Size: 1[pic]4) [pic] (Size: 3[pic]1)
To indicate an individual entry in a matrix, we use the notation
[pic] (represents the element in the [pic] row and [pic]column of the matrix A)
Thus, we have for
[pic] ([pic]) and for [pic] ([pic])
A general matrix A of size [pic] has the form
[pic]
A square matrix is a matrix where (# rows) = (# columns) or m = n. When this is case, we say the matrix is a square matrix of order n. Here are some examples of square matrices:
[pic](2[pic] 2 square matrix of order 2) [pic](3[pic]3 square matrix of order 3).
2. Equality of Matrices
Two matrices A and B are equal (written A = B) if they have the same size and their corresponding entries are equal, that is [pic]for all i and j.
Example 2: Given the matrices [pic] and [pic], then A=C. However, [pic] since these matrices do not have equal corresponding entries and [pic] since the matrix sizes are not equal (A is a 2[pic]3 matrix and D is a 3[pic]2 matrix).
3. Special Types of Matrices – Vectors
A row vector is a matrix with one row. A column vector is a matrix with one column.
Example 3: The matrix[pic] is a 1[pic]4 row vector and the matrix[pic] is a 3[pic]1 column vector.
4. Addition, Subtraction and Scalar Multiplication of Matrices
Matrices can only be added and subtracted if they have the same size. To add or subtract matrices, we add or subtract each corresponding component.
Example 4: Given the [pic] matrices[pic] and [pic], we see that
[pic]
and
[pic].
Example 5: Given the [pic] matrix[pic] and the [pic] matrix [pic], the matrix [pic] is not defined since A and B are not of the same size.
When working with matrices, numbers are referred to as scalars. To multiply a matrix by a scalar, we multiply each entry of the matrix by the given scalar.
Example 6: Let [pic], then [pic].
Example 7: Let [pic]and [pic], then
[pic].
Matrix addition and scalar multiplication have certain basic properties that we now summarize
Addition and Scalar Multiplication Properties of Matrices
Let A, B, and C be matrices of the same size and c and d be scalars.
1. A + B = B + A (matrix addition is commutative)
2. [pic] (matrix addition is associative)
3. cd(A) = c(dA).
4. c[pic]= c[pic]+ c B
5. Matrix Multiplication
To understand matrix multiplication, one must first understand how to multiply a row vector times a column vector. If [pic] is a [pic] row vector and [pic] is a [pic]column vector, then the product of A and B is the scalar produced by multiplying each corresponding entry of A and B and adding. That is
[pic].
Example 8: If [pic] and [pic], then
[pic].
Multiplication of matrices in general involves multiple multiplications of rows and columns. If A is a [pic]matrix and B is a [pic]matrix, the product C=AB is the matrix where each element [pic] is made up of the product of the [pic] row of the left matrix A multiplied to the [pic] column of the right matrix B. That is,
[pic].
Note! For the matrix product AB to exist, the number of columns of the left matrix A must equal to the number of rows in the right matrix B. The size of the product will be
(the number of rows in A) [pic](the number of columns in B).
It can be easier to see this by examining the following:
[pic]
Example 9: If [pic] and [pic], then the size (2 [pic]3) of the product AB is obtained by observing:
[pic]
The 2 [pic]3 matrix AB is computing by performing the following row column multiplications:
[pic].
Performing these multiplications, we obtain:
[pic].
Example 10: For the matrices, [pic], [pic], after observing from
[pic]
that the size of the product is a [pic] matrix, we obtain the product [pic] by computing:
[pic].
To compute the product [pic], we observe
[pic]
and compute
[pic].
Example 11: Consider the matrices [pic] and [pic], one can immediately see by observing
[pic]
that the product [pic] does not exist (the number of columns in the left matrix A (4) is not equal to the number or rows in the right matrix B (3). However, by seeing
[pic]
the product [pic] is the [pic] matrix given by
[pic].
The previous two examples illustrate a very important fact when multiplying matrices:
FACT: In general, matrix multiplication is not commutative, that is, given matrices A and B, it is true in most cases that [pic].
However, matrices that are multiplied do have several properties that are summarized:
Multiplicative Properties of Matrices
Let A, B, and C be matrices whose sizes are multiplicatively compatible, c a scalar.
1. [pic] (matrix multiplication is associative)
2. [pic].
3. [pic].
4. c[pic]= (c[pic]B = A(cB)
6. Addition and Multiplicative Identity Matrices
The zero matrix is a [pic] matrix make up of all zeros. The following examples represent [pic], [pic], [pic]zero matrices
[pic]
The zero matrix represents the additive identity matrix of all matrices under the addition operation. If A is a
[pic] matrix and 0 is a [pic] zero matrix, then
A + 0 = 0 + A = A.
The multiplicative identity matrix, usually referred to just the identity matrix I, is the [pic] matrix defined by
[pic].
Note that I has 1’s on the main diagonal and 0’s elsewhere. The following represent a [pic], [pic], and [pic] identity matrices:
[pic].
Since I serves as the multiplicative identity, if A is a [pic] matrix, then
AI = IA = A.
Note that I is always a square matrix, that is, the number of rows equals the number of columns. Of course, the size of I is dependent on the size of A when multiplying on the left and right as the next example demonstrates.
Example 12: Given the [pic]matrix [pic], to be multiplicatively compatible, the size of the identity I on the left must be [pic] and on the right [pic]. This gives
[pic] and [pic].
7. Upper Triangular and Diagonal Matrices
A square matrix is upper triangular if all entries below the main diagonal are zero. A diagonal matrix is a special case of an upper triangular matrix where entries both above and below the main diagonal are zero. The general form of each matrix looks like:
[pic] [pic]
The matrix [pic] is an example of a upper triangular matrix while [pic] is an example of a diagonal matrix. Two important facts are evident when concerned with upper triangular and diagonal matrices:
1. The sum or difference of two upper triangular matrices is an upper triangular matrix and the sum or
difference of two diagonal matrices is a diagonal matrix.
2. The product of two upper triangular matrices is an upper triangular matrix and the product of two
diagonal matrices is a diagonal matrix.
Example 13: Given the two upper triangular matrices [pic] and [pic] and two diagonal matrices [pic] and [pic], one can readily verify the following sums and products:
[pic], [pic], [pic], and [pic]
8. Determinants
The determinant of a [pic] matrix [pic] is given by
det(A) [pic].
Example 14: The determinant of the matrix [pic] is:
[pic]
Example 15: The determinant of the matrix [pic] is:
[pic]
A fact to note is that the determinant of a [pic] matrix is defined to be the entry of the matrix. For example, if [pic], then [pic]. Another important note to make is that is possible to take determinants of larger size square matrices (larger than [pic]). However, this will not be necessary for most purposes except when we are dealing with diagonal and upper triangular matrices defined above. If we have an upper triangular and diagonal matrix of the form:
[pic] and [pic],
then the determinant is defined to be the product of the main diagonal elements, that is
[pic] and [pic].
Example 16: Given the upper triangular matrix [pic] and diagonal matrix [pic], we see that [pic] and [pic].
An important property concerning the determinant of the product of two matrices is the following:
[pic]
Example 17: For the matrices [pic] and [pic], one can verify that [pic] and compute [pic], [pic], and [pic]. Thus one can see that [pic].
However, this distributive property does not in general hold for the sum of two matrices, that is, in general:
[pic]
Example 18: For the matrices [pic] and [pic], one can verify that [pic] and compute [pic], [pic], and [pic]. Thus one can see that [pic].
9. Matrix Inverses
Matrices defined with addition have an obvious inverse. Given a matrix A, its additive inverse is defined to be the matrix –A, where all the elements of A are negated. Note that A + (-A) = 0, where 0 is the zero matrix. We are more interested however with the multiplicative inverse of a matrix, or inverse for short.
The inverse of a [pic] matrix [pic], if it exists, is denoted by [pic], and is defined to be the [pic] matrix where
[pic],
where [pic] is the [pic] identity matrix. It can be shown that [pic] is unique. Note the inverse only exists for square matrices where the row and column number are the same.
Example 19: To show that [pic] is the inverse of the matrix [pic], one computes
[pic]. A similar calculation can be shown for [pic].
Given a matrix [pic], how do we know if [pic] exists, and if it does, how can we calculate [pic]? For matrices larger than [pic], the recommended method involves a method involving row reduction. However, for [pic] matrices, there is a method based upon the following:
FACT: For a given [pic] matrix[pic], the matrix [pic] exists only if [pic]. If this is so, the inverse of the matrix is defined to be:
[pic].
Note that the matrix part of the formula for [pic] is obtained by switching the main diagonal elements and negating the back diagonal elements.
Example 20: Given the matrix [pic] we see that [pic]. Hence the inverse exists and [pic] .
Example 21: Given the matrix[pic], one can quickly see that [pic]. Therefore, [pic] does not exist.
Example 22: Given the diagonal matrix [pic], one can see that [pic]. Thus [pic] does not exist. For the upper triangular matrix [pic], one can see that [pic]. Thus [pic] exists, although row reduction methods are needed to verify that [pic].
We end with two more useful facts concerning inverses without verification:
1. The inverse of a diagonal matrix is diagonal.
2. The inverse of an upper triangular matrix is upper triangular.
-----------------------
Size of
Product
[pic]
Size of
Product
[pic]
Size of
Product
[pic]
Size of
Product
[pic]
[pic] [pic][pic]
Size of
Product
[pic]
[pic] [pic][pic]
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- algebra 2 x tredyffrin easttown school district
- differential equations and linear algebra
- textbook matrix algebra useful for statistics searle
- honors algebra ii matrix review worksheet
- linear algebra review radford university
- algebra 2 matrices review clinton public school district
- matrices university of new mexico
- derivation of the ordinary least squares estimator
- algebra 2 final exam review
Related searches
- linear algebra matrix solver
- linear algebra matrix pdf
- numpy linear algebra tutorial
- python linear algebra library
- java linear algebra library
- linear algebra library
- eigen linear algebra library
- python linear algebra pdf
- linear algebra determinant calculator
- linear algebra matrix calculator
- matrix linear algebra solver
- linear algebra equation solver