Chapter 2 — Sequences and Series of Real Numbers
Limits begin here: when does an infinite list of numbers settle down, how do we prove it without knowing the answer, and when does an infinite sum add up to something finite?
Zeno's paradox of the runner who must first cover half the distance, then half of what remains, then half again, troubled philosophers for two thousand years: how can infinitely many steps be completed in a finite time? The modern answer is the subject of this chapter. The distances $\tfrac12,\tfrac14,\tfrac18,\dots$ form a sequence; their running totals $\tfrac12,\tfrac34,\tfrac78,\dots$ form another sequence, and that one converges to $1$. An infinite process has a definite outcome exactly when a sequence has a limit — and the $\varepsilon$–$N$ definition, introduced by Bolzano and Cauchy and made precise by Weierstrass in the nineteenth century, says what that means without any appeal to motion or intuition.
The deep point is that we usually cannot compute the limit, and must prove that it exists anyway. That is where the completeness of $\mathbb{R}$ from Chapter 1 earns its keep: bounded monotone sequences converge, Cauchy sequences converge, and every bounded sequence has a convergent subsequence (Bolzano–Weierstrass). With these tools we define $e$, analyse recursive sequences and fixed-point iterations, measure the oscillation of divergent sequences with $\limsup$ and $\liminf$, and decide which infinite series converge — a question with famous surprises: $1+\tfrac12+\tfrac13+\cdots$ diverges although its terms tend to $0$, and the terms of $1-\tfrac12+\tfrac13-\cdots$ can be rearranged to add up to any number you like.
- prove convergence and divergence directly from the $\varepsilon$–$N$ definition, and compute limits with the algebra of limits, the squeeze theorem and the standard limits $a^n$, $n^{1/n}$, $n^k/a^n$, $a^n/n!$;
- use the monotone convergence theorem and the Cauchy criterion to prove that a limit exists, analyse recursive and contractive sequences, and work with the number $e$;
- prove the Bolzano–Weierstrass theorem, find all subsequential limits of a sequence, and compute and manipulate $\limsup$ and $\liminf$;
- evaluate limits with Cesàro means, the ratio–root inequalities and the Stolz–Cesàro theorem;
- decide the convergence of series with the comparison, ratio, root, condensation, integral, Leibniz, Dirichlet and Abel tests, and distinguish absolute from conditional convergence;
- recognise the standard counterexamples that CSIR NET uses to build its "which of the following are true" options.
How this is examined
This is one of the most heavily examined chapters of Unit 1. CSIR Part B typically asks for the value of a single limit — an $n$-th root of a factorial expression, a limit of the form "$1^\infty$", a Cesàro or Riemann-sum type average, the limit of a recursively defined sequence — or for the one convergent series among four. Part C, where several options may be correct, prefers statements about whole classes of sequences: "if $(a_n^2)$ converges then $(a_n)$ converges", "$\limsup(a_n+b_n)=\limsup a_n+\limsup b_n$", "a bounded sequence with exactly one subsequential limit converges", "if $\sum a_n$ converges then $\sum a_n^2$ converges". Each false option is usually one of the standard counterexamples — $(-1)^n$, $\sqrt n$, $H_n$, $\tfrac{(-1)^n}{\sqrt n}$, a sequence that is $1$ on the primes — collected in the ⚠️ boxes of the three sections, and recognising them quickly is the key skill. The same ideas return inside questions on continuity, uniform convergence, power series and metric spaces, and GATE MA asks them in single-answer, multiple-select and numerical-answer form.
Sections in this chapter
Sequences, Monotone and Cauchy Sequences
The $\varepsilon$–$N$ definition, algebra of limits, squeeze theorem, standard limits, monotone convergence and $e$, recursive sequences, Cauchy and contractive sequences.
Subsequences, Bolzano–Weierstrass, lim sup and lim inf
Subsequences and divergence tests, the monotone subsequence and Bolzano–Weierstrass theorems, $\limsup$ and $\liminf$, ratio–root inequalities, Cesàro means and Stolz–Cesàro.
Series of Real Numbers
Partial sums, the Cauchy criterion, comparison, ratio, root, condensation and integral tests, Leibniz, Dirichlet and Abel tests, absolute and conditional convergence, rearrangements, Cauchy products.
You need Chapter 1, especially §1.2: the completeness axiom and the $\varepsilon$-characterisation of the supremum (every existence proof in this chapter starts with "let $u=\sup S$"), the Archimedean property ("choose $n\gt1/\varepsilon$"), the triangle inequality and Bernoulli's inequality $(1+x)^n\ge1+nx$. From §1.1 you need only the language of sets and functions — a sequence is a function on $\mathbb{N}$. From school calculus, familiarity with $\log$, $e^x$ and $\sin$ is assumed for examples; their rigorous properties come in Chapter 3. Above all, practise reading nested quantifiers: in "$\forall\varepsilon\gt0\ \exists N\ \forall n\ge N$" the order is everything.