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.
Write and . Path continuity gives . Stop the martingale at the bounded stopping time and apply the optional stopping theorem:
By the monotone convergence theorem, , so almost surely. Path continuity then gives . The dominated convergence theorem for the bounded variables shows
Next stop the quartic Hermite polynomial martingale from part (a), again only at . Its expectation is zero, so
Monotone convergence proves , establishing the needed second-moment integrability before the final passage to the limit. Since and , dominated convergence gives
Consequently the Brownian symmetric interval-exit moments are
To obtain the Laplace transform of symmetric Brownian interval-exit time, put . The Exponential martingale for Brownian motion shows that
is a martingale with . Bounded-time stopping gives . Its stopped values are bounded by , so dominated convergence applies as . Since , it yields
Every use of stopping at has thus been justified through bounded stopping and an explicit integrability or domination argument.
Use the independent increments of Brownian motion, rather than merely checking that an Itô formula drift vanishes. For , put and write , where is independent of and has normal distribution . Its first four moments are . Therefore
For the cubic expression, the coefficient of after conditioning is , so makes it . For the quartic expression, choose . Its conditioned coefficient of is then . The constant term becomes
which equals when . Thus a standard choice is
The resulting stochastic processes are Hermite polynomial martingales and . They are genuine integrable martingales, since Gaussian moments are finite at every finite time and the displayed conditional identities establish the martingale property directly.
The choice is not unique. Constants give the valid family , , and : these add to the cubic martingale and to the quartic one. The boxed choice sets these harmless additions to zero.
Take two independent rate-one Poisson processes and , and let
The difference of independent Poisson processes starts at zero and has stationary increments and independent increments. Its paths are càdlàg. For an interval of length , the probability of any jump is , proving stochastic continuity. Thus is a Lévy process. The characteristic function of a Poisson distribution with mean is , so independence gives
The sample paths are integer-valued step functions with jumps or . On every bounded interval there are only finitely many jumps, and independent Poisson arrival times coincide with probability zero. The combined arrival rate is two: holding times are independent exponentials of rate two, and each jump direction has probability , independently of the holding times. This is equivalently a Compound Poisson process of rate two with Rademacher distribution jump sizes. Its paths have finite variation on compact time intervals, although there are infinitely many jumps over the whole half-line almost surely.
For fixed , write . Independent increments and stationary increments give
The preceding part gives continuity. Also never vanishes: if with , then for every positive integer , contradicting .
Here is a direct proof of the exponential form of Lévy characteristic functions. Choose small enough that on . The principal complex logarithm gives a continuous there, with . For with , the multiplicative identity implies
This difference is continuous on the connected triangle of allowed and equals zero at , so it is identically zero. Thus satisfies the additive Cauchy functional equation locally. Subdivision gives and ; continuity then gives for every .
Define . For any , choose an integer with ; then
The coefficient is unique: if two coefficients give the same exponential for every , their derivatives at zero agree. In particular , and follows from . The characteristic exponent of a Lévy process has therefore been obtained from first principles, without invoking the Lévy–Khintchine formula.
Fix and let . For any , use to obtain
The probability tends to zero by stochastic continuity. Taking the limit superior and then letting proves
This proves continuity of Lévy characteristic functions from the elementary estimate, without requiring moments or replacing convergence in probability by an unjustified almost sure limit. At , time approaches from the right. If stochastic continuity is formulated only at zero, stationary increments give the same argument at every : the absolute value of has the law of . For the characteristic function is identically one.
A real Lévy process is a real-valued stochastic process with the following properties:
One convention also includes càdlàg paths in the definition. Equivalently, under the intrinsic definition above one chooses the càdlàg modification, which exists for such a stochastic process. Thus the usual working version of a Lévy process has right-continuous paths with left limits. There is no assumption of finite moments or continuous paths.
Put . For , conditional Jensen inequality applied to the convex function shows that
is a nonnegative submartingale. Its integrability follows from the square integrability of . If , then , since . The Doob maximal inequality for a nonnegative submartingale yields
where zero mean removes the cross term. For completeness, the maximal inequality follows by stopping at the first crossing: on the event of a crossing at , the submartingale property gives . Sum over , and use nonnegativity on the event of no crossing.
The derivative of the last ratio is
For , the minimum over is attained at . Substitution gives the one-sided maximal inequality for a centered square-integrable martingale:
If , almost surely and almost surely for every , so the bound also holds. The optimization is the same one underlying the Cantelli inequality, but the submartingale argument controls the entire finite-time maximum.
The Martingale convergence theorem says that a discrete-time martingale satisfying
has an almost sure convergence limit , finite almost surely and in . The theorem asserts that the limit is integrable; it does not assert convergence in L1. More generally, the almost sure submartingale convergence theorem applies to a submartingale with . Uniform integrability is the additional condition that upgrades a martingale's convergence to convergence in L1.
For the requested distinction, let be independent fair Bernoulli variables and use their natural filtration. The coin-doubling martingale
is a nonnegative martingale: conditionally on , the next factor is with mean one, so . Also for every , giving the required uniform bound. The probability that all the Bernoulli variables equal one is . Therefore a zero is eventually encountered almost surely, after which stays zero. Thus
There can be no other limit, since convergence in L1 implies convergence in probability, whose limit must agree with the almost sure limit. This martingale satisfies the almost sure theorem but does not converge in .
Assume Riemann hypothesis. First fix and work on . We prove the subpower zeta bound to the right of the critical line, then move back to the line by the functional equation and Phragmén–Lindelöf principle.
Put for large positive and integrate the supplied smoothed logarithmic derivative identity horizontally from to two. There are no zeros on this path under Riemann hypothesis, so the Euler-product logarithm at continues along it. Each prime-power term contributes at most , and the smoothing weights are at most one. Hence the integrated prime terms are bounded by
All zeros have . The local zero-count estimate from Question 3, with its reflected version for negative ordinates, gives uniformly for
To see the uniformity, sum the zeros in successive unit ordinate intervals against ; the distant dyadic tails are summable. The zero-term numerator has modulus at most . Its integrated contribution is therefore at most . The integrated supplied remainder is , also . Since is bounded, we obtain
Thus for every fixed and , . Negative follow by complex conjugation.
The zeta functional equation and the gamma ratio give . Zeta is holomorphic throughout this strip, since its pole at one is outside it, and Euler summation supplies polynomial vertical growth. The strip convexity conclusion of Phragmén–Lindelöf principle therefore gives at the midpoint
For a prescribed , choose and with ; the bounded range is harmless. This proves
The explicit-formula estimate is deliberately first made a fixed distance to the right of the critical line. No divergent zero bound at is used.
The Riemann hypothesis says that every Nontrivial zero of the Riemann zeta function of has real part . The Lindelöf hypothesis says that, for every ,
The exponent may be arbitrarily small; the implied constant may depend on that exponent. The next part proves the implication from the first hypothesis to the second.
Use the distinct reduced fractions with , and , regarded in . The fraction zero appears as ; one is the same circle point and is not added a second time. For two distinct such points, the ordinary difference and its possible wrapped complement are nonzero integer multiples of . Hence
This proves the required separation of the Farey fractions.
For the matrix , operator norm duality gives . Thus the analytic large sieve inequality
is equivalent to the dual bound with the roles of and exchanged and the conjugate exponential. The absolute constant is independent of all the parameters.
Here is a Fejér-kernel proof of the analytic large sieve. Choose an integer center of the summation interval and an integer large enough that the triangular weights are at least throughout it. Their Fourier kernel is , with
For fixed , spacing allows at most a bounded number of points at each successive distance . Splitting at gives the row bound
In detail the near terms contribute at most , and the square-decay tail contributes ; when , the tail is bounded directly by .
Expand the weighted dual square sum. Its matrix entries have the kernel just estimated. The symmetric row bound, or , bounds the quadratic form by . The weights majorize half the desired interval, proving the dual inequality and hence the primal inequality. This supplies the sieve estimate with an absolute constant, including the technical interaction between close pairs and the kernel's decaying tail.
The quotient-circle norm is , independent of the chosen lift . A finite set is -well-spaced when every two distinct points satisfy . This is separation in the circle metric, including the distance across the identified endpoints.
Put . The reference to part (c) in the printed hint is a reference to the positive-coefficient function from part (b). For close to one, the preceding positivity and the supplied partial-fraction expansion give
All omitted zero terms have nonnegative real parts because their real parts are at most one. The zeta-pole remainder is included in , increasing the absolute constant if needed; a nonprincipal primitive real conductor of a Dirichlet character is at least three.
Suppose there were two real zeros, counted with multiplicity, with . Set . Division by gives
Choose , and . The right side is strictly negative. Thus
This is the uniqueness of a possible exceptional real Dirichlet zero. It proves uniqueness, rather than existence of such a zero.
The Dirichlet-series coefficients are
They are multiplicative. At a prime power, their values are if , one for even and zero for odd if , and one if . Thus every is nonnegative. In particular . This is the nonnegative zeta-times-real-L coefficients identity. The same Euler expansion gives for , with coefficients .
For , the Euler product positivity for L-function nonvanishing gives
Indeed the logarithm expands into terms proportional to . At primes dividing , the character terms vanish and the remaining zeta term is positive. For a nonreal character, is nonprincipal, so its L-function is entire, even if imprimitive.
If vanished to order , the product would be as : zeta has a simple pole, the last factor is bounded, and the middle factor has the asserted vanishing. The product would tend to zero, contradicting its lower bound one. This proves nonvanishing for every real , including zero.

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