Set . The Brownian martingale representation theorem applied to the bounded terminal variable supplies a continuous adapted version of , so it is predictable. Hence
is predictable and satisfies . For every square-integrable predictable process , conditioning at each deterministic time and using Fubini theorem gives
Thus part (d) says . Taking , which is an allowed predictable square-integrable process, makes its squared norm zero. We conclude
This is the Clark-Ocone formula for a smooth Brownian terminal payoff, with exactly the uniqueness established in part (c).
Multiply the representation in part (c) by and take expectations. This Itô integral has mean zero, and the bilinear form of the Itô isometry gives
Equating this with part (b), and writing both ordinary integrals with the same time variable, yields
All terms are integrable by the Cauchy-Schwarz inequality, the assumed square integrability of , and boundedness of . This is an orthogonality statement against predictable processes; its second term need not itself be predictable.
The terminal variable is bounded and hence square-integrable. In the completed natural Brownian filtration, the Brownian martingale representation theorem says that any square-integrable -measurable variable admits a representation
with predictable and . Extend by zero after . Thus the requested constant and integrability are
Expectation determines uniquely. If two integrands give the same representation, the Itô isometry gives . Consequently is unique up to -almost everywhere equality, rather than pointwise equality at every time. The corresponding integral martingales are indistinguishable.
First take a bounded elementary predictable process , with each bounded and -measurable and with finite time support. The Itô integral is the corresponding finite sum . Applying part (a) term by term gives
Such elementary predictable processes are dense among predictable processes in . The Itô isometry makes the left functional continuous, with bound
The Cauchy-Schwarz inequality makes the right functional continuous, with bound . Approximation therefore proves the same identity for every allowed predictable . The integral over the infinite time interval is the limit of its finite-horizon Itô integrals.
If , then is -measurable. Independence and centring of the future Brownian increment make the desired left side zero; the time multiplier on the right is zero as well.
Suppose . Conditional on , write and . The pair is jointly normal and independent of , with
Apply the supplied Gaussian integration by parts formula to , treating the known as its parameter. This gives
Multiply by the bounded -measurable and use the defining property of conditional expectation. Thus the required expectation identity holds for every , including intervals crossing or lying after .
The density is strictly positive. The Gaussian moment-generating function gives , so it defines an equivalent probability measure.
The joint normal distribution of , with covariance , gives the mixed exponential formula
Multiplying by the normalizing and centring factors therefore yields
The characteristic function identifies the answer:
This is exponential tilting of an isonormal Gaussian process: the mean shifts by the inner product while its covariance remains unchanged.
For any , the linearity from part (a) gives
almost surely, and the right side has a normal distribution. This is the defining linear-combination criterion for a multivariate normal distribution; singular covariance matrices are allowed.
Passing to the limit in the inner products of the partial sums gives
The passage to the limit is justified by Cauchy-Schwarz inequality and convergence. Equivalently, the vector's characteristic function is
Thus both joint normality and the complete covariance matrix follow from the Hilbert-space inner product.
For , put . Fix and , and set
for large enough that . The Brownian reflection principle and the Gaussian tail estimate give
Since , the sum of these probabilities is finite. The Borel-Cantelli first lemma implies that, almost surely, for all sufficiently large ,
Now take . The function is increasing for , so
Here the positive upper bound for can first be divided by , and the denominator can then be bounded below by ; this remains valid even when . Moreover,
Thus, for each fixed pair ,
Use the countable choices and , intersect their probability-one events, and let . This proves the Brownian upper law of the iterated logarithm:
Only large times are involved. The hint's related monotonicity assertion for is also valid eventually: the derivative of is , which is negative for . No monotonicity at the small-time edge of the logarithmic expression is required.
Sample Brownian motion at integer times and put . Every has normal distribution , although the are correlated. Let
For every fixed integer ,
because almost surely. The right-hand expression depends only on the future independent increments with . Thus is, up to a null set, a tail event of those independent increments, and its probability is zero or one by the Kolmogorov zero-one law.
For any finite real , every exceeds with the same positive probability . For each ,
Taking the decreasing intersection over shows that infinitely often with probability at least . This event implies , so . The zero-one law makes it one. Intersecting over positive integers gives almost surely. The continuous-time limit superior is at least the one along integers, hence
This proves that Brownian fluctuations exceed the square-root scale without needing the lower bound in the law of the iterated logarithm.
Let be the interpolation in part (a). The operation
is continuous, since . By the Donsker invariance principle and the continuous mapping theorem,
The exact trapezoidal integral of the linear interpolation is
Therefore the statistic in question differs from by . Using independence, zero means, and unit variances gives
This error tends to zero in , hence in probability. The Slutsky theorem now proves the integrated random-walk limit:
The limiting law can also be made explicit. The time integral is a Gaussian random variable, as a mean-square limit of linear combinations of a Gaussian process. It is centered, and the covariance identity gives
Thus the terminal value of integrated Brownian motion here has law .
The Skorokhod embedding of a centered random walk states that a random walk with independent identically distributed centered steps of finite variance can be realized on an appropriate probability space as
where is a standard Brownian motion and the are finite stopping times. More precisely, the stopped positions have the same joint law as the given random walk, and the pairs
may be chosen independent and identically distributed. Their spatial component has the step law, and . Repeating the one-step Skorokhod embedding theorem with the Strong Markov property gives this formulation. In the present normalization, the mean time increment is one, and the strong law of large numbers gives almost surely.
The Donsker invariance principle states that the linearly interpolated diffusively rescaled random walk
converges weakly as a random element of , equipped with the uniform norm, to standard Brownian motion restricted to . At the fractional term is zero. The only step assumptions needed here are zero mean, unit variance, and independent identical distributions; a higher moment or bounded support is not required. This is a functional central limit theorem, concerning the entire interpolated path rather than only its endpoint.
Fix and put . The stopping time property implies that is an -measurable random variable with values in : for ,
and for the event is the whole space. By part (c), the restriction of to is -measurable.
The evaluation map is measurable from to this product space: the inverse image of a measurable rectangle is . Composing it with the jointly measurable stochastic process gives an -measurable random variable
Since this holds for every fixed , the stopped process is adapted. If path regularity holds only almost surely, first apply the proof to its pathwise regular representative; with a completed filtration, the original stopped variable differs only on a null event and is also -measurable. The adaptedness of a stopped right-continuous process requires neither boundedness of nor a martingale assumption; is harmless because .
Relative to a filtration , progressive measurability means that, for every , the map
is measurable for the product sigma-algebra and the Borel sigma-algebra on .
Fix and divide into equal subintervals with mesh . Define
Since is adapted, every random variable is -measurable, hence -measurable. Each approximation is consequently -measurable. For , its sampling time lies strictly to the right of , tends to , and never exceeds . Right continuity implies ; at equality is exact. Thus is the pointwise limit of measurable functions on this product space. As was arbitrary, is progressively measurable. This is the theorem that right-continuous adapted processes are progressively measurable.
The right-endpoint approximations need not themselves be adapted at their intermediate times. What the proof requires is their joint measurability with respect to the single terminal sigma-algebra . The proof uses the pathwise càdlàg convention. If path regularity is assumed only almost surely, under a completed filtration setting the stochastic process to zero on its common exceptional null event gives an indistinguishable progressively measurable version. Arbitrary values on that null event need not make the original stochastic process progressively measurable: even with a complete filtration, a null sample point may be assigned a non-Borel time function. This is why almost sure path regularity does not ensure progressive measurability.
For each nonnegative rational , equality of the two versions gives . Intersect these countably many full-probability events with the full-probability event on which both paths are càdlàg. Call the resulting event ; then .
Fix and any real . Choose rational numbers decreasing to . Right continuity gives
The same event works for every , because the argument is pathwise after is fixed. The stochastic processes are therefore indistinguishable. This proves that càdlàg versions are indistinguishable; the left limits are not needed for this implication, since right continuity alone suffices.
A version of a stochastic process means a stochastic process on the same probability space such that, for every fixed ,
The exceptional null set may depend on . Indistinguishability of stochastic processes means that there is one null set outside which for all simultaneously.
For an example separating the definitions, let have uniform distribution on , and set
For every fixed , , so is a version of a stochastic process with original stochastic process . But for every sample outcome the stochastic processes differ at its time . Hence
The spike path of is not right-continuous at , which explains why the next part's regularity assumption rules out this example.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact