Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 48 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Set , and . The fourth-moment assumption makes finite, so the variance of a sample mean is . Assume , as required for leave-one-out estimation.
The Jackknife variance estimator recomputes the original statistic on each sample with one observation removed. HereBy the definition of the Jackknife variance estimator,For completeness, expanding the centered sum givesConsequently . The jackknife variance estimator is unbiased for this statistic. This calculation uses only the finite fourth moment, not normality of the original observations.
Given the observed data, put and . The empirical distribution assigns mass to each observed , including repeated values with their multiplicities. A bootstrap sample consists of independent draws from this distribution, with replacement. The nonparametric bootstrap variance estimate is the conditional varianceIndependence of the bootstrap draws gives the exact conditional bootstrap variance of a sample mean:Thus its finite-sample expectation is , in contrast to the unbiased jackknife estimate. This is the jackknife and bootstrap variance of a sample second moment scaling difference.
To approximate it by Monte Carlo simulation, independently generate bootstrap samples. For replicate , choose independent uniform indices and compute . With , useFor this is conditionally unbiased for the bootstrap variance and converges to it as . Uniform indices can be obtained by for uniforms on .
Let be the conditional bootstrap distribution of the statistic. A nominal level percentile bootstrap confidence interval isReuse the bootstrap replicates, sort them as , and take the order statistics with ranks and as empirical quantiles. These are quantiles of the statistic itself, rather than reflected quantiles of its centered error. Increasing reduces simulation error; it does not turn an approximate confidence interval into an exact finite-sample one.
An analytic alternative follows from the central limit theorem. If , then , and the sample variance converges to by the strong law of large numbers. The Slutsky theorem therefore gives the large-sample normal approximation intervalwhere is the standard normal quantile. Its lower endpoint may be truncated to zero because the parameter is nonnegative. If , almost surely and the statistic identifies the parameter exactly; the interval degenerates to that value. The nondegenerate normal interval is asymptotic, not an exact Student interval under arbitrary .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 48 3 i by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 48 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The scalar process has zero mean, because white noise has zero mean. Expanding products and retaining only matching noise indices gives its autocovariance function:The finite second moment and covariance depending only on the lag prove weak stationarity. With the two-sided angular-frequency convention, the spectral density of a stationary process isIt is nonnegative because the bracket is , and it is even because the cosine is even. Hence . No restriction on the real parameter is needed for stationarity here; invertibility is a separate condition.
For the bivariate calculation let , , , and . Uncorrelated white noise processes here means zero cross-covariances at every pair of times. Therefore the vector noise hasThe filtered vector is the multivariate moving-average model . Linearity gives . Put , with exactly the orientation of the printed covariance definition. At lag zero, the present and past noise terms are uncorrelated, giving . At lag one the only shared noise is , contributing ; at lag minus one it contributes . Thus the covariance and cross-spectrum of a vector MA(1) are determined byExplicitly,In particular the off-diagonal positive- and negative-lag covariances need not coincide. Reading the upper-right entries and taking their Fourier series gives the requested cross-spectrum:Every coefficient is real, so replacing by conjugates both complex exponentials. Therefore . Unlike the scalar auto-spectrum, this cross-spectrum may be complex and need not be even: its imaginary part is .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 48 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Define the autoregressive polynomial and the moving-average polynomial . The standard causality and invertibility root criteria for an ARMA model areIn the usual minimal autoregressive moving-average model, the two polynomials have no common roots. Under that convention, these are the necessary and sufficient root conditions for a causal and invertible representation with the given noise. Without minimality they remain sufficient; shared factors must be considered before claiming necessity.
To see why the conditions work, both ratios and are analytic on a disc of radius greater than one. Their power series coefficients therefore decay geometrically and are absolutely summable. The backshift operator then gives a well-defined mean-square convergent causal time-series representationFiltering white noise by these fixed coefficients gives a weakly stationary process. The identity verifies the original equation. Multiplication by the absolutely summable inverse of also shows uniqueness among finite-variance stationary solutions. Similarly gives the invertible time-series representation.
Comparing coefficients in derives the first of the ARMA coefficient recursions:Here for negative , , and for , so in particular . For the inverse filter, compare coefficients in . With , for , for , and for negative indices, this givesThe minus sign in the inverse recursion comes from moving the nonconstant moving-average terms to the other side.
For the first-order model, the standard uncancelled conditions are and . The geometric power series expansions giveThus the ARMA(1,1) causal and inverse coefficients areAt these give and , including zero-valued parameters without any negative powers. If , the filtered process reduces to and all later coefficients vanish. This common factor cancellation in an ARMA model is why the root inequalities should not be advertised as necessary for every nonminimal parameterization. The stated inequalities still ensure uniqueness for the original equation as well as the desired causal and invertible filters.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 46 5 a by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 46 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the standard right censoring setup with everyone entering observation at time zero. At each observed time , the pre-exit risk set has size . The Nelson–Aalen estimator of the cumulative hazard function isCensoring removes an individual from later risk sets but contributes no event increment.
Exchange the two finite sums:Each event increment appears in exactly as many subjects' fitted cumulative hazards as there were subjects at risk for that increment. This proves the event-count identity for Nelson–Aalen cumulative hazards. Common entry is relevant: with delayed entry, a subject does not accumulate the increments before entering, so an entry-time subtraction would be needed.
One method for ties is to group observations at each distinct recorded time. If events occur at , use the pre-time risk set size including observations censored at that same recorded time, and take one jump . This is the usual events-before-censoring convention within a recorded tie. Since ,Thus the grouped Nelson–Aalen event-count identity preserves the required identity at the recorded observation times. It is a sum over individuals, not an unweighted sum over distinct times.
A second method, suitable when ties reflect rounded times, is to break ties by small perturbations or an artificial ordering, then apply the untied estimator. The event-count identity holds on that new, untied time grid. It does not generally persist if all estimates are mapped back to the original common time. For example, two tied failures among two individuals give a grouped jump , so the original-time sum is . Sequentially breaking the failures gives jumps and , whose total is ; assigning the completed jump to both original tied observations gives sum . On the perturbed grid the two values are and , whose sum is again . This distinction states exactly what the second method does and does not preserve.
Another common grouped survival approach is the Kaplan–Meier estimator, from which one may estimate cumulative hazard by . Its jump is , not , and it likewise does not have the Nelson–Aalen event-count identity. In particular it becomes infinite at a time when all remaining individuals fail.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





