Lectures on Complex Analysis M. Pollicott
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Arxiv:1911.03589V1 [Math.CV] 9 Nov 2019 1 Hoe 1 Result
A NOTE ON THE SCHWARZ LEMMA FOR HARMONIC FUNCTIONS MAREK SVETLIK Abstract. In this note we consider some generalizations of the Schwarz lemma for harmonic functions on the unit disk, whereby values of such functions and the norms of their differentials at the point z = 0 are given. 1. Introduction 1.1. A summary of some results. In this paper we consider some generalizations of the Schwarz lemma for harmonic functions from the unit disk U = {z ∈ C : |z| < 1} to the interval (−1, 1) (or to itself). First, we cite a theorem which is known as the Schwarz lemma for harmonic functions and is considered as a classical result. Theorem 1 ([10],[9, p.77]). Let f : U → U be a harmonic function such that f(0) = 0. Then 4 |f(z)| 6 arctan |z|, for all z ∈ U, π and this inequality is sharp for each point z ∈ U. In 1977, H. W. Hethcote [11] improved this result by removing the assumption f(0) = 0 and proved the following theorem. Theorem 2 ([11, Theorem 1] and [26, Theorem 3.6.1]). Let f : U → U be a harmonic function. Then 1 − |z|2 4 f(z) − f(0) 6 arctan |z|, for all z ∈ U. 1+ |z|2 π As it was written in [23], it seems that researchers have had some difficulties to arXiv:1911.03589v1 [math.CV] 9 Nov 2019 handle the case f(0) 6= 0, where f is harmonic mapping from U to itself. Before explaining the essence of these difficulties, it is necessary to recall one mapping and some of its properties. -
Why Wirtinger Derivatives Behave So Well
Why Wirtinger derivatives behave so well Bart Michels∗ April 14, 2019 Contents 1 Introduction 2 2 Partial derivatives revisited 2 3 Complexification 3 3.1 Complexified differentials: two variables . .4 3.2 Complexified differentials: multiple variables . .4 3.3 Conjugation . .5 4 Chain rule 7 5 Holomorphic functions 10 6 Power series 11 7 Concluding remarks 12 ∗Universit´eParis 13, LAGA, CNRS, UMR 7539, F-93430, Villetaneuse, France. Email: [email protected] 1 1 Introduction Given a smooth function f : C ! C, it makes a priori no sense to talk about @f @f the Wirtinger derivatives and . We could define them by @z @z¯ @f 1 @f @f = − i @z 2 @x @y (1) @f 1 @f @f = + i @z¯ 2 @x @y but that does not explain why we denote them like partial derivatives, where the confusing sign convention comes from, why they behave like partial derivatives, and why they act on power series in z and z in the way they should. Here follows a construction of Wirtinger derivatives that avoids the explicit formula (1). The reader may be interested in the definitions in section 3, in the sanity check in Proposition 3.2, the chain rule from Proposition 4.3 and the results from section 6. 2 Partial derivatives revisited It is worthwhile to take a second look at what a partial derivative is. Con- sider finite-dimensional real vector spaces V and W .1 They carry a canonical smooth structure. Consider a differentiable function f : V ! W . At every point p 2 V , f has a differential Dpf : V ! W , an R-linear map. -
Augustin-Louis Cauchy - Wikipedia, the Free Encyclopedia 1/6/14 3:35 PM Augustin-Louis Cauchy from Wikipedia, the Free Encyclopedia
Augustin-Louis Cauchy - Wikipedia, the free encyclopedia 1/6/14 3:35 PM Augustin-Louis Cauchy From Wikipedia, the free encyclopedia Baron Augustin-Louis Cauchy (French: [oɡystɛ̃ Augustin-Louis Cauchy lwi koʃi]; 21 August 1789 – 23 May 1857) was a French mathematician who was an early pioneer of analysis. He started the project of formulating and proving the theorems of infinitesimal calculus in a rigorous manner, rejecting the heuristic Cauchy around 1840. Lithography by Zéphirin principle of the Belliard after a painting by Jean Roller. generality of algebra exploited by earlier Born 21 August 1789 authors. He defined Paris, France continuity in terms of Died 23 May 1857 (aged 67) infinitesimals and gave Sceaux, France several important Nationality French theorems in complex Fields Mathematics analysis and initiated the Institutions École Centrale du Panthéon study of permutation École Nationale des Ponts et groups in abstract Chaussées algebra. A profound École polytechnique mathematician, Cauchy Alma mater École Nationale des Ponts et exercised a great Chaussées http://en.wikipedia.org/wiki/Augustin-Louis_Cauchy Page 1 of 24 Augustin-Louis Cauchy - Wikipedia, the free encyclopedia 1/6/14 3:35 PM influence over his Doctoral Francesco Faà di Bruno contemporaries and students Viktor Bunyakovsky successors. His writings Known for See list cover the entire range of mathematics and mathematical physics. "More concepts and theorems have been named for Cauchy than for any other mathematician (in elasticity alone there are sixteen concepts and theorems named for Cauchy)."[1] Cauchy was a prolific writer; he wrote approximately eight hundred research articles and five complete textbooks. He was a devout Roman Catholic, strict Bourbon royalist, and a close associate of the Jesuit order. -
Argument Principle
Topic 11 Notes Jeremy Orloff 11 Argument Principle 11.1 Introduction The argument principle (or principle of the argument) is a consequence of the residue theorem. It connects the winding number of a curve with the number of zeros and poles inside the curve. This is useful for applications (mathematical and otherwise) where we want to know the location of zeros and poles. 11.2 Principle of the argument Setup. � a simple closed curve, oriented in a counterclockwise direction. f .z/ analytic on and inside �, except for (possibly) some finite poles inside (not on) � and some zeros inside (not on) �. p ; ; p f � Let 1 § m be the poles of inside . z ; ; z f � Let 1 § n be the zeros of inside . Write mult.zk/ = the multiplicity of the zero at zk. Likewise write mult.pk/ = the order of the pole at pk. We start with a theorem that will lead to the argument principle. Theorem 11.1. With the above setup f ¨ z (∑ ∑ ) . / dz �i z p : Ê f z = 2 mult. k/* mult. k/ � . / Proof. To prove this theorem we need to understand the poles and residues of f ¨.z/_f .z/. With this f z m z f z z in mind, suppose . / has a zero of order at 0. The Taylor series for . / near 0 is f z z z mg z . / = . * 0/ . / g z z where . / is analytic and never 0 on a small neighborhood of 0. This implies ¨ m z z m*1g z z z mg¨ z f .z/ . * 0/ . / + . * 0/ . / f z = z z mg z . -
Algebraicity Criteria and Their Applications
Algebraicity Criteria and Their Applications The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Tang, Yunqing. 2016. Algebraicity Criteria and Their Applications. Doctoral dissertation, Harvard University, Graduate School of Arts & Sciences. Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:33493480 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA Algebraicity criteria and their applications A dissertation presented by Yunqing Tang to The Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Mathematics Harvard University Cambridge, Massachusetts May 2016 c 2016 – Yunqing Tang All rights reserved. DissertationAdvisor:ProfessorMarkKisin YunqingTang Algebraicity criteria and their applications Abstract We use generalizations of the Borel–Dwork criterion to prove variants of the Grothedieck–Katz p-curvature conjecture and the conjecture of Ogus for some classes of abelian varieties over number fields. The Grothendieck–Katz p-curvature conjecture predicts that an arithmetic differential equation whose reduction modulo p has vanishing p-curvatures for all but finitely many primes p,hasfinite monodromy. It is known that it suffices to prove the conjecture for differential equations on P1 − 0, 1, . We prove a variant of this conjecture for P1 0, 1, , which asserts that if the equation { ∞} −{ ∞} satisfies a certain convergence condition for all p, then its monodromy is trivial. -
Wirtinger Kalman Overdrive
Wirtinger Kalman Overdrive O. Smirnov (Rhodes & SKA SA) C. Tasse (Obs. Paris Meudon & Rhodes) The 3GC Culture Wars Two approaches to dealing with DD effects The “NRAO School”: Represent everything by the A-term Correct during imaging (convolutional gridding) Solve for pointing offsets Sky models are images The “ASTRON School”: Solve for DD gains towards (clusters of) sources Make component sky models, subtract sources in uv-plane while accounting for DD gains O. Smirnov & C. Tasse - Wirtinger Kalman Overdrive - SPARCS 2015 2 Why DD Gains Cons: non-physical, slow & expensive But, DD+MeqTrees have consistently delivered the goods with all major pathfinders Early LOFAR maps and LOFAR EoR (S. Yatawatta) Beautiful ASKAP/BETA maps (I. Heywood) JVLA 5M+ DR (M. Mitra earlier) Fair bet that we'll still be using them come MeerKAT and SKA O. Smirnov & C. Tasse - Wirtinger Kalman Overdrive - SPARCS 2015 3 DD Gains Are Like Whiskey The smoother the better Make everything look more attractive If you overindulge, you wake in in the morning wondering where your {polarized foregrounds, weak sources, science signal} have gotten to differential source gain & bandpass gain beam coherency (s) (s) (s)H (s)H H Vpq= G⏞p ∑ ⏞Δ Ep E⏞p ⏞Xpq Eq Δ Eq Gq ⏟( s ) sum over sources O. Smirnov & C. Tasse - Wirtinger Kalman Overdrive - SPARCS 2015 4 The One True Way O. Smirnov & C. Tasse - Wirtinger Kalman Overdrive - SPARCS 2015 5 The Middle Way DR limited by how well we can subtract the brighter source population thus bigger problem for small dish/WF Subtract the first two-three orders of magnitude in the uv-plane good source modelling and (deconvolution and/or Bayesian) PB models, pointing solutions, +solvable DD gains Image and deconvolve the rest really well A-term and/or faceting O. -
A Formal Proof of Cauchy's Residue Theorem
A Formal Proof of Cauchy's Residue Theorem Wenda Li and Lawrence C. Paulson Computer Laboratory, University of Cambridge fwl302,[email protected] Abstract. We present a formalization of Cauchy's residue theorem and two of its corollaries: the argument principle and Rouch´e'stheorem. These results have applications to verify algorithms in computer alge- bra and demonstrate Isabelle/HOL's complex analysis library. 1 Introduction Cauchy's residue theorem | along with its immediate consequences, the ar- gument principle and Rouch´e'stheorem | are important results for reasoning about isolated singularities and zeros of holomorphic functions in complex anal- ysis. They are described in almost every textbook in complex analysis [3, 15, 16]. Our main motivation of this formalization is to certify the standard quantifier elimination procedure for real arithmetic: cylindrical algebraic decomposition [4]. Rouch´e'stheorem can be used to verify a key step of this procedure: Collins' projection operation [8]. Moreover, Cauchy's residue theorem can be used to evaluate improper integrals like Z 1 itz e −|tj 2 dz = πe −∞ z + 1 Our main contribution1 is two-fold: { Our machine-assisted formalization of Cauchy's residue theorem and two of its corollaries is new, as far as we know. { This paper also illustrates the second author's achievement of porting major analytic results, such as Cauchy's integral theorem and Cauchy's integral formula, from HOL Light [12]. The paper begins with some background on complex analysis (Sect. 2), fol- lowed by a proof of the residue theorem, then the argument principle and Rouch´e'stheorem (3{5). -
Applications of the Cauchy Theory
Chapter 4 Applications Of The Cauchy Theory This chapter contains several applications of the material developed in Chapter 3. In the first section, we will describe the possible behavior of an analytic function near a singularity of that function. 4.1 Singularities We will say that f has an isolated singularity at z0 if f is analytic on D(z0,r) \{z0} for some r. What, if anything, can be said about the behavior of f near z0? The basic tool needed to answer this question is the Laurent series, an expansion of f(z)in powers of z − z0 in which negative as well as positive powers of z − z0 may appear. In fact, the number of negative powers in this expansion is the key to determining how f behaves near z0. From now on, the punctured disk D(z0,r) \{z0} will be denoted by D (z0,r). We will need a consequence of Cauchy’s integral formula. 4.1.1 Theorem Let f be analytic on an open set Ω containing the annulus {z : r1 ≤|z − z0|≤r2}, 0 <r1 <r2 < ∞, and let γ1 and γ2 denote the positively oriented inner and outer boundaries of the annulus. Then for r1 < |z − z0| <r2, we have 1 f(w) − 1 f(w) f(z)= − dw − dw. 2πi γ2 w z 2πi γ1 w z Proof. Apply Cauchy’s integral formula [part (ii)of (3.3.1)]to the cycle γ2 − γ1. ♣ 1 2 CHAPTER 4. APPLICATIONS OF THE CAUCHY THEORY 4.1.2 Definition For 0 ≤ s1 <s2 ≤ +∞ and z0 ∈ C, we will denote the open annulus {z : s1 < |z−z0| <s2} by A(z0,s1,s2). -
Blind Demixing Via Wirtinger Flow with Random Initialization
Blind Demixing via Wirtinger Flow with Random Initialization Jialin Dong Yuanming Shi [email protected] [email protected] ShanghaiTech University ShanghaiTech University Abstract i = 1; ··· ; s, i.e., s This paper concerns the problem of demixing X \ \ a series of source signals from the sum of bi- yj = bj∗hixi∗aij; 1 ≤ j ≤ m; (1) linear measurements. This problem spans di- i=1 verse areas such as communication, imaging N K processing, machine learning, etc. However, where faijg 2 C , fbjg 2 C are design vectors. semidefinite programming for blind demixing Here, the first K columns of the matrix F form the ma- m K m m is prohibitive to large-scale problems due to trix B := [b1; ··· ; bm]∗ 2 C × , where F 2 C × high computational complexity and storage is the unitary discrete Fourier transform (DFT) ma- cost. Although several efficient algorithms \ trix with FF ∗ = Im. Our goal is to recover fxig and have been developed recently that enjoy the \ fhig from the sum of bilinear measurements, which is benefits of fast convergence rates and even known as blind demixing [1, 2]. regularization free, they still call for spec- tral initialization. To find simple initial- This problem has spanned a wide scope of applications ization approach that works equally well as ranging from imaging processing [3, 4] and machine spectral initialization, we propose to solve learning [5, 6] to communication [7, 8]. Specifically, blind demixing problem via Wirtinger flow by solving the blind demixing problem, both original with random initialization, which yields a images and corresponding convolutional kernels can be natural implementation. -
Lectures on Non-Archimedean Function Theory Advanced
Lectures on Non-Archimedean Function Theory Advanced School on p-Adic Analysis and Applications The Abdus Salam International Centre for Theoretical Physics Trieste, Italy William Cherry Department of Mathematics University of North Texas August 31 – September 4, 2009 Lecture 1: Analogs of Basic Complex Function Theory Lecture 2: Valuation Polygons and a Poisson-Jensen Formula Lecture 3: Non-Archimedean Value Distribution Theory Lecture 4: Benedetto’s Non-Archimedean Island Theorems arXiv:0909.4509v1 [math.CV] 24 Sep 2009 Non-Archimedean Function Theory: Analogs of Basic Complex Function Theory 3 This lecture series is an introduction to non-Archimedean function theory. The audience is assumed to be familiar with non-Archimedean fields and non-Archimedean absolute values, as well as to have had a standard introductory course in complex function theory. A standard reference for the later could be, for example, [Ah 2]. No prior exposure to non-Archimedean function theory is supposed. Full details on the basics of non-Archimedean absolute values and the construction of p-adic number fields, the most important of the non-Archimedean fields, can be found in [Rob]. 1 Analogs of Basic Complex Function Theory 1.1 Non-Archimedean Fields Let A be a commutative ring. A non-Archimedean absolute value | | on A is a function from A to the non-negative real numbers R≥0 satisfying the following three properties: AV 1. |a| = 0 if and only if a = 0; AV 2. |ab| = |a| · |b| for all a, b ∈ A; and AV 3. |a + b|≤ max{|a|, |b|} for all a, b ∈ A. Exercise 1.1.1. -
Riemann's Mapping Theorem
4. Del Riemann’s mapping theorem version 0:21 | Tuesday, October 25, 2016 6:47:46 PM very preliminary version| more under way. One dares say that the Riemann mapping theorem is one of more famous theorem in the whole science of mathematics. Together with its generalization to Riemann surfaces, the so called Uniformisation Theorem, it is with out doubt the corner-stone of function theory. The theorem classifies all simply connected Riemann-surfaces uo to biholomopisms; and list is astonishingly short. There are just three: The unit disk D, the complex plane C and the Riemann sphere C^! Riemann announced the mapping theorem in his inaugural dissertation1 which he defended in G¨ottingenin . His version a was weaker than full version of today, in that he seems only to treat domains bounded by piecewise differentiable Jordan curves. His proof was not waterproof either, lacking arguments for why the Dirichlet problem has solutions. The fault was later repaired by several people, so his method is sound (of course!). In the modern version there is no further restrictions on the domain than being simply connected. William Fogg Osgood was the first to give a complete proof of the theorem in that form (in ), but improvements of the proof continued to come during the first quarter of the th century. We present Carath´eodory's version of the proof by Lip´otFej´erand Frigyes Riesz, like Reinholdt Remmert does in his book [?], and we shall closely follow the presentation there. This chapter starts with the legendary lemma of Schwarz' and a study of the biho- lomorphic automorphisms of the unit disk. -
Schwarz-Christoffel Transformations by Philip P. Bergonio (Under the Direction of Edward Azoff) Abstract the Riemann Mapping
Schwarz-Christoffel Transformations by Philip P. Bergonio (Under the direction of Edward Azoff) Abstract The Riemann Mapping Theorem guarantees that the upper half plane is conformally equivalent to the interior domain determined by any polygon. Schwarz-Christoffel transfor- mations provide explicit formulas for the maps that work. Popular textbook treatments of the topic range from motivational and contructive to proof-oriented. The aim of this paper is to combine the strengths of these expositions, filling in details and adding more information when necessary. In particular, careful attention is paid to the crucial fact, taken for granted in most elementary texts, that all conformal equivalences between the domains in question extend continuously to their closures. Index words: Complex Analysis, Schwarz-Christoffel Transformations, Polygons in the Complex Plane Schwarz-Christoffel Transformations by Philip P. Bergonio B.S., Georgia Southwestern State University, 2003 A Thesis Submitted to the Graduate Faculty of The University of Georgia in Partial Fulfillment of the Requirements for the Degree Master of Arts Athens, Georgia 2007 c 2007 Philip P. Bergonio All Rights Reserved Schwarz-Christoffel Transformations by Philip P. Bergonio Approved: Major Professor: Edward Azoff Committee: Daniel Nakano Shuzhou Wang Electronic Version Approved: Maureen Grasso Dean of the Graduate School The University of Georgia December 2007 Table of Contents Page Chapter 1 Introduction . 1 2 Background Information . 5 2.1 Preliminaries . 5 2.2 Linear Curves and Polygons . 8 3 Two Examples and Motivation for the Formula . 13 3.1 Prototypical Examples . 13 3.2 Motivation for the Formula . 16 4 Properties of Schwarz-Christoffel Candidates . 19 4.1 Well-Definedness of f .....................