ProofComplete

Proof: Row Operations Preserve Solutions

We prove that elementary row operations preserve the solution set of a linear system. This fundamental result justifies the entire methodology of Gaussian elimination.

ProofRow Operations Preserve Solutions

Theorem: If an elementary row operation is applied to the augmented matrix [Ab][A|\mathbf{b}] to obtain [Ab][A'|\mathbf{b}'], then the systems Ax=bA\mathbf{x} = \mathbf{b} and Ax=bA'\mathbf{x} = \mathbf{b}' have the same solution set.

Proof: We consider each type of elementary row operation separately. Let the original system have equations E1,E2,,EmE_1, E_2, \ldots, E_m and let x\mathbf{x}^* be any solution.

Case 1: Row Switching (RiRjR_i \leftrightarrow R_j)

Interchanging rows ii and jj simply reorders the equations. If x\mathbf{x}^* satisfies all equations in the original order, it clearly satisfies them in the new order. Conversely, any solution to the reordered system satisfies the original system. Thus the solution sets are identical.

Case 2: Row Multiplication (RicRiR_i \to cR_i where c0c \neq 0)

Suppose equation EiE_i is ai1x1+ai2x2++ainxn=bia_{i1}x_1 + a_{i2}x_2 + \cdots + a_{in}x_n = b_i. After the operation, equation EiE_i becomes: cai1x1+cai2x2++cainxn=cbica_{i1}x_1 + ca_{i2}x_2 + \cdots + ca_{in}x_n = cb_i

If x\mathbf{x}^* satisfies the original equation, then: ai1x1+ai2x2++ainxn=bia_{i1}x_1^* + a_{i2}x_2^* + \cdots + a_{in}x_n^* = b_i

Multiplying both sides by cc yields: cai1x1+cai2x2++cainxn=cbica_{i1}x_1^* + ca_{i2}x_2^* + \cdots + ca_{in}x_n^* = cb_i

so x\mathbf{x}^* satisfies the new equation. Conversely, if x\mathbf{x}^* satisfies the new equation, dividing by cc (which is nonzero) shows it satisfies the original equation. All other equations remain unchanged.

Case 3: Row Addition (RiRi+cRjR_i \to R_i + cR_j where iji \neq j)

Let equation EiE_i be k=1naikxk=bi\sum_{k=1}^n a_{ik}x_k = b_i and equation EjE_j be k=1najkxk=bj\sum_{k=1}^n a_{jk}x_k = b_j.

The new equation EiE_i' is: k=1n(aik+cajk)xk=bi+cbj\sum_{k=1}^n (a_{ik} + ca_{jk})x_k = b_i + cb_j

If x\mathbf{x}^* satisfies both EiE_i and EjE_j, then: k=1naikxk=biandk=1najkxk=bj\sum_{k=1}^n a_{ik}x_k^* = b_i \quad \text{and} \quad \sum_{k=1}^n a_{jk}x_k^* = b_j

Adding cc times the second equation to the first: k=1naikxk+ck=1najkxk=bi+cbj\sum_{k=1}^n a_{ik}x_k^* + c\sum_{k=1}^n a_{jk}x_k^* = b_i + cb_j k=1n(aik+cajk)xk=bi+cbj\sum_{k=1}^n (a_{ik} + ca_{jk})x_k^* = b_i + cb_j

Thus x\mathbf{x}^* satisfies EiE_i'. Since equation EjE_j is unchanged, x\mathbf{x}^* satisfies the new system.

Conversely, suppose x\mathbf{x}^* satisfies the new system with EiE_i' and EjE_j. Then x\mathbf{x}^* satisfies: k=1n(aik+cajk)xk=bi+cbjandk=1najkxk=bj\sum_{k=1}^n (a_{ik} + ca_{jk})x_k^* = b_i + cb_j \quad \text{and} \quad \sum_{k=1}^n a_{jk}x_k^* = b_j

Subtracting cc times the second from the first: k=1naikxk=bi\sum_{k=1}^n a_{ik}x_k^* = b_i

so x\mathbf{x}^* satisfies the original equation EiE_i and hence the original system.

Since each row operation is reversible by an operation of the same type, and each preserves solutions, the solution sets must be identical. ∎

Remark

This proof demonstrates that row operations establish a two-way correspondence between solutions. The reversibility of each operation is crucial: it ensures that not only do solutions of the original system solve the modified system, but also that solutions of the modified system solve the original system.