Week 2 Overview Hub
A Gentle Note Before You Begin: You Belong Here
If opening this page brings a sudden wave of hesitation, pause and take a steady breath. The transition from introductory calculus to real analysis is notorious for making even dedicated students feel completely disoriented. In calculus, you learned how to compute answers with recipes and algebraic steps. Here, we suddenly ask you to defend why those answers are true, using Greek letters ($\epsilon$, $\delta$), nested quantifiers ($\forall$, $\exists$), and inequalities that can feel backwards at first glance.
Feeling friction right now does not mean you lack mathematical ability—it means your brain is being asked to think in an entirely new way. Nobody reads an $\epsilon\text{-}N$ proof for the first time and finds it obvious. Real mathematicians do not write these proofs in one neat pass; they make messy scratches on scrap paper, test guesses, and only polish the logic at the very end. Be kind to yourself this week, take breaks when your mind feels full, and trust that the intuition will click as you spend time with the pictures behind the symbols.
The Big Picture: Demystifying "Approaching Infinity"
In earlier math courses, limits are usually introduced as an intuitive movie: "as $n$ gets larger and larger, the terms $a_n$ move closer and closer to $L$." That mental picture is a wonderful place to start, but pure mathematics asks a deeper, practical question: how do you guarantee that a sequence doesn't suddenly drift away when you look away?
The great breakthrough of analysis was replacing the slippery idea of "getting closer" with an ironclad guarantee of distance. Instead of watching motion, we establish a challenge: you specify any tiny tolerance window you like—no matter how microscopically narrow—and we show that after a certain point down the line, every single term remains trapped inside that window forever.
Across this week's three lectures, we unpack that single idea one step at a time:
We start in Lecture 4 (Formal $\epsilon\text{-}N$ Convergence and Limit Laws) by stripping the fear from the definition. We treat convergence like target practice: you name the tolerance $\epsilon$, and we find the cutoff locker index $N$ after which every term hits the target. Once that foundation is solid, we prove that convergent sequences can never wander off to infinity (they are bounded) and build reliable algebraic rules for combining limits.
In Lecture 5 (The Monotone Convergence Theorem and Squeeze Principle), we ask what happens when a sequence only moves in one direction—always climbing or always falling—but runs straight into a solid boundary. Completeness guarantees that it must settle against that ceiling, giving us a powerful way to define numbers like $e$ without guessing. We then learn how to handle erratic, oscillating terms by trapping them between two well-behaved sequences in the Squeeze Principle.
Finally, in Lecture 6 (Recursive Sequences and Divergence to Infinity), we investigate sequences generated by feedback loops, where each step depends on the previous one. We explore why calculating limits before proving they actually exist leads to subtle traps, and we establish the formal benchmark for when sequences refuse to settle down at all, breaking past every conceivable floor to $+\infty$.
Pacing Advice: Treat each lecture as an exploration, not a race. Read the intuitive explanations first, look at the visual diagrams, and let the formal definitions settle naturally before diving into algebraic proofs.
Surviving the Shift to Real Analysis
Feeling like you've suddenly walked into a philosophy class written in Greek letters? You are not alone! In this bright, reassuring Week 2 kickoff, we validate the "culture shock" of moving from calculation to formal proofs. Join us as we translate the intimidating $\epsilon\text{-}N$ definition into a simple two-player archery game, introduce the analytical superweapons (like the Monotone Convergence Theorem), and reveal exactly why conquering this week's mathematical obstacles gives you the superpower you need to handle Infinite Series in Week 3.
Weekly Lecture Modules
Select a lecture module below to begin:
Formal $\epsilon\text{-}N$ Convergence and Limit Laws →
Master the formal $\epsilon\text{-}N$ definition of convergence through interactive archery simulators, explore quantifier order dependencies, prove sequence boundedness, and establish the algebraic limit laws for sums, products, and quotients.
The Monotone Convergence Theorem and the Squeeze Principle →
Connect sequence limits to suprema and real completeness. Study the full proof of the Monotone Convergence Theorem, trace Euler's number $e = \lim (1 + 1/n)^n$, explore the lottery thought experiment, and sandwich trigonometric sequences using the Squeeze Theorem.
Recursive Sequences and Divergence to Infinity →
Learn why blind algebraic substitution fails on recurrence relations, prove error contraction for continued fractions approximating $\sqrt{2}$, master the 4-step recursive strategy, and formalize divergence to infinity via the $M\text{-}N$ towering floor test.