JustToThePoint English Website Version
JustToThePoint en español

L'Hôpital's Rule II

Politicians are not born; they are excreted, Marcus Tullius Cicero.

Programming today is a race between software engineers striving to build bigger and better idiot-proof programs, and the Universe trying to produce bigger and better idiots. So far, the Universe is winning, Rick Cook, The Wizardry Compiled.

L’Hôpital’s Rule

Let $f$ and $g$ be differentiable functions on an interval $I$, except possibly at a point $a$ contained in $I$. If $\lim_{x \to a} f(x) = \lim_{x \to a} g(x) = 0$ (or $\pm \infty$), and $g'(x) \neq 0$ for all $x \in I$ (except possibly at $a$), then: $\boxed{\lim_{x \to a} \frac{f(x)}{g(x)} = \lim_{x \to a} \frac{f'(x)}{g'(x)}}$, and that works provided that the limit on the right-hand side actually exists or equals $\pm \infty$.

This is the second article in our two-part series about the L’Hôpital’s Rule and is a continuation of the first one, so if you haven’t taken a look at it yet, I recommend you read it first and then, come back.

The Classics: Rational Functions & Direct Substitution

These are the most standard applications of L’Hôpital’s Rule. When you plug in the limiting value, you get exactly what the rule was built for: $\frac{\infty}{\infty}$ or $\frac{0}{0}$.

The Hierarchy of Growth

Before we tackle the next set, look at the graph below. Notice how the red polynomial curves might start out strong, but the blue exponential curve always violently overtakes them eventually.

The Hierarchy of Growth

When evaluating limits to infinity, remember this Hierarchy of Growth: Logarithms $\ll$ Polynomials (Roots/Powers) $\ll$ Exponentials

L’Hôpital’s Rule algebraically confirms what the hierarchy tells us intuitively.

The Sneaky Indeterminate Forms ($0 \cdot \infty$)

You cannot apply L’Hôpital’s Rule directly to $0 \cdot \infty$. You must force it into a fraction by rewriting one of the terms as its reciprocal: $A \cdot B = \frac{A}{(1/B)}$.

The Dreaded Exponents ($1^\infty, 0^0, \infty^0$)

These are the most complex indeterminate forms.

💣 Warning: $1^\infty$ does not equal 1. For example, $\lim_{n \to \infty} (1+\frac{1}{n})^n = e \approx 2.71828$.

The universal trick for exponent limits is to rewrite $f(x)^{g(x)}$ using the property $e^{\ln(y)} = y$. This allows you to bring the troublesome exponent down into a multiplication format.

Asymptotic Complexity

When analyzing the running time or space usage of algorithms, we cannot simply measure the time in seconds, because that depends heavily on hardware, the operating system, and the programming language. Instead, we estimate the time or space as a function of the input size.

For example, when analyzing an algorithm that sorts a list of numbers, we evaluate how the number of primitive operations (lines of code executed) scales as the length of the input list ($n$) grows.

Rates of Growth (Formal Definition)

In mathematics and computer science, rates of growth (asymptotic growth) refer to the asymptotic behavior of functions as their input values become very large.

Formally, we express that a function $f(x)$ grows strictly slower than a function $g(x)$ using “little-o” notation or the $\ll$ symbol. This means that as the input approaches infinity, $g(x)$ dominates $f(x)$: $\boxed{\lim_{x \to \infty}\frac{f(x)}{g(x)} = 0}$

For example, as $x \to \infty$ and $p > 0$: $1 \ll \log_2(x) \ll x \ll x\log_2(x) \ll x^2$, $\ln(x) \ll x^p \ll e^x \ll e^{x^2}$

Analogously, for inverse functions: $\frac{1}{\ln(x)} \gg \frac{1}{x^p} \gg e^{-x} \gg e^{-x^2}$

The Big Notations: $O$, $\Omega$, and $\Theta$

While limits describe precise mathematical relationships, computer science typically relies on three specific notations to classify how execution time or space requirements grow:

  1. Big-O ($O$): The Upper Bound. It represents the maximum rate of growth. If an algorithm is $O(n^2)$, it will scale no worse than quadratically. In computation, Big-O is heavily used to describe the worst-case complexity of an algorithm.
  2. Big-Omega ($\Omega$): The Lower Bound. It represents the minimum rate of growth, often used to describe the best-case complexity.
  3. Big-Theta ($\Theta$): The Tight Bound. Used when an algorithm’s worst-case and best-case growth rates are identical.

Why We Drop Constants

In asymptotic analysis, constant factors and lower-order terms become virtually meaningless in the face of an arbitrarily large $n$. Therefore, they are dropped.

An algorithm that takes $7n + 15$ operations is simply classified as $O(n)$. Because $n$ drives the growth, a linear algorithm with a massive constant factor will still eventually outperform a quadratic algorithm with a tiny constant factor as the data scales.

Common Complexity Classes

Asymptotic growth is categorized into several standard complexity classes, ordered below from fastest/most efficient to slowest/least efficient:

Complexity Class Notation Description Example Algorithm
Constant $O(1)$ Execution time is independent of input size. Accessing an array by index.
Logarithmic $O(\log n)$ Execution time grows very slowly as input increases. Binary search in a sorted list.
Linear $O(n)$ Execution time grows directly in proportion to the input. Finding the maximum value in an unsorted list.
Linearithmic $O(n \log n)$ Slightly worse (slower) than linear, typical of efficient sorting algorithms. Merge Sort, Quick Sort.
Quadratic $O(n^2)$ Execution time grows in proportion to the square of the input. Nested loops, Bubble Sort.
Cubic $O(n^3)$ Execution time grows in proportion to the cube of the input. Naive matrix multiplication, three nested for loops.
Exponential $O(2^n)$ Execution time doubles with each additional input element. Solving the traveling salesperson problem via brute force, brute-forcing a password.
Factorial $O(n!)$ Execution time grows factorially; extremely slow and only feasible for very small inputs. Generating all permutations of a set.

The Hierarchy of Growth

The Asymptotic Hierarchy:

$O(1) \subset O(\log n) \subset O(n) \subset O(n \log n) \subset O(n^2) \subset O(2^n) \subset O(n!)$

Asymptotic growth is categorized into several classes (complexity classes): constant (1) – not literally 1 but some constant, logarithmic ($\log n$), linear (n), log-linear or linearithmic ($n \log n$), quadratic ($n^2$), cubic ($n^3$), exponential ($2^n$), and factorial (n!).

Bibliography

This content is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License and is based on MIT OpenCourseWare [18.01 Single Variable Calculus, Fall 2007].
  1. NPTEL-NOC IITM, Introduction to Galois Theory.
  2. Algebra, Second Edition, by Michael Artin.
  3. LibreTexts, Calculus. Abstract and Geometric Algebra, Abstract Algebra: Theory and Applications (Judson).
  4. Field and Galois Theory, by Patrick Morandi. Springer.
  5. Michael Penn, and MathMajor.
  6. Contemporary Abstract Algebra, Joseph, A. Gallian.
  7. YouTube’s Andrew Misseldine: Calculus. College Algebra and Abstract Algebra.
  8. MIT OpenCourseWare 18.01 Single Variable Calculus, Fall 2007 and 18.02 Multivariable Calculus, Fall 2007.
  9. Calculus Early Transcendentals: Differential & Multi-Variable Calculus for Social Sciences.
Bitcoin donation

JustToThePoint Copyright © 2011 - 2026 Anawim. ALL RIGHTS RESERVED. Bilingual e-books, articles, and videos to help your child and your entire family succeed, develop a healthy lifestyle, and have a lot of fun. Social Issues, Join us.

This website uses cookies to improve your navigation experience.
By continuing, you are consenting to our use of cookies, in accordance with our Cookies Policy and Website Terms and Conditions of use.