LA Key

15
LINEAR ALGEBRA
1. The number of an integer n × n matrix with determinant 1 is cn =

1 2n

n+1 n
, n ≥ 1.
2. If sum of the elements in each column (row) of a square matrix of order

n is k, then the sum of the elements in each column (row) of Am will
be k m .
3. Let A be an m×n matrix with all entries are distinct. Then the number
of sub matrix of order i × j is mi × nj .
4. The number of sub matrix of all order of a m × n matrix A with all

m P
n
m n

= (2m − 1)(2n − 1).
P
entries are distinct is i
× j
i=1 j=1
5. Let A be an m × n matrix with all entries are equal. Then the number
of sub matrix of order i × j is 1.
6. The number of sub matrix of all order of a m × n matrix A with all

entries are equal is nm.
7. Let V be a finite-dimensional vector space, and let T : V → V be

linear.
(i) If rank(T ) = rank(T 2 ), then R(T ) ∩ N (T ) = {0} and V = R(T ) ⊕
N (T ).
(ii) V = R(T k ) ⊕ N (T k ) for some k > 0.
 
a 0 ··· 0 b
0 a · · · b 0
8. Let ∆2n =  .. .. . Then det(∆2n ) = (a2 − b2 )n .
 
.. .. 
. . · · · . .
b 0 · · · 0 a 2n×2n
9. Let A ∈ Mm×n (F ). Then rank(A∗ A) = rank(A).
10. If A is an m × n matrix such that rank(A) = n, then A∗ A is invertible.

√
11. For any square matrix A, k A k is finite and, in fact, equals λ, where
λ is the largest eigenvalue of A∗ A.
12. Let A be an invertible matrix. Then k A−1 k= √1 ,

λ
where λ is the
smallest eigenvalue of A∗ A.
16
13. Let T be a linear operator on V whose characteristic polynomial splits,

and let λ1 , λ2 , · · · , λk be the distinct eigenvalues of T . Then T is diag-
onalisable iff rank(T − λi I) = rank(T − λi I)2 for 1 ≤ i ≤ k.
14. A linear operator T on a finite-dimensional vector space V is diagonal-

isable iff its Jordan canonical form is a diagonal matrix.
15. The system of linear equations Ax = b has a solution iff b ∈ R(A)

(Row space of A).
16. An orthonormal set in an inner product space is linearly independent.
17. Let W1 and W2 be subspaces of a finite dimensional inner product space

V . Then
(i) (W1 + W2 )⊥ = W1⊥ ∩ W2⊥
(ii)(W1 ∩ W2 )⊥ = W1⊥ + W2⊥

a b
18. Let A = . Then A is diagonalisable iff
c d
(a + d)2 > 4(ad − bc).
19. For any square matrix A = [aij ] of order n,

n
P
R(A) = max{Ri (A) = | aij |: 1 ≤ i ≤ n}
j=1
n
P
C(A) = max{Cj (A) = | aij |: 1 ≤ j ≤ n}
i=1
si = Ri (A)− | aii |
20. For any square matrix A of order n, every eigen value λ of A satisfies
| λ − all |≤ sl for some 1 ≤ l ≤ n.
21. For any square matrix A of order n, every eigen value of A satisfies
| λ |≤ min{R(A), C(A)}.
 
a b1 0 · · · · · · 0
c1 a
 b2 ··· 

22. The eigen value of the tridiagonal matrix A = 
 c2 a b3 

 .. 
 . ··· ··· a bn−1 
··· cn−1 a n×n
q
(n ≥ 3) satisfies the inequality | λ − a |< 2 max | bi | max | ci |.
i i
17
23. If A is idempotent. then Rank(A) = T rac(A).
24. If A is symmetric matrix, then Rank(A) is equal to the number of

non-zero eigen values of A.
25. Test for diagonalization

Let T be a linear operator on an n-dimensional vector space V . Then
T is diagonalizable iff
(i) The characteristic polynomial of T splits.
(ii) For each eigen value λ of T , the multiplicity of λ equals
n − rank(T − λI).
26.

A B
rank = rank(A) + rank(D − BA−1 C)
C D
= rank(D) + rank(A − CD−1 B).
27.

A B
det = det(A)det(D − BA−1 C)
C D
= det(D)det(A − CD−1 B).
28. Let T be a linear operator on a finite dimensional vector space over

C. Then T is diagonalisable iff T is annihilated by some polynomial f
over C which has distinct roots.
29. A linear operator T on a finite-dimensional vector space V is diagonal-

izable iff V is the direct sum of the eigen spaces of T .
30. Any projection E on a vector space V is diagonalizable.
31. If N is nilpotent, then I + N is invertible.
32. If N is nilpotent, then det(I + N ) = 1.
33. If A is a matrix and det(I + tA) = 1 for all t, then A is nilpotent.
34. Every singular matrix can be written as a product of nilpotent matrices.

18
35. For an n × n square matrix N with real (or complex) entries, the
following are equivalent:
(i) N is nilpotent
(ii) The minimal polynomial of N is λk for some positive integer k ≤ n
(iii) The characteristic polynomial for N is λn
(iv) The only eigen values of N is 0
(v) trace(N k ) = 0 for all k > 0.
36. Dimension of the vector space of n × n matrices when trace is zero is

n2 − 1.
n
P
37. If V = {A = (aij )m×n : aij = 0, ∀i = 1, 2, · · · , m}
j=1
(i) When column is zero then dimension of V is mn − m

(ii) If one row and one column is zero,then its dimension is
(m − 1)(n − 1) = mn − m − n + 1
P n(n + 1)
38. The dimension of symmetric matrices of vector space is n=
2
P n(n − 1)
39. The dimension of skew symmetric matrices is (n − 1) =
2
n(n + 1)
40. The dimension of symmetric matrices with trace zero is −1
2
41. The dimension of skew-symmetric matrices with trace zero is
n(n − 1)
2
42. Vector space of n × n matrix with complex field over the real number
have dimension 2n2 .
43. Dimension of n × n Hermitian matrices with complex entry over the

field of real numbers is 2n2 .
44. Vector space of n × n skew-Hermitian matrices over R, then it’s dimen-

sion is n2 .
P
45. Vector space of upper triangular matrices, it’s dimension is n
P
46. Vector space of lower triangular matrices, it’s dimension is n
19
47. The dimension of scalar matrices is 1.
48. Dimension of diagonal matrices is n.
49. Dimension of scalar matrices and trace zero is 0.
50. The number of basis in the finite dimensional n vector space over a
finite field Zp is,
(pn − 1)(pn − p) · · · (pn − pn−1 )

n!
51. The number of subspaces of dimension r is
(pn − 1)(pn − p) · · · (pn − pr−1 )

(pr − 1)(pr − p) · · · (pr − pr−1 )
52. | adjA |=| A |n−1 , if |A| =

6 0
53. | adj. adj · · · adjA |=| A |(n−1)r
54. (i) rank(A) = n ⇒ rank(adjA) = n

(ii) rank(A) = n − 1 ⇒ rank(adjA) = 1
(iii) rank(A) < n − 1 ⇒ rank(adjA) = 0
(iv) rank(AB) ≤ min{rank(A), rank(B)}
55. Let A and B be any n × n matrix.

Then rank(A)+rank(B)−n ≤ rank(AB) ≤ min{rank(A), rank(B)}.
56. rank(A + B) ≤ rank(A) + rank(B).
57. Let A be an m × n matrix and B be any n × p matrix. Then

Then rank(AB) ≥ rank(A) + rank(B) − n.
58. | A − λI |= λ3 − trace(A)λ2 + trace(adj(A))λ− | A |= 0.
59. Sum of the eigen values = trace(A).
60. Product of eigen values = det(A).
61. If A is nilpotent then A + λI is always non-singular for any value of λ.
62. The eigen values of symmetric / Hermitian matrix are real.

20
63. The eigen values of skew-Hermitian is purely imaginary.
64. The skew-Hermitian matrices have even rank.
65. The determinant of skew-Hermitian matrix of odd order is zero.
66. For a 2 × 2 matrix, the eigen values are

p
[(a11 + a22 ) ± 4a12 a21 + (a11 − a22 )2 ]
λ=
2
67. If T : R2 → R2 defined by
T (x, y) = (ax + by, cx + dy) is C-linear iff a = d and b = −c.
68. Let A be an n × n matrix (aij ) with complex entries. Suppose |aii | >
Pn
|aij |, j 6= i, for all i = 1, 2 · · · , n. Then A is invertible.
j=1
69. Let A be an m × n matrix and WA = {x ∈ Rm | xA = 0}. Then

dimWA = m − rank(A).
70. Let A be an m × n matrix and B be an n × p matrix and WAB = {x ∈

Rm | xAB = 0}. Then dimWAB = m − rank(AB).
REAL ANALYSIS
1. Every function is a curve but every curve may not be a function.
2. Card(Z) = Card(N × N) = Card(Q) = ℵ0 (Aleph naught).
3. Card(R) = Card(R × R) = c (Continum).
4. There is a one-one correspondence R → R × R.
5. There is a one-one correspondence between Rm and Rn for all positive

integers m and n.
6. Every continuous open mapping of R to R is monotonic.
7. A metric space which is not complete is the space of all rational num-
bers, with d(x, y) = |x − y|.
8. Suppose {sn } is monotonice. Then {sn } converges iff it is bounded.
9. The product of two convergent series converges, and to the right value,
if at least one of the two series coverges absolutely.

LA Key

Uploaded by

Copyright:

Available Formats

LA Key

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

LA Key

Uploaded by

Copyright:

Available Formats

15

1. The number of an integer n × n matrix with determinant 1 is cn =

2. If sum of the elements in each column (row) of a square matrix of order

4. The number of sub matrix of all order of a m × n matrix A with all

6. The number of sub matrix of all order of a m × n matrix A with all

7. Let V be a finite-dimensional vector space, and let T : V → V be

9. Let A ∈ Mm×n (F ). Then rank(A∗ A) = rank(A).

10. If A is an m × n matrix such that rank(A) = n, then A∗ A is invertible.

12. Let A be an invertible matrix. Then k A−1 k= √1 ,

13. Let T be a linear operator on V whose characteristic polynomial splits,

14. A linear operator T on a finite-dimensional vector space V is diagonal-

15. The system of linear equations Ax = b has a solution iff b ∈ R(A)

16. An orthonormal set in an inner product space is linearly independent.

17. Let W1 and W2 be subspaces of a finite dimensional inner product space

19. For any square matrix A = [aij ] of order n,

23. If A is idempotent. then Rank(A) = T rac(A).

24. If A is symmetric matrix, then Rank(A) is equal to the number of

25. Test for diagonalization

28. Let T be a linear operator on a finite dimensional vector space over

29. A linear operator T on a finite-dimensional vector space V is diagonal-

30. Any projection E on a vector space V is diagonalizable.

31. If N is nilpotent, then I + N is invertible.

32. If N is nilpotent, then det(I + N ) = 1.

33. If A is a matrix and det(I + tA) = 1 for all t, then A is nilpotent.

34. Every singular matrix can be written as a product of nilpotent matrices.

36. Dimension of the vector space of n × n matrices when trace is zero is

(i) When column is zero then dimension of V is mn − m

43. Dimension of n × n Hermitian matrices with complex entry over the

44. Vector space of n × n skew-Hermitian matrices over R, then it’s dimen-

47. The dimension of scalar matrices is 1.

48. Dimension of diagonal matrices is n.

49. Dimension of scalar matrices and trace zero is 0.

(pn − 1)(pn − p) · · · (pn − pn−1 )

(pn − 1)(pn − p) · · · (pn − pr−1 )

52. | adjA |=| A |n−1 , if |A| =

53. | adj. adj · · · adjA |=| A |(n−1)r

54. (i) rank(A) = n ⇒ rank(adjA) = n

55. Let A and B be any n × n matrix.

56. rank(A + B) ≤ rank(A) + rank(B).

57. Let A be an m × n matrix and B be any n × p matrix. Then

58. | A − λI |= λ3 − trace(A)λ2 + trace(adj(A))λ− | A |= 0.

59. Sum of the eigen values = trace(A).

60. Product of eigen values = det(A).

61. If A is nilpotent then A + λI is always non-singular for any value of λ.

62. The eigen values of symmetric / Hermitian matrix are real.

63. The eigen values of skew-Hermitian is purely imaginary.

64. The skew-Hermitian matrices have even rank.

65. The determinant of skew-Hermitian matrix of odd order is zero.

66. For a 2 × 2 matrix, the eigen values are

69. Let A be an m × n matrix and WA = {x ∈ Rm | xA = 0}. Then

70. Let A be an m × n matrix and B be an n × p matrix and WAB = {x ∈

1. Every function is a curve but every curve may not be a function.

2. Card(Z) = Card(N × N) = Card(Q) = ℵ0 (Aleph naught).

3. Card(R) = Card(R × R) = c (Continum).

4. There is a one-one correspondence R → R × R.

5. There is a one-one correspondence between Rm and Rn for all positive

6. Every continuous open mapping of R to R is monotonic.

8. Suppose {sn } is monotonice. Then {sn } converges iff it is bounded.