1.6 - Linear System and Inverse Matrix

MAT 125
Introduction to Linear Algebra

Linear System and Inverse Matrix
Mohammad Mahmud Hasan

Department of Mathematics and Physics
February 20, 2022

Outline:
• Solving Linear System by Matrix Inversion

• Linear Systems with Common Coefficient Matrix
• Properties of Invertible Matrices
• Determining The Consistency of a Linear System
Linear System and Inverse Matrices
Theorem 1.6.1 A system of linear equations has zero (no solution), one, or infinitely many solutions. There are no
other possibilities.
Proof: If 𝐴𝒙 = 𝒃 is a system of linear equations, exactly one of the following is true:

(a) the system has no solutions,
(b) the system has exactly one solution, or
(c) the system has more than one solution.
The proof will be complete if we can show that the system has infinitely many solutions in case (c).
Assume that 𝐴𝒙 = 𝒃 has more than one solution, and let 𝒙𝟎 = 𝒙𝟏 − 𝒙𝟐 , where 𝒙𝟏 and 𝒙𝟐 are any two distinct
solutions. Because 𝒙𝟏 and 𝒙𝟐 are distinct, the matrix 𝒙𝟎 is nonzero; moreover,
𝐴𝒙𝟎 = 𝐴 𝒙𝟏 − 𝒙𝟐 = 𝐴𝒙𝟏 − 𝑨𝒙𝟐 = 𝒃 − 𝒃 = 𝟎

If we now let 𝑘 be any scalar, then
𝐴(𝒙𝟏 + 𝑘𝒙𝟎 ) = 𝐴𝒙𝟏 + 𝐴(𝑘𝒙𝟎 ) = 𝐴𝒙𝟏 + 𝑘(𝐴𝒙𝟎 )
𝐴 𝒙𝟏 + 𝑘𝒙𝟎 = 𝒃 + 𝑘𝟎 = 𝒃 + 𝟎 = 𝒃
But this says that 𝒙𝟏 + 𝑘𝒙𝟎 is a solution of 𝐴𝒙 = 𝒃. Since 𝒙𝟎 is nonzero and there are infinitely many choices for 𝑘,
the system 𝐴𝒙 = 𝒃 has infinitely many solutions.
Solving Linear System by Matrix Inversion
Theorem 1.6.2 If 𝐴 is an invertible 𝑛 × 𝑛 matrix, then for each 𝑛 × 1 matrix 𝒃, the system of equations
𝐴𝒙 = 𝒃 has exactly one solution, namely, 𝒙 = 𝐴$% 𝒃.
Proof: Since 𝐴 𝐴$% 𝒃 = 𝐴𝐴$% 𝒃 = 𝐼𝒃 = 𝒃, it follows that 𝒙 = 𝐴$% 𝒃 is a solution of 𝐴𝒙 = 𝒃.

To show that this is the only solution, we will assume that 𝒙𝟎 is an arbitrary solution and then show that 𝒙𝟎 must
be the solution 𝐴$% 𝒃.
If 𝒙𝟎 is any (other than 𝐴$% 𝒃) solution of 𝐴𝒙 = 𝒃, then 𝐴𝒙𝟎 = 𝒃. Multiplying both sides of this equation by
𝐴$% , we obtain
𝐴$% 𝐴𝒙𝟎 = 𝐴$% 𝒃
𝐼𝒙𝟎 = 𝐴$% 𝒃
𝒙𝟎 = 𝐴$% 𝒃
Solution of Linear System Using 𝑨1𝟏
Example 1: Solve the system of linear equations

𝒙 + 𝟐𝒚 + 𝟑𝒛 = 𝟓
𝟐𝒙 + 𝟓𝒚 + 𝟑𝒛 = 𝟑
𝒙 + 𝟖𝒛 = 𝟏𝟕
Solution: In matrix form this system can be written as 𝐴𝒙 = 𝒃, where
1 2 3 𝑥 5
𝐴= 2 5 3 , 𝒙 = 𝑦 , 𝑎𝑛𝑑 𝒃 = 3
1 0 8 𝑧 17
we showed that 𝐴 is invertible and
−40 16 9
𝐴$% = 13 −5 −3
5 −2 −1
Therefore the solution of the system is
−40 16 9 5 1
𝒙 = 𝐴$% 𝒃 = 13 −5 −3 3 = −1
5 −2 −1 17 2
Or, 𝑥 = 1, 𝑦 = −1, 𝑎𝑛𝑑 𝑧 = 2
Linear Systems with Common Coefficient Matrix
Solving a sequence of systems
𝐴𝒙 = 𝒃% , 𝐴𝒙 = 𝒃& , 𝐴𝒙 = 𝒃' … … . , 𝐴𝒙 = 𝒃(
each of which has the same square coefficient matrix 𝐴.
If 𝐴 is invertible, then the solutions

𝒙𝟏 = 𝐴$% 𝒃% , 𝒙𝟐 = 𝐴$% 𝒃& , 𝒙𝟑 = 𝐴$% 𝒃' , … … … . , 𝒙𝒌 = 𝐴$% 𝒃(
can be obtained with one matrix inversion and k matrix multiplications. An efficient way to do this is to form the
partitioned matrix
𝐴M𝒃% M𝒃& M𝒃' |… … .M𝒃(
in which the coefficient matrix 𝐴 is “augmented” by all 𝑘 of the matrices 𝒃% , 𝒃& , 𝒃' ,…., 𝒃( , and then reduce to reduced
row echelon form by Gauss–Jordan elimination.
Example 2: Solving the following linear systems at once
(a) 𝑥 + 2𝑦 + 3𝑧 = 4 (b) 𝑥 + 2𝑦 + 3𝑧 = 1
2𝑥 + 5𝑦 + 3𝑧 = 5 2𝑥 + 5𝑦 + 3𝑧 =6
𝑥+ +8𝑧 = 9 𝑥+ +8𝑧 = −6
Linear Systems with Common Coefficient Matrix
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
1 2 3 4 1
2 5 3 O5 P 6
1 0 8 9 −6
Reducing this matrix to reduced row echelon form (RREF) yields
1 0 0 1 2
0 1 0 O0 P 1
0 0 1 1 −1
It follows from the last two columns that the solution of system (a) is 𝑥 = 1, 𝑦 = 0,
𝑧 = 1 and the solution of system (b) is 𝑥 =2, 𝑦 = 1, 𝑧 = −1
Properties of Invertible Matrices
Theorem 1.6.3 Let 𝐴 be a square matrix.
(a) If 𝐵 is a square matrix satisfying 𝐵𝐴 = 𝐼, then 𝐵 = 𝐴!" .
(b) If 𝐵 is a square matrix satisfying 𝐴𝐵 = 𝐼, then 𝐵 = 𝐴!" .
Proof: Given that 𝐵𝐴 = 𝐼 . Let assume 𝐴 is invertible, the proof can be completed by multiplying 𝐵𝐴 =
𝐼 on both sides by 𝐴!" to obtain
𝐵𝐴𝐴!" = 𝐼𝐴!"
Or, 𝐵𝐼 = 𝐴!"
Or, 𝐵 = 𝐴!"
To show that A is invertible, it suffices to show that the system 𝐴𝒙 = 𝟎 has only the trivial solution (see
Theorem 1.5.3). Let 𝒙𝟎 (other than zero) be any solution of this system. If we multiply both sides of 𝐴𝒙𝟎 = 𝟎
on the left by 𝐵,we obtain
𝐵𝐴𝒙𝟎 = 𝐵𝟎
Or, 𝐼𝒙𝟎 = 𝟎
Or, 𝒙𝟎 = 𝟎
Thus, the system of equations 𝐴𝒙 = 𝟎 has only the trivial solution.

Equivalence Theorem
Theorem 1.6.4 Equivalent Statement
If 𝐴 is an 𝑛 × 𝑛 matrix, then the following statements are equivalent, that is, all true or all false.
(a) 𝐴 is invertible.
(b) 𝐴𝒙 = 𝟎 has only the trivial (zero) solution.
(c) The reduced row echelon form of 𝐴 is 𝐼+ .
(d) 𝐴 is expressible as a product of elementary matrices.
(e) 𝐴𝒙 = 𝒃 is consistent for every 𝑛 × 1 matrix 𝒃.
( f ) 𝐴𝒙 = 𝒃 has exactly one solution for every 𝑛 × 1 matrix 𝒃.
Properties of Invertible Matrices
Theorem 1.6.5 Let 𝐴 and 𝐵 be square matrices of the same size. If 𝐴𝐵 is invertible, then 𝐴 and 𝐵 must also
be invertible.
Proof: We will show first that 𝐵 is invertible by showing that the homogeneous system
𝐵𝒙 = 𝟎 has only the trivial solution. If we assume that 𝒙𝟎 is any solution of this system,
then 𝐵𝒙𝟎 = 𝟎
Therefore
(𝐴𝐵)𝒙𝟎 = 𝐴(𝐵𝒙𝟎 ) = 𝐴𝟎 = 𝟎
(𝐴𝐵)𝒙𝟎 = 𝟎
Or, 𝒙𝟎 = 𝟎
But the invertibility of 𝐵 implies the invertibility of 𝐵!" (Theorem 1.4.7), which in turn
implies that
(𝐴𝐵)𝐵!" = 𝐴(𝐵𝐵!" ) = 𝐴𝐼 = 𝐴
is invertible since the left side is a product of invertible matrices. This completes the proof.
Determining The Consistency of a Linear System
A Fundamental Problem Let A be a fixed 𝑚 × 𝑛 matrix. Find all 𝑚 × 1 matrices 𝒃 such that the system of
equations 𝐴𝒙 = 𝒃 is consistent.
Example 3: What conditions must 𝑏! , 𝑏" , and 𝑏# satisfy in order to the system of equations
𝑥 + 𝑦 + 2𝑧 = 𝑏!
𝑥 + 𝑧 = 𝑏"
2𝑥 + 𝑦 + 3𝑧 = 𝑏#
to be consistent?
Solution: The augmented matrix is
1 1 2 𝑏!
1 0 1 5𝑏"
2 1 3 𝑏#
which can be reduced to row echelon form as follows:
1 1 2 𝑏!
0 −1 −1 5 𝑏" − 𝑏! 𝑅′& = 𝑅& + (−1)𝑅%
0 −1 −1 𝑏# − 2𝑏! 𝑅′' = 𝑅' + (−2) 𝑅%
1 1 2 𝑏!
0 1 1 5 𝑏! − 𝑏"
𝑅′& = (−1)𝑅&
0 −1 −1 𝑏# − 2𝑏!
1 1 2 𝑏"
0 1 1 , 𝑏" − 𝑏$ 𝑅′' = 𝑅' + (1) 𝑅%
0 0 0 𝑏% − 𝑏$ − 𝑏"
It is now evident from the third row in the matrix that the system has a solution if and only if 𝑏" ,
𝑏$ , and 𝑏% satisfy the condition
𝑏% − 𝑏$ − 𝑏" = 0
Or,
𝑏% = 𝑏$ + 𝑏"
To express this condition another way, 𝐴𝒙 = 𝒃 is consistent if and only if 𝒃 is a matrix of the form
𝑏"
𝒃= 𝑏$
𝑏" + 𝑏$
where 𝑏" and 𝑏$ are arbitrary.

Example 4: What conditions must 𝑏" , 𝑏$ , and 𝑏% satisfy in order to the system of equations
𝑥 + 2𝑦 + 3𝑧 = 𝑏"
2𝑥 + 5𝑦 + 3𝑧 = 𝑏$
𝑥 + 8𝑧 = 𝑏%
to be consistent?
Solution: The augmented matrix is
1 2 3 𝑏"
2 5 3 ,𝑏$
1 0 8 𝑏%
which can be reduced to row echelon form (RREF) as follows:
1 0 0 −40𝑏" + 16𝑏$ + 9𝑏%
0 1 0 , 13𝑏" − 5𝑏$ − 3𝑏%
0 0 1 5𝑏" − 2𝑏$ − 𝑏%
In this case there are no restrictions on 𝑏" , 𝑏$ , and 𝑏% , so the system has the unique solution
𝑥 = −40𝑏" + 16𝑏$ + 9𝑏% , 𝑦 = 13𝑏" − 5𝑏$ − 3𝑏% , 𝑧 = 5𝑏" − 2𝑏$ − 𝑏%
For all values of 𝑏" , 𝑏$ , and 𝑏%
Homework:
Exercise Set: 1.6

1-17,19,21,23, and all true false exercise

1.6 - Linear System and Inverse Matrix

Uploaded by

Copyright:

Available Formats

1.6 - Linear System and Inverse Matrix

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

1.6 - Linear System and Inverse Matrix

Uploaded by

Copyright:

Available Formats

MAT 125

Introduction to Linear Algebra

Mohammad Mahmud Hasan

February 20, 2022

• Solving Linear System by Matrix Inversion

Proof: If 𝐴𝒙 = 𝒃 is a system of linear equations, exactly one of the following is true:

𝐴𝒙𝟎 = 𝐴 𝒙𝟏 − 𝒙𝟐 = 𝐴𝒙𝟏 − 𝑨𝒙𝟐 = 𝒃 − 𝒃 = 𝟎

Proof: Since 𝐴 𝐴$% 𝒃 = 𝐴𝐴$% 𝒃 = 𝐼𝒃 = 𝒃, it follows that 𝒙 = 𝐴$% 𝒃 is a solution of 𝐴𝒙 = 𝒃.

Example 1: Solve the system of linear equations

If 𝐴 is invertible, then the solutions

Thus, the system of equations 𝐴𝒙 = 𝟎 has only the trivial solution.

where 𝑏" and 𝑏$ are arbitrary.

Exercise Set: 1.6

You might also like