We can now view a linear system as a single equation involving a matrix-vector product:
{ax+by=αcx+dy=β⇔[abcd][xy]=[αβ].In general, a system of m equations involving n unknowns can be written as a compact equation
Ax=bwhere A is an m×n matrix that collects all the coefficients, x is a column vector containing n entries x1,…,xn, each representing an unknown, and b is a column vector containing m entries that are the right-hand-sides of the equations.
For a given 2×2 matrix A, the function v↦Av can be considered as a transformation of vectors in R2. That is, the function f:R2→R2 given by f(v)=Av is defined everywhere in R2 and sends vectors in R2 to vectors in R2.
Exercise. Consider matrices
A=[100−1]B=[2003]C=[0−110]What are the geometric interpretations of the transformation v↦Av, v↦Bv, and v↦Cv?
In general, given a m×n matrix A, the function f(v)=Av is a function f:Rn→Rm. That is, the domain if f is Rn and its codomain is Rm (the range may not be the entire Rm).
For a m×n matrix A, a vector v∈Rn, and a real number r, it is easy to verify that
A(rv)=rAvSimilarly, for a m×n matrix A and two vectors u,v∈Rn, we can also verify that
A(u+v)=Au+AvTherefore, for a given m×n matrix A, the function v↦Av preserves vector addition and scalar multiplication and is hence called a linear function.
It is also easy to verify that for two m×n matrices A and B and a vector v∈Rn,
(A+B)v=Av+Bv.