On groups of diffeomorphisms of the interval with finitely many fixed points II. Azer Akhmedov

Size: px
Start display at page:

Download "On groups of diffeomorphisms of the interval with finitely many fixed points II. Azer Akhmedov"

Transcription

1 O groups of diffeomorphisms of the iterval with fiitely may fixed poits II Azer Akhmedov Abstract: I [6], it is proved that ay subgroup of Diff ω +(I) (the group of orietatio preservig aalytic diffeomorphisms of the iterval) is either metaabelia or does ot satisfy a law. A stroger questio is asked whether or ot the Girth Alterative holds for subgroups of Diff ω +(I). I this paper, we aswer this questio affirmatively for eve a larger class of groups of orietatio preservig diffeomorphisms of the iterval where every o-idetity elemet has fiitely may fixed poits. We show that every such group is either affie (i particular, metaabelia) or has ifiite girth. The proof is based o sharpeig the tools from the earlier work [1]. 1. Itroductio Throughout this paper we will write Φ (resp. Φ diff ) to deote the class of subgroups of Γ Homeo + (I) (resp. Γ Diff + (I)) such that every o-idetity elemet of Γ has fiitely may fixed poits. A importat class of such groups is provided by Diff ω +(I) - the group of orietatio preservig aalytic diffeomorphisms of I. Iterestigly, ot every group i Φ is cojugate (or eve isomorphic) to a subgroup of Diff ω +(I), see [3]. We will cosider a atural metric o Homeo + (I) iduced by the C 0 -metric by lettig f = sup f(x) x. x [0,1] For a iteger N 0 we will write Φ N (resp. Φ diff N ) to deote the class of subgroups of Homeo + (I) (resp. Diff + (I)) where every oidetity elemet has at most N fixed poits. It has bee proved i [1] that, for N 2, ay subgroup of Φ diff N of regularity C1+ɛ is ideed solvable, moreover, i the regularity C 2 we ca claim that it is metaabelia. I [3], we improve these results ad give a complete classificatio of subgroups of Φ diff N, N 2, eve at C1 -regularity. There, it is also show that the preseted classificatio picture fails i the cotiuous category, i.e. withi the larger class Φ N. The mai result of this paper is the followig Theorem 1.1. Let Γ Diff + (I) such that every o-idetity elemet has fiitely may fixed poits. The either Γ is isomorphic to a subgroup of Aff + (R) for some 1, or it has ifiite girth. 1

2 2 Remark 1.2. I particular, we obtai that a subgroup of Diff + (I) where every o-idetity diffeomorphism has fiitely may fixed poits, satisfies o law uless it is isomorphic to a subgroup of Aff + (R) for some 1. This also implies a positive aswer to Questio (v) from [6]. If Γ is irreducible (i.e. it does ot have a global fixed poit i (0, 1)), the oe ca take = 1. The proof of Theorem 1.1 relies o the study of diffeomorphism groups which act locally trasitively. To be precise, we eed the followig defiitios. Defiitio 1.3. A subgroup Γ Diff + (I) is called locally trasitive if for all p (0, 1) ad ɛ > 0, there exists γ Γ such that γ < ɛ ad γ(p) p. Defiitio 1.4. A subgroup Γ Diff + (I) is called dyamically 1- trasitive if for all p (0, 1) ad for every o-empty ope iterval J (0, 1) there exists γ Γ such that γ(p) J. The otio of dyamical k-trasitivity is itroduced i [2] where we also make a simple observatio that local trasitivity implies dyamical 1-trasitivity. Notice that if the group is dyamically k-trasitive for a arbitrary k 1 the it is dese i C 0 -metric. Dyamical k- trasitivity for some high values of k (eve for k 2) is usually very hard, if possible, to achieve, ad would be immesely useful (all the results obtaied i [2] are based o just establishig the dyamical 1- trasitivity). I this paper, we would like to itroduce a otio of weak trasitivity which turs out to be sufficiet for our purposes but it is also iterestig idepedetly. Defiitio 1.5. A subgroup Γ Diff + (I) is called weakly k-trasitive if for all g Γ, for all k poits p 1,..., p k (0, 1) with p 1 < < p k, ad for all ɛ > 0, there exist γ Γ such that g(γ(p i )) (γ(p i 1 ), γ(p i+1 )), for all i {1,..., k} ad γ(p k ) < ɛ where we assume p 0 = 0, p k+1 = 1. We say Γ is weakly trasitive if it is weakly k-trasitive for all k 1. The proof of the mai theorem will follow immediately from the followig four propositios which seem iterestig to us idepedetly. Propositio 1.6. Ay irreducible subgroup of Φ diff is either isomorphic to a subgroup of Aff + (R) or it is locally trasitive. Propositio 1.7. Ay irreducible subgroup of Φ diff is either isomorphic to a subgroup of Aff + (R) or it is weakly trasitive.

3 Propositio 1.8. Ay locally trasitive irreducible subgroup of Φ diff is either isomorphic to a subgroup of Aff + (R) or it has ifiite girth. Propositio 1.9. For ay N 1, ay irreducible subgroup of Diff + (I) where every o-idetity elemet has at most N fixed poits is isomorphic to a subgroup of Aff + (R). Let us poit out that, i C 1+ɛ -regularity, Propositio 1.9 is proved i [2] uder somewhat weaker coclusio, amely, by replacig the coditio isomorphic to a subgroup of Aff + (R) with solvable, ad i C 2 -regularity by replacig it with metabelia. Subsequetly, aother (simpler) argumet for this result is give i the aalytic category, by A.Navas [6]. I full geerality ad stregth, Propositio 1.9 is proved i [3]. Thus we eed to prove oly Propositio 1.6, 1.7 ad 1.8. The first of these propositios is proved i Sectio 2, by modifyig the mai argumet from [1]. The secod ad third propositios are proved i Sectio 3; i the proof of the third propositio, we follow the mai idea from [4]. Notatios: For all f Homeo + (I) we will write F ix(f) = {x (0, 1) f(x) = x}. The group Aff + (R) will deote the group of all orietatio preservig affie homeomorphisms of R, i.e. the maps of the form f(x) = ax + b where a > 0. The cojugatio of this group by a orietatio preservig homeomorphism φ : I R to the group of homeomorphisms of the iterval I will be deoted by Aff + (I) (we will drop the cojugatig map φ from the otatio). By choosig φ appropriately, oe ca also cojugate Aff + (R) to a group of diffeomorhisms of the iterval as well, ad (by fixig φ) we will refer to it as the group of affie diffeomorphisms of the iterval. If Γ is a subgroup from the class Φ the oe ca itroduce the followig biorder i Γ: for f, g Γ, we let g < f if g(x) < f(x) ear zero. If f is a positive elemet the we will also write g << f if g < f for every iteger ; we will say that g is ifiitesimal w.r.t. f. For f Γ, we write Γ f = {γ Γ : γ << f} (so Γ f cosists of diffeomorphisms which are ifiitesimal w.r.t. f). Notice that if Γ is fiitely geerated with a fixed fiite symmetric geeratig set, ad f is the biggest geerator, the Γ f is a ormal subgroup of Γ, moreover, Γ/Γ f is Archimedea, hece Abelia, ad thus we also see that [Γ, Γ] Γ f. 3

4 4 2. C 0 -discrete subgroups of Diff + (I): stregtheig the results of [1] Let us first quote the followig theorem from [1]. Theorem 2.1 (Theorem A). Let Γ Diff + (I) be a subgroup such that [Γ, Γ] cotais a free semigroup o two geerators. The Γ is ot C 0 -discrete, moreover, there exists o-idetity elemets i [Γ, Γ] arbitrarily close to the idetity i C 0 metric. I [2], Theorem A is used to obtai local trasitivity results i C 2 - regularity (C 1+ɛ -regularity ) for subgroups from Φ diff N which have derived legth at least three (at least k(ɛ)). However, we eed to obtai local trasitivity results for subgroups which are 1) o-abelia (ot ecessarily o-metaabelia); 2) from a larger class Φ diff ; 3) ad have oly C 1 -regularity. To do this, first we observe that withi the class Φ diff, the coditio Γ cotais a free semigroup by itself implies that [Γ, Γ] is either Abelia or cotais a free semigroup. Propositio 2.2. Let Γ be a o-abelia subgroup from the class Φ diff. The either Γ is locally trasitive or [Γ, Γ] cotais a free semigroup o two geerators. For the proof of the propositio, we eed the followig Defiitio 2.3. Let f, g Homeo + (I). We say the pair (f, g) is crossed if there exists a o-empty ope iterval (a, b) (0, 1) such that oe of the homeomorphisms fixes a ad b but o other poit i (a, b) while the other homeomorphism maps either a or b ito (a, b). It is a well kow folklore result that if (f, g) is a crossed pair the the subgroup geerated by f ad g cotais a free semigroup o two geerators (see [7]). Proof of Propositio 2.2. Without loss of geerality we may assume that Γ is irreducible. Let us first assume that Γ is metaabelia, ad let N be a otrivial Abelia ormal subgroup of Γ. By Hölder s Theorem, there exists f Γ such that F ix(f). O the other had, by irreducibility of Γ, F ix(g) = for all g N\{1}. By Lemma 6.2 i [5], N is ot discrete. Hece, for all ɛ > 0, there exists ω N such that ω < ɛ. This implies that Γ is locally trasitive.

5 Let us ow assume that Γ has derived legth more tha 2 (possibly ifiity). The Γ (1) = [Γ, Γ] is ot Abelia. The by Hölder s Theorem there exists two elemets f, g Γ (1) such that F ix(f) F ix(g). We may assume that (by switchig f ad g if ecessary) there exists p, q F ix(f) {0, 1} such that F ix(f) (p, q) =, F ix(g) (p, q). Without loss of geerality we may also assume that f(x) > x, x (p, q) ad g(p) p. If g(p) > p the f ad g form a crossed pair. But if g(p) = p the for sufficietly big, f ad g form a crossed pair. To fiish the proof of Propositio 1.6 it remais to show the followig Theorem 2.4. Let Γ Φ diff be a subgroup cotaiig a free semigroup i two geerators, such that f (0) = f (1) = 1 for all f Γ. The Γ is locally trasitive. Proof. The proof is very similar to the proof of Theorem A from [1] with a crucial extra detail. Without loss of geerality, we may assume that Γ is irreducible. Let p (0, 1), ɛ > 0, M = ( f (x) + g (x) ). Let also N N ad sup 0 x 1 δ > 0 such that 1/N < mi{ɛ, p, 1 p} ad for all x [1 δ, 1], the iequality φ (x) 1 < 1/10 holds where φ {f, g, f 1, g 1 }. Let W = W (f, g) be a elemet of Γ such that ({f i W (1/N) 2 i 2} {g i W (1/N) 2 i 2}) [1 δ, 1] ad let m be the legth of the reduced word W. Let also x i = i/n, 0 i N ad z = W (1/N). By replacig the pair (f, g) with (f 1, g 1 ) if ecessary, we may assume that f(z) z. The we ca defie (see the proof of Theorem A i [1] for the details) α, β Γ ad a poit z 0 (1 δ, 1) such that the followig coditios hold: (i) α ad β are positive words i f, g of legth at most two, (ii) z 0 = z or z 0 = fg(z), (iii) z 0 z, (iv) z 0 α(z 0 ) βα(z 0 ). The sup ( α (x) + β (x) ) M 2, ad the legth of the word W 0 x 1 i the alphabet {α, β, α 1, β 1 } is at most 2m. Now, for every N, let S = {U(α, β)βα U(α, β) is a positive word i α, β of legth.} 5

6 6 S = 2. Applyig Lemma 1 from [1] to the pair {α, β} we obtai that V (z 0 ) z 0 for all V S. Now, let c k = (k+1) for all k 1. The there exists a sufficietly big such that the followig two coditios are satisfied: (i) there exist a subset S (1) S such that S (1) > (2 c 1 ), ad for all g 1, g 2 S (1), g 1 W (x) g 2 W (x) < 1 (1.9), x {x i 1 i N 1} {p}. (ii) M 2m+4 (1.1) 1 (1.9) < ɛ. The from Mea Value Theorem we obtai that (g 1 W ) 1 (g 2 W )(x) x < 2ɛ for all x [0, 1]. 1 If g 1 W (p) g 2 W (p) for some g 1, g 2 S (1) the we are doe. Otherwise we defie the ext set S (2) {U(α, β)gw g S (1), U(α, β) is a positive word i α, β of legth.} such that S (2) > (2 c 2 ), ad for all g 1, g 2 S (2), g 1 W (x) g 2 W (x) < 1 (1.9), x {x i 1 i N 1} {p}. Agai, by Mea Value Theorem, we obtai that (g 1 W ) 1 (g 2 W )(x) x < 2ɛ 1 to explai this, we borrow the followig computatio from [1]: let h 1 = g 1 W, h 2 = g 2 W, y i = W (x i ), z i = g 1 (y i ), z i = g 2 (y i ), 1 i N. The for all i {1,..., N 1}, we have h 1 1 h 2(x i ) x i = (g 1 W ) 1 (g 2 W )(x i ) x i = (g 1 W ) 1 (g 2 W )(x i ) (g 1 W ) 1 (g 1 W )(x i ) = W 1 g 1 1 g 2(y i ) W 1 g 1 1 g 1(y i ) = W 1 g 1 1 (z i ) W 1 g 1 1 (z i) Sice g 1, g 2 S, by the Mea Value Theorem, we have h 1 1 h 2(x i ) x i M 2m+4 (1.1) z 1 z 1 < M 2m+4 (1.1) 1 (1.9) Sice m is fixed, for sufficietly big we obtai that h 1 1 h 2(x i ) x i < ɛ. The h 1 1 h 2(x) x < 2ɛ for all x [0, 1].

7 for all g 1, g 2 S (2) g 1, g 2 S (2), x [0, 1]. Agai, if g 1 W (p) g 2 W (p) for some the we are doe, otherwise we cotiue the process as S (k) are chose ad g 1 W (p), the we choose follows: if the sets S S (1) g 2 W (p) for all g 1, g 2 S (k) S (k+1) {U(α, β)g g S (k), U(α, β) is a positive word i α, β of legth.} such that S (k+1) > (2 c k+1 ), ad for all g 1, g 2 S (k+1), g 1 W (x) g 2 W (x) < 1 (1.9), x {x i 1 i N 1} {p}. Sice Γ belogs to the class Φ diff the process will stop after fiitely may steps, ad we will obtai a elemet ω with orm less tha 2ɛ such that ω(p) p Weak Trasitivity I this sectio we prove Propositio 1.7 ad the Propositio 1.8. First, we eed the followig lemma which follows immedaitely from the defiitio of Γ f. Lemma 3.1. Let Γ be a fiitely geerated irreducible subgroup of the class Φ diff, f be the biggest geerator of Γ with at least oe fixed poit, z = mi F ix(f), ad ω(z) > z for some ω Γ f. The there exists ɛ > 0 such that if 0 < a < b < ɛ, f p (a) < b for some p 4, the, for sufficietly big, f p 4 (ωf ω 1 (a)) < ωf ω 1 (b). Proof of Propositio 1.7. Let Γ be a irreducible o-affie subgroup of Φ diff, g Γ, ad 0 < p 1 < < p k < 1. We may assume that Γ is fiitely geerated. The, let f be the biggest geerator of Γ. Without loss of geerality we may also assume that f has at least oe fixed poit ad mi F ix(f) < p 1. By dyamical 1-trasitivity (i.e. Propositio 1.6), there exist elemets ω 1,..., ω k Γ f such that mi F ix(η i ) (p i, p i+1 ), 1 i k where η i = ω i... ω 1 fω ω 1 i. We ca choose q 4k such that f q (x) > g(x) for all x (0, 1 mi F ix(f)). 2 Now, applyig Lemma 3.1 iductively, for sufficietly small ɛ > 0 ad sufficietly big, we obtai that f 4q 4 (η 1 (x)) < η 1 (y), for all x, y (0, ɛ) where f 4q (x) < y

8 8 f 4q 8 (η 2 (p 1 ) < η 2 (p 2 ),... f 4q 4i (η i (p j ) < η i (p j+1 ), 1 j i 1 f 4q 4k (η k (p j)) < η k (p j+1), 1 j k 1. Thus it suffices to take γ = η, ad we obtai that k... γ(p j 1 ) < f q (γ(p j )) < γ(p j+1 ), 1 j k 1 where we assume p 0 = 1. The, we have γ(p j 1 ) < g(γ(p j )) < γ(p j+1 ), 1 j k 1. Now we are ready to prove Propositio 1.8. Let Γ be a fiitely geerated irreducible o-affie subgroup of Homeo + (I). Let S = {f 1,..., f s } be a geeratig set of Γ such that S S 1 = (i particular, S does ot cotai the idetity elemet), f be the biggest geerator of S S 1, ad let also m 10s. By the defiitio of the order, there exists ɛ > 0 such that f(x) ξ(x) for all x (0, ɛ), ξ S S 1. By Propositio 1.9 we ca choose g Γ such that F ix(g) > 8m. Sice Γ is irreducible by local trasitivity ad weak trasitivity, we ca fid h Γ ad ɛ > 0 such that the followig coditios hold: (i) γ(spa(hgh 1 )) (0, ɛ) for all γ B 2m (1), (ii) if F ix(hgh 1 ) = {p 1,..., p k } the p i 1 < f 2m (p i ) < p i+1, 2 i k 1. (iii) F ix(f i ) {p 1,..., p k } =, for all i {1,..., s}. Now, let θ = hgh 1 ad Let also S = {θ, θ m f 1 θ m, θ 2m f 2 θ 2m,..., θ sm f s θ sm }. δ = 1 5 mi{p i+1 p i 1 i k 1} ad V = (p i δ, p i + δ). 2 i k 1

9 We ow let x = p j+p j+1 where j = [ k ]. The x / V, ad for a 2 2 sufficietly big, by a stadard pig-pog argumet, for ay otrivial word W i the alphahbet S of legth at most m, we obtai that W (x) V, hece W (x) x. Sice m is arbitrary, we coclude that girth(γ) =. 9 Refereces 1. Akhmedov A. A weak Zassehaus lemma for subgroups of Diff(I). Algebraic ad Geometric Topology. vol.14 (2014) Akhmedov A. Extesio of Hölder s Theorem i Diff 1+ɛ + (I). Ergodic Theory ad Dyamical Systems, to appear Akhmedov, A. O groups of diffeomorphism of the iterval with fiitely may fixed poits I. 4. Akhmedov, A. Girth Alterative for subgroups of P L o (I). Preprit Akhmedov, A. O the height of subgroups of Homeo + (I), Joural of Group Theory, 18, o.1, (2015) Navas, A. Groups, Orders ad Laws. To appear i Groups, Geometry, Dyamics Navas, A. Groups of Circle Diffemorphisms. Chicago Lectures i Mathematics, Azer Akhmedov, Departmet of Mathematics, North Dakota State Uiversity, Fargo, ND, 58102, USA address: azer.akhmedov@dsu.edu

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS EDUARD KONTOROVICH Abstract. I this work we uify ad geeralize some results about chaos ad sesitivity. Date: March 1, 005. 1 1. Symbolic Dyamics Defiitio

More information

Sequences and Series of Functions

Sequences 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 information

EXTENSION OF HÖLDER S THEOREM IN Diff 1+ɛ

EXTENSION OF HÖLDER S THEOREM IN Diff 1+ɛ EXTENSION OF HÖLDER S THEOREM IN Diff 1+ɛ + (I) Azer Akhmedov Abstract: We prove that if Γ is subgroup of Diff 1+ɛ + (I) and N is a natural number such that every non-identity element of Γ has at most

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

On groups of diffeomorphisms of the interval with finitely many fixed points I. Azer Akhmedov

On groups of diffeomorphisms of the interval with finitely many fixed points I. Azer Akhmedov On groups of diffeomorphisms of the interval with finitely many fixed points I Azer Akhmedov Abstract: We strengthen the results of [1], consequently, we improve the claims of [2] obtaining the best possible

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence 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 information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product 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 information

A Proof of Birkhoff s Ergodic Theorem

A 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 information

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1 Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity

More information

PRELIM PROBLEM SOLUTIONS

PRELIM 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 information

Metric Space Properties

Metric 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 information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

Assignment 5: Solutions

Assignment 5: Solutions McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece

More information

Lecture Notes for Analysis Class

Lecture 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 information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Math 341 Lecture #31 6.5: Power Series

Math 341 Lecture #31 6.5: Power Series Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series

More information

Lecture 2. The Lovász Local Lemma

Lecture 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 information

BIRKHOFF ERGODIC THEOREM

BIRKHOFF ERGODIC THEOREM BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give

More information

The Boolean Ring of Intervals

The 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 information

lim za n n = z lim a n n.

lim 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 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

(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 information

Infinite Sequences and Series

Infinite 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 information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 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 information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

On the behavior at infinity of an integrable function

On the behavior at infinity of an integrable function O the behavior at ifiity of a itegrable fuctio Emmauel Lesige To cite this versio: Emmauel Lesige. O the behavior at ifiity of a itegrable fuctio. The America Mathematical Mothly, 200, 7 (2), pp.75-8.

More information

Math F215: Induction April 7, 2013

Math 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 information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

Ma 530 Introduction to Power Series

Ma 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 information

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >

More information

(for homogeneous primes P ) defining global complex algebraic geometry. Definition: (a) A subset V CP n is algebraic if there is a homogeneous

(for homogeneous primes P ) defining global complex algebraic geometry. Definition: (a) A subset V CP n is algebraic if there is a homogeneous Math 6130 Notes. Fall 2002. 4. Projective Varieties ad their Sheaves of Regular Fuctios. These are the geometric objects associated to the graded domais: C[x 0,x 1,..., x ]/P (for homogeeous primes P )

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

MA131 - Analysis 1. Workbook 10 Series IV

MA131 - Analysis 1. Workbook 10 Series IV MA131 - Aalysis 1 Workbook 10 Series IV Autum 2004 Cotets 4.19 Rearragemets of Series...................... 1 4.19 Rearragemets of Series If you take ay fiite set of umbers ad rearrage their order, their

More information

1+x 1 + α+x. x = 2(α x2 ) 1+x

1+x 1 + α+x. x = 2(α x2 ) 1+x Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem

More information

Relations Among Algebras

Relations Among Algebras Itroductio to leee Algebra Lecture 6 CS786 Sprig 2004 February 9, 2004 Relatios Amog Algebras The otio of free algebra described i the previous lecture is a example of a more geeral pheomeo called adjuctio.

More information

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

Random 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 information

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size. Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure

More information

A REMARK ON A PROBLEM OF KLEE

A REMARK ON A PROBLEM OF KLEE C O L L O Q U I U M M A T H E M A T I C U M VOL. 71 1996 NO. 1 A REMARK ON A PROBLEM OF KLEE BY N. J. K A L T O N (COLUMBIA, MISSOURI) AND N. T. P E C K (URBANA, ILLINOIS) This paper treats a property

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece

More information

Lecture XVI - Lifting of paths and homotopies

Lecture XVI - Lifting of paths and homotopies Lecture XVI - Liftig of paths ad homotopies I the last lecture we discussed the liftig problem ad proved that the lift if it exists is uiquely determied by its value at oe poit. I this lecture we shall

More information

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES.

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES. ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES. ANDREW SALCH 1. The Jacobia criterio for osigularity. You have probably oticed by ow that some poits o varieties are smooth i a sese somethig

More information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

More information

2.4 Sequences, Sequences of Sets

2.4 Sequences, Sequences of Sets 72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each

More information

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

University 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 information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 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 information

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

Advanced 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 information

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

M17 MAT25-21 HOMEWORK 5 SOLUTIONS M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series

More information

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F. CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

Notes for Lecture 11

Notes for Lecture 11 U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

LECTURE 11: POSTNIKOV AND WHITEHEAD TOWERS

LECTURE 11: POSTNIKOV AND WHITEHEAD TOWERS LECTURE 11: POSTNIKOV AND WHITEHEAD TOWERS I the previous sectio we used the techique of adjoiig cells i order to costruct CW approximatios for arbitrary spaces Here we will see that the same techique

More information

Entropy Rates and Asymptotic Equipartition

Entropy Rates and Asymptotic Equipartition Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

Character rigidity for lattices and commensurators I after Creutz-Peterson

Character rigidity for lattices and commensurators I after Creutz-Peterson Character rigidity for lattices ad commesurators I after Creutz-Peterso Talk C3 for the Arbeitsgemeischaft o Superridigity held i MFO Oberwolfach, 31st March - 4th April 2014 1 Sve Raum 1 Itroductio The

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 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 information

Integrable 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

Integrable 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 information

Sequences, Series, and All That

Sequences, Series, and All That Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3

More information

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

More information

Appendix to Quicksort Asymptotics

Appendix to Quicksort Asymptotics Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

AN ARC-LIKE CONTINUUM THAT ADMITS A HOMEOMORPHISM WITH ENTROPY FOR ANY GIVEN VALUE

AN ARC-LIKE CONTINUUM THAT ADMITS A HOMEOMORPHISM WITH ENTROPY FOR ANY GIVEN VALUE AN ARC-LIKE CONTINUUM THAT ADMITS A HOMEOMORPHISM WITH ENTROPY FOR ANY GIVEN VALUE CHRISTOPHER MOURON Abstract. A arc-like cotiuum X is costructed with the followig properties: () for every ɛ [0, ] there

More information

Properties of Fuzzy Length on Fuzzy Set

Properties of Fuzzy Length on Fuzzy Set Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

TENSOR PRODUCTS AND PARTIAL TRACES

TENSOR PRODUCTS AND PARTIAL TRACES Lecture 2 TENSOR PRODUCTS AND PARTIAL TRACES Stéphae ATTAL Abstract This lecture cocers special aspects of Operator Theory which are of much use i Quatum Mechaics, i particular i the theory of Quatum Ope

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. 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 information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots. 15 Cubics, Quartics ad Polygos It is iterestig to chase through the argumets of 14 ad see how this affects solvig polyomial equatios i specific examples We make a global assumptio that the characteristic

More information

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

ON THE EXISTENCE OF E 0 -SEMIGROUPS

ON THE EXISTENCE OF E 0 -SEMIGROUPS O HE EXISECE OF E -SEMIGROUPS WILLIAM ARVESO Abstract. Product systems are the classifyig structures for semigroups of edomorphisms of B(H), i that two E -semigroups are cocycle cojugate iff their product

More information

2 Banach spaces and Hilbert spaces

2 Banach spaces and Hilbert spaces 2 Baach spaces ad Hilbert spaces Tryig to do aalysis i the ratioal umbers is difficult for example cosider the set {x Q : x 2 2}. This set is o-empty ad bouded above but does ot have a least upper boud

More information

Sequences. Notation. Convergence of a Sequence

Sequences. 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 information

6. Uniform distribution mod 1

6. Uniform distribution mod 1 6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which

More information

Some sufficient conditions of a given. series with rational terms converging to an irrational number or a transcdental number

Some sufficient conditions of a given. series with rational terms converging to an irrational number or a transcdental number Some sufficiet coditios of a give arxiv:0807.376v2 [math.nt] 8 Jul 2008 series with ratioal terms covergig to a irratioal umber or a trascdetal umber Yu Gao,Jiig Gao Shaghai Putuo college, Shaghai Jiaotog

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

Topological Folding of Locally Flat Banach Spaces

Topological Folding of Locally Flat Banach Spaces It. Joural of Math. Aalysis, Vol. 6, 0, o. 4, 007-06 Topological Foldig of Locally Flat aach Spaces E. M. El-Kholy *, El-Said R. Lashi ** ad Salama N. aoud ** *epartmet of Mathematics, Faculty of Sciece,

More information

ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS

ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX0000-0 ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS MARCH T. BOEDIHARDJO AND WILLIAM B. JOHNSON 2

More information

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.

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. 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 information

1 Lecture 2: Sequence, Series and power series (8/14/2012)

1 Lecture 2: Sequence, Series and power series (8/14/2012) Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim

More information

Law of the sum of Bernoulli random variables

Law of the sum of Bernoulli random variables Law of the sum of Beroulli radom variables Nicolas Chevallier Uiversité de Haute Alsace, 4, rue des frères Lumière 68093 Mulhouse icolas.chevallier@uha.fr December 006 Abstract Let be the set of all possible

More information

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

It 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 information

Pairs of disjoint q-element subsets far from each other

Pairs of disjoint q-element subsets far from each other Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd

More information

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

The minimum value and the L 1 norm of the Dirichlet kernel The miimum value ad the L orm of the Dirichlet kerel For each positive iteger, defie the fuctio D (θ + ( cos θ + cos θ + + cos θ e iθ + + e iθ + e iθ + e + e iθ + e iθ + + e iθ which we call the (th Dirichlet

More information

Analytic Continuation

Analytic 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 information

page Suppose that S 0, 1 1, 2.

page Suppose that S 0, 1 1, 2. page 10 1. Suppose that S 0, 1 1,. a. What is the set of iterior poits of S? The set of iterior poits of S is 0, 1 1,. b. Give that U is the set of iterior poits of S, evaluate U. 0, 1 1, 0, 1 1, S. The

More information

Mathematical Induction

Mathematical 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 information

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials

More information

Sequences and Series

Sequences and Series Sequeces ad Series Sequeces of real umbers. Real umber system We are familiar with atural umbers ad to some extet the ratioal umbers. While fidig roots of algebraic equatios we see that ratioal umbers

More information

Solutions to Tutorial 5 (Week 6)

Solutions to Tutorial 5 (Week 6) The Uiversity of Sydey School of Mathematics ad Statistics Solutios to Tutorial 5 (Wee 6 MATH2962: Real ad Complex Aalysis (Advaced Semester, 207 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/

More information

Resolution Proofs of Generalized Pigeonhole Principles

Resolution Proofs of Generalized Pigeonhole Principles Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity

More information

Autocommutator Subgroups of Finite Groups

Autocommutator Subgroups of Finite Groups JOURNAL OF ALGEBRA 90, 556562 997 ARTICLE NO. JA96692 Autocommutator Subgroups of Fiite Groups Peter V. Hegarty Departmet of Mathematics, Priceto Uiersity, Priceto, New Jersey 08544 Commuicated by Gordo

More information

Solutions to home assignments (sketches)

Solutions to home assignments (sketches) Matematiska Istitutioe Peter Kumli 26th May 2004 TMA401 Fuctioal Aalysis MAN670 Applied Fuctioal Aalysis 4th quarter 2003/2004 All documet cocerig the course ca be foud o the course home page: http://www.math.chalmers.se/math/grudutb/cth/tma401/

More information

The log-behavior of n p(n) and n p(n)/n

The 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