Overview Let m , n ∈ Z + 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 = [ A 1 , 1 ⋯ A 1 , n ⋮ ⋮ A m , 1 ⋯ A m , n ] . The notation A j , 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 1 ≤ i ≤ m , then A i , ⋅ denotes the 1 -by-n matrix consisting of row i of A . If 1 ≤ j ≤ n , 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 F m , n . With addition and scalar multiplication as defined below, F m , n is a vector space with dimension m n .
Addition Let A and B be m -by-n matrices over field F :
A = [ A 1 , 1 ⋯ A 1 , n ⋮ ⋮ A m , 1 ⋯ A m , n ] , B = [ B 1 , 1 ⋯ B 1 , n ⋮ ⋮ B m , 1 ⋯ B m , 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 = [ A 1 , 1 + B 1 , 1 ⋯ A 1 , n + B 1 , n ⋮ ⋮ A m , 1 + B m , 1 ⋯ A m , n + B m , n ] . Let V and W be finite-dimensional vector spaces over field F . If S , T ∈ L ( 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 = [ A 1 , 1 ⋯ A 1 , n ⋮ ⋮ A m , 1 ⋯ A m , n ] The product of λ and A , denoted λ A , is the matrix obtained by multiplying each entry in A by λ . That is,
λ A = [ λ A 1 , 1 ⋯ λ A 1 , n ⋮ ⋮ λ A m , 1 ⋯ λ A m , n ] . Let V and W be finite-dimensional vector spaces over field F . If T ∈ L ( 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 A B is defined to be the m -by-p matrix whose entry in row i , column j , is given by the following equation:
( A B ) i , j = ∑ k = 1 n A i , k B k , j = A i , ∙ B ∙ , j That is, the entry in row i , column k , of A B 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 T ∈ L ( U , V ) and S ∈ L ( V , W ) , then
M ( S T ) = 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:
( A B ) k , ∙ = A k , ∙ B . Given any 1 -by-n matrix a :
a = [ a 1 ⋯ a n ] , it follows that
a B = a 1 B 1 , ∙ + ⋯ + a n B n , ∙ . That is, a B 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:
( A B ) ∙ , k = A B ∙ , k . Given any n -by-1 matrix b :
b = [ b 1 ⋮ b n ] , it follows that
A b = b 1 A ∙ , 1 + ⋯ + b n A ∙ , n . That is, A b is a linear combination of the columns of A , with the scalars that multiply the columns coming from b .
Linear Maps Let v 1 , … , v n be a basis of vector space V . The matrix of v with respect to this basis is the n -by-1 matrix
M ( v ) = [ c 1 ⋮ c n ] , where c 1 , … , c n are the scalars such that
v = c 1 v 1 + ⋯ + c n v n . Next let w 1 , … , w m be a basis of vector space W and T ∈ L ( V , W ) . The matrix of T with respect to these bases is the m -by-n matrix M ( T ) whose entries A j , k are defined by
T v k = A 1 , k w 1 + ⋯ + A m , k w m . If the bases are not clear from the context, then M ( v , ( v 1 , … , v n ) ) and M ( T , ( v 1 , … , v n ) , ( w 1 , … , w m ) ) is used.
For all 1 ≤ k ≤ n , it follows that M ( T ) ∙ , k = M ( T v k ) .
Isomorphism Let V and W be finite-dimensional vector spaces over field F . Let v 1 , … , v n ∈ V and w 1 , … , w m ∈ W be bases . Then M is an isomorphism between L ( V , W ) and F m , n .
Suppose T ∈ L ( V , W ) and v ∈ V . Then
M ( T v ) = M ( T ) M ( v ) .