Linear Algebra II Marking Guide
Uploaded by
hassankalyango34Linear Algebra II Marking Guide
Uploaded by
hassankalyango34Solution of 8(a)
Linear Transformation Definition: Let T : Rn → Rn be a linear transfor-
mation. A linear transformation is a function that satisfies the following two
properties for all vectors u, v ∈ Rn and any scalar c ∈ R:
• Additivity: T (u + v) = T (u) + T (v)
• Homogeneity: T (cu) = cT (u)
8(b)
Let T : Rn → Rn be a linear transformation.
(i) Prove that if T is one-to-one, then T is onto.
Proof: Let T be one-to-one. This means that for all u, v ∈ Rn , if T (u) = T (v),
then u = v.
To prove that T is onto, we need to show that for every vector y ∈ Rn , there
exists a vector x ∈ Rn such that T (x) = y.
Since T is one-to-one, it must also be injective. Therefore, the kernel of T ,
denoted as Ker(T ), contains only the zero vector. Hence, T must map Rn onto
the entire space Rn . Thus, T is onto.
(ii) Prove that if T is onto, then T is one-to-one.
Proof: Let T be onto. This means that for every vector y ∈ Rn , there exists a
vector x ∈ Rn such that T (x) = y.
To prove that T is one-to-one, we need to show that if T (u) = T (v), then
u = v.
Since T is onto, there exists some vector w ∈ Rn such that T (w) = 0. If
T (u) = T (v), then T (u − v) = 0, implying u − v ∈ Ker(T ).
Since T is onto, the kernel of T only contains the zero vector. Hence, u−v =
0, which means that u = v.
8(c)
Let T : R3 → R3 be the linear transformation whose matrix is
1 −1 0
[T ] = 0 1 2
1 0 1
1
x 1
−1 −1
(i) Find T y , hence compute T 1 .
z 0
To find the inverse of T , we need to find the inverse matrix [T ]−1 .
First, compute the determinant of [T ]:
1 2 0 2
det([T ]) = 1 × − (−1) × +0
0 1 1 1
det([T ]) = 1 × (1 · 1 − 0 · 2) + 1 × (0 · 1 − 1 · 2) = 1 − (−2) = 3
The inverse of [T ] is given by:
1
[T ]−1 = · adj([T ])
det([T ])
After finding
the
adjugate
matrix of [T ] and applying the formula, you can
1
compute T −1 1.
0
(ii) Find the Kernel of T , i.e., Ker(T ).
The kernel of T is the set of all vectors v ∈ R3 such that T (v) = 0. This
corresponds to solving the system of equations:
1 −1 0 v1 0
0 1 2 v2 = 0
1 0 1 v3 0
Solving this system yields the kernel of T .
(iii) Let T : V → W be a linear transformation. Prove that
Ker(T ) is a subspace of V .
Proof: To prove that Ker(T ) is a subspace of V , we need to check the following
three conditions:
• Zero vector is in Ker(T ): Since T (0) = 0, the zero vector is in the
kernel.
• Closed under addition: If u, v ∈ Ker(T ), then T (u + v) = T (u) +
T (v) = 0 + 0 = 0, so u + v ∈ Ker(T ).
• Closed under scalar multiplication: If u ∈ Ker(T ) and c ∈ R, then
T (cu) = cT (u) = c0 = 0, so cu ∈ Ker(T ).
Therefore, Ker(T ) is a subspace of V .