For , let be the number of completed upcrossings by the observations : buy when the value is at most , sell at the first subsequent value at least , and repeat. With , one form of the Doob upcrossing inequality for a martingale is
For completeness, hold either zero or one unit according to this rule. The holding at each step is measurable before the next martingale increment, so the total gain has expected value zero. Completed trades earn at least each; an unfinished trade loses at most . Thus , proving the inequality.
Suppose . For each rational pair the inequality and monotone convergence give
Every rational interval therefore has only finitely many upcrossings, simultaneously outside a countable union of null sets. If , there is a rational interval strictly between them and infinitely many upcrossings, a contradiction. Thus the limit exists in the extended real line almost surely. Fatou's lemma now gives
The limit is finite almost surely and integrable. This proves the martingale convergence theorem rather than using it as the deduction.
The exact extra condition for convergence in L1 is uniform integrability:
To see sufficiency, first discard the tails of uniformly and the tail of the integrable . On the set where both absolute values are at most , their difference is bounded by and tends to zero almost surely; dominated convergence finishes the proof. Conversely, if in , then
Make the first term uniformly small for all sufficiently large , then control the finitely many remaining integrable variables by increasing . Hence uniform integrability is necessary too. In this case the conditional expectation identity follows by taking the limit in for .
The coin-doubling martingale shows why an bound is not enough. Let be independent fair coin indicators and set
Conditional on the first coins, the next value is either or zero with equal probabilities, so this is a nonnegative martingale. Its expected value is always , while a first failure occurs almost surely, giving almost surely. Yet for every . Indeed, whenever , its tail expected value above is still . Thus convergence in L1 fails because uniform integrability fails.
A Lévy measure on the real line is a nonnegative Borel measure satisfying
It records the intensity per unit time of jumps of a Lévy process. Under the additional small-jump first-moment condition, the uncompensated Lévy–Khintchine formula is
where and . The integral is absolutely convergent: near zero its integrand has absolute value at most , while outside a neighborhood of zero it is at most and has finite mass. If the usual compensated Lévy–Khintchine formula uses drift , this convention has .
A Lévy process starts at zero and has stationary independent increments and stochastic continuity. Its characteristic function at time is , with and continuous. The given time-one characteristic function is strictly positive. It therefore has the unique continuous logarithm vanishing at zero,
Any other continuous exponent would differ by an integer multiple of ; continuity on the real line and the value at zero make that integer identically zero. This determines all increment laws. More explicitly, for ,
Thus it determines every finite-dimensional distribution. For the standard càdlàg version of a Lévy process, coordinates at rational times determine the path, so these laws determine the entire process law on its canonical path space as well.
To find the Lévy measure, try the symmetric density . Its jump exponent is
Differentiation under the integral is justified by the integrable bound . The elementary Fourier sine transform gives
Since , integration in yields . Choosing matches the prescribed exponent exactly. This is the Lévy measure of a symmetric Laplace time-one law:
The candidate satisfies the Lévy measure condition because its density is of order near zero and decays exponentially at infinity; moreover . Uniqueness of the triplet in the Lévy–Khintchine formula proves that these are the required coefficients. The infinite mass near zero means infinitely many small jumps, not a Gaussian component; their total variation is finite on bounded time intervals because .
On the real line, Prohorov's theorem states that a sequence of probability measures is uniformly tight if and only if every subsequence has a further subsequence converging weakly to a probability measure. Here uniformly tight means that, for every , some compact interval contains mass at least for every measure in the sequence. This is relative sequential compactness for weak convergence of probability measures, not merely the existence of one convergent subsequence.
We first prove the characteristic-function tail bound. Put . For ,
At the expression is zero by continuity. If , the supplied elementary bound, with , makes it at least . The integrand is nonnegative, so Tonelli's theorem yields
Thus one valid universal constant is
The estimate controls spatial tails using only the characteristic function near zero.
Apply it to each . For fixed , pointwise convergence of the characteristic functions and the bound allow dominated convergence on the finite integration interval, giving
Continuity of a characteristic function and make the last expression tend to zero as . Given , choose making it less than ; then for all sufficiently large , the preceding tail is less than . Enlarge the compact interval to handle the finitely many remaining probability measures. This proves uniform tightness of the whole sequence.
By Prohorov's theorem, every subsequence has a further weakly convergent subsequence, say with limit . The real and imaginary parts of are bounded continuous functions, so along that subsequence
The uniqueness theorem for characteristic functions implies . All subsequential weak limits are therefore . If the original sequence failed to converge weakly to , a bounded continuous test function and a subsequence would keep its integrals a fixed distance from the limiting integral; a further weakly convergent subsequence would contradict that. Hence
This supplies the required proof of the Lévy continuity theorem in the stated case.
For the final request, the printed is not defined; the intended function is , the characteristic function of a summand. We prove that without assuming integrability. Write . Independence gives . Moreover convergence in probability to implies uniform convergence of these characteristic functions on each bounded frequency interval: for and ,
First let , then .
The potential logarithm-branch ambiguity needs to be resolved, not discarded. By continuity of near zero, its principal complex logarithm is defined at for all and all large , with value zero at . Also
uniformly on , so uniformly there. The two continuous logarithms differ by an integer multiple of :
That integer is continuous in and zero at zero, hence identically zero. Consequently
For arbitrary nonzero , take and . Eventually , so dividing the preceding error by shows . Exponentiating at zero proves the derivative forced by the weak law:
This is the weak law forces a characteristic-function derivative argument. Its estimates use bounded exponentials, not . If is integrable, dominated convergence permits differentiation inside the expectation and gives , so then .
Absolute integrability is genuinely unnecessary. For an explicit weak law without an absolute first moment, take a symmetric variable with
with mass at zero and no mass with . This is a valid law: the specified tail decreases from to zero, and its derivative defines the continuous part beyond . Its absolute first moment is infinite because . For independent copies, set . Symmetry gives , and integration of the tail gives
For the last estimate, split the integral at ; the initial part is and the remainder is at most , apart from a fixed initial constant. Chebyshev's inequality now gives in probability. The probability that any truncation changes a summand is at most , so in probability although . The derivative is zero, but the usual expectation of does not exist.
If either the positive or negative part is integrable, the finite weak-law limit does force full integrability. For example, if , then is integrable and its sample averages have the weak law of large numbers limit . Since they are bounded above by the original averages, for every . Letting shows . The symmetric argument handles the other one-sided hypothesis. The nonintegrable example necessarily has both one-sided expectations infinite.
For , the continuous martingale is . Since has the centered normal distribution of variance ,
For , the continuous martingale is . The Gaussian fourth moment gives
This verifies both cases. The time integral in the printed identity is understood with its omitted .
Write . The derivatives of the approximations are
Thus . The Itô formula gives . This use of the formula is valid despite the two second-derivative discontinuities: mollify the function , whose derivative is Lipschitz. Its smooth derivatives converge boundedly, while the second derivatives are bounded by and converge except at . For every , the normal distribution of assigns those points zero probability. Dominated convergence for the drift integral and the Itô isometry for the stochastic integral pass the smooth formula to . Equivalently, this identifies the martingale in the assumed decomposition and permits its cross-covariances to be calculated.
If , then . The Itô isometry and Doob L2 maximal inequality therefore give, for every fixed ,
The Gaussian density is bounded by , so
Consequently the processes are Cauchy in the complete space of continuous random paths with norm . They have a continuous-path limit there. Limits obtained for different integer horizons agree on overlaps; choose these versions consistently. Each is adapted, and passing to the limit in shows that is a continuous martingale. Letting in the preceding bound proves the requested convergence, with an explicit rate:
The same Itô isometry identifies , with .
There is a genuine factor-of-two error in the last printed conclusion. The stated has second derivative almost everywhere, and the generator in the decomposition is one half of the second derivative. Hence the exact identity is
Because and , this already proves uniform convergence on bounded intervals to . It does not by itself prove almost-sure convergence of the full sequence, so we supply that additional step.
Take . For each fixed integer and each , the maximal-error bound and Markov's inequality imply
The first Borel-Cantelli lemma, applied to rational positive and integer , gives uniform almost-sure convergence of this subsequence on every bounded interval. Therefore uniformly there almost surely.
For , the indicator windows are nested. The ratio-one interpolation for shrinking-window occupation integrals gives
Both ratios tend uniformly to one as . The two bounds converge uniformly to the continuous nonnegative process , so the entire sequence does too. Thus the correct normalized conclusion is
and with the factor actually printed in the question the limit is
These are the occupation approximations for Brownian local time. In the Tanaka formula convention, is the local time of a semimartingale at zero. It is not identically zero: for , since starts at zero and is a martingale. Thus the discrepancy cannot be removed by treating the two limits as equal. The standard normalization is also given in Lalley's notes on the Itô calculus and local time.
A martingale describes an observable after its predictable drift has been removed. For a Markov chain the drift is the change produced by its transition operator; for Brownian motion it is one half of the Laplacian. Requiring the resulting processes to be martingales for a sufficiently rich class of observables determines the transition law itself. The same identities, combined with optional stopping, determine hitting probabilities, expected exit times and recurrence or transience. The duplicated Q5 paragraph in the PDF is a repeated printing of this one essay request.
For a finite or countable-state Markov chain with transition matrix , define for a bounded test function . The Markov property says . Consequently
is a martingale, since each increment has conditional expected value zero. Conversely, if these processes are martingales for every bounded , taking the conditional expectation of an increment recovers that identity. With it gives for every state . Thus, given the initial law, these identities characterize the Markov chain, not merely a few of its moments. This is the discrete-time Markov chain martingale characterization.
The drift operator is . If away from a target set, is a stopped martingale, where is the first hit of that set. Under boundedness or suitable uniform integrability, the optional stopping theorem expresses in terms of boundary hitting probabilities. Similarly, if away from the target and on it, then is a martingale, giving when the terminal limit is justified.
For a concrete calculation, take a simple symmetric random walk on stopped at , its first hit of or . In the interior, has zero drift, while satisfies
The stopped identity gives , proving finite with finite mean. Bounded convergence in both stopped identities now yields the gambler's ruin answers
This illustrates why the integrability justification is part of using a martingale, rather than an automatic consequence of writing an equation.
For a finite-state continuous-time Markov chain with generator matrix , the corresponding martingale problem for a continuous-time Markov chain uses
These are martingales. Conversely, suppose an adapted càdlàg finite-state process satisfies these identities. Let , fix , and set . Then . Apply deterministic integration by parts to the finite collection of indicator martingales to obtain the time-dependent Dynkin formula: is a martingale. Therefore
This recovers the Markov property and the entire semigroup, proving the characterization. On countable spaces one uses nonexplosion and localization to justify the analogous unbounded-rate formulas.
For -dimensional Brownian motion, the Itô formula shows that, for ,
is a true martingale, since its bounded derivatives make the integral square-integrable on each bounded horizon. This is the martingale problem for Brownian motion with generator .
Here is why it also characterizes Brownian motion. Suppose a continuous adapted process , with , satisfies that martingale problem. Use smooth cutoff test functions equal to and inside successively larger balls, and stop before leaving those balls. The coordinate tests show that are continuous local martingales; the product tests show that are local martingales. The Itô product rule consequently gives
the difference between the two proposed compensators is a continuous finite-variation local martingale, hence constant and zero at time zero. For each , another application of the Itô formula gives the exponential local martingale
Its modulus is the deterministic quantity , so it is a true martingale on every bounded time interval. Taking its conditional expectation and dividing by its known value at time gives
The conditional characteristic function identifies a centered multivariate normal distribution of covariance , independent of the past. Together with continuity, this is the defining law of Brownian motion. This proves the Lévy characterization of multidimensional Brownian motion in the form needed for the generator characterization.
The analytic use of these martingales parallels the chain case. A harmonic function satisfies , so it yields a stopped local martingale until the process leaves its domain of harmonicity. Bounded stopped observables permit optional stopping and solve boundary hitting problems. A solution of with zero boundary values gives an expected exit time. For example, in the ball of radius , gives ; stopping first at proves finiteness and justifies the limiting calculation. The Brownian local time construction in Q4 is another example: the predictable compensators of approximations to recover its increasing occupation term.
We now prove the required three-dimensional transience of Brownian motion in dimension at least three, in the strong sense almost surely. Start first at a point with , and let be the first exit from this annulus. The radial Laplacian in dimension three gives
Thus is a bounded martingale. The exit time is finite: stopping gives . At exit, continuity puts at either or . The optional stopping theorem therefore yields
and hence the Brownian sphere-hitting probability in dimension three
As , the events increase to : a continuous path is bounded on the finite interval preceding any finite inner hit. This argument assumes no transience. Consequently
To pass from a positive escape probability to almost-sure eventual escape, take Brownian motion started at zero. Let be its first hit of the sphere of radius . Stopping the squared-norm martingale proves . At , the Strong Markov property and the preceding hitting formula give
The Strong Markov property here follows from independent Brownian increments by approximating a stopping time from above with dyadic-valued stopping times and using path continuity. Choose . The exit times increase to infinity, since a continuous path is bounded on every compact time interval. The events of a return to the closed ball of radius after decrease and have probabilities . Their intersection has probability zero. Thus almost surely there is some finite exit time after which the path never again enters that ball. Apply this simultaneously to all positive integer . This proves the last visit to a bounded ball for three-dimensional Brownian motion conclusion and therefore

Articles by others on the same topic (0)

There are currently no matching articles.