Scribd
Upload
55 views2 pages

Section 1.5

This document summarizes different ways to write a system of linear equations in matrix form. It shows that a system of equations with n variables and m equations can be written as Ax=b, where A is an m×n matrix, x is an n×1 vector of variables, and b is an m×1 vector of constants. It also states that if the matrix A is invertible, the unique solution is x=A^-1b. Finally, it defines a homogeneous system as one in the form Ax=0, which always has the trivial solution x=0.

Uploaded by

Majd AL Kawaas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views2 pages

Section 1.5

This document summarizes different ways to write a system of linear equations in matrix form. It shows that a system of equations with n variables and m equations can be written as Ax=b, where A is an m×n matrix, x is an n×1 vector of variables, and b is an m×1 vector of constants. It also states that if the matrix A is invertible, the unique solution is x=A^-1b. Finally, it defines a homogeneous system as one in the form Ax=0, which always has the trivial solution x=0.

Uploaded by

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

Section 1.

5: Matrix equations

I. A system of linear equations can be written in the following equivalent ways:



 a11 x1 + a12 x2 + . . . a1n xn = b1
 a21 x1 + a22 x2 + . . . a2n xn = b2



1. a31 x1 + a32 x2 + . . . a3n xn = b3
 .. ..



 . .
 a x + a x + ...a x = b
m1 1 m2 2 mn n m

     
a11 a12 . . . a1n x1 b1
 a21 a22 . . . a2n   x2   b2 
    
2. Ax = b where A =  .. , x = and b = . .

.. .. .
 ..   .. 
   
 . . . 
am1 am2 . . . amn xn bm
Hence,     
a11 a12 . . . a1n x1 b1
 a21 a22 . . . a2n   x2   b2 
   
..   ..  =  .. 
 
 .. ..
 . . .  .   . 
am1 am2 . . . amn xn bm

3. x1 A1 + x2 A2 + . . . + xn An = b where Ai denotes the ith column of A.

   
R1 .x b1
 R2 .x   b2 
4.  ..  =  ..  where Ri denotes the ith row of the matrix.
   
 .   . 
Rm .x bm

II. Theorem Suppose A is an n × n invertible matrix, then the system Ax = b has the unique
solution x = A−1 b .

1
Proof.

III. Definition A homogeneous linear system is a system of the form Ax = 0. The vector x = 0
is always a solution to the homogeneous system Ax = 0, and is called the trivial solution. So
the system is always consistent.

III. Remark If u and v are solutions to Ax = 0, then the vector u + cv is another solution for
every scalar c.

You might also like