# matrix

A matrix is simply a mapping $M:A\times B\to C$ of the product of two sets into some third set. As a rule, though, the word matrix and the notation associated with it are used only in connection with linear mappings. In such cases $C$ is the ring or field of scalars.

Matrix of a linear mapping

Definition: Let $V$ and $W$ be finite-dimensional vector
spaces^{} over the same field $k$, with bases $A$ and $B$ respectively,
and let $f:V\to W$ be a linear mapping.
For each $a\in A$ let ${({k}_{ab})}_{b\in B}$ be the unique family of scalars
(elements of $k$) such that

$$f(a)=\sum _{b\in B}{k}_{ab}b.$$ |

Then the family $({M}_{ab})$ (or equivalently the mapping $(a,b)\mapsto {M}_{ab}$
of $A\times B\to k$)
is called the matrix of $f$ with respect to the given bases $A$ and $B$.
The scalars ${M}_{ab}$ are called the *components ^{}* of the matrix. The matrix $M$ is said to be of

*size*$|A|$-by-$|B|$ or simply $|A|$x$|B|$ matrix.

The matrix describes the function^{} $f$ completely; for any element

$$x=\sum _{a\in A}{x}_{a}a$$ |

of $V$, we have

$$f(x)=\sum _{a\in A}{M}_{ab}b$$ |

as is readily verified.

Any two linear mappings $V\to W$ have a sum, defined pointwise; it is easy to verify that the matrix of the sum is the sum, componentwise, of the two given matrices.

The formalism of matrices extends somewhat to linear mappings between
*modules*, i.e. extends to a ring $k$, not necessarily commutative^{},
rather than just a field.

Rows and columns; product of two matrices

Suppose we are given three modules $V,W,X$, with bases $A,B,C$ respectively,
and two linear mappings $f:V\to W$ and $g:W\to X$.
$f$ and $g$ have some matrices $({M}_{ab})$ and $({N}_{bc})$ with respect to
those bases. The *product* matrix $NM$ is defined as the matrix
$({P}_{ac})$ of the function

$$x\mapsto g(f(x))$$ |

$$V\to W$$ |

with respect to the bases $A$ and $C$. Straight from the definitions of a linear mapping and a basis, one verifies that

$${P}_{ac}=\sum _{b\in B}{M}_{ab}{N}_{bc}$$ | (1) |

for all $a\in A$ and $c\in C$.

To illustrate the notation of matrices in terms of rows and columns, suppose the spaces $V,W,X$ have dimensions 2, 3, and 2 respectively, and bases

$$A=\{{a}_{1},{a}_{2}\}\mathit{\hspace{1em}\hspace{1em}}B=\{{b}_{1},{b}_{2},{b}_{3}\}\mathit{\hspace{1em}\hspace{1em}}C=\{{c}_{1},{c}_{2}\}.$$ |

We write

$$\left(\begin{array}{ccc}\hfill {M}_{11}\hfill & \hfill {M}_{12}\hfill & \hfill {M}_{13}\hfill \\ \hfill {M}_{21}\hfill & \hfill {M}_{22}\hfill & \hfill {M}_{23}\hfill \end{array}\right)\left(\begin{array}{cc}\hfill {N}_{11}\hfill & \hfill {N}_{12}\hfill \\ \hfill {N}_{21}\hfill & \hfill {N}_{22}\hfill \\ \hfill {N}_{31}\hfill & \hfill {N}_{32}\hfill \end{array}\right)=\left(\begin{array}{cc}\hfill {P}_{11}\hfill & \hfill {P}_{12}\hfill \\ \hfill {P}_{21}\hfill & \hfill {P}_{22}\hfill \end{array}\right).$$ |

(Notice that we have taken a liberty with the notation, by writing e.g. ${M}_{12}$ instead of ${M}_{{a}_{1}{a}_{2}}$.) The equation (1) shows that the multiplication of two matrices proceeds “rows by columns”. Also, in an expression such as ${N}_{23}$, the first index refers to the row, and the second to the column, in which that component appears.

Similar notation can describe the calculation of $f(x)$ whenever $f$ is a linear mapping. For example, if $f:V\to W$ is linear, and $x={\sum}_{i}{x}_{i}{a}_{i}$ and $f(x)={\sum}_{i}{y}_{i}{b}_{i}$, we write

$$\left(\begin{array}{cc}\hfill {x}_{1}\hfill & \hfill {x}_{2}\hfill \end{array}\right)\left(\begin{array}{ccc}\hfill {M}_{11}\hfill & \hfill {M}_{12}\hfill & \hfill {M}_{13}\hfill \\ \hfill {M}_{21}\hfill & \hfill {M}_{22}\hfill & \hfill {M}_{23}\hfill \end{array}\right)=\left(\begin{array}{ccc}\hfill {y}_{1}\hfill & \hfill {y}_{2}\hfill & \hfill {y}_{3}\hfill \end{array}\right).$$ |

When, as above, a “row vector^{}” denotes an element of a space,
a “column vector” denotes an element of the dual space.
If, say, $\overline{f}:{W}^{*}\to {V}^{*}$ is the transpose^{} of $f$,
then, with respect to the bases dual to $A$ and $B$,
an equation $\overline{f}({\sum}_{j}{\nu}_{j}{\beta}_{j})={\sum}_{i}{\mu}_{i}{\alpha}_{i}$
may be written

$$\left(\begin{array}{c}\hfill {\mu}_{1}\hfill \\ \hfill {\mu}_{2}\hfill \end{array}\right)=\left(\begin{array}{ccc}\hfill {M}_{11}\hfill & \hfill {M}_{12}\hfill & \hfill {M}_{13}\hfill \\ \hfill {M}_{21}\hfill & \hfill {M}_{22}\hfill & \hfill {M}_{23}\hfill \end{array}\right)\left(\begin{array}{c}\hfill {\nu}_{1}\hfill \\ \hfill {\nu}_{2}\hfill \\ \hfill {\nu}_{3}\hfill \end{array}\right),$$ |

One more illustration: Given a bilinear form^{} $L:V\times W\to k$,
we can denote $L(v,w)$ by

$$\left(\begin{array}{cc}\hfill {v}_{1}\hfill & \hfill {v}_{2}\hfill \end{array}\right)\left(\begin{array}{ccc}\hfill {L}_{11}\hfill & \hfill {L}_{12}\hfill & \hfill {L}_{13}\hfill \\ \hfill {L}_{21}\hfill & \hfill {L}_{22}\hfill & \hfill {L}_{23}\hfill \end{array}\right)\left(\begin{array}{c}\hfill {w}_{1}\hfill \\ \hfill {w}_{2}\hfill \\ \hfill {w}_{3}\hfill \end{array}\right).$$ |

A matrix $M:A\times B\to C$ is called square if $A=B$, or if some
bijection $A\to B$ is implicit in the context.
(It is not enough for $A$ and $B$ to be equipotent.)
Square matrices naturally arise in connection with a linear mapping of
a space into *itself* (called an endomorphism^{}), and in the related
case of a change of basis (from one basis of some space, to another
basis of the same space). When $A$ is finite of cardinality $n$ (and thus, so is $B$), then $n$ is often called the *order* of the matrix $M$. Unfortunately, equally often order of $M$ means the order (http://planetmath.org/OrderGroup) of $M$ as an element of the group $G{L}_{n}(C)$ (http://planetmath.org/GeneralLinearGroup).

Miscelleous usages of “matrix”

The word matrix has come into use in some areas where linear mappings
are not at issue. An example would be a combinatorical statement,
such as Hall’s marriage theorem^{}, phrased in terms of “0-1 matrices”
instead of subsets of $A\times B$.

Remark

Matrices are heavily used in the physical sciences, engineering,
statistics, and computer programming. But for purely mathematical purposes,
they are less important than one might expect, and indeed are frequently
irrelevant in linear algebra. Linear mappings, determinants^{}, traces,
transposes, and a number of other simple notions can and should be
defined without matrices, simply because they have a meaning independent
of any basis or bases.
Many little theorems in linear algebra can be proved in a simpler
and more enlightening way without matrices than with them.
One more illustration: The derivative (at a point)
of a mapping from one surface to another is a linear mapping; it is not a
matrix of partial derivatives^{}, because the matrix depends on a choice
of basis but the derivative does not.

Title | matrix |
---|---|

Canonical name | Matrix |

Date of creation | 2013-03-22 12:25:41 |

Last modified on | 2013-03-22 12:25:41 |

Owner | bbukh (348) |

Last modified by | bbukh (348) |

Numerical id | 19 |

Author | bbukh (348) |

Entry type | Definition |

Classification | msc 15-01 |

Related topic | LinearTransformation |

Related topic | ZeroMatrix |

Defines | size |

Defines | order |