Scribd
Upload
8 views

Note1a P

1) Linear systems of equations can be represented by matrices and solved using row reduction operations to put them into reduced row echelon form. 2) There are three possibilities when solving a linear system based on the reduced row echelon form: no solution, a unique solution, or infinitely many solutions. 3) If a row has a leading 1 as the last entry, the system is inconsistent and has no solution. Otherwise, it may have a unique solution if all variables are pivots, or infinitely many solutions if there are free variables.

Uploaded by

Marko creates
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
8 views

Note1a P

1) Linear systems of equations can be represented by matrices and solved using row reduction operations to put them into reduced row echelon form. 2) There are three possibilities when solving a linear system based on the reduced row echelon form: no solution, a unique solution, or infinitely many solutions. 3) If a row has a leading 1 as the last entry, the system is inconsistent and has no solution. Otherwise, it may have a unique solution if all variables are pivots, or infinitely many solutions if there are free variables.

Uploaded by

Marko creates
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/ 8

Linear Algebra: Section 1.1 & 1.

Linear Algebra 1.1 & 1.2


Chapter 1 Linear Equations

Objective: Identify and learn how to solve linear systems


Remark Solving (large) linear systems is very important in many branches
of study and research. Read the introduction of Chapter 1, 1.6, 1.10.
Concepts:

A linear equation, a linear system - coefficients, variables.


√
Example: 3x1 + 4x2 − ex3 = π.
General form: a1 x1 + · · · + an xn = bn .
Example of non-linear equations: x2 + x + 2 = 0, sin x + cos x = 1.
Examples and graphical representation in R2 .
Basic questions: find a solution/all solutions if it exists/they exist.
A system is consistent if there is at least one solution; else it is
inconsistent.

Linear Algebra 1.1 & 1.2


Examples

Chicken and rabbits problem


Question In a farm (of McDonald?), there are x1 chicken and x2 rabbits.
A head count and leg count of the animals are 20 and 50, respectively.
How many chicken and rabbits are there?
Solution Set up the (linear) equations: x1 + x2 = 20, 2x1 + 4x2 = 50.
Subtracting 2 times the first equation from the second one, we see that
2x2 = 10. So, x2 = 5. By equation 1, x1 = 15.

More Questions (Consistent or inconsistent?)

Find the intersection of the lines x1 + x2 = 20 and 2x1 + 4x2 = 50


on the (x1 , x2 )-plane or R2 ?
What about the intersection of x1 + x2 = 20 and 2x1 + 2x2 = 50?
What about the intersection of x1 + x2 = 20 and 2x1 + 2x2 = 40?

Linear Algebra 1.1 & 1.2


Matrix notation

Consider the following linear system and the corresponding augmented


matrix:
 
x1 − 2x2 + x3 = 0 1 −2 1 0
2x2 − 8x3 = 8 0 2 −8 8 
−4x1 + 5x2 + 9x3 = −9 −4 5 9 −9

Taking away the last column, we have the coefficient matrix of the
system.  
1 −2 1
0 2 −8
−4 5 9

Linear Algebra 1.1 & 1.2


Row reduction of a matrix

Elementary row operations


1 Adding/subtracting a multiple of a row from another one.
2 Interchange two rows.
3 Multiply a row by a nonzero number.

Remark One may also reduce the augmented matrix to reduced row
echelon form so that the leading one in each row is the only nonzero
entry in its column.
Study Examples 1, 2, 3. (p.5–8.) Practice problems # 1 – 4. (p.9.)

Linear Algebra 1.1 & 1.2


No solution, one solution, infinitely many solutions

In the row echelon form, we can identity: leading ones, pivot


entries/positions, pivot columns, basic variables.
The rest are non-pivot columns, free variables.
h i
Example: 10 10 11 17 Leading ones at (1, 1), (2, 3) positions.
Pivot columns: 1, 3. Basic variables: x1 , x3 .
Three possibilities in the row echelon form.
1. Inconsistent, i.e., no solution - there is a row with the last entry
as a leading one.
2. Consistent. No row with the last entry as a leading one.
2a. One solution - No free variables.
2b. Infinitely many solutions - There are free variables.
In 2), we can find solutions using back substitution and write down
the solutions in parametric form in 2b.

Study Examples 4, 5. (p. 18–20.) Practice Problems 1 and 2. (p.21.)


Linear Algebra 1.1 & 1.2
Reduced Row Echelon Form

One can also use elementary operators to reduce an augmented


matrix to reduced row echelon form so that the leading ones are the
only nonzero entries in their columns.
h i h i
Example: 10 11 17 → 10 01 −6 7
. So, x2 = 7, x1 = −6.

h i h i
Example: 10 10 11 17 → 10 10 01 −6 7
.

So, x3 = 7, x2 = t with t ∈ R, and x1 = −6 − t.


In practice, back substitutions is more efficient.
Echelon forms of an augmented matrices may be different:
h i h i
Example: 21 11 07 → 20 1/21 0
7
. So, x2 = 14, x1 = −14/2 = −7.
h i h i h i
2 1 0 1 1 7 1 1 7
1 1 7
→
2 1 0
→
0 1 14
; x2 = 14, x1 = 7 − (14) = −7.

Reduced row echelon form is unique. (Proof? Extra Credits!)

Linear Algebra 1.1 & 1.2


Summary

Suppose a linear system is given.


Write down the augmented matrix.
Apply row reductions to get the (reduced) row echelon form.
Three cases:
(1) (Inconsistent) There is a row [0, · · · , 0, b] for a nonzero b. Then the
system has no solution.
(2) (Consistent) Condition (1) does not happen.
(2.a) Every variable is a leading/pivoting variable.
Then there is a unique solution determined by back substitution.
(2.b) There are non-leading / non-pivoting variables (columns).
There will be infinitely many solutions.
One can express the solutions in parametric form in terms the free
variables by back substitutions.

Linear Algebra 1.1 & 1.2

You might also like