Scribd
Upload
35 views9 pages

Linear Algebra Chapter 1 Matrices Part 2

The document discusses elementary matrices and methods for finding the inverse of a matrix. It also covers row equivalence, properties of elementary matrices including invertibility, and using elementary row operations to solve systems of linear equations and determine whether a homogeneous system has nontrivial solutions. Further topics covered include properties of invertible matrices as they relate to consistency of linear systems, and properties of diagonal, triangular, and symmetric matrices.

Uploaded by

Eugemy Grullo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
35 views9 pages

Linear Algebra Chapter 1 Matrices Part 2

The document discusses elementary matrices and methods for finding the inverse of a matrix. It also covers row equivalence, properties of elementary matrices including invertibility, and using elementary row operations to solve systems of linear equations and determine whether a homogeneous system has nontrivial solutions. Further topics covered include properties of invertible matrices as they relate to consistency of linear systems, and properties of diagonal, triangular, and symmetric matrices.

Uploaded by

Eugemy Grullo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

1

College of Education

1.5 Elementary Matrices and a Method for Finding A−1


Definition 1. Matrices A and B are said to be row equivalent if either (hence each) can be
obtained from the other by a sequence of elementary row operations.
Definition 2. A matrix E is called an elementary matrix if it can be obtained from an identity
matrix by performing a single elementary row operation.

Example 1. Listed below are four elementary matrices and the operations that produce them.

Theorem 1.5.1. Row Operations by Matrix Multiplication


If the elementary matrix E results from performing a certain row operation on I m and if A is an
m ×n matrix, then the product EA is the matrix that results when this same row operation is performed
on A .

Example 2. Consider the matrix

and consider the elementary matrix

which results from adding 3 times the first row of I 3 to the third row. The product EA is

which is precisely the matrix that results when we add 3 times the first row of A to the third row.

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics


2
College of Education

Example 3. In each of the following, an elementary row operation is applied to the 2 ×2 identity matrix
to obtain an elementary matrix E , then E is restored to the identity matrix by applying the inverse row
operation.

Theorem 1.5.2. Every elementary matrix is invertible, and the inverse is also an elementary matrix.

Inversion Algorithm: To find the inverse of an invertible matrix A , find a sequence of elementary row
operations that reduces A to the identity and then perform that same sequence of operations on I n to
obtain A−1.
Example 4. Find the inverse of

Solution: We want to reduce A to the identity matrix by row operations and simultaneously apply these
operations to I to produce A−1. To accomplish this, we will adjoin the identity matrix to the right side of
A , thereby producing a partitioned matrix of the form [ A∨I ]. Then we will apply row operations to this
matrix until the left side is reduced to I ; these operations will convert the right side to A−1, so the final
matrix will have the form [I ∨A−1 ].

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics


3
College of Education

Example 5.

Example 6. Use Theorem 1.5.3 to determine whether the given homogeneous system has nontrivial
solutions.

Solution: From parts (a) and (b) of Theorem 1.5.3 a homogeneous linear system has only the trivial
solution if and only if its coefficient matrix is invertible. From Examples 4 and 5 the coefficient matrix
of system (a) is invertible and that of system (b) is not. Thus, system (a) has only the trivial solution
while system (b) has nontrivial solutions.
A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics
4
College of Education

1.6 More on Linear Systems and Invertible Matrices

Theorem 1.6.1. A system of linear equations has zero, one, or infinitely many solutions. There are no
other possibilities.
Theorem 1.6.2. If A is an invertible n × n matrix, then for each n ×1 matrix b , the system of equations
Ax=b has exactly one solution, namely, x= A−1 b .

Example 1. Consider the system of linear equations

Example 2. Solve the systems

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics


5
College of Education

Solution: The two systems have the same coefficient matrix. If we augment this coefficient matrix with
the columns of constants on the right sides of these systems, we obtain
It follows from the last two columns that the solution of system (a) is x 1=1, x 2=0, x 3=1 and the
solution of system (b) is x 1=2, x 2=1, x 3=−1.

Theorem 1.6.3. Let A be a square matrix

Equivalence Theorem: We are now in a position to add two more statements to the four given in
Theorem 1.5.3.

Theorem 1.6.4. Equivalence Statements

Theorem 1.6.5. Let A and B be square matrices of the same size. If AB is invertible, then A and B must
also be invertible.

A Fundamental Problem: Let A be a fixed m ×n matrix. Find all m ×1 matrices b such that the system of
equations A x=b is consistent.

Example 3.

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics


6
College of Education

Example 4.

1.7. Diagonal, Triangular, and Symmetric Matrices

A square matrix in which all the entries off the main diagonal are zero is called a diagonal

matrix.

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics


7
College of Education

Example 1.

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.

Example 2.

Theorem 1.7.1

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics


8
College of Education

Example 3.

Definition 1. A square matrix A is said to be symmetric if A=A T .

Example 4.

Theorem 1.7.2. If A and B are symmetric matrices with the same size, and if k is any scalar, then:

Theorem 1.7.3. The product of two symmetric matrices is symmetric if and only if the matrices
commute.

Example 5.

Theorem 1.7.4. If A is an invertible symmetric matrix, then A−1 is symmetric.

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics


9
College of Education

Example 6.

Theorem 1.7.5. If A is an invertible matrix, then and A AT and AT A are also invertible.

A. Abella I, PhD MMM 502 (Linear Algebra) MAED-Mathematics

You might also like