0% found this document useful (0 votes)
25 views

Lecture 17-18

Uploaded by

anutyo
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
0% found this document useful (0 votes)
25 views

Lecture 17-18

Uploaded by

anutyo
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/ 10

Lecture 17-18

Ajay Kumar
[email protected]

September 21, 2023


Dimension
Definition
The dimension of a vector space V, denoted by dim V, is the number
of vectors in any basis of V.
Example
dim Rn = n, dim R2×2 = 4, dim Rm×n = mn, dim Rn [x] = n + 1.
Definition
A non-zero vector space V is called finite dimensional vector space if
it contains a finite set of vectors that forms a basis of V. Otherwise it
is called infinite dimensional vector space.
Example
1. Rn , Rm×n , Rn [x] are finite dimensional.
2. Let R(x) denotes the set of all polynomials with real coefficients.
Then R[x] is a vector space under usual addition and scalar
multiplication of polynomials and {1, x, x2 , . . .} is a basis of R[x].
Hence R[x] is an infinite dimensional vector space.
Plus-Minus Theorem
Let S be a nonempty set of vectors in a vector space V.
1. If S is a linearly independent set, and v ∈ V such that v ∈
/ span(S),
then the set S ∪ {v} is still linearly independent.
2. If v ∈ S and v ∈ span(S \ {v}), then S \ {v} spans the same space
i.e. span(S) = span(S \ {v}).
Proof. Exercise.
Theorem B
Let V be an n-dimensional vector space and S = {v1 , . . . , vn } ⊂ V.
Then S is a basis for V if either S spans V or S is linearly independent.
Proof.

a). Let span(S) = V. Suppose that S is linearly dependent. Then


there exist a vector vj ∈ S such that v ∈ span{v1 , . . . , vj−1 }, i.e.,
vj = c1 v1 + · · · + cr−1 vj−1 . Then by Plus-Minus Theorem,
span(S) = span(S \ {vj }). By continuing this process, we get a set
T ⊂ S such that T is linearly independent and span(S) = span(T).
Note that |T| < n gives a contradiction to the fact that dim V = n.
b). Let S be a linearly independent set and v ∈ V. We claim that
v ∈ span(S). On the contrary, assume that v ∈ / span(S). By
Plus-minus theorem, we get S ∪ {v} is a linearly independent set.
This is a contradiction to the fact that the number of elements in
any linearly independent set is less or equal to dimension of the
vector space.
Theorem C
Let S be a finite set of vectors in a finite dimensional vector space V.
1. If S spans V but not a basis, then S can be reduced to a basis for
V by removing appropriate vectors from S.
2. If S is linearly independent set that is not a basis, then S can be
enlarged to a basis for V by inserting appropriate vectors into S.

Proof. Exercise.
Theorem
Every subspace W of a finite dimensional vector space V is again
finite dimensional and dim W ≤ dim V. Moreover, if dim W = dim V,
then V = W.
Sum of two Spaces

Definition
Let V be a vector space over F and W1 , W2 subspaces of V. Then
W1 + W2 = {w1 + w2 : w1 ∈ W1 , w2 ∈ W2 } is called the sum of W1 and
W2.

Remark
• W1 + W2 is again a subspace of V.
• As 0 ∈ W2 , W1 be a subspace of W1 + W2 . Similarly, W2 be a
subspace of W1 + W2 .
• W1 + W2 is the smallest subspace which contains W1 ∪ W2 .
• If V is finite dimensional, then so W1 + W2 .
Theorem
Let V be a finite dimensional vector space over F, and W1 , W2 be
subspaces of V. Then
dim(W1 + W2 ) = dim(W1 ) + dim(W2 ) − dim(W1 ∩ W2 ).
Proof. Since V is finite dimensional, W1 , W2 , W1 ∩ W2 are finite
dimensional. Assume that dim(W1 ) = m, dim(W2 ) = n and
dim(W1 ∩ W2 ) = r. Note that r ≤ m and r ≤ n. Let B = {v1 , . . . , vr } be
a basis for W1 ∩ W2 . Since B is linearly independent set in W1 , B can
we extend to a basis for W1 , say B1 = {v1 , . . . , vr , u1 , . . . , um−r }.
Similarly, B2 = {v1 , . . . , vr , w1 , . . . , wn−r } is a basis for W2 . We claim
that B3 = {v1 , . . . , vr , u1 , . . . , um−r , w1 , . . . , wn−r } be a basis for
W1 + W2 . Note that |B3 | = m + n − r. Hence to prove the theorem it is
enough to prove the claim.
Proof of claim: Exercise
Consequence

Corollary
Let P1 and P2 be two planes passing through origin in R3 . Then
dim(P1 ∩ P2 ) ≥ 1.
Proof. Since dim(P1 ) = 2 = dim(P2 ) and dim(R3 ) = 3,
2 ≤ dim(P1 + P2 ) ≤ 3. By the above theorem,

dim(P1 + P2 ) = dim(P1 ) + dim(P2 ) − dim(P1 ∩ P2 ),

and hence 3 ≥ 2 + 2 − dim(P1 ∩ P2 ). This gives that dim(P1 ∩ P2 ) ≥ 1.


Definition
Let V be a vector space over F and W1 , W2 subspaces of V. If
W1 ∩ W2 = (0), then W1 + W2 is called the direct sum of W1 and W2
and it is denoted as W1 ⊕ W2 .
Note that since W1 ∩ W2 = (0), we have
dim(W1 ⊕ W2 ) = dim(W1 ) + dim(W2 )
Example
Let V = R2 , W1 = {(x, 0) : x ∈ R} and W2 = {(0, y) : y ∈ R}. Then
R2 = W1 ⊕ W2

Exercise
Let l1 and l2 be two distinct lines passing through origin in R2 . Then
show that R2 = l1 ⊕ l2 .

You might also like