Solutions for Math 411 Assignment #8 1

Similar documents
j=1 dz Res(f, z j ) = 1 d k 1 dz k 1 (z c)k f(z) Res(f, c) = lim z c (k 1)! Res g, c = f(c) g (c)

f(w) w z =R z a 0 a n a nz n Liouville s theorem, we see that Q is constant, which implies that P is constant, which is a contradiction.

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

Math 104: Homework 2 solutions

n n 2 n n + 1 +

Math 140A Elementary Analysis Homework Questions 1

MATH 312 Midterm I(Spring 2015)

Notes 8 Singularities

Sequences and Series of Functions

Complex Analysis Spring 2001 Homework I Solution

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

Solutions to Math 347 Practice Problems for the final

Math 140A Elementary Analysis Homework Questions 3-1

MATH 304: MIDTERM EXAM SOLUTIONS

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent.

Objective Mathematics

page Suppose that S 0, 1 1, 2.

Solutions for Math 411 Assignment #2 1

Solutions to Tutorial 3 (Week 4)

Math 210A Homework 1

Seunghee Ye Ma 8: Week 5 Oct 28

Dirichlet s Theorem on Arithmetic Progressions

Assignment Number 3 Solutions

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected problems

Math 132, Fall 2009 Exam 2: Solutions

Solutions to Homework 1

COMM 602: Digital Signal Processing

Assignment 5: Solutions

The Gamma function. Marco Bonvini. October 9, dt e t t z 1. (1) Γ(z + 1) = z Γ(z) : (2) = e t t z. + z dt e t t z 1. = z Γ(z).

Solutions to Exercises 4.1

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

MATH 6101 Fall Problems. Problems 11/9/2008. Series and a Famous Unsolved Problem (2-1)(2 + 1) ( 4) 12-Nov-2008 MATH

Solutions to home assignments (sketches)

Math 61CM - Solutions to homework 3

Math 128A: Homework 1 Solutions

Math 4107: Abstract Algebra I Fall Webwork Assignment1-Groups (5 parts/problems) Solutions are on Webwork.

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

Cardinality Homework Solutions

Sequences and Limits

MTH Assignment 1 : Real Numbers, Sequences

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

MA131 - Analysis 1. Workbook 9 Series III

Math 2112 Solutions Assignment 5

The natural exponential function

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

MATH 6101 Fall 2008 Series and a Famous Unsolved Problem

PROBLEMS AND SOLUTIONS 2

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Dupuy Complex Analysis Spring 2016 Homework 02

Fundamental Theorem of Algebra. Yvonne Lai March 2010

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Math Solutions to homework 6

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

ANSWERS TO MIDTERM EXAM # 2

Math 341 Lecture #31 6.5: Power Series

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

ITEC 360 Data Structures and Analysis of Algorithms Spring for n 1

MATH 472 / SPRING 2013 ASSIGNMENT 2: DUE FEBRUARY 4 FINALIZED

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

MATH 10550, EXAM 3 SOLUTIONS

Chapter 8. Uniform Convergence and Differentiation.

MAT1026 Calculus II Basic Convergence Tests for Series

1 6 = 1 6 = + Factorials and Euler s Gamma function

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.

SCORE. Exam 2. MA 114 Exam 2 Fall 2016

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

Zeros of Polynomials

Definition An infinite sequence of numbers is an ordered set of real numbers.

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

1 Approximating Integrals using Taylor Polynomials

On the Inverse of a Certain Matrix Involving Binomial Coefficients

MAS111 Convergence and Continuity

Solutions to Tutorial 5 (Week 6)

The Boolean Ring of Intervals

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

SCORE. Exam 2. MA 114 Exam 2 Fall 2017

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

SOLVED EXAMPLES

2.4.2 A Theorem About Absolutely Convergent Series

f n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Chapter 8. Euler s Gamma function

The minimum value and the L 1 norm of the Dirichlet kernel

Analytic Continuation

7.1 Convergence of sequences of random variables

A NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p

APPM 4360/5360 Exam #2 Solutions Spring 2015

Real Analysis Fall 2004 Take Home Test 1 SOLUTIONS. < ε. Hence lim

1. ARITHMETIC OPERATIONS IN OBSERVER'S MATHEMATICS

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

JEE(Advanced) 2018 TEST PAPER WITH SOLUTION (HELD ON SUNDAY 20 th MAY, 2018)

INEQUALITIES BJORN POONEN

MATH2007* Partial Answers to Review Exercises Fall 2004

Transcription:

Solutios for Math Assigmet #8 A8. Fid the Lauret series of f() 3 2 + i (a) { < }; (b) { < < }; (c) { < 2 < 3}; (d) {0 < + < 2}. Solutio. We write f() as a sum of partial fractios: f() 3 2 + ( ) 2 ( + ) c + c 2 ( ) + c 3 2 + ( ) + 2( ) 2 ( + ) where c i are computed by c ( ( ) 2 f() ) c 2 ( ( ) 2 f() ) 2 For <, f() c 3 (( + )f()) ( ) + 2( ) 2 ( + ) ( ) + 2 ( ) 2 ( + ) + + ( ) 2 0 0 0 2 + + ( ) + 0 http://www.math.ualberta.ca/ xiche/math7f/hw8sol.pdf

2 Here we apply the geeralied biomial theorem ( + ) r r(r )...(r + ) r! 0 0 r( r + )...( r + ) ( )! to obtai ( ) 2 0 0 0 ( ) ( r + ) 2 + ( ) ( ) + 0 for <. For < <, f() ( ) + 2( ) 2 ( + ) + 2 ( 2 ) 2 ( + ) + + ( ) 2 2 0 0 0 + ( ) + ( ) 2 2 (2 + ( ) ).

3 For < 2 < 3, f() ( ) + 2( ) 2 ( + ) ( 2) + + 2 (( 2) + ) 2 ( 2) + 3 ( ) + ( 2) + ( 2) 2( 2) ( + ( 2 2) ) 2 2 ( + 3 ( 2)) ( ) ( 2) + + ( ) ( 2) ( 2) 2( 2) 2 0 0 ( ) 3 ( 2) 2 0 ( ) ( 2) + ( ) ( )( 2) 2 2 ( ) 3 ( 2) 2 (2 3) ( ) ( 2) 2 ( ) 3 ( 2).

For 0 < + < 2, f() ( ) + 2( ) 2 ( + ) ( + ) 2 + 2 (( + ) 2) 2 ( + ) ( 2 ( + ) ) + 8 8 ( 2 ( + )) 2 2 ( + ) + + 2 ( + ) 8 8 0 0 2 3 ( + ) ( + ) 0 ( + ) ( + ) A8.2 For each of the followig aalytic fuctios o {0 < < }, determie the type of its sigularity ad pricipal part at 0: cos (a) 2 ( ; ) + (b) cos. Solutio. (a) Sice cos 2 cos ( ) cos cos 0 cos ( ) ( ) 2 (2)! ( ) 2 (2)! where cos /( ) is aalytic at 0, we coclude that it has a pole of order at 0 with pricipal part /.

(b) Sice ( + cos cos + ) cos() cos si() si ( ) 2 ( ) 2 cos() si() (2)! (2 + )! 0 0 ( ) 2 ( ) 2 cos() + cos() si() (2)! (2 + )! we coclude that it has a essetial sigularity at 0 with pricipal part ( ) 2 ( ) 2 cos() si(). (2)! (2 + )! Alteratively, usig Euler formula, we obtai ( + cos cos + ) ( ( exp i + i ) ( + exp i i )) 2 ( ei i 2 exp + e i 2 exp i ) ei i + e i ( i) 2! 2! 0 0 i e i + ( i) e i ei + e i i e i + ( i) e i + 2(!) 2 2(!) 0 0 0 So it has a essetial sigularity at 0 with pricipal part i e i + ( i) e i. 2(!) 5

6 Note that ( i e i + ( i) e i ) 2(!) i 2m e i + ( i) 2m e i 2m + 2((2m)!) 2((2m + )!) m m0 e ( ) m i + e i ( ie 2m + ( ) m i ie i 2((2m)!) 2((2m + )!) m m0 ( ) 2 ( ) 2 cos() si(). (2)! (2 + )! 0 0 i 2m+ e i + ( i) 2m+ e i 2m ) 2m A8.3 Let f() ad g() be two aalytic fuctios o {0 < < }. For each of the followig statemets, determie whether it is true or false. If it is true, prove it. If it is false, give a couterexample. (a) If both f() ad g() have poles at 0, the f()g() has a pole at 0. (b) If both f() ad g() have essetial sigularities at 0, the f()g() has a essetial sigularity at 0. (c) If f()g() has a pole at 0, the at least oe of f() ad g() has a pole at 0. (d) If f()g() has a essetial sigularity at 0, the at least oe of f() ad g() has a essetial sigularity at 0. Proof. (a) True. Suppose that f() m p() ad g() q() for some positive itegers m ad ad aalytic fuctios p() ad q() o { < } satisfyig that p(0) 0 ad q(0) 0. The f()g() p()q() m+ has a pole of order m + at 0 sice p()q() is aalytic o { < } ad p(0)q(0) 0. (b) False.

Let f() exp( ) ad g() exp( ). The ( ) f() (!) + g() 0 0 (!) i C ad hece both f() ad g() have essetial sigularities at 0. But f()g() has a pole at 0. (c) False. Use the same couter-example for (b). (d) True. Suppose that both f() ad g() have removable sigularities or poles at 0. The f() m p() ad g() q() for some o-egative itegers m ad ad aalytic fuctios p() ad q() o { < }. Thus f()g() p()q() m+ has a removable sigularity or pole at 0 sice p()q() is aalytic o { < }. Cotradictio. So at least oe of f() ad g() has a essetial sigularity at 0. A8. Louville s theorem says that there are o ocostat bouded etire fuctios. Prove the same for aalytic fuctios o C : If f() is aalytic o C ad f() M for some M 0 ad all 0, the f() is costat. Proof. Sice f() M for 0 < <, f() has a removable sigularity at 0 by Riema Extesio Theorem. That is, f() ca be exteded to a aalytic fuctio o C, i.e., a etire fuctio. By cotiuity, f() M for all C. So f() is a bouded etire fuctio. The f() is costat by Louville s theorem. A8.5 Let D { < }, D {0 < < } ad f : D D be a biholomorphic map. Do the followig: (a) Show that f exteds to a aalytic fuctio o D ad D f(d) D. (b) (Bous +0 poits) Show that f(0) 0. (c) (Bous +0 poits) Show that f() c for some costat c satisfyig c. 7

8 Proof. Sice f(d ) D, f() < for all 0 < <. By Riema Extesio Theorem, f() has a removable sigularity at 0 ad f ca be exteded to a aalytic fuctio o D. By cotiuity, f(0) D { }. We claim that f(0) <. Otherwise, f(0) ad f(d) f(d ) {f(0)} D {f(0)} fails to be ope sice { f(0) < r} D {f(0)} for all r > 0; this cotradicts Ope Mappig Theorem. Therefore, f(0) < ad f(d) f(d ) {f(0)} D {f(0)} D O the other had, sice f : D D is a biholomorphic map, D f(d ) f(d). Therefore, D f(d) D. Let g f be the iverse of f : D D. Applyig the same argumet to g, we coclude that g exteds to a aalytic fuctio o D satisfyig that g(d) D. Let us cosider f g : D D. It is a aalytic fuctio o D satisfyig that f g() f f () for all 0. By cotiuity, f g() for all D. Similarly, we ca prove that g f() for all D. That is, f ad g are iverse to each other o D. I particular, f : D D is biholomorphic. The f(0) 0 sice f(d ) D ad f is -. Sice f : D D is biholomorphic ad f(0) 0, f() c for some c by Schwart Lemma.