Matrices

Overview

Let m,nZ+ and F be a field. An m-by-n matrix A over F is a rectangular array of elements of F with m rows and n columns:

A=[A1,1A1,nAm,1Am,n].

The notation Aj,k denotes the entry in row j and column k of A. That is, the first index refers to the row number and the second index refers to the column number.

If 1im, then Ai, denotes the 1-by-n matrix consisting of row i of A. If 1jn, then A,j denotes the m-by-1 matrix consisting of column j of A.

Vector Space

The set of all m-by-n matrices with entries in field F is denoted by Fm,n. With addition and scalar multiplication as defined below, Fm,n is a vector space with dimension mn.

Addition

Let A and B be m-by-n matrices over field F:

A=[A1,1A1,nAm,1Am,n],B=[B1,1B1,nBm,1Bm,n]

The sum of A and B, denoted A+B, is the matrix obtained by adding corresponding entries in A and B. That is,

A+B=[A1,1+B1,1A1,n+B1,nAm,1+Bm,1Am,n+Bm,n].

Let V and W be finite-dimensional vector spaces over field F. If S,TL(V,W), then

M(S+T)=M(S)+M(T).

Scalar Multiplication

Let A be an m-by-n matrix over field F and λF:

A=[A1,1A1,nAm,1Am,n]

The product of λ and A, denoted λA, is the matrix obtained by multiplying each entry in A by λ. That is,

λA=[λA1,1λA1,nλAm,1λAm,n].

Let V and W be finite-dimensional vector spaces over field F. If TL(V,W) and λF, then

M(λT)=λM(T).

Multiplication

Let A be an m-by-n matrix and B be an n-by-p matrix. Then AB is defined to be the m-by-p matrix whose entry in row i, column j, is given by the following equation:

(AB)i,j=k=1nAi,kBk,j=Ai,B,j

That is, the entry in row i, column k, of AB is computed by taking row i of A and column j of B, multiplying together corresponding entries, and then summing.


Let U, V and W be finite-dimensional vector spaces over field F. If TL(U,V) and SL(V,W), then

M(ST)=M(S)M(T).

By Rows

Let A be an m-by-n matrix and B be an n-by-p matrix. Then we can also identify matrix multiplication on a per-row basis like so:

(AB)k,=Ak,B.

Given any 1-by-n matrix a:

a=[a1an],

it follows that

aB=a1B1,++anBn,.

That is, aB is a linear combination of the rows of B, with the scalars that multiply the columns coming from a.

By Columns

Let A be an m-by-n matrix and B be an n-by-p matrix. Then we can also identify matrix multiplication on a per-column basis like so:

(AB),k=AB,k.

Given any n-by-1 matrix b:

b=[b1bn],

it follows that

Ab=b1A,1++bnA,n.

That is, Ab is a linear combination of the columns of A, with the scalars that multiply the columns coming from b.

Linear Maps

Let v1,,vn be a basis of vector space V. The matrix of v with respect to this basis is the n-by-1 matrix

M(v)=[c1cn],

where c1,,cn are the scalars such that

v=c1v1++cnvn.

Next let w1,,wm be a basis of vector space W and TL(V,W). The matrix of T with respect to these bases is the m-by-n matrix M(T) whose entries Aj,k are defined by

Tvk=A1,kw1++Am,kwm.

If the bases are not clear from the context, then M(v,(v1,,vn)) and M(T,(v1,,vn),(w1,,wm)) is used.

For all 1kn, it follows that M(T),k=M(Tvk).

Isomorphism

Let V and W be finite-dimensional vector spaces over field F. Let v1,,vnV and w1,,wmW be bases. Then M is an isomorphism between L(V,W) and Fm,n.

Suppose TL(V,W) and vV. Then

M(Tv)=M(T)M(v).
Powered by Forestry.md