Lecture 02
Lecture 02
Lecture 02
• Don’t just read it! Ask your own questions, look for your own
examples, discover your own proofs. Is the hypothesis necessary? Is
the converse true? What happens in the classical special case?
Where does the proof use the hypothesis?
[Paul Halmos]
• ”for example” is not a proof.
[Jewish proverb]
• F is either Q, R or C.
• Mm×n (F) the set of all m × n matrices with entries from F
• For i = 1, · · · , n, let ei ∈ Mn×1 (F) be such that its i-th entry is 1
and other entries are 0. The column vector ei is called i-th basic
column vectors.
0
..
.
0
t
ei = [0, · · · , 0, 1, 0, · · · 0] =
1
0
..
.
0
Proposition
Let A := [aij ] ∈ Mm×n (F), and let e1 , . . . , en ∈ Mn×1 (F) be the basic
column vectors. Then, for k = 1, . . . , n,
a1k
..
.
ajk , which is the k-th column of A.
A ek =
..
.
amk
Corollary
A = B if and only if Aek = Bek for each k = 1, . . . , n.
Proposition
1 Associative law: For A ∈ Mm×n (F), B ∈ Mn×p (F), C ∈ Mp×k (F), we
have A(BC ) = (AB)C .
2 Distributive law: (1) For A, B ∈ Mm×n (F) and C ∈ Mn×p (F) we
have
(A + B)C = AC + BC .
(2) For A, B ∈ Mn×p (F) and C ∈ Mm×n (F) we have
C (A + B) = CA + CB.
3 For A ∈ Mm×n (F), B ∈ Mn×p (F) and α ∈ F we have
(αA)B = α(AB) = A(αB).
Proof: Exercise
α1 · x1 + · · · + αk · xk
Example
Recall the basic column vectors e1 , e2 , · · · , en ∈ Mn×1 (F).
t
For b = b1 · · · bk · · · bn ∈ Mn×1 (F), we get
b = b1 · e1 + · · · + bk · ek + · · · + bn · en .
That is b is a linear combination of e1 , . . . , en .
Shiv Prakash Patel, IIT Dharwad Linear Algebra: Lecture 02
Linear combination of vectors, contd....
Proposition
Let A ∈ Mm×n (F) and B ∈ Mn×p (F). Then
1 The i-th row of AB is a linear combination of the n row vectors of B
with coefficients ai1 , . . . , ain provided by the i-th row of A.
2 The j-th column of AB is a linear combination of the n column
vectors of A with coefficients b1j , . . . , bnj provided by the jth column
of B.
(1) Let AB = [cij ] and Rk be the k-th row of B. Then we want to show
ci1 ci2 . . . cip = ai1 R1 + ai2 R2 + · · · + ain Rn .
On the other hand, the j-th entry of ai1 R1 + ai2 R2 + · · · + ain Rn equals
Example
1 6 0 2
2 1 −1
Let A = and B = 2 −1 1 −2. Then
0 3 1
2 0 −1 1
2 11 2 1
AB = .
8 −3 2 −5
We have
2 11 2 1 = 2 1 6 0 2 + 1 2 −1 1 −2
−1 2 0 −1 1 ,
11 2 1 −1
= 6 −1 +0 , etc.
−3 0 3 1
.
Ax = b
2x1 + 2x2 = 4
x1 + x2 = 1
x1 − x2 = 0
x1 + x2 = 1
2x1 + 2x2 = 2
x1 + x2 = 1
Proposition
Consider the homogeneous linear system Ax = 0. If r ∈ N and x1 , . . . , xr
are solutions of such a system, then so is their linear combination
α1 x1 + · · · + αr xr for any α1 , . . . , αr ∈ F.
Proof:
A(α1 x1 + · · · + αr xr ) = α1 Ax1 + · · · + αr Axr
= α1 0 + · · · + αr 0
= 0
Proposition
Consider the system of equations Ax = b with a particular solution x0 .
Let S denote the set of all solutions of the corresponding homogeneous
linear system Ax = 0. Then, the set of all solutions of Ax = b is given by
{x0 + s : s ∈ S}
A(x − x0 ) = Ax − Ax0 = b − b = 0
x1 − x2 + x3 = b1
x2 + x3 = b2
x3 = b3
Solution:
x3 = b3
x2 = b2 − x3 = b2 − b3
x1 = b1 + x2 − x3 = b1 + b2 − 2b3
In this case, the homogeneous system Ax = 0 has only the zero solution
and the general system Ax = b has a unique solution.
x1 − x2 + x3 = 0
−x1 + x2 − x3 = 0
10x2 + 25x3 = 90
20x1 + 10x2 = 80.
x1 − x2 + x3 = 0
0 = 0
10x2 + 25x3 = 90
30x2 − 20x3 = 80.
Eliminating x2 from the 4th equation, and then interchanging the 3rd
and the 4th equations,
x1 − x2 + x3 = 0
10x2 + 25x3 = 90
−95x3 = −190
0 = 0.
Subtracting 20 times the first row from the 4th row, and adding the first
row to the second row, we obtain
Shiv Prakash Patel, IIT Dharwad Linear Algebra: Lecture 02
Revisit example
x1 − x2 + x3 = 0
−x1 + x2 − x3 = 0
10x2 + 25x3 = 90
20x1 + 10x2 = 80.
Subtracting 20 times the first row from the 4th row, and adding the first
row to the second row, we obtain