Mathematics-II (MATH F112) : Linear Algebra and Complex Analysis

Mathematics-II (MATH F112)
Linear Algebra and Complex Analysis
Sangita Yadav
Department of Mathematics
BITS Pilani, Pilani Campus, Rajasthan
Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 1 / 70

Course Structure
Instructor-Incharge: Dr. Trilok Mathur
Linear Algebra(20 Lec.): Dr. Jitender Kumar,Dr. Krishnendra

Shekhawat and Dr. Sangita Yadav
Complex Variables(20 Lec.): Dr. Trilok Mathur, Prof. Balram
Dubey and Dr. Ashish Tiwari
Quizzes: There will be four surprised quizzes of 20 marks
each to be conducted in tutorial classes and out of 4,
marks of best 3 quizzes will be considered.
Students are requested to write all the Quizzes in their
Registered Tutorial Section Only.

Assignments: Two assignments will be given for your
practice and does not require submission. However, some
of the Assignment Questions may be asked in
Mid-sem/Comprehensive examination.
Notices: All course notices will be posted on

NALANDA and Department Notice Board.
Chamber Consultation Hour: To be announced in your

tutorial section.

Text Book: For Linear Algebra

Systems of Linear Equations

Chapter: 2
System of Linear equations

Row Echelon Form
Elementary Row Operations
Gaussian Elimination Method
Reduced Row Echelon Form
Gauss-Jordan Row Reduction Method
Rank
Inverse of a Matrix

An Example for Motivation: Solve the system of
linear equations
x1 − 3x2 − x3 = 8
x1 − 2x2 − 2x3 = 3
3x1 − 7x2 − 4x3 = 17.
Step 1: Represent the given system of equations as

follows:
x1 − 3x2 − x3 = 8
 
1 −3 −1 8
x1 − 2x2 − 2x3 = 3 1 −2 −2 3 
3x1 − 7x2 − 4x3 = 17 3 −7 −4 17

Step 2: Multiply the first equation by 1 and subtract it
from the 2nd equation; Multiply the first row by 1
and subtract it from the 2nd row
x1 − 3x2 − x3 = 8
 
1 −3 −1 8
x2 − x3 = −5  0 1 −1 −5 
3x1 − 7x2 − 4x3 = 17 3 −7 −4 17
Step 3: Multiply the first equation by 3 and subtract it

from the 3rd equation; Multiply the first row by 3
and subtract it from the 3rd row
 
x1 − 3x2 − x3 = 8 1 −3 −1 8
x2 − x3 = −5  0 1 −1 −5 
2x2 − x3 = −7 0 2 −1 −7
Step 4: Multiply the second equation by 2 and subtract
it from the third equation; Multiply the second row
by 2 and subtract it from the third row
 
x1 − 3x2 − x3 = 8 1 −3 −1 8
x2 − x3 = −5  0 1 −1 −5 
x3 = 3 0 0 1 3
By Backward substitution, we find
x3 = 3, x2 = −2, x1 = 5
is a solution of the given system of equations.

Recall:
A vector is a directed line segment that corresponds
to a displacement from one point A to another
−→
point B. The vector from A to B is denoted by AB.
The point A is called its initial point or tail, and
the point B is called its terminal point or head.
The set of all ordered pair of real numbers is
denoted by R2 i.e. R2 = {(a, b) | a, b ∈ R}.
The set R2 corresponds to the set of vectors whose
tails are at the origin O.

For example, the ordered pair A = (1, 4) ∈ R2
−→
corresponds to the vector OA and we denote it as
[1, 4].
For n ∈ N, Rn is the set of all ordered n-tuples
(x1 , x2 , . . . , xn ), where xi ∈ R.
We can think the point (x1 , x2 , . . . , xn ) ∈ Rn as
vector and write it as [x1 , x2 , . . . , xn ] (row vector).
Thus,
Rn = {[x1 , x2 , . . . , xn ] | xi ∈ R} .

Sometime we will write a vector of Rn as a column
vector  
x1
 x2 
 .  = [x1 , x2 , . . . , xn ]T ,
 .. 
xn
depend on the situation.
The vector [0, 0, . . . , 0] of Rn , called the zero vector
of Rn and it is denoted by the symbol 0.

System of Linear Equations
A system of m linear equations in n unknown variables
x1 , x2 , . . . , xn is given by
a11 x1 + a12 x2 + · · · + a1n xn = b1

a21 x1 + a22 x2 + · · · + a2n xn = b2
.. .. .. ..
. . . .
am1 x1 + am2 x2 + · · · + amn xn = bm
where aij , bi ∈ R and 1 ≤ i ≤ m, 1 ≤ j ≤ n.
A solution of the linear system is an n-tuple

(s1 , s2 , . . . , sn ) such that each equation of the
system is satisfied by substituting si in place of xi .

Above linear system of equations can be written in the
form AX = B, where
     
a11 a12 . . . a1n x1 b1
 a21 a22 . . . a2n 
 , X = x.2  and B =  b.2 
   
A=  ... .
.. .
.. .
..   ..   .. 
am1 am2 . . . amn xn bm
The matrix A is called the coefficient matrix.

The matrix [A|B] which is formed by inserting the
column of matrix B next to the column of A, is
called the augmented matrix of the linear system
AX = B i.e.
 
a11 a12 . . . a1n b1
 a21 a22 . . . a2n b2 
[A|B] = 
 ... .. .. .. .. 
. . . . 
am1 am2 . . . amn bm
The vertical bar is used in the augmented matrix

[A|B] only to distinguish the column vector B from
the coefficient matrix A.
If B = 0 = [0, 0, · · · , 0]T i.e. b1 = 0 = b2 = · · ·
= bm , the system AX = 0 is called homogenous
system of equations.
If B 6= 0, then the system AX = B is called
non-homogenous system of equations.
The solution X = 0 of the system AX = 0 is called
the trivial solution and a solution other than X = 0
is called a non-trivial solution of the homogenous
system AX = 0.

Geometrical Approach:
x1 + x2 = 10
−x1 + x2 = 0
x1 = 5, x2 = 5
is the unique
solution, as lines
intersect at a
unique point.

x1 + x2 = 8
−2x1 − 2x2 = −16
This linear system

has infinitely many
solutions. Lines
intersect at every
point.

x1 − 2x2 = −3
2x1 − 4x2 = 8
This linear system has

no solution. Lines do
not intersect at any
point.

Example: Three equations in three variables. In this case
each equation determines a plane in the 3D space.

a unique solution. The
planes intersect at one
point.

infinitely many solu-
tions. The planes in-
tersect in one line.

no solution. There is
no point in common to
all three planes.

Number of Solutions to a system : There are three
possibilities for the size of the solution set
unique solution
infinitely many solutions
no solution
If the system AX = B has atleast one solution then it is
called a consistent system.
Otherwise it is called an inconsistent system.

We know that the solution of the system of linear
equations does not change if we
1 Multiply any equation by a non-zero scalar
2 Replace an equation by the sum of itself and a
scalar multiple of another equation.
3 Interchange any two equations
Elementary Row Operations: The following row
operations are called elementary row operations of a
matrix:
Multiply a row Ri by a nonzero constant c
(Ri → cRi )
Add a multiple of a row Rj to another row Ri
(Ri → Ri + cRj )
Interchange of two rows (Ri ↔ Rj )
Row Equivalent Matrices: Matrices A and B are said
to be row equivalent if there is a finite sequence of
elementary row operations that converts A into B or B
into A.
Example: Matrices
   
1 1 1 2 0 3
A = 2 0 3 and B = 3 1 4
0 1 1 1 2 2
are row equivalent.

Note: If a matrix A is row equivalent to a matrix B,
then B is row equivalent to A (Why ?).

Row Echelon Form (REF): A matrix A is said to be in
row echelon form if it satisfies the following properties:
1 The first nonzero entry (called the leading entry or
pivot) in each row is 1.
2 For each nonzero row, leading entry or pivot comes
to the right and below any leading entry of previous
rows.(The column containing a pivot element is
called a pivot column).
3 All zero rows are at the bottom.

The following matrices are in row echelon form:
   
1 −1 −1 0 1 −1 2 1
1 2 
, 0 1 3  , 0 0 1 4 8
0 1
0 0 1 0 0 0 0 0
If a matrix A is in row echelon form, then in each

column of A containing a leading entry, the entries
below that leading entry are zero.

The following matrices are not in row echelon form:
   
1 −1 −1 0 −1 −1 2 1
1 2 
, 0 0 1 , 1   0 5 10 8
2 1
0 1 3 0 0 0 0 0

Pivot Position: in a matrix is a location where a leading
1 (a pivot) appears in the row echlon form of the matrix.
Pivot: in a matrix is a nonzero number which is changed

into a leading 1 used to create zeros below the pivot.
Pivot row/column: in a matrix is a row/column that

contains a pivot position.

Example: Find Row Echelon form of the matrix
 
1 4 5 −9 −7
 −1 −2 −1 3 1 
A= 
 −2 −3 0 3 −1 
0 −3 −6 4 9

Step 1: Selecting Pivot column : Begin with the
leftmost nonzero column.
 
1 4 5 −9 −7
 −1 −2 −1 3 1 
A= 
 −2 −3 0 3 −1 
0 −3 −6 4 9
Step 2: Selecting Pivot Position: Select a
nonzero entry in the pivot column as a pivot. If
necessary interchange rows to move this entry into
the pivot position

Step 3: Use elementary row operations to create zeros
in all positions below the pivot.
 
1 4 5 −9 −7
−1 −2 −1 3 1  R2 →R2 +R1
−2 −3 0 3 −1 −
  −−−−−−→
R3 →R3 +2R1
0 −3 −6 4 9
 
1 4 5 −9 −7
0 2 4 −6 −6 
 
0 5 10 −15 −15
0 −3 −6 4 9

Step 4: Ignore the row containing the pivot position and
cover all rows, if any, above it.
Apply steps 1-3 to the remaining sub- matrix. Repeat the
process until there are no more nonzero rows to modify.
 
1 4 5 −9 −7
0 2 4 −6 −6 
 
0 5 10 −15 −15
0 −3 −6 4 9

 
1 4 5 −9 −7
0 2 4 −6 −6 
 
0 5 10 −15 −15
0 −3 −6 4 9
1
Make this pivot element to 1 by applying R2 → 2 R2
   
1 4 5 −9 −7 1 4 5 −9 −7
0 1 2 −3 −3  R3 →R3 −5R2 0 1 2 −3 −3
0 5 10 −15 −15 −
  −−−−−−→  
R4 →R4 +3R2 0 0 0 0 0
0 −3 −6 4 9 0 0 0 −5 0

 
1 4 5 −9 −7
0
 1 2 −3 −3
0 0 0 0 0
0 0 0 −5 0
Apply R3 ↔ R4 and make this pivot −5 to 1.

   
1 4 5 −9 −7 1 4 5 −9 −7
0 1 2 −3 −3  −R3 →− 15 R3 0 1 2 −3 −3
 −−−−→  
0 0 0 −5 0  0 0 0 1 0 
0 0 0 0 0 0 0 0 0 0
This is a row echelon form.

Remark:
Row echelon form of a matrix may not be unique.
 
0 −3 −6 4 9
−1 −2 −1 3 1 
A=
−2 −3 0 3 −1

1 4 5 −9 −7
Every matrix is row equivalent to its row echelon

form.

Equivalent Systems: Two system of m linear equations
in n variables are equivalent if and only if they have
exactly the same solution set.
Example: The systems
2x1 − x2 = 1 x1 + 4x2 = 14
and
3x1 + x2 = 9 5x1 − 2x2 = 4
are equivalent. (Why?)

Theorem
Let AX = B be a system of linear equations. If [C |D] is
row equivalent to [A|B], then the system CX = D is
equivalent to AX = B.
Gaussian Elimination Method: Use the following
steps to solve a system of equations AX = B
Write the augmented matrix [A | B].
Find a row echelon form of the matrix [A | B].
Use back substitution to solve the equivalent system

that corresponds to row echelon form.

Exercise: Solve the linear system of equations by
Gaussian elimination method
x1 + x2 + x3 = 3,
2x1 + 3x3 = 5,
x2 + x3 = 2.
Hint: The augmented matrix of the given system of

equations AX = B is
 .   .. 
1 1 1 .. 3 1 1 1 . 3
[A : B] = 2 0 3 ... ..
 R2 →R2 −R1 
5 −−−−−−→ 0 −2 1 . −1
 
. ..
0 1 1 .. 2 0 1 1 . 2

 .. 
1 1 1 . 3
R2 →− 12 R2 ..
−−−−−→ 0 1 − 12 . 1

2

..
0 1 1 . 2
 .. 
1 1 1 . 3
R3 →R3 −R2 ..
−−−−−−→ 0 1 − 12 . 1

2

..
0 0 32 . 3
2
 ..
1 1 1 . 3
R3 → 32 R3 ..
−−−−→ 0 1 − 12 . 1

2

..
0 0 1 . 1

Row echelon form of [A : B] is
 . 
1 1 1 .. 3
. 
0 1 − 12 .. 21 

.
0 0 1 .. 1
Corresponding system of equations
x1 + x2 + x3 = 3
1 1
x2 − x3 =
2 2
x3 = 1
By backward substitution, we find
x3 = 1, x2 = 1, x1 = 1
Exercise: Solve the linear system of equations
x1 +x2 +x3 = 3, x1 +2x2 +2x3 = 5, 3x1 +4x2 +4x3 = 12
by Gaussian elimination method.
Solution: The corresponding augmented matrix is

   
1 1 1 3 1 1 1 3
R →R −R1
1 2 2 5  −−2−−−2−−→ 0 1 1 2 
R3 →R3 −3R1
3 4 4 12 0 1 1 3
 
1 1 1 3
R3 →R3 −R2
−− −−−−→ 0 1 1 2
0 0 0 1
The REF of the augmented matrix is
 
1 1 1 3
0 1 1 2
0 0 0 1
x1 + x2 + x3 = 3
x2 + x3 = 2 .
0x3 = 1
The given system of equations is inconsistent.

Exercise: Solve the system of linear equations
x1 +x2 +x3 = 3, x1 +2x2 +2x3 = 5, 3x1 +4x2 +4x3 = 11
by Gaussian elimination method.
Solution: The corresponding Augmented matrix is
   
1 1 1 3 1 1 1 3
R2 →R2 −R1
1 2 2 5  −− −−−−−→ 0 1 1 2
R3 →R3 −3R1
3 4 4 11 0 1 1 2

R3 → R3 − R2 y

 
1 1 1 3
0 1 1 2 
0 0 0 0
The
 REF ofthe augmented matrix is
1 1 1 3
0 1 1 2 
0 0 0 0
x1 + x2 + x3 = 3
x2 + x3 = 2 .
0x3 = 0
By backward substitution, we find
x3 = a, x2 = 2 − a, x1 = 1

Independent and dependent variables:
Consider the linear system AX = B in n variables
and m equations.
Let [C | D] be a row echelon form of the augmented
matrix [A | B].
The variables corresponding to the pivot columns in
the first n columns of [C | D] are called the
dependent (or basic) variables.
The variables which are not dependent are called
independent (free) variables.

Reduced Row Echelon Form (RREF): A matrix A is
said to be in reduced row echelon form if it satisfies the
following properties:
A is in row echelon form.
If a column contains a leading entry (or pivot) then
all other entries in that column must be zero.
Example: The following matrix are in reduced row
echelon form
   
1 0 0 0 1 0 2 1
1 0 
, 0 1 0 , 0 0 1 4 8
0 1
0 0 0 0 0 0 0 0

Result:
Every matrix has a unique reduced row echelon
form.
Matrices A and B are row equivalent if and only if

they have same reduced row echelon form.

Gauss-Jordan Row Reduction Method: Use the
following steps to solve a system of equations AX = B
Write the augmented matrix [A | B].
Find the reduced row echelon form of the matrix

[A | B].
Use back substitution to solve the equivalent system

that corresponds to row echelon form.

Exercise: Solve the system of linear equations equations
x1 + x2 + x3 = 5, 2x1 + 3x2 + 5x3 = 8, 4x1 + 5x3 = 2
by Gauss-Jordan method.
Solution: The
  corresponding
 augmentedmatrix is
1 1 1 5 1 1 1 5
R2 →R2 −2R1
2 3 5 8− −−−−−−→ 0 1 3 −2 

R3 →R3 −4R1
4 0 5 2 0 −4 1 −18

 
1 0 −1 7
R3 →R3 +4R2
−−−−−−−→ 0 1 3 −2 
R1 →R1 −R2
0 0 13 −26
 
1
R3 = 13 R3
1 0 −2 7
−−−−−→  0 1 3 −2
0 0 1 −2
 
1 0 0 3
R1 →R1 +2R3
−−−−−−−→ 0 1 0 4
R2 →R2 −3R3
0 0 1 −2

The RREF of the augmented matrix is
 
1 0 0 3
0 1 0 4 
0 0 1 −2
Corresponding system of equations is
x1 = 3
x2 = 4
x3 = −2
The solution is x1 = 3, x2 = 4 and x3 = −2.

4x2 + x3 = 2, 2x1 + 6x2 − 2x3 = 3, 4x1 + 8x2 − 5x3 = 4
Answer: Infinitely many solutions and solution set is

7 1 1
d, − d, d | d ∈ R .
4 2 4

x1 + 2x2 − 3x3 = 2,
6x1 + 3x2 − 9x3 = 6,
7x1 + 14x2 − 21x3 = 13
Answer: No solution.

Question: Whether there are conditions under which
the linear system AX = B is consistent?
Rank: The rank of a matrix A is the number of non-zero

rows in its row echelon form. It is denoted by rank(A).
Remark: The number of non-zero rows in either the row

echelon form or the reduced row echelon form of a
matrix are same.

 
1 2 1
Exercise: Determine the rank of A = 2 3 1 .
1 1 0
Solution: REF of A is
 
1 2 1
0 1 1
0 0 0
No. of nonzero rows is 2.
rank(A) = 2.

Theorem: Let AX = B be a system of equations with n
variables.
1 If rank(A) = rank([A | B]) = n then the system
AX = B has a unique solution.
2 if rank(A) = rank([A | B]) < n then the system
AX = B has a infinitely many solutions.
3 If rank(A) 6= rank([A | B]) then the system AX = B
is inconsistent.

Theorem: Let AX = 0 be a homogenous system of
equations with n variables.
1 If rank(A) = n then the system has a unique
solution (trivial solution).
2 If rank(A) < n then the system AX = B has
infinitely many solutions.

Exercise: Test the consistency of the given system of
equations 3x1 + x2 + x4 = −9
−2x2 + 12x3 − 8x4 = −6
2x1 − 3x2 + 22x3 − 14x4 = −17.
Find all the solutions, if it is consistent.
Solution: The Augmented matrix and its REF is given by
1 13 0 13 −3
   
3 1 0 1 −9
REF
 0 −2 12 −8 −6  − −→  0 1 −6 4 3 
2 −3 22 −14 −17 0 0 0 0 0
Solution set={(−4 − 2a + b, 3 + 6a − 4b, a, b), a, b ∈ R}

Exercise: For what value of k ∈ R, the following system
of equations is inconsistent
kx1 + x2 = 0,
x1 + kx2 = 1.
Answer: k = ±1

Exercise: For what value of k ∈ R, the following system
of equation has (i) a unique solution (ii) infinitely many
solutions and (iii) no solution
x1 − x2 + 2x3 = 0
−x1 + x2 − x3 = 0
x1 + kx2 + x3 = 0.
Also find the solutions, whenever they exist.

Solution:
(i) k 6= −1, x1 = x2 = x3 = 0
(ii) k = −1, The solution set is {(a, a, 0) : a ∈ R}
(iii) No value of k

Exercise: For what value of λ ∈ R, the following system
of equation has (i) a unique solution (ii) infinitely many
solutions and (iii) no solution
(5 − λ)x1 + 4x2 + 2x3 = 4

4x1 + (5 − λ)x2 + 2x3 = 4
2x1 + 2x2 + (2 − λ)x3 = 2.
Also find the solutions, whenever they exist.

Solution: The augmented matris has the REF as for
λ 6= 1, 10
1 1 2−λ
 
2 1
0 1 −2 0 
2
0 0 1 10−λ
(i) Unique solution for λ 6= 1, 10 and the solution is
4 4 2
x1 = , x2 = , x3 =
10 − λ 10 − λ 10 − λ
(ii) Infinitely many solutions for λ = 1 and the solution
set is
b
{(1 − a − , a, b) : a, b ∈ R}
2
(iii) No solution for λ = 10.
Definition: Let A be an n × n matrix. Then an n × n
matrix B is said to be a (multiplicative) inverse of A if
and only if
AB = BA = In ,
where In is the n × n identity matrix.
• If such a matrix B exists, then A is called nonsingular.
• If there exists no such matrix B, then A is called
singular.
1 4
Example: Show that the matrix A = is
2 9
nonsingular.
9 −4
Solution: For B = , we have AB = BA = I2 .
−2 1

Theorem
Let A and B be n × n matrices.
If AB = In then BA = In .
If BA = In then AB = In .
Theorem
Inverse of a matrix is unique if it exists.
As the inverse of a matrix A is unique, we denote it by
A−1 . That is, AA−1 = A−1 A = I .

Theorem
Let A and B be an n × n nonsingular matrices. Then
(A−1 )−1 = A.
(AB)−1 = B −1 A−1 .
(AT )−1 = (A−1 )T .
Question:
How can we know when a matrix has an inverse?
If a matrix does have an inverse, how can we find it?

Method for finding the Inverse of a matrix (if it
exists): Let A be a given n × n matrix.
Step 1: Write the augmented matrix [A | In ].
Step 2: Transform the augmented matrix [A | In ] to the

matrix [C | D] in reduced row echelon form via
elementary row operations.
Step 3: If
C = In then D = A−1 .
C 6= In then A is singular and A−1 does not exist.

Exercise:
 Usingrow reduction method, find the inverse
1 1 1
of A = 1 2 3, if it exists.
0 1 1
Hint: Note that reduced row echelon form of the matrix
[A|I3 ] is
 
1 0 0 1 0 −1
 0 1 0 1 −1 2 
0 0 1 −1 1 −1
 
1 0 −1
Thus, A−1 =  1 −1 2 
−1 1 −1

Theorem
Let A be an n × n matrix. The following statements are
equivalent:
A is nonsingular.
AX = B has a unique solution for every B ∈ Rn .
AX = 0 has only the trivial solution.
The reduced row echelon form of A is In .
rank(A) = n.

Thank You

Mathematics-II (MATH F112) : Linear Algebra and Complex Analysis

Uploaded by

Copyright:

Available Formats

Mathematics-II (MATH F112) : Linear Algebra and Complex Analysis

Uploaded by

Document Information

Original Description:

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

Mathematics-II (MATH F112) : Linear Algebra and Complex Analysis

Uploaded by

Copyright:

Available Formats

Mathematics-II (MATH F112)

Linear Algebra and Complex Analysis

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 1 / 70

Linear Algebra(20 Lec.): Dr. Jitender Kumar,Dr. Krishnendra

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 2 / 70

Notices: All course notices will be posted on

Chamber Consultation Hour: To be announced in your

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 3 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 4 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 5 / 70

System of Linear equations

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 6 / 70

Step 1: Represent the given system of equations as

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 7 / 70

Step 3: Multiply the first equation by 3 and subtract it

By Backward substitution, we find

is a solution of the given system of equations.

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 9 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 10 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 11 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 12 / 70

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

where aij , bi ∈ R and 1 ≤ i ≤ m, 1 ≤ j ≤ n.

A solution of the linear system is an n-tuple

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 13 / 70

The matrix A is called the coefficient matrix.

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 14 / 70

The vertical bar is used in the augmented matrix

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 16 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 17 / 70

This linear system

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 18 / 70

This linear system has

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 19 / 70

This linear system has

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 20 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 21 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 22 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 23 / 70

are row equivalent.

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 25 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 26 / 70

If a matrix A is in row echelon form, then in each

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 27 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 28 / 70

Pivot: in a matrix is a nonzero number which is changed

Pivot row/column: in a matrix is a row/column that

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 29 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 30 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 31 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 32 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 33 / 70

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 34 / 70

Apply R3 ↔ R4 and make this pivot −5 to 1.

This is a row echelon form.

Every matrix is row equivalent to its row echelon

Sangita Yadav (BITS Pilani) Math-II (System of Linear Equations) 36 / 70

Example: The systems