Squeeze theorem

In calculus, the squeeze theorem, also known as the pinching theorem, the sandwich theorem, the sandwich rule, and sometimes the squeeze lemma, is a theorem regarding the limit of a function. In Italy, the theorem is also known as theorem of carabinieri.

"Sandwich theorem" redirects here. For the result in measure theory, see Ham sandwich theorem.

Illustration of the squeeze theorem

When a sequence lies between two other converging sequences with the same limit, it also converges to this limit.

The squeeze theorem is used in calculus and mathematical analysis. It is typically used to confirm the limit of a function via comparison with two other functions whose limits are known or easily computed. It was first used geometrically by the mathematicians Archimedes and Eudoxus in an effort to compute π, and was formulated in modern terms by Carl Friedrich Gauss.

In many languages (e.g. French, German, Italian, Hungarian and Russian), the squeeze theorem is also known as the two policemen (and a drunk) theorem, or some variation thereof. The story is that if two policemen are escorting a drunk prisoner between them, and both officers go to a cell, then (regardless of the path taken, and the fact that the prisoner may be wobbling about between the policemen) the prisoner must also end up in the cell.

Statement

The squeeze theorem is formally stated as follows.[1]

Let I be an interval having the point a as a limit point. Let g, f, and h be functions defined on I, except possibly at a itself. Suppose that for every x in I not equal to a, we have

${\displaystyle g(x)\leq f(x)\leq h(x)}$

and also suppose that

${\displaystyle \lim _{x\to a}g(x)=\lim _{x\to a}h(x)=L.}$

Then ${\displaystyle \lim _{x\to a}f(x)=L.}$

• The functions ${\textstyle g}$ and ${\textstyle h}$ are said to be lower and upper bounds (respectively) of ${\textstyle f}$.
• Here, ${\textstyle a}$ is not required to lie in the interior of ${\textstyle I}$. Indeed, if ${\textstyle a}$ is an endpoint of ${\textstyle I}$, then the above limits are left- or right-hand limits.
• A similar statement holds for infinite intervals: for example, if ${\textstyle I=(0,\infty )}$, then the conclusion holds, taking the limits as ${\textstyle x\rightarrow \infty }$.

This theorem is also valid for sequences. Let ${\displaystyle (a_{n}),(c_{n})}$ be two sequences converging to ${\displaystyle \ell }$, and ${\displaystyle (b_{n})}$ a sequence. If ${\displaystyle \forall n\geqslant N,N\in \mathbb {N} }$ we have ${\displaystyle a_{n}\leqslant b_{n}\leqslant c_{n}}$, then ${\displaystyle (b_{n})}$ also converges to ${\displaystyle \ell }$.

Proof

According to the above hypotheses we have, taking the limit inferior and superior:

${\displaystyle L=\lim _{x\to a}g(x)\leq \liminf _{x\to a}f(x)\leq \limsup _{x\to a}f(x)\leq \lim _{x\to a}h(x)=L,}$

so all the inequalities are indeed equalities, and the thesis immediately follows.

A direct proof, using the ${\displaystyle (\epsilon ,\delta )}$-definition of limit, would be to prove that for all real ${\textstyle \epsilon >0}$ there exists a real ${\displaystyle \delta >0}$ such that for all ${\displaystyle x}$ with ${\displaystyle |x-a|<\delta }$, we have ${\displaystyle |f(x)-L|<\epsilon }$. Symbolically,

${\displaystyle \forall \epsilon >0,\exists \delta >0:\forall x,(|x-a|<\delta \ \Rightarrow |f(x)-L|<\epsilon ).}$

As

${\displaystyle \lim _{x\to a}g(x)=L}$

means that

${\displaystyle \forall \varepsilon >0,\exists \ \delta _{1}>0:\forall x\ (|x-a|<\delta _{1}\ \Rightarrow \ |g(x)-L|<\varepsilon ).\qquad (1)}$

and

${\displaystyle \lim _{x\to a}h(x)=L}$

means that

${\displaystyle \forall \varepsilon >0,\exists \ \delta _{2}>0:\forall x\ (|x-a|<\delta _{2}\ \Rightarrow \ |h(x)-L|<\varepsilon ),\qquad (2)}$

then we have

${\displaystyle g(x)\leq f(x)\leq h(x)}$

${\displaystyle g(x)-L\leq f(x)-L\leq h(x)-L}$

We can choose ${\displaystyle \delta$ :=\min \left\{\delta _{1},\delta _{2}\right\}} . Then, if ${\displaystyle |x-a|<\delta }$, combining (1) and (2), we have

${\displaystyle -\varepsilon <g(x)-L\leq f(x)-L\leq h(x)-L\ <\varepsilon ,}$

${\displaystyle -\varepsilon <f(x)-L<\varepsilon }$,

which completes the proof. ${\displaystyle \blacksquare }$

The proof for sequences is very similar, using the ${\displaystyle \epsilon }$-definition of a limit of a sequence.

Statement for series

There is also the squeeze theorem for series, which can be stated as follows:

Let ${\displaystyle \sum _{n}a_{n},\sum _{n}c_{n}}$ be two convergent series. If ${\displaystyle \exists N\in \mathbb {N} }$ such that ${\displaystyle \forall n>N,a_{n}\leqslant b_{n}\leqslant c_{n}}$then ${\displaystyle \sum _{n}b_{n}}$ also converges.

Proof

Let ${\displaystyle \sum _{n}a_{n},\sum _{n}c_{n}}$ be two convergent series. Hence, the sequences ${\displaystyle \left(\sum _{k=1}^{n}a_{n}\right)_{n=1}^{\infty },\left(\sum _{k=1}^{n}c_{n}\right)_{n=1}^{\infty }}$ are Cauchy. That is, for fixed ${\displaystyle \epsilon >0}$,

${\displaystyle \exists N_{1}\in \mathbb {N} }$ such that ${\displaystyle \forall n>m>N_{1},\left|\sum _{k=1}^{n}a_{n}-\sum _{k=1}^{m}a_{n}\right|<\epsilon \Longrightarrow \left|\sum _{k=m+1}^{n}a_{n}\right|<\epsilon \Longrightarrow -\epsilon <\sum _{k=m+1}^{n}a_{n}<\epsilon }$ (1)

and similarly ${\displaystyle \exists N_{2}\in \mathbb {N} }$ such that ${\displaystyle \forall n>m>N_{2},\left|\sum _{k=1}^{n}c_{n}-\sum _{k=1}^{m}c_{n}\right|<\epsilon \Longrightarrow \left|\sum _{k=m+1}^{n}c_{n}\right|<\epsilon \Longrightarrow -\epsilon <\sum _{k=m+1}^{n}c_{n}<\epsilon }$ (2).

We know that ${\displaystyle \exists N_{3}\in \mathbb {N} }$ such that ${\displaystyle \forall n>N_{3},a_{n}\leqslant b_{n}\leqslant c_{n}}$. Hence, ${\displaystyle \forall n>m>\max\{N_{1},N_{2},N_{3}\}}$, we have combining (1) and (2):

${\displaystyle a_{n}\leqslant b_{n}\leqslant c_{n}\Longrightarrow \sum _{k=m+1}^{n}a_{n}\leqslant \sum _{k=m+1}^{n}b_{n}\leqslant \sum _{k=m+1}^{n}c_{n}\Longrightarrow -\epsilon <\sum _{k=m+1}^{n}b_{n}<\epsilon \Longrightarrow \left|\sum _{k=m+1}^{n}b_{n}\right|<\epsilon \Longrightarrow \left|\sum _{k=1}^{n}b_{n}-\sum _{k=1}^{m}b_{n}\right|<\epsilon }$.

Therefore ${\displaystyle \left(\sum _{k=1}^{n}b_{n}\right)_{n=1}^{\infty }}$is a Cauchy sequence. So ${\displaystyle \sum _{n}b_{n}}$ converges. ${\displaystyle \blacksquare }$

Examples

First example

x² sin(1/x) being squeezed in the limit as x goes to 0

The limit

${\displaystyle \lim _{x\to 0}x^{2}\sin({\tfrac {1}{x}})}$

cannot be determined through the limit law

${\displaystyle \lim _{x\to a}(f(x)\cdot g(x))=\lim _{x\to a}f(x)\cdot \lim _{x\to a}g(x),}$

because

${\displaystyle \lim _{x\to 0}\sin({\tfrac {1}{x}})}$

does not exist.

However, by the definition of the sine function,

${\displaystyle -1\leq \sin({\tfrac {1}{x}})\leq 1.}$

It follows that

${\displaystyle -x^{2}\leq x^{2}\sin({\tfrac {1}{x}})\leq x^{2}}$

Since ${\displaystyle \lim _{x\to 0}-x^{2}=\lim _{x\to 0}x^{2}=0}$, by the squeeze theorem, ${\displaystyle \lim _{x\to 0}x^{2}\sin({\tfrac {1}{x}})}$ must also be 0.

Second example

Comparing areas:
${\displaystyle {\begin{aligned}&\,A(\triangle ADF)\geq A({\text{sector}}\,ADB)\geq A(\triangle ADB)\\\Rightarrow &\,{\frac {1}{2}}\cdot \tan(x)\cdot 1\geq {\frac {x}{2\pi }}\cdot \pi \geq {\frac {1}{2}}\cdot \sin(x)\cdot 1\\\Rightarrow &\,{\frac {\sin(x)}{\cos(x)}}\geq x\geq \sin(x)\\\Rightarrow &\,{\frac {\cos(x)}{\sin(x)}}\leq {\frac {1}{x}}\leq {\frac {1}{\sin(x)}}\\\Rightarrow &\,\cos(x)\leq {\frac {\sin(x)}{x}}\leq 1\end{aligned}}}$

Probably the best-known examples of finding a limit by squeezing are the proofs of the equalities

${\displaystyle {\begin{aligned}&\lim _{x\to 0}{\frac {\sin(x)}{x}}=1,\\[10pt]&\lim _{x\to 0}{\frac {1-\cos(x)}{x}}=0.\end{aligned}}}$

The first limit follows by means of the squeeze theorem from the fact that

${\displaystyle \cos x\leq {\frac {\sin(x)}{x}}\leq 1}$[2]

for x close enough to 0. The correctness of which for positive x can be seen by simple geometric reasoning (see drawing) that can be extended to negative x as well. The second limit follows from the squeeze theorem and the fact that

${\displaystyle 0\leq {\frac {1-\cos(x)}{x}}\leq x}$

for x close enough to 0. This can be derived by replacing ${\displaystyle \sin(x)}$ in the earlier fact by ${\displaystyle {\sqrt {1-\cos(x)^{2}}}}$ and squaring the resulting inequality.

These two limits are used in proofs of the fact that the derivative of the sine function is the cosine function. That fact is relied on in other proofs of derivatives of trigonometric functions.

Third example

It is possible to show that

${\displaystyle {\frac {d}{d\theta }}\tan \theta =\sec ^{2}\theta }$

by squeezing, as follows.

In the illustration at right, the area of the smaller of the two shaded sectors of the circle is

${\displaystyle {\frac {\sec ^{2}\theta \,\Delta \theta }{2}},}$

since the radius is sec θ and the arc on the unit circle has length Δθ. Similarly, the area of the larger of the two shaded sectors is

${\displaystyle {\frac {\sec ^{2}(\theta +\Delta \theta )\,\Delta \theta }{2}}.}$

What is squeezed between them is the triangle whose base is the vertical segment whose endpoints are the two dots. The length of the base of the triangle is tan(θ + Δθ) − tan(θ), and the height is 1. The area of the triangle is therefore

${\displaystyle {\frac {\tan(\theta +\Delta \theta )-\tan(\theta )}{2}}.}$

From the inequalities

${\displaystyle {\frac {\sec ^{2}\theta \,\Delta \theta }{2}}\leq {\frac {\tan(\theta +\Delta \theta )-\tan(\theta )}{2}}\leq {\frac {\sec ^{2}(\theta +\Delta \theta )\,\Delta \theta }{2}}}$

we deduce that

${\displaystyle \sec ^{2}\theta \leq {\frac {\tan(\theta +\Delta \theta )-\tan(\theta )}{\Delta \theta }}\leq \sec ^{2}(\theta +\Delta \theta ),}$

provided Δθ > 0, and the inequalities are reversed if Δθ < 0. Since the first and third expressions approach sec²θ as Δθ → 0, and the middle expression approaches (d/dθ) tan θ, the desired result follows.

Fourth example

The squeeze theorem can still be used in multivariable calculus but the lower (and upper functions) must be below (and above) the target function not just along a path but around the entire neighborhood of the point of interest and it only works if the function really does have a limit there. It can, therefore, be used to prove that a function has a limit at a point, but it can never be used to prove that a function does not have a limit at a point.[3]

${\displaystyle \lim _{(x,y)\to (0,0)}{\frac {x^{2}y}{x^{2}+y^{2}}}}$

cannot be found by taking any number of limits along paths that pass through the point, but since

${\displaystyle 0\leq {\frac {x^{2}}{x^{2}+y^{2}}}\leq 1}$

${\displaystyle -\left|y\right\vert \leq y\leq \left|y\right\vert }$

${\displaystyle -\left|y\right\vert \leq {\frac {x^{2}y}{x^{2}+y^{2}}}\leq \left|y\right\vert }$

${\displaystyle \lim _{(x,y)\to (0,0)}-\left|y\right\vert =0}$

${\displaystyle \lim _{(x,y)\to (0,0)}\left|y\right\vert =0}$

${\displaystyle 0\leq \lim _{(x,y)\to (0,0)}{\frac {x^{2}y}{x^{2}+y^{2}}}\leq 0}$

therefore, by the squeeze theorem,

${\displaystyle \lim _{(x,y)\to (0,0)}{\frac {x^{2}y}{x^{2}+y^{2}}}=0}$

References

1. Sohrab, Houshang H. (2003). Basic Real Analysis (2nd ed.). Birkhäuser. p. 104. ISBN 978-1-4939-1840-9.
2. Selim G. Krejn, V.N. Uschakowa: Vorstufe zur höheren Mathematik. Springer, 2013, ISBN 9783322986283, pp. 80-81 (German). See also Sal Khan: Proof: limit of (sin x)/x at x=0 (video, Khan Academy)
3. Stewart, James (2008). "Chapter 15.2 Limits and Continuity". Multivariable Calculus (6th ed.). pp. 909–910. ISBN 0495011630.

External links

• Weisstein, Eric W. "Squeezing Theorem". MathWorld.
• Squeeze Theorem by Bruce Atwood (Beloit College) after work by, Selwyn Hollis (Armstrong Atlantic State University), the Wolfram Demonstrations Project.
• Squeeze Theorem on ProofWiki.