9 the Riemann Mapping Theorem

Total Page:16

File Type:pdf, Size:1020Kb

9 the Riemann Mapping Theorem 9 The Riemann Mapping Theorem References for this section: L. Ahlfors, Complex Analysis, pages 133-136 and 229-233. • J. Shurman, The Riemann Mapping Theorem, available at • http://people.reed.edu/~jerry/311/rmt.pdf R.B. Ash and W.P Novinger, Complex Analysis, (Dover). • The Riemann Mapping Theorem is one of the highlights of complex analysis, and is a really surprising result. It says that all simply connected proper open subsets of the plane are conformally equivalent. Theorem 51. (Riemann Mapping Theorem) Let Ω be a simply connected proper open subset of C. Then there is an analytic bijection f : Ω D. Furthermore given any z Ω, there → 0 ∈ is a unique such map satisfying f(z0)=0, and f ′(z0) is positive. It is worthwhile thinking a little about the hypotheses here. If Ω is a proper subset of C, then there is a point w C Ω. If Ω is also simply connected, this means that C Ω is ∈ \ \ connected, so there is a path connecting w to . ∞ Let us start by looking at the question of uniqueness. Suppose that φ : D D is an → analytic bijection and that that f : Ω D is an analytic bijection. Then f = φ f is an 1 → 2 ◦ 1 analytic bijection from Ω to D too. Question: How many analytic bijections from D to D are there? Example: Obvious ones are φ(z)= eiθz. A more complicated example: fix z D and let 0 ∈ z z φ(z)= − 0 . z z +1 − 0 This M¨obius transformation maps z 0. Furthermore, it is easy to check that φ(1) = 0 7→ | | φ( 1) = φ(i) = 1, and hence φ maps the unit circle onto itself, and hence the open disk | − | | | onto itself. It turns out that these two examples are basically all that you can do. Our first result is Schwarz’s lemma which places limits on the growth of functions on the unit disk, as long as we know that they aren’t too big at the boundary. 70 Theorem 52. Suppose that f : D D is analytic and that f(0) = 0. Then → (a) f(z) z when z < 1, and | |≤| | | | (b) f ′(0) 1. | | ≤ Furthermore: (i) If equality holds at any non-zero point in (a), or in (b), then f(z) = λz for some constant λ. (ii) If such an equality does not hold then, for each R < 1, there exists ρ < 1 such that f(z) ρ z for z R. | | ≤ | | | | ≤ f(z) Proof. has a removable singularity at 0, so define z f(z) , z =0 g(z)= z 6 f ′(0), z =0. Suppose that R< 1. Since g is analytic onz < R and continuous on z R, the maximum | | | | ≤ modulus occurs on the boundary, and only there unless g is a constant. On z = R, | | f(z) 1 g(z) = | | < | | R R and so this bound holds for all z inside this circle. But this is true for all R < 1 and hence we can deduce that g(z) 1 for all z D. This establishes (a) and (b). | | ≤ ∈ If equality holds at some point in (a) then g is a constant and there is a constant λ such that f(z) = λz. If f ′(0) = 1 then it follows that f is constant from a consideration of | | Cauchy’s formula for derivatives. (Alternatively, apply the Maximum Modulus Principle to g(z).) The final assertion follows, for if it were false we would have a sequence z with { n} z R such that f(z )/z 1 . Such a sequence must have a limit point z with z R | n| ≤ | n n|→ | | ≤ and f(z) = z . | | | | Theorem 53. Every conformal map from the unit disk onto itself is of the form z b φ(z)= eiθ − 1 ¯bz − where θ R and b < 1. ∈ | | 71 1 Proof. Let φ be such a conformal map from z 1 onto itself. Then φ− is well-defined | | ≤ 1 1 1 and is itself conformal - remember (φ− )′(φ(z)) = . Let φ− (0) = b. Then b < 1 for φ′(z) | | 1 otherwise φ− is constant by the maximum modulus princple. Consider now z b φ (z)= − . 0 1 ¯bz − This maps the unit circle to itself and, since φ (0) = b, the interior to itself. Now 0 − 1 1 1 consider g = φ φ− ,g− = φ φ− . Both satisfy the conditions of Schwarz’s lemma so ◦ 0 0 ◦ 1 g(z) z , g− (w) w for z 1, w 1. | |≤| | | |≤| | | | ≤ | | ≤ That is g(z) z g(z) for z 1. | |≤| |≤| | | | ≤ iθ iθ Thus g(z)= e z by Schwarz’s lemma. Putting this together, g(φ0(z)) = e φ0(z) or φ(z)= iθ e φ0(z), as claimed. This now allows to to show that there is at most one conformal map from a simply connected proper subset of C onto D with f(z0) = 0 and f ′(z0) positive. Suppose that 1 f , f : Ω D are two such maps. Then φ = f f − is a conformal bijection from D to 1 2 → 2 ◦ 1 itself and hence z b φ(z)= eiθ − . 1 ¯bz − iθ iθ But φ(0) = 0 and so b = 0. That is φ(z)= e z, or f2(z)= e f1(z). Thus iθ f2′ (z0)= e f1′ (z0). iθ But since both derivatives are real and positive at z0, this says that e must be 1, and so f2 = f1. The harder part of the proof of the Riemann Mapping Theorem is to show that any suitable bijection exists at all! Even Riemann fudged when he first ‘proved’ this (in 1851). It took until 1912 before Carath´eodory produced what is now considered a valid proof. Fix then the simply connected proper open subset Ω and the point z Ω. Let 0 ∈ = f : Ω D : f is analytic, 1–1 and f(z )=0 . F { → 0 } Note that we don’t require that elements of are onto. F 72 Lemma 54. Suppose that f : Ω C is an analytic 1–1 function. Then f(Ω) is homeomor- → phic to Ω and hence f(Ω) is simply connected. Proof. The Inverse Function Theorem implies that f is a homeomorphism and hence f preserves simple connectedness. If Ω is bounded, then it is clear that is nonempty: f(z)=(z z )/M will work for F − 0 large enough M. Lemma 55. is nonempty. F Proof. Since Ω is a proper subset of C we can choose a / Ω. Since Ω is simply connected, its ∈ complement is connected as a subset of the Riemann sphere. Thus, there is some continuous path in Ωc connecting a to . This means (think back to Assignment 1!) that we can choose ∞ a branch of the square root function f : Ω C, r(z)= √z a → − which is analytic on Ω. Since each point w C has a unique square, the function r can only have one of w or ∈ w in its range. Pick some w r(Ω). By the Open Mapping Theorem, r(Ω) is open, so − 0 ∈ for some ǫ> 0, B(w , ǫ) r(Ω). But this means that r(Ω) contains none of the elements of 0 ⊂ B( w , ǫ). − 0 Now let’s start composing maps. The range of the map z r(z)+ w now contains none 7→ 0 of the points of B(0, ǫ), and so 2 g(z)= (r(z)+ w ) ǫ 0 completely misses the unit disk. Thus h : Ω D → 1 h(z)= g(z) is well-defined, analytic and 1–1. We can now further compose with an automorphism of the disk to produce a suitable function that sends z0 to 0, and so we have produced an element of . F The next lemma is the clever part. For notational convenience, for w D, lets ∈ z w T (z)= − w 1 wz − 73 denote the natural automorphism of D which maps w to 0. This has inverse 1 z + w T − (z)= . w 1+ wz Lemma 56. Suppose that f satisfies ∈F f ′(z ) g′(z ) , for all g . | 0 |≥| 0 | ∈F Then f is a bijection from Ω to D. Proof. [Remember that we are assuming that elements of are 1–1.] F Suppose that f is not onto. That is, there exists w D which is not in f(Ω). Our ∈F ∈ aim now is to construct a function g with g′(z ) > f ′(z ) . ∈F | 0 | | 0 | The map Ω D, z T (f(z)) has a simply connected image which does not contain 0. → 7→ w As in the proof of Lemma 55, we can define an analytic branch of the square root function r : T (f(Ω)) D. Let w′ = r( w), and let w → − g = T ′ r T f w ◦ ◦ w ◦ which is an analytic 1–1 map from Ω to D. That is, g . ∈F Let s : D D be → 1 1 2 s(z)= Tw− Tw−′ (z) . Then 1 2 1 s(0) = T − (w′) = T − ( w)=0. w w − By Schwarz’s Lemma, s′(0) 1, and if s′(0) = 1 then s(z)= λz for some λ. But s is not | | ≤ | | 1–1, so s is not of this form. Therefore we must have that s′(0) < 1. | | Note now that f = s g. Using the chain rule ◦ f ′(z ) = s′(g(z )) g′(z ) = s′(0) g′(z ) < g′(z ) | 0 | | 0 || 0 | | || 0 | | 0 | as required. To complete the proof of the Riemann Mapping Theorem, we need to show that there is a function f which has a maximal derivative at z .
Recommended publications
  • Poles and Zeros of Generalized Carathéodory Class Functions
    W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2011 Poles and Zeros of Generalized Carathéodory Class Functions Yael Gilboa College of William and Mary Follow this and additional works at: https://scholarworks.wm.edu/honorstheses Part of the Mathematics Commons Recommended Citation Gilboa, Yael, "Poles and Zeros of Generalized Carathéodory Class Functions" (2011). Undergraduate Honors Theses. Paper 375. https://scholarworks.wm.edu/honorstheses/375 This Honors Thesis is brought to you for free and open access by the Theses, Dissertations, & Master Projects at W&M ScholarWorks. It has been accepted for inclusion in Undergraduate Honors Theses by an authorized administrator of W&M ScholarWorks. For more information, please contact [email protected]. Poles and Zeros of Generalized Carathéodory Class Functions A thesis submitted in partial fulfillment of the requirement for the degree of Bachelor of Science with Honors in Mathematics from The College of William and Mary by Yael Gilboa Accepted for (Honors) Vladimir Bolotnikov, Committee Chair Ilya Spiktovsky Leiba Rodman Julie Agnew Williamsburg, VA May 2, 2011 POLES AND ZEROS OF GENERALIZED CARATHEODORY´ CLASS FUNCTIONS YAEL GILBOA Date: May 2, 2011. 1 2 YAEL GILBOA Contents 1. Introduction 3 2. Schur Class Functions 5 3. Generalized Schur Class Functions 13 4. Classical and Generalized Carath´eodory Class Functions 15 5. PolesandZerosofGeneralizedCarath´eodoryFunctions 18 6. Future Research and Acknowledgments 28 References 29 POLES AND ZEROS OF GENERALIZED CARATHEODORY´ CLASS FUNCTIONS 3 1. Introduction The goal of this thesis is to establish certain representations for generalized Carath´eodory functions in terms of related classical Carath´eodory functions. Let denote the Carath´eodory class of functions f that are analytic and that have a nonnegativeC real part in the open unit disk D = z : z < 1 .
    [Show full text]
  • 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.
    [Show full text]
  • Control Systems
    ECE 380: Control Systems Course Notes: Winter 2014 Prof. Shreyas Sundaram Department of Electrical and Computer Engineering University of Waterloo ii c Shreyas Sundaram Acknowledgments Parts of these course notes are loosely based on lecture notes by Professors Daniel Liberzon, Sean Meyn, and Mark Spong (University of Illinois), on notes by Professors Daniel Davison and Daniel Miller (University of Waterloo), and on parts of the textbook Feedback Control of Dynamic Systems (5th edition) by Franklin, Powell and Emami-Naeini. I claim credit for all typos and mistakes in the notes. The LATEX template for The Not So Short Introduction to LATEX 2" by T. Oetiker et al. was used to typeset portions of these notes. Shreyas Sundaram University of Waterloo c Shreyas Sundaram iv c Shreyas Sundaram Contents 1 Introduction 1 1.1 Dynamical Systems . .1 1.2 What is Control Theory? . .2 1.3 Outline of the Course . .4 2 Review of Complex Numbers 5 3 Review of Laplace Transforms 9 3.1 The Laplace Transform . .9 3.2 The Inverse Laplace Transform . 13 3.2.1 Partial Fraction Expansion . 13 3.3 The Final Value Theorem . 15 4 Linear Time-Invariant Systems 17 4.1 Linearity, Time-Invariance and Causality . 17 4.2 Transfer Functions . 18 4.2.1 Obtaining the transfer function of a differential equation model . 20 4.3 Frequency Response . 21 5 Bode Plots 25 5.1 Rules for Drawing Bode Plots . 26 5.1.1 Bode Plot for Ko ....................... 27 5.1.2 Bode Plot for sq ....................... 28 s −1 s 5.1.3 Bode Plot for ( p + 1) and ( z + 1) .
    [Show full text]
  • Real Rational Filters, Zeros and Poles
    Real Rational Filters, Zeros and Poles Jack Xin (Lecture) and J. Ernie Esser (Lab) ∗ Abstract Classnotes on real rational filters, causality, stability, frequency response, impulse response, zero/pole analysis, minimum phase and all pass filters. 1 Real Rational Filter and Frequency Response A real rational filter takes the form of difference equations in the time domain: a(1)y(n) = b(1)x(n)+ b(2)x(n 1) + + b(nb + 1)x(n nb) − ··· − a(2)y(n 1) a(na + 1)y(n na), (1) − − −···− − where na and nb are nonnegative integers (number of delays), x is input signal, y is filtered output signal. In the z-domain, the z-transforms X and Y are related by: Y (z)= H(z) X(z), (2) where X and Y are z-transforms of x and y respectively, and H is called the transfer function: b(1) + b(2)z−1 + + b(nb + 1)z−nb H(z)= ··· . (3) a(1) + a(2)z−1 + + a(na + 1)z−na ··· The filter is called real rational because H is a rational function of z with real coefficients in numerator and denominator. The frequency response of the filter is H(ejθ), where j = √ 1, θ [0, π]. The θ [π, 2π] − ∈ ∈ portion does not contain more information due to complex conjugacy. In Matlab, the frequency response is obtained by: [h, θ] = freqz(b, a, N), where b = [b(1), b(2), , b(nb + 1)], a = [a(1), a(2), , a(na + 1)], N refers to number of ··· ··· sampled points for θ on the upper unit semi-circle; h is a complex vector with components H(ejθ) at sampled points of θ.
    [Show full text]
  • Residue Theorem
    Topic 8 Notes Jeremy Orloff 8 Residue Theorem 8.1 Poles and zeros f z z We remind you of the following terminology: Suppose . / is analytic at 0 and f z a z z n a z z n+1 ; . / = n. * 0/ + n+1. * 0/ + § a ≠ f n z n z with n 0. Then we say has a zero of order at 0. If = 1 we say 0 is a simple zero. f z Suppose has an isolated singularity at 0 and Laurent series b b b n n*1 1 f .z/ = + + § + + a + a .z * z / + § z z n z z n*1 z z 0 1 0 . * 0/ . * 0/ * 0 < z z < R b ≠ f n z which converges on 0 * 0 and with n 0. Then we say has a pole of order at 0. n z If = 1 we say 0 is a simple pole. There are several examples in the Topic 7 notes. Here is one more Example 8.1. z + 1 f .z/ = z3.z2 + 1/ has isolated singularities at z = 0; ,i and a zero at z = *1. We will show that z = 0 is a pole of order 3, z = ,i are poles of order 1 and z = *1 is a zero of order 1. The style of argument is the same in each case. At z = 0: 1 z + 1 f .z/ = ⋅ : z3 z2 + 1 Call the second factor g.z/. Since g.z/ is analytic at z = 0 and g.0/ = 1, it has a Taylor series z + 1 g.z/ = = 1 + a z + a z2 + § z2 + 1 1 2 Therefore 1 a a f .z/ = + 1 +2 + § : z3 z2 z This shows z = 0 is a pole of order 3.
    [Show full text]
  • Chapter 7: the Z-Transform
    Chapter 7: The z-Transform Chih-Wei Liu Outline Introduction The z-Transform Properties of the Region of Convergence Properties of the z-Transform Inversion of the z-Transform The Transfer Function Causality and Stability Determining Frequency Response from Poles & Zeros Computational Structures for DT-LTI Systems The Unilateral z-Transform 2 Introduction The z-transform provides a broader characterization of discrete-time LTI systems and their interaction with signals than is possible with DTFT Signal that is not absolutely summable z-transform DTFT Two varieties of z-transform: Unilateral or one-sided Bilateral or two-sided The unilateral z-transform is for solving difference equations with initial conditions. The bilateral z-transform offers insight into the nature of system characteristics such as stability, causality, and frequency response. 3 A General Complex Exponential zn Complex exponential z= rej with magnitude r and angle n zn rn cos(n) jrn sin(n) Re{z }: exponential damped cosine Im{zn}: exponential damped sine r: damping factor : sinusoidal frequency < 0 exponentially damped cosine exponentially damped sine zn is an eigenfunction of the LTI system 4 Eigenfunction Property of zn x[n] = zn y[n]= x[n] h[n] LTI system, h[n] y[n] h[n] x[n] h[k]x[n k] k k H z h k z Transfer function k h[k]znk k n H(z) is the eigenvalue of the eigenfunction z n k j (z) z h[k]z Polar form of H(z): H(z) = H(z)e k H(z)amplitude of H(z); (z) phase of H(z) zn H (z) Then yn H ze j z z n .
    [Show full text]
  • Meromorphic Functions with Prescribed Asymptotic Behaviour, Zeros and Poles and Applications in Complex Approximation
    Canad. J. Math. Vol. 51 (1), 1999 pp. 117–129 Meromorphic Functions with Prescribed Asymptotic Behaviour, Zeros and Poles and Applications in Complex Approximation A. Sauer Abstract. We construct meromorphic functions with asymptotic power series expansion in z−1 at ∞ on an Arakelyan set A having prescribed zeros and poles outside A. We use our results to prove approximation theorems where the approximating function fulfills interpolation restrictions outside the set of approximation. 1 Introduction The notion of asymptotic expansions or more precisely asymptotic power series is classical and one usually refers to Poincare´ [Po] for its definition (see also [Fo], [O], [Pi], and [R1, pp. 293–301]). A function f : A → C where A ⊂ C is unbounded,P possesses an asymptoticP expansion ∞ −n − N −n = (in A)at if there exists a (formal) power series anz such that f (z) n=0 anz O(|z|−(N+1))asz→∞in A. This imitates the properties of functions with convergent Taylor expansions. In fact, if f is holomorphic at ∞ its Taylor expansion and asymptotic expansion coincide. We will be mainly concerned with entire functions possessing an asymptotic expansion. Well known examples are the exponential function (in the left half plane) and Sterling’s formula for the behaviour of the Γ-function at ∞. In Sections 2 and 3 we introduce a suitable algebraical and topological structure on the set of all entire functions with an asymptotic expansion. Using this in the following sections, we will prove existence theorems in the spirit of the Weierstrass product theorem and Mittag-Leffler’s partial fraction theorem.
    [Show full text]
  • On Zero and Pole Surfaces of Functions of Two Complex Variables«
    ON ZERO AND POLE SURFACES OF FUNCTIONS OF TWO COMPLEX VARIABLES« BY STEFAN BERGMAN 1. Some problems arising in the study of value distribution of functions of two complex variables. One of the objectives of modern analysis consists in the generalization of methods of the theory of functions of one complex variable in such a way that the procedures in the revised form can be ap- plied in other fields, in particular, in the theory of functions of several com- plex variables, in the theory of partial differential equations, in differential geometry, etc. In this way one can hope to obtain in time a unified theory of various chapters of analysis. The method of the kernel function is one of the tools of this kind. In particular, this method permits us to develop some chap- ters of the theory of analytic and meromorphic functions f(zit • • • , zn) of the class J^2(^82n), various chapters in the theory of pseudo-conformal trans- formations (i.e., of transformations of the domains 332n by n analytic func- tions of n complex variables) etc. On the other hand, it is of considerable inter- est to generalize other chapters of the theory of functions of one variable, at first to the case of several complex variables. In particular, the study of value distribution of entire and meromorphic functions represents a topic of great interest. Generalizing the classical results about the zeros of a poly- nomial, Hadamard and Borel established a connection between the value dis- tribution of a function and its growth. A further step of basic importance has been made by Nevanlinna and Ahlfors, who showed not only that the results of Hadamard and Borel in a sharper form can be obtained by using potential-theoretical and topological methods, but found in this way im- portant new relations, and opened a new field in the modern theory of func- tions.
    [Show full text]
  • 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.
    [Show full text]
  • Z-Transform • Definition • Properties Linearity / Superposition Time Shift
    c J. Fessler, June 9, 2003, 16:31 (student version) 7.1 Ch. 7: Z-transform • Definition • Properties ◦ linearity / superposition ◦ time shift ◦ convolution: y[n]=h[n] ∗ x[n] ⇐⇒ Y (z)=H(z) X(z) • Inverse z-transform by coefficient matching • System function H(z) ◦ poles, zeros, pole-zero plots ◦ conjugate pairs ◦ relationship to H(^!) • Interconnection of systems ◦ Cascade / series connection ◦ Parallel connection ◦ Feedback connection • Filter design Reading • Text Ch. 7 • (Section 7.9 optional) c J. Fessler, June 9, 2003, 16:31 (student version) 7.2 z-Transforms Introduction So far we have discussed the time domain (n), and the frequency domain (!^). We now turn to the z domain (z). Why? • Other types of input signals: step functions, geometric series, finite-duration sinusoids. • Transient analysis. Right now we only have a time-domain approach. • Filter design: approaching a systematic method. • Analysis and design of IIR filters. Definition The (one-sided) z transform of a signal x[n] is defined by X∞ X(z)= x[k] z−k = x[0] + x[1] z−1 + x[2] z−2 + ··· ; k=0 where z can be any complex number. This is a function of z. We write X(z)=Z{x[n]} ; where Z{·}denotes the z-transform operation. We call x[n] and X(z) z-transform pairs, denoted x[n] ⇐⇒ X(z) : Left side: function of time (n) Right side: function of z Example. For the signal 3;n=0 [ ]=3 [ ]+7 [ − 6] = 7 =6 x n δ n δ n ;n 0; otherwise; the z-transform is X X(z)= (3δ[k]+7δ[k − 6])z−k =3+z−6: k This is a polynomial in z−1; specifically: X(z)=3+7(z−1)6: nP-Domain z-DomainP −k x[n]= k x[k] δ[n − k] ⇐⇒ X(z)= k x[k] z For causal signals, the z-transform is one-to-one, so using coefficient matching we can determine1 the signal x[n] from its z- transform.
    [Show full text]
  • The Measurable Riemann Mapping Theorem
    CHAPTER 1 The Measurable Riemann Mapping Theorem 1.1. Conformal structures on Riemann surfaces Throughout, “smooth” will always mean C 1. All surfaces are assumed to be smooth, oriented and without boundary. All diffeomorphisms are assumed to be smooth and orientation-preserving. It will be convenient for our purposes to do local computations involving metrics in the complex-variable notation. Let X be a Riemann surface and z x iy be a holomorphic local coordinate on X. The pair .x; y/ can be thoughtD C of as local coordinates for the underlying smooth surface. In these coordinates, a smooth Riemannian metric has the local form E dx2 2F dx dy G dy2; C C where E; F; G are smooth functions of .x; y/ satisfying E > 0, G > 0 and EG F 2 > 0. The associated inner product on each tangent space is given by @ @ @ @ a b ; c d Eac F .ad bc/ Gbd @x C @y @x C @y D C C C Äc a b ; D d where the symmetric positive definite matrix ÄEF (1.1) D FG represents in the basis @ ; @ . In particular, the length of a tangent vector is f @x @y g given by @ @ p a b Ea2 2F ab Gb2: @x C @y D C C Define two local sections of the complexified cotangent bundle T X C by ˝ dz dx i dy WD C dz dx i dy: N WD 2 1 The Measurable Riemann Mapping Theorem These form a basis for each complexified cotangent space. The local sections @ 1 Â @ @ Ã i @z WD 2 @x @y @ 1 Â @ @ Ã i @z WD 2 @x C @y N of the complexified tangent bundle TX C will form the dual basis at each point.
    [Show full text]
  • Zeros of Derivatives of Strictly Non-Real Meromorphic Functions, Ann
    Zeros of derivatives of strictly non-real meromorphic functions J.K. Langley February 21, 2020 Abstract A number of results are proved concerning the existence of non-real zeros of derivatives of strictly non-real meromorphic functions in the plane. MSC 2000: 30D35. 1 Introduction Let f be a meromorphic function in the plane and let f(z) = f(¯z) (this notation will be used throughout). Here f is called real if f = f, and strictly non-real if f is not a constant multiple of f. There has been substantial research concerning non-reale zeros of derivatives of real entire or real meromorphic functions [1, 2, 4,e 13, 14, 19, 22, 27, 28], but somewhate less in the strictly non-real case. The following theorem was proved in [12]. Theorem 1.1 ([12]) Let f be a strictly non-real meromorphic function in the plane with only real poles. Then f, f ′ and f ′′ have only real zeros if and only if f has one of the following forms: (I) f(z) = AeBz ; (II) f(z) = A ei(cz+d) 1 ; − (III) f(z) = A exp(exp(i(cz+ d))) ; arXiv:1801.00927v2 [math.CV] 20 Feb 2020 (IV ) f(z) = A exp [K(i(cz + d) exp(i(cz + d)))] ; − A exp[ 2i(cz + d) 2 exp(2i(cz + d))] (V ) f(z) = − − ; sin2(cz + d) A (VI) f(z) = . ei(cz+d) 1 − Here A, B C, while c,d and K are real with cB =0 and K 1/4. ∈ 6 ≤ − The first aim of the present paper is to prove a result in the spirit of Theorem 1.1, but with no assumption on the location of poles.
    [Show full text]