The abstract definition of a matrix is historically much more recent than the techniques developed in these notes. The motivation for the definition of a matrix, given below, comes from two different places: (1) The algebraic question of solving a system of linear equations, see Section 5 for more on this question; (2) The geometric question of describing linear transformations of -dimensional space, , see Section 6 for more on this question.
Throughout this section, are positive integers ().
A matrix is a rectangular array of numbers (usually real numbers in this module). The entries in the array are called the coefficients (or elements) of the matrix. If a matrix has rows and columns then is an matrix. If then is a square matrix. We write for the element in the -th row and -th column, starting with the coefficient in the top left corner of the array:
We commonly use , or simply as a shorthand for saying that the coefficient of is , for all .
Example 1.1.2.
Here is a matrix and is a matrix:
If , then and . Matrices may be written with either round brackets or square brackets .
All the matrices we will consider have coefficients in , although one could also take coefficients in or for instance.
For any and , the set of matrices is denoted . If , then we simply write . We call the set of scalars. If , then the matrices are column vectors and we write instead of . Similarly, if , then the matrices are row vectors.
We number the coefficients from top to bottom in each column
and from left to right in each row
Some authors prefer to use the notation for row vectors, that is . In these notes, will refer to column vectors.
Example 1.1.6.
Let us write the matrix with coefficients , for . We calculate each coefficient:
and so