A set of generic linear equations can be expressed as Ax=y where
x∈Rn is the vector to be found
y∈Rm is the vector of results, each entry is the rhs result of 1 equation
A∈Rm,n is matrix with coefficients, each row has entries of 1 equation
Solution
S≐{x∈Rn:Ax=y}
There can be 0, 1 or infinite solution
Ax always lies in R(A), thus S=∅⇔y∈R(A)
The linear equation Ax=y admits a solution if and only if rank([Ay])=rank(A)
When such existence condition is satisfiedm the set of all solutions is the affine set S={x=xˉ+Nz} where xˉ is any vector such that Axˉ=y and N∈Rn,n−r is a matrix whose columns span the nullspace odf A (hence AN=0)
The system has unique solution if rank([Ay])=rank(A) and N(A)=0