Real Analysis — The Foundations of Calculus

🔬 ScientistPure mathematics — no exam syllabus

Real Analysis — The Foundations of Calculus

Real analysis is calculus made rigorous. For centuries, mathematicians used derivatives and integrals without a precise understanding of what they were. Limits were "approaching" but never arriving. Infinitesimals were "infinitely small" but nobody could define them. In the 19th century, Cauchy, Weierstrass, Dedekind, and Riemann rebuilt calculus from the ground up — replacing vague intuition with epsilon-delta precision. The result is real analysis: the study of the real number system, sequences, continuity, differentiation, and integration, all built on the solid foundation of the completeness axiom.

"God created the integers, all else is the work of man."

— Leopold Kronecker

Part 1

📏 The Real Numbers — Filling the Gaps

The Problem with √2

Why the Rationals Have Holes and How We Filled Them

The ancient Greeks discovered that √2 is irrational — it can't be written as a fraction. But geometrically, √2 is the length of the diagonal of a unit square. It must exist. This gap between the rational numbers (which have holes) and the geometric continuum was a scandal for 2000 years. In 1872, Dedekind solved it with his cut: he defined a real number as a partition of the rationals into two sets L and R where every element of L is less than every element of R, and L has no largest element. The cut for √2 puts all rationals with x² < 2 into L and all with x² > 2 into R. This construction fills every gap in the rationals, creating the continuum of real numbers — the completeness of ℝ.

Real numbers are not given by nature — they are constructed to make the number line continuous.

The Completeness Axiom

Every non-empty set of real numbers that is bounded above has a least upper bound (supremum). This is the completeness axiom, and it's the single property that distinguishes ℝ from ℚ. In ℚ, the set {x : x² < 2} has no supremum (√2 is missing). In ℝ, it does. From completeness, everything else follows: the intermediate value theorem, the extreme value theorem, the convergence of Cauchy sequences, the existence of limits.

Completeness Axiom

Every non-empty set bounded above has a supremum

This one property guarantees the continuum has no gaps.

Archimedean Property

For any real number x, there exists a natural number n such that n > x. This seemingly obvious statement — that there are no infinite real numbers — is a consequence of completeness. It implies the rationals are dense in ℝ: between any two real numbers, there is a rational.

Part 2

🔢 Sequences — Approaching Infinity

The Algebra of Limits

What Does It Mean for a Sequence to Converge?

A sequence (aₙ) converges to L if for every ε > 0, there exists N such that for all n ≥ N, |aₙ − L| < ε. This epsilon-definition, perfected by Weierstrass, removes all vagueness from "approaches." The sequence 1, 1/2, 1/3, 1/4, ... converges to 0 because for any ε, choose N > 1/ε and all subsequent terms are within ε. A Cauchy sequence is one where terms get arbitrarily close to each other: for every ε > 0, there exists N such that for all m,n ≥ N, |aₘ − aₙ| < ε. In ℝ, every Cauchy sequence converges — this is equivalent to completeness and is the standard way to define completeness in metric spaces.

A sequence converges not when it "reaches" its limit, but when it can get arbitrarily close and stay there.

Key Theorems

Monotone Convergence

Bounded monotone sequences converge

Bolzano-Weierstrass

Every bounded sequence has a convergent subsequence

Squeeze Theorem

If aₙ ≤ bₙ ≤ cₙ and aₙ,cₙ → L then bₙ → L

Cauchy Criterion

A sequence converges iff it is Cauchy

✨

Proof That √2 Exists (Using Completeness)▶

Let S = {x ∈ ℝ : x² < 2}. S is non-empty (1 ∈ S) and bounded above (2 is an upper bound). By completeness, S has a supremum s. We show s² = 2.

If s² < 2, then for small h > 0, (s+h)² = s² + 2sh + h² < 2 for sufficiently small h, so s+h ∈ S — contradiction since s is an upper bound.

If s² > 2, then for small h > 0, (s−h)² > 2, so s−h is a smaller upper bound — contradiction.

Therefore s² = 2, and s = √2. This proof works only because of completeness — in ℚ, no such s exists.

Series — Adding Infinitely Many Numbers

A series Σ aₙ converges if the sequence of partial sums converges. The geometric series Σ rⁿ converges to 1/(1−r) when |r| < 1. The harmonic series Σ 1/n diverges (slowly — like ln n). The alternating harmonic series Σ (−1)ⁿ⁺¹/n converges to ln 2. A series converges absolutely if Σ |aₙ| converges; otherwise it converges conditionally. The Riemann rearrangement theorem says conditionally convergent series can be rearranged to sum to any value — absolute convergence is the only kind that's well-behaved.

Part 3

🎯 Continuity — Functions Without Gaps

The Epsilon-Delta Definition

Cauchy and Weierstrass Tame the Infinite

A function f is continuous at a if for every ε > 0, there exists δ > 0 such that |x − a| < δ implies |f(x) − f(a)| < ε. This is the famous epsilon-delta definition. Intuitively: if you want the output to stay within a tiny window ε, you can find a tiny input window δ that guarantees it. Continuous functions on closed intervals have the Intermediate Value Property (they take every value between f(a) and f(b)) and the Extreme Value Property (they attain their maximum and minimum). Both rely on completeness — they fail on ℚ.

Continuity means small changes in input produce small changes in output — and the size of "small" can be chosen uniformly.

Uniform Continuity

A function is uniformly continuous on a set if δ can be chosen independently of the point — the same δ works everywhere. Continuous functions on closed bounded intervals are automatically uniformly continuous (Heine-Cantor theorem). On unbounded intervals, this fails: f(x) = x² is continuous on ℝ but not uniformly continuous — the δ required to keep changes small shrinks as x grows.

Differentiability — The Best Linear Approximation

A function is differentiable at a if the limit f'(a) = lim_{h→0} (f(a+h) − f(a))/h exists. Geometrically, f'(a) is the slope of the tangent line — the best linear approximation to f near a. Differentiability implies continuity, but not vice versa (f(x) = |x| is continuous but not differentiable at 0). The Mean Value Theorem says there's a point where the instantaneous slope equals the average slope: f'(c) = (f(b)−f(a))/(b−a).

Mean Value Theorem

f'(c) = (f(b) − f(a)) / (b − a) for some c ∈ (a,b)

If f(a) = f(b), then f'(c) = 0 (Rolle's theorem).

Taylor's Theorem — Power Series Approximations

If f is n+1 times differentiable, then f(x) can be approximated by its Taylor polynomial with an error term: f(x) = Σ_{k=0}^{n} f^{(k)}(a)(x−a)ᵏ/k! + Rₙ(x). The remainder Rₙ(x) can be expressed in various forms (Lagrange, Cauchy, integral). For analytic functions, the Taylor series converges to f within its radius of convergence.

Part 4

📊 Integration — Measuring Area Under Curves

Riemann's Definition

How to Make Area Rigorous

The Riemann integral partitions the domain into subintervals, forms rectangles whose heights are the function values at sample points, and takes the limit as the partition becomes finer. A function is Riemann integrable if this limit exists and is independent of the sample points chosen. Continuous functions are Riemann integrable, as are monotone functions and functions with countably many discontinuities. The Fundamental Theorem of Calculus connects integration and differentiation: the derivative of the integral is the original function, and the integral of the derivative is the change in the original function.

Integration is not just area — it's the inverse of differentiation, and its existence depends on continuity (which depends on completeness).

FTC Part 1

d/dx ∫ₐˣ f(t) dt = f(x)

FTC Part 2

∫ₐᵇ f'(x) dx = f(b) − f(a)

Integration by Parts

∫ u dv = uv − ∫ v du

Improper Integral

∫ₐ^∞ f(x) dx = lim_{t→∞} ∫ₐᵗ f(x) dx

Sequences of Functions — When Can We Swap Limits?

When does lim_{n→∞} lim_{x→a} fₙ(x) = lim_{x→a} lim_{n→∞} fₙ(x)? Not always! Pointwise convergence — each x individually — is too weak to allow swapping. Uniform convergence — where the rate of convergence is independent of x — preserves continuity, differentiability, and integrability, allowing limits to be swapped. The Weierstrass M-test gives a sufficient condition for uniform convergence of series.

Beyond Riemann — The Lebesgue Integral

The Riemann integral has limitations: it doesn't handle functions with dense discontinuities well, and it doesn't play nicely with limits. The Lebesgue integral partitions the range instead of the domain, leading to a more powerful theory that integrates more functions and allows better limit theorems (dominated convergence, monotone convergence). This is the foundation of measure theory and modern analysis, essential for probability theory and partial differential equations.

"Analysis is the art of taking limits, and real analysis is the science of when you're allowed to."

— Anonymous analyst

🎯 Practice — Check Your Analysis Intuition

These puzzles build real analysis intuition — think epsilon!

← Back to Math Map