Estimation lemma
From Wikipedia, the free encyclopedia
In mathematics, the estimation lemma gives an upper bound for a contour integral. If f is a continuous function on the contour Γ and if f(z) ≤ M for all z on Γ, then
where l(Γ) is the length of Γ. In particular, it is the case that
- .
Intuitively, the lemma is very simple to understand. If a contour is thought of as many smaller contour segments connected together, then there will be a maximum |f(z)| for each segment. Out of all the maximum |f(z)|'s for the segments, there will be an overall largest one. Hence, if the overall largest |f(z)| is summed over the entire path then the integral of f(z) over the path must be less than or equal to it.
The estimation lemma is most commonly used as part of the methods of contour integration with the intent to show that the integral over part of a contour goes to zero as | z | goes to infinity. An example of such a case is shown in the example below.
[edit] Example
Problem. Find an upper bound for
where Γ is the upper half-circle | z | = a traversed once in the counterclockwise direction.
Solution. First observe that the path of integration has length
Next we seek an upper bound M for the integrand when | z | = a. By the triangle inequality we see that
since | z | = a on Γ. Hence
Therefore we apply the estimation lemma with M = 1 / (a2 − 1)2. The resulting bound is
[edit] References
- Saff, E.B, Snider, A.D., Fundamentals of Complex Analysis for Mathematics, Science, and Engineering (Prentice Hall, 1993).
- Howie J.M., Complex Analysis (Springer, 2003).