Real Analysis

General theorems on sets and sequences

A rigorous foundation in set topology and real sequences governs the convergence criteria, bounds, and limits essential for higher analysis.

For: UP PGT Mathematics UP TGT Mathematics DSSSB PGT / TGT KVS / NVS PGT LT Grade
📖 Topic progress
○ Mark as complete

Definition and statement

Bolzano-Weierstrass Theorem for Sets and Sequences
Every bounded infinite subset of $\mathbb{R}$ has at least one limit point. Dually, every bounded sequence in $\mathbb{R}$ contains a convergent subsequence.

📐 Geometric Interpretation

If an infinite set of points is trapped within a finite interval $[a, b]$, the points must crowd together somewhere, creating at least one accumulation point where density is infinite.

⚙️ Algebraic & Structural Meaning

Establishes the topological compactness of closed and bounded intervals in $\mathbb{R}$ (Heine-Borel theorem equivalence) and guarantees the existence of limits without requiring explicit construction.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition Domain / Interval Necessity What Fails If Condition Dropped
Boundedness of the set or sequence Bounded domain / range Strictly Mandatory / Necessary Unbounded sets like $\mathbb{N}$ or sequences like $x_n = n$ possess no limit points or convergent subsequences in $\mathbb{R}$.
Infinitude of the set Set cardinality $\ge \aleph_0$ Strictly Mandatory Finite sets have no limit points because points can be isolated by disjoint neighborhoods.
Archimedean Property of $\mathbb{R}$ Field property of $\mathbb{R}$ Essential for conclusion Without completeness and the Archimedean property, limits of Cauchy sequences may fail to exist in the underlying space (e.g., in $\mathbb{Q}$).

Useful results and shortcuts

Use these identities and results when their conditions apply:

01

Monotone Convergence Test (MCT) for Sequences

$$ \text{If } \{x_n\} \text{ is monotonic and bounded, then } \lim_{n \to \infty} x_n = \sup \{x_n\} $$

Rule: Never compute limits of recursive sequences analytically; check monotonicity and boundedness, then equate $x_{n+1} = x_n = L$ to find the limit instantly.

Application: Frequently asked in UP PGT and DSSSB PGT for sequences defined as $x_{n+1} = \sqrt{a + x_n}$.
02

Cauchy's First Limit Theorem (Cesaro's Lemma)

$$ \lim_{n \to \infty} x_n = l \implies \lim_{n \to \infty} \frac{x_1 + x_2 + \cdots + x_n}{n} = l $$

Rule: If the arithmetic mean of sequence terms converges, it converges to the same limit as the general term if that limit exists.

Application: Directly tested in UP TGT/PGT for evaluating limits of complex summation series divided by $n$.
03

Sandwich (Squeeze) Theorem for Sequences

$$ a_n \le b_n \le c_n \text{ and } \lim a_n = \lim c_n = l \implies \lim b_n = l $$

Rule: When a term is trapped between two fractions where the numerator is bounded and denominator goes to infinity, the limit is zero.

Application: Standard recurring pattern for limits of the form $\lim_{n \to \infty} \left(\frac{1}{n^2+1} + \frac{1}{n^2+2} + \cdots + \frac{1}{n^2+n}\right)$.
04

Subsequence Limit Superior & Inferior Rule

$$ \liminf x_n \le \text{any limit of subsequence} \le \limsup x_n $$

Rule: A bounded sequence converges if and only if $\liminf x_n = \limsup x_n$. Use this to instantly test oscillation.

Application: Used in PGT screening tests to classify divergent oscillating sequences like $x_n = (-1)^n \left(1 + \frac{1}{n}\right)$.
05

Nested Interval Property

$$ I_n = [a_n, b_n], \quad I_{n+1} \subset I_n \implies \bigcap_{n=1}^\infty I_n \neq \emptyset $$

Rule: If lengths of nested closed intervals shrink to zero ($\lim(b_n - a_n) = 0$), the intersection contains a unique single real point.

06

Rapid Elimination Trick via Subsequences

$$ \text{If } x_{2n} \to L_1 \text{ and } x_{2n+1} \to L_2 \text{ with } L_1 \neq L_2, \text{ then the sequence diverges.} $$

Rule: Separate odd and even terms. If they yield distinct limits, immediately eliminate all options claiming convergence.

Common errors and counterexamples

These examples show how a conclusion can fail when a condition is missing:

⚠️ COMMON ERROR #01

Assuming Unbounded Sets Have Limit Points

Common Pitfall: Candidates apply Bolzano-Weierstrass to unbounded sets like $\mathbb{Z}$ or $\mathbb{N}$ and assume limit points exist in $\mathbb{R}$.

Counterexample: The set of integers $\mathbb{Z} \subset \mathbb{R}$ is infinite and unbounded, having no limit points in $\mathbb{R}$.

Why it fails: The hypothesis of boundedness is strictly required. Without it, neighborhoods can escape to infinity without capturing infinite points.

🛡️ Exam Defense: Check if the set/sequence is bounded before invoking Bolzano-Weierstrass or compactness properties.
⚠️ COMMON ERROR #02

Confusing Sequence Convergence with Cesaro Mean Converse

Common Pitfall: Assuming that if the arithmetic mean of a sequence converges ($\frac{x_1 + \dots + x_n}{n} \to l$), the original sequence $x_n$ must also converge.

Counterexample: Let $x_n = (-1)^n$. Then $x_n$ diverges, but its Cesaro mean converges to $0$.

Why it fails: Cesaro's theorem is an implication ($\to$), not an equivalence ($\iff$). The converse is false.

🛡️ Exam Defense: Never deduce the convergence of $x_n$ solely from the convergence of its arithmetic mean.

Comparison

Concept / TheoremHypotheses / AssumptionsKey Formula / OutcomeGeometric MeaningExam Identification Clue
Bolzano-Weierstrass (Sets)Subset $S \subset \mathbb{R}$ is bounded and infiniteDerived set $S' \neq \emptyset$Points crowd together in a finite spaceWords: 'infinite bounded set', 'accumulation point'
Bolzano-Weierstrass (Sequences)Sequence $\langle x_n \rangle$ is bounded$\exists$ convergent subsequence $\langle x_{n_k} \rangle$Extracting a stable trend from chaotic oscillationWords: 'bounded sequence', 'subsequence'
Monotone Convergence TheoremSequence is monotonic (inc/dec) and bounded$\lim x_n = \sup/\inf \{x_n\}$A curve moving strictly in one direction and hitting a wallRecursive sequences $x_{n+1} = f(x_n)$
Cauchy's General Principle of ConvergenceSequence in a complete metric space$\forall \varepsilon > 0, \exists N, \forall m,n \ge N \implies |x_m - x_n| < \varepsilon$Terms get arbitrarily close to each otherDetermining convergence without knowing the limit

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

If $x_1 = \sqrt{2}$ and $x_{n+1} = \sqrt{2 + x_n}$ for all $n \ge 1$, then $\lim_{n \to \infty} x_n$ is equal to:

(A) $1$(B) $2$(C) $\sqrt{2}$(D) $3$
✓ Correct Answer: (B)
📚 Method A: Formal Textbook Derivation
Step 1: Show $x_n < 2$ by mathematical induction. Step 2: Show $x_{n+1} > x_n$, proving monotonicity. Step 3: By MCT, limit $L$ exists. Step 4: Solve $L = \sqrt{2 + L} \implies L^2 - L - 2 = 0 \implies L = 2$ (discarding negative root).
⚡ Method B: 25-Second Exam Shortcut
Instantly set $x_{n+1} = x_n = L$. Solve $L = \sqrt{2 + L} \implies L^2 - L - 2 = 0 \implies L = 2$.
💡 Tip: For recursive root sequences of the form $\sqrt{a + \sqrt{a + \dots}}$, the limit is always the positive root of $L^2 - L - a = 0$.
CANONICAL PROBLEM 02 Dual-Method Breakdown

The sequence $x_n = 1 + \frac{1}{1!} + \frac{1}{2!} + \cdots + \frac{1}{n!}$ converges to:

(A) $\pi$(B) $e$(C) $1$(D) $\log 2$
✓ Correct Answer: (B)
📚 Method A: Formal Textbook Derivation
The sequence is strictly increasing ($x_{n+1} = x_n + \frac{1}{(n+1)!} > x_n$) and bounded above by $1 + 1 + \frac{1}{2} + \frac{1}{2^2} + \dots = 3$. By MCT, it converges to the Euler's constant $e$.
⚡ Method B: 25-Second Exam Shortcut
Recognize the standard partial sum representation of the exponential series expansion for $e = \sum_{n=0}^\infty \frac{1}{n!}$.
💡 Tip: Memorize standard series limits like $e$, $\sin 1$, and $\cos 1$ as they appear frequently in UP PGT.

Practice questions

Choose an answer to check it and see the solution:

Q1
Every bounded sequence of real numbers has:
A A unique limit
B At least one limit point
C At least one convergent subsequence
D No convergent subsequence
Derivation & Analysis:

By the Bolzano-Weierstrass theorem for sequences, every bounded sequence possesses at least one convergent subsequence.

Q2
If $x_n = \frac{(-1)^n}{n}$, then the sequence $\langle x_n \rangle$ is:
A Monotonic and convergent
B Bounded and convergent
C Unbounded and divergent
D Monotonic and divergent
Derivation & Analysis:

The terms alternate in sign, so the sequence is not monotonic. However, it is bounded by $[-1, 1]$ and converges to $0$.

Q3
The limit of the sequence $x_n = \left(1 + \frac{1}{n}\right)^n$ as $n \to \infty$ is:
A $1$
B $e$
C $e^2$
D Infinity
Derivation & Analysis:

This is the standard fundamental limit defining Euler's number $e$, where $\lim_{n \to \infty} (1 + \frac{1}{n})^n = e$.

Q4
Which of the following sets has a limit point in $\mathbb{R}$?
A $\mathbb{N}$ (Natural numbers)
B $\mathbb{Z}$ (Integers)
C The open interval $(0, 1)$
D The set of all rational numbers in $[0, 1]$
Derivation & Analysis:

The open interval $(0, 1)$ is bounded and infinite, and every point in $[0, 1]$ is a limit point of $(0, 1)$. $\mathbb{N}$ and $\mathbb{Z}$ are unbounded.

Q5
If a sequence $\langle x_n \rangle$ is monotonic increasing and unbounded above, then:
A It converges
B It oscillates finitely
C It diverges to $+\infty$
D It diverges to $-\infty$
Derivation & Analysis:

By the Monotone Convergence Theorem, an increasing sequence that is not bounded above diverges to positive infinity.

Q6
If $a_n > 0$ and $\lim_{n \to \infty} \frac{a_{n+1}}{a_n} = L < 1$, then $\lim_{n \to \infty} a_n$ is:
A $1$
B $L$
C $0$
D Infinity
Derivation & Analysis:

By D'Alembert's ratio test for sequences, if the limit of the ratio of successive terms is less than $1$, the sequence converges to $0$.

Q7
The supremum of the set $S = \left\{ 1 - \frac{1}{n} : n \in \mathbb{N} \right\}$ is:
A $0$
B $1$
C $-1$
D Does not exist
Derivation & Analysis:

As $n \to \infty$, $1 - \frac{1}{n} \to 1$. Since $1 - \frac{1}{n} < 1$ for all finite $n$, $1$ is the least upper bound (supremum).

Q8
If $\langle x_n \rangle$ and $\langle y_n \rangle$ are Cauchy sequences in $\mathbb{R}$, then the sequence $\langle x_n + y_n \rangle$ is:
A Not necessarily Cauchy
B A Cauchy sequence
C A divergent sequence
D Bounded only
Derivation & Analysis:

The sum, difference, and product of bounded Cauchy sequences are also Cauchy because $\mathbb{R}$ is a complete metric space.

Q9
The derived set $S'$ of the set $S = \left\{ \frac{1}{n} : n \in \mathbb{N} \right\}$ is:
A $\emptyset$
B $\{0\}$
C $\{1, 1/2, 1/3, \dots\}$
D $[0, 1]$
Derivation & Analysis:

The only limit point of the sequence of terms $\frac{1}{n}$ is $0$. Thus, the set of all limit points (derived set) is $\{0\}$.y

Q10
Which of the following statements is always true for a convergent sequence $\langle x_n \rangle$?
A It is monotonic
B It is unbounded
C It has a unique limit
D All subsequences converge to different limits
Derivation & Analysis:

Limits of convergent sequences in Hausdorff spaces like $\mathbb{R}$ are unique, and all its subsequences converge to that same unique limit.

Common questions

A limit point of a set $S$ (in the sense of Bolzano-Weierstrass) means every neighborhood of the point contains infinitely many points of $S$ (they need not come from a specific sequential ordering). A sequence limit refers specifically to an ordered infinite list of numbers $\langle x_n \rangle$ crowding around a single value as $n \to \infty$. However, every limit point of a set is the limit of some sequence of distinct points from that set.

Examiners use recursive sequences to test two major concepts simultaneously: the Monotone Convergence Theorem (to prove limit existence) and algebraic equation-solving (to find the limit value). It filters candidates who rely solely on formula memorization from those who understand rigorous foundational analysis.

Always check for monotonicity and boundedness first (MCT). If the sequence is recursive, directly equate $x_{n+1} = x_n = L$ and solve the algebraic equation. If it is an alternating or oscillating sequence, test odd and even subsequences separately to rule out options instantly.