Write the computed function values as , where . The computed central finite difference satisfies
The two contributions are respectively evaluation absolute error and truncation error. For , step-size choice for a noisy central derivative minimizes their sum: its derivative is , negative before and positive after
If , the bound tends to zero as and has no positive minimizing step.
By Taylor's theorem with Lagrange remainder, for an increment ,
where lies between and . The given third derivative bound implies .
Minimize the square of the Euclidean distance, using minimizers under strictly increasing transformations. For ,
For fixed the unique minimum has . Put and . Its derivative is
Let . Since , it is strictly increasing, with limits and at the two ends of . It therefore has exactly one zero. The sign of changes there from negative to positive, proving the unique global minimum. The nearest point is at that zero.[ref]
The Newton root-finding iteration is
Starting at gives , , and . Moreover certifies the rounding. Thus to three significant figures; more accurately .
The map is strictly increasing on : for , if and only if . Therefore a point has the smallest -value if and only if it has the smallest -value, and the same applies to . By minimizers under strictly increasing transformations, both asserted argmin equalities hold, including when the argmin sets are empty. The differentiability assumptions are unnecessary for this order argument.
Let . Applying the same measurable function separately to independent and identically distributed random variables preserves those two properties, and
In particular, these bounded random variables are integrable random variables. The weak law of large numbers gives
If , then , whose probability tends to zero. If , then , whose probability also tends to zero. Taking a complement in the second case proves
The positive gap from is essential to this argument. Convergence in probability alone does not determine the answer at the excluded threshold .
Write . Since , the map is increasing on , and for ,
Differentiation gives
and zero outside this interval. Since , this is exactly the beta distribution probability density function with parameters . The power transform of a uniform random variable therefore satisfies ; the second parameter does not depend on .
The same integral works with both powers shifted:
The assumptions and say precisely that the exponents at each endpoint are greater than , ensuring integrability there. Values of a negative power at the endpoints themselves can be assigned arbitrarily, because those endpoints have probability zero. This establishes the mixed power moments of a beta distribution without requiring and to be integers.[ref]
Multiply the probability density function by and integrate over its support:
The middle equality is the beta function integral with parameters and ; the last uses the recurrence for the gamma function. Both parameters are positive, so the integral converges. Equivalently, multiplying the beta distribution probability density function by converts its kernel to that of a beta distribution probability density function with its first parameter increased by one.[ref]
For a probability density function , the finite expected value is
The absolute integrability condition makes the signed integral unambiguous. One can also allow an extended expectation when exactly one of the positive and negative parts has infinite integral, obtaining or . If both parts have infinite integral, the expectation is undefined; subtracting two infinities is not a definition.

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