 Prerequisite : How To Find Rank of a Matrix?

System of Linear Algebraic Equations
Consider the following equations:
This can be written using matrix form as
Let be , the matrix of coefficients, be , the matrix of variables and be , the matrix of constant terms.
We can then write .
Now, consider a matrix, where the column vector is joined to , s.t. it is the last column of the newly formed matrix. i.e.
This matrix is known as the augmented matrix. Let’s denote it by . The behavior of the system depends on the relation between the rank of augmented matrix and the rank of coefficient matrix .
The augmentation is done usually for the purpose of performing the same elementary row operations on each of the given matrices.
Thus, if a system has variables in equations, it can be written in the form
The augmented matrix will be .

Homogeneous and nonHomogeneous Systems
When a system of equations has all constant terms to be , i.e. is a null vector, it is known as a homogeneous system. When is not a null vector, it is known as a nonhomogeneous system.

Consistent and Inconsistent Systems
When a system has 1 or more solutions, it is said to be consistent. When it does not have any solution, it is said to be inconsistent.
Thus, a homogeneous system will always be consistent, because, zeros always form a solution. (This solution is known as trivial solution).

Condition for Consistency of Nonhomogeneous System of Equations
When the rank of augmented matrix is equal to the rank of matrix of coefficients, the system is consistent. i.e.
When it isn’t, the system is inconsistent.

Finitely Many and Infinitely Many Solutions of Nonhomogeneous System of Equations
Once the condition for consistency is satisfied, we can look for the possibility of infinitely many solutions. When the rank is less than the total number of unknowns,, the system possesses an infinite number of solutions. When it is equal to the total number of unknowns, the system possesses a unique solution.

A subcondition, provided that ranks are equal
When the number of unknowns is equal to the number of equations, the coefficient matrix is a square matrix. In such cases, if , the system possesses a unique solution given by . (Discussed in Matrices III)
When , if , it is a case of infinitely many solutions.

Condition for Only Unique (Trivial) Solution of Homogeneous System
The homogeneous system always possesses a trivial solution. If the ranks are equal, and is less than the the number of unknowns, there will be infinitely many solutions.
For homogeneous systems, where number of equations is equal to number of unknowns, when , it possesses only trivial solution.

Linear Dependence of Vectors
Recall : A vector is either a row vector or a column matrix.
A set of vectors, is said to be linearly dependent, when there exist scalars , not all zero, such that
When this condition is not satisfied, the vectors are linearly independent. For example, consider and . They can be written as
There exist no scalars , not all zero, s.t. . Hence these vectors are linearly independent.
Equation gives us a homogeneous system of equations with being the matrix containing all s.

Orthogonality
A square matrix is orthogonal, when . Its determinant is always equal to . Consider a system
such that
is orthogonal, when