Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
4 views

L7 Systems of Linear Equations. Part 2.

Uploaded by

7qwgh25w7r
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

L7 Systems of Linear Equations. Part 2.

Uploaded by

7qwgh25w7r
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Systems of Linear Equations. Part 2.

Nargiza Tazabekova
▶ Matrix Equation of a System of Linear Equations
▶ Linear Combinations of Vectors
▶ Cramer’s Rule
Matrix Equation of a System of Linear Equations

The general system of m linear equations in n unknowns

a11 x1 + a12 x2 + ... + a1n xn = b1


a21 x1 + a22 x2 + ... + a2n xn = b2
...
am1 x1 + am2 x2 + ... + amn xn = bm

is equivalent to the matrix equation AX = B or


   
x1 b1

a11 a12 ... a1n
a
 21 a22 ... a2n  
 x2   b2 
   

 ...
  . =
  ..   .. 

  . 

am1 am2 ... amn xn bm
Matrix Equation of a System of Linear Equations

AX = B
   
x1 b1

a11 a12 ... a1n
x
 21 a22 ... a2n     b2 
a    
  2  
 .  =  . 
 ...   ..   .. 


am1 am2 ... amn xn bn
 
a11 a12 ... a1n
a a22 ... a2n 
where A =  21  is a coefficient matrix,
 
 ... 
am1 am2 ... amn
x1 b1
   
 ..   .. 
X =  .  is a matrix of unknown elements, and B =  .  is a
xn bm
matrix of constant terms.
Example

x1 + 2x2 − 4x3 + 7x4 = 4


3x1 − 5x2 + 6x3 − 8x4 = 8
4x1 − 3x2 − 2x3 + 6x4 = 11
 
  x1  
1 2 −4 7   4
 x   
3 −5 6 −8  2  =  8 

x3 
4 −3 −2 6 11
x4
The vector v = (3, 1, 2, 1) is a solution of the system.
Matrix Equation of a System of Linear Equations

Theorem 3.10
A square system AX = B of linear equations has a unique
solution if and only if the matrix A is invertible. In such a case,
A−1 B is the unique solution of the system.
Matrix Equation of a System of Linear Equations

Theorem 3.10
A square system AX = B of linear equations has a unique
solution if and only if the matrix A is invertible. In such a case,
A−1 B is the unique solution of the system.
Proof. Let there be a square system of linear equations
AX = B. And let A−1 B be the solution of the given system
(X = A−1 B).

AX = B =⇒ A(A−1 B) = B

A(A−1 B) = (AA−1 )B = IB = B
Example

x + 2y + 3z = 1
x + 3y + 6z = 3
2x + 6y + 13z = 5
     
1 2 3 1 3 −8 3
A = 1 3 6  , B = 3 , A−1 = −1 7 −3
     
2 6 13 5 0 −2 1
Example

x + 2y + 3z = 1
x + 3y + 6z = 3
2x + 6y + 13z = 5
     
1 2 3 1 3 −8 3
A = 1 3 6  , B = 3 , A−1 = −1 7 −3
     
2 6 13 5 0 −2 1
    
3 −8 3 1 −6
A−1 B = −1 7 −3 3 =  5 
    
0 −2 1 5 −1
Vector v = (−6, 5, −1) is the unique solution of the system.
Linear Combinations of Vectors
The general system

a11 x1 + a12 x2 + ... + a1n xn = b1


a21 x1 + a22 x2 + ... + a2n xn = b2
...
am1 x1 + am2 x2 + ... + amn xn = bm

of linear equations may be rewritten as the following vector


equation:

a11 a12 a1n b1


       
 a21   a22   a2n   b2 
x1   + x2   + · · · + xn  = 
.. .. .. ..
.am1 .am2 .amn .bm

Theorem 3.11
A system AX = B of linear equations has a solution iff B is a
linear combination of the columns of the coefficient matrix A.
Example

Write the vector v = (1, 3, 5) as a linear combination of vectors

u1 = (1, 1, 2), u2 = (2, 3, 6), u3 = (2, 6, 13)

v = xu1 + yu2 + zu3


Example

Write the vector v = (1, 3, 5) as a linear combination of vectors

u1 = (1, 1, 2), u2 = (2, 3, 6), u3 = (2, 6, 13)

v = xu1 + yu2 + zu3


       
1 1 2 2
3 = 1 x + 3 y +  6  z
       
5 2 6 13
x + 2y + 3z = 1
x + 3y + 6z = 3
2x + 6y + 13z = 5
Vector v = (−6, 5, −1) is the unique solution of the system.
Cramer’s Rule

Consider a system AX = B of n linear equations in n unknowns

a11 x1 + a12 x2 + ... + a1n xn = b1


a21 x1 + a22 x2 + ... + a2n xn = b2
...
an1 x1 + an2 x2 + ... + ann xn = bn
Cramer’s Rule

Let denote:

D = det(A), N1 = det(A1 ), N2 = det(A2 ), ..., Nn = det(An )

where A is a coefficient matrix and each matrix Aj is obtained


from the coefficient matrix by replacing the j-th column with
the column vector of constant terms B. For example, if the
coefficient
 matrix is   
a11 a12 ... a1n a11 b1 ... a1n
a a22 ... a2n  a
 21 b2 ... a2n 

A =  21  , then A2 = 
 
... ...

 
an1 an2 ... ann an1 bn ... ann
Example

x+y+z =5
x − 2y − 3z = −1
2x + y − z = 3
     
1 1 1 x 5
A = 1 −2 −3 , X = y  , B = −1
     
2 1 −1 z 3
Example

x+y+z =5
x − 2y − 3z = −1
2x + y − z = 3
   
1 1 1 5
A = 1 −2 −3 , B = −1
   
2 1 −1 3
     
5 1 1 1 5 1 1 1 5
A1 = −1 −2 −3 , A2 = 1 −1 −3 , A3 = 1 −2 −1
     
3 1 −1 2 3 −1 2 1 3
Cramer’s Rule

Theorem 8.10
The (square) system AX = B has a solution if and only if
D ̸= 0. In this case, the unique solution is given by
N1 N2 Nn
x1 = , x2 = , ..., xn =
D D D

Theorem 8.11
A square homogeneous system AX = 0 has a nonzero solution if
and only if D = |A| = 0
Example

x+y+z =5
x − 2y − 3z = −1
2x + y − z = 3
   
1 1 1 5
A = 1 −2 −3 , B = −1
   
2 1 −1 3
D = |A| = 5
Because D ̸= 0, the system has a unique solution.
     
5 1 1 1 5 1 1 1 5
A1 = −1 −2 −3 , A2 = 1 −1 −3 , A3 = 1 −2 −1
     
3 1 −1 2 3 −1 2 1 3

N1 = |A1 | = 20, N2 = |A2 | = −10, N3 = |A3 | = 15


Example

x+y+z =5
x − 2y − 3z = −1
2x + y − z = 3

D = |A| = 5

N1 = |A1 | = 20, N2 = |A2 | = −10, N3 = |A3 | = 15

N1 20
x= = =4
D 5
N2 −10
y= = = −2
D 5
N3 15
z= = =3
D 5
Any questions?

You might also like