Skip to content

References: Limits done carefully

Source curriculum (structural mirror, cited as further study):
This Clawdemy lesson bundles three consecutive 3Blue1Brown chapters into one,
because the three serve a single capability cluster (precise limits + handling
the forms where plug-in fails):
• 3Blue1Brown, Essence of Calculus, Chapter 8: "Limits and the definition of derivatives"
https://www.3blue1brown.com/lessons/limits
• 3Blue1Brown, Essence of Calculus, Chapter 9: (ε, δ) "epsilon delta" definitions of limits
https://www.3blue1brown.com/lessons/epsilon-delta
• 3Blue1Brown, Essence of Calculus, Chapter 10: "L'Hôpital's rule"
https://www.3blue1brown.com/lessons/l-hopitals-rule
Creator: Grant Sanderson
Series index: https://www.3blue1brown.com/?topic=calculus
License: copyright Grant Sanderson; videos published on his site and YouTube
Clawdemy's lessons are original prose that follows the pedagogical arc of this
series. We do not reproduce or transcribe the videos; we cite them as the
recommended companion. All rights to the original videos remain with the creator.

Where this sits in the track and the wider curriculum.

  • The derivative as a rate (earlier lesson). That lesson defined the derivative as lim (h->0) (f(x+h)-f(x))/h, a 0/0 limit handled by simplifying before taking the limit. This lesson is the foundation underneath it: what “approaches” means, and how to compute the limits that resist a plug-in.

  • Taylor series (final lesson). L’Hôpital works by keeping each function’s first-order behavior near a point (f(a) + f'(a)(x-a)). Taylor series extends that to a full polynomial built from all the derivatives, so L’Hôpital is the one-term preview of the capstone.

  • Convergence and approximation theory (across the AI tracks). The guarantees that gradient descent converges and that neural networks can approximate arbitrary functions are limit-based statements; the “forceable arbitrarily close” intuition here is the same one those proofs rely on.