For metric , the defining Clifford algebra relation is
Every scalar-fermion vertex contracts the scalar momentum with the Dirac current. Between on-shell external spinors,
and the analogous particle-antiparticle identity also vanishes. Equivalently, the field redefinition in the previous part turns the theory into a free theory. Consequently every putative tree channel for has zero amplitude and
The tree amplitude is, up to an overall convention-dependent sign,
The Clifford algebra gives the momentum-space Dirac equation and its adjoint:
Therefore
Although permits the relativistic two-body decay kinematically, the matrix element vanishes. Thus
In four spacetime dimensions , , and . Hence
The coupling is an irrelevant coupling by power counting in quantum field theory, so it is a nonrenormalizable interaction that would ordinarily define only an effective theory with a cutoff. Here it is also a redundant operator: integration by parts gives up to a boundary term, and the Dirac current is conserved. This derivative coupling to a conserved current is removed exactly by the local phase redefinition .
With all momenta incoming and Fourier convention , differentiating the scalar contributes . The sole interaction vertex is therefore
where enters on the scalar line; reversing the convention reverses the irrelevant overall sign. The free internal lines use the Dirac propagator
and the scalar Feynman propagator . Momentum is conserved at the vertex.
Figure 1.
Derivative scalar-current vertex and scalar decay cut diagram
. The scalar momentum enters a derivative vertex on an oriented fermion line. The decay amplitude and its conjugate vanish because the scalar momentum contracts the conserved on-shell Dirac current.
A spacetime translation gives, by Noether theorem, the canonical stress-energy tensor
The Klein-Gordon equation implies . With canonical momentum , the conserved physical three-momentum is
The minus sign follows from for metric signature .
Every move can be drawn from a full conditional distribution, producing a Gibbs sampler with acceptance probability one. Write and . First update independently
and then
Let have rows and . Update the linear regression coefficients jointly by
and update
Finally, the flat positive variance priors give the following full conditionals, each an inverse-gamma distribution:
A systematic sweep in the displayed order, using the newly sampled values immediately, defines the chain. The shapes are positive for ; full column rank of is also required.
For each , place and inside a plate replicated times. The directed edges are represented by
The shaded observed nodes are ; the unshaded nodes are latent; and lie outside the plate. This is the probabilistic graphical model encoded by the joint factorization.
With the stated flat priors, the full joint density, up to a constant, is
The priors on and contribute constants on , while those on the two variances contribute constants on . These are improper priors, so posterior propriety must be checked; the full-rank, sufficiently large-data case used below is proper.
For one object, the probabilistic graphical model factorization is
Each factor is the normal distribution density specified by the model. This factorization displays the conditional independences of the latent variables and the noisy observations .
Write the target posterior density as and the proposal distribution density as . The Metropolis–Hastings algorithm accepts a proposed move with
For distinct states,
which is symmetric in and . The rejection probability supplies the diagonal part, so the entire transition kernel satisfies detailed balance. Integrating the detailed-balance identity over the starting state proves . Hence the posterior is a stationary distribution; an irreducible Markov chain that is also an aperiodic Markov chain converges uniquely to it.
Use broad proper uniform priors for , , and over physically plausible ranges, and broad log-uniform priors for the positive scales and . Then
A Random-walk Metropolis algorithm can update with a multivariate Gaussian proposal distribution. Initialize several dispersed chains near plausible cross-correlation delays and near the marginal-likelihood optimum; reject proposals outside the prior bounds; discard warm-up while adapting only the proposal scale and covariance; then freeze the kernel and retain a long run. Evaluate trace plots, autocorrelations, acceptance rates, between-chain agreement, and the effective sample size of a Markov chain. Posterior predictive quasar light curves provide a model check.
At the fitted parameters, let and . For prediction times define
The microlensing processes and measurement errors contribute no cross-covariance with the latent quasar light curve. The Gaussian process regression posterior is therefore
The requested pointwise posterior variances are the diagonal entries of the latter matrix.
Stack the observations as and set
Let and denote matrices obtained by evaluating the two Gaussian process covariance kernels. Independence of the quasar light curve, gravitational microlensing, and Gaussian noise processes gives
where . Thus is a multivariate normal distribution and its Gaussian-process marginal likelihood is
The off-diagonal blocks are essential: both images contain the same delayed Ornstein-Uhlenbeck process.
Let and draw independently from an importance density . The unbiased estimator
of has one-sample second moment
By the Cauchy-Schwarz inequality,
Equality holds precisely when , giving the optimal importance density for a single integral
This is circular in practice: constructing and normalizing requires detailed knowledge of the posterior and the expectation of . Here log masses are positive, so the unknown normalizer is the posterior mean being estimated. It is also optimal only for this one integral, not for general posterior summaries.

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