Squeeze Theorem/Functions

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $a$ be a point on an open real interval $I$.

Let $f$, $g$ and $h$ be real functions defined at all points of $I$ except for possibly at point $a$.

Suppose that:

$\forall x \ne a \in I: \map g x \le \map f x \le \map h x$
$\ds \lim_{x \mathop \to a} \map g x = \lim_{x \mathop \to a} \map h x = L$


Then:

$\ds \lim_{x \mathop \to a} \ \map f x = L$


Proof 1

We start by proving the special case where $\forall x: \map g x = 0$ and $L = 0$, in which case:

$\ds \lim_{x \mathop \to a} \map h x = 0$

Let $\epsilon > 0$ be a positive real number.

Then by the definition of the limit of a function:

$\exists \delta > 0: 0 < \size {x - a} < \delta \implies \size {\map h x} < \epsilon$

Now:

$\forall x \ne a: 0 = \map g x \le \map f x \le \map h x$

so that:

$\size {\map f x} \le \size {\map h x}$

Thus:

$0 < \size {x - a} < \delta \implies \size {\map f x} \le \size {\map h x} < \epsilon$

By the transitive property of $\le$, this proves that:

$\ds \lim_{x \mathop \to a} \map f x = 0 = L$

$\Box$


We now move on to the general case, with $\map g x$ and $L$ arbitrary.

For $x \ne a$, we have:

$\map g x \le \map f x \le \map h x$

By subtracting $\map g x$ from all expressions, we have:

$0 \le \map f x - \map g x \le \map h x - \map g x$

Since as $x \to a, \map h x \to L$ and $\map g x \to L$, we have:

$\map h x - \map g x \to L - L = 0$

From the special case, we now have:

$\map f x - \map g x \to 0$

We conclude that:

$\map f x = \paren {\map f x - \map g x} + \map g x \to 0 + L = L$

$\blacksquare$


Proof 2

Let $f, g, h$ be real functions defined on an open interval $\openint a b$, except possibly at the point $c \in \openint a b$.


Let:

$\ds \lim_{x \mathop \to c} \map g x = L$
$\ds \lim_{x \mathop \to c} \map h x = L$
$\map g x \le \map f x \le \map h x$ except perhaps at $x = c$.

Let $\sequence {x_n}$ be a sequence of points of $\openint a b$ such that:

$\forall n \in \N_{>0}: x_n \ne c$

and:

$\ds \lim_{n \mathop \to \infty} \ x_n = c$


By Limit of Function by Convergent Sequences:

$\ds \lim_{n \mathop \to \infty} \map g {x_n} = L$

and:

$\ds \lim_{n \mathop \to \infty} \map h {x_n} = L$


Since:

$\map g {x_n} \le \map f {x_n} \le \map h {x_n}$

it follows from the Squeeze Theorem for Real Sequences that:

$\ds \lim_{n \mathop \to \infty} \map f {x_n} = L$


The result follows from Limit of Function by Convergent Sequences.

$\blacksquare$


Proof 3

By the definition of the limit of a real function, we have to prove that:

$\forall \epsilon \in \R_{>0}: \exists \delta \in \R_{>0}: \paren {\size {x - a} < \delta \implies \size {\map f x - L} < \epsilon}$


Let $\epsilon \in \R_{>0}$ be given.

We have:

$\ds \lim_{x \mathop \to a} \map g x = \lim_{x \mathop \to a} \map h x$

Hence by Sum Rule for Limits of Real Functions:

$\ds \lim_{x \mathop \to a} \paren {\map h x - \map g x} = 0$


By the definition of the limit of a real function:

$(1): \quad \forall \epsilon' \in \R_{>0}: \exists \delta \in \R_{>0}: \paren {\size {x - a} < \delta \implies \size {\map h x - L} < \epsilon'}$
$(2): \quad \forall \epsilon' \in \R_{>0}: \exists \delta \in \R_{>0}: \paren {\size {x - a} < \delta \implies \size {\map g x - L} < \epsilon'}$
$(3): \quad \forall \epsilon' \in \R_{>0}: \exists \delta \in \R_{>0}: \paren {\size {x - a} < \delta \implies \size {\map h x - \map g x} < \epsilon'}$


Take $\epsilon' = \dfrac {\epsilon} 3$ in $(1)$, $(2)$, $(3)$.

Then there exists $\delta_1, \delta_2, \delta_3$ that satisfies $(1)$, $(2)$, $(3)$ with $\epsilon' = \dfrac \epsilon 3$.

Take $\delta = \min \set {\delta_1, \delta_2, \delta_3}$.

Then:

\(\ds \size {x - a}\) \(<\) \(\ds \delta\)
\(\ds \leadsto \ \ \) \(\ds \size {\map h x - L}\) \(<\) \(\ds \frac {\epsilon} 3\)
\(\, \ds \land \, \) \(\ds \size {\map g x - L}\) \(<\) \(\ds \frac {\epsilon} 3\)
\(\, \ds \land \, \) \(\ds \size {\map h x - \map g x}\) \(<\) \(\ds \frac {\epsilon} 3\)

So, if $\size {x - a} < \delta$:

\(\ds \size {\map f x - L}\) \(=\) \(\ds \size {\map f x - \map g x + \map h x - L + \map g x - \map h x}\)
\(\ds \) \(\le\) \(\ds \size {\map f x - \map g x} + \size {\map h x - L} + \size {\map h x - \map g x}\)
\(\ds \) \(\le\) \(\ds \size {\map h x - \map g x} + \size {\map h x - L} + \size {\map h x - \map g x}\)
\(\ds \) \(\le\) \(\ds \frac {\epsilon} 3 + \frac {\epsilon} 3 + \frac {\epsilon} 3\)
\(\ds \) \(=\) \(\ds \epsilon\)

$\blacksquare$


Also known as

This result is also known, in the UK in particular, as the sandwich theorem or the sandwich rule.

In that culture, the word sandwich traditionally means specifically enclosing food between two slices of bread, as opposed to the looser usage of the open sandwich, where the there is only one such slice.

Hence, in idiomatic British English, one can refer to the (often uncomfortable) situation of being between two entities as being sandwiched between them.

As the idiom is not universal globally, the term squeeze theorem is preferred on $\mathsf{Pr} \infty \mathsf{fWiki}$, for greatest comprehension.


Sources