How to determine the existence of solutions for Ax=b.

📚 Determining the Existence of Solutions for Ax=b

In linear algebra, determining whether a system of linear equations, represented by $Ax=b$, has a solution is a fundamental problem. The existence of solutions depends on the relationship between the coefficient matrix $A$, the unknown vector $x$, and the constant vector $b$. This article explores the conditions that guarantee the existence of solutions, providing a comprehensive overview of the underlying principles and practical applications.

📜 Historical Context

The study of linear systems dates back to ancient times, with early methods for solving such systems appearing in ancient Babylonian and Chinese texts. However, the modern theory of linear algebra, which provides a systematic approach to understanding the existence and uniqueness of solutions, developed primarily in the 19th century, with contributions from mathematicians like Carl Friedrich Gauss, Camille Jordan, and Arthur Cayley.

🔑 Key Principles

• 🔍 Rank of a Matrix: The rank of a matrix $A$, denoted as $rank(A)$, is the maximum number of linearly independent columns (or rows) in $A$.
• 🌳 Augmented Matrix: The augmented matrix $[A|b]$ is formed by appending the column vector $b$ to the matrix $A$.
• 💡 Rouché-Capelli Theorem (Rank Theorem): The system $Ax=b$ has a solution if and only if $rank(A) = rank([A|b])$.
• 📏 Underdetermined System: If $A$ is an $m \times n$ matrix with $m < n$ (more variables than equations) and $rank(A) = m$, the system has infinitely many solutions (or no solution, but if it has one, it has infinitely many).
• 📐 Overdetermined System: If $A$ is an $m \times n$ matrix with $m > n$ (more equations than variables), the system typically has no solution. However, it can have a unique solution or infinitely many solutions if $rank(A) = rank([A|b])$.
• 🎯 Homogeneous System: The system $Ax=0$ always has at least one solution, the trivial solution $x=0$. Non-trivial solutions exist if and only if $rank(A) < n$, where $n$ is the number of variables.

➕ Real-world Examples

Example 1: A Simple System

Consider the system:

Here, $A = \begin{bmatrix} 1 & 1 \\ 2 & 2 \end{bmatrix}$ and $b = \begin{bmatrix} 3 \\ 6 \end{bmatrix}$. The augmented matrix is $[A|b] = \begin{bmatrix} 1 & 1 & 3 \\ 2 & 2 & 6 \end{bmatrix}$. Since $rank(A) = 1$ and $rank([A|b]) = 1$, the system has infinitely many solutions.

Example 2: An Inconsistent System

Consider the system:

Here, $A = \begin{bmatrix} 1 & 1 \\ 2 & 2 \end{bmatrix}$ and $b = \begin{bmatrix} 3 \\ 7 \end{bmatrix}$. The augmented matrix is $[A|b] = \begin{bmatrix} 1 & 1 & 3 \\ 2 & 2 & 7 \end{bmatrix}$. Since $rank(A) = 1$ and $rank([A|b]) = 2$, the system has no solution.

Example 3: A Unique Solution

Consider the system:

Here, $A = \begin{bmatrix} 1 & 1 \\ 1 & -1 \end{bmatrix}$ and $b = \begin{bmatrix} 3 \\ 1 \end{bmatrix}$. The augmented matrix is $[A|b] = \begin{bmatrix} 1 & 1 & 3 \\ 1 & -1 & 1 \end{bmatrix}$. Since $rank(A) = 2$ and $rank([A|b]) = 2$, the system has a unique solution, $x=2$ and $y=1$.

📝 Conclusion

Determining the existence of solutions for $Ax=b$ hinges on understanding the ranks of the coefficient matrix $A$ and the augmented matrix $[A|b]$. The Rouché-Capelli Theorem provides a clear criterion: a solution exists if and only if these ranks are equal. By applying these principles, we can effectively analyze and solve a wide range of linear systems, uncovering whether they have solutions, and if so, whether those solutions are unique or infinite.