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.
 21

10. For any set A,

(i) int(A) ⊂ A ⊂ cl(A) = A ∪ A0 .

11. (i) If A ⊂ B, then int(A) ⊂ int(B).

(ii) int(A) ∪ int(B) ⊂ int(A ∪ B).
(iii) int(A) ∩ int(B) = int(A ∩ B).

12. Suppose that {zn } is a complex sequence with limit z and suppose that
{an } is a positive sequence such that limn→∞ (a1 + a2 + · · · + an ) = +∞.
a1 z1 + a2 z2 + · · · + an zn
Then lim = z.
n→∞ a1 + a2 + · · · an
xn
13. lim = +∞ if x > 1 and k ∈ N.
n→∞ nk

14. lim nk xn = 0 if |x| < 1 and k ∈ N.

n→∞
1
15. lim x n = 1 if x > 0.
n→∞

kn
16. For each n ∈ N, lim = 0.
k→∞ 2k

2nk
17. For each n ∈ N, lim = 0.
k→∞ k!

18. For m ≥ 2,
1
(i) m → 0 as m → ∞.
k
1
(ii) k → 0 as m → ∞.
m
√
19. Let a1 , a2 , · · · , ak ∈ R+ . Then lim n
an1 + an2 + · · · ank = max{a1 , a2 , · · · , ak }.
n→∞

20. Every increasing sequence in Q which is bounded above is a Cauchy

sequence.

21. Every decreasing sequence in Q which is bounded below is a Cauchy

sequence.
P P
22. Let xn be a series in R such that xn ≥ 0 for all n ∈ N. Then xn
converges iff (sn ) is bounded.
P
If (xn ) is a decreasing sequence in [0, ∞), then
23. P xn converges iff
2n x2n converges.
22

24. π = 12 min{t > 0 | eit = 1}.

25. Every Boral set is measurable set.

26. There exists measurable set which is not Boral set.

27. For any set A, there exists a measurable set E containing A (i.e., E ⊂
A) and such that m ∗ (A) = m(E).

28. Every non-empty open set has positive measure.

29. There exists a non-measurable set.

Rx dy
30. log x = .
1 y

31. If f : R → R is one-one, then d(a, b) = |f (a) − f (b)| is metric.

32. The directional derivative of z = f (x, y) in the direction of unit vector

u = (a, b) is

f (x + ah, y + bh) − f (x, y)

Du f (x, y) = lim
h→0 h

33. Du f (x, y) = Of (x, y)· u

34. At a point (x, y), the maximum value of the directional derivative
Du f (x, y) is | Of (x, y) |.

35. If f (x, y) is differentiable, then f has a directional derivative in the

direction of every unit vector u = (a, b) and Du f (x, y) = fx (x, y)a +
fy (x, y)b.

36. Let {xn } be a sequence such that there exist A > 0 and c ∈ (0, 1) for
which | xn+1 − xn |≤ Acn for any n ≥ 1. Then {xn } is Cauchy.

37. {pn } is a Cauchy sequence iff lim diam EN = 0.

n→∞

Where EN = {pN , pN +1 , · · · } and diam A = sup{d(x, y)|x, y ∈ A}

38. Let {fn } is the Fibonacci number sequence, then fn < 2n .

39. Test for continuity at x = 0

Left-hand limit = lim f (0 − h)
h→0

Right-hand limit = lim f (0 + h)

h→0
 23

40. Test for differentiability at x = 0

f (0 − h) − f (0)
Left-hand derivative = lim
h→0 −h
f (0 + h) − f (0)
Right-hand derivative = lim
h→0 h
41. As h → 0, sin( h1 ) oscillates between −1 and 1.

42. As h → 0, cos( h1 ) oscillates between −1 and 1.

43. Let f (x) be a periodic function. If lim f (x) exists, then f (x) is a
x→∞
constant.

44. lim sinx does not exist.

x→∞

45. If f 00 (x) exists and is continuous in a neighborhood of x = a, then

f (a + h) − 2f (a) + f (a − h)
lim 2
= f 00 (a)
h→0 h

46. If T : Rn −→ Rm is a linear map, then T is differentiable at every

a ∈ Rn with T 0 (a) = T (a).

47. If f 00 (x) > 0 for all x ∈ R, then f [ 12 (x1 + x2 )] ≤ 21 [f (x1 ) + f (x2 )].
∞
P
48. Suppose a1 ≥ a2 ≥ · · · ≥ 0. Then the series an converges iff the
n=1
∞
2k a2k converges.
P
series
k=0

49. The following functions are uniformly continuous

(i) f : [1, ∞) −→ R
(ii) Any linear map T : Rm −→ Rn
(iii) f : R −→ R such that f 0 (x) exists and is bounded.
√ a+b
50. The Arithmetic-Geometric Mean Inequality for a, b is ab 6 2
.

51. Let (xn ) be a sequence of real numbers and let x ∈ R. If (an ) is a

sequence of positive real numbers with lim (an ) = 0 and if for some
n→∞
constant c > 0 and some m ∈ N, we have
| xn − x |6 can , n > m. Then lim xn = x.
n→∞
24

52. If 0 < b < 1, then lim bn = 0.

n→∞

1
53. If c > 0, then lim c n = 1.
n→∞

1
54. lim n n = 1.
n→∞

sin n
55. lim = 0.
n→∞ n
xn+1
56. Let (xn ) be a sequence of positive real numbers such that l = lim
n→∞ xn
exists. If |l| < 1, then (xn ) converges and lim (xn ) = 0
n→∞

57. xn = 1 + 12 + 31 + · · · + 1
n
for n ∈ N, is a divergent sequence.

58. lim (1 + n1 )n = e, 2 < e < 3

n→∞

59. lim (1 + na )bn = eab .

n→∞

60. lim (1 + xa )bx = eab .

x→∞

61. A continuous periodic function on R is bounded and uniformly contin-

uous on R.

62. If f : A −→ R is a Lipschitz function, then f is uniformly continuous

on A.

63. If lim |f (x)| = 0, then f is uniformly continuous.

|x|→∞

64. If f has compact support, then f is uniformly continuous.

65. Suppose F is differentiable on I(interval) | f 0 (x) |6 M , ∀x ∈ I, then

F is uniformly continuous on I.

66. lim x sin( x1 ) = 0.

x→0

67. Suppose a ∈ [0, 1], then there exists sequences xn > 0 and yn > 0 such
that xn → 0, yn → 0 and xynn → a.

68. Suppose that φ : [0, ∞) → R is concave and φ(0) = 0. Then

φ(x + y) ≤ φ(x) + φ(y), ∀x, y > 0.

 25

69. Let f be a continuous real valued function on [0, ∞) such that lim f (x)
x→∞
exists (finitely). Then f is uniformly continuous.

70. f : R → R continuous function and |f (x) − f (y)| ≥ |x − y| for all x

and y. Then f (R) = R.

71. Let f : [0, ∞) → R be a uniformly continuous function with the prop-

Rb
erty that lim f (x)dx exists (as a finite limit). Then lim f (x) = 0.
b→∞ 0 x→∞

72. A real valued function of a complex variable either has derivative zero
or the derivative does not exist.

73. Let I ⊆ R be an interval and let f : I → R be monotone on I. Then

the set of points D ⊆ I at which f is discontinuous is a countable set.

74. If h : R → R satisfies the identity h(x + y) = h(x) + h(y), ∀x, y ∈ R

and if h is continuous at a single point x0 , then h is continuous at every
point of R.

75. If h is a monotone function satisfying h(x + y) = h(x) + h(y), then h

must be continuous on R.

76. If f is bounded and there is a finite set E such that f is continuous at

every point of [a, b] \ E, then f is Riemann integrable.

77. A bounded function f : [a, b] → R is Riemann integrable iff it is

continuous almost every where on [a, b].

78. The only connected subsets of the real line are the intervals ( open,
closed, semi-open or semi-closed ).

79. A non-empty open subset of the complex plane is connected iff any
two of its points can be joined by polygon lying in the set having its
segments parallel to the coordinates axes.

80. Every compact metric space is complete.

81. A subset S of a metric space X is compact iff S is complete and totally

bounded.

82. A metric space is compact iff if every infinite sequence has a limit
point.

83. Continuous image of connected set is connected.

26

84. Continuous image of a compact set is compact.

85. Suppose E is compact, f is continuous on E iff Graph(f ) is compact.

86. Let f be a differentiable real function on (a, b). f is convex if and only
if f 0 is monotonically increasing.

87. (X, τ ) be a compact topological space and F be a closed subset of X.

Then F is compact.

88. (X, τ ) be a Hausdorff topological space and F be a compact subset of

X. Then F is closed.

89. A complex sequence {zn } converges iff if it is Cauchy.

90. Suppose lim fn (x) = f (x) (x ∈ X). Let Mn = sup | fn (x) − f (x) |.
n→∞ x∈X
Then fn → f uniformly on X iff if Mn → 0 as n → ∞.

91. Suppose {fn } is a sequence of functions definedP on X, and suppose

| fn (x) |≤ M
P n (x ∈ X, n = 1, 2, · · · ). Then fn converges uniformly
on X if Mn converges.

92. The limit of uniformly convergent sequence of complex continuous func-

tions on a metric space is continuous.

93. f : X → Y continuous. Then the graph of f with the subspace topology

of X × Y is homeomorphic to X.
(i) R is homeomorphic to y = x2 . Let f : R → R , f (x) = x2

94. Let f : X → Y be a homeomorphism and let A ⊂ X. Then f in-

duces homeomorphism between A and f (A), (and between X\A and
f (X\A)).
(i) [0, 1) is not homeomorphic to (0, 1), take f = I.

95. Any two open intervals of the real line are homeomorphic.

96. Any two closed intervals of the real line are homeomorphic.

97. Let f : X → Y be a continuous bijection. If X is compact and Y is

Hausdorff then f is a homeomorphism.

98. A bijective continuous map is a homeomorphism iff it is open map.

99. A bijective continuous map is a homeomorphism iff it is closed map.

 27

100. A bijective continuous map from a compact metric space to another

metric space is a closed map and hence is a homeomorphism.

cn is convergent and | arg cn |≤ α < π2 , then it converges abso-

P
101. If
lutely.

102. If ϕ : [a, b] −→ R is a step function, then ϕ ∈ R[a, b]

103. If f : [a, b] −→ R is continuous on [a, b], then f ∈ R[a, b]

104. If f : [a, b] −→ R is monotone on [a, b], then f ∈ R[a, b].

105. Two norms are equivalent

√
(i) k x k2 ≤k x k1 ≤ n k x k2
√
(ii) k x k∞ ≤k x k2 ≤ n k x k∞
(iii) k x k∞ ≤k x k1 ≤ n k x k∞
1 √1
(iv) d
k x k1 ≤ d
k x k2 ≤k x k∞ ≤k x k2 ≤k x k1

106. Box topology on Rw

(i) The box topology is completely regular.
(ii) The box topology is neither compact nor connected.
(iii) The box topology is not first countable.
(iv) Neither is the box topology separable.
(v) The box topology is para compact if the continuum hypothesis is
true.

107. Every metric space is normal.

108. Every compact Hausdorff space is normal.

109. ({0, 1}N , box topology) is not compact.

110. The orthonormal group

O(n) = {A ∈ M at(n; R) : AAT = I} is compact.

111. The Special orthogonal group

SO(n) = {A ∈ O(n) : det(A) = 1} is a closed subgroup of the compact
group O(n), and so is itself compact.

112. The Unitary group

U (n) = {A ∈ M at(n; C) : T ∗ T = I} is compact.
28

113. The Special unitary group

SU (n) = {A ∈ U (n) : det(A) = 1}
is a closed subgroup of the compact group U (n), and so is itself com-
pact.
U (1) × SU (n)
114. U (n) = , w = e2π/n
<w>
115. The Symplectic group
Sp(n) = {A ∈ M at(n; H) : T ∗ T = I}
(Here M at(n; H) denotes the space of n × n matrices with quarternian
entries) is compact.

116. A matrix Lie group is any subgroup G of GL(n; C) with the following
property; If Am is any sequence of matrices in G and Am converges to
some matrix A, then either A ∈ G or A is not invertible. (i.e, a matrix
Lie group is a closed subgroup of GL(n; C))

117. The complex orthogonal group

O(n; C) = {A ∈ GL(n; C) |< Ax, Ay >=< x, y >, ∀x, y ∈ Cn }

118. The Special complex orthogonal group

SO(n; C) = {A ∈ O(n; C) | det(A) = 1}

.

119. Let g denote the (n + k) × (n + k) diagonal matrix with ones in the

first n diagonal entries and minius ones in the last k diagonal entries.

O(n; k) = {A(n+k)×(n+k) | AT g A = g}

120. A matrix Lie group G is said to be compact if the following two condi-
tions are satisfied:
a) If Am is any sequence of matrices in G, and Am converges to a matrix
A, then A is in G.
b) There exists a constant c such that for all A ∈ G, | Aij |≤ c for all
1 ≤ i, j ≤ n.
 29

121.
Compact N on − compact

O(n) GL(n; R)
SO(n) GL(n; C)
U (n) SL(n; R)
SU (n) SL(n; C)
Sp(n) O(n; C)
S1 ∼
= U (1) SO(n; C)
O(n; k)
SO(n; k)
Sp(n : R)
Sp(n; C)
R, Rn , R∗ , C∗

122.
Group Connected?

GL(n; C) yes
SL(n; C) yes
GL(n; R) no
SL(n; R) yes
O(n) no
SO(n) yes
SU (n) yes
O(n; 1) no
S0(n; 1) no

123. Let f (x) and g(x) be two differentiable functions with continuous nth
derivatives. Then
dn
  k
Pn
n d dn−k
(f (x)g(x)) = (f (x)) (g(x)).
dxn k=0 k dxk dxn−k
30
Pn
124. U (P, f ) = i=1 Mi δi , δi = xi − xi−1 .
Pn
125. L(P, f ) = i=1 mi δi , δi = xi − xi−1

126. For every partition P on [a, b], we have L(P, f ) 6 U (P, f )

127. m(b − a) 6 L(P, f ) 6 U (P, f ) 6 M (b − a)

where m = inf{f (x) | x ∈ [a, b]}
M = sup{f (x) | x ∈ [a, b]}

Rb−
128. f (x)dx = inf{U (P, f ) : P is partition of [a, b]}
a

Rb
129. f (x)dx = sup{L(P, f ) : P is partition of [a, b]}
a−

130. L(P, −f ) = −U (P, f )

131. U (P, −f ) = −L(P, f )

Rb R b−
132. f (x)dx ≤ a
f (x)dx
a−

Rb−
133. U (P, f ) f (x)dx + 
a

Rb
134. L(P, f ) > f (x)dx − 
a−

135. W (P, f ) = U (P, f ) − L(P, f )

136. If f is Riemann integrable on [a, b], then

Rb n
P b−a
f (x)dx = lim hf (a + rh), h = n
a n→∞ r=1

137. If f is integrable on [0, 1], then

R1 1
n
f ( nr )
P
f (x)dx = lim n
0 n→∞ r=1

Rb Rb−
138. L(P, f ) 6 f (x)dx 6 f (x)dx 6 U (P, f )
a− a
 31

Rb
139. m(b − a) 6 f (x)dx 6 M (b − a), b ≥ a
a

Rb
140. m(b − a) ≥ f (x)dx ≥ M (b − a), b 6 a.
a

Rb
141. f (x)dx = µ(b − a) , m ≤ µ ≤ M.
a

Rb
142. | f (x)dα(x)| ≤ [α(b) − α(a)] max |f (x)|.
a a≤x≤b

143. Let f (x) be a continuous function and α(x) ∈ C 1 in a ≤ x ≤ b. Then

Zb Zb
f (x)dα(x) = f (x)α0 (x)dx.
a a

144. A function α(x) is of bounded variation in an interval a ≤ x ≤ b iff

α(x) = α1 (x) + α2 (x), where α1 (x) is increasing and α2 (x) is decreasing
in a ≤ x ≤ b.

145. Let f (x) be an increasing function and α(x) is continuous function on

[a, b]. Then

Zb Zb
f (x)dα(x) + α(x)df (x) = α(b)f (b) − α(a)f (a).
a a

146. Let g(x) be a continuous function and f (x) is an increasing function

on [a, b]. Then

Zb Zξ Zb
f (x)g(x)dx = f (a) g(x)dx + f (b) g(x)dx.
a a ξ

147. Let g(x) be a continuous function, f (x) be an increasing function and

f (x) ≥ 0 on [a, b]. Then

Zb Zb
f (x)g(x)dx = f (b) g(x)dx, a ≤ ξ ≤ b.
a ξ
32

148. Suppose {sn } is monotonic. Then {sn } converges iff it is bounded.

149. The set of all limit points of a bounded sequence is a compact set
(closed set).

150. fn → 0 iff |fn | → 0.

fn+1 1
151. fn > 0, ∀n ∈ N, lim = l, l > 0, then lim(fn ) n = l.
fn
152. If |A| = m, |B| = n, then the number of one-one functions from A to
n!
B is (n−m)! (m ≤ n).

153. If f (n) is a positive monotonically decreasing

P nfunction of n for all n ∈ N,
a f (an ) converge or diverge
P
then the two infinite series f (n) and
together, a being a positive integer greater than unity.

154. Let f be a function defined for all points in some neighbourhood of a

point b except at the point b itself. Then f (x) → l as x → b iff the
limit of the sequence < f (xn ) > exists and is equal to l for any sequence
< xn >, xn 6= b for any n ∈ N, converging to b.
T
155. If f (x) has period T, then af (bx + c) + d has period |b|
.

156. If f (x) and g(x) has periods T1 and T2 , respectively, then af (x) + bg(x)
has period T = lcm(T1 , T2 ) provided exists.

COMPLEX ANALYSIS

1. If z = x + iy, then max{|x|, |y|} ≤ |z| ≤ |x| + |y|.

2. Every line or circle in C is the solution set of an equation of the form

a|z|2 + w̄z + wz̄ + b = 0, a, b ∈ R, w ∈ C.

3. If {zn } is a sequence of complex numbers, then lim zn = w iff lim |zn −

w| = 0.

4. Limit point of zeros is an isolated essential singularity of f (z).

5. Limit point of poles is a non-isolated essential singularity of f (z).

6. Poles are isolated of f (z).

7. An entire function f : C −→ C has a removable singularity at z = ∞

iff f (z) is constant.