Using and the canonical commutator,
Insert the mode expansion of a free field into the classical expression for . The and terms cancel after , while the mixed terms give, after the stated normal ordering,
Thus the momentum operator counts each occupied mode with weight .
A method-of-moments estimator uses
Under , choose the invertible root
with the continuous value zero when . Alternatively maximize the exact Gaussian likelihood using the positive-definite covariance matrix from part (i), producing . Given either estimate,
is the moment estimate; likelihood estimation may instead profile . Under a fixed interior parameter and standard stationary ergodic finite-moment regularity, both estimators are consistent and asymptotically normal, with Gaussian maximum likelihood asymptotically efficient.
Since is the sum of two independent centered Gaussian innovations,
For any nonzero ,
Expanding each expresses this as times a sum of squared innovation coefficients. If all coefficients vanished, the coefficient of the latest innovation gives , and backward induction gives every , a contradiction. Hence and the covariance matrix is positive definite.
With one true regressor and one additional candidate regressor, the reduction in residual sum of squares from fitting the larger nested model is . AIC chooses the wrong larger model exactly when
whose probability is fixed and positive, independent of . BIC chooses it when
For this probability is strictly smaller than the AIC error probability, and it tends to zero as .
Let be orthogonal projection onto the column space of , and let be the true mean. Then
Up to a common constant,
The true model has and ; every other candidate has and . Its excess expected AIC is , while its excess expected BIC is when . Thus either minimum expected criterion selects the true model.
Write
Since , , and therefore
For the opposite inequality, choose as in part (ii). Reflection about sends to and preserves the lattice. Thus the increasing events and have the same probability. The FKG inequality yields
Consequently
The polynomial boundary-size estimate makes the last term tend to zero, while the first tends to . Hence
By the union bound,
Hence some has connection probability at least the left side divided by . Some coordinate of equals or . A coordinate permutation and reflection of sends that face to the face and preserves the bond percolation law. Its image therefore satisfies
Let
The events and are increasing events of bond percolation. The FKG inequality and translation invariance give
Thus is a subadditive sequence. Since every probability is positive for , Fekete lemma applies and gives
Proton and Prune are censored after the estimated survivor curve has already crossed one half. Learning their later death times may add jumps in the far tail but cannot change the first crossing, so the nonparametric median remains seven years. An exponential distribution instead estimates one constant hazard from the total event count divided by total time at risk. Replacing censoring by observed later deaths changes both quantities and therefore changes the fitted rate and its median .
The corrected Kaplan–Meier estimator is immediately after and
immediately after . It first crosses one half there, so
After correction, the records from age are
where each pair is delayed-entry time and event or censoring time. The risk sets at event times all have size three. Thus the left-truncation-adjusted empirical likelihood is
Each estimated event hazard is .
The estimated survivor function is
until the last observed time. It first falls to at most one half at , so
For age at death minus , the observations are
There are three distinct event times and hence three independent discrete hazards . Their risk-set sizes are , so
The maximum-likelihood estimates are , , and .
The professors enter observation only when elected. Anyone dying before election cannot appear, so the birth-to-death sample is left-truncated at varying, outcome-related ages and is not an inception cohort from birth. Every listed professor was elected before age and survived to , so all six are under observation from the common origin age . The data can therefore estimate survival from age without delayed entry.
Write the complete-data model as and the missingness model as . Under MAR,
Therefore the observed-data likelihood factorizes as
With distinct parameters, the first factor does not involve . Maximizing or integrating the second factor therefore gives the same likelihood inference for as modeling the missingness process explicitly. Hence MAR plus distinctness makes missingness ignorable.
A missingness mechanism is ignorable for likelihood-based inference about the outcome parameter when the observed-data likelihood can be formed from the outcome model alone. The standard sufficient conditions are MAR and distinct parameters: the outcome-model parameter and missingness-model parameter have a product parameter space. The missingness indicators then carry no additional likelihood information about the outcome parameter once the observed outcomes are given.
MAR is plausible if clinic withdrawal is driven by recorded QoL, observed side effects, treatment, and other measured history. It is doubtful if patients leave because of an unrecorded deterioration, an imminent recovery, treatment toxicity not included in the analysis, or dissatisfaction that predicts their unseen 12-month QoL. The large dropout fraction makes such missing not at random mechanisms a serious concern, so MAR should be supported by rich predictors and sensitivity analysis rather than assumed without examination.

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