AN UNDERGRADUATE LECTURE ON THE CENTRAL LIMIT THEOREM
|
|
- Coral Daniel
- 5 years ago
- Views:
Transcription
1 AN UNDERGRADUATE LECTURE ON THE CENTRAL LIMIT THEOREM N.V. KRYLOV In the first section we explain why the central limit theorem for the binomial 1/2 distributions is natural. The second section contains the proof and the third section gives a refinement of our basic estimate. 1. Setting and motivation Let S n be the number of successes in n independent Bernoulli trials with success probability p = 1/2. First, one realizes that P (S n = k) = 2 n ( n k ) = 2 n n! k!(n k)!. (1) Then comes the observation that ES n = n/2, Var S n = n/4. This shows that the random variables (S n n/2)/ n are centered and have constant variance. One may hope that their distributions converge to something as n. In other words, one may hope that for any a < b P (a < (S n n/2)/ n b) (2) has a limit as n. Let us try to guess what the limit could be. Set Observe that y kn = n 1/2 (k n/2), k =, 1,..., n. y k+1,n = y kn + n 1/2, k = y kn n + n/2. P (S n = k) = P (n 1/2 (S n n/2) = y kn ) and, for each n, introduce a function so that f n (y kn ) = P (n 1/2 (S n n/2) = y kn ), f n (y kn ) = P (S n = k). 1
2 2 N.V. KRYLOV For k n 1 simple manipulations using (1) show that P (S n = k) = 2 n n! k + 1 (k + 1)!(n k 1)! n k, implying that f n (y kn ) = f n (y kn + n 1/2 ) y kn n + n/2 + 1, n/2 y kn n f n (y kn + n 1/2 n/2 y kn n ) = f n (y kn ), (3) f n (y kn + n 1/2 ) f n (y kn ) = f n (y kn ) ( n/2 y kn n 1 ) Next, the probability in (2) is 2y kn n + 1 = f n (y kn ). (4) k:a<y kn b f n (y kn ) and this sum contains roughly speaking (b a) n terms. Therefore, each term should be of order 1/ n. One way or another, let us believe that, for a function φ, as n and y kn y. For φ n equation (4) becomes φ n (y kn ) := nf n (y kn ) φ(y) φ n (y kn + n 1/2 2y kn n + 1 ) φ n (y kn ) = φ n (y kn ). (5) Let us pretend that (5) holds for φ rather than φ n and for all y in place of y kn rather than for y kn of a special form, that is φ(y + n 1/2 2y n + 1 ) φ(y ) = φ(y) y n + n/ Devide both parts by n 1/2 and let n to see that, naturally, φ n (y) should be close to a φ that is a solution of φ (y) = 4yφ(y). All solutions of the latter equation are known to be ce 2y2, and this is a way to explain why the normal distribution arises in this particular instance of the central limit theorem.
3 AN UNDERGRADUATE LECTURE ON THE CENTRAL LIMIT THEOREM 3 2. First rigorous resulat As above we assume that p = 1/2 and add the assumption that n is an even number. Theorem 1. Let β [1/2, 3/4] and n be even. Then for k n/2 n β (that is y kn n β 1/2 ) n e 2y2 kn fn (y kn ) = e O(n4β 3) = 1 + O(n 4β 3 ), (6) where c n = P (S n = n/2), y kn = (k n/2)n 1/2. Furthermore, lim c n n = 2/π, (7) and if β [1/2, 3/4), then lim max (nπ/2) 1/2 e 2y2 knp (Sn = k) 1 =. (8) k n/2 n β Finally, for any a, b (, ) such that a < b, lim P (a n S n n/2 b n) = 2/π b a e 2y2 dy. (9) Proof. To prove (6) it suffices to concentrate on k n/2 when y kn. Set g n (y kn ) = ln f n (y kn ), x kn = 2y kn n 1/2 = 2(k n/2)n 1 = 2k/n 1 and use (3) to get g n (y k+1,n ) g n (y kn ) = ln(1 x kn ) ln(1 + x k+1,n ) = x kn x k+1,n + (1/2)[x 2 k+1,n x 2 kn] (1/3)[ x 3 kn + x 3 k+1,n], (1) where x kn x kn, x k+1,n x k+1,n. For n/2 k n/2 + n β we have y kn n β 1/2, x kn 2n β 1 2, x 3 kn + x 3 k+1,n = O(n 3β 3 ), [x 2 i+1,n x 2 in] = x 2 k+1,n = O(n 2β 2 ) = O(n 4β 3 ), where we used that β 1/2. We also observe that (x in + x i+1,n ) = 4n 1 (i n/2) + 2n 1 1 = 2n 1 (k n/2)(k + 1 n/2) + 2n 1 (k + 1 n/2) = 2n 1 (k + 1 n/2) 2 = 2y 2 k+1,n.
4 4 N.V. KRYLOV Then we find that for n/2 k n/2 + n β g n (y k+1,n ) g n () = 2y 2 k+1,n + O(n 4β 3 ), n e 2y2 kn fn (y kn ) = e O(n4β 3) = 1 + O(n 4β 3 ), (11) which is (6). After this we focus on determining the behavior of c n as n. Rewrite (6) as n 1/2 n P (S n = k) = n 1/2 e 2y2 kn + O(n 4β 3.5 ) (12) and conclude that where lim n 1/2 n P ( S n n/2 n 3/5 ) = lim J n, (13) J n := n 1/2 Here by Chebyshev s inequality e 2y2 kn k: y kn n 1/1 1 P ( S n n/2 n 3/5 ) = 1 P ( S n n/2 n 3/5 ) 1 n 1/5, implying that lim P ( S n n/2 n 3/5 ) = 1, which along with (13) yields lim n 1/2 n = lim J n. (14) To find lim J n observe that for k n/2 we have e 2y2 kn e 2y 2 for y y kn, e 2y2 kn e 2y 2 for y k,n y. Therefore, for k > n/2 ykn y k 1,n e 2y2 dy n 1/2 e 2y2 kn yk+1,n Since we infer that ȳn J n = n 1/2 + 2 e 2y2 dy (J n n 1/2 )/2 y kn e 2y2 e 2y2 kn, k>n/2:y kn n 1/1 ȳn e 2y2 dy dy. n 1/2 e 2y2 dy, where ȳ n is the largest y kn such that y kn n 1/1. Obviously, ȳ n as n. This yields lim J n = 2 e 2y2 dy = π/2.
5 AN UNDERGRADUATE LECTURE ON THE CENTRAL LIMIT THEOREM 5 Upon combining this with (14) we come to (7). Now we can replace n 1/2 n in (13) with π/2 and by the definition of integral obtain that for any a, b (, ) such that a < b π/2 lim P (a n S n n/2 b n) = lim n 1/2 k:a y kn b This proves (9). Finally, we can rewrite (6) as b e 2y2 kn = e 2y2 dy. (nπ/2) 1/2 e 2y2 kn fn (y kn ) = e O(n4β 3) = d n + O(n 4β 3 ), where d n = c n (nπ/2) 1/2 1. Then (8) follows. The theorem is proved. a 3. A refinement of Theorem 1 One can improve (6) and (8). For β = 3/4 and y kn n 1/4 equation (6) only says that n e 2y2 kn fn (y kn ) is bounded without asserting that it converges to 1 as n. The following theorem implies, in particular, that n e 2y2 kn fn (y kn ) e 4c4 /3 if n, k = k n, and y kn n 1/4 c. The refinement comes from taking two more terms in Taylor s expansions in (16). Theorem 2. For β [1/2, 1) and k n/2 n β we have where e αn6β 5 n e 2y2 kn (1+2y2 kn /(3n)) P (S n = k) e αn2β 2, (15) α = 16/3 + ( )/5. In particular, if β [1/2, 5/6), then lim max k n/2 n β n e 2y2 kn (1+2y2 kn /(3n)) P (S n = k) 1 =. Furthermore, if β [3/4, 5/7), then lim cn 1 e 2y2 kn (1+2y2 kn /(3n)) P (S n = k) 1 =. k n/2 n β
6 6 N.V. KRYLOV Proof. It follows from (3) that g n (y k+1,n ) g n (y kn ) = ln(1 x kn ) ln(1 + x k+1,n ) = x kn x k+1,n + (1/2)[x 2 k+1,n x 2 kn] (1/3)[x 3 kn + x 3 k+1,n] +(1/4)[x 4 k+1,n x 4 k,n] (1/5)[ x 5 kn + x 5 k+1,n], (16) where x kn x kn, x k+1,n x k+1,n. For n/2 k n/2 + n β we have y kn n β 1/2, x kn 2n β 1, y k+1,n n β 1/2 + n 1/2 2n β 1/2, x k+1,n 4n β 1, x 5 kn + x 5 k+1,n ( )n 5β 5, [x 2 i+1,n x 2 in] = x 2 k+1,n 16n 2β 2. We also observe that [x 4 i+1,n x 4 in] = x 4 k+1,n 2 8 n 4β n 2β 2, k n/2 [x 3 kn + x 3 k+1,n] = 8n 3 i= k+1 n/2 i 3 + 8n 3 = 2n 3 (k n/2) 2 (k + 1 n/2) 2 + 2n 3 (k + 1 n/2) 2 (k + 2 n/2) 2 = 4n 1 yk+1,n[y 2 k+1,n 2 + n 1 ] = 4n 1 yk+1,n 4 + 4n 2 yk+1,n. 2 As a consequence 4n 1 yk+1,n 4 [x 3 kn + x 3 k+1,n] 4n 1 yk+1,n n 2β 3. Now upon summing up (16) with respect to k, we find that for n/2 k n/2 + n β g n (y k+1,n ) g n () 2y 2 k+1,n (4/3)n 1 y 4 k+1,n + 72n 2(β 1), g n (y k+1,n ) g n () 2yk+1,n 2 (4/3)n 1 yk+1,n 4 n 2β 3 16/3 n 6β 5 ( )/5 2yk+1,n 2 (4/3)n 1 yk+1,n 4 αn 6β 5, where we used that β 1/2. The above inequalities yield (15), that easily implies all other assertions of the theorem. The theorem is proved. i=1 i 3
Proving the central limit theorem
SOR3012: Stochastic Processes Proving the central limit theorem Gareth Tribello March 3, 2019 1 Purpose In the lectures and exercises we have learnt about the law of large numbers and the central limit
More informationCSE 103 Homework 8: Solutions November 30, var(x) = np(1 p) = P r( X ) 0.95 P r( X ) 0.
() () a. X is a binomial distribution with n = 000, p = /6 b. The expected value, variance, and standard deviation of X is: E(X) = np = 000 = 000 6 var(x) = np( p) = 000 5 6 666 stdev(x) = np( p) = 000
More informationLecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationSequences: Limit Theorems
Sequences: Limit Theorems Limit Theorems Philippe B. Laval KSU Today Philippe B. Laval (KSU) Limit Theorems Today 1 / 20 Introduction These limit theorems fall in two categories. 1 The first category deals
More informationRandom Graphs. EECS 126 (UC Berkeley) Spring 2019
Random Graphs EECS 126 (UC Bereley) Spring 2019 1 Introduction In this note, we will briefly introduce the subject of random graphs, also nown as Erdös-Rényi random graphs. Given a positive integer n and
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2017 Outline Geometric Series The
More informationMULTIPLYING TRINOMIALS
Name: Date: 1 Math 2 Variable Manipulation Part 4 Polynomials B MULTIPLYING TRINOMIALS Multiplying trinomials is the same process as multiplying binomials except for there are more terms to multiply than
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series
More informationCHAPTER 2 INFINITE SUMS (SERIES) Lecture Notes PART 1
CHAPTER 2 INFINITE SUMS (SERIES) Lecture Notes PART We extend now the notion of a finite sum Σ n k= a k to an INFINITE SUM which we write as Σ n= a n as follows. For a given a sequence {a n } n N {0},
More informationLimiting Distributions
Limiting Distributions We introduce the mode of convergence for a sequence of random variables, and discuss the convergence in probability and in distribution. The concept of convergence leads us to the
More informationMAS113 Introduction to Probability and Statistics
MAS113 Introduction to Probability and Statistics School of Mathematics and Statistics, University of Sheffield 2018 19 Identically distributed Suppose we have n random variables X 1, X 2,..., X n. Identically
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 informationLecture 3 - Expectation, inequalities and laws of large numbers
Lecture 3 - Expectation, inequalities and laws of large numbers Jan Bouda FI MU April 19, 2009 Jan Bouda (FI MU) Lecture 3 - Expectation, inequalities and laws of large numbersapril 19, 2009 1 / 67 Part
More informationPower Series in Differential Equations
Power Series in Differential Equations Prof. Doug Hundley Whitman College April 18, 2014 Last time: Review of Power Series (5.1) The series a n (x x 0 ) n can converge either: Last time: Review of Power
More informationExample continued. Math 425 Intro to Probability Lecture 37. Example continued. Example
continued : Coin tossing Math 425 Intro to Probability Lecture 37 Kenneth Harris kaharri@umich.edu Department of Mathematics University of Michigan April 8, 2009 Consider a Bernoulli trials process with
More informationMAS221 Analysis Semester Chapter 2 problems
MAS221 Analysis Semester 1 2018-19 Chapter 2 problems 20. Consider the sequence (a n ), with general term a n = 1 + 3. Can you n guess the limit l of this sequence? (a) Verify that your guess is plausible
More informationCOMP2610/COMP Information Theory
COMP2610/COMP6261 - Information Theory Lecture 9: Probabilistic Inequalities Mark Reid and Aditya Menon Research School of Computer Science The Australian National University August 19th, 2014 Mark Reid
More informationLimiting Distributions
We introduce the mode of convergence for a sequence of random variables, and discuss the convergence in probability and in distribution. The concept of convergence leads us to the two fundamental results
More informationAssignment 4. u n+1 n(n + 1) i(i + 1) = n n (n + 1)(n + 2) n(n + 2) + 1 = (n + 1)(n + 2) 2 n + 1. u n (n + 1)(n + 2) n(n + 1) = n
Assignment 4 Arfken 5..2 We have the sum Note that the first 4 partial sums are n n(n + ) s 2, s 2 2 3, s 3 3 4, s 4 4 5 so we guess that s n n/(n + ). Proving this by induction, we see it is true for
More informationPractice Problem - Skewness of Bernoulli Random Variable. Lecture 7: Joint Distributions and the Law of Large Numbers. Joint Distributions - Example
A little more E(X Practice Problem - Skewness of Bernoulli Random Variable Lecture 7: and the Law of Large Numbers Sta30/Mth30 Colin Rundel February 7, 014 Let X Bern(p We have shown that E(X = p Var(X
More informationSampling Distributions
Sampling Distributions Mathematics 47: Lecture 9 Dan Sloughter Furman University March 16, 2006 Dan Sloughter (Furman University) Sampling Distributions March 16, 2006 1 / 10 Definition We call the probability
More informationLecture 4: September Reminder: convergence of sequences
36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 4: September 6 In this lecture we discuss the convergence of random variables. At a high-level, our first few lectures focused
More informationPart 3.3 Differentiation Taylor Polynomials
Part 3.3 Differentiation 3..3.1 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial
More informationQuiz 3 Reminder and Midterm Results
Quiz 3 Reminder and Midterm Results Reminder: Quiz 3 will be in the first 15 minutes of Monday s class. You can use any resources you have during the quiz. It covers all four sections of Unit 3. It has
More informationSection 11.1: Sequences
Section 11.1: Sequences In this section, we shall study something of which is conceptually simple mathematically, but has far reaching results in so many different areas of mathematics - sequences. 1.
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
More informationExercises and Answers to Chapter 1
Exercises and Answers to Chapter The continuous type of random variable X has the following density function: a x, if < x < a, f (x), otherwise. Answer the following questions. () Find a. () Obtain mean
More informationChapter 3 Single Random Variables and Probability Distributions (Part 1)
Chapter 3 Single Random Variables and Probability Distributions (Part 1) Contents What is a Random Variable? Probability Distribution Functions Cumulative Distribution Function Probability Density Function
More informationLimit Theorems. STATISTICS Lecture no Department of Econometrics FEM UO Brno office 69a, tel
STATISTICS Lecture no. 6 Department of Econometrics FEM UO Brno office 69a, tel. 973 442029 email:jiri.neubauer@unob.cz 3. 11. 2009 If we repeat some experiment independently we can create using given
More informationChapter 2. Discrete Distributions
Chapter. Discrete Distributions Objectives ˆ Basic Concepts & Epectations ˆ Binomial, Poisson, Geometric, Negative Binomial, and Hypergeometric Distributions ˆ Introduction to the Maimum Likelihood Estimation
More informationLecture 4: Sampling, Tail Inequalities
Lecture 4: Sampling, Tail Inequalities Variance and Covariance Moment and Deviation Concentration and Tail Inequalities Sampling and Estimation c Hung Q. Ngo (SUNY at Buffalo) CSE 694 A Fun Course 1 /
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More informationChapter 3: Element sampling design: Part 1
Chapter 3: Element sampling design: Part 1 Jae-Kwang Kim Fall, 2014 Simple random sampling 1 Simple random sampling 2 SRS with replacement 3 Systematic sampling Kim Ch. 3: Element sampling design: Part
More informationThe Delta Method and Applications
Chapter 5 The Delta Method and Applications 5.1 Local linear approximations Suppose that a particular random sequence converges in distribution to a particular constant. The idea of using a first-order
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationLecture 3 - Tuesday July 5th
Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities
More informationFundamental Tools - Probability Theory IV
Fundamental Tools - Probability Theory IV MSc Financial Mathematics The University of Warwick October 1, 2015 MSc Financial Mathematics Fundamental Tools - Probability Theory IV 1 / 14 Model-independent
More informationReview Sheet on Convergence of Series MATH 141H
Review Sheet on Convergence of Series MATH 4H Jonathan Rosenberg November 27, 2006 There are many tests for convergence of series, and frequently it can been confusing. How do you tell what test to use?
More information1 Question related to polynomials
07-08 MATH00J Lecture 6: Taylor Series Charles Li Warning: Skip the material involving the estimation of error term Reference: APEX Calculus This lecture introduced Taylor Polynomial and Taylor Series
More informationLecture 4: Two-point Sampling, Coupon Collector s problem
Randomized Algorithms Lecture 4: Two-point Sampling, Coupon Collector s problem Sotiris Nikoletseas Associate Professor CEID - ETY Course 2013-2014 Sotiris Nikoletseas, Associate Professor Randomized Algorithms
More informationMathematical Statistics 1 Math A 6330
Mathematical Statistics 1 Math A 6330 Chapter 3 Common Families of Distributions Mohamed I. Riffi Department of Mathematics Islamic University of Gaza September 28, 2015 Outline 1 Subjects of Lecture 04
More informationLecture 12. Poisson random variables
18.440: Lecture 12 Poisson random variables Scott Sheffield MIT 1 Outline Poisson random variable definition Poisson random variable properties Poisson random variable problems 2 Outline Poisson random
More informationMath Bootcamp 2012 Miscellaneous
Math Bootcamp 202 Miscellaneous Factorial, combination and permutation The factorial of a positive integer n denoted by n!, is the product of all positive integers less than or equal to n. Define 0! =.
More informationMA 320 Introductory Probability, Section 1 Spring 2017 Final Exam Practice May. 1, Exam Scores. Question Score Total. Name:
MA 320 Introductory Probability, Section 1 Spring 2017 Final Exam Practice May. 1, 2017 Exam Scores Question Score Total 1 10 Name: Last 4 digits of student ID #: No books or notes may be used. Turn off
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationIntroduction to Probability
LECTURE NOTES Course 6.041-6.431 M.I.T. FALL 2000 Introduction to Probability Dimitri P. Bertsekas and John N. Tsitsiklis Professors of Electrical Engineering and Computer Science Massachusetts Institute
More informationModule 3. Function of a Random Variable and its distribution
Module 3 Function of a Random Variable and its distribution 1. Function of a Random Variable Let Ω, F, be a probability space and let be random variable defined on Ω, F,. Further let h: R R be a given
More informationPreliminary check: are the terms that we are adding up go to zero or not? If not, proceed! If the terms a n are going to zero, pick another test.
Throughout these templates, let series. be a series. We hope to determine the convergence of this Divergence Test: If lim is not zero or does not exist, then the series diverges. Preliminary check: are
More informationBootstrap inference for the finite population total under complex sampling designs
Bootstrap inference for the finite population total under complex sampling designs Zhonglei Wang (Joint work with Dr. Jae Kwang Kim) Center for Survey Statistics and Methodology Iowa State University Jan.
More informationCSC B36 Additional Notes sample induction and well-ordering proofs. c Nick Cheng
CSC B36 Additional Notes sample induction and well-ordering proofs c Nick Cheng Introduction We present examples of induction proofs here in hope that they can be used as models when you write your own
More information2.1 Convergence of Sequences
Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written
More informationConvergence of sequences and series
Convergence of sequences and series A sequence f is a map from N the positive integers to a set. We often write the map outputs as f n rather than f(n). Often we just list the outputs in order and leave
More informationCSCI-6971 Lecture Notes: Probability theory
CSCI-6971 Lecture Notes: Probability theory Kristopher R. Beevers Department of Computer Science Rensselaer Polytechnic Institute beevek@cs.rpi.edu January 31, 2006 1 Properties of probabilities Let, A,
More informationNormal Random Variables and Probability
Normal Random Variables and Probability An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan 2015 Discrete vs. Continuous Random Variables Think about the probability of selecting
More informationMATH 1A, Complete Lecture Notes. Fedor Duzhin
MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a
More informationHigher order derivatives of the inverse function
Higher order derivatives of the inverse function Andrej Liptaj Abstract A general recursive and limit formula for higher order derivatives of the inverse function is presented. The formula is next used
More informationarxiv: v1 [math.nt] 1 Jul 2009
INTERMEDIATE CONVERGENTS AND A METRIC THEOREM OF KHINCHIN arxiv:0907.0161v1 [math.nt] 1 Jul 2009 ALAN K. HAYNES Abstract. A landmark theorem in the metric theory of continued fractions begins this way:
More informationSolutions to Problem Set 4
UC Berkeley, CS 174: Combinatorics and Discrete Probability (Fall 010 Solutions to Problem Set 4 1. (MU 5.4 In a lecture hall containing 100 people, you consider whether or not there are three people in
More informationConvergence in Distribution
Convergence in Distribution Undergraduate version of central limit theorem: if X 1,..., X n are iid from a population with mean µ and standard deviation σ then n 1/2 ( X µ)/σ has approximately a normal
More informationA RIGOROUS PROOF OF THE ARC LENGTH AND LINE INTEGRAL FORMULA USING THE RIEMANN INTEGRAL
A RGOROUS ROOF OF THE ARC LENGTH AND LNE NTEGRAL FORMULA USNG THE REMANN NTEGRAL ZACHARY DESTEFANO Abstract. n this paper, provide the rigorous mathematical definiton of an arc in general Euclidean Space.
More information2WB05 Simulation Lecture 7: Output analysis
2WB05 Simulation Lecture 7: Output analysis Marko Boon http://www.win.tue.nl/courses/2wb05 December 17, 2012 Outline 2/33 Output analysis of a simulation Confidence intervals Warm-up interval Common random
More informationAsymptotic Statistics-VI. Changliang Zou
Asymptotic Statistics-VI Changliang Zou Kolmogorov-Smirnov distance Example (Kolmogorov-Smirnov confidence intervals) We know given α (0, 1), there is a well-defined d = d α,n such that, for any continuous
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationFirst Order Linear Ordinary Differential Equations
First Order Linear Ordinary Differential Equations The most general first order linear ODE is an equation of the form p t dy dt q t y t f t. 1 Herepqarecalledcoefficients f is referred to as the forcing
More informationMath 3 Variable Manipulation Part 3 Polynomials A
Math 3 Variable Manipulation Part 3 Polynomials A 1 MATH 1 & 2 REVIEW: VOCABULARY Constant: A term that does not have a variable is called a constant. Example: the number 5 is a constant because it does
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 informationWorksheet 9. Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.
ATH 57H Spring 0 Worksheet 9 Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.. Let f(x) = +x. Find f (00) (0) - the 00th derivative of f at point x = 0.
More informationTail and Concentration Inequalities
CSE 694: Probabilistic Analysis and Randomized Algorithms Lecturer: Hung Q. Ngo SUNY at Buffalo, Spring 2011 Last update: February 19, 2011 Tail and Concentration Ineualities From here on, we use 1 A to
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationNorthwestern University Department of Electrical Engineering and Computer Science
Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability
More informationCS145: Probability & Computing
CS45: Probability & Computing Lecture 5: Concentration Inequalities, Law of Large Numbers, Central Limit Theorem Instructor: Eli Upfal Brown University Computer Science Figure credits: Bertsekas & Tsitsiklis,
More informationAsymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½
University of Pennsylvania ScholarlyCommons Statistics Papers Wharton Faculty Research 1998 Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½ Lawrence D. Brown University
More informationChapter 6: Random Processes 1
Chapter 6: Random Processes 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.
More informationImpact of Stratified Randomization in Clinical Trials
Impact of Stratified Randomization in Clinical Trials Vladimir V. Anisimov Abstract This paper deals with the analysis of randomization effects in clinical trials. The two randomization schemes most often
More informationAsymptotic statistics using the Functional Delta Method
Quantiles, Order Statistics and L-Statsitics TU Kaiserslautern 15. Februar 2015 Motivation Functional The delta method introduced in chapter 3 is an useful technique to turn the weak convergence of random
More informationChapter 7: Special Distributions
This chater first resents some imortant distributions, and then develos the largesamle distribution theory which is crucial in estimation and statistical inference Discrete distributions The Bernoulli
More informationFORMULATION OF THE LEARNING PROBLEM
FORMULTION OF THE LERNING PROBLEM MIM RGINSKY Now that we have seen an informal statement of the learning problem, as well as acquired some technical tools in the form of concentration inequalities, we
More informationTaylor Series. Math114. March 1, Department of Mathematics, University of Kentucky. Math114 Lecture 18 1/ 13
Taylor Series Math114 Department of Mathematics, University of Kentucky March 1, 2017 Math114 Lecture 18 1/ 13 Given a function, can we find a power series representation? Math114 Lecture 18 2/ 13 Given
More informationLecture 4: Law of Large Number and Central Limit Theorem
ECE 645: Estimation Theory Sring 2015 Instructor: Prof. Stanley H. Chan Lecture 4: Law of Large Number and Central Limit Theorem (LaTeX reared by Jing Li) March 31, 2015 This lecture note is based on ECE
More informationNotes 1 : Measure-theoretic foundations I
Notes 1 : Measure-theoretic foundations I Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Section 1.0-1.8, 2.1-2.3, 3.1-3.11], [Fel68, Sections 7.2, 8.1, 9.6], [Dur10,
More informationEuler-Maclaurin summation formula
Physics 4 Spring 6 Euler-Maclaurin summation formula Lecture notes by M. G. Rozman Last modified: March 9, 6 Euler-Maclaurin summation formula gives an estimation of the sum N in f i) in terms of the integral
More informationContents PART II. Foreword
Contents PART II Foreword v Preface vii 7. Integrals 87 7. Introduction 88 7. Integration as an Inverse Process of Differentiation 88 7. Methods of Integration 00 7.4 Integrals of some Particular Functions
More informationSection Taylor and Maclaurin Series
Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power
More informationReview. December 4 th, Review
December 4 th, 2017 Att. Final exam: Course evaluation Friday, 12/14/2018, 10:30am 12:30pm Gore Hall 115 Overview Week 2 Week 4 Week 7 Week 10 Week 12 Chapter 6: Statistics and Sampling Distributions Chapter
More informationStat 134 Fall 2011: Notes on generating functions
Stat 3 Fall 0: Notes on generating functions Michael Lugo October, 0 Definitions Given a random variable X which always takes on a positive integer value, we define the probability generating function
More informationLecture 04: Balls and Bins: Birthday Paradox. Birthday Paradox
Lecture 04: Balls and Bins: Overview In today s lecture we will start our study of balls-and-bins problems We shall consider a fundamental problem known as the Recall: Inequalities I Lemma Before we begin,
More informationSeries. Xinyu Liu. April 26, Purdue University
Series Xinyu Liu Purdue University April 26, 2018 Convergence of Series i=0 What is the first step to determine the convergence of a series? a n 2 of 21 Convergence of Series i=0 What is the first step
More information04. Random Variables: Concepts
University of Rhode Island DigitalCommons@URI Nonequilibrium Statistical Physics Physics Course Materials 215 4. Random Variables: Concepts Gerhard Müller University of Rhode Island, gmuller@uri.edu Creative
More informationMATH 1231 MATHEMATICS 1B Calculus Section 4.4: Taylor & Power series.
MATH 1231 MATHEMATICS 1B 2010. For use in Dr Chris Tisdell s lectures. Calculus Section 4.4: Taylor & Power series. 1. What is a Taylor series? 2. Convergence of Taylor series 3. Common Maclaurin series
More information8.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
8. Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = Examples: 6. Find a formula for the general term a n of the sequence, assuming
More informationn 2 xi = x i. x i 2. r r ; i r 2 + V ( r) V ( r) = 0 r > 0. ( 1 1 ) a r n 1 ( 1 2) V( r) = b ln r + c n = 2 b r n 2 + c n 3 ( 1 3)
Sep. 7 The L aplace/ P oisson Equations: Explicit Formulas In this lecture we study the properties of the Laplace equation and the Poisson equation with Dirichlet boundary conditions through explicit representations
More informationIntegration, differentiation, and root finding. Phys 420/580 Lecture 7
Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:
More informationStatistics: Learning models from data
DS-GA 1002 Lecture notes 5 October 19, 2015 Statistics: Learning models from data Learning models from data that are assumed to be generated probabilistically from a certain unknown distribution is a crucial
More informationLecture 9: Taylor Series
Math 8 Instructor: Padraic Bartlett Lecture 9: Taylor Series Week 9 Caltech 212 1 Taylor Polynomials and Series When we first introduced the idea of the derivative, one of the motivations we offered was
More informationIntroduction to Information Entropy Adapted from Papoulis (1991)
Introduction to Information Entropy Adapted from Papoulis (1991) Federico Lombardo Papoulis, A., Probability, Random Variables and Stochastic Processes, 3rd edition, McGraw ill, 1991. 1 1. INTRODUCTION
More informationAssignment 3. Tyler Shendruk February 26, 2010
Assignment 3 Tyler Shendruk February 6, 00 Kadar Ch. 4 Problem 7 N diatomic molecules are stuck on metal. The particles have three states:. in plane and aligned with the ˆx axis. in plane but aligned with
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 informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationData, Estimation and Inference
Data, Estimation and Inference Pedro Piniés ppinies@robots.ox.ac.uk Michaelmas 2016 1 2 p(x) ( = ) = δ 0 ( < < + δ ) δ ( ) =1. x x+dx (, ) = ( ) ( ) = ( ) ( ) 3 ( ) ( ) 0 ( ) =1 ( = ) = ( ) ( < < ) = (
More information