A Note on Positive Supermartingales in Ruin Theory. Klaus D. Schmidt

Similar documents
Lecture 8: Convergence of transformations and law of large numbers

J. Stat. Appl. Pro. Lett. 2, No. 1, (2015) 15

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

MDIV. Multiple divisor functions

Lecture 19: Convergence

An alternative proof of a theorem of Aldous. concerning convergence in distribution for martingales.

SEMIGROUPS. D. Pfeifer. Communicated by Jerome A. Goldstein Dedicated to E.S. Lyapin on his 70th Birthday

Asymptotic distribution of products of sums of independent random variables

Self-normalized deviation inequalities with application to t-statistic

Notes 19 : Martingale CLT

Lecture 3 : Random variables and their distributions

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

BETWEEN QUASICONVEX AND CONVEX SET-VALUED MAPPINGS. 1. Introduction. Throughout the paper we denote by X a linear space and by Y a topological linear

Glivenko-Cantelli Classes

Rademacher Complexity

Central limit theorem and almost sure central limit theorem for the product of some partial sums

The Boolean Ring of Intervals

ST5215: Advanced Statistical Theory

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

7.1 Convergence of sequences of random variables

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

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

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002

Chapter 6 Infinite Series

for all x ; ;x R. A ifiite sequece fx ; g is said to be ND if every fiite subset X ; ;X is ND. The coditios (.) ad (.3) are equivalet for =, but these

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

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

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

BIRKHOFF ERGODIC THEOREM

Sequences and Series of Functions

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

Berry-Esseen bounds for self-normalized martingales

An elementary proof that almost all real numbers are normal

Regression with an Evaporating Logarithmic Trend

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS

7.1 Convergence of sequences of random variables

A survey on penalized empirical risk minimization Sara A. van de Geer

On forward improvement iteration for stopping problems

MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES

Distribution of Random Samples & Limit theorems

Math 140A Elementary Analysis Homework Questions 3-1

2.2. Central limit theorem.

Mi-Hwa Ko and Tae-Sung Kim

A Proof of Birkhoff s Ergodic Theorem

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

APPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS

Chapter IV Integration Theory

Math 132, Fall 2009 Exam 2: Solutions

Boundaries and the James theorem

Solutions to HW Assignment 1

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

Different kinds of Mathematical Induction

lim za n n = z lim a n n.

Estimation of the essential supremum of a regression function

An Introduction to Randomized Algorithms

INFINITE SEQUENCES AND SERIES

STAT331. Example of Martingale CLT with Cox s Model

1 Convergence in Probability and the Weak Law of Large Numbers

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

Chapter 8. Euler s Gamma function

The Positivity of a Sequence of Numbers and the Riemann Hypothesis

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors

5 Birkhoff s Ergodic Theorem

THE STRONG LAW OF LARGE NUMBERS FOR STATIONARY SEQUENCES

Notes 5 : More on the a.s. convergence of sums

5.1 A mutual information bound based on metric entropy

MATH 312 Midterm I(Spring 2015)

A Note on the Kolmogorov-Feller Weak Law of Large Numbers

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS

Lecture 12: Subadditive Ergodic Theorem

Axioms of Measure Theory

Best bounds for dispersion of ratio block sequences for certain subsets of integers

Solutions to Tutorial 5 (Week 6)

Bounds for the Positive nth-root of Positive Integers

Riesz-Fischer Sequences and Lower Frame Bounds

MAT1026 Calculus II Basic Convergence Tests for Series

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

Approximation theorems for localized szász Mirakjan operators

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Optimally Sparse SVMs

This section is optional.

Introduction to Probability. Ariel Yadin. Lecture 7

Optimal Two-Choice Stopping on an Exponential Sequence

Beurling Integers: Part 2

The natural exponential function

1. Introduction. g(x) = a 2 + a k cos kx (1.1) g(x) = lim. S n (x).

Beyond simple iteration of a single function, or even a finite sequence of functions, results

HOMEWORK 4 SOLUTIONS. E[f(X)g(Y ) A] = E f(x)e[g(y ) A] A = E[f(Y ) A]E[g(Y ) A],

MATH4822E FOURIER ANALYSIS AND ITS APPLICATIONS

Probability and Random Processes

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

Asymptotic Formulae for the n-th Perfect Power

6. Uniform distribution mod 1

Hoggatt and King [lo] defined a complete sequence of natural numbers

Research Article On the Strong Laws for Weighted Sums of ρ -Mixing Random Variables

Probability for mathematicians INDEPENDENCE TAU

Entropy Rates and Asymptotic Equipartition

Transcription:

A Note o Positive Supermartigales i Rui Theory Klaus D. Schmidt 94-1989

1 A ote o positive supermartigales i rui theory Klaus O. SeHMIOT Semiar für Statistik, Uiversität Maheim, A 5, 0-6800 Maheim, West Germay I this ote we give a elemetary proof of Kolmogorov's iequality for positive supermartigales. As a applicatio we obtai a Ludberg type iequality for a class of surplus processes with i.i.d. icremets for which a adjustmet coefficiet eed ot exist. Keywords: Adjustmet coefficiet, Kolmogorov's iequality, Ludberg's iequality, positive supermartigales, rui theory.

2-1. Itroductio All radom variables cosidered i this paper are defied o a fixed probability space (Q,F,p) For a subset A of Q, let X A deote its idicator fuctio Q : --? {0,1}. Let G be a itegrable radom variable. G has a adjustmet coefficiet if there exists some RE: (0,00) satisfyig E[e- RG ] = 1 ; ecessary ad sufficiet coditios for a adjustmet coefficiet of G to exist have bee give by Mammitzsch (1986). Cosider ow u E:(0,00), a sequece {G } of i.i.d. radom variables havig the same distributio as G, ad the surplus process {U }, give by U := u + L G k k=1 for all E:JN. If G has a adjustmet coefficiet, the the probability of rui satisfies Ludberg's iequality P ( if JNU < 0 ) -Ru < e Gerber (1973,1979) has show that Ludberg's iequality ca be obtaied from Kolmogorov's iequality for positive supermartigales. Ufortuately, however, the traditioal proofs of Kolmogorov's iequality ivolve a otrivial property of supermartigales, ad it appears that this fact makes the supermartigale approach appear much less attractive tha it iso

3 - I this ote we give a etirely elemetary proof of Kolmogorov's iequality for positive supermartigales. As a immediate applicatio, we obtai a Ludberg type iequality for a class of surplus processes for which a adjustmet coefficiet of G eed ot exist.

4-2. Kolmogorov.s iequality Let {X } be a sequece of itegrable radom variables. For each E ln, let F deote the a-algebra geera ted by {X 1'...,X }. A mappig -r : g ~ ln U {co} is a stoppig time if {-r=}e F holds for all E ln, ad it is bouded if SUPg -r(w) < co Let T deote the collectio of all bouded stoppig times for {F }. For -re T, defie X-r co The X is a itegrable radom variable satisfyig -r EX = -r co ote that all sums exted oly over a fiite umber of terms sice -r is bouded. The followig result is well-kow i the theory of asymptotic martigales; see e.g. Gut ad Schmidt (1983) ad the refereces give there: 2. 1 Lemma. The iequality P ( supln IX I ~ e: holds for all e: E (O,co) Proof. Let us assume that the X are all positive. For all E ln, defie sets := : = -1 {X ~ e:} Q{X k < e:} g 'U Bk k=1

- 5 - ad a stoppig time 1: E T by {1:=k} J Bk := L BUC lettig if ke{1,.,-1} if k = The we have E [ ] ri I: EX B < E X k=1-1: k hece <, by the mootoe covergece theorem, ad thus < which yields the assertio. o The sequece {X } is a supermartigale if E[x A X + 1 1 < E[xAXl holds for all E JN ad A E F 2.2. Lemma. If {X } is a supermartigale, the EX1: < EX 1 holds for all 1:E T Proof. Choose E E satisfyig 1: < The we have E[X{1:=k}Xkl + E[X{1:>k+1}Xk+11 < E[X{1:=k} X kl + E[X{1:>k+1}Xkl = E[X{1:>k}Xkl for all k E {1,,}, ad thus, by iductio, EX 1: = = as was to be show. o Tho followig result is Kolmogorov's iequality for positive supermartigales:

6-2.3. the Theorem. If {X } is a positive supermartigale, P ( supm X ~ e: < holds for all e: E (0,00) This follows from Lemmas 2.1 ad 2.2. We remark that Theorem 2.3 is usually deduced from the otrivial fact that a positive supermartigale {X } satisfies EX~ ~ EX 1 for arbitrary stoppig times ~ i see e.g. Neveu (1972).

- 7-3. Ludberg's iequality We ow retur to the surplus process {U } 3.1. Theorem. The iequality -pu P( ifmu < 0 < e holds for all p E (0,00) satisfyig E [e-pg] < 1. Proof. For all E m, defie The we have X := k=1 -pgk e for all E m ad A E F Therefore, {X } is a positive supermartigale, ad Theorem 2.3 yields = P( supm I: (-G k ) > u ) k=1 < < e -pu E [e -pg1 ] -pu e as was to be show. o Defie ow I (G) := { t E JR I E [etg] < 00 } ad J(G) := { t E JR I E [etg] < 1 } As a cosequece of Theorem 3.1 we obtai the followig result:

8-3.2. Corollary. If if I(G) < 0 < EG, the P( if m U ~ 0 ) ~ ifj(g) e tu < 1. Proof. The assumptio o G implies the existece of some te (-co,o) satisfyig E[e tg ] < 1 ; see Mammitzsch (1986). The assertio ow follows from Theorem 3.1. o 3.3. Corollary. the P ( if m U ~ 0 If G has a adjustmet coefficiet R, -RG < e This follows from Corollary 3.3. We remark that the hypothesis of Corollary 3.2 does ot imply that G has a adjustmet coefficiet; see Mammitzsch (1986).

9 Refereces Gerber, H.U. (1973). Martigales i risk theory. Mitt. Verei. Schweiz. Vers. Math. 2i, 205-216. Gerber, H.U. (1979). A Itroductio to Mathematical Methods i Risk Theory. Irwi, Homewood (Illiois). Gut, A., ad Schmidt, K.D. (1983). Amarts ad Set Fuctio Processes. Lecture Notes i Mathematics, vol. 1042. Spriger, Berli - Heidelberg - New York. Mammitzsch, V. (1986). A ote o the adjustmet coefficiet i rui theory. Isurace Math. Ecoom. ~, 147-149. Neveu, J. (1972). Martigales a Temps Discret. Masso, Paris.