0% found this document useful (0 votes)
7 views16 pages

Exam Solutions

The document provides solutions to three mathematical problems related to vector spaces, subspaces, and linear dependence/independence of functions. It demonstrates that a set of positive numbers forms a vector space by verifying the ten axioms, shows that a specific set is not a subspace, and analyzes the linear dependence of given functions. Each solution includes detailed steps and verifications to support the conclusions drawn.

Uploaded by

sadissadisyazid
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)
7 views16 pages

Exam Solutions

The document provides solutions to three mathematical problems related to vector spaces, subspaces, and linear dependence/independence of functions. It demonstrates that a set of positive numbers forms a vector space by verifying the ten axioms, shows that a specific set is not a subspace, and analyzes the linear dependence of given functions. Each solution includes detailed steps and verifications to support the conclusions drawn.

Uploaded by

sadissadisyazid
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

Exam Guide Solutions

Question 1: Vector Space Properties


Problem Statement: Let V be the set of all positive numbers with u, v ∈ V and let k be any
scalar. Define the operations on V to be u + v = uv and kv = v . Show that V is a vector
k

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:

1. Vector Addition: u ⊕ v = uv (where ⊕ denotes the new addition operation)


2. Scalar Multiplication: k ⊙ v = v (where ⊙ denotes the new scalar multiplication
k

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)

A2. Commutativity of addition: For all u, v ∈ V , u ⊕ v = v ⊕ u. u ⊕ v = uv v ⊕ u = vu Since


real number multiplication is commutative, uv = vu. Thus, u ⊕ v = v ⊕ u. (Verified)
A3. Associativity of addition: For all u, v, w ∈ V , (u ⊕ v) ⊕ w = u ⊕ (v ⊕ w). (u ⊕ v) ⊕ w =
(uv) ⊕ w = (uv)w u ⊕ (v ⊕ w) = u ⊕ (vw) = u(vw) Since real number multiplication is
associative, (uv)w = u(vw). Thus, (u ⊕ v) ⊕ w = u ⊕ (v ⊕ w). (Verified)
A4. Existence of an additive identity (zero vector): There exists an element 0 ∈ V such that
V
for all u ∈ V , u ⊕ 0 = u. We need u ⋅ 0 = u. This implies 0 = 1. Since 1 > 0, 1 ∈ V . So, the

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

u > 0, then u > 0 for any real scalar k . Thus, k ⊙ u ∈ V . (Verified)


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

u ⊕ v = u v Thus, k ⊙ (u ⊕ v) = (k ⊙ u) ⊕ (k ⊙ v). (Verified)


k 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

u = u u Thus, (k + m) ⊙ u = (k ⊙ u) ⊕ (m ⊙ u). (Verified)


m k m

A9. Associativity of scalar multiplication: For all u ∈ V and k, m ∈ R, k ⊙ (m ⊙ u) =


(km) ⊙ u. k ⊙ (m ⊙ u) = k ⊙ (u ) = (u ) = u (km) ⊙ u = u Since mk = km, we have
m m k mk km

u = u . Thus, k ⊙ (m ⊙ u) = (km) ⊙ u. (Verified)


mk km

A10. Multiplicative identity: For all u ∈ V , 1 ⊙ u = u. 1 ⊙ u = u = u. (Verified)


1

Since all ten axioms are satisfied, V with the given operations is a vector space.

Question 2: Subspace Verification


Problem Statement: Show that W ⊂ R is not a subspace of R . Define W = {(x, y) ∈ R :
2 2 2

x + y = 1}.
2 2

Solution:
To be a subspace of R , a subset W must satisfy three conditions:
2

1. The zero vector must be in W .


2. W must be closed under vector addition.
3. W must be closed under scalar multiplication.
Let’s check these conditions for W = {(x, y) ∈ R : x + y = 1}. This set represents the unit
2 2 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

(0, 0) is not in W . This alone is sufficient to conclude that W is not a subspace of R . 2

Let’s also check the other conditions for completeness.


Condition 2: Is W closed under vector addition? Let u = (x , y ) ∈ W and v = (x , y ) ∈ W . 1 1 2 2
This means x + y = 1 and x + y = 1. Consider u = (1, 0) and v = (0, 1). Both are in W
​ ​ ​ ​

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

if (1, 1) ∈ W : 1 + 1 = 1 + 1 = 2 = 1. Thus, W is not closed under vector addition.


2 2

Condition 3: Is W closed under scalar multiplication? Let u = (x, y) ∈ W and c be a scalar.


This means x + y = 1. Consider u = (1, 0) ∈ W and a scalar c = 2. Then c ⋅ u = 2 ⋅ (1, 0) =
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

Question 3: Linear Dependence/Independence of Functions


Problem Statement: Show that the following functions are linearly dependent or
independent: (i) f (x) = x cos x and g(x) = sin 3x (ii) f (x) = 3x + 2 and g(x) = −4 + 6x (iii) 2 2

f (x) = 1 + e and g(x) = 2 + e x x

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 ​

(i) f (x) = x cos x and g(x) = sin 3x


Assume c (x cos x) + c (sin 3x) = 0 for all x.
1 ​

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 ​

If c = 0, then c (x cos x) = 0. This must hold for all x. For example, at x = 0,


2 1
c (0 cos 0) = 0, which doesn’t help. But at x = π , c (π cos π) = c (π(−1)) = −c π =
​ ​

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)

the interval, then the functions are linearly independent.


f (x) = x cos x ⟹ f ′ (x) = cos x − x sin x g(x) = sin 3x ⟹ g ′ (x) = 3 cos 3x
W (f , g)(x) = (x cos x)(3 cos 3x) − (sin 3x)(cos x − x sin x) W (f , g)(x) = 3x cos x cos 3x −
sin 3x cos x + x sin 3x sin x

Let’s evaluate at x = π/2: W (f , g)(π/2) = 3(π/2) cos(π/2) cos(3π/2) − sin(3π/2) cos(π/2) +


(π/2) sin(3π/2) sin(π/2) W (f , g)(π/2) = 3(π/2)(0)(0) − (−1)(0) + (π/2)(−1)(1)
W (f , g)(π/2) = 0 − 0 − π/2 = −π/2 =
0 .
Since the Wronskian is non-zero at x = π/2, the functions are linearly independent.
(ii) f (x) = 3x 2
+2 and g(x) = −4 + 6x 2

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

f (x). Let’s try to find c , c . 1 ​

2 ​

c1 (3x2 + 2) + c2 (6x2 − 4) = 0 (3c1 + 6c2 )x2 + (2c1 − 4c2 ) = 0


​ ​ ​ ​ ​ ​

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 ​

From c = −2c and c = 2c , we must have −2c = 2c , which implies 4c = 0, so c = 0. If


1 2 1 2 2 2 2 2
c = 0, then c = 0.
​ ​ ​ ​ ​ ​ ​ ​

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

transcribed, they are independent.


Let’s double check the image for Question 3 (ii). It appears to be f (x) = 3x + 2 and g(x) = 2

−4 + 6x . My transcription is correct. My conclusion of linear independence is also correct


2

based on the given functions.


(iii) f (x) = 1 + e and g(x) = 2 + e x x

Assume c (1 + e ) + c (2 + e ) = 0 for all x.


1 ​
x
2 ​
x

c1 + c1 ex + 2c2 + c2 ex = 0 (c1 + 2c2 ) + (c1 + c2 )ex = 0


​ ​ ​ ​ ​ ​ ​ ​

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 ​

From (2), c = −c . Substitute this into (1): (−c ) + 2c = 0 ⟹ c = 0. If c = 0, then c


1 2 2 2 2 2 1 =
−0 = 0.
​ ​ ​ ​ ​ ​ ​

Since the only solution is c = 0 and c = 0, the functions are linearly independent. 1 ​

2 ​

Question 4: Basis and Coordinates in R 3

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

1. They must be linearly independent.


2. They must span R . 3

For n vectors in R , if they are linearly independent, they automatically span R , and vice
n n

versa. So, we only need to check for linear independence.


To check for linear independence, we can form a matrix with these vectors as columns (or
rows) and calculate its determinant. If the determinant is non-zero, the vectors are linearly
independent.
2 1 3
Let A = 9
​ 2 ​ 3 ​ .

0 1 4

Calculating the determinant of A:


2 3 9 3 9 2
det(A) = 2 −1 +3 = 2((2)(4) − (3)(1)) − 1((9)(4) − (3)(0)) +
1 4 0 4 0 1
​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​

3((9)(1) − (2)(0)) = 2(8 − 3) − 1(36 − 0) + 3(9 − 0) = 2(5) − 1(36) + 3(9) = 10 − 36 + 27 =


1

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

vectors in its basis. In this case, the dimension is 3.


​ ​ ​

© Find the coordinates of the vector (5, −1, 9) related to S = {u , u , u }. 1 ​

2 ​

3 ​

We need to find scalars c , c , c such that c u + c u + c u = (5, −1, 9). 1 ​

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)

From equation (3), c = 9 − 4c . 2 ​

3 ​

Substitute c into equation (1): 2c + (9 − 4c ) + 3c = 5 2c − c = −4 (4)


2 ​

1 ​

3 ​

3 ​

1 ​

3 ​

Substitute c into equation (2): 9c + 2(9 − 4c ) + 3c = −1 9c + 18 − 8c + 3c


2 ​

1 ​

3 ​

3 ​

1 ​

3 ​

3 ​ = −1 9c1 − ​

5c3 = −19
​ (5)

Now we have a system of two equations with two variables (c , c ): 2c 1 ​

3 ​

1 ​ − c3 = −4 ​ (4) 9c1 − ​

5c3 = −19

(5)

From (4), c = 2c + 4. 3 1 ​

Substitute c into (5): 9c − 5(2c + 4) = −19 9c − 10c − 20 = −19 −c = 1 ⟹ c


3 ​

1 ​

1 ​

1 ​

1 ​

1 ​

1 ​ = −1

Now find c using c = 2c + 4: c = 2(−1) + 4 = −2 + 4 = 2


3 ​

3 ​

1 ​

3 ​

Now find c using c = 9 − 4c : c = 9 − 4(2) = 9 − 8 = 1


2 ​

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 ​

Question 5: Linear Combination of Vectors


Problem Statement: Let v , v ∈ R , v = (6, 4, 3) and v = (1, 1, 2). (a) Show that v = (9, 2, 7) 1 2
3
1 2
is a linear combination of v and v . (b) Show that (−1, 0, 3) is not a linear combination of v
​ ​ ​ ​

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 ​

This gives us the system of linear equations:


1. 6c + c = 9 1 ​

2 ​

2. 4c + c = 2 1 ​

2 ​

3. 3c + 2c = 7 1 ​

2 ​

Subtract equation (2) from equation (1): (6c + c ) − (4c + c ) = 9 − 2 2c = 7 ⟹ c = 7/2 1 ​

2 ​

1 ​

2 ​

1 ​

1 ​

Substitute c = 7/2 into equation (2): 4(7/2) + c = 2 14 + c = 2 ⟹ c = 2 − 14 ⟹


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 = ​

3(7/2) + 2(−12) = 21/2 − 24 = 21/2 − 48/2 = −27/2

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

R2 ← R2 − (4/3)R1 R3 ← R3 − (6/3)R1 = R3 − 2R1


​ ​ ​ ​ ​ ​ ​ ​

R2 : [4 − (4/3)3, 1 − (4/3)2, 2 − (4/3)7] = [4 − 4, 1 − 8/3, 2 − 28/3] = [0, −5/3, −22/3] R3 :


​ ​

[6 − 2(3), 1 − 2(2), 9 − 2(7)] = [6 − 6, 1 − 4, 9 − 14] = [0, −3, −5]

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

R3 ← R3 + 3R2 R3 : [0 + 3(0), −3 + 3(1), −5 + 3(22/5)] = [0, 0, −5 + 66/5] = [0, 0, −25/5 +


​ ​ ​ ​

66/5] = [0, 0, 41/5]


3 2 7
0
​ ​ 1 ​ 22/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 ​

We need to find scalars c and c such that: c (6, 4, 3) + c (1, 1, 2) = (−1, 0, 3) 1 ​

2 ​

1 ​

2 ​

This gives us the system of linear equations:


1. 6c + c = −1 1 ​

2 ​

2. 4c + c = 0 1 ​

2 ​

3. 3c + 2c = 3 1 ​

2 ​

From equation (2), c = −4c . 2 ​

1 ​

Substitute c into equation (1): 6c + (−4c ) = −1 2c = −1 ⟹ c = −1/2


2 ​

1 ​

1 ​

1 ​

1 ​

Substitute c = −1/2 into c = −4c : c = −4(−1/2) = 2


1 ​

2 ​

1 ​

2 ​

Now, we must check if these values of c and c satisfy the third equation: 3c 1 ​

2 ​

1 ​ + 2c2 = ​

3(−1/2) + 2(2) = −3/2 + 4 = −3/2 + 8/2 = 5/2

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 ​

This result aligns with the problem statement.

Question 6: Kernel and Nullity of a Linear Transformation


Problem Statement: Find ker T and nullity of T where T : R3 → R2 is defined by
T (x1 , x2 , x3 ) = (x1 + x2 , x2 − x3 )
​ ​ ​ ​ ​ ​ ​ .
Solution:
Finding the Kernel of T (ker T )
The kernel of a linear transformation T : V → W is the set of all vectors v ∈ V such that
T (v) = 0 . In this case, V = R and W = R , so 0 = (0, 0).
W ​
3 2
W ​
We need to find all (x , x , x ) ∈ R such that T (x , x , x ) = (0, 0).
1 ​

2 ​

3 ​
3
1 ​

2 ​

3 ​

This gives us the system of equations:


1. x + x = 0
1 ​

2 ​

2. x − x = 0
2 ​

3 ​

From equation (1), x = −x . From equation (2), x = x .1 ​

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.

Therefore, the nullity of T is 1.

Question 7: Matrix Operations


1 −1 2 2 −6 −2
Problem Statement: Given A= 5 3 3 B= ​ ​ ​ ​ ,
​ ​1 0 ​ ​ 1 ​ . Find: (a) A

2 +B (b)
−1 2 3 1 −1 0
2A + 3B © (2A − B) (d)
T
(e) T
BA det(A + B) A−1 (f) (g) (B T )−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)(1) + (2)(5) + (3)(−1) (−1)(−1) + (2)(3) + (3)(2) (−1)(2) + (2)(3) + (3)(3)


1−5−2 −1 − 3 + 4 2−3+6
A2 = 5 + 15 − 3
​ ​ −5 + 9 + 6 ​ 10 + 9 + 9 ​ ​

−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

First, find B (transpose of B): T

2 1 1
B =
T −6 ​ ​ 0 ​ −1 ​ ​

−2 1 0

Now, calculate 2A and 3B : T

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−2 −2 − (−6) 4 − (−2) 0 4 6


2A − B = 10 − 1
​ ​ 6−0 ​ 6−1 = 9 ​ ​ ​ ​ 6 ​ 5 ​ ​

−2 − 1 4 − (−1) 6−0 −3 5 6

Now, find the transpose of (2A − B):


0 9 −3
(2A − B)T = 4 ​ ​ 6 ​ 5 ​ ​

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) ​ ​

(1)(1) + (−1)(5) + (0)(−1) (1)(−1) + (−1)(3) + (0)(2) (1)(2) + (−1)(3) + (0)(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

−26 −24 −20


BA = 0 ​ ​ 1 ​ 5 ​ ​

−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

Now, calculate the determinant of (A + B):


3 4 6 4 6 3
det(A + B) = 3 − (−7) +0 = 3((3)(3) − (4)(1)) + 7((6)(3) − (4)(0)) + 0
1 3 0 3 0 1
​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​

= 3(9 − 4) + 7(18 − 0) = 3(5) + 7(18) = 15 + 126 = 141


(f) A −1

To find the inverse of A, we use the formula A −1


= 1
det(A) adj(A) , where adj(A) is the adjugate
matrix of A.

First, calculate det(A):


1 −1 2
A= 5 ​ ​ 3 ​ 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

Now, find the matrix of cofactors C :


3 3 5 3 5 3
C11 = = 9 − 6 = 3 C12 = − = −(15 − (−3)) = −18 C13 = = 10 −
2 3 −1 3 −1 2
​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​

(−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

First, we already found B in part (b): T

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
​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​

(−1)(−2)) + 1((−6)(1) − (0)(−2)) = 2(1) − 1(−2) + 1(−6) = 2 + 2 − 6 = −2

Now, find the matrix of cofactors for B : T

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

1 1 −1 −1/2 −1/2 1/2


Finally, (B T )−1 = 1
−2 ​ 2
​ ​ 2 ​ −4 = −1 ​ ​ ​ ​ −1 ​ 2 ​ ​

−6 −4 6 3 2 −3

Question 8: Determinant and Inverse of a 2x2 Matrix


Problem Statement: Given A = [−22 ​
3
7
] ​
, find: (a) det(A) (b) A −1

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

For a 2x2 matrix A = [ac ​


b
d
​] , the inverse is given by A −1 = 1
det(A) ​ [
d −b
−c a
​ ]

.
Using det(A) = 20 from part (a):
7 −3 7 −3
A−1 = 1
[ ]= 1
[ ]
20 −(−2) 2 20 2 2
​ ​ ​ ​ ​ ​

7/20 −3/20 7/20 −3/20


A−1 = [ ]=[ ]
2/20 2/20 1/10 1/10
​ ​ ​ ​

Question 9: Matrix Properties (3x3 Matrix)


2 3 −4
Problem Statement: Given that A= 0 ​ ​ −4 ​ 2 ​ . Find: (a) Matrix of Minors (b) Trace of A

−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

(a) Matrix of Minors


The minor M of an element a is the determinant of the submatrix obtained by deleting the i-
ij ij
th row and j -th column.
​ ​

−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

C21 = (−1)2+1 M21 = −1(11) = −11


​ ​ C22 = (−1)2+2 M22 = 1(6) = 6
​ ​ C23 = (−1)2+3 M23 =
​ ​

−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
​ ​ ​ ​ ​ ​

Alternatively, using the definition of determinant:


−4 2 0 2 0 −4
det(A) = 2 −3 + (−4) = 2((−4)(5) − (2)(−1)) − 3((0)(5) −
−1 5 −1 5 −1 −1
​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​

(2)(−1)) − 4((0)(−1) − (−4)(−1)) = 2(−20 − (−2)) − 3(0 − (−2)) − 4(0 − 4) = 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

−18 −11 −10


Adjugate matrix adj(A) = C = −2 T ​ ​ 6 ​ −4 ​ ​

−4 −1 −8

From part (d), det(A) = −26.


−18 −11 −10
Therefore, A −1
= 1
−26
​ −2
​ ​ 6 −4 ​ ​

−4 −1 −8

−18/(−26) −11/(−26) −10/(−26) 9/13 11/26 5/13


−1
A = −2/(−26)
​ ​ 6/(−26) ​ −4/(−26) = 1/13 ​ ​ ​ ​ −3/13 ​ 2/13 ​ ​

−4/(−26) −1/(−26) −8/(−26) 2/13 1/26 4/13

You might also like