Week-5 Session 2
Week-5 Session 2
WEEK 5
Null spaces
Nullity
Rank-Nullity Theorem
Linear Transformation
Let A be an m × n matrix. The subspace {x ∈Rn : Ax = 0} is called the null space of the matrix
A. This is nothing but the solution space of the homogeneous system of linear equations Ax
= 0.
Nullity of a matrix
Examples:
Rank(A) + nullity(A) = n.
Thus rank(A) = 2.
Exercises:
2) Which of the following options are correct for a square matrix A of order n × n, where n
is any natural number?
• Option 1: If the determinant is non-zero, then the nullity of A must be 0.
• Option 2: If the determinant is non-zero, then the nullity of A may be non-zero.
• Option 3: If the nullity of A is non-zero, then the determinant of A must be 0.
• Option 4: If the nullity of A is non-zero, then the determinant of A may be non-zero.
Notice what A has done: it took a vector in R3 and transformed it into a vector in R2.
4
Linear Transformation
• T (cv1) = cT (v1)
Examples:
Fact: For a linear transformation T : V → W , where V , W are vector spaces, T (0) = 0 i.e.,
Image of the zero vector of V is the zero vector of W .
5
2) Let us choose the standard basis {(1, 0), (0, 1)} of R 2. Define the linear transformation
as follows:
T:R2→R2
T ((1, 0)) = (2, 0)
T ((0, 1)) = (0, 1)
Find the explicit definition of T.
If we choose a different basis for R 2 , then we will get different linear transformation. Let
us choose {(1, 0), (1, 1)} to be a basis for R 2. Define the linear transformation as we have
defined earlier: f : R2 → R2 f((1, 0)) = (2, 0) f((1, 1)) = (1, 1)
6
3) Let V be a vector space, and let x ≠0 be a fixed vector in V. Is the translation function
f : V V defined by f (v) = v + x is a linear transformation?
T : R2 → R2
T(x, y) = (x+1, y-2)
If T:Rn→Rm is a linear transformation if and only if there exists a m×n matrix A such
that T(v)=Av for all v∈Rn.
8)
9) Consider the mapping h: R3 → R3 given by h([a1 , a2 , a3]) = [a1 , a2 , 0]. This mapping
takes each vector in R3 to a corresponding vector in the xy-plane.
10)
12
Recall: A function is called injective if there are no two elements from the domain which
map to a same image.
A function is called surjective if every element of the codomain of the function has a
pre-image.
Similarly,
1. a linear transformation T : V → W , where V , W are vector spaces, is called a
monomorphism, if T is an injective map from V to W , i.e., T (v1) = T (v2) ⇒ v1 = v2.
2. a linear transformation T : V → W , where V , W are vector spaces, is called an
epimorphism, if T is a surjective map from V to W , i.e., for every w ∈ W there exists v
∈ V such that T (v) = w.
3. a linear transformation T : V → W is isomorphism if it is both injective
(monomorphism) and surjective (epimorphism).
13
Examples:
⃝ Option 4: If T is not surjective, then there exists some b ∈ R3, such that the