Riemann's Mapping Theorem
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Mathematics 412 Partial Differential Equations
Mathematics 412 Partial Differential Equations c S. A. Fulling Fall, 2005 The Wave Equation This introductory example will have three parts.* 1. I will show how a particular, simple partial differential equation (PDE) arises in a physical problem. 2. We’ll look at its solutions, which happen to be unusually easy to find in this case. 3. We’ll solve the equation again by separation of variables, the central theme of this course, and see how Fourier series arise. The wave equation in two variables (one space, one time) is ∂2u ∂2u = c2 , ∂t2 ∂x2 where c is a constant, which turns out to be the speed of the waves described by the equation. Most textbooks derive the wave equation for a vibrating string (e.g., Haber- man, Chap. 4). It arises in many other contexts — for example, light waves (the electromagnetic field). For variety, I shall look at the case of sound waves (motion in a gas). Sound waves Reference: Feynman Lectures in Physics, Vol. 1, Chap. 47. We assume that the gas moves back and forth in one dimension only (the x direction). If there is no sound, then each bit of gas is at rest at some place (x,y,z). There is a uniform equilibrium density ρ0 (mass per unit volume) and pressure P0 (force per unit area). Now suppose the gas moves; all gas in the layer at x moves the same distance, X(x), but gas in other layers move by different distances. More precisely, at each time t the layer originally at x is displaced to x + X(x,t). -
Informal Lecture Notes for Complex Analysis
Informal lecture notes for complex analysis Robert Neel I'll assume you're familiar with the review of complex numbers and their algebra as contained in Appendix G of Stewart's book, so we'll pick up where that leaves off. 1 Elementary complex functions In one-variable real calculus, we have a collection of basic functions, like poly- nomials, rational functions, the exponential and log functions, and the trig functions, which we understand well and which serve as the building blocks for more general functions. The same is true in one complex variable; in fact, the real functions we just listed can be extended to complex functions. 1.1 Polynomials and rational functions We start with polynomials and rational functions. We know how to multiply and add complex numbers, and thus we understand polynomial functions. To be specific, a degree n polynomial, for some non-negative integer n, is a function of the form n n−1 f(z) = cnz + cn−1z + ··· + c1z + c0; 3 where the ci are complex numbers with cn 6= 0. For example, f(z) = 2z + (1 − i)z + 2i is a degree three (complex) polynomial. Polynomials are clearly defined on all of C. A rational function is the quotient of two polynomials, and it is defined everywhere where the denominator is non-zero. z2+1 Example: The function f(z) = z2−1 is a rational function. The denomina- tor will be zero precisely when z2 = 1. We know that every non-zero complex number has n distinct nth roots, and thus there will be two points at which the denominator is zero. -
Geometric Algorithms
Geometric Algorithms primitive operations convex hull closest pair voronoi diagram References: Algorithms in C (2nd edition), Chapters 24-25 http://www.cs.princeton.edu/introalgsds/71primitives http://www.cs.princeton.edu/introalgsds/72hull 1 Geometric Algorithms Applications. • Data mining. • VLSI design. • Computer vision. • Mathematical models. • Astronomical simulation. • Geographic information systems. airflow around an aircraft wing • Computer graphics (movies, games, virtual reality). • Models of physical world (maps, architecture, medical imaging). Reference: http://www.ics.uci.edu/~eppstein/geom.html History. • Ancient mathematical foundations. • Most geometric algorithms less than 25 years old. 2 primitive operations convex hull closest pair voronoi diagram 3 Geometric Primitives Point: two numbers (x, y). any line not through origin Line: two numbers a and b [ax + by = 1] Line segment: two points. Polygon: sequence of points. Primitive operations. • Is a point inside a polygon? • Compare slopes of two lines. • Distance between two points. • Do two line segments intersect? Given three points p , p , p , is p -p -p a counterclockwise turn? • 1 2 3 1 2 3 Other geometric shapes. • Triangle, rectangle, circle, sphere, cone, … • 3D and higher dimensions sometimes more complicated. 4 Intuition Warning: intuition may be misleading. • Humans have spatial intuition in 2D and 3D. • Computers do not. • Neither has good intuition in higher dimensions! Is a given polygon simple? no crossings 1 6 5 8 7 2 7 8 6 4 2 1 1 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 2 18 4 18 4 19 4 19 4 20 3 20 3 20 1 10 3 7 2 8 8 3 4 6 5 15 1 11 3 14 2 16 we think of this algorithm sees this 5 Polygon Inside, Outside Jordan curve theorem. -
Bounded Holomorphic Functions on Finite Riemann Surfaces
BOUNDED HOLOMORPHIC FUNCTIONS ON FINITE RIEMANN SURFACES BY E. L. STOUT(i) 1. Introduction. This paper is devoted to the study of some problems concerning bounded holomorphic functions on finite Riemann surfaces. Our work has its origin in a pair of theorems due to Lennart Carleson. The first of the theorems of Carleson we shall be concerned with is the following [7] : Theorem 1.1. Let fy,---,f„ be bounded holomorphic functions on U, the open unit disc, such that \fy(z) + — + \f„(z) | su <5> 0 holds for some ô and all z in U. Then there exist bounded holomorphic function gy,---,g„ on U such that ftEi + - +/A-1. In §2, we use this theorem to establish an analogous result in the setting of finite open Riemann surfaces. §§3 and 4 consider certain questions which arise naturally in the course of the proof of this generalization. We mention that the chief result of §2, Theorem 2.6, has been obtained independently by N. L. Ailing [3] who has used methods more highly algebraic than ours. The second matter we shall be concerned with is that of interpolation. If R is a Riemann surface and if £ is a subset of R, call £ an interpolation set for R if for every bounded complex-valued function a on £, there is a bounded holo- morphic function f on R such that /1 £ = a. Carleson [6] has characterized interpolation sets in the unit disc: Theorem 1.2. The set {zt}™=1of points in U is an interpolation set for U if and only if there exists ô > 0 such that for all n ** n00 k = l;ktn 1 — Z.Zl An alternative proof is to be found in [12, p. -
Complex-Differentiability
Complex-Differentiability Sébastien Boisgérault, Mines ParisTech, under CC BY-NC-SA 4.0 April 25, 2017 Contents Core Definitions 1 Derivative and Complex-Differential 3 Calculus 5 Cauchy-Riemann Equations 7 Appendix – Terminology and Notation 10 References 11 Core Definitions Definition – Complex-Differentiability & Derivative. Let f : A ⊂ C → C. The function f is complex-differentiable at an interior point z of A if the derivative of f at z, defined as the limit of the difference quotient f(z + h) − f(z) f 0(z) = lim h→0 h exists in C. Remark – Why Interior Points? The point z is an interior point of A if ∃ r > 0, ∀ h ∈ C, |h| < r → z + h ∈ A. In the definition above, this assumption ensures that f(z + h) – and therefore the difference quotient – are well defined when |h| is (nonzero and) small enough. Therefore, the derivative of f at z is defined as the limit in “all directions at once” of the difference quotient of f at z. To question the existence of the derivative of f : A ⊂ C → C at every point of its domain, we therefore require that every point of A is an interior point, or in other words, that A is open. 1 Definition – Holomorphic Function. Let Ω be an open subset of C. A function f :Ω → C is complex-differentiable – or holomorphic – in Ω if it is complex-differentiable at every point z ∈ Ω. If additionally Ω = C, the function is entire. Examples – Elementary Functions. 1. Every constant function f : z ∈ C 7→ λ ∈ C is holomorphic as 0 λ − λ ∀ z ∈ C, f (z) = lim = 0. -
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. -
The Riemann Mapping Theorem Christopher J. Bishop
The Riemann Mapping Theorem Christopher J. Bishop C.J. Bishop, Mathematics Department, SUNY at Stony Brook, Stony Brook, NY 11794-3651 E-mail address: [email protected] 1991 Mathematics Subject Classification. Primary: 30C35, Secondary: 30C85, 30C62 Key words and phrases. numerical conformal mappings, Schwarz-Christoffel formula, hyperbolic 3-manifolds, Sullivan’s theorem, convex hulls, quasiconformal mappings, quasisymmetric mappings, medial axis, CRDT algorithm The author is partially supported by NSF Grant DMS 04-05578. Abstract. These are informal notes based on lectures I am giving in MAT 626 (Topics in Complex Analysis: the Riemann mapping theorem) during Fall 2008 at Stony Brook. We will start with brief introduction to conformal mapping focusing on the Schwarz-Christoffel formula and how to compute the unknown parameters. In later chapters we will fill in some of the details of results and proofs in geometric function theory and survey various numerical methods for computing conformal maps, including a method of my own using ideas from hyperbolic and computational geometry. Contents Chapter 1. Introduction to conformal mapping 1 1. Conformal and holomorphic maps 1 2. M¨obius transformations 16 3. The Schwarz-Christoffel Formula 20 4. Crowding 27 5. Power series of Schwarz-Christoffel maps 29 6. Harmonic measure and Brownian motion 39 7. The quasiconformal distance between polygons 48 8. Schwarz-Christoffel iterations and Davis’s method 56 Chapter 2. The Riemann mapping theorem 67 1. The hyperbolic metric 67 2. Schwarz’s lemma 69 3. The Poisson integral formula 71 4. A proof of Riemann’s theorem 73 5. Koebe’s method 74 6. -
Complex Manifolds
Complex Manifolds Lecture notes based on the course by Lambertus van Geemen A.A. 2012/2013 Author: Michele Ferrari. For any improvement suggestion, please email me at: [email protected] Contents n 1 Some preliminaries about C 3 2 Basic theory of complex manifolds 6 2.1 Complex charts and atlases . 6 2.2 Holomorphic functions . 8 2.3 The complex tangent space and cotangent space . 10 2.4 Differential forms . 12 2.5 Complex submanifolds . 14 n 2.6 Submanifolds of P ............................... 16 2.6.1 Complete intersections . 18 2 3 The Weierstrass }-function; complex tori and cubics in P 21 3.1 Complex tori . 21 3.2 Elliptic functions . 22 3.3 The Weierstrass }-function . 24 3.4 Tori and cubic curves . 26 3.4.1 Addition law on cubic curves . 28 3.4.2 Isomorphisms between tori . 30 2 Chapter 1 n Some preliminaries about C We assume that the reader has some familiarity with the notion of a holomorphic function in one complex variable. We extend that notion with the following n n Definition 1.1. Let f : C ! C, U ⊆ C open with a 2 U, and let z = (z1; : : : ; zn) be n the coordinates in C . f is holomorphic in a = (a1; : : : ; an) 2 U if f has a convergent power series expansion: +1 X k1 kn f(z) = ak1;:::;kn (z1 − a1) ··· (zn − an) k1;:::;kn=0 This means, in particular, that f is holomorphic in each variable. Moreover, we define OCn (U) := ff : U ! C j f is holomorphicg m A map F = (F1;:::;Fm): U ! C is holomorphic if each Fj is holomorphic. -
INTRODUCTION to ALGEBRAIC TOPOLOGY 1 Category And
INTRODUCTION TO ALGEBRAIC TOPOLOGY (UPDATED June 2, 2020) SI LI AND YU QIU CONTENTS 1 Category and Functor 2 Fundamental Groupoid 3 Covering and fibration 4 Classification of covering 5 Limit and colimit 6 Seifert-van Kampen Theorem 7 A Convenient category of spaces 8 Group object and Loop space 9 Fiber homotopy and homotopy fiber 10 Exact Puppe sequence 11 Cofibration 12 CW complex 13 Whitehead Theorem and CW Approximation 14 Eilenberg-MacLane Space 15 Singular Homology 16 Exact homology sequence 17 Barycentric Subdivision and Excision 18 Cellular homology 19 Cohomology and Universal Coefficient Theorem 20 Hurewicz Theorem 21 Spectral sequence 22 Eilenberg-Zilber Theorem and Kunneth¨ formula 23 Cup and Cap product 24 Poincare´ duality 25 Lefschetz Fixed Point Theorem 1 1 CATEGORY AND FUNCTOR 1 CATEGORY AND FUNCTOR Category In category theory, we will encounter many presentations in terms of diagrams. Roughly speaking, a diagram is a collection of ‘objects’ denoted by A, B, C, X, Y, ··· , and ‘arrows‘ between them denoted by f , g, ··· , as in the examples f f1 A / B X / Y g g1 f2 h g2 C Z / W We will always have an operation ◦ to compose arrows. The diagram is called commutative if all the composite paths between two objects ultimately compose to give the same arrow. For the above examples, they are commutative if h = g ◦ f f2 ◦ f1 = g2 ◦ g1. Definition 1.1. A category C consists of 1◦. A class of objects: Obj(C) (a category is called small if its objects form a set). We will write both A 2 Obj(C) and A 2 C for an object A in C. -
Topics on Calculus of Variations
TOPICS ON CALCULUS OF VARIATIONS AUGUSTO C. PONCE ABSTRACT. Lecture notes presented in the School on Nonlinear Differential Equa- tions (October 9–27, 2006) at ICTP, Trieste, Italy. CONTENTS 1. The Laplace equation 1 1.1. The Dirichlet Principle 2 1.2. The dawn of the Direct Methods 4 1.3. The modern formulation of the Calculus of Variations 4 1 1.4. The space H0 (Ω) 4 1.5. The weak formulation of (1.2) 8 1.6. Weyl’s lemma 9 2. The Poisson equation 11 2.1. The Newtonian potential 11 2.2. Solving (2.1) 12 3. The eigenvalue problem 13 3.1. Existence step 13 3.2. Regularity step 15 3.3. Proof of Theorem 3.1 16 4. Semilinear elliptic equations 16 4.1. Existence step 17 4.2. Regularity step 18 4.3. Proof of Theorem 4.1 20 References 20 1. THE LAPLACE EQUATION Let Ω ⊂ RN be a body made of some uniform material; on the boundary of Ω, we prescribe some fixed temperature f. Consider the following Question. What is the equilibrium temperature inside Ω? Date: August 29, 2008. 1 2 AUGUSTO C. PONCE Mathematically, if u denotes the temperature in Ω, then we want to solve the equation ∆u = 0 in Ω, (1.1) u = f on ∂Ω. We shall always assume that f : ∂Ω → R is a given smooth function and Ω ⊂ RN , N ≥ 3, is a smooth, bounded, connected open set. We say that u is a classical solution of (1.1) if u ∈ C2(Ω) and u satisfies (1.1) at every point of Ω. -
THE IMPACT of RIEMANN's MAPPING THEOREM in the World
THE IMPACT OF RIEMANN'S MAPPING THEOREM GRANT OWEN In the world of mathematics, scholars and academics have long sought to understand the work of Bernhard Riemann. Born in a humble Ger- man home, Riemann became one of the great mathematical minds of the 19th century. Evidence of his genius is reflected in the greater mathematical community by their naming 72 different mathematical terms after him. His contributions range from mathematical topics such as trigonometric series, birational geometry of algebraic curves, and differential equations to fields in physics and philosophy [3]. One of his contributions to mathematics, the Riemann Mapping Theorem, is among his most famous and widely studied theorems. This theorem played a role in the advancement of several other topics, including Rie- mann surfaces, topology, and geometry. As a result of its widespread application, it is worth studying not only the theorem itself, but how Riemann derived it and its impact on the work of mathematicians since its publication in 1851 [3]. Before we begin to discover how he derived his famous mapping the- orem, it is important to understand how Riemann's upbringing and education prepared him to make such a contribution in the world of mathematics. Prior to enrolling in university, Riemann was educated at home by his father and a tutor before enrolling in high school. While in school, Riemann did well in all subjects, which strengthened his knowl- edge of philosophy later in life, but was exceptional in mathematics. He enrolled at the University of G¨ottingen,where he learned from some of the best mathematicians in the world at that time. -
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.