Laplace transform. Lecture notes. Ante Mimica. Department of Mathematics. Univeristy of Zagreb. Croatia
|
|
- Winifred Jefferson
- 5 years ago
- Views:
Transcription
1 Laplace transform Lecture notes Ante Mimica Department of Mathematics Univeristy of Zagreb Croatia These lecture notes follow the course given in period April 27 - May at Technische Universität Dresden.
2
3 Contents Contents 3 1 Definition and basic properties 5 2 Continuity theorem and applications Completely monotone functions Tauberian theorems Further developments Bibliography 23 3
4
5 1 Definition and basic properties Definition 1.1 Let µ be a measure on. The Laplace transform Lµ of µ is defined by Lµ(λ) = e λx µ(dx) for λ > σ, where σ = inf{λ R : e λx µ(dx) < }. Remark 1.2 (i) If µ is a finite measure, then σ. (ii) Assume that Lµ(a) < for some a R. Then ν(dx) = e ax Lµ(a) µ(dx) defines a probability measure on [, ) with the Laplace transform e λx ν(dx) = 1 e (λ+a)x µ(dx) = Lµ(λ+a). Lµ(a) Lµ(a) (iii) Some special cases: (iiia) µ(dx) = f(x)dx Lµ(λ) = Lf(λ) = e λx f(x)dx. (iiib) let X be a non-negative random variable on a probability space (Ω,F,P) and denote by µ the law of X; that is µ(b) = P(X B). Then Lµ(λ) = E[e λx ] for λ > σ. 5
6 1 Definition and basic properties Example 1.3 (a) f(x) = x α, α > Lf(λ) = e x( x ) α dx λ λ = Γ(α+1), σ λ 1+α =. (b) f(x) = e ax, a R Lf(λ) = (c) f(x) = e x2, σ =, since (d) f(x) = e x2, σ = +, since e (a+λ)x dx = 1 a+λ, σ = a. e λx x2 dx converges for any λ R. e λx+x2 dx does not converge for any λ R. Proposition 1.4 (Properties of LT) Letµbeameasureonansassume that Lµ is finite (, ) (i.e. σ ). (i) Then Lµ C ((, )) and for all n N (Lµ) (n) (λ) = ( 1) n x n e λx µ(dx). (ii) µ has finite n-th moment if and only if (Lµ) (n) (+) exists and it is finite. In particular, µ is finite if and only if Lµ(+) exists and it is finite. (iii) If γ : is defined by γ(x) = ax, a >, then L(µ γ 1 )(λ) = Lµ(aλ), λ >. (iv) If ν is a measure such that Lν(λ) exists for λ >, then L(µ ν) = LµLν, where the convolution of measures µ and ν is defined by (µ ν)(b) := 1 B (x+y)µ(dx)ν(dy) for a Borel measurable set B. 6
7 Proof. (i) Lµ(λ+h) Lµ(λ) h = e hx 1 h e λx µ(dx). Since e hx 1 h hx e hx xe λ 4 x ce λ 2 x for h λ h 4 for some constant c > depending only on λ >, we can use dominated convergence theorem to conclude that (Lµ) e hx 1 (λ) = e λx µ(dx) = xe λx µ(dx). h For higher derivatives we proceed in a similar manner. (ii) An application of monotone convergence theorem yields ( 1) n (Lµ) (n) (+) = lim x n e λx µ(dx) = λ + and the claim follows. (iii) L(µ γ 1 )(λ) = e λx (µ γ 1 )(dx) = e λ =ax {}}{ x n µ(dx) γ(x) µ(dx) = Lµ(ax). (iv) L(µ ν)(λ) = = Lµ(λ)Lν(λ). e λx (µ ν)(dx) = e λ(x+y) µ(dx)ν(dy) Definition 1.5 For a measure µ on R its distribution function F : R is defined by F(x) = µ((,x]), x R. We call x R a continuity point of µ (or F) if F is continuous at x. 7
8 1 Definition and basic properties Remark 1.6 Note that F is always right continuous with left limits and nondecreasing function and it has at most countable number of discontinuities. If µ is a measure on, then F(x) = for x < and F(x) = µ([,x]) for x. Proposition 1.7 Let µ be a measure on [, ) with the distribution function F. Then for any λ > σ and x > following integration by parts formula holds e λy µ(dy) = e λx F(x)+ λe λy F(y)dy. In particular, [,x] If µ is a probability measure, then [,x] e λy F(y)dy = Lµ(λ) λ. e λx (1 F(x))dx = 1 Lµ(λ) λ for all λ >. Proof. By Fubini theorem [,x] e λy µ(dy) = = 1 [,x z](y) {}}{ 1 [,x] (y)1 [y, ) (z)λe λz dzµ(dy) λe λz µ([,x z])dz = e λx µ([,x])+ = e λx F(x)+ x x λe λz µ([,z])dz λe λz F(z)dz. Second claim follows by letting x and using monotone convergence theorem, since we can find ε > so that λ ε > σ and hence > Lµ(λ ε) e (λ ε)y µ(dy) e εx e λx F(x) [,x] yielding e λx F(x) x. The last claim follows directly from the previous. 8
9 Proposition 1.8 (Uniqueness and inversion of LT) A finite measure µ on [, ) is uniquely determined by its Laplace transform. More precisely, for any x we have µ([,x]) 1 µ({x}) = lim 2 ( 1) knk k! (Lµ)(k) (n). (1.1) k nx In particular, at every continuity point x of µ we have µ([,x]) = lim k nx ( 1) knk k! (Lµ)(k) (n). (1.2) Proof. By Proposition 1.4 (a), for any x > and n N, ( 1) knk (nt) k k! (Lµ)(k) (λ) = e nt µ(dt). k! Note, k nx k nx k nx (nt) k e nt = P(X nx), k! where X has Poisson distribution with mean nt. First we consider case x = t. Let {Y i : i 1} be a sequence of independent Poisson random variables with mean t. By the central limit theorem, P(X nt) = P For x < t, ( Y Y n nt nt ) 1 2π e y2 2 dy = 1 2. P(X nx) = P(n(t x) nt X) P(n(t x) X nt ) VarX n 2 (t x) = t 2 n(t x). 2 and, similarly, for x > t, P(X nx) = 1 P(X nt > n(x t)) 1 P( X nt n(x t)) t 1 n(t x)
10 1 Definition and basic properties The last three displays show that k nx (nt) k k! e nt 1 [,x) (t) {x}(t) and, thus by the dominated convergence theorem ( lim ( 1)knk k! (Lµ)(k) (n) = 1 [,x) (t)+ 1 ) 2 1 {x}(t) = µ([,x]) 1 2 µ({x}). µ(dt) Remark 1.9 If f : R is a continuous function such that for some b R supe bx f(x) <, x then the Post-Widder inversion formula holds ( 1) f(x) = lim n n! ( n x ) n+1(lf) (n) ( n x ), x >. 1
11 2 Continuity theorem and applications Theorem 2.1 (Continuity theorem) Let (µ n ) be a sequence of measures on and denote by F n their distribution functions. (i) If µ is a measure on with the distribution function F such that F n F at continuity points of F and if there is a such that sup n 1 Lµ n (a) <, then Lµ n (λ) Lµ(λ) for all λ > a. (ii) If there is a R such that φ(λ) = lim Lµ n (λ) exists for all λ > a, then φ is the Laplace transform of a measure µ and if F is its distribution function, then F n F at all continuity points of F. Proof. (i) Let A := suplµ n (a) <. Using Proposition 1.7 and dominated n 1 convergence theorem, for any λ > a and point of continuity x >, x e λy µ n (dy) = λe λy F n (y)ds+e λx F n (x) e [,x] [,x] λy µ(dy), since F n (y) e ax Lµ n (a) Ae ax for all y x. Let λ > a and ε >. For any point of continuity x > of F satisfying Ae (λ a)x ε we have e λy µ n (dy) Lµ n (λ) [,x] e λy µ n (dy)+e (λ a)x e ay µ n (dy) e λy µ n (dy)+ε. [,x] (x, ) This implies e λy µ(dy) liminf Lµ n(λ) limsuplµ n (λ) [,x] [,x] [,x] e λy µ(dy)+ε 11
12 2 Continuity theorem and applications and, letting x (along points of continuity of F) we obtain Lµ(λ) liminf Lµ n(λ) limsuplµ n (λ) Lµ(λ)+ε. Since ε > was arbitrarywe conclude that lim Lµ n (λ) exists and equals Lµ(λ) for any λ > a. (ii) Take λ > a. By Remark 1.2 (ii), ν n (dx) = e λ x Lµ n (λ ) µ n(dx) are probability measures with the Laplace transforms Lµ n (λ +λ) Lµ n (λ ) for n N. Denoting by G n the distribution function of ν n for n N, we can apply Helly s selection theorem to obtain a right-continuous non-decreasing function G and a subsequence such that G nk G at all continuity points of G. Let ν be the k measure on corresponding to G (such that G is the distribution function of ν). Since Lν n () = 1 for all n N, we can apply (i) to conclude that φ(λ +λ) φ(λ ) = lim k Lµ nk (λ +λ) Lµ nk (λ ) = Lν(λ +λ). In the same way, we obtain that any subsequence (G nk ) of (G n ) has a subsequence (G nkl ) converging to G at all continuity points of G. This implies that (G n ) converges to G at all continuity points of G(see 1 ). Define µ by µ(dx) = φ(λ )e λ x ν(dx), Note that it has the same continuity points as ν since, by Proposition 1.7, [ µ([,x]) = φ(λ ) e λx G(x)+ x ] λ e λt G(t)dt. 1 Here we use the following reasoning from analysis. If (a n ) is a sequence of real numbers such that every sequence has a subsequence converging to some fixed number L R, then (a n ) converges to L as well. If this were not true, we could find ε > and a subsequence (a nk ) such that a nk L ε for all k N which would lead to a contradiction, since we could not find any further subsequence of (a nk ) converging to L. 12
13 2.1 Completely monotone functions Also, for any λ > λ Lµ(λ) = φ(λ) e (λ λ )x ν(dx) = φ(λ ) φ(λ +(λ λ )) φ(λ ) = φ(λ). Then for any continuity point x > of the distribution function F of µ, by the dominated convergence theorem and Proposition 1.7, it follows that F n (x) = Lµ n (λ )e λy ν n (dy) = Lµ n (λ )e λx G n (x) Lµ n (λ )λ e λy G n (y)dy [,x] [,x] φ(λ )e λx G(x) φ(λ )λ e λy G(y)dy = φ(λ )e λy ν(dy) = µ([,x]) = F(x). [,x] [,x] Corollary 2.2 Let (µ n ) n be a sequence of probability measures such that Lµ n (λ) φ(λ) for all λ >. If φ(+) = 1, then there exists a probability measure µ on such that Lµ = φ and µ n ([,x]) µ([,x]) at continuity points x > of µ. Proof. Since sup n 1 Lµ n () = supµ n ( = 1, Theorem 2.1 (ii) yiedls a measure n 1 µ on such that µ n ([,x]) µ([,x]) at continuity points of µ satisfying Lµ(λ) = φ(λ) for all λ >. Using Proposition 1.4 (i) we get that 1 = φ(+) = µ(). 2.1 Completely monotone functions In this section we explore range of the Laplace transform. 13
14 2 Continuity theorem and applications Definition 2.3 Afunctionf : (, ) (, )iscompletelymonotonefunction if it has derivatives of all orders and satisfies ( 1) n f (n) (λ) for all λ > and n N {}. Theorem 2.4 (Bernstein-Hausdorff-Widder) A function f: (, ) (, ) is completely monotone if and only if there exists a measure µ on such that f(λ) = Lµ(λ) = e λx µ(dx) for all λ >. Proof. By Proposition 1.4 (i), for any n N and λ > we have ( 1) n f (n) (λ) = x n e λx µ(dx). Let f be a completely monotone function such that f(+) <. Since ( 1) n f (n) is nonincreasing for any n N, we have ( 1) n f (n) 2 λ λ 2/λ Iterating this inequality we obtain ( 1) n f (n) (y)dy 2 λ ( 1)n 1 f (n 1) ( λ 2 ). 2n(n+1) ( 1) n f (n) 2 (y) f( y y n 2 ) 2 n(n+1) 2 f(+), y >. n y n Having this inequality we can use integration by parts and change of variable y = n t to get f(λ) f( ) = λ f (y)dy = =... = ( 1)n (n 1)! = = n/λ λ λ (y λ)f (y)dy (y λ) n 1 f (n) (y)dy ( n f (n) ( n t λ)n 1( 1)n t ) ndt (n 1)! t 2 ( 1 λt ) n 1 1 [,n](λt) ( 1)n f (n) ( n t )(n t )n+1 n n! dt. 14
15 2.1 Completely monotone functions Define µ n (dt) = ( 1)n f (n) ( n t )(n t )n+1 dt. n! By monotone convergence theorem ( µ n () = lim 1 λt ) n 1 1 λ + [,n](λt)µ n (dt) = f(+) f( ) n for all n N and so we may use Helly s selection principle to obtain a nondecreasing right continuous function F and a subsequence (µ nk ) such that µ nk ([,x]) k F(x) at continuity points x of F. Let µ be the measure corresponding to µ. By the continuity theorem (Theorem 2.1), Lµ nk (λ) k Lµ(λ) It can be shown that ( 1 x n) n 11[,n] (x) e λx uniformly in x >, hence, implying that Lµ nk (λ) ( 1 λt ) nk 1 1 [,nk ](λt)µ nk (dt) n k k f(λ) f( ) = Lµ (λ). Therefore, in this case it is enough to put µ = µ +f( )δ, where δ is point mass at. In general case we set f a (λ) := f(a+λ) for a > and note that f a is also a completely monotone function such that f a (+) < and so there is a measure µ a such that f a = Lµ a. Since it is possible do this for any a >, uniqueness theorem for the Laplace transform (Proposition 1.8) implies that for < a < b from Lµ b (λ) = f(a+(λ+b a)) = e λx e λ(b a) µ a (dx), 15
16 2 Continuity theorem and applications we deduce that e ax µ a (dx) = e bx µ b (dx). Hence, for any a > we may consistently define measure µ(dx) = e ax µ a (dx). Then for λ > and a = λ 2 we get f(λ) = f( λ 2 + λ 2 ) = e λ 2 x µ λ/2 (dx) = e λx µ(dx). Proposition 2.5 Let f be a completely monotone function. (a) If g is a completely monotone function, then f g is also completely monotone. (b) If h : (, ) (, ) is such that h is completely monotone, then f h is also completely monotone. Proof. (a) By Theorem 2.4, there exist measures µ and ν such that f = Lµ and g = Lν. Then Proposition 1.4 (iv) implies that fg = LµLν = L(µ ν). Now it is enough to observe that L(µ ν) is completely monotone by Theorem 2.4. (b) We prove this by mathematical induction. First, Assume that for some n N (h f) = (f h) }{{} h }{{}. ( 1) k ( f h) (k) for all k {1,...,n} (2.1) and all functions f, h : (, ) (, ) such that h and f are completely monotone. Since f and h are completely monotone, by Leibniz formula for higher derivatives and (2.1), ( 1) (n+1) (h f) (n+1) = ( 1) n [(( f ) h) h ] (n) n ( n = ( 1) n k = n k= ( n k k= ) (( f) h) (k) (h ) (n k) ) ( 1) k (( f ) h) (k) } {{ } ( 1) n k (h ) }{{ (n k). } 16
17 2.2 Tauberian theorems 2.2 Tauberian theorems We have seen that continuity theorem enables us to deduce convergence of distribution functions from the convergence of the Laplace transforms of the corresponding measures. In this section we will see that under certain conditions behavior of the Laplace transform around the origin determines the behavior of the distribution function near the infinity. Such type of relation, describing behavior of measure µ in terms of transform Lµ is often called Tauberian. Reverse relation is known as Abelian. Theorem 2.6 Let ρ and let µ be a measure on such that its Laplace transform Lµ is defined on (, ). The following claims are equivalent (i) (ii) Lµ( λ t ) Lµ( 1 t ) λ ρ t for all λ >, µ([,tx]) µ([,t]) t xρ for all x >. Moreover, if the relations above hold, then Lµ( 1 t ) µ([,t]) Γ(1+ρ). (2.2) t Proof. (i) = (ii) (Tauberian theorem) By Proposition 1.4 (iii) with γ(y) = y t, for any λ > and t > we obtain Lµ( λ t ) ( ) µ γ 1 Lµ( 1 t ) = L Lµ( 1 t ) (λ). Hence, ( ) { µ γ 1 L Lµ( 1 t ) (λ) λ ρ e λy y ρ 1 Γ(ρ) = dy, ρ > t Lδ (λ), ρ = and so, by the continuity theorem (Theorem 2.1), we conclude that µ([,tx]) Lµ( 1 t ) t { x y ρ 1 Γ(ρ) dy, ρ > [,x] δ (dy), ρ = = xρ Γ(1+ρ) for any x >. (2.3) 17
18 2 Continuity theorem and applications In particular, taking x = 1 in (2.3) we get (2.2) and then µ([,tx]) µ([,t]) = µ([,tx]) Lµ( 1 t ) x ρ for any x >. µ([,t]) t Lµ( 1 t ) (ii) = (i) (Abelian theorem) Similarly as before, by Proposition 1.4 (iii) with γ(y) = y t ( ) µ γ 1 L (λ) = Lµ(λ t ) for λ,t >. µ([,t]) µ([,t]) In order to apply continuity theorem first we are going to prove that for some t > Lµ( 1 t sup ) t>t µ([,t]) <. From (ii) it follows that there is t > such that Then for any a > Lµ( a t ) µ([,t])+ µ([,2t]) 2 2 ρ µ([,t]) for every t t. (2.4) n=1 [2 n 1 t,2 n t] e ay t µ(dy) µ([,t])+ e a2n 1 µ([,2 n t]) yielding together with multiple application of (2.4) Lµ( a t ) µ([,t]) 1+ e a2n 1µ([,2n t]) 1+ e a2n 1 2 n(1+ρ) <. µ([,t]) n=1 Therefore, we may use continuity theorem (Theorem 2.1) to conclude that Lµ( λ t ) ( ) { µ γ 1 µ([,t]) = L (λ) e λy ρy ρ 1 dy, ρ > µ([,t]) t Lδ (λ), ρ = = Γ(1+ρ) λ ρ for all λ > a, implying that the convergence actually holds for all λ >, since a > was arbitrary. As in the first part of the proof, by taking λ = 1 we obtain (2.2) and then Lµ( λ t ) Lµ( 1 t ) = Lµ( λ t ) µ([,t]) Lµ( 1 t ) µ([,t]) n=1 n=1 t λ ρ for all λ >. 18
19 2.2 Tauberian theorems Example 2.7 By (2.2), µ([,t]) lnt as t Lµ(λ) ln 1 λ as λ +. Definition 2.8 A function g: (, ) (, ) varies regularly at infinity with index ρ R if g(tx) lim t g(t) = tρ for all x >. If l: (, ) (, ) varies regluarly with index ρ =, then it is said to vary slowly at infinity, i.e. l(tx) lim t l(t) = 1 for all x >. Using this terminology we can restate Theorem 2.6 as follows. Theorem 2.9 Let µ be a measure on, l: (, ) (, ) a slowly varying function at infinity and ρ. The following relations are equivalent: (i) Lµ(λ) λ ρ l( 1 λ ), λ + 1 (ii) µ([,t]) Γ(1+ρ) tρ l(t), t. Proof. If (i) holds, then Lµ( λ t ) Lµ( 1 t ) λ ρl(t λ ) l(t) λ ρ as t, which is (i) in Theorem 2.6. Hence, from (2.2) we deduce µ([,t]) 1 Γ(1+ρ) Lµ(1 t ) 1 Γ(1+ρ) tρ l(t) as t. In the other case we proceed similarly. 19
20 2 Continuity theorem and applications Proposition 2.1 (Monotone density theorem) Let µ be a measure on such that µ([,t]) = t m(s)ds, t >, where m : (, ) (, ) is ultimately monotone, i.e. there exists t > such that m is monotone on (t, ). If there exist ρ R and a slowly varying function l : (, ) (, ) such that µ([,t]) t ρ l(t), as t, (2.5) then m(t) ρt ρ 1 l(t), as t. (2.6) Proof. Let us assume that m is eventualy nondecreasing and let < a < b. Then for t > large enough, (b a)tm(at) t ρ l(t) µ((at,bt]) t ρ l(t) Since l varies slowly at infinity we have µ((at,bt]) t ρ l(t) Therefore, it follows from (2.7) that (b a)tm(bt) t ρ l(t). (2.7) = µ([,bt]) (bt) ρ l(bt) bρl(bt) l(t) µ([,at]) (at) ρ l(at) aρl(at) l(t) t bρ a ρ. lim sup t m(at) t ρ 1 l(t) bρ a ρ b a and by taking a = 1 and letting b 1+ we get Similarly, showing that lim sup t lim inf t m(t) t ρ 1 l(t) lim b ρ 1 b 1+ b 1 = ρ. m(t) t ρ 1 l(t) lim 1 a ρ a 1 1 a = ρ lim t m(t) t ρ 1 l(t) = ρ. 2
21 2.2 Tauberian theorems Remark 2.11 It can be proved that (2.5) and (2.6) in Proposition 2.1 are equivalent when ρ >. The direction that we have not proved is known as Karamata theorem (see [1, Proposition 1.5.8]). Example 2.12 Let µ be a probability measure on [, ) with the distribution function. Then, by Proposition 1.7, e λx [1 F(x)]dx = 1 Lµ(λ), λ >. λ Since 1 F is monotone, Theorem 2.9 and Proposition 2.1 and previous remark imply that for a slowly varying function l and ρ > the following relations are equivalent 1 Lµ(λ) λ 1 ρ l( 1 ρ λ ), λ + and 1 F(t) Γ(1+ρ) }{{} = 1 Γ(ρ) t ρ 1 l(t), t. (2.8) Example 2.13 (Stable distributions) Letα (,1)andφ(λ) = e λα. Then φ is a completely monotone function by Proposition 2.5 (b) as a composition of a completely monotone function and a function with a completely monotone derivative. Moreover, since φ() = 1, by Theorem 2.4 φ is the Laplace transform of a probability measure µ. Let (X n ) be a sequence of independent random variables on a probability space (Ω,F,P) with law µ. Then the Laplace transform of the random variable X X n is n 1/α ] E [e λx Xn n 1/α = φ(λn 1/α ) n = φ(λ), showing by the uniqueness of the Laplace transform (Proposition 1.8) that the law of X X n is again µ. Note that n 1/α 1 Lµ(λ) = 1 e λα λ α, λ +. If X has the law µ, then (2.8) with ρ = 1 α yields P(X > t) 1 Γ(1 α) t1 α 1 = t α Γ(1 α), t. 21
22 2 Continuity theorem and applications 2.3 Further developments If we consider example of the gamma distribution then γ(dx) = xα 1 Γ(α) e x dx (α > ), Lµ(λ) = 1 e (1+λ)x x α 1 dx = Γ(α) 1 (1+λ) α implying that σ = 1. It can be proved that the tail of the measure µ(t, ) = x α 1 t Γ(α) e x dx satisfies lnµ(t, ) lim t t More generally, we have the following result. = 1 = σ. Theorem 2.14 Let f : (, ) (, ) be a completely monotone function and let µ be the measure such that f = Lµ (see Theorem 2.4). Assume that f(σ +2λ) lim supλlnf(σ +λ) = and limsup λ + λ + f(σ +λ) < 1. (2.9) Then Proof. See [3, Theorem 1.2]. 1 lim t t lnµ(t, ) = σ. Remark 2.15 Condition (2.9) is satisfied if function λ f(σ + λ) varies regularly at with index ρ <. 22
23 Bibliography [1] N. H. Bingham, C. M. Goldie, J. L. Teugels. Regular variation, Cambridge University Press, Cambridge, [2] W. Feller. An Introduction to Probability Theory and Its Applications, Volume II, John Wiley & Sons, New York, [3] A. Mimica. Exponential decay of measures and Tauberian theorems, preprint, 214., [4] R. L. Schilling, R. Song, Z. Vondraček. Bernstein functions: Theory and applications, 2nd edition, De Gruyter, Berlin,
Some remarks on special subordinators
Some remarks on special subordinators Renming Song Department of Mathematics University of Illinois, Urbana, IL 6181 Email: rsong@math.uiuc.edu and Zoran Vondraček Department of Mathematics University
More informationWeak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria
Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then
More informationBrownian Motion and Stochastic Calculus
ETHZ, Spring 17 D-MATH Prof Dr Martin Larsson Coordinator A Sepúlveda Brownian Motion and Stochastic Calculus Exercise sheet 6 Please hand in your solutions during exercise class or in your assistant s
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 informationPoisson random measure: motivation
: motivation The Lévy measure provides the expected number of jumps by time unit, i.e. in a time interval of the form: [t, t + 1], and of a certain size Example: ν([1, )) is the expected number of jumps
More informationMATH MEASURE THEORY AND FOURIER ANALYSIS. Contents
MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure
More informationBMIR Lecture Series on Probability and Statistics Fall 2015 Discrete RVs
Lecture #7 BMIR Lecture Series on Probability and Statistics Fall 2015 Department of Biomedical Engineering and Environmental Sciences National Tsing Hua University 7.1 Function of Single Variable Theorem
More informationContinuous Random Variables
Continuous Random Variables Recall: For discrete random variables, only a finite or countably infinite number of possible values with positive probability. Often, there is interest in random variables
More information2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.
University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)
More informationReal Analysis Chapter 3 Solutions Jonathan Conder. ν(f n ) = lim
. Suppose ( n ) n is an increasing sequence in M. For each n N define F n : n \ n (with 0 : ). Clearly ν( n n ) ν( nf n ) ν(f n ) lim n If ( n ) n is a decreasing sequence in M and ν( )
More informationSigned Measures. Chapter Basic Properties of Signed Measures. 4.2 Jordan and Hahn Decompositions
Chapter 4 Signed Measures Up until now our measures have always assumed values that were greater than or equal to 0. In this chapter we will extend our definition to allow for both positive negative values.
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 informationRandom Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R
In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
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 informationRandom Variables and Their Distributions
Chapter 3 Random Variables and Their Distributions A random variable (r.v.) is a function that assigns one and only one numerical value to each simple event in an experiment. We will denote r.vs by capital
More informationSOLUTIONS OF SELECTED PROBLEMS
SOLUTIONS OF SELECTED PROBLEMS Problem 36, p. 63 If µ(e n < and χ En f in L, then f is a.e. equal to a characteristic function of a measurable set. Solution: By Corollary.3, there esists a subsequence
More informationX n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)
14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationStat410 Probability and Statistics II (F16)
Stat4 Probability and Statistics II (F6 Exponential, Poisson and Gamma Suppose on average every /λ hours, a Stochastic train arrives at the Random station. Further we assume the waiting time between two
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 informationGAUSSIAN MEASURES ON 1.1 BOREL MEASURES ON HILBERT SPACES CHAPTER 1
CAPTE GAUSSIAN MEASUES ON ILBET SPACES The aim of this chapter is to show the Minlos-Sazanov theorem and deduce a characterization of Gaussian measures on separable ilbert spaces by its Fourier transform.
More informationCompendium and Solutions to exercises TMA4225 Foundation of analysis
Compendium and Solutions to exercises TMA4225 Foundation of analysis Ruben Spaans December 6, 2010 1 Introduction This compendium contains a lexicon over definitions and exercises with solutions. Throughout
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 informationthe convolution of f and g) given by
09:53 /5/2000 TOPIC Characteristic functions, cont d This lecture develops an inversion formula for recovering the density of a smooth random variable X from its characteristic function, and uses that
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 informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationFiltrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition
Filtrations, Markov Processes and Martingales Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition David pplebaum Probability and Statistics Department,
More informationLecture 4: Fourier Transforms.
1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 ()
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 informationSome basic elements of Probability Theory
Chapter I Some basic elements of Probability Theory 1 Terminology (and elementary observations Probability theory and the material covered in a basic Real Variables course have much in common. However
More information18.175: Lecture 15 Characteristic functions and central limit theorem
18.175: Lecture 15 Characteristic functions and central limit theorem Scott Sheffield MIT Outline Characteristic functions Outline Characteristic functions Characteristic functions Let X be a random variable.
More informationReview For the Final: Problem 1 Find the general solutions of the following DEs. a) x 2 y xy y 2 = 0 solution: = 0 : homogeneous equation.
Review For the Final: Problem 1 Find the general solutions of the following DEs. a) x 2 y xy y 2 = 0 solution: y y x y2 = 0 : homogeneous equation. x2 v = y dy, y = vx, and x v + x dv dx = v + v2. dx =
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 informationMATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.
MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem. Limit of a sequence Definition. Sequence {x n } of real numbers is said to converge to a real number a if for
More informationDifferentiation of Measures and Functions
Chapter 6 Differentiation of Measures and Functions This chapter is concerned with the differentiation theory of Radon measures. In the first two sections we introduce the Radon measures and discuss two
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationNash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators. ( Wroclaw 2006) P.Maheux (Orléans. France)
Nash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators ( Wroclaw 006) P.Maheux (Orléans. France) joint work with A.Bendikov. European Network (HARP) (to appear in T.A.M.S)
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationContinuous Distributions
A normal distribution and other density functions involving exponential forms play the most important role in probability and statistics. They are related in a certain way, as summarized in a diagram later
More informationMAT 571 REAL ANALYSIS II LECTURE NOTES. Contents. 2. Product measures Iterated integrals Complete products Differentiation 17
MAT 57 REAL ANALSIS II LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: SPRING 205 Contents. Convergence in measure 2. Product measures 3 3. Iterated integrals 4 4. Complete products 9 5. Signed measures
More informationExpectation, variance and moments
Expectation, variance and moments John Appleby Contents Expectation and variance Examples 3 Moments and the moment generating function 4 4 Examples of moment generating functions 5 5 Concluding remarks
More informationPart II Probability and Measure
Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationSampling Distributions
In statistics, a random sample is a collection of independent and identically distributed (iid) random variables, and a sampling distribution is the distribution of a function of random sample. For example,
More informationDecreasing Rearrangement and Lorentz L(p, q) Spaces
Decreasing Rearrangement and Lorentz L(p, q) Spaces Erik Kristiansson December 22 Master Thesis Supervisor: Lech Maligranda Department of Mathematics Abstract We consider the decreasing rearrangement of
More informationHomework #6 : final examination Due on March 22nd : individual work
Université de ennes Année 28-29 Master 2ème Mathématiques Modèles stochastiques continus ou à sauts Homework #6 : final examination Due on March 22nd : individual work Exercise Warm-up : behaviour of characteristic
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationBanach Spaces, HW Problems & Solutions from Hunter
Problem 1: Banach Spaces, HW Problems & Solutions from Hunter Ex 5.3: Let δ: C ([,1]) -> R be the linear functional that evaluates a function at the origin: δ(f ) = f (). If C ([,1]) is equipped with the
More informationON THE MOMENTS OF ITERATED TAIL
ON THE MOMENTS OF ITERATED TAIL RADU PĂLTĂNEA and GHEORGHIŢĂ ZBĂGANU The classical distribution in ruins theory has the property that the sequence of the first moment of the iterated tails is convergent
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationMA5206 Homework 4. Group 4. April 26, ϕ 1 = 1, ϕ n (x) = 1 n 2 ϕ 1(n 2 x). = 1 and h n C 0. For any ξ ( 1 n, 2 n 2 ), n 3, h n (t) ξ t dt
MA526 Homework 4 Group 4 April 26, 26 Qn 6.2 Show that H is not bounded as a map: L L. Deduce from this that H is not bounded as a map L L. Let {ϕ n } be an approximation of the identity s.t. ϕ C, sptϕ
More informationNotes 9 : Infinitely divisible and stable laws
Notes 9 : Infinitely divisible and stable laws Math 733 - Fall 203 Lecturer: Sebastien Roch References: [Dur0, Section 3.7, 3.8], [Shi96, Section III.6]. Infinitely divisible distributions Recall: EX 9.
More informationExercises Measure Theoretic Probability
Exercises Measure Theoretic Probability Chapter 1 1. Prove the folloing statements. (a) The intersection of an arbitrary family of d-systems is again a d- system. (b) The intersection of an arbitrary family
More informationChapter 5. Weak convergence
Chapter 5 Weak convergence We will see later that if the X i are i.i.d. with mean zero and variance one, then S n / p n converges in the sense P(S n / p n 2 [a, b])! P(Z 2 [a, b]), where Z is a standard
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 informationMarkov Chain Approximation of Pure Jump Processes. Nikola Sandrić (joint work with Ante Mimica and René L. Schilling) University of Zagreb
Markov Chain Approximation of Pure Jump Processes Nikola Sandrić (joint work with Ante Mimica and René L. Schilling) University of Zagreb 8 th International Conference on Lévy processes Angers, July 25-29,
More informationMath 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.
Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 2017 Nadia S. Larsen. 17 November 2017.
Product measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 017 Nadia S. Larsen 17 November 017. 1. Construction of the product measure The purpose of these notes is to prove the main
More informationExercises in Extreme value theory
Exercises in Extreme value theory 2016 spring semester 1. Show that L(t) = logt is a slowly varying function but t ǫ is not if ǫ 0. 2. If the random variable X has distribution F with finite variance,
More informationAnalysis Comprehensive Exam Questions Fall 2008
Analysis Comprehensive xam Questions Fall 28. (a) Let R be measurable with finite Lebesgue measure. Suppose that {f n } n N is a bounded sequence in L 2 () and there exists a function f such that f n (x)
More informationOrder book resilience, price manipulation, and the positive portfolio problem
Order book resilience, price manipulation, and the positive portfolio problem Alexander Schied Mannheim University Workshop on New Directions in Financial Mathematics Institute for Pure and Applied Mathematics,
More informationLecture 5: Moment generating functions
Lecture 5: Moment generating functions Definition 2.3.6. The moment generating function (mgf) of a random variable X is { x e tx f M X (t) = E(e tx X (x) if X has a pmf ) = etx f X (x)dx if X has a pdf
More informationChapter 5. Measurable Functions
Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if
More information1 Review of di erential calculus
Review of di erential calculus This chapter presents the main elements of di erential calculus needed in probability theory. Often, students taking a course on probability theory have problems with concepts
More information4. CONTINUOUS RANDOM VARIABLES
IA Probability Lent Term 4 CONTINUOUS RANDOM VARIABLES 4 Introduction Up to now we have restricted consideration to sample spaces Ω which are finite, or countable; we will now relax that assumption We
More informationHW2 Solutions. MATH 20D Fall 2013 Prof: Sun Hui TA: Zezhou Zhang (David) October 14, Checklist: Section 2.6: 1, 3, 6, 8, 10, 15, [20, 22]
HW2 Solutions MATH 20D Fall 2013 Prof: Sun Hui TA: Zezhou Zhang (David) October 14, 2013 Checklist: Section 2.6: 1, 3, 6, 8, 10, 15, [20, 22] Section 3.1: 1, 2, 3, 9, 16, 18, 20, 23 Section 3.2: 1, 2,
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationContinuous Random Variables and Continuous Distributions
Continuous Random Variables and Continuous Distributions Continuous Random Variables and Continuous Distributions Expectation & Variance of Continuous Random Variables ( 5.2) The Uniform Random Variable
More information3 Integration and Expectation
3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More information( f ^ M _ M 0 )dµ (5.1)
47 5. LEBESGUE INTEGRAL: GENERAL CASE Although the Lebesgue integral defined in the previous chapter is in many ways much better behaved than the Riemann integral, it shares its restriction to bounded
More informationDefinition: Lévy Process. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 2: Lévy Processes. Theorem
Definition: Lévy Process Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 2: Lévy Processes David Applebaum Probability and Statistics Department, University of Sheffield, UK July
More informationSlides 8: Statistical Models in Simulation
Slides 8: Statistical Models in Simulation Purpose and Overview The world the model-builder sees is probabilistic rather than deterministic: Some statistical model might well describe the variations. An
More informationReducing subspaces. Rowan Killip 1 and Christian Remling 2 January 16, (to appear in J. Funct. Anal.)
Reducing subspaces Rowan Killip 1 and Christian Remling 2 January 16, 2001 (to appear in J. Funct. Anal.) 1. University of Pennsylvania, 209 South 33rd Street, Philadelphia PA 19104-6395, USA. On leave
More informationLebesgue Integration on R n
Lebesgue Integration on R n The treatment here is based loosely on that of Jones, Lebesgue Integration on Euclidean Space We give an overview from the perspective of a user of the theory Riemann integration
More informationSelected Exercises on Expectations and Some Probability Inequalities
Selected Exercises on Expectations and Some Probability Inequalities # If E(X 2 ) = and E X a > 0, then P( X λa) ( λ) 2 a 2 for 0 < λ
More informationHomework 11. Solutions
Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue
More information{σ x >t}p x. (σ x >t)=e at.
3.11. EXERCISES 121 3.11 Exercises Exercise 3.1 Consider the Ornstein Uhlenbeck process in example 3.1.7(B). Show that the defined process is a Markov process which converges in distribution to an N(0,σ
More informationReal Analysis, October 1977
Real Analysis, October 1977 1. Prove that the sequence 2, 2 2, 2 2 2,... converges and find its limit. 2. For which real-x does x n lim n 1 + x 2n converge? On which real sets is the convergence uniform?
More informationLecture Notes in Functional Analysis
Lecture Notes in Functional Analysis Please report any mistakes, misprints or comments to aulikowska@mimuw.edu.pl LECTURE 1 Banach spaces 1.1. Introducton to Banach Spaces Definition 1.1. Let X be a K
More informationAn Abel-Tauber theorem for Fourier sine transforms
J. Math. Sci. Univ. Tokyo 2 (1995), 33 39. An Abel-Tauber theorem for Fourier sine transforms By Akihiko Inoue Abstract. We prove an Abel-Tauber theorem for Fourier sine transforms. It can be considered
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More informationt x 1 e t dt, and simplify the answer when possible (for example, when r is a positive even number). In particular, confirm that EX 4 = 3.
Mathematical Statistics: Homewor problems General guideline. While woring outside the classroom, use any help you want, including people, computer algebra systems, Internet, and solution manuals, but mae
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More informationThe Caratheodory Construction of Measures
Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,
More informationConvergence & Continuity
September 5 8, 217 Given a sequence {x n } n Ξ of elements x n X, where X is a metric space, Ξ is an indexing set. Let Ξ = N Definition (convergent sequence) A sequence {x n } is called convergent sequence
More informationMATH2715: Statistical Methods
MATH2715: Statistical Methods Exercises V (based on lectures 9-10, work week 6, hand in lecture Mon 7 Nov) ALL questions count towards the continuous assessment for this module. Q1. If X gamma(α,λ), write
More informationFinal Exam Practice Problems Math 428, Spring 2017
Final xam Practice Problems Math 428, Spring 2017 Name: Directions: Throughout, (X,M,µ) is a measure space, unless stated otherwise. Since this is not to be turned in, I highly recommend that you work
More informationTAUBERIAN THEOREM FOR HARMONIC MEAN OF STIELTJES TRANSFORMS AND ITS APPLICATIONS TO LINEAR DIFFUSIONS
Kasahara, Y. and Kotani, S. Osaka J. Math. 53 (26), 22 249 TAUBERIAN THEOREM FOR HARMONIC MEAN OF STIELTJES TRANSFORMS AND ITS APPLICATIONS TO LINEAR DIFFUSIONS YUJI KASAHARA and SHIN ICHI KOTANI (Received
More informationExercises: Brunn, Minkowski and convex pie
Lecture 1 Exercises: Brunn, Minkowski and convex pie Consider the following problem: 1.1 Playing a convex pie Consider the following game with two players - you and me. I am cooking a pie, which should
More informationSolutions to Assignment-11
Solutions to Assignment-. (a) For any sequence { } of positive numbers, show that lim inf + lim inf an lim sup an lim sup +. Show from this, that the root test is stronger than the ratio test. That is,
More informationRecall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm
Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify
More informationON APPROXIMATE HERMITE HADAMARD TYPE INEQUALITIES
ON APPROXIMATE HERMITE HADAMARD TYPE INEQUALITIES JUDIT MAKÓ AND ATTILA HÁZY Abstract. The main results of this paper offer sufficient conditions in order that an approximate lower Hermite Hadamard type
More information02. Measure and integral. 1. Borel-measurable functions and pointwise limits
(October 3, 2017) 02. Measure and integral Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2017-18/02 measure and integral.pdf]
More information