Article snapshot taken from Wikipedia with creative commons attribution-sharealike license.
Give it a read and then ask your questions in the chat.
We can research this topic together.
where l(Γ) is the arc length of Γ. In particular, we may take the maximum
as upper bound. 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 below.
Example
Problem.
Find an upper bound for
where Γ is the upper half-circle |z| = a with radiusa > 1 traversed once in the counterclockwise direction.
Solution.
First observe that the length of the path of integration is half the circumference of a circle with radius a, hence
Next we seek an upper bound M for the integrand when |z| = a. By the triangle inequality we see that
therefore
because |z| = a > 1 on Γ. Hence
Therefore, we apply the estimation lemma with M = 1/(a − 1). The resulting bound is
Saff, E.B; Snider, A.D. (1993), Fundamentals of Complex Analysis for Mathematics, Science, and Engineering (2nd ed.), Prentice Hall, ISBN978-0133274615.