Lesson Plan for the course Linear Algebra.

After introducing each concept, we workout a typical and important

exercises in the class. We may leave out the worked out examples in the
text books for the students to study and understand on their own.
For the course we will follow the fifth (global) edition of the book
Linear Algebra And Its Applications by David C Lay, Stephen R Lay
and Judi R Macdonald.
The book criss crosses with various concepts of Linear Algebra.
Therefore, while discussing each topic, we need to tell the students the
section in which the topics appear.

Module 1: Introduction to Matrices

The first module is Introduction to Matrices The title of the module is a
misnomer. As we all know, Linear Algebra is about solving system of
linear equations and studying the geometric and algebraic properties of
their solutions and the applications in other fields of Science and
Engineering. Therefore, we may rearrange the topics listed in module 1.
1. Section 1.1 starts with examples the students have learned in two
dimensional geometry, viz, lines, intersection of two lines, parallel
lines in R2, planes, intersection of planes, parallel planes in R 3. The
students will feel comfortable when we start with these examples. We
may then recall the equations they learned and how they solved by the
process of elimination of variables. This will help us when we
introduce row operations on matrices.
Next we introduce system of m-linear equations in n-variables.
We write it down in matrix notation, bringing in coefficient matrix
and the Augmented matrix of a system of linear equations, first
writing down in two/three variables and then for general n.
Example 1 in page 5 illustrates the elimination of variables and the
corresponding row operation in the matrix notation. This will bring us
into row operations, that may be stated. We may also define row
equivalence of matrices.
Next we discuss the important question in mathematics when we
study equations, namely existence and uniqueness. We will take up
and address this through row operations of matrices, Examples 2 and
3 discuss this. However we can take up problems from “Practice

1
 Problems” or Exercises 1.1. Hint for Practice problems are at the
end of the section.
In exercises Set 1.1 in page 10, the problems 1, 2 and 3 to be solved
using elementary row operations; one of them may be done in the
class. Exercises 5, 6 , 7, 8 and 10 may be given as exercise; this
will introduce them to graded exercise pattern. One of them may be
done in the class. We may make a choice of couple of exercises
from 11-14. Exercises 15 and 16 are about finding if system of linear
equations is consistent or inconsistent without completely solving
them. One of them may be given as exercise. The exercises 17 and 18
and one exercise from among 19-22 may be discussed leaving the rest
of them to students.
True/False: 23 or 24 may be discussed in the class.

A selection of exercises 25-28 may be given to students. In exercises

29-32, two matrices are given with the second obtained after
performing a row operation. The reader is expected to find the row
operation and the reverse row operation. One of them may be worked
out leaving the rest as exercises. Exercises 33 and 34 may be
discussed in the class.
2. Since we have introduced matrix notation and row operation, we may
now define echelon form and row reduced echelon form of a matrix.
This is done in pages 12-17 with row reduction algorithm with an
example, namely Example 3 in page 15. Solutions of system of linear
equations as applications is explained with an example in pages 18-
19. We may leave the example to the students and take one problem
from the exercises 7-14 to workout in the class.
State the uniqueness of row reduced echelon form of matrix- no proof.
This is Theorem 1 in page 13. Statement of Theorem 2 without proof
on existence and uniqueness needs to be done.
While working out problems, we may introduce pivot positions and
the algorithm for reduced (row) echelon forms.
Discuss one or two problems in the class. There are some examples
worked out in the book. We may take one of them leaving rest of the
examples to the students.
Exercises 1.2 in page 21. In exercises 1 and 2 matrices are given
asking the readers to determine which of them are in echelon form
and which of them are in reduced echelon form. We may discuss one
in the class encouraging the students to solve the rest.
2
 Exercises 3, 5, 7, 11, 13, 15(a), 16(b), 19, 23, 29 and 33 may be given
to students. True/False questions 21 and 22 are must for the students.
Once we finish, reduced echelon form of a matrix, we may define the
rank of a matrix. However at this stage we may not able to do much
about rank. We may revisit later, when we do linear dependence and
independence.
3. We may now define matrix multiplication(Discussed in Section 2.1 in
the pages 95-102 of Chapter 2 ) and bring out the fact that elementary
row operations correspond to multiplication by “elementary”
matrices, a concept we may define at this time.
Matrix multiplication as done in the book is very good and this way
of doing makes it easy for everyone to understand and carry out
matrix multiplication with ease. This may be discussed well with
some examples worked out in row-column form.
All the matrix operations are discussed in Section 2.1 of Chapter 2 with
nice examples worked out. We may leave examples for the students and
choose from the exercises to workout in the class.
Practice problems may be explained and left to the students as the
solution is available at the end of the section in the book itself.
The exercises for matrix operations are 1, 2, 4, 5, 7, 9, 12, 13, 15/16,
18, 20, 21, 23, 25,
27 and 31.
4. Next we come to discuss inverse of matrix: This is done in section 2.2
( starting at page 104) Definition, examples. How invertibility of a
matrix helps in solving a system of linear equations.

Elementary matrices as invertible matrices. A matrix A is invertible

iff A is row equivalent to In. Algorithm to find inverse of a matrix A.
We may state Theorem 8 in page 114 characterizing the invertible
matrices and explain its importance- No Proof.
Exercises from Exercise Set 2.2 (Page 111): Exercises 2, 3 to find
inverses of 2 × 2
matrices. Exercises 6, 7, 8, 9, 10, 12, 15, 19, 23, 25, 26, 29, 32, 34,
35 and 37.
We may do: if A and B are n×n matrices and AB is invertible, then
both the matrices
A and B are invertible. If a matrix A has two identical rows, then A
is not invertible.
3
 5. LU Factorization of a matrix. Having done invertible matrices, we
can go to LU factorization: Section 2.5 starting at page 125. Before
going in to the theoretical or construction of L and U, first we need to
explain how this factorization is helpful in solving system of linear
equations and work out an example. Example 1 of page 127 may be
done. Next we discuss an algorithm for LU factorization for which an
algorithm is stated in page no. 128.
We may discuss some applications given in the book.
Exercises 2.5 in page 131. Exercises 1, 4, 5, 6 to solve the equation
Ax = b using the LU factorization given for the matrix A.
Exercises 7, 10, 11, 14 and 16 for finding the LU Factorization.
Exercises 19, 21, 22.
6. Determinants and Cramer’s rule: Chapter 3, Section 3.1
Determinants starting at Page 166. Definition and examples, simple
properties and exercises from sections 3.1 and 3.2
Exercises for section 3.1: Exercises 1, 3, 6, 8. In the set of exercises
9-14, the students are trained to choose a row or column with
maximum number of 0’s to calculate the determinant. We may give a
couple of problems from among these. Exercises 19-24 explores the
effect row operations on calculating the determinant of a matrix. We
should give few exercises from this set. The following exercises may
also be given 25, 31, 34, 35, 37, 39 and 40.
Exercises for section 3.2 on properties of determinants. 2, 3, 5, 8, 10,
11, 15, 18, 19, 27, 28, 31, 32, 35 and 39.
Cramer’s rule(section 3.3, pages 179-183) : Theorem 7 Statement and
proof of Cramer’s rule be done. Theorem 8, a formula for finding A−1
of a matrix A; only statement. We shall explain Theorem 9 for 2 × 2
matrices. Application in solving equations may be discussed.
Exercises from 1-18 in Exercises 3.3: 1, 4, 5, 7, 10, 13 and 18.
Students may be encouraged to solve exercises from supplementary set
of exercises.

Module2: Vector Spaces

We may restrict ourselves to vector spaces over R and C without getting in
to definition of fields.
1. We start with definition and examples. This is discussed in
Section 4.1 of Chapter 4 starting at Page no. 192. The book starts
with definition and goes on to give examples of Rn, the set of
4
 polynomials of degree at most n for a fixed n ≥ 2 etc.,. We need
not discuss example 3 of the book.

The most important example of a vector spaces is the set of solutions

of a homogeneous system of linear equations. We should discuss this.
In fact any finite dimensional vector space is a set of solutions of
homogeneous system of linear equations. We need not tell this to the
students at present.
In the Exercise set 4.1, we need not do exercises 1-3. We may
explain why a line in R2 not passing through origin is not a vector space.
We can connect with the set of solutions of non-homogeneous and
make a general statement also. Exercises 7, 8, 23 and 24.
Since Rn is an important example of a vector space, we may state the
definition of a subspace and show that the set of solutions of a
homogeneous system of linear equations is also a subspace of Rn for
appropriate n. In the exercises for sub-spaces, we may make a
selection of problems in the exercises set 4.1.
2. Linear dependence and independence is discussed in Section 4.3 of
Chapter 4 starting at Page no. 210. However the concept of linear
dependence and independence of vectors in Rn is discussed in Section
1.7 of Chapter 1 starting at page 56. Therefore we may start the
definition for vectors in Rn and move on to general V . The examples
and exercises in section 1.7 will help the students in understanding
general V . Theorem 7 of section
1.7 may be explained with examples- NO PROOF. Theorem 8 of
section 1.7 needs to be done.
Before defining the linear dependence and independence, we may take a
set of three vectors in R3 and discuss if there is non-trivial relation
among the vectors. This will set the stage for the definition of linear
dependence and independence of a vectors in a vector space.
Exercises: In Exercise set 1.7, we may give 2, 4, 6, 8, 10, 14, 16, 20,
21, 22, 24, 26, 29, 30, 36, 38 and 40.
Linear combination of vectors and linear span of vector in Rn is
discussed in Section 1.3 of the book before discussing linear
dependence and linear independence of vectors in Rn. We may explain
this with some geometric examples in R 2 and R3 and discuss the
examples 5 in page 28 and example 6 in page 31. As exercises, we
may give problems 2 and 3 of practice problems in page 32. Exercises
16, 18, 23 and 24 of the exercise set in page no. 33.

5
3. Basis and dimension:
Next we come to the definition of basis of a vector space. This is
done section 4.3 in page no.210. After the definition, we discuss
some examples. We must emphasis the fact that a basis is a minimal
spanning set and a maximal linearly independent set. This is very
important. Example 10 in page 215 illustrates this and we may
discuss. This is also an occasion for us to construct a basis for the set of
solutions of homogeneous system and connect it with rank of a matrix
when we come to dimension.
Practice problems 1, 2 and 3 are for the students to try. In the
exercises set 4.3, we may choose a couple of exercises from 1-8, 10,
12, 16, 20, 21 and 22.
Dimension of vector space is done in section 4.5 starting at page no.
227. Let us confine ourselves to finite dimensional vector spaces
alone.
Dimension of the standard examples may be worked out. As
mentioned earlier, rank of a matrix and dimension of the set of solutions
of homogeneous system of linear equation may be discussed.
Exercises in 4.5: Couple of them from 1-6, 8, 14, 19 and 20.
4. Linear Transformations is done in section 4.2 in page no. 200. We
may emphasize on linear transformations from Rn to Rm. This is done
in Sections 1.8 and 1.9 starting at page 63.
One of the important thing that students should learn at this stage
is that , if A is a m × n matrix, it defines linear transformation from
Rn → Rm. In section 1.9, some of the linear transformations are
explained with pictures. We may explain some of them and leave the
rest to the students.
The exercises in these sections are also good. I am listing below some
of the exercises, we may discuss and give as exercises to the students.
Exercises in section 1.8: 2, 4, 5, 7, 10, 12, 20, 21, 22, 23, 24, 34 and
35. Exercises in section 1.9: 2, 4, 6, 12, 16, 18, 22, 23 and 24.
Since we are not going to discuss rank-nullity theorem, we may
discuss some examples and give some exercises.

6
Module 3: Eigenvalues and Eigenvectors
These concepts are discussed in Chapter5

1. We now move to third module Eigenvalues and Eigenvectors. These

are discussed in Chapter 5 of the book starting at page no. 267.
We may emphasize the concepts for matrices so that students will be
comfortable working.
2. Eigenvalues and Eigenvectors are discussed in section 5.1. Explain the
concepts geometrically and work out a couple of problems. One from
examples and other from the exercise set. The result on the eigenvalues
of triangular matrices are important and that is discussed in Theorem 1.
Theorem 2 on the linear independence of eigenvectors corresponding
distinct eigenvalues may be stated without proof; however we should
give a couple of examples.
Exercises for section 5.1: 2, 4, 10, 12, 14, 18, 20, 21, 22, 24 and 29.
3. We may state Cayley-Hamilton Theorem in section 5.2 (Only
Statement- NO PROOF). Before the statement of the theorem, we
need to discuss characteristic equation with a couple of examples.
Exercises section 5.2: 2, 4, 8, 10, 14, 16, 20, 21 and 22.
4. Diagonalization. This is discussed in section 5.3 in page no. 283.
After the definition, we may give examples and state the result on the
necessary and sufficient conditions for diagonalization of a matrix.
Theorem 5. Proof need not be given. Instead the importance of this
result needs emphasis.
The algorithm for diagonalizing a matrix is illustrated with Example 3
in page no. 285. This may be discussed thoroughly. At this point we
may explain as to how one can compute the powers of diagonalizable
matrices with examples and theory.
Exercises: 2, 4, 6, 10, 16, 20, 21, 22 and 24.
Symmetric matrices and Diagonalization of a symmetric matrix A.
(Chapter 7 Page 396)
Quadratic form associated to a symmetric matrix A. (Chapter 7 Page
396) This has application to constrained optimization. Are we going
to do that?

7
 Module 4: Inner Product Spaces
This is discussed in Chapter 6 of the book. Sections 6.1 and 6.2 cover the
subject matter of the syllabus, starting at page no. 331.
1. Definition and Examples. Dot product on Rn as the most important
example. Length, distance. We workout some examples. We may
illustrate one example of an inner product on R 2 that is not dot
product.
In section 6.1, we may skip the various relations between row space,
column space and their orthogonal complements of matrix.
Geometric applications: Pythagoras Theorem, parallelogram law etc.,
are done in section 6.1
Exercises for section 6.1: 2, 4, 6, 8, 10, 16, 18, 19, 20, 22, 24, 26 and
30. Exercises for section 6.2: 4, 6, 8, 14, 20, 22, 23, 24, 29 and 30.
2. Cauchy-Schwarz inequality. This is done in section 6.7. Using
Cauchy-Schwarz, we may prove that the distance in R n satisfies
triangle inequality.
Use Cauchy-Schwarz to define angle between two vectors.

Module 5: Singular Value De-composition(Gram-

Schmidt Orthogonalisation process)
Gram Schmidt orthogonalization is done in section 6.7. We need to
explain the geometry of Gram-Schmidt orthogonalization process and
encourage the students to write the formula in dimensions 2 and 3. This
will help them in not memorizing the formula.
The exercises in this section involves inner product on polynomials and
continuous functions on [0, 1]. We may ask them to apply Gram-Schmidt
process to the set {1, t, t2} rather than giving arbitrary polynomials.
For singular value decomposition, we may start with the example
discussed in the book in section 7.4 to explain the geometry. Then we
may explain Theorem 9 in page 418. Then we may state Theorem 10 on
singular value decomposition and explain the method with an example
possibly a well chosen problem from exercise set.
Application part may be done, if we have time.
Exercises: 2, 4, 8, 12, 17, 18, 19, 20 and 22.