For the unit-width box kernel, the order-zero local polynomial estimator minimizes, over constants ,
A common factor such as in these weights does not change the minimizer. Put and . If , differentiating the quadratic gives its unique minimizer:
The last expression is the Nadaraya–Watson estimator. Every is within of some design point . Since gives , that point is in the closed kernel window. Thus and the equality holds throughout the domain, including and .
For the error bound, first take the usual bandwidth range . The clipped window has length at least . Any closed interval of length in contains at least points of the design . Consequently
where the last inequality uses . This is a window occupancy for an equally spaced regression design bound that remains valid at the boundary.
Let , the Lipschitz constant supplied by the bounded-derivative assumption. The bias is bounded by
Independence and the variance bound give
By the Cauchy-Schwarz inequality and the triangle inequality,
Thus works uniformly in and the design size in this bandwidth range. The same clipped-length proof in fact works for .
There is a genuine omission in the unrestricted formulation: an upper restriction on bandwidth is necessary for the displayed variance scale. Take , , and . The window contains the sole observation for every , and holds. Its mean absolute error is , whereas the proposed variance term is . No fixed can satisfy this for unbounded .
A valid statement for every satisfying uses . The clipped window has length at least , so , while the preceding coverage argument gives . If , the first bound gives ; if , the second does. Therefore the same bias and variance calculation proves the unrestricted correction
This mean absolute error of local constant regression bound reduces to the requested rate for ordinary small bandwidths and saturates its stochastic term when the window covers the whole design.
Use half-open intervals and set
The Haar scaling functions and Haar wavelets are
For fixed , each scaling function has squared integral , and different have disjoint supports, proving that this family is orthonormal. Each wavelet also has norm one and integral zero. At a fixed level, distinct wavelets have disjoint supports. At different levels, their dyadic supports are either disjoint or the finer support lies in a half on which the coarser wavelet is constant. The finer wavelet has integral zero, so their inner product vanishes. Finally, a wavelet with is supported inside a unit interval; it is orthogonal to its containing because its integral is zero, and to all other unit scaling functions because their supports are disjoint. Thus both the scaling family at each fixed level and the complete stated Haar family are orthonormal sets.
The Haar refinement identity is
It shows that the closed scaling spaces satisfy , where is the closed span of the level- wavelets. The union of the is dense in : continuous compactly supported functions can be approximated in by their dyadic cell averages, and such continuous functions are dense in . Hence the orthonormal Haar family is also a complete orthonormal basis.
For a locally integrable function, define the compact-support coefficient integrals
These exist without requiring . The two formulas for the Haar approximation are
For the wavelet sum is empty. For every fixed , these sums are locally finite, so they make sense pointwise and locally in . The refinement identities and their orthogonal two-by-two coefficient transformation establish equality by induction, even for merely locally integrable . If , this is also the orthogonal projection onto .
In particular, for and ,
Now impose the symmetry and monotonicity conditions. The limit zero and decrease on imply for . For , the cell average and every value inside lie between and . Therefore
Summing over the positive half-line telescopes and gives a bound . Reflection maps each dyadic cell to another dyadic cell up to endpoints. Since is even, its Haar approximation is even almost everywhere as well, so the negative half-line has the same error. Consequently
The argument proves integrability of the difference, even if itself is not integrable on the whole line. It is the symmetric monotone case of the Haar approximation error for a function of bounded variation.
For the unit-width box kernel, the convolution and kernel density estimator are
and
In particular . The scaling gives . Even if is not square-integrable, Young's convolution inequality gives because and .
Using independence to eliminate the cross terms in the centred estimator, and Tonelli theorem to integrate the nonnegative variance, gives the exact integrated variance of a kernel density estimator:
The Cauchy-Schwarz inequality now yields
This constant comes from the unit norm of the unscaled unit-width box kernel.
For the piecewise constant probability density function, integrability forces the constants on both unbounded outer intervals to be zero. Thus is bounded, has compact support, and has finitely many jumps. Let denote the jump at . For smaller than the least gap between consecutive breakpoints, the smoothing regions do not overlap. Outside these regions the convolution equals .
Within a region, put . For , the bias is ; for , it is . Endpoint values do not affect an norm. Integrating these two triangular errors gives
This is the box-kernel bias of a piecewise constant density. By the triangle inequality, with ,
Balancing this bias-variance tradeoff with gives, for all sufficiently large ,
Write and . A function bracket contains the measurable functions satisfying for every . Require its endpoints to be integrable and call its width. A sufficient condition is that, for every , finitely many brackets of width at most cover the whole class . Under this condition the uniform strong law from finite L1 bracketing states
The conclusion holds outside a common measurable null set. If the supremum is not initially known to be measurable, this formulation means pathwise convergence on a measurable probability-one event; a pointwise separable function class, including the application below, has a measurable supremum. Pointwise brackets also ensure the sample inequalities hold simultaneously over the class.
To prove the result, choose a finite -cover , . If belongs to bracket , monotonicity of the empirical measure and of expectation gives
and
Consequently
Apply the strong law of large numbers to these finitely many integrable endpoints. On a probability-one event, the maximum tends to zero. Repeat with , , and intersect the countably many probability-one events. The limiting supremum is bounded by for every , hence is zero. This proves the uniform law of large numbers without a boundedness assumption on the class itself.
For the moment-generating function, use the empirical measure estimator
If , this estimator and are both identically one. Otherwise, makes increasing in , and provides an integrable envelope. The dominated convergence theorem shows that is continuous on , hence uniformly continuous.
For any , choose a partition so that for every . If , then for every . These endpoint functions form finitely many integrable function brackets with the required widths. The just-proved uniform law of large numbers therefore gives
Both functions of are continuous; their supremum equals the supremum over a countable dense subset, so it is measurable. This proves uniform consistency of an empirical moment-generating function using only the observed sample.

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