Rademacher functions
|
|
- Edmund Lester
- 6 years ago
- Views:
Transcription
1 Rademacher functions Jordan Bell Department of Mathematics, University of Toronto July 6, 4 Binary expansions Define S : {, } N [, ] by Sσ σ k k, σ {, }N. For example, for σ and σ, σ 3,..., for σ and σ, σ 3,..., Sσ ; Sσ Let σ {, } N. If there is some n N such that σ n and σ k for all k n +, then defining σ k k n τ k k n k n, we have Sσ n σ k k + kn+ n k σ k k + n Sτ. One proves that if either i there is some n N such that σ n and σ k for all k n + or ii there is some n N such that σ n and σ k for all k n +, then S Sσ contains exactly two elements, and that otherwise S Sσ contains exactly one element. In words, except for the sequence whose terms are only or the sequence whose terms are only, S Sσ contains exactly two elements when σ is
2 eventually or eventually, and S Sσ contains exactly one element otherwise. We define ɛ : [, ] {, } N by taking ɛt to be the unique element of S t if S t contains exactly one element, and to be the element of S t that is eventually if S t contains exactly two elements. For k N we define ɛ k : [, ] {, } by ɛ k t ɛt k, t [, ]. Then, for all t [, ], t Sɛt which we call the binary expansion of t. Rademacher functions ɛ k t k, For k N, the kth Rademacher function r k : [, ] {, +} is defined by r k t ɛ k t, t [, ]. We can rewrite the binary expansion of t [, ] in as r k t k Define r : R {, +} by k ɛkt k rx [x], ɛ k t k t. where [x] denotes the greatest integer x. Thus, for x < we have rx, for x < we have rx, and r has period. Lemma. For any n N, r n t [n t] r n t, t [, ] In the following theorem we use the Rademacher functions to prove an identity for trigonometric functions. Theorem. For any nonzero real x, 3. cos x k sin x x. Mark Kac, Statistical Independence in Probability, Analysis and Number Theory, p. 4,
3 Proof. Let n N and let c,..., c n R. The function c k r k is constant on each of the intervals [ s n, s + n, s n. 3 There is a bijection between n {, +} n and the collection of intervals 3. Without explicitly describing this bijection, we have giving exp We have i c k r k t dt exp e ix t dt e i n s s+ n s n exp n exp i δ n δ n e iδ kc k e ic k + e ic k, c k r k t dt ix ix e ixt i c k r k t dt δ k c k cos c k. 4 r k t k converges uni- Using we check that the sequence of functions n formly on [, ] to t, and hence using 5 we get r k t exp ix k dt e e ix ix ix + sin x ix x. 5 e ix t dt sin x x as n. Combining this with 4, which we apply with c k x k, we get as n, proving the claim. cos x k sin x x 3
4 We now give an explicit formula for the measure of those t for which exactly l of r t,..., r n t are equal to. We denote by µ Lebesgue measure on R. We can interpret the following formula as stating the probability that out of n tosses of a coin, exactly l of the outcomes are heads. Theorem 3. For n N and l n, µ{t [, ] : r t + + r n t l n} n n. l Proof. Define φ : [, ] R by But for m Z, hence Therefore { µ t [, ] : φt π π π φt π e ix l n+ n r kt dx e imx dx δ m, { } r k t l n { m m, n r kt l n n r kt l n. π π φtdt π π π π 6 e ix l n+ n r kt dxdt e ixl n e ixl n cos n xdx; e ix n r kt dtdx the last equality uses 4 with c x,..., c n x. Furthermore, writing cos n x n e ix + e ix n n k n e ixk n, k Mark Kac, Statistical Independence in Probability, Analysis and Number Theory, pp
5 we calculate using 6 that π π proving the claim. n n e ixl n cos n xdx n e ixl n e ixk n dx k π k n n n e ixk l dx k π k n n n δ k l, k k n n n δ k,l k k n n, l We now prove that the expected value of a product of distinct Rademacher functions is equal to the product of their expected values. 3 Theorem 4. If k,..., k n are positive integers and k < < k n, then r k t r kn tdt. Proof. Write J r k t r kn tdt and define which satisfies φx + φx r ks k x, x R, s r ks k x + ks k s r ks k x φx. 3 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 85, Solution 3.. s 5
6 Hence, as φ has period and r has period, But, as φ has period, rxφxdx J k k k r k tφ k tdt r k tφ k tdt φxdx hence J, proving the claim. k k j k j rxφxdx j+ j rxφxdx. φxdx rxφxdx rxφxdx φxdx For each n N, if f is a function defined on the integers we define n I n f f r k t dt. Lemma 5. For any n N, Proof. Using Theorem 4 we get I n x n, I n x 4 3n n. I n x n. n r k t dt r k t + j k r k t dt r j tr k tdt φxdx, 6
7 Using Theorem 4 we get, since r j t 4 r j t and r j t 3 r j t, n 4 I n x 4 r k t dt r k t n + j j, k, l all distinct j, k, l, m all distinct 4 n + nn. n r j t 3 r k t + j k j r j t r k tr l t r j tr k tr l tr m tdt 4 n r j t r k t j k j Our proof of the next identity follows Hata. 4 Lemma 6. For any n N, I n x π cos n x x dx. Proof. For n N and c,..., c n R, n exp i c k r k t dt cos c k r k t dt+i n sin c k r k t dt, and since 4 tells us that the left-hand side of the above is real, it follows that we can write 4 as n cos c k r k t dt cos c k. 7 Suppose that ξ is a positive real number. Using t xξ and doing integration by parts, cos xξ cos t x dx ξ t dt ξ cos t t ξ ξ π. sin t dt t + ξ sin t dt t 4 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 88, Solution
8 It is thus apparent that for any real ξ, cos xξ x dx ξ π. For any n N, applying the above with ξ n r kt we get I n x π r k t π dt π π π x cos x n r kt x dxdt cos x r k t dtdx x I ncos x dx. Applying 7 with c k x for each k, this is equal to π x cos x dx cos n x π x dx, completing the proof. We use the above formula for I n x to obtain an asymptotic formula for I n x. 5 Theorem 7. Proof. By Lemma 6, I n x n. π I n x π For ɛ <, define φ ɛ : [, π R by φ ɛ x cos n x x dx. x + log cos x. ɛ We also define α ɛ arccos ɛ, β ɛ α ɛ cos n x x dx, 5 Mark Kac, Statistical Independence in Probability, Analysis and Number Theory, p., Masayoshi Hata, Problems and Solutions in Real Analysis, p. 88, Solution
9 and for σ >, K ɛ,σ αɛ exp x nx σ Let < ɛ <. Until the end of the proof, at which point we take ɛ, we shall keep ɛ fixed. For < x < α ɛ we have, using arccos ɛ ɛ, hence φ x x + log cos x < ɛ + log ɛ ɛ + log ɛ <, On the other hand, φ ɛx cos x < exp x. dx. x tan x, φ ɛ x ɛ ɛ sec x, so φ ɛ φ ɛ and φ ɛ t > for all t < α ɛ, giving and hence φ ɛ x >, exp x < cos x. ɛ Collecting what we have established so far, for < x < α ɛ we have exp x < cos x < exp x. ɛ This shows that and therefore K ɛ, ɛ On the other hand, so K ɛ, αɛ αɛ exp nx αɛ ɛ x dx K ɛ, ɛ + β ɛ π I n x. exp x nx dx αɛ K ɛ, + β ɛ π I n x. Now summarizing what we have obtained, we have cos n x x dx, cos n x x dx, K ɛ, + β ɛ π I n x K ɛ, ɛ + β ɛ. 8 9
10 For σ >, doing the change of variable t n σ x, αɛ exp K ɛ,σ nx σ x dx n n σ αɛ σ As n, the right-hand side of this is asymptotic to n e t n σ t dt π. σ Dividing 8 by n and taking the limsup then gives π I n x π lim sup n n ɛ, or lim sup n indeed β ɛ depends on n, but β ɛ < ɛ yields lim sup n I n x n π ɛ ; e t dt. α ɛ, which does not depend on n. Taking I n x n π. On the other hand, taking the liminf of 8 divided by n gives π I n x π lim inf n n, or lim inf n I n x n π. Combining the limsup and the liminf inequalities proves the claim. Lemma 8. For any ξ R and n N, I n e ξ x < I n e ξx + I n e ξx cosh ξ n. t We will use the following theorem to establish an estimate similar to but weaker than the law of the iterated logarithm. 6 Theorem 9. For any ɛ >, for almost all t [, ], log n exp n+ɛ r k t dt <. n n 6 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 89, Solution 3.7.
11 Proof. Define f n : [, ], by f n t log n exp n+ɛ r k t. n Applying Lemma 8 with ξ log n n, f n tdt n +ɛ cosh n log n. It is not obvious, but we take as given the asymptotic expansion n log n cosh n 8 n 3 log n 45 + log n3 + 8 log n4 + On 3/, n and using this, n log n n +ɛ cosh log n n n +ɛ + O n +ɛ Thus n f n tdt n n n +ɛ + On <. n +ɛ + On. Because each f n is nonnegative, using this with the monotone convergence theorem gives the claim. Theorem. For almost all t [, ], lim sup n n r kt n log n. Proof. Let ɛ >. By Theorem 9, for almost all t [, ] there is some n t such that n n t implies that f n t <, where we are talking about the functions f n defined in the proof of that theorem; certainly the terms of a convergent series are eventually less than. That is, for almost all t [, ] there is some n t such that n n t implies that taking logarithms, log n ɛ log n + r k t n <, and rearranging, n r kt n log n < + ɛ + ɛ. For each s N, let E s be those t [, ] such that lim sup n n r kt n log n > + s.
12 For each s, taking < ɛ < s we get that almost all t [, ] do not belong to E s. That is, for each s, the set E s has measure. Therefore E s has measure. That is, for almost all t [, ], for all s N we have t E s, i.e. n lim sup r kt + n n log n s, and this holding for all s N yields completing the proof. 3 Hypercubes lim sup n E s n r kt n log n, Let m n be Lebesgue measure on R n, and let Q n [, ] n. 7 Theorem. If f C[, ], then x + + x n lim f n Q n n Proof. Define X n : Q n R by dm n x f. We have X n x + + x n, x Q n. n Q n X n dm n x n x k dx k n, 7 Masayoshi Hata, Problems and Solutions in Real Analysis, p. 6, Solution..
13 and we define V n Q n X n dm n x Q n n n n n x k n + x j x k n X n + 4 dm nx j k 3 + n 3n + n 4n 4 n. x kdx k + n j k j n j k j 4 4 x j dx j x k dx k + 4 Suppose that c n is a sequence of positive real numbers tending to, and define J n J n c to be those x Q n such that X nx c n. Then V n Q n X n dm n x X n dm n x J n c ndm n x J n c nm n J n, so Take c n n /3, giving m n J n V n c n n c. n m n J n n /3. Let ɛ >. Because f is continuous, there is some δ > such that t < δ implies that ft f < ɛ; furthermore, we take δ such that f δ 6 < ɛ. 3
14 Set N > δ 3. For n N and x Q n \ J n, X nx < c n n /3 N /3 < δ, and so This gives us fx n xdm n x f Q n which proves the claim. fx n x f < ɛ. fx n x f dm n x Q n fx nx f dm n x J n + fx nx f dm n x Q n\j n f dm n x + ɛdm n x J n Q n\j n f m n J n + ɛ n /3 f + ɛ < f δ + ɛ 6 < ɛ, 4
The Lindeberg central limit theorem
The Lindeberg central limit theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto May 29, 205 Convergence in distribution We denote by P d the collection of Borel probability
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More informationMath 172 HW 1 Solutions
Math 172 HW 1 Solutions Joey Zou April 15, 2017 Problem 1: Prove that the Cantor set C constructed in the text is totally disconnected and perfect. In other words, given two distinct points x, y C, there
More informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
More informationA proof of a partition conjecture of Bateman and Erdős
proof of a partition conjecture of Bateman and Erdős Jason P. Bell Department of Mathematics University of California, San Diego La Jolla C, 92093-0112. US jbell@math.ucsd.edu 1 Proposed Running Head:
More informationW. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES
F A S C I C U L I M A T H E M A T I C I Nr 55 5 DOI:.55/fascmath-5-7 W. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES Abstract. The results
More informationNORMS OF PRODUCTS OF SINES. A trigonometric polynomial of degree n is an expression of the form. c k e ikt, c k C.
L NORMS OF PRODUCTS OF SINES JORDAN BELL Abstract Product of sines Summary of paper and motivate it Partly a survey of L p norms of trigonometric polynomials and exponential sums There are no introductory
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationFrom Calculus II: An infinite series is an expression of the form
MATH 3333 INTERMEDIATE ANALYSIS BLECHER NOTES 75 8. Infinite series of numbers From Calculus II: An infinite series is an expression of the form = a m + a m+ + a m+2 + ( ) Let us call this expression (*).
More informationThe Kolmogorov continuity theorem, Hölder continuity, and the Kolmogorov-Chentsov theorem
The Kolmogorov continuity theorem, Hölder continuity, and the Kolmogorov-Chentsov theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 11, 2015 1 Modifications
More informationMetric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg
Metric Spaces Exercises Fall 2017 Lecturer: Viveka Erlandsson Written by M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK 1 Exercises. 1. Let X be a non-empty set, and suppose
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationEntrance Exam, Real Analysis September 1, 2017 Solve exactly 6 out of the 8 problems
September, 27 Solve exactly 6 out of the 8 problems. Prove by denition (in ɛ δ language) that f(x) = + x 2 is uniformly continuous in (, ). Is f(x) uniformly continuous in (, )? Prove your conclusion.
More informationBernstein s inequality and Nikolsky s inequality for R d
Bernstein s inequality and Nikolsky s inequality for d Jordan Bell jordan.bell@gmail.com Department of athematics University of Toronto February 6 25 Complex Borel measures and the Fourier transform Let
More informationLecture I: Asymptotics for large GUE random matrices
Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationExercises. T 2T. e ita φ(t)dt.
Exercises. Set #. Construct an example of a sequence of probability measures P n on R which converge weakly to a probability measure P but so that the first moments m,n = xdp n do not converge to m = xdp.
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationCharacteristic Functions and the Central Limit Theorem
Chapter 6 Characteristic Functions and the Central Limit Theorem 6.1 Characteristic Functions 6.1.1 Transforms and Characteristic Functions. There are several transforms or generating functions used in
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationQF101: Quantitative Finance August 22, Week 1: Functions. Facilitator: Christopher Ting AY 2017/2018
QF101: Quantitative Finance August 22, 2017 Week 1: Functions Facilitator: Christopher Ting AY 2017/2018 The chief function of the body is to carry the brain around. Thomas A. Edison 1.1 What is a function?
More informationINTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES
INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES You will be expected to reread and digest these typed notes after class, line by line, trying to follow why the line is true, for example how it
More informationSolutions: Problem Set 4 Math 201B, Winter 2007
Solutions: Problem Set 4 Math 2B, Winter 27 Problem. (a Define f : by { x /2 if < x
More informationSequences and Series
CHAPTER Sequences and Series.. Convergence of Sequences.. Sequences Definition. Suppose that fa n g n= is a sequence. We say that lim a n = L; if for every ">0 there is an N>0 so that whenever n>n;ja n
More informationFall TMA4145 Linear Methods. Solutions to exercise set 9. 1 Let X be a Hilbert space and T a bounded linear operator on X.
TMA445 Linear Methods Fall 26 Norwegian University of Science and Technology Department of Mathematical Sciences Solutions to exercise set 9 Let X be a Hilbert space and T a bounded linear operator on
More informationMATH115. Infinite Series. Paolo Lorenzo Bautista. July 17, De La Salle University. PLBautista (DLSU) MATH115 July 17, / 43
MATH115 Infinite Series Paolo Lorenzo Bautista De La Salle University July 17, 2014 PLBautista (DLSU) MATH115 July 17, 2014 1 / 43 Infinite Series Definition If {u n } is a sequence and s n = u 1 + u 2
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationLecture Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
More informationCompact operators on Banach spaces
Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact
More informationSec 4.1 Limits, Informally. When we calculated f (x), we first started with the difference quotient. f(x + h) f(x) h
1 Sec 4.1 Limits, Informally When we calculated f (x), we first started with the difference quotient f(x + h) f(x) h and made h small. In other words, f (x) is the number f(x+h) f(x) approaches as h gets
More informationHausdorff measure. Jordan Bell Department of Mathematics, University of Toronto. October 29, 2014
Hausdorff measure Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto October 29, 2014 1 Outer measures and metric outer measures Suppose that X is a set. A function ν :
More information1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.
Advanced Calculus I, Dr. Block, Chapter 2 notes. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x. 2. Definition. A sequence is a real-valued function
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationChapter 4. The dominated convergence theorem and applications
Chapter 4. The dominated convergence theorem and applications The Monotone Covergence theorem is one of a number of key theorems alllowing one to exchange limits and [Lebesgue] integrals (or derivatives
More informationChapter 1. Sets and probability. 1.3 Probability space
Random processes - Chapter 1. Sets and probability 1 Random processes Chapter 1. Sets and probability 1.3 Probability space 1.3 Probability space Random processes - Chapter 1. Sets and probability 2 Probability
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Awards Screening Test. February 25, Time Allowed: 90 Minutes Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Awards Screening Test February 25, 2006 Time Allowed: 90 Minutes Maximum Marks: 40 Please read, carefully, the instructions on the following page before you
More informationSolutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa
1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such
More informationProbability and Measure
Probability and Measure Robert L. Wolpert Institute of Statistics and Decision Sciences Duke University, Durham, NC, USA Convergence of Random Variables 1. Convergence Concepts 1.1. Convergence of Real
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
More informationMath 141: Lecture 11
Math 141: Lecture 11 The Fundamental Theorem of Calculus and integration methods Bob Hough October 12, 2016 Bob Hough Math 141: Lecture 11 October 12, 2016 1 / 36 First Fundamental Theorem of Calculus
More informationMATH 6337 Second Midterm April 1, 2014
You can use your book and notes. No laptop or wireless devices allowed. Write clearly and try to make your arguments as linear and simple as possible. The complete solution of one exercise will be considered
More informationSequences and Series of Functions
Chapter 13 Sequences and Series of Functions These notes are based on the notes A Teacher s Guide to Calculus by Dr. Louis Talman. The treatment of power series that we find in most of today s elementary
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationREAL VARIABLES: PROBLEM SET 1. = x limsup E k
REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E
More informationMath212a1413 The Lebesgue integral.
Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the
More informationSeries Solution of Linear Ordinary Differential Equations
Series Solution of Linear Ordinary Differential Equations Department of Mathematics IIT Guwahati Aim: To study methods for determining series expansions for solutions to linear ODE with variable coefficients.
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationCalculus II Practice Test Problems for Chapter 7 Page 1 of 6
Calculus II Practice Test Problems for Chapter 7 Page of 6 This is a set of practice test problems for Chapter 7. This is in no way an inclusive set of problems there can be other types of problems on
More informationApproximation by weighted polynomials
Approximation by weighted polynomials David Benko Abstract It is proven that if xq (x) is increasing on (, + ) and w(x) = exp( Q) is the corresponding weight on [, + ), then every continuous function that
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationMarkov operators acting on Polish spaces
ANNALES POLONICI MATHEMATICI LVII.31997) Markov operators acting on Polish spaces by Tomasz Szarek Katowice) Abstract. We prove a new sufficient condition for the asymptotic stability of Markov operators
More informationFourth Week: Lectures 10-12
Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore
More informationTHE LAW OF THE ITERATED LOGARITHM FOR TAIL SUMS SANTOSH GHIMIRE. M.Sc., Tribhuvan University, Nepal, 2001 M.S., Kansas State University, USA, 2008
THE LAW OF THE ITERATED LOGARITHM FOR TAIL SUMS by SANTOSH GHIMIRE MSc, Tribhuvan University, Nepal, 00 MS, Kansas State University, USA, 008 AN ABSTRACT OF A DISSERTATION submitted in partial fulfillment
More informationAsymptotic results for empirical measures of weighted sums of independent random variables
Asymptotic results for empirical measures of weighted sums of independent random variables B. Bercu and W. Bryc University Bordeaux 1, France Workshop on Limit Theorems, University Paris 1 Paris, January
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More informationLaw of the iterated logarithm for pure jump Lévy processes
Law of the iterated logarithm for pure jump Lévy processes Elena Shmileva, St.Petersburg Electrotechnical University July 12, 2010 limsup LIL, liminf LIL Let X (t), t (0, ) be a Lévy process. There are
More information2 2 + x =
Lecture 30: Power series A Power Series is a series of the form c n = c 0 + c 1 x + c x + c 3 x 3 +... where x is a variable, the c n s are constants called the coefficients of the series. n = 1 + x +
More information8.5 Taylor Polynomials and Taylor Series
8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:
More informationIntegral type Fixed point Theorems for α-admissible Mappings Satisfying α-ψ-φ-contractive Inequality
Filomat 3:12 (216, 3227 3234 DOI 1.2298/FIL1612227B Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Integral type Fixed point Theorems
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationExercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.
Real Variables, Fall 2014 Problem set 3 Solution suggestions xercise 1. Let f be a nonnegative measurable function. Show that f = sup ϕ, where ϕ is taken over all simple functions with ϕ f. For each n
More informationBernoulli polynomials
Bernoulli polynomials Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto February 2, 26 Bernoulli polynomials For k, the Bernoulli polynomial B k (x) is defined by ze xz
More informationf(x)dx = lim f n (x)dx.
Chapter 3 Lebesgue Integration 3.1 Introduction The concept of integration as a technique that both acts as an inverse to the operation of differentiation and also computes areas under curves goes back
More informationINTEGRABILITY CONDITIONS PERTAINING TO ORLICZ SPACE
INTEGRABILITY CONDITIONS PERTAINING TO ORLICZ SPACE L. LEINDLER University of Szeged, Bolyai Institute Aradi vértanúk tere 1, 6720 Szeged, Hungary EMail: leindler@math.u-szeged.hu Received: 04 September,
More informationMath 172 Problem Set 5 Solutions
Math 172 Problem Set 5 Solutions 2.4 Let E = {(t, x : < x b, x t b}. To prove integrability of g, first observe that b b b f(t b b g(x dx = dt t dx f(t t dtdx. x Next note that f(t/t χ E is a measurable
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationGeometry and Motion, MA 134 Week 1
Geometry and Motion, MA 134 Week 1 Mario J. Micallef Spring, 2007 Warning. These handouts are not intended to be complete lecture notes. They should be supplemented by your own notes and, importantly,
More informationProbability and Measure
Chapter 4 Probability and Measure 4.1 Introduction In this chapter we will examine probability theory from the measure theoretic perspective. The realisation that measure theory is the foundation of probability
More informationAdvanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x
. Define f n, g n : [, ] R by f n (x) = Advanced Calculus Math 27B, Winter 25 Solutions: Final nx2 + n 2 x, g n(x) = n2 x 2 + n 2 x. 2 Show that the sequences (f n ), (g n ) converge pointwise on [, ],
More informationChapter 8. Infinite Series
8.4 Series of Nonnegative Terms Chapter 8. Infinite Series 8.4 Series of Nonnegative Terms Note. Given a series we have two questions:. Does the series converge? 2. If it converges, what is its sum? Corollary
More information, but still n=0 b n = b n = 1 n 6 n k=1k 5 a k. sin(x 2 + ax)
Analysis SEP Summer 25 Problem. (a)suppose (a n ) n= is a sequence of nonnegative real numbers such that n= a n
More informationand monotonicity property of these means is proved. The related mean value theorems of Cauchy type are also given.
Rad HAZU Volume 515 013, 1-10 ON LOGARITHMIC CONVEXITY FOR GIACCARDI S DIFFERENCE J PEČARIĆ AND ATIQ UR REHMAN Abstract In this paper, the Giaccardi s difference is considered in some special cases By
More informationA List of Problems in Real Analysis
A List of Problems in Real Analysis W.Yessen & T.Ma December 3, 218 This document was first created by Will Yessen, who was a graduate student at UCI. Timmy Ma, who was also a graduate student at UCI,
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More informationOn the convergence of sequences of random variables: A primer
BCAM May 2012 1 On the convergence of sequences of random variables: A primer Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM May 2012 2 A sequence a :
More informationLecture 16 Symbolic dynamics.
Lecture 16 Symbolic dynamics. 1 Symbolic dynamics. The full shift on two letters and the Baker s transformation. 2 Shifts of finite type. 3 Directed multigraphs. 4 The zeta function. 5 Topological entropy.
More informationViscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces
Viscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces YUAN-HENG WANG Zhejiang Normal University Department of Mathematics Yingbing Road 688, 321004 Jinhua
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationWaiting times, recurrence times, ergodicity and quasiperiodic dynamics
Waiting times, recurrence times, ergodicity and quasiperiodic dynamics Dong Han Kim Department of Mathematics, The University of Suwon, Korea Scuola Normale Superiore, 22 Jan. 2009 Outline Dynamical Systems
More informationMATH 5640: Fourier Series
MATH 564: Fourier Series Hung Phan, UMass Lowell September, 8 Power Series A power series in the variable x is a series of the form a + a x + a x + = where the coefficients a, a,... are real or complex
More informationAPPROXIMATING CONTINUOUS FUNCTIONS: WEIERSTRASS, BERNSTEIN, AND RUNGE
APPROXIMATING CONTINUOUS FUNCTIONS: WEIERSTRASS, BERNSTEIN, AND RUNGE WILLIE WAI-YEUNG WONG. Introduction This set of notes is meant to describe some aspects of polynomial approximations to continuous
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson
JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises
More informationSome approximation theorems in Math 522. I. Approximations of continuous functions by smooth functions
Some approximation theorems in Math 522 I. Approximations of continuous functions by smooth functions The goal is to approximate continuous functions vanishing at ± by smooth functions. In a previous homewor
More informationCarefully tear this page off the rest of your exam. UNIVERSITY OF TORONTO SCARBOROUGH MATA37H3 : Calculus for Mathematical Sciences II
Carefully tear this page off the rest of your exam. UNIVERSITY OF TORONTO SCARBOROUGH MATA37H3 : Calculus for Mathematical Sciences II REFERENCE SHEET The (natural logarithm and exponential functions (
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More informationFourier Sin and Cos Series and Least Squares Convergence
Fourier and east Squares Convergence James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University May 7, 28 Outline et s look at the original Fourier sin
More informationNotes on Measure, Probability and Stochastic Processes. João Lopes Dias
Notes on Measure, Probability and Stochastic Processes João Lopes Dias Departamento de Matemática, ISEG, Universidade de Lisboa, Rua do Quelhas 6, 1200-781 Lisboa, Portugal E-mail address: jldias@iseg.ulisboa.pt
More informationStone-Čech compactification of Tychonoff spaces
The Stone-Čech compactification of Tychonoff spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 27, 2014 1 Completely regular spaces and Tychonoff spaces A topological
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationMemoirs on Differential Equations and Mathematical Physics
Memoirs on Differential Equations and Mathematical Physics Volume 34, 005, 1 76 A. Dzhishariani APPROXIMATE SOLUTION OF ONE CLASS OF SINGULAR INTEGRAL EQUATIONS BY MEANS OF PROJECTIVE AND PROJECTIVE-ITERATIVE
More informationThe Wiener algebra and Wiener s lemma
he Wiener algebra and Wiener s lemma Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of oronto January 17, 2015 1 Introduction Let = R/Z. For f L 1 () we define f L 1 () = 1 For
More informationEXAMINATION SOLUTIONS
1 Marks & (a) If f is continuous on (, ), then xf is continuously differentiable 5 on (,) and F = (xf)/x as well (as the quotient of two continuously differentiable functions with the denominator never
More informationHomework If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator.
Homework 3 1 If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator Solution: Assuming that the inverse of T were defined, then we will have to have that D(T 1
More informationANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2.
ANALYSIS QUALIFYING EXAM FALL 27: SOLUTIONS Problem. Determine, with justification, the it cos(nx) n 2 x 2 dx. Solution. For an integer n >, define g n : (, ) R by Also define g : (, ) R by g(x) = g n
More informationSolutions to Tutorial 11 (Week 12)
THE UIVERSITY OF SYDEY SCHOOL OF MATHEMATICS AD STATISTICS Solutions to Tutorial 11 (Week 12) MATH3969: Measure Theory and Fourier Analysis (Advanced) Semester 2, 2017 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/
More information