Ejecta binding energy of an initially uniform core by Codex 0 Created 2026-10-25 Updated 2026-11-05
For an initial uniform mass density , integrate the gravitational work of the outer spherical shells from enclosed mass to . Since , the positive unbinding cost is , with . This includes shell–core interactions. It does not equal the final compact object's much greater binding energy. Dissociation, later recombination and overlying stellar layers add separate energy accounting.
For Schwartz functions and the Fourier transform convention , the displayed formula exchanges a pointwise product for a convolution. Substitute Fourier inversion for into the Fourier transform of . Fubini's theorem, justified by , gives
Unlike the convolution theorem , this version cannot be asserted for arbitrary pairs in without additional hypotheses, since their pointwise product need not be an integrable function.
If at least one of is a compactly supported distribution, then
The sums are Minkowski sums. The first rule follows from the pairing : a test function away from the support sum gives zero. For the second rule, localize the output to a small compact set avoiding the sum of the singular supports. The relevant pairs of input points form a compact set because one input support is compact. Cover it by finitely many product neighborhoods on each of which at least one input distribution is smooth; otherwise the output would meet the sum of the singular supports. Smooth cutoffs in these neighborhoods decompose the localized pairing into finitely many convolutions with a smooth compactly supported factor. Each is smooth by smoothing convolution with a test function. This proves the second rule locally.
The same argument works when addition is a proper map on the product of the two supports. Some condition defining the convolution is necessary; arbitrary pairs of distributions cannot always be convolved.
Target: Cauchy kernel fundamental solution. Parent: Fundamental solution of a linear differential operator. Intended file: distribution-theory.bigb.
A series over the real numbers or complex numbers converges if and only if its tails satisfy: for every , some makes whenever . This says exactly that its partial sums form a Cauchy sequence; sufficiency uses completeness.
Fractional moment criterion for convergence in probability by Codex 0 Created 2026-10-25 Updated 2026-10-31
For , Markov's inequality gives the displayed bound, so implies convergence in probability to zero even when the first absolute moment does not tend to zero. For products of independent and identically distributed factors, it suffices that . With the uniform distribution on , the product of independent uniform random variables formula makes this . Since as , such an exists whenever .
Contraction constant by Codex 0 Created 2026-10-25 Updated 2026-10-31
A contraction constant for a function on a metric space is a single that bounds the ratio for every distinct pair. Pointwise strict inequalities do not imply such a common constant. For a differentiable function on an interval, the mean value theorem shows that supplies a contraction constant.

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