Augmented matrix

In linear algebra, an augmented matrix is a matrix obtained by appending the columns of two given matrices, usually for the purpose of performing the same elementary row operations on each of the given matrices.

Given the matrices A and B, where

$A={\begin{bmatrix}1&3&2\\2&0&1\\5&2&2\end{bmatrix}},\quad B={\begin{bmatrix}4\\3\\1\end{bmatrix}},$

the augmented matrix (A|B) is written as

$(A|B)=\left[{\begin{array}{ccc|c}1&3&2&4\\2&0&1&3\\5&2&2&1\end{array}}\right].$

This is useful when solving systems of linear equations.

For a given number of unknowns, the number of solutions to a system of linear equations depends only on the rank of the matrix representing the system and the rank of the corresponding augmented matrix. Specifically, according to the Rouché–Capelli theorem, any system of linear equations is inconsistent (has no solutions) if the rank of the augmented matrix is greater than the rank of the coefficient matrix; if, on the other hand, the ranks of these two matrices are equal, the system must have at least one solution. The solution is unique if and only if the rank equals the number of variables. Otherwise the general solution has k free parameters where k is the difference between the number of variables and the rank; hence in such a case there are an infinitude of solutions.

An augmented matrix may also be used to find the inverse of a matrix by combining it with the identity matrix.

Uses

To find the inverse of a matrix

Let C be the square 2×2 matrix

C={\begin{bmatrix}1&3\\-5&0\end{bmatrix}}.

To find the inverse of C we create (C|I) where I is the 2×2 identity matrix. We then reduce the part of (C|I) corresponding to C to the identity matrix using only elementary row operations on (C|I).

(C|I)=\left[{\begin{array}{cc|cc}1&3&1&0\\-5&0&0&1\end{array}}\right]

(I|C^{{-1}})=\left[{\begin{array}{cc|cc}1&0&0&-{\frac {1}{5}}\\0&1&{\frac {1}{3}}&{\frac {1}{15}}\end{array}}\right]

the right part of which is the inverse of the original matrix.

Existence and number of solutions

Consider the system of equations

x + y + 2z = 3

x + y + z = 1

2x + 2y + 2z = 2.

The coefficient matrix is

A={\begin{bmatrix}1&1&2\\1&1&1\\2&2&2\\\end{bmatrix}},

and the augmented matrix is

(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 an infinite number of solutions.

In contrast, consider the system

x + y + 2z = 3

x + y + z = 1

2x + 2y + 2z = 5.

The coefficient matrix is

A={\begin{bmatrix}1&1&2\\1&1&1\\2&2&2\\\end{bmatrix}},

and the augmented matrix is

(A|B)=\left[{\begin{array}{ccc|c}1&1&2&3\\1&1&1&1\\2&2&2&5\end{array}}\right].

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 rows has made the system of equations inconsistent.

Solution of a linear system

As used in linear algebra, an augmented matrix is used to represent the coefficients and the solution vector of each equation set. For the set of equations

{\begin{aligned}x+2y+3z&=0\\3x+4y+7z&=2\\6x+5y+9z&=11\end{aligned}}

the coefficients and constant terms give the matrices

A={\begin{bmatrix}1&2&3\\3&4&7\\6&5&9\end{bmatrix}},\quad B={\begin{bmatrix}0\\2\\11\end{bmatrix}},

and hence give the augmented matrix

(A|B)=\left[{\begin{array}{ccc|c}1&2&3&0\\3&4&7&2\\6&5&9&11\end{array}}\right]

Note that the rank of the coefficient matrix, which is 3, equals the rank of the augmented matrix, so at least one solution exists; and since this rank equals the number of unknowns, there is exactly one solution.

To obtain the solution, row operations can be performed on the augmented matrix to obtain the identity matrix on the left side, yielding

\left[{\begin{array}{ccc|c}1&0&0&4\\0&1&0&1\\0&0&1&-2\\\end{array}}\right],

so the solution of the system is (x, y, z) = (4, 1, -2).

References

Marvin Marcus and Henryk Minc, A survey of matrix theory and matrix inequalities, Dover Publications, 1992, ISBN 0-486-67102-X. Page 31.

This article is issued from Wikipedia - version of the 8/30/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.