Je bent je ingevulde velden bij deze pagina aan het verwijderen. Ben je zeker dat je dit wilt doen?
You are erasing your filled-in fields on this page. Are you sure that is what you want?
Nieuwe Versie BeschikbaarNew Version Available
Er is een update van deze pagina. Als je update naar de meest recente versie, verlies je mogelijk je huidige antwoorden voor deze pagina. Hoe wil je verdergaan ?
There is an updated version of this page. If you update to the most recent version, then your current progress on this page will be erased. Regardless, your record of completion will remain. How would you like to proceed?
A matrix is a rectangular array of numbers. The plural form of matrix is matrices. You have encountered matrices before in the
context of augmented matrices and coefficient matrices associate with linear systems.
The dimension of a matrix is defined as \(m\times n\) where \(m\) is the number of rows and \(n\) is the number of columns. The above matrix is a \(3\times 4\)
matrix because there are three rows and four columns.
A column vector in \(\RR ^n\) is an \(n\times 1\) matrix. A row vector in \(\RR ^n\) is a \(1\times n\) matrix.
The individual entries in the matrix are identified according to their position. The \(( i, j)\)-entry of a matrix is the entry in the \(i^{th}\) row
and \(j^{th}\) column. For example, in matrix \(M\) above, \(8\) is called the \((2,3)\)-entry because it is in the second row and the third
column.
We denote the entry in the \(i^{th}\) row and the \(j^{th}\) column of matrix \(A\) by \(a_{ij}\), and write \(A\) in terms of its entries as
A matrix is called a square matrix if it has the same number of rows and columns. If \(B=\begin{bmatrix}b_{ij}\end{bmatrix}\) is an \(n \times n\) square matrix, the entries of the
form \(b_{ii}\) are said to lie on the main diagonal. For example, if
then the main diagonal consists of entries \(b_{11}=1\), \(b_{22}=5\) and \(b_{33}=9\).
There are various operations which are done on matrices of appropriate sizes. Matrices can be added to and subtracted from
other matrices, multiplied by a scalar, and multiplied by other matrices. We will never divide a matrix by another
matrix, but we will see later how multiplication by a matrix inverse (if an inverse exists) plays a similar role to
division.
In doing arithmetic with matrices, we often define the action by what happens in terms of the entries (or components) of the
matrices. Before looking at these operations in depth, consider a few general definitions.
The Zero Matrix The \(m\times n\)zero matrix is the \(m\times n\) matrix having every entry equal to zero. The zero matrix is denoted by \(O\).
Equality of Matrices Let \(A=\begin{bmatrix} a_{ij}\end{bmatrix}\) and \(B=\begin{bmatrix} b_{ij}\end{bmatrix}\) be two \(m \times n\) matrices. Then \(A=B\) means that \(a_{ij}=b_{ij}\) for all \(1\leq i\leq m\) and \(1\leq j\leq n\).
Addition of Matrices
Given two matrices of the same dimensions, we can add them together by adding their corresponding entries.
Addition of Matrices Let \(A=\begin{bmatrix} a_{ij}\end{bmatrix} \) and \(B=\begin{bmatrix} b_{ij}\end{bmatrix}\) be two \(m\times n\) matrices. Then the sum of matrices\(A\) and \(B\), denoted by \(A+B\), is an \(m \times n\) matrix given
by
You will recognize the zero matrix of Theorem 63 as the zero matrix of Definition 1.
Scalar Multiplication of Matrices
When a matrix is multiplied by a scalar, the new matrix is obtained by multiplying every entry of the original matrix by the given
scalar.
Scalar Multiplication of Matrices If \(A=\begin{bmatrix} a_{ij}\end{bmatrix} \) and \(k\) is a scalar, then \(kA=\begin{bmatrix} ka_{ij}\end{bmatrix}\).
Properties of Scalar Multiplication Let \(A, B\) be matrices, and \(k, p\) be scalars. Then, the following properties properties of scalar
multiplication hold.
1.
Distributive Law over Matrix Addition
\begin{equation*} k \left ( A+B\right ) =k A+ kB \end{equation*}
2.
Distributive Law over Scalar Addition
\begin{equation*} \left ( k +p \right ) A= k A+p A \end{equation*}
3.
Associative Law for Scalar Multiplication
\begin{equation*} k \left ( p A\right ) = \left ( k p \right ) A \end{equation*}
4.
Multiplication by \(1\)
\begin{equation*} 1A=A \end{equation*}
The proof of this theorem is similar to the proof of Theorem 6 and is left as an exercise.