a formal proof of cauchy s residue theorem
play

A Formal Proof of Cauchys Residue Theorem Wenda Li and Lawrence C. - PowerPoint PPT Presentation

A Formal Proof of Cauchys Residue Theorem Wenda Li and Lawrence C. Paulson University of Cambridge { wl302,lp15 } @cam.ac.uk August 21, 2016 1 / 20 a 1 a 2 a n s Informally, suppose f is holomorphic (i.e. complex differentiable) on an


  1. A Formal Proof of Cauchy’s Residue Theorem Wenda Li and Lawrence C. Paulson University of Cambridge { wl302,lp15 } @cam.ac.uk August 21, 2016 1 / 20

  2. γ a 1 a 2 a n s Informally, suppose f is holomorphic (i.e. complex differentiable) on an open set s except for a finite number of points { a 1 , a 2 , ..., a n } and γ is some closed path, Cauchy’s residue theorem states n � � f = 2 π i n ( γ, a k ) Res ( f , a k ) γ k =1 where ◮ n ( γ, a k ) is the winding number of γ about a k ◮ Res ( f , a k ) is the residue of f at a k 2 / 20

  3. Overview 1. Background: the multivariate analysis library in Isabelle/HOL 2. Main proof of the residue theorem 3. Application to improper integrals 4. Corollaries: the argument principle and Rouch´ e’s theorem 5. Related work 6. Conclusion 3 / 20

  4. Background: the multivariate analysis library The multivariate analysis library in Isabelle/HOL ◮ about 70000 LOC (for now) on topology, analysis and linear algebra ◮ originates from John Harrison’s work in HOL Light ◮ R n vs. type classes ◮ scripted proofs vs. structured proofs 4 / 20

  5. Background: contour integration Contour integration is mathematically defined as � 1 � f ( γ ( t )) γ ′ ( t ) dt . f = 0 γ In Isabelle/HOL, we have definition has contour integral :: "(complex ⇒ complex) ⇒ complex ⇒ (real ⇒ complex) ⇒ bool" where "(f has contour integral i) γ ≡ (( λ x. f( γ x) * vector derivative γ (at x within {0..1})) has integral i) {0..1}" and also contour integral of type (complex ⇒ complex) ⇒ (real ⇒ complex) ⇒ complex 5 / 20

  6. Background: valid paths A valid path is a piecewise continuously differentiable function on [0 .. 1]. lemma valid_path_def: fixes γ ::"real ⇒ ’a::real_normed_vector" shows "valid_path γ ← → continuous_on {0..1} γ ∧ ( ∃ s. finite s ∧ γ C1_differentiable_on ({0..1} - s))" 6 / 20

  7. Background: winding numbers The winding number n ( γ, z ) is the number of times the path γ travels counterclockwise around the point z : 1 � dw n ( γ, z ) = 2 π i w − z γ A lemma to illustrate this definition is as follows: lemma winding number valid path: fixes γ ::"real ⇒ complex" and z::complex assumes "valid path γ " and "z / ∈ path image γ " shows "winding number γ z = 1/(2*pi* i ) * contour integral γ ( λ w. 1/(w - z))" 7 / 20

  8. Background: Cauchy’s integral theorem Cauchy’s integral theorem states: given f is a holomorphic function on an open set s , which contains a closed path γ and its interior, then � f = 0 γ theorem Cauchy_theorem_global: fixes s::"complex set" and f::"complex ⇒ complex" and γ ::"real ⇒ complex" assumes "open s" and "f holomorphic_on s" and "valid_path γ " and "pathfinish γ = pathstart γ " and "path_image γ ⊆ s" and " � w. w / ∈ s = ⇒ winding_number γ w = 0" shows "(f has_contour_integral 0) γ " 8 / 20

  9. Main proof: singularities Cauchy’s integral theorem does not apply when there are singularities. For example, consider f ( w ) = 1 w so that f has a pole at w = 0, and γ is the circular path γ ( t ) = e 2 π it : � d � 1 � 1 � 1 � dw dt e 2 π it w = dt = 2 π idt = 2 π i � = 0 e 2 π it 0 0 γ 9 / 20

  10. Main proof: residue The residue of f at z can be defined as 1 � Res ( f , z ) = f 2 π i circ ( z ) where circ ( z ) is a small counterclockwise circular path around z . z definition residue ::"(complex ⇒ complex) ⇒ complex ⇒ complex" where "residue f z = (SOME int. ∃ δ >0. ∀ ε >0. ε < δ − → (f has_contour_integral 2*pi* i *int) (circlepath z ε ))" 10 / 20

  11. Main proof: Cauchy’s residue theorem lemma Residue_theorem: fixes s pts::"complex set" and f::"complex ⇒ complex" and γ ::"real ⇒ complex" assumes "open s" and "connected s" and "finite pts" and "f holomorphic_on s-pts" and "valid_path γ " and "pathfinish γ = pathstart γ " and "path_image γ ⊆ s-pts" and " ∀ z. (z / ∈ s) − → winding_number γ z = 0" shows "contour_integral γ f = 2*pi* i *( � p ∈ pts. winding_number γ p * residue f p)" 11 / 20

  12. Main proof: remarks ◮ the core idea to induct on s the number of singularity points ◮ gap in informal proofs γ 12 / 20

  13. Application to improper integrals The residue theorem can be C R used to solve improper integrals: � ∞ i dx x 2 + 1 = π −∞ γ R − R R − i Proof: let 1 f ( z ) = z 2 + 1 . � since lim R →∞ C R f = 0 we have � ∞ dx � x 2 + 1 = lim f R →∞ −∞ γ R + C R 13 / 20

  14. � ∞ dx def f ≡ " λ x::real. 1/(x^2+1)" x 2 + 1 = π def f’ ≡ " λ x::complex. 1/(x^2+1)" −∞ � have "(( λ R. integral {- R..R} f) − → pi) at_top ⇔ lim f = π = (( λ R. contour_integral ( γ R R) f’) → pi) at_top" R →∞ − γ R � � also have "... = (( λ R. contour_integral (C R R) f’ ⇔ lim R →∞ ( f + f ) = π + contour_integral ( γ R R) f’) − → pi) at_top" C R γ R also have "... = (( λ R. contour_integral � (C R R +++ γ R R) f’) − → pi) at_top" ⇔ lim f R →∞ γ R + C R also have "..." = 2 π i Res ( γ R + C R , i ) = π proof - have "contour_integral (C R R +++ γ R R) f’ = pi" when "R>1" for R then show ?thesis qed finally have "(( λ R. integral {- R..R} ( λ x. 1 / (x 2 + 1))) − → pi) at_top" 14 / 20

  15. Application to improper integrals (3) C R i γ R − R R − i lemma improper_Ex: "Lim at_top ( λ R. integral {- R..R} ( λ x. 1/(x 2 +1))) = pi" Remarks ◮ about 300 LOC ◮ the main difficulty is to show n ( γ R + C R , i ) = 1 and n ( γ R + C R , − i ) = 0 15 / 20

  16. Corollaries: the argument principle The argument principle states: suppose f is holomorphic on a connected open set s except for a finite number of poles and γ is a valid closed path, then   f ′ �  � � f = 2 π i n ( γ, z ) zorder ( f , z ) − n ( γ, z ) porder ( f , z )  γ z ∈ zeros z ∈ poles where ◮ f ′ is the first derivative of f ; ◮ zorder ( f , z ) and porder ( f , z ) are the order of a zero and a pole respectively; ◮ zeros and poles are the zeros and poles respectively of f . 16 / 20

  17. Corollaries: Rouch´ e’s theorem Given two functions f and g holomorphic on a connected open set containing a valid path γ , if | f ( w ) | > | g ( w ) | ∀ w ∈ image of γ then Rouch´ e’s Theorem states � � n ( γ, z ) zorder ( f , z ) = n ( γ, z ) zorder ( f + g , z ) z ∈ zeros ( f ) zeros ( f + g ) 17 / 20

  18. Big picture Cauchy’s residue theorem Rouch´ e’s theorem Roots of a polynomial depend continuously on its coefficients in progress Decision procedure to solve first-order real formulas 18 / 20

  19. Related work To the best of our knowledge, our formalization of Cauchy’s residue theorem is novel among major proof assistants. ◮ HOL Light: comprehensive library for complex analysis, to which it should be not hard to port our result; ◮ Coq: Coquelicot and C-Corn, but they are mainly about real analysis and some fundamental theorems (e.g. Cauchy’s integral theorem) are not yet available. 19 / 20

  20. Conclusion To conclude, I have mainly covered ◮ the multivariate analysis library in Isabelle/HOL ◮ the residue theorem ◮ application to improper integrals ◮ corollaries: the argument principle and Rouch´ e’s theorem Thank you for your attention! 20 / 20

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend