Linear Algebra 1 Tutorial 4

Juno Wong
October 30, 2018

Definition 1. [Elementary Matrix]

An n × n matrix is called an elementary matrix if it can be obtained from the n × n
identity matrix In by performing a single elementary row operations.
Theorem 1. Every elementary matrix is invertible, and the inverse is also an ele-
mentary matrix.
Theorem 2. If A is an n × n invertible matrix, then there are elementary matrices
E1 , E2 , · · · , Ek such that
Ek · · · E2 E1 A = In .
and as E1 , E2 , · · · , Ek are invertible, i.e Ek−1 , · · · , E2−1 E1−1 , we obtain,
A = E1−1 E2−1 · · · Ek−1 In = E1−1 E2−1 · · · Ek−1 .
And the inverse of A is:
A−1 = Ek · · · E2 E1 In = Ek · · · E2 E1 .
Theorem 3. [Using elementary row operations to find inverse]
If A is an n × n invertible matrix, then we add identity matrix In as
[A|I]
after doing some elementary row operations, will being
[I|A−1 ].
Example 1. [Very important example]
Given that " #
−3 6
A=
4 5
Find the inverse of A by using
(1) Formula;
(2) [A|I] →[I|A−1 ];
(3) A−1 = Ek · · · E2 E1 .

1
Solution

2
Theorem 4. [Some Basic Theorem]
(1) Every system of linear equations has either no solutions, exactly one solution,
or infinitely many solutions.
(2) If A is an invertible n × n matrix, then for n × 1 matrix b, the system of
equations Ax = b has exactly one solution, namely, x = A−1 b.
(3) Let A and B be square matrices of the same size. If AB is invertible, then A
and B must also be invertible.
Theorem 5. [Equivalent Statement] If A is an n × n matrix, then the following
are equivalent.
(1) A is invertible.
(2) Ax = 0 has the only trivial solution.
(3) The reduced row-echelon form of A is In .
(4) A is expressible as a product of elementary matrices.
(5) Ax = b. is consistent for every n × 1 matrix b.
(6) Ax = b. has exactly one solution for every n × 1 matrix b.
Definition 2. [Diagonal Matrices] A square matrix in which all the entries off
the main diagonal are zero is called a diagonal matrix.
Definition 3. A square matrix in which all the entries above the main diagonal are
zero is called Lower triangular, and a square matrix in which all the entries below
the main diagonal are zero is called Upper triangular. A matrix that is either upper
triangular or lower triangular is called triangular.
Theorem 6. [Some Properties]
(1) Upper triangular × Upper triangular = Upper triangular.
(2) lower triangular × lower triangular = lower triangular.
Definition 4. [Symmetric & Skew-symmetric]
A square matrix A is called symmetric if A = AT . A square matrix A is called
skew-symmetric if A = −AT .
Theorem 7. If A is an invertible symmetric matrix, then A−1 is symmetric.
Example 2. Solve the following systems by using x = A−1 b.
(1)

x1 + 3x2 + x3 = 4
2x1 + 2x2 + x3 = −1
2x1 + 3x2 + x3 = 3

3
(2)

x1 + 3x2 + x3 = a
2x1 + 2x2 + x3 = b
2x1 + 3x2 + x3 = c

4
Example 3. Find a matrix K such that AKB = C given that
   
1 4 " # 8 6 −6
2 0 0
A = −2 3  , B = , C =  6 −1 1 
   
0 1 −1
1 −2 −4 0 0

5
Example 4. In each part solve the matrix equation for X.
 
−1 0 1 " #
1 2 1
(1) X  1 1 0  =
 
−3 1 5
3 1 −1

6
 " # " # " #
3 1 1 4 2 −2
(2) X −X =
−1 2 2 0 5 4

7
Example 5. Show that

(I − A)−1 = I + A + A2 + · · · + An

if An+1 = 0