Home  

Random  

Nearby  



Log in  



Settings  



Donate  



About Wikipedia  

Disclaimers  



Wikipedia





RouchéCapelli theorem





Article  

Talk  



Language  

Watch  

Edit  





Inlinear algebra, the Rouché–Capelli theorem determines the number of solutions for a system of linear equations, given the rank of its augmented matrix and coefficient matrix. The theorem is variously known as the:

Formal statement

edit

A system of linear equations with n variables and coefficients in a field K has a solution if and only if its coefficient matrix A and its augmented matrix [A|b] have the same rank.[1] If there are solutions, they form an affine subspaceof  of dimension n − rank(A). In particular:

Example

edit

Consider the system of equations

x + y + 2z = 3,
x + y + z = 1,
2x + 2y + 2z = 2.

The coefficient matrix is

 

and the augmented matrix is

 

Since both of these have the same rank, namely 2, there exists at least one solution; and since their rank is less than the number of unknowns, the latter being 3, there are infinitely many solutions.

In contrast, consider the system

x + y + 2z = 3,
x + y + z = 1,
2x + 2y + 2z = 5.

The coefficient matrix is

 

and the augmented matrix is

 

In this example the coefficient matrix has rank 2, while the augmented matrix has rank 3; so this system of equations has no solution. Indeed, an increase in the number of linearly independent columns has made the system of equations inconsistent.

Proof

edit

There are several proofs of the theorem. One of them is the following one.

The use of Gaussian elimination for putting the augmented matrix in reduced row echelon form does not change the set of solutions and the ranks of the involved matrices. The theorem can be read almost directly on the reduced row echelon form as follows.

The rank of a matrice is number of nonzero rows in its reduced row echelon form. If the ranks of the coefficient matrix and the augmented matrix are different, then the last non zero row has the form   corresponding to the equation 0 = 1. Otherwise, the ith row of the reduced row echelon form allows expressing the ithpivot variable as the sum of a constant and a linear combination of the non-pivot variables, showing that the dimension of the set of solutions is the number of non-pivot variables.

See also

edit

References

edit
  1. ^ Shafarevich, Igor R.; Remizov, Alexey (2012-08-23). Linear Algebra and Geometry. Springer Science & Business Media. p. 56. ISBN 9783642309946.
edit

Retrieved from "https://en.wikipedia.org/w/index.php?title=Rouché–Capelli_theorem&oldid=1219590353"
 



Last edited on 18 April 2024, at 17:27  





Languages

 


Azərbaycanca
Català
Čeština
Deutsch
Español
Euskara
Français
Hrvatski
Italiano
עברית
Lombard
Magyar

Polski
Português
Română
Русский
Саха тыла
Slovenčina
Српски / srpski
Srpskohrvatski / српскохрватски
Українська
Tiếng Vit
 

Wikipedia


This page was last edited on 18 April 2024, at 17:27 (UTC).

Content is available under CC BY-SA 4.0 unless otherwise noted.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Terms of Use

Desktop