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 2018 iii Paper 219 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
At the fitted hyperparameters, define , , and , with the matrices formed by pairwise kernel evaluations. Conditional independence of observation noise and future latent values givesThe residual has zero covariance with , so the joint normal law makes it independent of . This derives the conditional multivariate normal distribution and the Gaussian process regression posterior:The covariance is a Schur complement and is positive semidefinite. When nonsingular, its joint density is . Repeated phases can make it singular, in which case the displayed normal law is interpreted on its support.
This predicts the true latent light curve, so no future measurement variance is added. For noisy future observations, add their independent noise covariance to . Fixing the hyperparameters omits their estimation uncertainty, as requested; integrating over their posterior would add it. The periodic model extrapolates by phase, even though all prediction times follow the observed times.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-20
Use the periodic covariance functionIts positive semidefiniteness follows by pulling back a Gaussian kernel to the circle . A zero Gaussian process mean is an ensemble statement, whereas an exactly zero long-term average for every periodic light curve is stronger. To impose the latter literally, use a periodic Gaussian process with zero period average, replacing the kernel byHere is a modified Bessel function, and is the period average of the kernel. Subtracting each process's random period average produces this covariance, so it remains positive semidefinite. We use to enforce the stated mean subtraction; using gives the usual ensemble-zero-mean formulation and the same likelihood derivation.
Let and . The prior latent vector is and the independent Gaussian noise is , so with . The Gaussian-process marginal likelihood isPositive measurement variances make positive definite even if is singular. Maximize over all three hyperparameters, using a broad search in to find competing aliases, followed by joint optimization. Cholesky decomposition evaluates the likelihood without explicitly forming an inverse.
For a well-resolved interior maximum, let be the observed Fisher information in the coordinates . Then . Equivalently, the profile-likelihood curvature in gives the same local nuisance-adjusted variance; keeping the other hyperparameters fixed would generally underestimate it. A profile interval with is a local approximation. If the period likelihood is multimodal or poorly constrained, fit the complete posterior with proper hyperparameter priors and report its modes and marginal credible intervals rather than a single Hessian error bar. The sampling pattern can create period aliases that a single local search misses.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 2 v Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let be the normalized density in the transformed coordinates of (iv). Its fixed Gaussian increment gives a symmetric proposal distribution: . For distinct states, the accepted transition density is , where . ThenThe rejection probability gives a mass on the diagonal, which trivially satisfies the same balance identity. Thus , the detailed balance condition, and integrating it proves invariance of the target.
The transformed density includes its Jacobian, so mapping back preserves the desired posterior law. Warmup adaptation is excluded from this fixed-kernel proof. Independent augmentation with is itself a reversible conditional update; alternatively the original joint augmented space can be sampled directly. This is the Metropolis–Hastings algorithm balance argument.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 2 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-20
A log-flat improper prior is not appropriate when all known are positive: the integrated likelihood in (iii) has a positive finite limit as , so its integral against diverges. One defensible noninformative choice is the scalar Jeffreys prior for an additive variance component, calculated holding the mean parameters fixed:Indeed the normal variance score has information . This is a scalar conditional-information prior, not a claim that its product with the flat mean prior is the joint Jeffreys prior. It is bounded near zero and is at infinity. The integrated likelihood is uniformly bounded near zero and is bounded by a constant times at infinity, independently of the mean-shape parameters, since . Thus and a proper external prior on the physically admissible ensure posterior propriety. Proper weak scale priors are another option. If known errors vanish, the boundary argument and appropriate prior need separate reconsideration.
For an efficient parameterization, use with and . A chain on this joint reduced parameter space targetsThe factor is the Jacobian determinant. At each iteration propose , with for a fixed nonsingular proposal covariance, and accept with probability . Proposals outside the physical prior domain have target zero. Tune during warmup and freeze it for the retained random-walk Metropolis algorithm. To obtain samples of the full original parameter vector, independently draw from its retained positive prior and reconstruct ; the resulting vector is . Analytically marginalizing using (iii) would also be valid.
Use several dispersed chains, trace plots, rank-normalized split , and the effective sample size of a Markov chain for each parameter and for . These Markov chain Monte Carlo convergence diagnostics reveal poor mixing and disagreement but do not prove convergence. Estimate the integrated autocorrelation time ; with retained draws, . Default to no thinning of a Markov chain, so the thinning factor is . If storage requires thinning, choose a spacing after inspecting the autocorrelation and verify the retained-chain effective sample size; no finite spacing guarantees independent draws.
Using the retained samples, computeThese are posterior summaries, provided the corresponding moments exist, not uncertainties of the numerical estimates. A proper prior alone does not ensure finite second moments; choose or check the external prior accordingly. The Monte Carlo standard error of the posterior mean is approximately .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Choose a fixed , and write and . The predicted magnitude is . Thus the likelihood depends on only through , the absolute magnitude–Hubble constant degeneracy. Since at fixed , integrating with a flat density over the entire real line removes .
Explicitly, let , , , and . Completing the square gives , so flat-prior elimination of a Gaussian common mean yieldsindependently of . The proportionality includes the arbitrary constant of the flat prior, which cancels within this posterior analysis.
If the remaining posterior integral is finite, prior independence gives and hence : these data supply no marginal update of the Hubble constant. The quoted Gaussian is consequently retained with its stated . Strictly, the model uses inside a logarithm, so the Gaussian prior must be restricted and normalized on that domain:where are the standard normal density and distribution function. Ignoring its negligible negative tail gives the stated untruncated Gaussian approximation.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let . Bayes' theorem and the stated prior factorization give the posterior densityThe normalizing constant, when finite and positive, is the integral of this product over its admissible parameter domain. An improper prior requires checking posterior propriety before interpreting this expression as a probability density.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Write , and . The latent absolute magnitude and measurement error are independent normal variables, so their convolution is normal. After integrating out the individual intrinsic magnitudes, each apparent magnitude has distributionConsequently the likelihood function for the independent sample isThis is the marginal observational likelihood of a hierarchical Bayesian model, not the likelihood conditional on each unknown intrinsic magnitude. The individual errors remain heteroscedastic through their known .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 1 v Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A valid covariance matrix must be real symmetric and a positive semidefinite matrix, with . Conversely, every such matrix is the covariance of a possibly degenerate multivariate normal distribution. The diagonal correlations are ; the printed strict inequality can only concern distinct indices. Pairwise bounds do not suffice: the by correlation matrix with diagonal and every off-diagonal entry has eigenvalue along and is invalid. Even strict pairwise inequalities allow singularity: off-diagonal entries give an eigenvalue zero.
For the inverse requested in the question, assume in addition that is a positive-definite matrix. Write , and . Up to a constant, the log-likelihood is . Its score function and second derivative areThe correlated Gaussian common-mean estimator is thereforeIts expectation is , and direct covariance propagation givesThe Fisher information is , so this variance attains the Cramér-Rao bound and the estimator is an efficient estimator.
If is singular, an ordinary Lebesgue density and are unavailable. When lies in the range of , the same formulas hold on that range with its Moore-Penrose inverse. Otherwise there is with , and determines exactly with zero variance. The usual nonsingular Cramér–Rao calculation then does not apply.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 1 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Equal variances make every weight , so the inverse-variance weighted mean reduces to the arithmetic mean. Independence givesThus the variance scales as , whereas the uncertainty expressed as a standard deviation scales as .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Unbiasedness requires . Let and minimize . The Lagrange multiplier equations for are , so normalization gives . HenceThe gradient at this point is , whose inner product with every feasible displacement satisfying is zero. The Hessian matrix is , and for every nonzero feasible . These are the first- and second-order constrained minimum conditions. Strict convexity also proves global uniqueness of this inverse-variance weighted mean; normal errors are not needed.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Independence makes the variance of an estimator equal toWith , differentiate to obtain . The second derivative is , so the unique minimum isEquivalently, the inverse-variance weighted mean uses withWe assume positive measurement variances. A zero-variance observation already supplies the true value exactly.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 219 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Linearity of expectation gives . Thus a linear unbiased estimator for every value of the distance modulus satisfies . Requiring unbiasedness at the single value would not impose this constraint; an unbiased estimator must work throughout the parameter space.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 218 6 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
One suitable criterion among the three unpenalized normal linear models is the Akaike information criterion. With estimated mean coefficients and the variance also estimated, minimizing AIC is equivalent to minimizingThe values of are for model1, model2 and model3. This compares fit and complexity rather than choosing solely by individual coefficient significance. The Bayesian information criterion or a common-fold predictive comparison would also be reasonable, depending on the selection objective.
For the ridge regression tuning parameter, use K-fold cross-validation with squared prediction loss:Use the same folds for every candidate, estimate any centering or scaling within each training fold, choose a minimizing , and refit on all observations. This estimates mean squared prediction error while avoiding data leakage. The printed summaries do not supply all residual sums of squares or validation losses, so they do not determine which model or penalty wins.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 218 6 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Condition on the fixed design matrix and a prespecified . Put . The covariance and bias of a ridge regression estimator follow from its being a linear transformation of the response:Here centering the response introduces no correction in this expression because . For the equal-norm two-predictor design, either diagonal entry simplifies toHowever,The variances quantify sampling variability, but alone do not give valid confidence intervals for the unshrunk slopes. Centering a normal interval at the ridge estimate ignores its bias, which depends on the unknown slopes and need not be small relative to its standard error. Intervals require an appropriate bias correction, a bound on that bias, or another justified inferential procedure. A data-selected penalty introduces additional selection dependence not covered by the fixed- formula. Similarly, holding a software penalty fixed while converting it using an estimated response scale does not hold the effective penalty fixed over repeated samples; the displayed covariance is not an unconditional variance formula for that nonlinear procedure.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 218 6 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let denote the effective penalty in the Gaussian squared-error objective. With the loss normalization used in the glmnet documentation, alpha zero gives ridge regression:The intercept is fitted separately and unpenalized. The constant column supplied by model.matrix is not an additional penalized slope; glmnet excludes zero-variance predictor columns. Centering and the stated predictor norms make the two slope columns already standardized under the divisor- convention.
Let consist of those two columns, , and . Minimizing over the intercept gives , and the closed-form ridge regression estimator under this normalization isThus the right-hand limit in the plotted log- coordinate is , givingThe left-hand limit is , giving the unpenalized full-model slopesThe plotted curves are these two slopes. If the objective is instead written as unnormalized RSS plus a quadratic penalty, its penalty coefficient is , not .
There is also a software response-scale convention to distinguish from this mathematical parameterization. The Gaussian fitting engine divides a supplied penalty by the response standard deviation while fitting a standardized response, then rescales the coefficients. For pure ridge with these already standardized predictors, this corresponds to effective in the displayed objective. Such a fixed positive rescaling of the horizontal parameter for the observed dataset does not change either asymptote. The fixed-penalty variance formulas below refer to in the displayed mathematical objective.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 218 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The command performs a nested-model F-test for against , retaining the intercept and coefficient in both models. Write and for the residual sum of squares in the reduced and full fits. Under and the independent normal-error assumptions,By Cochran's theorem, the numerator and denominator are independent scaled chi-squares with one and degrees of freedom. Equivalently, for this single-coefficient restriction, , so its p-value equals that of the two-sided coefficient Student's t-test in model3.
Using the printed value gives and . The printed estimate and standard error instead giveThis discrepancy is present in the PDF and is too large to be explained by rounding at the shown precision; the underlying ANOVA output is omitted, so an exact unique statistic cannot be recovered. The univariate correlation and value imply , consistent with after rounding. With denominator degrees of freedom 97, the two versions give p-values approximately and , respectively. Either way the partial effect is not significant at 5%.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 218 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The two predictors have correlation coefficient , so there is severe multicollinearity. Their centered slope Gram matrix isThus either partial slope has variance . Relative to a univariate regression with the same error variance, the two-predictor variance inflation factor and standard-error factor areThe small eigenvalue makes the contrast between the two slope effects particularly poorly estimated. The univariate regressions test marginal association with the response; the bivariate tests ask whether one predictor adds an effect while holding its nearly identical companion fixed. Their much larger standard errors therefore make the partial tests insignificant without contradicting the marginal significance. The two fits also estimate slightly different residual variances, explaining why the reported standard-error ratio is not exactly 5.21.
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





