Let and . The Lipschitz continuity of cosine and the Cauchy-Schwarz inequality imply
The centered expectation term contributes ; omitting it would leave the Lipschitz bound incomplete. In particular has continuous sample paths on the compact cube, so its maximum exists and is measurable.
Put
Choose a Cartesian finite net whose coordinate spacings are at most , including the endpoints. Every point of the cube is within Euclidean norm distance of , and
On the event , replacing any by a nearby grid point changes by at most . Since and , this is less than . Therefore
The Markov inequality bounds the first event by . At a fixed , the summands are centered, independent and identically distributed, and have absolute value at most . The supplied Hoeffding inequality, with , bounds each grid event by
A union bound now gives
The choice of balances the cost of a large random Lipschitz constant against the covering number of the cube: . Consequently works, with
This uses only the first moment and has a constant independent of . The finite net is deterministic even though the Lipschitz constant is random.
The printed assertion is false as a supremum bound uniform over shrinking bandwidths. The supplied hint proves a pointwise stochastic order with constants uniform in . Taking the supremum inside the probability changes the problem: a growing number of spatial windows produces a logarithmic cost. We first establish the valid consequence of the hint, then give a counterexample satisfying the printed assumptions.
For , let , and . The Invariant distribution of an Itô diffusion has a probability density function bounded above and bounded away from zero on the required compact interval. Choosing therefore gives constants such that , uniformly for and .
For the centered function , . Outside , . The given second-moment estimate and the Chebyshev inequality yield
On the event , the drift coefficient contributes an average whose error is at most , by Hölder continuity. The Itô isometry and stationarity give . Another use of the Chebyshev inequality proves
This also accounts for the zero-denominator convention through the first exceptional event. The bound proves pointwise , uniformly in the location's tail probabilities. It supplies no bound for the probability of a supremum over all locations.
For an explicit counterexample, take and the bounded globally Lipschitz function
It has Lipschitz constant , exponent , and satisfies the inward-drift conditions with , . The stochastic differential equation has a unique strong solution of a stochastic differential equation. Its Invariant distribution of an Itô diffusion has density
The exponent is zero on , equals when , and equals outside . This verifies integrability, positivity and a constant density on the central interval. Start the Itô diffusion in this Invariant distribution of an Itô diffusion to obtain the required stationary process.
Set and choose windows with centers , . Their intervals are disjoint and lie in , where the drift is zero. Write
Then whenever . The same occupation bound as above gives for . With , a union bound and the Chebyshev inequality imply
The quadratic variations are , and the cross quadratic covariations vanish since the windows are disjoint. Each clock tends to infinity almost surely: for any fixed window, the occupation estimate at times , followed by the Borel-Cantelli lemmas, gives . The Knight theorem for orthogonal martingales therefore represents using independent standard Brownian motions . This theorem is applied to the finite collection for each ; no growing-dimensional central limit theorem is being assumed.
On the preceding clock event, compare each time-changed Brownian motion with its value at deterministic time . The Brownian reflection principle and a union bound show that, for every fixed ,
This bound does not require the Brownian motions to be independent of their clocks. In particular, in probability. The variables are independent random variables. Their Gaussian maximum exceeds with probability tending to one: for , integration of the normal density over gives , and hence
Since on the clock event, it follows that, for some ,
But for this bandwidth. Thus the error after subtraction of and multiplication by is not bounded in probability, contradicting the printed stochastic order. The valid pointwise bound above is provable; the uniform shrinking-bandwidth assertion is not. This counterexample shows why a uniform rate needs at least a enlargement of the noise scale. If is instead held fixed and constants may depend on , this counterexample does not contradict that different interpretation.

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