FYBSc Algebra Practice Question set

Dr. N. M. Phatangare
Associate Professor
Department of Mathematics
Fergusson College(Autonomous), Pune

n e
Pu
October 19, 2024

eg
lle
Co
Abstract

on
ss
This is a question set for practice. Questions are based on the FYBSc Algebra course.

gu
er
,F
1 Set, Relations and Functions
ics
at

1.1 Sets
m
he
at

1. Define union of sets.

fM

2. Define subset of a set.

to
en

3. Dfine power set of a set.

tm
ar

4. Define cardinality of a set.

ep
,D

5. If |A| = n then show that the cardinality of poser set of A is 2n . That is, prove that if |A| = n
re

then |P (A)| = 2n .
ga
an

6. Let A, B be any sets. Show that (A ∪ B)c = Ac ∩ B c and (A ∩ B)c = Ac ∪ B c , where Ac denotes
at

the complement of set A.

Ph

OR
M
N

State and prove the De’Morgan’s law for sets.

7. Let A1 , A2 , . . . , An be sets. Then show that

(a) (∪nk=1 Ak )c = ∩nk=1 Ack .

(b) (∩nk=1 Ak )c = ∪nk=1 Ack .

8. Show that for any sets A, B, C we have

(a) (A ∪ B) ∪ C = A ∪ (B ∪ C).

1
 (b) (A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C)
(c) (A ∩ B) ∪ C = (A ∪ C) ∩ (B ∪ C)

9. Define symmetric difference of two sets.

10. Show that A∆B = (A ∪ B)\(A ∩ B).

11. For n ∈ N , let An = (−n, n). Find ∩∞ ∞

n=1 An and ∪n=1 An .
 
−1 1
12. For n ∈ N, let An = , . Find ∩∞ ∞
n=1 An and ∪n=1 An .
n n

ne
 

Pu
1
13. For n ∈ N, let An = 1 − , 1 . Find ∩∞ ∞
n=1 An and ∪n=1 An .
n

eg
lle
 
1 1

Co
14. For n ∈ N, let An = −1 − , 1 + . Find ∩∞ ∞
n=1 An and ∪n=1 An .
n n

on
ss
 
1 1

gu
15. For n ∈ N, let An = −1 + , 1 − . Find ∩∞ ∞
n=1 An and ∪n=1 An .
n n
er
,F
16. For n ∈ N , let An = [−n, n]. Find ∩∞ ∞
n=1 An and ∪n=1 An .
ics
at

 
−1 1
m

17. For n ∈ N, let An = , . Find ∩∞ ∞

n=1 An and ∪n=1 An .
he

n n
at
fM

 
1
18. For n ∈ N, let An = 1 − , 1 . Find ∩∞ ∞
n=1 An and ∪n=1 An .
to

n
en

 
1 1
tm

19. For n ∈ N, let An = −1 − , 1 + . Find ∩∞ ∞

n=1 An and ∪n=1 An .
ar

n n
ep
,D

 
1 1
20. For n ∈ N, let An = −1 + , 1 − . Find ∩∞ ∞
n=1 An and ∪n=1 An .
re

n n
ga
an

1.2 Relation
at
Ph

1. Define the following:

M

(a) Cartesian product of two sets.

N

(b) Relation from set A to set B

(c) Relation on ste A
(d) Reflexive relation
(e) Symmetric relation
(f) Transitive relation
(g) Equivalence relation.
(h) Equivalence class

2
 (i) Partition of a set.

2. Let ∼ be an equivalence relation on the set X. Let x, y ∈ X. Let [x] denotes an equivalence
class of x. Show that

(a) If x ≁ y then [x] ∩ [y] = ∅.

(b) If x ∼ y then [x] = [y].

OR
Show that x ∼ y if and only if [x] = [y].

e
OR

n
Pu
Show that equivalence classes of x and y are either identical or disjoint.

eg
OR

lle
Co
Show that if x ∼ y then [x] = [y] and [x] ∩ [y] = ∅ otherwise.

on
OR

ss
gu
Show that x ∈ [y] if and only if [x] = [y].

er
OR ,F
ics
Show that if x ∈ [y] then [x] = [y] and if x ∈
/ [y] then [x] ∩ [y] = ∅.
at
m

3. Define partition of a set. Let A be a nonempty set. Show that corresponding to every partition
he

of A there is an equivalence relation and every equivalence relation on A defines a partition of

at
fM

a set.
to

4. Let X = {a, b, c}. Consider the following subsets of X × X. Determine which of the following
en

relations are Reflexive, Symmetric, Transitive:

tm
ar

(a) R1 = {(a, a), (a, b), (b, a)}

ep

(b) R2 = {(a, a), (b, b), (c, c)}

,D
re

(c) R3 = {(a, a), (b, b), (c, c), (a, b), (b, c), (a, c)}
ga

(d) R4 = {(a, a), (b, b), (a, b), (b, c), (a, c), (c, a), (b, a)}
an
at

(e) R5 = {(a, a), (a, b), (b, c), (a, c), (b, a), (c, b), (c, a)}
Ph

(f) R6 = {(a, a), (a, b), (b, c), (a, c), (b, a), (c, b), (c, a), (c, c), (b, b)}
M

(g) R7 = {(a, a)}

N

(h) R8 = {(b, b)}

(i) R9 = {(a, b), (b, a), (a, a), (b, b)}

Determine equivalence classes for those are equivalence relations.

5. The relation “is equal to”, denoted “=”, is an equivalence relation on the set of real numbers.

6. Define a relation R on set R as, for x, y ∈ R, xRy if y = x2 .

(a) Check whether R is reflexive, symmetric and transitive.

3
 (b) Determine R as a subset of R × R.
(c) Sketch R as a subset of R × R.

7. Define a relation “less than or equal to”, denoted by ≤, on the set of real numbers as, for
a, y ∈ R, x ≤ y if x is less than or equal to y. Is ≤ an equivalence relation?

8. Let X = Z. Define a relation ∼ on Z as, for a, b ∈ Z, a ∼ b if 3 divides a − b.

(a) Prove that ∼ is an equivalence relation.

(b) Show that [0] = [3] = [9] = [2022] = [1947], [1] = [4] = [10] = [2023], [2] = [5] = [2024].

e
(c) Determine all equivalence classes.

n
Pu
9. Let C = {x + iy|x, y√∈ R, i2 = −1}, the set of complex numbers. For z = a + ib ∈ C the

e
g
modulus of z is |z| = a2 + b2 and the argument of z is arg(z) = tan−1 (b/a). Define a relation

lle
Co
∼ on C as; for z1 , z2 ∈ C, z1 ∼ z2 iff |z1 | = |z2 |.

on
(a) Prove that ∼ is an equivalenece relation.

ss
gu
(b) Determine and sketch the equivalence classes of 1, i, 1 + i, 2 + 3i.

er
,F
10. Prove that the following relations are equivalenece relations and identify equivalence classes:
ics
at

(a) On R, x ∼ y, if x − y is an integer.
m

(b) On R2 , (x1 , y1 ) ∼ (x2 , y2 ) if x1 = x2 .

he
at

(c) On R2 − {(0, 0)}, (x1 , y1 ) ∼ (x2 , y2 ) if there exists a ∈ R, a ̸= 0, such that x1 = ax2 and
fM

y1 = ay2 .
to
en

11. Let X = Z. Define a relation ∼ pn Z as, fro a, b ∈ Z, a ∼ b iff 5x + 6y is divisible by 11. Show
tm

that ∼ is an equivalence relation.

ar
ep

12. Let A = Z × Z − {0}. Define a relation ∼ on X as, for (a, b), (c, d) ∈ X, (a, b) ∼ (c, d) if and
,D

only if ad = bc.
re
ga

(a) Show that ∼ is an equivalenec relation.

an

(b) Find equivalence classes of (1, 1), (0, 0), (−1, 2), (5, −3).
at
Ph

(c) Detremine all the equivalence classes.

M

(d) Detremine the set X/ ∼.

N

13. Let X = R2 . Define a relation ∼ on X as, for (a, b), (c, d) ∈ X , (a, b) ∼ (c, d) if and only if
a2 + b 2 = c 2 + d 2 .

(a) Show that ∼ is an equivalenec relation.

(b) Determine the equivalence class, [(0, 0)].
(c) Determine and sketch an equivalence classes, [(1, 1)], [(−1, 2)], [(10.0)], [(0, 10)].

14. Let X = R2 . Define a relation ∼ on X as, for (a, b), (c, d) ∈ X , (a, b) ∼ (c, d) if and only if
2a + 3b = 2c + 3d.

4
 (a) Show that ∼ is an equivalenec relation.
(b) Determine the equivalence class, [(0, 0)].
(c) Determine and sketch an equivalence classes, [(1, 1)], [(−1, 2)], [(10.0)], [(0, 10)].

15. On Z define a relation ∼ as, fro a, b ∈ Z, a ∼ b if and only if 5x + 2y is divisible by 7.

(a) Show that ∼ is an equivalence relation on Z.

(b) Determine an equivalence classes of [0], [1], [2], [−1].

16. Let X = R2 . Define a relation ∼ on X as, for (a, b), (c, d) ∈ X , (a, b) ∼ (c, d) if and only if

e
a − b2 = c − d 2 .

n
Pu
(a) Show that ∼ is an equivalenec relation.

e
g
lle
(b) Determine the equivalence class, [(0, 0)].

Co
(c) Determine and sketch an equivalence classes, [(1, 1)], [(−1, 2)], [(10.0)], [(0, 10)].

on
ss
17. (Recall: A square matrix A symmetric means A = At and At is the transpose of a matrix A)

gu
er
Let “≃” denote the relation on the set of symmetric matrices defined as follows. A ≃ B if
,F
A = B t . Show that this is an equivalence relation.
ics
at

18. Let A = {∆, $, □}. Write a power set of A.

m
he
at

1.3 Function
fM

1. Define the following:

to
en

(a) Function
tm
ar

(b) One-one/injective function

ep

(c) Onto/surjective function

,D

(d) Bijective function.

re
ga

(e) Inverse function of a function

an
at

(f) Graph of a function

Ph

(g) Increasing function

M

(h) Decreasing function

N

(i) Constant function

(j) Even function
(k) Odd function
(l) Identity function

2. Show that if f : A → B and g : B → C are injective functions then show that g ◦ f : A → C

is an injective/one-one function.

5
 3. Show that if f : A → B and g : B → C are surjective functions then show that g ◦ f : A → C
is a surjective/onto function.

4. Show that if f : A → B and g : B → C are bijective functions then show that g ◦ f : A → C

is a bijective function.

5. Let f : A → B and g : B → A be functions such that g ◦ f : A → A is identity function (That

is, (g ◦ f )(x) = x for every x ∈ A). Then show that f is one-one and g is onto.

6. Let f : A → B and g : B → A be functions such that f ◦ g : B → B is identity function (That

is, (f ◦ g)(x) = x for every x ∈ B). Then show that g is one-one and f is onto.

ne
7. Let f : A → B and g : B → A be functions such that g ◦ f : A → A is identity on A and

Pu
f ◦g : B → B is identity on B function (That is, g ◦f (x) = x for every x ∈ A and (f ◦g)(y) = y

eg
for every x ∈ B). Then show that f is bijection and g is the inverse function of f .

lle
Co
8. Show that a function f : A → B is invertible if and only if f is bijective.

on
ss
9. Let f : A → B be a function. Show that inverse of f is unique, if it exists.

gu
er
10. Let f : R → R defined by f (x) = 3x − 7. Show that f is bijection. Also find f −1 .
,F
ics
x
11. Let f : R → R be a function defined by f (x) = √ .
at

1 + x2
m
he

(a) Show that f is injective.

at
fM

(b) Find the range of f , f (R).

to

(c) Find the inverse function f −1 : f (R) → R.

en

(d) Sketch the graph of f .

tm
ar

12. Find a bijective function f : (1, 2) → (−1, 1).

ep
,D

13. Find a bijective function f : [0, 1] → [2, 6].

re
ga

14. Find a bijective function f : (a, b) → (c, d).

an
at

15. Find a bijective function f : (−1, 1) → R.

Ph

16. Find a bijective function f : (a, b) → (−1, 1).

M
N

17. Find a bijective function f : (a, b) → R.

18. Find a bijective function f : N → Z.

19. Let f : R2 → R2 be a function defined by f (x, y) = (x + y, x − y). Show that f is a bijective

function.

20. Let a, b, c, d ∈ R. Let f : R2 → R2 be a function defined by f (x, y) = (ax + by, cx + dy). Show
that f is a bijective if and only if ad − bc ̸= 0.

6
 1
21. Let f : (0, ∞) → R defined by f (x) = . Show that f is one-one. Also find the range of f
x
and sketch its graph.

22. f : [0, ∞) → R defined by f (x) = x2 . Show that f is one-one. Also, find the range of f and
sketch its graph.

23. Define an increasing function and give an example of an increasing function.

24. Define decreasing function and give an example of a decreasing function.

25. Define an even function and give an example of an even function.

ne
Pu
26. Define odd function and give an example of an odd function.

eg
27. Let f : R → R be any function. Let g : R → R be a function defined by g(x) = f (x) + f (−x)

lle
and h : R → R be a function defined by h(x) = f (x) − f (−x). Show that g is an even function

Co
and h is an odd function.

on
ss
28. Show that every function defined on R can be expressed as the sum of an even function and

gu
an odd function.
er
,F
ics

2 Real Numbers
at
m
he

2.1 Field Axioms

at
fM

1. State the inductive property of set of natural numbers.

to
en

2. State the well ordering propertiy of N.

tm

3. State the Archimedean property of R.

ar
ep
,D

4. State the algebraic properties of R.

re

OR
ga
an

State the field axioms of R.

at
Ph

5. Show that the additive identity in R is unique.

M

OR
N

Let y ∈ R. If x + y = x for every x ∈ R, then show that y = 0.

6. Show that additive inverse of every element in R is unique.

OR
Let x, y ∈ R. If x + y = 0 then show that y = −x.

7. Show that the multiplicative identity in R is unique.

OR
Let b ∈ R. If xb = x for every nonzero x ∈ R then show that b = 1.

7
 8. Show that multiplicative inverse of every nonzero element in R is unique.
OR
1
Let a, b ∈ R be nonzero elements. If ab = 1 then show that b = a−1 = .
a
9. Show that −(−1) = 1.

10. Let a ∈ R. Show that −(−a) = a.

11. Let a be a nonzero element in R. Show that (a−1 )−1 = a.

12. Show that 0 · a = 0 for every a ∈ R.

ne
Pu
1
13. Let a ∈ R. Show that if a > 0 then > 0.

eg
a

lle
Co
1
14. Let a ∈ R. Show that if a < 0 then < 0.
a

on
ss
15. State the order properties of R.

gu
er
16. State the trichotomy property of real numbers. ,F
ics

17. Prove the following:

at
m

(a) If ab = 0 then a = 0 or b = 0.
he

(b) For any x ∈ R we have x2 ≥ 0. Hence show that 1 > 0.

at
fM

(c) If ab > 0 then either a > 0 an b > 0 or a < 0 and b < 0.

to

(d) If ab < 0 then either a > 0 and b < 0 or a < 0 and b > 0.
en
tm

18. Determine the following sets:

ar
ep

(a) A = {x : x2 + 5x + 6 > 0}
,D

(b) A = {x : |2x − 1| > 0}

re
ga

(c) A = {x : x3 + x2 > 0}
an

1
at

(d) A = {x : x + x
≥ 0}
Ph

19. State and prove the arithmetic mean-geometric mean (AM-GM) inequality for real numbers.
M
N

20. Use AM-GM inequality to prove the following:

(a) For nonnegative numbers a, b, c we have
√
(a + 1)(b + 1)(c + 1) ≥ 8 abc.
p
|ab| 1
(b) For a, b ∈ R we have ≤ .
|a| + |b| 2
ab2 1
(b) For a, b ∈ R we have ≤ .
a2 + b 4 2

8
2.2 Absolute value
1. Show that

(a) |x| = | − x| for every x ∈ R.

(b) For any x, y ∈ R we have |x − y| = |y − x|.
(c) For x, y ∈ R we have |x − y| = 0 ⇔ x = y.
(d) |xy| = |x||y| for any x, y ∈ R.
(e) |x|2 = x2 = |x2 | for every x ∈ R.
(f) |x| ≤ a if and only if −a ≤ x ≤ a.

ne
Pu
2. State and prove the triangle inequality for absolute value.

eg
OR

lle
Co
Prove that for any a, b ∈ R, |a + b| ≤ |a| + |b|.

on
3. State and prove the triangle inequality for the absolute value. Further show that the equality

ss
gu
hold in triangle inequality if and only if the numbers are both non-negative or both non-positive.

er
OR
,F
ics

Show that for any a, b ∈ R we have |a + b| ≤ |a| + |b|. Further, show that equality holds in
at

triangle inequality if and only if ab ≥ 0.

m
he

OR
at
fM

Show that |a + b| ≤ |a| + |b|. Also, show that |a + b| = |a| + |b| if and only if ab ≥ 0.
to

OR
en

Show that |a+b| ≤ |a|+|b|, Further, show that |a+b| = |a|+|b| if and only if either a > 0, b > 0
tm

or a < 0, b < 0 or a = 0 or b = 0.
ar
ep

4. State the triangle inequality. Hence, show that for any a, b ∈ R we have ||a| − |b|| ≤ |a − b|.
,D
re

5. State the triangle inequality for absolute value. Hence, show that for any x, y, z ∈ R we have
ga

|x − y| ≤ |x − z| + |z − y|. Further show that |x − y| = |x − z| + |z − y| if and only if either

an

x ≤ z ≤ y or y ≤ z ≤ x.
at
Ph

6. What is distance? List the basic properties of distance. Hence show that for x, y ∈ R,
M

d(x, y) = |x − y| defines a distance between x and y.

N

7. Let a1 , a2 , . . . , an be any real numbers. Show that

|a1 + a2 + · · · + an | ≤ |a1 | + |a2 | + . . . |an |.

(Hint: Use induction.)

8. Determine the following sets:

(a) A = {x : |2x − 1| < 3}

(b) A = {x : 1 < |x − 2| < 2}

9
 (c) A = {x : |x + 1| + |x| = 3}
(d) A = {x : 1 < |x − 2| + |x + 1| < 3}

9. Define δ-neighbourhood of a ∈ R. Hence, find the following neighbourhoods:

N1/2 (1), N1 (1/2), N0.1 (1/2).

10. If 0 ≤ a < ε for every ε > 0, then show that a = 0.

11. Show that if |x − a| < ε for every ε > 0 then x = a.

ne
Pu
2.3 LUB axiom (Supremum and infimum)

eg
1. Define supremum of a subset of R.

lle
Co
2. Define infimum of a subset of R.

on
ss
3. Define upper bound of a set.

gu
er
4. Define lower bound of a set. ,F
ics

5. Define maximum/largest/highest element of a set in R.

at
m

6. Define smallest/least/minimum element of a set.

he
at

7. Define maximum element of a set. Show that maximum element of a set is unique if it exists.
fM
to

8. Define smallest element of a set. Show that the smallest element of set is unique if it exists.
en
tm

9. Show that supremum of a set if unique if it exists.

ar

10. Show that infimum of a set is unique if it exists.

ep
,D

11. State and prove the Archimedean property of real numbers.

re
ga

 
1
an

12. Let A = : n ∈ N . Show that sup A = 1 and inf A = 0.

n
at
Ph

13. Let A = {x : 0 < x < 1} = (0, 1). Show that sup A = 1 and inf A = 0.
M
N

 
1
14. Let A = 1 + : n ∈ N . Show that sup A = 2 and inf A = 1.
n
15. Find supremum and infimum of the following sets:

(−1)n
 
(a) 1 + :n∈N
n
 
1 1
(b) + : m, n ∈ N
n m
(c) {1 + (−1)n : n ∈ N}

10
 2 + (−1)n
 
(d) :n∈N
n
 
1
(e) x + : x ̸= 0 .
x

16. State the Archimedean property. Hence show for every t ∈ (0, 1) that there is a natural number
1
n such that 0 < < t.
n
17. Let x > 0. Show that there is a natiral number n such that n − 1 ≤ x < n.

e
18. State and prove that density theorem.

n
Pu
OR

e
g
Let x, y ∈ R with x < y. Show that there is a rational number r such that x < r < y.

lle
Co
OR

on
Show that between any two real numbers there is a rational number.

ss
gu
OR

er
Let a < b. Show that (a, b) ∩ Q ̸= ∅. ,F
ics
OR
at

Let a ∈ R. Show that for every δ > 0 we have (a − δ, a + δ) ∩ Q ̸= ∅. That is, Nδ (a) ∩ Q ̸= ∅.
m
he

OR
at
fM

Show that for any a ∈ R and for any ε > 0, the interval (a − ε, a + ε) contains a rational
to

number.
en

19. Show that between any two real numbers there is an irrational number.
tm

√ √
ar

20. State the density theorem. Hence find an irrational number between 2 and 3.
ep
,D

1
21. Show that for every n ∈ N there is a rational number rn such that |1 − rn | < .
re

n
ga
an

1
22. Let a ∈ R. Show that for every n ∈ N there is a rational number rn such that |a − rn | < .
at

n
Ph

23. Find the solution set of a given system of linear equations.

M
N

3 Matrices
3.1 System of linear equations
1. Define the following:

(a) System of linear equations

(b) Augmented matrix
(c) Consistent system

11
 (d) Inconsistent system
(e) Homogeneous system
(f) Non-homogeneous system
(g) Over-determined system
(h) Under-determined system
(i) Solution of system of linear equations
(j) Pivot variables or basic variables
(k) Non-pivot variables or free variables.

en
(l) Elementary matrix

Pu
(m) Row echelon form of matrix

e
g
lle
(n) Reduced row echelon form of matrix.

Co
2. State the conditions for consistency of a system of linear equations

on
ss
gu
3. Define the types of elementary row operations.

er
4. Consider a system
,F
ics

ax + by =f
at
m

cx + dy =g.
he
at

If the system is consistent for any f, g ∈ R then show that ad − bc ̸= 0.

fM
to

5. Consider a system
en
tm

ax + by =f
ar

cx + dy =g.
ep
,D

Show that the system has unique solution if and only if ad − bc ̸= 0. Further if ad − bc ̸= 0
re

then find solution of the system.

ga
an

6. Consider a system
at
Ph

ax + 3y =4
M

−2x + 5y =7.
N

If the system is consistent for then find the value of a.

7. Consider a system

x + 3y =4
−2x + ay =7.

Find the value of a such that the system has

(i) no solution (ii) unique solution (iii) infinitely many solutions.

12
 8. Solve the given system.

9.

10. Consider a system

x + 3y =b
−2x + ay =7.

Find the value of a and b such that the system has

(i) no solution (ii) unique solution (iii) infinitely many solutions.

en
Pu
11. Define linearly independent vectors in Rn .

e
g
lle
12. Let u = (1, 2, 3), v = (−1, 2, 1), w = (3, 4, 2).

Co
(i) Find α, β, γ such that

on
αu + βv + γw = (1, 2, 3).

ss
gu
(ii) Find α, β, γ such that
er
,F
αu + βv + γw = 0 = (0, 0, 0).
ics

(iii) Are u, v, w linearly independent?

at
m
he

3.2 Inverse of a matrix

at
fM

1. Define inverse of a matrix. Find inverse of a given matrix using the elementary row operations.
to

(For examples see the notes.)

en
tm

2. Find inverse of a given block matrix. (For examples see the notes.)
ar
ep

 
2 3 −1
,D

3. Let A = 1
 0 2 . Is A invertible? If yes then find
re

1 3 4
ga

(i) first column of A−1 (ii) second column of A−1 (iii) third column of A−1 .
an
at

Hend find A−1 .

Ph
M

4. Given a system AX = b of n linear equations and n unknowns. Show that if A is invertible

thn the system has unique solution given by X = A−1 b.
N

3.3 Determinant
1. Define determinant of a matrix.

2. Write the formula for the determinant of a 4 × 4 matrix by cofactor expansion along the first
column.

3. Write the formula for the determinant of a 4 × 4 matrix by cofactor expansion along the second
row.

13
 4. Write the formula for the determinant of a 4 × 4 matrix by cofactor expansion along the fourth
row.

5. Use elementary row operations to find determinant of a given matrix.

6. What is determinant of elementary matrices?

7. If det A = 5, then find det(AT ), det(2A), det(A−1 ), det(A2 ), det(A + 5A).

8. Suppose that det A = 2024 and P is an invertible matrix. Find det(P −1 AP ).

9. State the Cramer’s Rule for the system of linear equations. Hence solve the given system using

ne
the Cramer’s rule.

Pu
10. Show that area o atrianle with vertices (x1 , y1 ), (x2 , y2 ), (x3 , y3 ) is

eg
lle
Co
x y 1
1 1 1
x2 y 2 1 .

on
2
x3 y 3 1

ss
gu
er
 
1 a a2 ,F
11. If A = 1 b b2  then show that det A = (b − a)(c − b)(c − a).
ics

1 c c2
at
m
he

12. Find determinant of 

22 23 24

at

1 2
fM

1
 3 32 33 34 

42 43 44 
to

1
A= 4 .
52 53 54 
en

1 5
tm

1 6 62 63 64
ar

(Hint: A is Vandermonde matrix.)

ep
,D
re

3.4 Eigenvalues and eigenvectors

ga
an

1. Define the following:

at
Ph

(a) Eigenvalue of a matrix.

M

(b) Eigenvector of a matrix.

N

(c) Characteristic polynomial

2. Given a matrix, find its eigenvalues and eigenvectors. (For matrices see the notes.)

3. Let A be a matrix with eigenvalue λ and the corresponding eigenvector v. Show that if k ̸= 0
then kv is an eigenvector of A corresponding to the eigenvalue λ.

4. Let A be a matrix with eigenvalue λ and the corresponding eigenvector v. Show that lambdak
is an eigenvalue of Ak with the corresponding eigenvector v.

5. If eigenvalues of a 5 × 5 matrix A are 1, 2, 3, 4, 5 then find eigenvalues of A−1 , A2 , A2024 .

14
6. Given a mtrix A, find an invertible matrix P such that P −1 AP is a diagonal matrix.

7. Define similar matrices.

8. State the Cayley-Hamilton theorem. Hence find inverse of a given matrix A.

 
7 2
9. Let A = .
−4 1

(a) Find characteristic polynomial of A.

(b) Find eigenvalues and eigenvectors of A.

e
 

n
−1 5 0

Pu
(c) Find a matrix P such that P AP = .
0 3

eg
(d) Find A−1 .

lle
Co
(e) Find A10 , A100 , A2024 .

on
ss
gu
er
,F
ics
at
m
he
at
fM
to
en
tm
ar
ep
,D
re
ga
an
at
Ph
M
N

15