L'Hôpital's rule

Level UniversityDifficulty ★★★★★Theorem⌖ Open in the map

What is it?

For indeterminate forms 0/00/0 or ∞/∞\infty/\infty, lim⁡fg=lim⁡f′g′\lim \frac fg = \lim \frac{f'}{g'} when the right-hand limit exists. It settles races between growth rates, such as log⁡n\log n versus nεn^\varepsilon.

Statement

If f(x),g(x)→0f(x), g(x) \to 0 (or both →±∞\to \pm\infty) as x→ax \to a, g′≠0g' \ne 0 near aa, and lim⁡x→af′(x)g′(x)=L\lim_{x\to a}\frac{f'(x)}{g'(x)} = L, then lim⁡x→af(x)g(x)=L\lim_{x\to a}\frac{f(x)}{g(x)} = L.

Idea of the proof

Extend f,gf, g by 00 at aa and apply Cauchy's MVT on [a,x][a, x]: f(x)g(x)=f′(cx)g′(cx)\frac{f(x)}{g(x)} = \frac{f'(c_x)}{g'(c_x)} with cx→ac_x \to a.

Formulas

lim⁡n→∞ln⁡nnε=lim⁡n→∞1/nεnε−1=lim⁡n→∞1εnε=0\lim_{n\to\infty}\frac{\ln n}{n^{\varepsilon}} = \lim_{n\to\infty}\frac{1/n}{\varepsilon n^{\varepsilon - 1}} = \lim_{n\to\infty}\frac{1}{\varepsilon n^{\varepsilon}} = 0
logarithms lose against any power

Where it shows up in computing

  • Algorithm analysis and complexity★★★★★frequentScientific computing and algorithms

    Proves the growth hierarchy used to compare algorithms: log⁡n=o(nε)\log n = o(n^\varepsilon), nk=o(2n)n^k = o(2^n).

Where is it used?

Computing topics reachable from here, through the chain of ideas that leads to them:

Exercises

1Computation

Compute lim⁡x→0x−sin⁡xx3\lim_{x\to 0}\frac{x - \sin x}{x^3}.

Solution

Three applications: 1−cos⁡x3x2→sin⁡x6x→cos⁡x6→16\frac{1 - \cos x}{3x^2} \to \frac{\sin x}{6x} \to \frac{\cos x}{6} \to \frac16.

↑ ↓ to navigate · ↵ · Esc