For a positive function in the domain of a Markov jump-process generator, the generator martingale for and semimartingale integration by parts give the displayed local martingale. Suitable finite-horizon deterministic bounds on and make it a true martingale. For a single marked exponential jump process, take . Then the exponent's compensating process is , where for and ; it is continuous adapted and hence predictable.
At a positive state , the future is constant. At zero, the residual holding time is independent rate-one exponential and the next state is an independent uniform mark. Thus the conditional future given the natural filtration depends only on the present state: is a Markov jump process. For any bounded Borel , its transition semigroup is
The Lévy kernel of a Markov jump process, written in destination-state convention, is
In displacement convention it has the same expression , since its only nonzero jump rate is from zero. The Markov jump-process generator is .
We state the generator martingale theorem used here: for a nonexplosive Markov jump process and a bounded with bounded , the process is a true martingale. In this one-jump model it also follows directly from part (a), first for mark indicators and then by bounded-function approximation.
Take , and put
Here . Therefore choose the previsible process
It is continuous adapted and thus predictable. To verify the exponential, write with the generator martingale . The semimartingale integration by parts formula, using the continuous finite-variation factor , gives
Thus is a local martingale. On each fixed horizon it is bounded by , so it is a true martingale with . This is the exponential martingale from a jump generator; for it reduces to the constant process one.
For continuous semimartingales , the semimartingale integration by parts formula is
Indeed each partition increment satisfies
Summing telescopes the left side. The first two sums converge to the stochastic integrals by left-endpoint approximation, and the last sum converges to the quadratic covariation by polarization of the quadratic-increment formula. All limits are in uniform convergence on compacts in probability. Hence the equality holds at every time outside one null set, using continuity. In differential notation it is the Itô product rule .
For a vector of continuous semimartingales and , the multidimensional Itô formula is
One route from the product formula is to apply it repeatedly to powers and products of the coordinates, obtaining this expression for polynomials; polarization identifies the mixed second derivatives. Time is another coordinate of finite variation, so it has no quadratic-covariation contribution. Localize to compact ranges, approximate a function and its indicated derivatives by smooth polynomial approximations, and pass to the limit using stochastic-integral continuity and the variation bounds on the finite-variation terms. Equivalently, second-order Taylor expansion along partitions gives the same limit, with integration by parts accounting for every quadratic term.
For càdlàg semimartingales, the semimartingale integration by parts formula is
For continuous processes the left limits can be replaced by the values. The bracket includes the jump products in the general formula.
For a continuous -valued semimartingale and , the Itô formula is
The formula is localized when the derivatives are unbounded; continuity of makes them bounded after stopping on compact sets.
To prove the one-dimensional formula for polynomials without assuming that formula, use induction. It is immediate for constants and . Suppose
Write with a continuous local martingale and finite variation. The induction hypothesis identifies the martingale part of as . The stochastic-integral covariation identity, obtained by polarization from the quadratic-variation identity, gives
Apply semimartingale integration by parts to . Its first-order terms combine to , and its bracket terms combine to
This proves the induction step. Taking linear combinations proves the polynomial Itô formula from integration by parts for every polynomial .