Fundamental Theorem of Algebra. Yvonne Lai March 2010
|
|
- Osborne Riley
- 6 years ago
- Views:
Transcription
1 Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex root. The first half of the proof aalyses the images of sufficietly large loops (Sectio 1) ad sufficietly small loops (Sectio ). We will quatify i these sectios what sufficietly large ad sufficietly small mea. The secod half of the proof aalyses the images of loops close together (Sectio 3), ad applies the properties of images to show the existece of a z C so that f (z) = 0 (Sectio 4). The existece proof relies o a examiatio of widig umber. 0 Prelimiaries Let f be defied with the coefficiets f (z) = a 0 + a 1 z + a z a 1 z 1 + a z, where a = 0 (to guaratee that f (z) is ocostat). Note that sice f is ocostat, 1. Notatio. Throughout the proof, we will use the otatio: a = max{ a 0, a 1,..., a 1, 1} coefficiets of f. C R = (R, t), t [0, π], where (R, t) is the parametrizatio, writte i polar form, of the couterclockwise path i C traversig oce couterclockwise aroud the circle with radius R ad ceter 0. Simplifyig Assumptios. Note that if a 0 = 0, the f (0) = 0, so 0 is a root. So from ow o, we work with the case a 0 = 0. It is sufficiet to prove the theorem for a = 1. For suppose that we have show that all ocostat polyomials with leadig coefficiet 1 must have at least oe complex root. The the polyomial g(z) = f (z) = a 0 + a 1 z a 1 z 1 + z a a a has at least oe root; suppose the root is z 0. It follows that a f (z 0 ) = a g(z 0 ) = a 0 = 0, so z 0 is a root of f. Thus provig the Fudametal Theorem of Algebra for the case a = 1 implies the theorem for the case whe a = 1. So, i what follows, we assume a = 1. 1
2 1 Large Iput Loops Our goal i this sectio is to prove Propositio 1 below. The key idea of its statemet is If R is big eough, the f seds C R to a path cotaied i a aulus aroud the circle with radius R, cetered aroud the origi. A schematic of the statemet ca be foud at the ed of this sectio. Propositio 1. If R a, the { f (C R ) z C Lemma 1. If R a, the for 0 k 1. 1 R z 3 } R. ar k R Proof of Lemma 1. Note that a > 1, so if R a, the R m R a for m 1, icludig m = k, for 0 k 1. It follows that as desired. R k a R ar k R ar k Private math: For this lemma, we seek a R so that ar k R, which ca be rewritte ar k R a R k k a R ( ) Oe R that satisfies ( ) is a, because a is at least as large as k a. Proof of Propositio 1. To prove the propositio, we eed to show that R a implies the radius of f (C R (t)) is betwee 1 R ad 3 R, for all t. The radius of f (C R (t)) is (R, t) + a 1 (R, t) a 1 (R, t) + a 0, which is bouded below by R ( a 1 R a 1 R + a 0 ), ad bouded above by ( ) R + a 1 R a 1 R + a 0. ( ) Suppose R a. We have just show that this coditio implies ar k R for 0 k 1. Cosequetly, a 1 R a 1 R + a 0 R R + R }{{ } times = R.
3 Pluggig i our calculatios ito ( ) ad ( ), we coclude that R a implies the radius of f (C R (t)) satisfies R R f (C R(t)) R + R for all times t, as claimed. 1 R f (C R (t)) 3 R We have show that whe R is large eough, meaig its radius is at least a, the f seds C R to a loop that is cotaied i a eighbourhood of a circle with radius R. See Figure 1 for a visual schematic of the meaig of Propositio 1. C R a R R R iput output Figure 1. Visual schematic for Propositio 1. If C R is cotaied i the shaded iput regio, the its image is cotaied i the shaded output regio. 3
4 Small Iput Loops Propositio. Whe R a 0 a, the f (C R) is cotaied i a disk of radius a 0 cetered at a 0. Lemma. Suppose R a 0 a. The ark a 0 for 1 k. Proof of Lemma. Suppose R a 0 a, ad let 1 k. Note that a 0 a < 1, as a 0 is ( ) a0 k at most a. This implies a a 0 a. We have as desired. ar k a ( ) a0 k a a 0 a a = a 0 Proof of Propositio. To prove the propositio, we eed to show that R a 0 a implies that a 0 f (C R (t)) a 0 for all t. Note that ( a 0 f (C R (t)) = a 0 a 0 + a 1 (R, t) a 1 (R, t) 1 + (R, t) ) Private math: For this lemma, we seek a R so that ar k a 0, which ca be rewritte ar k a 0 R k a 0 a R k a0 a ( ) Oe R that satisfies ( ) is a 0 a, because a 0 a is at most k a0 a if a 0 a < 1. a 1 R + a R a 1 R 1 + R. Suppose R a 0 a. We have just show this coditio implies ark a 0 1 k. Cosequetly, for a 0 f (C R (t)) a 1 R + a R a 1 R 1 + R for all t, as claimed. a 0 + a a 0 }{{ } times = a 0 We have show that whe C R is small eough, meaig its radius is at most a 0 a, the f seds C R to a loop that is cotaied i a eighbourhood of a 0, the costat term. 4
5 C R a 0 a a 0 a 0 iput output Figure. Visual schematic for Propositio. If C R is cotaied i the shaded iput regio, the its image is cotaied i the shaded output regio. 3 Neighbourhoods of Iput Loops The goal of this sectio is to prove Propositio 3. Propositio 3. Let (R, t) C. For every ɛ > 0, there exists a δ 0 > 0 such that δ < δ 0 implies f (R + δ, t) f (R, t) < ɛ. Recall that the degree of f is. I the proof of Propositio 3, we let C deote the largest coefficiet over all terms of the multiomials {(x + δ) k 0 < k }. Lemma 3. Give 0 < δ < R, for all itegers k 0. (R + δ) k R k δ kcr k 1 Proof of Lemma 3. After expasio, the expressio (R + δ) k R k cotais oly terms of the form R k 1 δ, R k δ,..., Rδ k 1, δ k, as the term R k cacels. To prove the lemma, first cosider positive δ. The (R + δ) k R k = (R + δ) k R k CR k 1 δ + CR k δ CRδ k 1 + Cδ k δc(r k 1 + R k δ Rδ k + δ k 1 ) δc(r k 1 + R k R }{{ k 1 ) } k times δckr k 1. 5
6 Now suppose δ is egative, so (R + δ) k R k = R k (R δ ) k. Because power fuctios are cocave up, it follows that We have show the lemma. R k (R δ ) k (R + δ ) k R k δ CkR k 1. Corollary 1. Let K = a C max{r, 1}. If 0 δ R, the Proof of Corollary 1. Note that f (R + δ, t) f (R, t) = f (R + δ, t) f (R, t) < δk. a It follows from Lemma 3 that ( a (R + δ) k R k) a k ( (R + δ, t) k (R, t) k) a ((R + δ, t) k (R, t) k) ( (R + δ) k R k). Hece f (R + δ, t) f (R, t) < δk as claimed. We ow prove the propositio. aδkcr k 1 < aδc max{r, 1} = aδc max{r, 1} = δk Proof of Propositio 3. Fix ɛ > 0. We seek δ 0 > 0 that guaratees that if δ < δ 0, the f (R + δ, t) f (R, t) < ɛ. We claim that δ 0 = ɛ K works. Ideed, suppose δ < δ 0 = ɛ K. By Corollary 1, as we sought to prove. f (R + δ, t) f (R, t) < δ K < δ 0 K = ɛ K K = ɛ 6
7 4 Proof of the Fudametal Theorem of Algebra Propositio 4. Let R > 0, ad suppose f (C R ) does ot cross the origi. Let ɛ 0 be mi{ f (C R (t)) t [0, π]}. Let δ 0 = ɛ 0 /K, where K is defied as i Corollary 1. The δ < δ 0 implies that the widig umbers of f (C R ) ad f (C R+δ ) are the same. Proof. We show that there is a deformatio of f (C R ) to f (C R+δ ) that does ot cross the origi, ad hece the widig umbers of the two paths must be equal. Defie p α (t), t [0, π] as the path f (C R (t)) + α( f (C R+δ (t)) f (C R (t))) for α [0, 1]. Note that p 0 = f (C R ) ad p 1 = f (C R+δ ), ad as α sweeps from 0 to 1, the path p α deforms from f (C R ) to f (C R+δ ). By Propositio 3, δ < δ 0 guaratees that f (C R+δ (t)) f (C R (t)) is strictly less tha ɛ 0, the miimum radius of ay poit i f (C R (t)). It follows that p α caot pass through the origi for ay α. Hece we ca deform f (C R ) to f (C R+δ ) without passig through the origi, so δ < δ 0 guaratees that the widig umbers of f (C R ) ad f (C R+δ ) are equal. By usig similar techiques, we obtai the corollary of Propositio 1: Corollary. Suppose R a. The the widig umber of f (C R ) is. Proof. We show that the widig umber of f (C R ) is by deformig a path that has widig umber to f (C R ). This path is (C R ) = (R, t). Defie the deformatio q α (t) = (C R ) + α( f (C R (t)) (C R (t)) ), t [0, π] from (C R ) to f (C R ). By Propositio 1, f (C R (t)) is at most R /. It follows that f (C R (t)) (C R (t)) R / R = R /, so q α does ot pass through the origi for ay α. Thus the widig umbers of (C R ) ad f (C R ) must be equal. 7
8 We ow complete the proof of the Fudametal Theorem of Algebra. I the followig proof, we use circle to deote a path of the form (r, t), t [0, π], where r > 0 is costat. Fudametal Theorem of Algebra. Let f be a ocostat polyomial. The f has at least oe complex root. Proof of Fudametal Theorem of Algebra. I this argumet, we aalyse widig umbers. Recall w(p) deotes the widig umber of p. Suppose by way of cotradictio that f has o roots. The, for ay R > 0, the path f (C R ) does ot cross the origi. I particular, w( f (C R )) is well-defied. By Propositio 4, there is a aulus N δ (C R ) such that if C is a circle i N δ (C R ), the w( f (C)) = w( f (C R )). For each R, pick such a aulus ad deote it N(C R ). Cosider the regio D = {z C 0 < z a}. This regio is covered by the collectio {N(C R ) 0 < R a} of auli. Circles from overlappig auli must produce images with the equal widig umbers. Because the regio D is coected ad covered by auli, each of which overlaps at least oe other aulus, we ca coclude that the widig umber of the images of all circles i D must be the same. The widig umber of f (C a ) is, by Corollary. Sice C a D, it follows that the widig umber of images of all circles i D must be. But by Propositio, the widig umber of f (C a0 /a) is 0, ad 0 =. Hece we have foud our cotradictio. There must exist a root of f i the complex plae. 8
PRACTICE FINAL/STUDY GUIDE SOLUTIONS
Last edited December 9, 03 at 4:33pm) Feel free to sed me ay feedback, icludig commets, typos, ad mathematical errors Problem Give the precise meaig of the followig statemets i) a f) L ii) a + f) L iii)
More information(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
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationAnalytic Continuation
Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationA detailed proof of the irrationality of π
Matthew Straugh Math 4 Midterm A detailed proof of the irratioality of The proof is due to Iva Nive (1947) ad essetial to the proof are Lemmas ad 3 due to Charles Hermite (18 s) First let us itroduce some
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationSolutions to Homework 1
Solutios to Homework MATH 36. Describe geometrically the sets of poits z i the complex plae defied by the followig relatios /z = z () Re(az + b) >, where a, b (2) Im(z) = c, with c (3) () = = z z = z 2.
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationArkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan
Arkasas Tech Uiversity MATH 94: Calculus II Dr Marcel B Fia 85 Power Series Let {a } =0 be a sequece of umbers The a power series about x = a is a series of the form a (x a) = a 0 + a (x a) + a (x a) +
More information62. 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 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationSequences and Limits
Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationLecture 9: Hierarchy Theorems
IAS/PCMI Summer Sessio 2000 Clay Mathematics Udergraduate Program Basic Course o Computatioal Complexity Lecture 9: Hierarchy Theorems David Mix Barrigto ad Alexis Maciel July 27, 2000 Most of this lecture
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More informationlim za n n = z lim a n n.
Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationExponential Functions and Taylor Series
MATH 4530: Aalysis Oe Expoetial Fuctios ad Taylor Series James K. Peterso Departmet of Biological Scieces ad Departmet of Mathematical Scieces Clemso Uiversity March 29, 2017 MATH 4530: Aalysis Oe Outlie
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationDefinition 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.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationMath 220B Final Exam Solutions March 18, 2002
Math 0B Fial Exam Solutios March 18, 00 1. (1 poits) (a) (6 poits) Fid the Gree s fuctio for the tilted half-plae {(x 1, x ) R : x 1 + x > 0}. For x (x 1, x ), y (y 1, y ), express your Gree s fuctio G(x,
More informationTechnical Proofs for Homogeneity Pursuit
Techical Proofs for Homogeeity Pursuit bstract This is the supplemetal material for the article Homogeeity Pursuit, submitted for publicatio i Joural of the merica Statistical ssociatio. B Proofs B. Proof
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationj=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)
Problem. Compute the itegrals C r d for Z, where C r = ad r >. Recall that C r has the couter-clockwise orietatio. Solutio: We will use the idue Theorem to solve this oe. We could istead use other (perhaps
More informationCSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)
CSI 101 Discrete Structures Witer 01 Prof. Lucia Moura Uiversity of Ottawa Homework Assigmet #4 (100 poits, weight %) Due: Thursday, April, at 1:00pm (i lecture) Program verificatio, Recurrece Relatios
More informationPLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 3. (a) (b) (c) (d) (e) 5. (a) (b) (c) (d) (e) 7. (a) (b) (c) (d) (e)
Math 0560, Exam 3 November 6, 07 The Hoor Code is i effect for this examiatio. All work is to be your ow. No calculators. The exam lasts for hour ad 5 mi. Be sure that your ame is o every page i case pages
More informationf(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.
Theorem 3.6.4. [Liouville s Theorem] Every bouded etire fuctio is costat. Proof. Let f be a etire fuctio. Suppose that there is M R such that M for ay z C. The for ay z C ad R > 0 f (z) f(w) 2πi (w z)
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationAdvanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology
Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4
More informationMathematical Foundations -1- Sets and Sequences. Sets and Sequences
Mathematical Foudatios -1- Sets ad Sequeces Sets ad Sequeces Methods of proof 2 Sets ad vectors 13 Plaes ad hyperplaes 18 Liearly idepedet vectors, vector spaces 2 Covex combiatios of vectors 21 eighborhoods,
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS
ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationLecture 2 Long paths in random graphs
Lecture Log paths i radom graphs 1 Itroductio I this lecture we treat the appearace of log paths ad cycles i sparse radom graphs. will wor with the probability space G(, p) of biomial radom graphs, aalogous
More informationSOLUTIONS 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.
SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationMetric Space Properties
Metric Space Properties Math 40 Fial Project Preseted by: Michael Brow, Alex Cordova, ad Alyssa Sachez We have already poited out ad will recogize throughout this book the importace of compact sets. All
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationHomework 9. (n + 1)! = 1 1
. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationCarleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.
Carleto College, Witer 207 Math 2, Practice Fial Prof. Joes Note: the exam will have a sectio of true-false questios, like the oe below.. True or False. Briefly explai your aswer. A icorrectly justified
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationBenaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco
EXTENDING THE BERNOULLI-EULER METHOD FOR FINDING ZEROS OF HOLOMORPHIC FUNCTIONS Beaissa Beroussi Uiversité Abdelmalek Essaadi, ENSAT de Tager, B.P. 416, Tager, Morocco e-mail: Beaissa@fstt.ac.ma Mustapha
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationMAS111 Convergence and Continuity
MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece
More informationf(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim
Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationReal Variables II Homework Set #5
Real Variables II Homework Set #5 Name: Due Friday /0 by 4pm (at GOS-4) Istructios: () Attach this page to the frot of your homework assigmet you tur i (or write each problem before your solutio). () Please
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationBertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.
Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationSupplemental Material: Proofs
Proof to Theorem Supplemetal Material: Proofs Proof. Let be the miimal umber of traiig items to esure a uique solutio θ. First cosider the case. It happes if ad oly if θ ad Rak(A) d, which is a special
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationThe Wasserstein distances
The Wasserstei distaces March 20, 2011 This documet presets the proof of the mai results we proved o Wasserstei distaces themselves (ad ot o curves i the Wasserstei space). I particular, triagle iequality
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationPower Series Expansions of Binomials
Power Series Expasios of Biomials S F Ellermeyer April 0, 008 We are familiar with expadig biomials such as the followig: ( + x) = + x + x ( + x) = + x + x + x ( + x) 4 = + 4x + 6x + 4x + x 4 ( + x) 5
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationUniversity of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!
Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad
More informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More informationMIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS
MIDTERM 3 CALCULUS MATH 300 FALL 08 Moday, December 3, 08 5:5 PM to 6:45 PM Name PRACTICE EXAM S Please aswer all of the questios, ad show your work. You must explai your aswers to get credit. You will
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationMath 128A: Homework 1 Solutions
Math 8A: Homework Solutios Due: Jue. Determie the limits of the followig sequeces as. a) a = +. lim a + = lim =. b) a = + ). c) a = si4 +6) +. lim a = lim = lim + ) [ + ) ] = [ e ] = e 6. Observe that
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationTERMWISE DERIVATIVES OF COMPLEX FUNCTIONS
TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS This writeup proves a result that has as oe cosequece that ay complex power series ca be differetiated term-by-term withi its disk of covergece The result has
More informationExponential Functions and Taylor Series
Expoetial Fuctios ad Taylor Series James K. Peterso Departmet of Biological Scieces ad Departmet of Mathematical Scieces Clemso Uiversity March 29, 207 Outlie Revistig the Expoetial Fuctio Taylor Series
More information4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3
Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationfrom definition we note that for sequences which are zero for n < 0, X[z] involves only negative powers of z.
We ote that for the past four examples we have expressed the -trasform both as a ratio of polyomials i ad as a ratio of polyomials i -. The questio is how does oe kow which oe to use? [] X ] from defiitio
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationMath 140A Elementary Analysis Homework Questions 3-1
Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s
More information