Rouché–Capelli theorem is a theorem in linear algebra that determines the number of solutions of a system of linear equations, given the ranks of its augmented matrix and coefficient matrix. The theorem is variously known as the:
Rouché–Capelli theorem in English speaking countries, Italy and Brazil; Kronecker–Capelli theorem in Austria, Poland, Ukraine, Bosnia, Croatia, Romania, Serbia and Russia; Rouché–Fontené theorem in France; Rouché–Frobenius theorem in Spain and many countries in Latin America; Frobenius theorem in Czechia and Slovakia.
Statement 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. If there are solutions, they form an affine subspace of K n {\displaystyle K^{n}} of dimension n − rank(A). In particular:
if n = rank(A), the solution is unique, if n > rank(A) and K is an infinite field, the system of linear equations admits infinitely many solutions, if K is a finite field, the number of solutions is finite, namely | K | n − r a n k ( A ) {\displaystyle |K|^{n-\mathrm {rank} (A)}} .
Example Consider the system of equations
x + y + 2 z = 3 x + y + z = 1 2 x + 2 y + 2 z = 2 {\displaystyle {\begin{matrix}x+y+2z&=3\\x+y+z&=1\\2x+2y+2z&=2\end{matrix}}}
The coefficient matrix is
A = [ 1 1 2 1 1 1 2 2 2 ] , {\displaystyle A={\begin{bmatrix}1&1&2\\1&1&1\\2&2&2\\\end{bmatrix}},}
and the augmented matrix is
( A | B ) = [ 1 1 2 3 1 1 1 1 2 2 2 2 ] . {\displaystyle (A|B)=\left[{\begin{array}{ccc|c}1&1&2&3\\1&1&1&1\\2&2&2&2\end{array}}\right].}
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 + 2 z = 3 x + y + z = 1 2 x + 2 y + 2 z = 5 {\displaystyle {\begin{matrix}x+y+2z&=3\\x+y+z&=1\\2x+2y+2z&=5\end{matrix}}}
The coefficient matrix is
A = [ 1 1 2 1 1 1 2 2 2 ] , {\displaystyle A={\begin{bmatrix}1&1&2\\1&1&1\\2&2&2\\\end{bmatrix}},}
and the augmented matrix is
… excerpt ends here. Continue reading the full article.
