For , the bound ensures the finite moment . By Jensen's inequality, . The process is an adapted, nonnegative integrable random variable at each time, and independence gives
Thus is a submartingale, and . The Doob maximal inequality for a nonnegative submartingale states that for . Apply it with . Since the power function is increasing on ,
Combining this with the preceding bound gives
The result is a bound on the running maximum, which is why a maximal inequality for a submartingale, rather than an estimate of the single terminal random variable, is needed.[ref]
The conditions on the cumulative distribution function imply almost surely. With , adjoin and the trivial . The random variables are nonnegative, adapted, and bounded by at each fixed time. Independence and give
Thus this is the product martingale from independent mean-one factors, with . The almost sure supermartingale convergence theorem states that a nonnegative supermartingale converges almost surely to a finite integrable random variable. Applied to this nonnegative martingale, it shows almost surely. Every convergent real sequence is bounded, so almost surely.
The printed maximum can in fact be taken literally here. If almost surely, all products equal . Otherwise the strict Jensen equality criterion, applied to the strictly convex function on , gives . Independence yields . By Markov's inequality, for every . The First Borel-Cantelli lemma and the countable choices give almost surely. Since , a sequence with this limit attains its positive supremum among finitely many initial terms. This is an instance of fractional moment decay of independent mean-one products.
Yes. The preceding calculation established . For every , the stopped martingale satisfies
Here is a single nonnegative integrable random variable that bounds the whole family. Thus, for any ,
The last limit follows from the dominated convergence theorem. This is precisely uniform integrability. It also gives with convergence in L1, and therefore , consistently with the preceding answer. A common bound on the individual expected values alone would not have sufficed; the integrable dominating random variable is what supplies control of every tail.
Solutions to every part of all three questions of the probability, measure and martingales course of the University of Oxford Part B examination, sat on 5 June 2023. Source: original released PDF, bundle pages 288–291; paper pages 1–4. The native PDF confirms the endpoint defect in Question 2: its slope formula evaluates outside when . We specify values on that null set below. Question 1(b)'s literal measurability assertion uses everywhere sign-valued random variables; for arbitrary versions with the stated probability distributions, it holds up to null sets, as explained in the solution.
A family of integrable random variables is uniformly integrable when
The Lipschitz condition gives, on ,
Our chosen zero value on satisfies the same bound. Hence the random variables are integrable, and for every tail expectation in the definition vanishes. Therefore the family is uniformly integrable.
Every is a Borel measurable function of , by the formula involving the floor function. Thus
Conversely, part (i) gives the everywhere identity . For fixed , this is the pointwise limit of random variables measurable with respect to . Such a limit of a sequence is measurable, so . Consequently
These are increasing-precision observations even when the first finitely many are discarded; they do not behave like the independent random variables whose tail sigma-algebra appears in Question 1(b).
For , repeated use of the floor function identity gives
Thus the filtration satisfies . Each positive-probability atom of a sigma-algebra here has the form
with probability ; is a possible additional null set atom. Averaging over each dyadic interval gives a version
For a globally defined version of the right side, assign any value, for example zero, on .
Indeed, the displayed random variable is -measurable and bounded by . On each its integral is
by the uniform distribution. Every member of is a union of the displayed sets and the possible zero-probability atom. Summing these identities therefore verifies the defining conditional expectation property on all of .
The uniformly integrable martingale convergence theorem states that a uniformly integrable martingale has an integrable terminal random variable such that almost surely and in the L1 norm, and
The last identity follows by passing to the limit of a sequence in for and , using convergence in L1.
Part (b)(iii) verifies uniform integrability for , so
Moreover almost surely. In this particular problem the common bound also yields convergence in Lp for every finite , including convergence in L2: the dominated convergence theorem applies to . General uniform integrability alone does not assert these higher-power conclusions.
A discrete-time stopping time for a filtration is a random variable taking values in such that for every . It means that whether stopping has occurred by time can be determined from the information available then.
For the first elimination time,
Each event in this finite union belongs to , by the definition of the natural filtration. Therefore is a stopping time. This verification does not require first knowing whether is finite almost surely.
We first establish the lower truncation identity as well. The pair has the same hypotheses as , because conditional expectation is linear and negation preserves equality of probability distributions. Apply part (ii) to this pair and multiply by to get
For every real ,
Using this identity, part (ii), the lower truncation identity, and linearity of conditional expectation gives
In particular the argument does not assume that a function obtained by scalar clipping is a convex function or a concave function.
Write . The bounded random variables and have the same probability distribution, and the displayed identity identifies the latter as the conditional expectation of the former. They are square-integrable, so part (i) gives almost surely. Take and discard the countable union of exceptional null sets. At every remaining outcome, let to obtain
Thus conditional expectation preserving a distribution forces equality even when only integrability is assumed.
The function is a concave function, and is integrable since . The concave form of the conditional Jensen inequality gives
The random variables and have the same probability distribution, so . Using the law of total expectation, the nonnegative difference between the right and left sides of the inequality has zero expectation. It must vanish almost surely. Therefore
The equality comes from the distributional assumption as well as the conditional Jensen inequality.
Assume is square-integrable. Since and have the same probability distribution, is also square-integrable and . The product is integrable by the Cauchy-Schwarz inequality.
We use the defining test-function identity for conditional expectation: for bounded -measurable , . Take and let . The dominated convergence theorem, with bounds and , gives
This is the extension of the conditional expectation pull-out identity to this square-integrable multiplier. Consequently
A nonnegative random variable with zero expectation is zero almost surely. Hence
Geometrically, this is the equality case in the L2 space orthogonal projection interpretation of conditional expectation.
Let . Inverse images commute with complements and countable unions, so this is a sub-sigma-algebra of . The random variable is -measurable.
The assumption says that is a measure-preserving transformation. Consequently has the same probability distribution as and is integrable. It also implies for every integrable random variable , first for indicator functions, then for simple functions, and then by positive and negative approximation.
To identify a conditional expectation, take any . The assumed identity with the bounded random variable gives
Every member of has the displayed form , so this verifies all defining conditional expectation identities. Therefore
Apply part (iii), since this conditional expectation has the same probability distribution as . We conclude
This is invariance from integral duality for a measure-preserving transformation; neither invertibility of nor a second moment of is required.
The independent identically distributed central limit theorem states that for independent identically distributed random variables with finite mean and positive finite variance ,
For , continuity, strict monotonicity and the endpoint limits of the cumulative distribution function give a unique . Then . Thus has the uniform distribution on , by the probability integral transform.
For , when , and it is zero otherwise. Therefore its probability density function is : the exponential distribution of rate one. By integration by parts, and , so .
The variables are independent because they are separate measurable functions of independent random variables. The probability integral transform makes all of them identically distributed as , even though the need not be identically distributed. The displayed is exactly . The central limit theorem therefore gives
A linear combination of independent normal random variables is normal, with variances adding when the coefficients are . Applying the joint central limit approximation from (i) gives
Equivalently the difference minus , divided by the displayed standard deviation, converges in distribution to a standard normal under the same regular large-sample regime.
Markov's inequality states that for a nonnegative random variable and ,
It follows immediately from and monotonicity of expectation. A finite expectation makes the bound informative.
Expand the analytic factor around zero by the binomial series:
Every coefficient is nonnegative. Adding to the constant coefficient gives probabilities with sum . Define for . This is a nonnegative integer-valued random variable and its probability generating function is exactly . The power series has radius , so the evaluations and derivatives used below are finite.
The event is the same as . Apply Markov's inequality to the nonnegative random variable and use part (iv):
The strict numerical comparison is enough even though the probabilistic inequality itself is non-strict.
Using the Cauchy distribution from the preceding part gives one common probability space for all starting points:
As with , almost surely, since is a finite real random variable almost surely. Continuity of at zero gives almost surely, and boundedness supplies an integrable constant bound. Dominated convergence theorem therefore proves
The argument applies to every sequence approaching zero, including tangential approaches. Along the real boundary the extension is already , which is continuous. Hence the extension is continuous at zero in the closed half-plane. No finite moment of the Cauchy distribution is required.
Apply Itô's formula to . The quadratic-variation correction cancels the finite-variation term:
Localization of the integrand proves that is a nonnegative continuous local martingale.
For completeness, Conditional Fatou lemma says that for nonnegative random variables ,
Choose a localizing sequence such that each stopped is a martingale. Fatou first gives . For , its conditional form then gives
Thus is a supermartingale.
A sufficient condition for it to be a true martingale on is Novikov's condition
Under this condition the stochastic exponential is a uniformly integrable martingale on that finite interval. Requiring it for every finite gives the martingale property at all finite times; it does not automatically give uniform integrability as .