Write , so the data map is . The Gaussian likelihood and prior distribution give
Completing the square, or using Gaussian conjugacy for a normal linear model, identifies a multivariate normal distribution with precision matrix . Since , its posterior mean and covariance matrix are
The parameters are
For example, , which checks the square completion.
The orthogonal vectors
are eigenvectors of the covariance matrix. Their respective variances are
They are independent under the posterior distribution, by independence of uncorrelated jointly normal variables. Thus uncertainty is different in the two directions even for positive noise: the data constrain , whereas spans the null space of the data map.
As , the posterior distribution converges to the law of
This is supported on , and its posterior mean is the minimum-norm least-squares solution. The prior distribution still determines the distribution along the unobserved null space; it has not disappeared. This example of a Gaussian posterior in the zero-noise limit distinguishes exact recovery of an observed component from recovery of the whole unknown.
The conditional mean estimator is the posterior mean
provided the first moment is finite. A maximum a posteriori estimate is any maximizer of the posterior density relative to Lebesgue measure:
Existence of the posterior density alone does not guarantee a finite posterior mean or existence of a maximizing point.
For the stated multivariate normal distribution and independent standard Gaussian noise, the negative log of the posterior density, up to a constant, is
Its precision matrix is a positive-definite matrix, so Gaussian conjugacy for a normal linear model gives
The two forms agree because
The covariance matrix is , and the maximum a posteriori estimate equals the posterior mean for this multivariate normal distribution.
The time-zero budget constraint is
so . The terminal wealth is therefore
Put
Then
and the target mean is the linear constraint .
Since the invertible covariance matrix is positive definite, the Lagrange multiplier equation for minimizing is
Thus
The constraint determines
This is the one-period Gaussian minimum-variance portfolio; the riskless holding is then .
Let be the likelihood function. Since the prior distribution is , the posterior density has the form
where is the normalizing constant.
Choose and use the Gaussian autoregressive proposal reversible with respect to a standard normal distribution
Thus
whose covariance matrix is the required . Reversibility with respect to the standard normal distribution says
so
The Metropolis–Hastings acceptance probability therefore reduces to
This is the Preconditioned Crank–Nicolson algorithm with proposal scale .
Principal component analysis centers the word-count vectors, diagonalizes their sample covariance matrix, and projects onto the eigenvectors with the largest eigenvalues. Fitting logistic regression to principal-component scores removes exact collinearity and yields a lower-dimensional design.
Each principal component is an unsupervised linear combination of many words chosen to explain predictor variance; it is not a word selected for association with spam. The dimension can be chosen from a scree plot or cumulative explained variance, but cross-validating the downstream classification loss better targets prediction.
Write the Cepheid measurement as , where , and define the calibrated absolute magnitude data
Thus has a multivariate normal distribution with mean and covariance matrix
The Hubble law and the definition of distance modulus give
Consequently, with
the Hubble-flow observations are independent random variables satisfying . Apart from a factor independent of the parameters, the joint likelihood function is
The expression extends by continuity to a singular limiting covariance such as .
For and centered data, the objective is the Rayleigh quotient
This is the first-direction optimization in principal component analysis. Therefore is any unit eigenvector of the sample covariance matrix corresponding to its largest eigenvalue.
Define the softmax weights
They obey and . The gradient is their weighted mean,
Differentiating once more gives the covariance-form Hessian matrix
For every unit vector ,
where . The Hessian is a covariance matrix, so it is positive semidefinite; the displayed upper bound also gives in the Loewner order. Consequently has a Lipschitz gradient with
Put , so and with independent noise vectors having covariance matrix . For any deterministic linear smoother ,
whereas independence gives
Expanding the first trace shows that the second expression exceeds the first by , proving the identity.
For ridge regression,
Its effective degrees of freedom are . Thus training error is optimistically biased for independent-copy prediction error by . The graph exhibits exactly this effect: the dashed training curve keeps falling as decreases, while the solid test curve eventually rises through overfitting.
Let be the column-centered data matrix. Its sample covariance matrix is . The loadings matrix has orthonormal eigenvectors of as columns, ordered by nonincreasing eigenvalues:
Each principal component loading specifies the coefficients of a principal direction in the original variables. Signs are arbitrary, and equal eigenvalues permit orthogonal changes of basis within their eigenspaces.
The least-squares estimators depend only on the observed responses and design, so the formulas in i still hold. Their variances and covariance need only the error covariance matrix, now . Therefore
For example the first formula follows from , and the second from . The formulas remain the same as before with ; this calculation does not establish independence or a normal distribution for the estimators.
For the random vector , its covariance matrix is
Its diagonal entries are variances, and its off-diagonal entries measure pairwise covariance. Finite second moments make every entry well defined.
The future mean response is . By invariance of maximum likelihood estimation, its estimator is the fitted mean
Its sampling variance is the quadratic form of the coefficient covariance matrix with :
This estimator is unbiased because each fitted coefficient is unbiased. The future error does not enter the estimator of the mean, so its independent variance is not part of this expression.
Write . Since ,
The errors have mean zero and covariance matrix . Therefore
Thus is an unbiased estimator. In addition, the multivariate normal distribution is preserved by linear maps, so is multivariate normal with the displayed mean and covariance matrix.
Let . Part (b) gives
The residual vector and coefficient estimator are independent: they are jointly normal and their cross-covariance matrix is zero, since . Hence is independent of . By the definition of Student's t-distribution,
Let be the quantile of this distribution. Inverting the central probability statement gives the exact marginal confidence interval
Its coverage is under the stated Gaussian linear model; simultaneous coverage for all coefficients would require a separate adjustment.
Assuming independent Gaussian measurement errors with the quoted standard deviations, use the inverse-variance weighted mean:
Here and , giving
The consistency statistic is for four degrees of freedom, so there is no evident excess scatter requiring error rescaling. A shared systematic error would require a covariance matrix and would not be reduced by this averaging rule.
A chi-squared test compares discrepancies with their expected random size. For independent Gaussian observations with known standard deviations, a fitted model gives
Under a correct regular model with fitted parameters, its reference statistical degrees of freedom are usually . Correlated errors instead require with the correct covariance matrix. The reduced statistic has mean about one and standard deviation , so it should not be forced to equal exactly one.
For binned counts, Pearson's statistic is . With a fixed total and populated categories, fitting distribution parameters generally gives . The approximation needs adequately populated expected bins and the appropriate dependence assumptions. Sparse data may require a Poisson likelihood, exact calculation or simulated reference distribution rather than a casual chi-squared approximation.
The upper-tail probability measures how unusual the discrepancy would be under the null model; it is not the probability that the model is true. A large statistic can indicate a wrong model, underestimated noise or unmodelled systematic effects; an unusually small one can indicate overestimated errors or correlations. Residual plots and checks of the noise model are needed alongside the numerical test.
Define and use the independent quoted Gaussian errors , with period and exoplanet transit epoch fixed. The model is linear in despite its sinusoidal time dependence. Minimize . With the normal equations are
Using and , the solution is
The residuals in observation order are . Therefore for degrees of freedom, giving reduced . The upper-tail probability is about : the fit is consistent with the stated errors, although five points do not establish a unique physical explanation.
For known errors the covariance matrix is . Equivalently, profiling out the fitted offset gives
This is the one-parameter uncertainty, not the curvature with incorrectly held fixed. Propagating it through the supplied mass relation, and treating its coefficient and as fixed,
The symbol in the exoplanet transit epoch denotes periodic copies of the same exoplanet transit phase, not an uncertainty distribution to propagate. No independent error for the empirical mass coefficient was supplied.
Additional independent observations retain positive weight even with twice the error: each has one quarter of the previous per-observation weight. Their information adds to the existing information matrix, so the formal mass uncertainty decreases for informative additional orbital phases and cannot increase under this fixed-error model. It can remain unchanged in a degenerate phase configuration that supplies no further amplitude information after fitting the offset. The conclusion assumes the same correct model and independent errors, not a new fitted error rescaling or unmodelled systematic effects.
Figure 1.
Original plot of the fitted orbital radial-velocity variation and residuals; observed numbers used without reproducing the source table
. Details.
A Gaussian distribution with mean and standard deviation has probability density
Its symmetry, finite variance and simple behavior under linear combinations make it useful for repeated measurements. Roughly , and of observations lie within one, two and three true standard deviations of the mean. These are coverage probabilities for a specified distribution, not guarantees that every experimental error is normal.
Why it appears. The central limit theorem explains why many sums of small independent finite-variance contributions approach a Gaussian law after centering and scaling, provided no single contribution dominates. Detector noise, small mechanical disturbances and multiple electronic fluctuations can combine approximately this way. The theorem does not remove a common calibration bias, and it does not justify assuming normal tails for rare large disturbances or arbitrarily correlated errors. A large-mean Poisson distribution also approaches a Gaussian with variance equal to its mean, making normal approximations useful for high-count photon or particle data; low counts require the discrete model.
A classical particle at thermal equilibrium in a one-dimensional harmonic potential has a Gaussian position distribution directly from the Boltzmann distribution:
Thus a Gaussian law can arise from the energy dependence of equilibrium probability, rather than only from an informal appeal to many independent errors.
Precision of repeated measurements. For independent observations with the same mean and variance, the sample mean has variance . For Gaussian observations this mean is exactly Gaussian:
Consequently quadrupling the number of independent readings halves the random standard error. When the true variance is unknown, a small-sample confidence interval for a normal mean uses a Student t-distribution with statistical degrees of freedom; replacing that by a normal quantile can overstate precision. Shared systematic errors and correlations do not decrease by the same averaging rule.
Combining results and fitting models. Independent Gaussian estimates of one quantity, with known variances , combine through the inverse-variance weighted mean
For a model with independent zero-mean Gaussian noise, maximizing the likelihood is equivalent to minimizing the weighted least-squares statistic
For a correct linear model with known independent Gaussian errors and fitted parameters of full rank, the minimized statistic has a chi-squared distribution with degrees of freedom. Nonlinear fits only inherit that familiar approximation under additional regularity and adequate-data assumptions. Known correlated Gaussian errors require the full inverse covariance matrix in the quadratic form.
These properties support confidence intervals, consistency checks, calibration and error propagation. They also give practical diagnostics: inspect residuals for trends, changing spread, correlations or outliers before trusting a Gaussian fit. Gaussian models connect physical fluctuations to quantitative uncertainty, but their assumptions must be checked rather than inferred from the shape of a convenient bell curve.
A chi-squared test compares squared deviations with the size expected from the assumed random errors. For independent observations with a normal distribution with known standard deviations and predictions , use
For a correct fixed model, the standardized independent residuals are unit-variance normal distributions, so has a chi-squared distribution with . Fitting independent linear parameters removes residual directions, giving . This distribution is exact for a full-rank linear model with known errors with a normal distribution; it is an approximation for many nonlinear fits. With known correlated errors with a multivariate normal distribution, replace the sum by , where is the covariance matrix and its rank and fitted constraints determine the available statistical degrees of freedom.
Under the null hypothesis, and . The reduced statistic should therefore be near one, with standard deviation , rather than equal to one exactly. An upper-tail p-value is
Compare it with a significance threshold chosen in advance. A small value indicates tension with the model together with its error assumptions; it can arise from a wrong mean model, underestimated uncertainties or neglected correlations. An unusually small statistic can suggest overestimated uncertainties, correlations or overfitting. A p-value is not the probability that the model is true, and failure to reject is not proof of the model.
For counts in categories, the Pearson form is . Its chi-squared distribution is an asymptotic approximation requiring adequate expected counts. For a fixed-total multinomial sample there is one normalization constraint, so the usual statistical degrees of freedom are after fitting other parameters. Independent Poisson bins instead start with statistical degrees of freedom before parameters are fitted. Sparse counts require an appropriate count likelihood or a calibrated exact or simulation-based test; plugging tiny expected counts into the asymptotic formula is unreliable. The error model, binning, fitted parameters and chosen test must therefore be reported with the result.