The time already elapsed since the noise is minutes. Conditional on a particular noise time and on still being in progress, memorylessness of the exponential distribution gives
This law does not depend on . Averaging over the conditional distribution of therefore leaves the same remaining-time law. Hence
The elapsed minutes are not subtracted from the original mean; the exponential residual lifetime has the same mean after any elapsed duration.
Use the lower limit for the inner integral:
Hence
The prefactor is the probability that interruption occurs; the remaining exponential is its conditional positive tail. This is the positive difference of independent exponential waiting times. The exponent is dimensionless because both and are measured in minutes.
On interrupted outcomes, ; on the other outcomes the sentinel value is negative and cannot exceed . Consequently
On the diagram in part (b), this is the first-quadrant region below , starting at the horizontal intercept . It lies strictly inside the interruption region .
Integrate over the region :
Therefore
This is also the two-clock case of competing exponential clocks. A larger mean time to noise increases this probability, while a larger mean service length decreases it.
For a small rectangle of side lengths , independence makes its probability approximately . Thus the joint probability density function is the product
Adding the probabilities of disjoint small rectangles covering a region of integration, and taking their sizes to zero, gives the double integral of this product over that region. Without independence, the two marginal distributions alone would not determine the joint probability density function.
Take on the horizontal axis and on the vertical axis, both nonnegative. There is no interruption when the noise occurs after the scheduled ending, namely . This is the part of the first quadrant above the diagonal . Equality has probability zero, so assigning the boundary either way does not affect the calculation.
The same original diagram below also marks the region used in part (e); its lower boundary offset is an illustrative positive choice of .
Figure 1.
The no-interruption region above the diagonal and the region of positive remaining time exceeding a chosen threshold
. Details.
The cubic Taylor polynomial about is
If has a continuous fourth derivative near , Taylor's theorem gives equal to this polynomial plus . With continuous derivatives only through third order, the corresponding remainder is . An equality with an infinite Taylor series would require additional convergence information, rather than just the existence of these four terms.
Change the summation index to . Then runs from to . Each term for cancels its partner , and the zero term contributes nothing. The sole unpaired term is , so
Differentiate the product in the definition of . Using the identity in (b),
The last expression is , so
Also separately. This is the Hermite polynomial derivative recurrence in the physicists' normalization.
Let , so . Differentiate this identity times, for . By the Leibniz rule, only the first two derivatives of the linear factor can contribute:
Rearranging proves
The case is the starting identity , treated separately without introducing a negative derivative order.
In the physicists' Hermite polynomial convention, begin by differentiating the Gaussian function:
The defining prefactor then gives
The derivative-based definition uses nonnegative integers; negative orders are not part of this polynomial 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