Bayes formula for conditional expectation Created 2026-09-28 Updated 2026-11-05
Suppose is a probability measure with , so and . For a sub-sigma-algebra , write . If is integrable under , then on ,
This is Bayes formula for conditional expectation. It changes the underlying probability measure as well as conditioning on the available information. The set where has zero -probability, so a version there can be chosen arbitrarily.
To verify the formula, let denote the ratio. For , measurability of and the tower property give . These are exactly the defining conditional-expectation identities. For a filtration, choosing gives the usual time-indexed form. The denominator is the likelihood weight after reducing the full information to , not the original pointwise weight .
Conditional Borel-Cantelli lemma Created 2026-09-24 Updated 2026-11-05
Let be a filtration. For events , put . Then almost surely on , while almost surely on . The proof applies the martingale convergence theorem to compensated sums and uses Kronecker lemma in the divergent case.
Dyadic filtration Created 2026-10-14 Updated 2026-11-05
On with Lebesgue probability measure, the dyadic filtration is generated by the partitions into half-open cubes of side . The conditional expectation of an integrable function is its average on each atom. The increasing partitions generate the Borel sigma-algebra. Step functions on these partitions are dense in ; approximation and the Doob maximal inequality show that their conditional averages converge in and almost everywhere to the original function.
Filtration (probability theory) Created 2026-09-28 Updated 2026-11-05
A filtration is an increasing family of sigma-algebras: whenever . It represents the information available as time passes.
Jump measure of a Markov jump process Created 2026-10-14 Updated 2026-11-05
For a Markov jump process with off-diagonal rate kernel , the jump measure records the jump time and the destination state. Relative to a filtration for which the process has the Markov jump property, its predictable compensator is the displayed rate measure, up to explosion. The corresponding generator is . An enlarged filtration revealing future jumps need not preserve this compensator, so the filtration condition is essential.
Markov jump process Created 2026-10-14 Updated 2026-11-05
A Markov jump process is a nonexplosive, piecewise-constant continuous-time Markov process. Transition rates give exponential holding time of rate and next-state probabilities proportional to these rates. Being Markov relative to a specified filtration requires the conditional future law given that filtration to depend only on the present state.
Martingale problem for a continuous-time Markov chain Created 2026-09-24 Updated 2026-11-05
Let be an adapted Càdlàg process on a finite state space, and let be a conservative transition-rate matrix. It solves the martingale problem for when, for every real function on the state space,
is a martingale for the specified filtration. On a finite state space all such test functions and their generator values are bounded.
A Continuous-time Markov chain with generator has this property by Dynkin's formula. Conversely, fix a terminal time and put for . The backward equation gives . Applying the martingale identities to its finitely many time-dependent coefficients shows is a martingale. Thus
Testing state indicators recovers the entire conditional transition law, proving the Markov property and identifying its semigroup. The càdlàg and filtration assumptions make this a path-process characterization, rather than a statement only about separately fixed-time versions.
Optional time-change theorem Created 2026-09-28 Updated 2026-11-05
A precise continuous Optional time-change theorem is the following. Let be a continuous local martingale with for a filtration satisfying the usual conditions. Let be a family of random times: every is a finite Stopping time, and its sample paths in are continuous and nondecreasing, with . Then
is a continuous local martingale for the time-changed filtration . The stopping-time sigma-algebra, rather than the deterministic-time sigma-algebra at , describes the information available after the clock has advanced to .
For a proof, localize by increasing stopping times so that is bounded. Optional sampling makes a bounded martingale for . The new-clock stopping times tend to infinity, because each is finite and . continuity of the clock identifies the process stopped at with the corresponding old-clock Stopped process. These are localizers for .
The quadratic variation transforms by . Applying the same argument to proves the identity. A Finite-variation process remains of finite variation on each compact new-time interval, since its variation is bounded by the old variation up to the finite time .
For example, the deterministic clock , , turns standard Brownian motion into a Gaussian martingale of variance . General random time substitutions require the stopping-time and filtration conditions; path continuity alone establishes continuity, not the martingale claim.
Use a filtration with respect to which is Brownian. The process is adapted and continuous because it is a continuous function of and . The moment-generating function gives
For , write
The increment is independent of and normal with variance , so the conditional expectation of the second factor is one. Thus
This verifies the martingale property from the definition and proves square integrability at each finite time, as well as continuity. It does not assert uniform square integrability over an infinite time horizon.
Lévy's characterization of Brownian motion states that a real continuous local martingale with and quadratic variation is a standard Brownian motion with respect to its filtration. Equivalently, its increments are independent of the past and have centered normal distribution with variances equal to elapsed times.
Let . The running maximum is continuous and adapted, so is bounded and progressively measurable process. It has a predictable version for integration; changing its value at the single switching time does not change its stochastic integral. Thus is a continuous local martingale starting at zero. Since ,
Lévy's characterization of Brownian motion yields is standard Brownian motion. The sign depends on the entire past through the running maximum, but the unit quadratic-variation rate is exactly what the characterization needs.
Fix a finite horizon and use the completed natural Brownian filtration. Martingale representation theorem states that every can be written
where is predictable and is unique up to equality for almost every .
The Martingale representation theorem states that every square-integrable martingale in this filtration has a continuous version of the form
with the same integrability and uniqueness condition. The completed natural filtration has only null-set randomness at time zero, so is almost surely constant. The first statement gives the second by representing and taking conditional expectations; the second gives the first by taking .
There is also the local version: every local martingale in the Brownian filtration has a continuous version representable by a predictable, locally square-integrable integrand. The filtration restriction matters; an enlarged filtration with independent additional martingales need not have representation using alone.
A finite-horizon form of Girsanov theorem is as follows. If is predictable, almost surely, and its stochastic exponential is a true martingale of mean one, then under the probability the process
is Brownian motion. The same conclusion holds on the completed natural filtration, since a strictly positive density gives equivalent probabilities.
Part (b) establishes precisely the required density martingale and integrand . Therefore
In particular it is the requested local martingale. Equivalently, under , solves , the Brownian bridge drift coefficient toward at time one. Keeping avoids the singular endpoint in this density change.
Single marked exponential jump process Created 2026-10-14 Updated 2026-11-05
Let be a rate-one exponential random variable independent of a uniform random variable on . In its natural filtration, this Markov jump process jumps once from zero to its mark and then stays there. Its destination rate kernel is . For a Borel mark set , the martingale follows directly from the memoryless residual lifetime. Information about the future mark or lifetime must not be inserted into the initial filtration.
Time-changed filtration 2026-11-05
A time-changed filtration records the information available after a new clock has reached an old time. Let be a filtration and let be a nondecreasing family of finite stopping times. Define
The second expression is the stopping-time sigma-algebra. If and , then
Thus , as required for a filtration.
For the deterministic clock , the new information is , not . A continuous adapted process sampled at these stopping times is adapted to the new filtration. Preservation of the local martingale property requires further hypotheses such as those in the optional time-change theorem; merely substituting arbitrary random times does not establish it.