Systems of equations II
Matrix expression, Rouché-Frobenius theorem, homogeneous systems, and resolution by inverse matrix, Gauss and Cramer.
Matrix expression of a system
A system of equations can be represented in matrix form. E.g.: Let the system of equations be:
A system of equations can be represented in matrix form. E.g.: Let the system of equations be:
Its matrix expression will be:
The square matrix on the left, A, represents the coefficients of the unknowns. The column matrix X is the matrix of unknowns, and the matrix B on the right represents the constants (independent terms).
To study a system, the following matrices are used:
Coefficient matrix: matrix of the coefficients of the unknowns:
Augmented matrix: matrix A augmented with the column of constants:
Discussion of a system of equations. Rouché-Capelli Theorem
A system of equations is said to be:
- Inconsistent system when it has no solution.
- Consistent independent system when it has a single, unique solution.
- Consistent dependent system when it has infinitely many solutions.
A system of equations is said to be:
- Inconsistent system when it has no solution.
- Consistent independent system when it has a single, unique solution.
- Consistent dependent system when it has infinitely many solutions.
Rouché-Capelli Theorem (Also known as Rouché-Frobenius)
Let there be a system of equations and unknowns. And let be its coefficient matrix and its augmented matrix. Then:
Let there be a system of equations and unknowns. And let be its coefficient matrix and its augmented matrix. Then:
- If , it is a consistent independent system
- If , it is a consistent dependent system
- If , the system is inconsistent
Homogeneous systems
Systems where the constants are zero. E.g.:
Systems where the constants are zero. E.g.:
It is evident, since , that a homogeneous system is always consistent.
It will be independent if , with the trivial solution , and dependent when .
It will be independent if , with the trivial solution , and dependent when .
Resolution of systems of equations
Inverse matrix method
If we consider the matrix expression of a system:
If we consider the matrix expression of a system:
If matrix A is regular, that is, it has an inverse, then the solution of the system is:
Inverse matrix method
If we consider the matrix expression of a system:
If we consider the matrix expression of a system:
If matrix A is regular, that is, it has an inverse, then the solution of the system is:
Gauss method
It consists of transforming the original system into an equivalent one in row echelon form by applying the following equivalent transformations:
It consists of transforming the original system into an equivalent one in row echelon form by applying the following equivalent transformations:
- Multiply (or divide) an equation by a non-zero scalar.
- Add a linear combination of other equations to an equation.
- Eliminate an equation that is a linear combination of others in the system.
Using elementary transformations it is transformed into:
The last line represents the equation
The unknowns can be solved from the bottom up.
The unknowns can be solved from the bottom up.
Cramer's Rule
A linear system of equations is said to be a Cramer system if its coefficient matrix is square and regular, meaning it has a non-zero determinant.
A linear system of equations is said to be a Cramer system if its coefficient matrix is square and regular, meaning it has a non-zero determinant.
Let there be a system of 2 equations and 2 unknowns, in the following matrix form:
The solution to the system is found by applying:
Let there be a system of 3 equations and 3 unknowns, in the following matrix form:
The solution to the system is found by applying: