Skip to content
Analysis & Linear Algebra

Sequences and Series of Functions

See where the marks are across every paper →

1. Pointwise vs uniform convergence, M-test, Dini

Read this as a chapter →

Lec-47 Uniform Convergence

NPTEL · Real Analysis (S. H. Kulkarni, IIT Madras)

The sup-norm test; contrast with pointwise convergence.

Lec-48 Uniform Convergence and Integration

NPTEL · Real Analysis (S. H. Kulkarni, IIT Madras)

Exactly when you may swap limit and integral.

Lec-49 Uniform Convergence and Differentiation

NPTEL · Real Analysis (S. H. Kulkarni, IIT Madras)

Why uniform convergence of fₙ says nothing about fₙ′.

Uniform convergence — what it buys and how to test it free

In plain words

Pointwise convergence checks one input at a time. Uniform convergence checks the worst input all at once, and only the second lets you swap a limit with an integral or a derivative.

Definitions

fn→ff_{n} \to f pointwise on E: for each x,fn(x)→f(x)x, f_{n}(x) \to f(x). Uniformly: supx∈Esup_{x\in{}E} |fn(x)−f(x)f_{n}(x) - f(x)| → 0. Uniform ⇒ pointwise; the converse fails.

The "sup trick"

Compute Mn=supEM_{n} = sup_E |fn−ff_{n} - f| (differentiate in x, find the maximiser, evaluate). Uniform iff Mn→0M_{n} \to 0.

fnf_{n} on [0,1] pointwise limit MnM_{n} uniform?
xnx^{n} 0 on [0,1), 1 at 1 1 ✗ (limit discontinuous)
xn(1−x)x^{n}(1 - x) 0 (n/(n+1))n/(n+1)→0(n/(n+1))^{n}/(n+1) \to 0 ✓
nx(1−x)n(1 - x)^{n} 0 at x = 1/(n+1): → 1/e ✗
nxe−nx2nxe^{-nx^{2}} 0 at x=1/2n:n/2e→∞x = 1/\sqrt{2n}: \sqrt{n/2e} \to \infty ✗
x/n 0 1/n ✓
sin(nx)/n 0 1/n ✓ (but fn′=cos⁡f_{n}' = \cos nx diverges)
xn/nx^{n}/n 0 1/n ✓ (and fn′=xnf_{n}' = x^{n}⁻1^{1} not uniform)

What uniform convergence preserves

  • Continuity: uniform limit of continuous functions is continuous. (Contrapositive is the fastest disproof: discontinuous limit ⇒ not uniform.)
  • Integrals on [a,b]:∫fn→∫f[a,b]: \int{}f_{n} \to \int{}f. Pointwise is not enough: nx(1−x)n→0(1-x)^{n} \to 0 pointwise but ∫→1/e…(\int \to 1/e\dots (check: ∫01\int_{0}^{1} nx(1−x)n(1-x)^{n} dx = n/((n+1)(n+2)) → 0; the classic failure is 2n2x2n^{2}x e−n2x2e^{-n^{2}x^{2}}, or n·1(0,1/n)1_{(0,1/n)}, with integral 1).
  • Derivatives: need fn′→gf_{n}' \to g uniformly and fn(x0)f_{n}(x_{0}) convergent; then f′ = g. Uniform convergence of fnf_{n} alone says nothing about fn′(sin⁡(f_{n}' (\sin(nx)/n).
  • Uniform Cauchy ⇔ uniformly convergent (completeness of R)\mathbb{R}).

Tests

  • Weierstrass M-test: |un(x)u_{n}(x)| ≤Mn,∑Mn<∞⇒∑un\le M_{n}, \sum{}M_{n} < \infty \Rightarrow \sum{}u_{n} uniformly (and absolutely) convergent. ∑sin⁡(\sum \sin(nx)/n2)/n^{2} ✓; ∑xn\sum x^{n} on (−1,1) ✗ (no uniform bound) but ✓ on [−r, r], r < 1.
  • Dini: fnf_{n} continuous, monotone in n, pointwise limit continuous, domain compact ⇒ uniform. All four hypotheses are tested: xnx^{n} on [0,1] fails (limit discontinuous);xn); x^{n} on [0,1) fails (not compact).
  • Abel/Dirichlet for ∑an(x)bn(x)\sum{}a_{n}(x)b_{n}(x) — rarely needed.

Key takeaways

  • Compute the sup; a discontinuous limit is an instant "not uniform".
  • Uniform ⇒ swap with ∫\int on compact intervals and ⇒ continuity of the limit; differentiation needs uniform convergence of the derivatives.
  • M-test for series; Dini for monotone sequences on compact sets.

Watch uniform convergence fail: xⁿ on [0, 1]interactivefree

Exam focus: Uniform convergence is what lets you swap limit with integral/derivative/continuity. Compute sup|fₙ − f| explicitly; xⁿ, nx(1−x)ⁿ, nxe^{−nx²}, x/n are the recurring families.

Practice

Part C2025 Juneshow ▾
For each n ≥ 1, let fn:R→Rf_{n} : \mathbb{R} \to \mathbb{R} be a function defined by fn(x)=f_{n}(x) = e−n2x2/ne^{-n^{2}x^{2}}/n. Which of the following statements are true?
  1. A.(fn)n≥1(f_{n})_{n}\ge_{1} converges uniformly to 0 on R\mathbb{R}, and (fn′)n≥1(f'_{n})_{n}\ge_{1} converges uniformly to 0 on the interval (−M, M) for some positive real number M.
  2. B.(fn)n≥1(f_{n})_{n}\ge_{1} converges uniformly to 0 on R\mathbb{R}, and (fn′)n≥1(f'_{n})_{n}\ge_{1} converges pointwise to 0 on R\mathbb{R}.✓ Correct
  3. C.(fn)n≥1(f_{n})_{n}\ge_{1} converges uniformly to 0 on R\mathbb{R} and (fn′)n≥1(f'_{n})_{n}\ge_{1} does not converge pointwise to 0 on R\mathbb{R}.
  4. D.(fn)n≥1(f_{n})_{n}\ge_{1} converges pointwise to 0 on R\mathbb{R} but not uniformly on R\mathbb{R}.

The worked solution and the per-option analysis are in Trap Analysis.

Part C2025 Decembershow ▾
Let N\mathbb{N} denote the set of all positive integers. For n∈Nn\in\mathbb{N}, let fn:[0,1]→Rf_{n}:[0,1]\to\mathbb{R} be given by fn(x)=n(1−f_{n}(x)=n(1-nx) if 0≤x≤1/n, 0 if x>1/n. Which of the following statements are necessarily true?
  1. A.The sequence of functions {fnf_{n}}n≥1_{n}\ge1 is uniformly bounded.
  2. B.The sequence of functions {fnf_{n}}n≥1_{n}\ge1 does not converge pointwise.✓ Correct
  3. C.The sequence of functions {fnf_{n}}n≥1_{n}\ge1 converges uniformly to the constant function 0.
  4. D.The set {fn:n∈Nf_{n} : n\in\mathbb{N}} is compact in C[0,1], where C[0,1] denotes the space of all real valued continuous functions on [0,1] equipped with the supremum norm.

The worked solution and the per-option analysis are in Trap Analysis.

Part C2025 Juneshow ▾
Let (fn)n≥1(f_{n})_{n}\ge_{1} be a sequence of real-valued functions on R\mathbb{R}. Which of the following statements are true?
  1. A.If each fnf_{n} is uniformly continuous and (fn)n≥1(f_{n})_{n}\ge_{1} converges to f uniformly, then f is uniformly continuous.✓ Correct
  2. B.If each fnf_{n} is bounded and (fn)n≥1(f_{n})_{n}\ge_{1} converges to f pointwise, then f is bounded.
  3. C.If each fnf_{n} is bounded and continuous, (fn)n≥1(f_{n})_{n}\ge_{1} converges pointwise to a bounded and continuous function f, then the convergence is uniform.
  4. D.If each fnf_{n} is differentiable and (fn)n≥1(f_{n})_{n}\ge_{1} converges to f uniformly, then f is differentiable.

The worked solution and the per-option analysis are in Trap Analysis.

Part B2025 Juneshow ▾
For each n ≥ 1, let fn:[0,1]→Rf_{n} : [0, 1] \to \mathbb{R} be defined as fn(x)=f_{n}(x) = nx if x∈[0,1/n],fn(x)=2−x \in [0, 1/n], f_{n}(x) = 2 - nx if x ∈ (1/n, 2/n), and fn(x)=0f_{n}(x) = 0 if x ∈ [2/n, 1]. Which of the following statements is true?
  1. A.(fn)n≥1(f_{n})_{n}\ge_{1} converges uniformly on [0, 1] to a continuous function f.
  2. B.(fn)n≥1(f_{n})_{n}\ge_{1} converges pointwise on [0, 1] to a discontinuous function f.
  3. C.(fn)n≥1(f_{n})_{n}\ge_{1} converges pointwise on [0, 1] to a continuous function f.✓ Correct
  4. D.(fn)n≥1(f_{n})_{n}\ge_{1} does not converge pointwise on [0, 1].

The worked solution and the per-option analysis are in Trap Analysis.

Part C2025 Decembershow ▾
For each positive integer n, let fn:[−1,1]→Rf_{n}:[-1,1]\to\mathbb{R} be given by fn(x)=−1f_{n}(x)=-1 if −1≤x≤−1/n,fn(x)=-1\le{}x\le-1/n, f_{n}(x)=nx if −1/n<x<1/n, and fn(x)=1f_{n}(x)=1 if 1/n≤x≤1. On which of the following intervals does the sequence {fnf_{n}}n≥1_{n}\ge1 converge uniformly?
  1. A.[0,1]
  2. B.(0,1]
  3. C.(10⁻2025,1)^{2025},1)✓ Correct
  4. D.(−10⁻2025,10^{2025},10⁻2025]^{2025}]

The worked solution and the per-option analysis are in Trap Analysis.

Part B2024 Decembershow ▾
For integers n ≥ 0, let fn:[−1,0]→Rf_{n} : [-1, 0] \to \mathbb{R} be defined by fn(x)=x/(1−x)nf_{n}(x) = x/(1 - x)^{n}. Which of the following statements is true about the series ∑(n=0)∞fn\sum_(n=0)^\infty f_{n}?
  1. A.The series is neither absolutely convergent nor uniformly convergent.
  2. B.The series is both absolutely convergent and uniformly convergent.
  3. C.The series is absolutely convergent but not uniformly convergent.✓ Correct
  4. D.The series is uniformly convergent but not absolutely convergent.

The worked solution and the per-option analysis are in Trap Analysis.

Part C2024 Juneshow ▾
Let f:[0,1)→[1,∞)f : [0, 1) \to [1, \infty) be defined by f(x) = 1/(1 − x). For n ≥ 1, let pn(x)=1+x+⋯+xnp_{n}(x) = 1 + x + \cdots + x^{n}. Then which of the following statements are true?
  1. A.f(x) is not uniformly continuous on [0, 1)✓ Correct
  2. B.The sequence (pn(x))(p_{n}(x)) converges to f(x) pointwise on [0, 1)✓ Correct
  3. C.The sequence (pn(x))(p_{n}(x)) converges to f(x) uniformly on [0, 1)
  4. D.The sequence (pn(x))(p_{n}(x)) converges to f(x) uniformly on [0, c] for every 0 < c < 1✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part B2024 Decembershow ▾
Consider the sequences (fn)n≥1(f_{n})_{n}\ge_{1} and (gn)n≥1(g_{n})_{n}\ge_{1} of functions defined on the interval [−1, 1] by fn(x)=(−1)n(x2+n)/n2f_{n}(x) = (-1)^{n}(x^{2} + n)/n^{2} and gn(x)=(−1)n(x2+n2)/n3g_{n}(x) = (-1)^{n}(x^{2} + n^{2})/n^{3}. Which of the following statements is true?
  1. A.∑(n≥1)fn\sum(n\ge1) f_{n} and ∑(n≥1)gn\sum(n\ge1) g_{n} are uniformly convergent on the interval [−1, 1].✓ Correct
  2. B.∑(n≥1)fn\sum(n\ge1) f_{n} is uniformly convergent on the interval [−1, 1], but ∑(n≥1)gn\sum(n\ge1) g_{n} is not.
  3. C.∑(n≥1)gn\sum(n\ge1) g_{n} is uniformly convergent on the interval [−1, 1], but ∑(n≥1)fn\sum(n\ge1) f_{n} is not.
  4. D.Neither ∑(n≥1)fn\sum(n\ge1) f_{n} nor ∑(n≥1)gn\sum(n\ge1) g_{n} is uniformly convergent on the interval [−1, 1].

The worked solution and the per-option analysis are in Trap Analysis.

Part B2024 Juneshow ▾
For each n ≥ 1 define fn:R→Rf_{n} : \mathbb{R} \to \mathbb{R} by fn(x)=x2/x2+1/n,x∈Rf_{n}(x) = x^{2} / \sqrt{x^{2} + 1/n}, x \in \mathbb{R}, where √\surd denotes the non-negative square root. Wherever limn→∞fn(x)lim_{n}\to\infty f_{n}(x) exists, denote it by f(x). Which of the following statements is true?
  1. A.There exists x∈Rx \in \mathbb{R} such that f(x) is not defined
  2. B.f(x) = 0 for all x∈Rx \in \mathbb{R}
  3. C.f(x) = x for all x∈Rx \in \mathbb{R}
  4. D.f(x) = |x| for all x∈Rx \in \mathbb{R}✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part C2024 Decembershow ▾
Let f:R→Rf : \mathbb{R} \to \mathbb{R} be a uniformly continuous function. For each positive integer n and x∈Rx \in \mathbb{R}, let gng_{n} and hnh_{n} be defined by gn(x)=f(x+1/n)g_{n}(x) = f(x + 1/n) and hn(x)=f(h_{n}(x) = f(nx). Which of the following statements are necessarily true?
  1. A.(gn)n≥1(g_{n})_{n}\ge_{1} converges uniformly on any compact subset of R\mathbb{R} but not on R\mathbb{R}.
  2. B.(gn)n≥1(g_{n})_{n}\ge_{1} converges uniformly on R\mathbb{R}.✓ Correct
  3. C.There exists a subsequence of (hn)n≥1(h_{n})_{n}\ge_{1} that converges uniformly on R\mathbb{R}.
  4. D.For every compact subset K⊆RK \subseteq \mathbb{R}, there exists a subsequence of (hn)n≥1(h_{n})_{n}\ge_{1} that converges uniformly on K.

The worked solution and the per-option analysis are in Trap Analysis.

Part C2024 Decembershow ▾
For each positive integer n, define fn:[0,1]→Rf_{n} : [0, 1] \to \mathbb{R} by fn(x)=f_{n}(x) = nx(1−x)n(1 - x)^{n}. Which of the following statements are true?
  1. A.(fn)n≥1(f_{n})_{n}\ge_{1} does not converge pointwise on [0, 1].
  2. B.(fn)n≥1(f_{n})_{n}\ge_{1} converges pointwise to a continuous function on [0, 1].✓ Correct
  3. C.(fn)n≥1(f_{n})_{n}\ge_{1} converges pointwise to a discontinuous function on [0, 1].
  4. D.(fn)n≥1(f_{n})_{n}\ge_{1} does not converge uniformly on [0, 1].✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part C2024 Decembershow ▾
Consider the following functions on the interval [0,1]:g(x)=sin⁡(πx),h(x)=cos⁡(π(x−1))[0, 1] : g(x) = \sin(\pi{}x), h(x) = \cos(\pi(x - 1)). Which of the following statements are true?
  1. A.(xng(x))n≥1(x^{n}g(x))_{n}\ge_{1} converges uniformly on [0, 1].✓ Correct
  2. B.(xng(x))n≥1(x^{n}g(x))_{n}\ge_{1} does not converge uniformly on [0, 1].
  3. C.(xnh(x))n≥1(x^{n}h(x))_{n}\ge_{1} converges uniformly on [0, 1].
  4. D.(xnh(x))n≥1(x^{n}h(x))_{n}\ge_{1} does not converge uniformly on [0, 1].✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part C2023 Decembershow ▾
Let (fn)(f_{n}) be the sequence of functions on [0, 1] defined by fn(x)=xnlog⁡((1+x)/2)f_{n}(x) = x^{n} \log((1 + \sqrt{x})/2). Which of the following statements are true?
  1. A.(fn)(f_{n}) converges pointwise on [0, 1].✓ Correct
  2. B.(fn)(f_{n}) converges uniformly on compact subsets of [0, 1) but not on [0, 1).
  3. C.(fn)(f_{n}) converges uniformly on [0, 1) but not on [0, 1].
  4. D.(fn)(f_{n}) converges uniformly on [0, 1].✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part Bshow ▾
Let fn(x)=x/(1+f_{n}(x) = x/(1 + nx2)^{2}) on R\mathbb{R}. Which statement is correct?
  1. A.fn→0f_{n} \to 0 pointwise but not uniformly on R\mathbb{R}.
  2. B.fn→0f_{n} \to 0 uniformly on R\mathbb{R}.✓ Correct
  3. C.fnf_{n} converges only on bounded intervals.
  4. D.fnf_{n} does not converge pointwise on R\mathbb{R}.

Solution

By calculus the maximum of |fnf_{n}| is at x=1/nx = 1/\sqrt{n} with value 1/(2n)1/(2\sqrt{n}), so supRsup_\mathbb{R} |fnf_{n}| =1/(2n)→0= 1/(2\sqrt{n}) \to 0 — uniform convergence on all of R\mathbb{R}.

This is the standard example where the sup can be computed exactly.

Save for spaced revision (free account)
Part Bshow ▾
Let fn(x)=sin⁡(f_{n}(x) = \sin(nx)/n on R\mathbb{R}. Then
  1. A.fn→0f_{n} \to 0 uniformly and fn′→0f_{n}' \to 0 uniformly
  2. B.fn→0f_{n} \to 0 uniformly but fn′f_{n}' does not converge pointwise everywhere✓ Correct
  3. C.fnf_{n} does not converge uniformly
  4. D.fn→0f_{n} \to 0 uniformly and fn′→0f_{n}' \to 0 pointwise but not uniformly

The worked solution and the per-option analysis are in Trap Analysis.

Part Cshow ▾
Let fn(x)=f_{n}(x) = nx(1−x)n(1 - x)^{n} on [0, 1]. Which of the following are true?
  1. A.fn→0f_{n} \to 0 pointwise on [0,1]✓ Correct
  2. B.fn→0f_{n} \to 0 uniformly on [0,1]
  3. C.∫01fn→0\int_{0}^{1} f_{n} \to 0✓ Correct
  4. D.fn→0f_{n} \to 0 uniformly on [δ,1][\delta, 1] for every δ∈(0,1)\delta \in (0,1)✓ Correct

Solution

Max at x = 1/(n+1) equals (n/(n+1))n(n/(n+1))^{n}⁺1→1/e≠0^{1} \to 1/e \ne 0, so not uniform on [0,1].∫=n/((n+1)(n+2))→0[0,1]. \int = n/((n+1)(n+2)) \to 0.

On [δ,1],(1−x)n≤(1−δ)n[\delta,1], (1-x)^{n} \le (1-\delta)^{n} kills it uniformly.

Save for spaced revision (free account)
Part Cshow ▾
For n ≥ 1 let fn:[0,1]→Rf_{n} : [0, 1] \to \mathbb{R} be fn(x)=xnf_{n}(x) = x^{n}. Which of the following are true?
  1. A.{fnf_{n}} converges pointwise on [0, 1].✓ Correct
  2. B.{fnf_{n}} converges uniformly on [0, 1].
  3. C.{fnf_{n}} converges uniformly on [0, 1/2].✓ Correct
  4. D.The pointwise limit is continuous on [0, 1].

Solution

The pointwise limit is f(x) = 0 for x ∈ [0,1) and f(1) = 1, so (1) holds and (4) fails — the limit jumps at x = 1.

(2) fails: each fnf_{n} is continuous, so uniform convergence would force a continuous limit; concretely sup|fn−ff_{n} - f| = 1 for every n, taking x slightly below 1.

(3) On [0, 1/2] we have sup|fnf_{n}| =(1/2)n→0= (1/2)^{n} \to 0, which is uniform convergence.

Save for spaced revision (free account)
Part Cshow ▾
Which of the following series converge uniformly on the indicated set?
  1. A.∑xn\sum x^{n} on (−1, 1)
  2. B.∑xn/n2\sum x^{n}/n^{2} on [−1, 1]✓ Correct
  3. C.∑sin⁡(\sum \sin(nx)/n on R\mathbb{R}
  4. D.∑xn\sum x^{n} on [−1/2, 1/2]✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part Bshow ▾
The sequence fn(x)=xnf_{n}(x) = x^{n} on [0, 1] converges
  1. A.uniformly to 0
  2. B.pointwise but not uniformly✓ Correct
  3. C.uniformly to a continuous function
  4. D.nowhere

The worked solution and the per-option analysis are in Trap Analysis.

2. Power series, radius of convergence, Abel's theorem

Read this as a chapter →

Lec-46 Sequences and Series of Functions

NPTEL · Real Analysis (S. H. Kulkarni, IIT Madras)

Sets up function series before specialising to power series.

Lecture 3.1 - Power series

NPTEL · Complex Analysis (Pranav Haridas, KSoM)

Radius of convergence via Cauchy–Hadamard, done over ℂ but identical over ℝ.

Lecture 3.2 - Differentiation of Power series

NPTEL · Complex Analysis (Pranav Haridas, KSoM)

Termwise differentiation keeps the radius.

Power series — radius, boundary, Abel free

In plain words

A power series works inside a disc and fails outside it. The radius is the distance to the nearest breakdown, and the edge itself has to be checked one point at a time.

Radius of convergence

For ∑an(x−c)n:1/R=lim sup⁡\sum{}a_{n}(x - c)^{n}: 1/R = \limsup |an∣1/na_{n}|^{1/n} (Cauchy–Hadamard). If lim |ana_{n}₊1/an_{1}/a_{n}| exists it equals 1/R too, but gaps (e.g.∑(e.g. \sum x2n)x^{2n}) make the ratio test fail while the root test still works.

Series R Boundary
∑xn\sum x^{n} 1 diverges at ±1
∑xn/n\sum x^{n}/n 1 diverges at 1, converges at −1
∑xn/n2\sum x^{n}/n^{2} 1 converges at ±1
∑xn/n\sum x^{n}/n! ∞\infty —
∑n!xn\sum n! x^{n} 0 —
∑\sum x2n/2nx^{2n}/2^{n} 2\sqrt{2} diverges at ±2\pm\sqrt{2}
∑(n!/nn)xn\sum (n!/n^{n}) x^{n} e (ratio → 1/e)

Inside the disc

  • Converges absolutely for |x − c| < R, uniformly on every closed subdisc |x − c| ≤ r < R — not necessarily uniformly on the open disc.
  • Termwise differentiation and integration do not change R; the sum is C∞(C^\infty (indeed analytic) inside.
  • Uniqueness: two power series agreeing on a set with a limit point inside the disc have equal coefficients.

On the boundary

  • Abel's theorem: if ∑an\sum{}a_{n} converges then ∑anxn→∑an\sum{}a_{n}x^{n} \to \sum{}a_{n} as x → 1⁻ (the sum is continuous up to the boundary point). Gives ∑(−1)n\sum(-1)^{n}⁺1/n=ln⁡2^{1}/n = \ln 2 and ∑(−1)n/(2n+1)=π/4\sum(-1)^{n}/(2n+1) = \pi/4.
  • Converse fails: ∑(−1)nxn→1/2\sum(-1)^{n}x^{n} \to 1/2 as x → 1⁻ but ∑(−1)n\sum(-1)^{n} diverges. (Tauber's theorem restores it if an=o(1/n).)a_{n} = o(1/n).)
  • Anything can happen on the circle: none, some, or all boundary points may converge.

Real-analytic vs C∞C^\infty

e−1/x2e^{-1/x^{2}} is C∞C^\infty with zero Taylor series at 0 ⇒ not analytic there. A function equals its Taylor series only where the remainder → 0.

Key takeaways

  • limsup, not lim, for the radius; gaps are the trap.
  • Uniform convergence on compact subsets only; boundary handled by Abel.
  • Differentiate/integrate freely inside; radius unchanged.

Taylor polynomials and the radius you can seeinteractive

This visual is part of Trap Analysis

1/(1+x²) is smooth on all of ℝ, yet its series refuses to go past |x| = 1. Watch the wall the poles at ±i put there.

Unlock interactive visuals

Exam focus: Radius via limsup |aₙ|^{1/n} (Cauchy–Hadamard), never assume the ratio limit exists. Behaviour on the boundary circle is decided separately (Abel); differentiation/integration keep the radius.

Practice

Part B2024 Decembershow ▾
Consider the power series ∑(n=1)∞[n(n2)/(n+1)(n2)]xn\sum_(n=1)^\infty [n^(n^{2})/(n + 1)^(n^{2})]x^{n} with coefficients in real numbers R\mathbb{R}. Which of the following statements is true?
  1. A.The radius of convergence of the series is 1/e
  2. B.The series converges at x = 5
  3. C.The series converges at x = 3
  4. D.The series converges for all x with |x| < 1/2✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part Bshow ▾
The radius of convergence of the power series ∑(n!/nn)zn\sum (n! / n^{n}) z^{n} is
  1. A.1
  2. B.e✓ Correct
  3. C.1/e
  4. D.∞\infty

The worked solution and the per-option analysis are in Trap Analysis.

Part Bshow ▾
The radius of convergence of ∑n≥1\sum_{n\ge1} (2+(−1)n)nxn(2 + (-1)^{n})^{n} x^{n} is
  1. A.1
  2. B.1/3✓ Correct
  3. C.1/2
  4. D.3

Solution

|an∣1/na_{n}|^{1/n} =2+(−1)n= 2 + (-1)^{n} takes values 1 and 3, limsup = 3, so R = 1/3.

The ratio test fails here.

Save for spaced revision (free account)
Part Cshow ▾
Let ∑anxn\sum a_{n} x^{n} be a power series with radius of convergence R = 2. Which of the following are true?
  1. A.The series converges absolutely at every x with |x| < 2.✓ Correct
  2. B.The series converges at x = 2.
  3. C.The differentiated series ∑nanxn\sum n a_{n} x^{n}⁻1^{1} also has radius of convergence 2.✓ Correct
  4. D.The series diverges at every x with |x| > 2.✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part Bshow ▾
Given that ∑n≥1\sum_{n\ge1} (−1)n+1(-1)^{n+1} xn/n=ln⁡(1+x)x^{n}/n = \ln(1 + x) for |x| < 1, the value of ∑n≥1\sum_{n\ge1} (−1)n+1/n(-1)^{n+1}/n is
  1. A.ln 2 by Abel's theorem✓ Correct
  2. B.undefined, since the series diverges
  3. C.1/2
  4. D.ln 2 only if the series converges absolutely

The worked solution and the per-option analysis are in Trap Analysis.

Part Cshow ▾
Let f(x)=∑n=1∞f(x) = \sum_{n=1}^\infty (−1)n(-1)^{n}⁺1xn/n^{1}x^{n}/n for |x| ≤ 1. Which of the following are true?
  1. A.The radius of convergence of the series is 1.✓ Correct
  2. B.The series converges absolutely at x = 1.
  3. C.By Abel's theorem, limx→1−lim_{x\to1^{-}} f(x) equals the sum of the series at x = 1, namely ln 2.✓ Correct
  4. D.The series converges for x = 2.

Solution

(1) the ratio test gives limit 1.

(3) is the classical application of Abel's theorem that justifies 1 − 1/2 + 1/3 − ⋯ = ln 2: the series converges at the endpoint x = 1, so Abel's theorem lets the radius-of-convergence limit be evaluated there.

(2) is false: at x = 1 the series is the alternating harmonic series, conditionally but not absolutely convergent (∑1/n(\sum1/n diverges).

(4) is false: x = 2 is outside the radius of convergence, and the terms (−1)n(-1)^{n}⁺12n/n^{1}2^{n}/n do not even tend to 0.

Save for spaced revision (free account)
Part Cshow ▾
Let f(x)=∑n≥1f(x) = \sum_{n\ge1} xn/n2x^{n}/n^{2}. Which of the following are true?
  1. A.The series converges uniformly on [−1, 1]✓ Correct
  2. B.f is differentiable on (−1, 1) with f′(x)=∑xnf'(x) = \sum x^{n}⁻1/n^{1}/n✓ Correct
  3. C.f′ extends continuously to x = 1
  4. D.f is continuous on [−1, 1]✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part Cshow ▾
Let ∑anxn\sum a_{n}x^{n} be a real power series with radius of convergence R, where 0<R<∞0 < R < \infty. Which of the following are true?
  1. A.The series converges absolutely for every |x| < R.✓ Correct
  2. B.The series converges uniformly on every closed interval [−r, r] with r < R.✓ Correct
  3. C.If the series converges at x = R, then (Abel's theorem) it converges uniformly on [0, R].✓ Correct
  4. D.The series converges absolutely at x = R whenever it converges there.

Solution

(1) is the defining property of the radius of convergence.

(2) follows from the Weierstrass M-test on the compact subinterval.

(3) is Abel's uniform convergence theorem.

(4) is false: convergence at the boundary can be merely conditional — ∑(−1)n\sum(-1)^{n}⁺1xn/n^{1}x^{n}/n has R = 1 and converges at x = 1 to ln 2, but ∑1/n\sum1/n diverges, so the convergence at the boundary is not absolute.

Save for spaced revision (free account)

3. Arzelà–Ascoli and equicontinuity

Read this as a chapter →

Lec52 Equicontinuous family of Functions: Arzela - Ascoli Theorem

NPTEL · Real Analysis (S. H. Kulkarni, IIT Madras)

The statement and proof — this is the whole subtopic in one lecture.

Lec-51 Approximation of a Continuous Function by Polynomials: Weierstrass

NPTEL · Real Analysis (S. H. Kulkarni, IIT Madras)

Weierstrass approximation, the companion result.

Arzelà–Ascoli and equicontinuity free

In plain words

For numbers, staying bounded is enough to pull out a settling subsequence. For functions it is not, because they can keep steepening. Equicontinuity forbids that, and it is the missing hypothesis.

Definitions

A family ℱ ⊂ C[a,b] is equicontinuous if for every ε\varepsilon there is one δ\delta that works for every f ∈ ℱ: |x − y| <δ⇒< \delta \Rightarrow |f(x) − f(y)| <ε< \varepsilon.

Arzelà–Ascoli. On a compact metric space, ℱ ⊂ C(K) is relatively compact (every sequence has a uniformly convergent subsequence) ⇔ ℱ is uniformly bounded and equicontinuous.

The two failure modes

Family on [0,1] Uniformly bounded Equicontinuous Subsequence converges uniformly
fn=xnf_{n} = x^{n} ✓ ✗ ✗
fn=nf_{n} = n ✗ ✓ ✗
fn=sin⁡(f_{n} = \sin(nx) ✓ ✗ ✗
fn=x/nf_{n} = x/n ✓ ✓ ✓
|fn′f_{n}'| ≤ M for all n if also bounded at a point ✓ (M-Lipschitz) ✓

Uniformly bounded derivatives ⇒ equicontinuous (mean value theorem) — the most common way the hypothesis is verified in exam questions.

Why compactness fails in infinite dimensions

The closed unit ball of C[0,1] is closed and bounded but not compact: xnx^{n} has no uniformly convergent subsequence. This is the concrete face of Riesz's theorem.

Uses

  • Peano's existence theorem for ODE (compactness of the Picard iterates).
  • Montel's theorem in complex analysis (normal families).
  • Existence of minimisers in the calculus of variations.

Key takeaways

  • Bounded + equicontinuous ⇔ relatively compact in C(K).
  • Bounded derivatives is the practical test for equicontinuity. −xn- x^{n} is the standard "bounded but not equicontinuous" family.

Checking Arzelà–Ascoli: the hypothesis that usually failsinteractive

This visual is part of Trap Analysis

Two families that look harmless and are not equicontinuous — and exactly where each breaks.

Unlock interactive visuals

Exam focus: Arzelà–Ascoli = uniformly bounded + equicontinuous ⇒ a uniformly convergent subsequence. It is the compactness criterion in C[a,b]; the failures are xⁿ (not equicontinuous) and constants n (not bounded).

Practice

Part Cshow ▾
Which of the following families on [0, 1] are equicontinuous?
  1. A.{xn:n∈Nx^{n} : n \in \mathbb{N}}
  2. B.{x/n:n∈Nx/n : n \in \mathbb{N}}✓ Correct
  3. C.{sin(nx):n∈N) : n \in \mathbb{N}}
  4. D.{f : |f′(x)| ≤ 5 for all x}✓ Correct

Solution

(b) is 1-Lipschitz uniformly; (d) is 5-Lipschitz. xnx^{n} and sin(nx) have derivatives blowing up with n.

Save for spaced revision (free account)
Part Cshow ▾
Consider sequences in C[0, 1] with the sup metric. Which of the following are true?
  1. A.Every uniformly bounded, equicontinuous sequence has a uniformly convergent subsequence.✓ Correct
  2. B.fn(x)=sin⁡(f_{n}(x) = \sin(nx) is equicontinuous on [0, 1].
  3. C.fn(x)=xnf_{n}(x) = x^{n} is equicontinuous on [0, 1].
  4. D.Every uniformly convergent sequence in C[0, 1] is equicontinuous.✓ Correct

The worked solution and the per-option analysis are in Trap Analysis.

Part Cshow ▾
Let fn(x)=xnf_{n}(x) = x^{n} on [0, 1]. Which of the following are true?
  1. A.{fnf_{n}} is uniformly bounded on [0, 1].✓ Correct
  2. B.{fnf_{n}} is equicontinuous on [0, 1].
  3. C.{fnf_{n}} has a subsequence converging uniformly on [0, 1].
  4. D.{fnf_{n}} converges pointwise on [0, 1].✓ Correct

Solution

(1) |xnx^{n}| ≤ 1 throughout.

(4)fn→0(4) f_{n} \to 0 on [0, 1) and fn(1)=1,af_{n}(1) = 1, a genuine pointwise limit, just a discontinuous one.

(2) is false near x = 1, where fnf_{n} oscillates arbitrarily steeply as n grows — no equicontinuity there.

(3) is false as a consequence: every continuous fnf_{n} has this same discontinuous pointwise limit, and a uniform limit of continuous functions must be continuous, so no subsequence — not even the full sequence — can converge uniformly.

This is exactly Arzelà–Ascoli failing because equicontinuity fails.

Save for spaced revision (free account)
Part Cshow ▾
Let {fnf_{n}} be a sequence of continuous functions on [0, 1]. Which of the following are true?
  1. A.If {fnf_{n}} is uniformly bounded and equicontinuous, then it has a uniformly convergent subsequence.✓ Correct
  2. B.Equicontinuity alone, without uniform boundedness, guarantees a uniformly convergent subsequence.
  3. C.Pointwise boundedness plus equicontinuity on a compact set implies uniform boundedness there.✓ Correct
  4. D.The family fn(x)=sin⁡(f_{n}(x) = \sin(nx) is equicontinuous on [0, 1].

Solution

(1) is the Arzelà–Ascoli theorem.

(3) is the standard lemma that upgrades pointwise to uniform boundedness once equicontinuity and compactness are in hand.

(2) is false: the constant functions fn≡nf_{n} \equiv n are equicontinuous (each has zero variation) but not uniformly bounded, and no subsequence converges uniformly since fn(x)→∞f_{n}(x) \to \infty everywhere.

(4) is false: fn′(x)=ncos⁡(f_{n}'(x) = n \cos(nx) is unbounded as n grows, so no single δ\delta works for every n near any fixed point — the standard non-example of equicontinuity.

Save for spaced revision (free account)