Exam Solutions
Exam Solutions
space.
Solution:
To show that V is a vector space, we need to verify the ten axioms of a vector space. Here, V =
(0, ∞), the set of all positive real numbers. The operations are defined as:
operation)
Let’s verify each axiom:
Axioms of Vector Addition
A1. Closure under addition: For all u, v ∈ V , u ⊕ v ∈ V . Since u > 0 and v > 0, their product
uv > 0. Thus, u ⊕ v = uv ∈ V . (Verified)
V V V
additive identity is 1. (Verified)
A5. Existence of an additive inverse: For each u ∈ V , there exists an element −u ∈ V such
that u ⊕ (−u) = 0 . We need u ⋅ (−u) = 1. This implies −u = 1/u. Since u > 0, 1/u > 0. Thus,
V
1/u ∈ V . So, the additive inverse of u is 1/u. (Verified)
Axioms of Scalar Multiplication
A6. Closure under scalar multiplication: For all u ∈ V and k ∈ R, k ⊙ u ∈ V . k ⊙ u = u . If k
A7. Distributivity of scalar multiplication over vector addition: For all u, v ∈ V and k ∈ R,
k ⊙ (u ⊕ v) = (k ⊙ u) ⊕ (k ⊙ v). k ⊙ (u ⊕ v) = k ⊙ (uv) = (uv) = u v (k ⊙ u) ⊕ (k ⊙ v) =
k k k
A8. Distributivity of scalar multiplication over scalar addition: For all u ∈ V and k, m ∈ R,
(k + m) ⊙ u = (k ⊙ u) ⊕ (m ⊙ u). (k + m) ⊙ u = u (k+m)
= u u (k ⊙ u) ⊕ (m ⊙ u) = u ⊕
k m k
Since all ten axioms are satisfied, V with the given operations is a vector space.
x + y = 1}.
2 2
Solution:
To be a subspace of R , a subset W must satisfy three conditions:
2
circle in R .
2
Condition 1: Does the zero vector belong to W ? The zero vector in R is (0, 0). For (0, 0) to be
2
in W , it must satisfy the condition x + y = 1. (0) + (0) = 0 = 1. Therefore, the zero vector
2 2 2 2
2 2 2 2
1 1 2 2
since 1 + 0 = 1 and 0 + 1 = 1. Their sum is u + v = (1 + 0, 0 + 1) = (1, 1). Now, let’s check
2 2 2 2
(2, 0). Now, let’s check if (2, 0) ∈ W : 2 + 0 = 4 = 1. Thus, W is not closed under scalar 2 2
multiplication.
Since W fails all three conditions (any one is sufficient), W is not a subspace of R . 2
Solution:
Two functions f (x) and g(x) are linearly dependent if there exist scalars c and c , not both 1 2
zero, such that c f (x) + c g(x) = 0 for all x. Otherwise, they are linearly independent.
1
2
2
If c = 0, then x cos x = − sin 3x. This would imply that x cos x is a scalar multiple of sin 3x.
1
c2
However, these functions have different behaviors (e.g., x cos x has varying amplitude and
c1
frequency, while sin 3x has constant amplitude and frequency). For example:
At x = π/2: c (π/2 cos(π/2)) + c (sin(3π/2)) = c (0) + c (−1) = −c = 0 ⟹ c = 0.
1
2
1
2
2
2
1 1 1 1
0 ⟹ c = 0.
1
Since both c and c must be zero, the functions are linearly independent.
1
2
Alternatively, we can use the Wronskian. For two functions f (x) and g(x), the Wronskian is
) = f (x)g (x) − g(x)f (x). If W (f , g)(x) = 0 for some x in
f (x) g(x)
W (f , g)(x) = det ( ′ ′
′ ′
f (x) g (x)
We need to check if there exist scalars c , c , not both zero, such that c (3x + 2) + c (−4 + 1 2 1
2
2
6x ) = 0 for all x.
Notice that g(x) = −4 + 6x = 2(3x − 2). This doesn’t look like a direct scalar multiple of 2 2
2
For this equation to hold for all x, the coefficients of x and the constant term must both be 2
zero:
1. 3c + 6c = 0 ⟹ c + 2c = 0 ⟹ c = −2c
1
2
1
2
1
2
2. 2c − 4c = 0 ⟹ c − 2c = 0 ⟹ c = 2c
1
2
1
2
1
2
2
1
Since the only solution is c = 0 and c = 0, the functions are linearly independent. 1
2
Let’s re-examine the problem statement. Perhaps there’s a typo in my transcription of the
problem. If g(x) = 2(3x + 2) or g(x) = −2(3x + 2), they would be linearly dependent. As 2 2
For this equation to hold for all x, the coefficients must be zero:
1. c + 2c = 0 1
2
2. c + c = 0 1
2
Since the only solution is c = 0 and c = 0, the functions are linearly independent. 1
2
Problem Statement: Given u = (2, 9, 0), u = (1, 2, 1), u = (3, 3, 4). (a) Determine whether 1 2 3
u , u , u form a basis of R . (b) If it does, find the dimension. © Find the coordinates of the
3
1 2 3
vector (5, −1, 9) related to S = {u , u , u }.
1
2
Solution:
(a) Determine whether u , u , u form a basis of R . 1
2
3
3
For three vectors in R to form a basis, they must satisfy two conditions: 3
For n vectors in R , if they are linearly independent, they automatically span R , and vice
n n
0 1 4
Since det(A) = 1 = 0, the vectors u , u , u are linearly independent. Therefore, they form a 1 2 3
basis for R .
3
(b) If it does, find the dimension.
Since u , u , u form a basis for R , the dimension of the vector space R is the number of
1 2 3
3 3
2
3
2
3
1 1
2 2
3 3
This leads to the system of linear equations: c (2, 9, 0) + c (1, 2, 1) + c (3, 3, 4) = (5, −1, 9) 1
2
3
2c1 + c2 + 3c3 = 5
(1) 9c1 + 2c2 + 3c3 = −1 (2) 0c1 + c2 + 4c3 = 9 (3)
3
1
3
3
1
3
1
3
3
1
3
3 = −1 9c1 −
5c3 = −19
(5)
3
1 − c3 = −4 (4) 9c1 −
5c3 = −19
(5)
From (4), c = 2c + 4. 3 1
1
1
1
1
1
1 = −1
3
1
3
2
3
2
So, the coordinates of the vector (5, −1, 9) related to S = {u , u , u } are (−1, 1, 2). 1
2
3
1 2 1
and v .
2
Solution:
(a) Show that v = (9, 2, 7) is a linear combination of v and v . 1
2
A vector v is a linear combination of v and v if there exist scalars c and c such that v = 1 2 1 2
c v +c v .
1 1
2 2
So, we need to find c , c such that: c (6, 4, 3) + c (1, 1, 2) = (9, 2, 7) 1
2
1
2
2
2. 4c + c = 2 1
2
3. 3c + 2c = 7 1
2
2
1
2
1
1
2
2
2
c2 = −12
Now, we must check if these values of c and c satisfy the third equation: 3c 1
2
1 + 2c2 =
However, the right side of the third equation is 7. Since −27/2 = 7, there is a contradiction.
This means that v = (9, 2, 7) is not a linear combination of v and v . 1
2
Correction: My calculation shows that it is not a linear combination, but the problem asks to
show that it is. This indicates a potential error in my understanding or calculation, or the
problem statement itself. Let me re-evaluate the calculation carefully.
Let’s try solving the system using an augmented matrix and row reduction:
6 1 9
4
1 2
3 2 7
3 2 7
R1 ↔ R3 4
1 2
6 1 9
3 2 7
0
−5/3 −22/3
0 −3 −5
3 2 7
R2 ← (−3/5)R2
0
1 22/5
0 −3 −5
0 0 41/5
The last row implies 0c + 0c = 41/5, which is 0 = 41/5. This is a contradiction. Therefore, the
1 2
system has no solution, and v = (9, 2, 7) is not a linear combination of v and v .
1
2
It seems the problem statement for part (a) might be incorrect, as my calculations consistently
show that v is not a linear combination. I will state this finding clearly.
(b) Show that (−1, 0, 3) is not a linear combination of v and v . 1
2
2
1
2
2
2. 4c + c = 0 1
2
3. 3c + 2c = 3 1
2
1
1
1
1
1
2
1
2
Now, we must check if these values of c and c satisfy the third equation: 3c 1
2
1 + 2c2 =
However, the right side of the third equation is 3. Since 5/2 = 3, there is a contradiction.
Therefore, the system has no solution, and (−1, 0, 3) is not a linear combination of v and v . 1
2
2
3
3
1
2
3
2
2. x − x = 0
2
3
2
3
2
So, any vector in the kernel can be written in terms of x as: (x , x , x ) = (−x , x , x ) = 2 1 2 3 2 2 2
x (−1, 1, 1).
2
Therefore, the kernel of T is the set of all scalar multiples of the vector (−1, 1, 1): ker T =
{t(−1, 1, 1) ∣ t ∈ R}
This means that ker T is the span of the vector (−1, 1, 1).
Finding the Nullity of T
The nullity of a linear transformation T is the dimension of its kernel. Since ker T is spanned by
a single non-zero vector (−1, 1, 1), and this vector is linearly independent, the dimension of
ker T is 1.
Solution:
(a) A 2
+B
First, calculate A 2
=A⋅A :
1 −1 2 1 −1 2
A2 = 5
3 3 5
3 3
−1 2 3 −1 2 3
A2 =
(1)(1) + (−1)(5) + (2)(−1) (1)(−1) + (−1)(3) + (2)(2) (1)(2) + (−1)(3) + (2)(3)
(5)(1) + (3)(5) + (3)(−1) (5)(−1) + (3)(3) + (3)(2) (5)(2) + (3)(3) + (3)(3)
−1 + 10 − 3 1+6+6 −2 + 6 + 9
−6 0 5
A2 = 17
10 28
6 13 13
Now, calculate A 2
+B :
−6 0 5 2 −6 −2
A2 + B = 17
10 28 + 1 0 1
6 13 13 1 −1 0
−6 + 2 0−6 5−2 −4 −6 3
2
A + B = 17 + 1 10 + 0 28 + 1 = 18 10 29
6+1 13 − 1 13 + 0 7 12 13
(b) 2A + 3B T
2 1 1
B =
T −6 0 −1
−2 1 0
1 −1 2 2 −2 4
2A = 2 5
3 3 = 10 6 6
−1 2 3 −2 4 6
2 1 1 6 3 3
3B = 3 −6
T
0 −1 = −18 0 −3
−2 1 0 −6 3 0
Finally, calculate 2A + 3B : T
2 −2 4 6 3 3
2A + 3B T = 10
6 6 + −18
0 −3
−2 4 6 −6 3 0
2+6 −2 + 3 4+3 8 1 7
2A + 3B T = 10 − 18 6+0 6 − 3 = −8 6 3
−2 − 6 4+3 6+0 −8 7 6
© (2A − B) T
First, calculate 2A − B:
2 −2 4 2 −6 −2
2A − B = 10 6 6 − 1 0 1
−2 4 6 1 −1 0
−2 − 1 4 − (−1) 6−0 −3 5 6
6 5 6
(d) BA
2 −6 −2 1 −1 2
BA = 1 0 1 5
3 3
1 −1 0 −1 2 3
BA =
(2)(1) + (−6)(5) + (−2)(−1) (2)(−1) + (−6)(3) + (−2)(2) (2)(2) + (−6)(3) + (−2)(3)
(1)(1) + (0)(5) + (1)(−1) (1)(−1) + (0)(3) + (1)(2) (1)(2) + (0)(3) + (1)(3)
2 − 30 + 2 −2 − 18 − 4 4 − 18 − 6
BA = 1+0−1
−1 + 0 + 2 2+0+3
1−5+0 −1 − 3 + 0 2−3+0
−4 −4 −1
(e) det(A + B)
First, calculate A + B:
1 −1 2 2 −6 −2
A+B = 5 3 3 + 1 0 1
−1 2 3 1 −1 0
1+2 −1 − 6 2−2 3 −7 0
A+B = 5+1
3+0 3+1 = 6 3 4
−1 + 1 2−1 3+0 0 1 3
−1 2 3
3 3 5 3 5 3
det(A) = 1 − (−1) +2 = 1((3)(3) − (3)(2)) + 1((5)(3) − (3)(−1)) +
2 3 −1 3 −1 2
2((5)(2) − (3)(−1)) = 1(9 − 6) + 1(15 − (−3)) + 2(10 − (−3)) = 1(3) + 1(18) + 2(13) = 3 +
18 + 26 = 47
(−3) = 13
−1 2 1 2 1 −1
C21 = − = −(−3 − 4) = 7 C22 = = 3 − (−2) = 5 C23 = − =
2 3 −1 3 −1 2
−(2 − 1) = −1
−1 2 1 2 1 −1
C31 = = −3 − 6 = −9 C32 = − = −(3 − 10) = 7 C33 = =3−
3 3 5 3 5 3
(−5) = 8
3 −18 13
Matrix of cofactors C = 7
5 −1
−9 7 8
3 7 −9
Adjugate matrix adj(A) = CT = −18 5 7
13 −1 8
3 7 −9
Finally, A −1
= 1
47 −18
5 7
13 −1 8
(g) (B T )−1
2 1 1
B T = −6 0 −1
−2 1 0
Now, calculate det(B ): T
0 −1 −6 −1 −6 0
det(B T ) = 2 −1 +1 = 2((0)(0) − (−1)(1)) − 1((−6)(0) −
1 0 −2 0 −2 1
0 −1 −6 −1 −6 0
C11 = = 1 C12 = − = −(0 − 2) = 2 C13 = = −6 − 0 = −6
1 0 −2 0 −2 1
1 1 2 1 2 1
C21 = − = −(0 − 1) = 1 C22 = = 0 − (−2) = 2 C23 = − = −(2 −
1 0 −2 0 −2 1
(−2)) = −4
1 1 2 1
C31 = = −1 − 0 = −1 C32 = − = −(−2 − (−6)) = −(−2 + 6) = −4
0 −1 −6 −1
2 1
C33 = = 0 − (−6) = 6
−6 0
1 2 −6
Matrix of cofactors for B = 1 T 2 −4
−1 −4 6
1 1 −1
Adjugate matrix adj(B T ) = (CB T)
T = 2 2 −4
−6 −4 6
−6 −4 6 3 2 −3
Solution:
(a) det(A)
For a 2x2 matrix A = [ac
b
d
] , the determinant is given by det(A) = ad − bc.
Given A = [−22
3
7
] :
det(A) = (2)(7) − (3)(−2) = 14 − (−6) = 14 + 6 = 20
(b) A −1
−1 −1 5
© Matrix of Cofactors (d) (e) det(A) A −1
Solution:
2 3 −4
Given matrix A= 0 −4 2 .
−1 −1 5
−4 2
M11 = = (−4)(5) − (2)(−1) = −20 − (−2) = −18
−1 5
0 2
M12 = = (0)(5) − (2)(−1) = 0 − (−2) = 2
−1 5
0 −4
M13 = = (0)(−1) − (−4)(−1) = 0 − 4 = −4
−1 −1
3 −4
M21 = = (3)(5) − (−4)(−1) = 15 − 4 = 11
−1 5
2 −4
M22 = = (2)(5) − (−4)(−1) = 10 − 4 = 6
−1 5
2 3
M23 = = (2)(−1) − (3)(−1) = −2 − (−3) = 1
−1 −1
3 −4
M31 = = (3)(2) − (−4)(−4) = 6 − 16 = −10
−4 2
2 −4
M32 = = (2)(2) − (−4)(0) = 4 − 0 = 4
0 2
2 3
M33 = = (2)(−4) − (3)(0) = −8 − 0 = −8
0 −4
−18 2 −4
Matrix of Minors M = 11 6 1
−10 4 −8
(b) Trace of A
The trace of a square matrix is the sum of the elements on its main diagonal.
extT race(A) = a11 + a22 + a33 = 2 + (−4) + 5 = 3
© Matrix of Cofactors
The cofactor C of an element a is given by C
ij
ij
ij = (−1)i+j Mij .
C11 = (−1)1+1 M11 = 1(−18) = −18 C12 = (−1)1+2 M12 = −1(2) = −2 C13 = (−1)1+3 M13 =
1(−4) = −4
−1(1) = −1
C31 = (−1)3+1 M31 = 1(−10) = −10 C32 = (−1)3+2 M32 = −1(4) = −4 C33 = (−1)3+3 M33 =
1(−8) = −8
−18 −2 −4
Matrix of Cofactors C = −11
6 −1
−10 −4 −8
(d) det(A)
The determinant of A can be calculated using the cofactors along any row or column. Let’s use
the first row:
det(A) = a11 C11 + a12 C12 + a13 C13 = (2)(−18) + (3)(−2) + (−4)(−4) = −36 − 6 + 16 = −26
(e) A −1
To find the inverse of A, we use the formula A = adj(A), where adj(A) is the adjugate
−1 1
det(A)
matrix of A, which is the transpose of the matrix of cofactors.
−18 −2 −4
From part ©, the Matrix of Cofactors C = −11 6 −1
−10 −4 −8
−4 −1 −8
−4 −1 −8