Squeeze theorem

From Wikipedia Mirror

Jump to: navigation, search

Template:Redirect

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

The squeeze theorem is a technical result which is very important in proofs 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 Gauss.

In Italy, Russia and France, the squeeze theorem is also known as the two carabinieri theorem, two militsioner theorem or two gendarmes theorem. The story is that if two police officers are holding a prisoner between them, and both the officers are going to the cells, the prisoner must also be going to the cells.

Contents

Statement

File:Squeeze theorem example.svg
An example of a squeezed function

The squeeze theorem is formally stated as follows.

Let I be an interval containing the point a. Let f, g, 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:

<math>g(x) \leq f(x) \leq h(x)</math>
<p> and also suppose that: <p>
<math>\lim_{x \to a} g(x) = \lim_{x \to a} h(x) = L.</math>
<p> Then <math>\lim_{x \to a} f(x) = L.</math> </blockquote>
  • The functions g(x) and h(x) are said to be lower and upper bounds (respectively) of f(x).
  • Here a is not required to lie in the interior of I. Indeed, if a is an endpoint of I, then the above limits are left- or right-hand limits.
  • A similar statement holds for infinite intervals: for example, if I = (0, ∞), then the conclusion holds, taking the limits as x → ∞.
Proof. From the above hypotheses we have, taking the limit inferior and superior:
<math>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,</math>
so all the inequalities are indeed equalities and the thesis immediately follows.

Proof

The main idea behind this proof is to consider the relative differences between the functions f, g, and h. This has the effect of making the lower bound identically 0, and all the functions non-negative. This greatly simplifies the details of the proof. The general case then follows algebraically.

To begin the proof, assume all the hypotheses and notation as given in the statement of the theorem above. We first prove the special case where g(x) = 0 for all x and L = 0. In this case:

<math>\lim_{x \to a} h(x) = 0.</math>

Let ε > 0 be any fixed positive number. By the definition of the limit of a function, there is a δ > 0 such that:

<math>\mbox{if }0 < |x - a| < \delta, \mbox{ then }|h(x)| < \varepsilon.</math>

For any x in I not equal to a:

<math>0 = g(x) \leq f(x) \leq h(x)</math>

so that:

<math>|f(x)| \leq |h(x)|.</math>

We conclude that:

<math>\mbox{if }0 < |x - a| < \delta, \mbox{ then }|f(x)| \leq |h(x)| < \varepsilon.</math>

This proves that:

<math>\lim_{x \to a} f(x) = 0 = L.</math>

This completes the proof for the special case. Now, we prove the general theorem by letting g and L be arbitrary. For any x in I not equal to a, we have:

<math>g(x) \leq f(x) \leq h(x).</math>

Subtracting g(x) from each expression:

<math>0 \leq f(x) - g(x) \leq h(x) - g(x).</math>

As <math>x \rightarrow a, \, h(x) \rightarrow L</math> and <math>g(x) \rightarrow L</math>, so that:

<math>h(x) - g(x) \rightarrow L - L = 0.</math>

The special case now shows that <math>f(x) - g(x) \rightarrow 0.</math> We conclude that:

<math>f(x) = (f(x) - g(x)) + g(x) \rightarrow 0 + L = L.</math>

Q.E.D.

References

External links

de:Einschnürungssatz el:Κριτήριο παρεμβολής es:Teorema del sándwich fr:Théorème des gendarmes ko:샌드위치 정리 it:Teorema del confronto he:כלל הסנדוויץ' ja:はさみうちの原理 pl:Twierdzenie o trzech ciągach pt:Teorema do confronto ru:Теорема о двух милиционерах sv:Instängningssatsen

zh:夾擠定理

Personal tools
Navigation