Math 2.0

Functions of a complex variable Proof

Proof of the estimation lemma

Builds on Contour integralAdditivity of the integral over intervalsLinearity of the integralMonotonicity of the integralContinuous functions are Riemann integrableTriangle inequality for norms

Proof

We first prove ∣∫g∣≤∫∣g∣\abs{\int g} \le \int \abs{g} for a continuous complex function gg, then apply it piece by piece.

  1. Let [p,q][p, q] be an interval and g:[p,q]→ℂg : [p, q] \to \C continuous. Its real and imaginary parts and ∣g∣\abs{g} are continuous, so they are Riemann integrable. Put I=∫pqg(t) dtI = \int_p^q g(t) \, dt.
  2. For a complex constant λ\lambda, ∫pqλg=λI\int_p^q \lambda g = \lambda I. This follows from the linearity of the real integral applied to Re⁡(λg)\operatorname{Re}(\lambda g) and Im⁡(λg)\operatorname{Im}(\lambda g).
  3. If I=0I = 0, then ∣I∣≤∫pq∣g∣\abs{I} \le \int_p^q \abs{g}, since ∣g∣≥0\abs{g} \ge 0. Otherwise put λ=∣I∣/I\lambda = \abs{I} / I, so that ∣λ∣=1\abs{\lambda} = 1 and λI=∣I∣\lambda I = \abs{I}.
  4. By step 2, ∣I∣=λI=∫pqλg\abs{I} = \lambda I = \int_p^q \lambda g. This number is real, so it equals ∫pqRe⁡(λg)\int_p^q \operatorname{Re}(\lambda g).
  5. We have Re⁡(λg)≤∣λg∣=∣g∣\operatorname{Re}(\lambda g) \le \abs{\lambda g} = \abs{g}. By the monotonicity of the integral, ∣I∣≤∫pq∣g(t)∣ dt\abs{I} \le \int_p^q \abs{g(t)} \, dt.
  6. Now choose a=t0<t1<⋯<tm=ba = t_0 < t_1 < \dots < t_m = b such that γ\gamma is continuously differentiable on each [tj−1,tj][t_{j-1}, t_j]. Put g(t)=f(γ(t))γ′(t)g(t) = f(\gamma(t)) \gamma'(t), which is continuous on each such piece.
  7. By the definition of the contour integral and additivity over intervals, ∫γf(z) dz=∑j=1m∫tj−1tjg(t) dt\int_\gamma f(z) \, dz = \sum_{j=1}^{m} \int_{t_{j-1}}^{t_j} g(t) \, dt. In the same way, L(γ)=∑j=1m∫tj−1tj∣γ′(t)∣ dtL(\gamma) = \sum_{j=1}^m \int_{t_{j-1}}^{t_j} \abs{\gamma'(t)} \, dt.
  8. By the triangle inequality and step 5, ∣∫γf(z) dz∣≤∑j=1m∫tj−1tj∣f(γ(t))∣∣γ′(t)∣ dt\abs{\int_\gamma f(z) \, dz} \le \sum_{j=1}^m \int_{t_{j-1}}^{t_j} \abs{f(\gamma(t))} \abs{\gamma'(t)} \, dt.
  9. Since γ(t)\gamma(t) lies on the image of γ\gamma, ∣f(γ(t))∣∣γ′(t)∣≤M∣γ′(t)∣\abs{f(\gamma(t))} \abs{\gamma'(t)} \le M \abs{\gamma'(t)}. By monotonicity and linearity, the right side of step 8 is at most M∑j∫tj−1tj∣γ′(t)∣ dt=ML(γ)M \sum_{j} \int_{t_{j-1}}^{t_j} \abs{\gamma'(t)} \, dt = M L(\gamma).

Idea

Rotating by the unit number λ\lambda turns the integral into a nonnegative real number, which is the integral of a real part. A real part is never larger than the modulus, so the integral of ∣g∣\abs{g} wins. Then bound ∣f∣\abs{f} by MM.

Reading path

To understand this page from the ground up, read these 153 pages in order. The foundations come first. The path takes the proofs Proof that Darboux and Riemann integrals agree, Proof of the limit of a sum of sequences, Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the commutativity of addition by induction, Proof of the epsilon-delta form of continuity, Proof of the triangle inequality for norms, Proof that there is a natural number n with 1/n below any positive epsilon, Proof that continuous functions on a closed bounded interval are uniformly continuous, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the double negation law by a truth table, Proof of the extreme value theorem by the Bolzano–Weierstrass theorem, Proof of the uniqueness of limits, Proof of strong induction from ordinary induction, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, Proof of the existence of square roots of nonnegative reals, Proof of Riemann's criterion for integrability, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof that limits preserve non-strict inequalities, Proof of the linearity of the integral, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof of the Archimedean property in an Archimedean ordered field, Proof of the additivity of the integral over intervals, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof that continuity is equivalent to sequential continuity, Proof of the monotonicity of the integral, Proof of the boundedness theorem by Bolzano–Weierstrass, Proof that continuous functions are Riemann integrable.

  1. Complex numbers object
  2. Construction of the reals from Cauchy sequences concept
  3. Definition by recursion concept
  4. Element definition
  5. Integers object
  6. Limit point of a set definition
  7. Mathematical induction concept
  8. Natural numbers object
  9. Norm concept
  10. Ordered field definition
  11. Partition of an interval definition
  12. Peano axioms concept
  13. Proposition concept
  14. Rational numbers object
  15. Real numbers object
  16. Sequence definition
  17. Set bounded above definition
  18. Vector space definition
  19. Contour integral definition
  20. Real and imaginary parts definition
  21. Set definition
  22. Ring of integers statement
  23. Limit of a function definition
  24. Archimedean ordered field definition
  25. Successor function definition
  26. Mesh of a partition definition
  27. Refinement of a partition definition
  28. Riemann sum definition
  29. Conjunction definition
  30. Disjunction definition
  31. Implication definition
  32. Negation definition
  33. Predicate definition
  34. The reals form a field statement
  35. Real sequence definition
  36. Subsequence definition
  37. Infimum definition
  38. Supremum definition
  39. Norm definition
  40. Ordered pair definition
  41. Continuity at a point definition
  42. Addition of natural numbers definition
  43. Proof of the Archimedean property in an Archimedean ordered field proof
  44. Riemann integrable function definition
  45. The rationals form a field statement
  46. The successor function is injective statement
  47. Zero is not a successor statement
  48. Biconditional definition
  49. Truth table concept
  50. Modus ponens concept
  51. Universal quantifier definition
  52. Bounded sequence definition
  53. Limit of a sequence definition
  54. Monotone sequence definition
  55. Completeness axiom statement
  56. Cartesian product definition
  57. Continuous function definition
  58. Archimedean property statement
  59. Riemann integral definition
  60. Order on the natural numbers definition
  61. Proof of the commutativity of addition by induction proof
  62. Subset definition
  63. The rationals form an ordered field statement
  64. Mathematical proof concept
  65. Propositional logic concept
  66. Upper and lower Darboux sums definition
  67. Convergent sequence definition
  68. Sequential continuity definition
  69. Binary relation definition
  70. Definite integral definition
  71. Order on the reals definition
  72. Commutativity of addition statement
  73. Proof of strong induction from ordinary induction proof
  74. Tautology definition
  75. Upper and lower Darboux integrals definition
  76. Antisymmetric relation definition
  77. Reflexive relation definition
  78. Transitive relation definition
  79. Interval definition
  80. Strong induction statement
  81. Logical equivalence definition
  82. Preorder definition
  83. Proof of the epsilon-delta form of continuity proof
  84. Proof of the well-ordering principle from strong induction proof
  85. Proof of the double negation law by a truth table proof
  86. Partial order definition
  87. Epsilon-delta definition of continuity statement
  88. Well-ordering principle statement
  89. Double negation law statement
  90. Total order definition
  91. Uniform continuity definition
  92. Proof by contradiction concept
  93. Proof that every sequence has a monotone subsequence, by peaks proof
  94. Uniform continuity on a set definition
  95. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  96. Every sequence has a monotone subsequence statement
  97. The reals form an ordered field statement
  98. Absolute value definition
  99. Proof of the approximation property of the supremum proof
  100. Proof of the existence of square roots of nonnegative reals proof
  101. Proof of the triangle inequality for real numbers proof
  102. Proof that the absolute value is multiplicative proof
  103. Proof of the epsilon-N definition of the limit of a sequence proof
  104. Existence of square roots of nonnegative reals statement
  105. Approximation property of the supremum statement
  106. Triangle inequality statement
  107. Absolute value is multiplicative statement
  108. Square root definition
  109. Epsilon-N definition of the limit of a sequence statement
  110. Proof that the reals are Archimedean from the completeness axiom proof
  111. Modulus of a complex number definition
  112. Proof of the limit of a sum of sequences proof
  113. Proof of the squeeze theorem for sequences proof
  114. Proof of the uniqueness of limits proof
  115. Proof that limits preserve non-strict inequalities proof
  116. Proof of the linearity of the integral proof
  117. The reals are Archimedean statement
  118. Proof that convergent sequences are bounded proof
  119. Proof of the monotone convergence theorem for sequences proof
  120. Proof of the triangle inequality for norms proof
  121. Linearity of the integral statement
  122. Proof that there is a natural number n with 1/n below any positive epsilon proof
  123. Limit of a sum of sequences statement
  124. Proof of the monotonicity of the integral proof
  125. Uniqueness of limits statement
  126. Limits preserve non-strict inequalities statement
  127. Squeeze theorem statement
  128. Convergent sequences are bounded statement
  129. Proof that Darboux and Riemann integrals agree proof
  130. Monotone convergence theorem for sequences statement
  131. There is a natural number n with 1/n below any positive epsilon statement
  132. Monotonicity of the integral statement
  133. Darboux and Riemann integrals agree statement
  134. Triangle inequality for norms statement
  135. Proof that a decreasing sequence bounded below converges proof
  136. Proof that continuity is equivalent to sequential continuity proof
  137. Decreasing sequence bounded below converges statement
  138. Proof of Riemann's criterion for integrability proof
  139. Continuity is equivalent to sequential continuity statement
  140. Riemann's criterion for integrability statement
  141. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  142. Proof of the additivity of the integral over intervals proof
  143. Bolzano–Weierstrass theorem statement
  144. Additivity of the integral over intervals statement
  145. Proof that continuous functions on a closed bounded interval are uniformly continuous proof
  146. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  147. Continuous functions on a closed bounded interval are uniformly continuous statement
  148. Boundedness theorem statement
  149. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  150. Extreme value theorem statement
  151. Proof that continuous functions are Riemann integrable proof
  152. Continuous functions are Riemann integrable statement
  153. Proof of the estimation lemma proof

Where this leads

230 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Estimation_lemma
About this page
TagM0W7ENSAZA
URIm2://M0W7ENSAZA
Kindproof
WritingW0 stub
MSC30A10
ProvesEstimation lemma
UsesContour integral, Additivity of the integral over intervals, Linearity of the integral, Monotonicity of the integral, Continuous functions are Riemann integrable, Triangle inequality for norms
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.