Write , let be the identity matrix, let be the -by- all-ones matrix, and put , with one diagonal block per experimental block. The variance-covariance matrix is
Its orthogonal decomposition is obtained by first subtracting each block's sample mean, then subtracting the grand sample mean from the block means. More explicitly, writing for coordinate in block , the three invariant subspaces are
They are pairwise orthogonal, with dimensions , and , and their direct sum is . On , both and vanish. On , and . On , and . Thus the eigenvalues and corresponding invariant subspaces are
If some eigenvalues coincide, their eigenspace is the direct sum of the listed subspaces with that value. Zero-dimensional rows are omitted when or . For an admissible covariance matrix the eigenvalues on nonzero subspaces must be nonnegative; these conditions are also sufficient for positive semidefiniteness. The expectation parameters do not affect this calculation.
For the normal linear model, differentiating the ordinary least squares objective gives . Full column rank makes invertible, so
The distribution follows because is a linear transformation of a multivariate normal distribution. Its expectation is , and direct multiplication gives the displayed covariance matrix.
Let , the orthogonal projection onto the design's column space. The residual sum of squares is . Since , symmetry and idempotence give . Thus
is an unbiased estimator.
For the two independent regressions choose . The first rows of the design matrix are and the last rows are . The centering conditions and distinct predictors give
It follows that
The two estimated slopes are independent normal random variables, as they depend on independent error blocks. Therefore
For these data use the pooled residual sum of squares
Its scaled value is and is independent of the slope estimates by the permitted normal-model result. Hence the standardized difference has a Student t-distribution with degrees of freedom, giving the exact 95 percent confidence interval
Here is the 0.975 quantile of that distribution. This is a confidence interval for the difference of independent regression slopes. As required by the original framework, this specialization needs . Distinct predictors alone allow , but then the fit is saturated, and there are no residual degrees of freedom to estimate the unknown variance or form this interval.
For independent identically distributed observations , the likelihood function and log-likelihood are
A maximum-likelihood estimator is a measurable choice , when a maximizer exists. It need not be unique. The one-observation score function is , and the Fisher information matrix is
Under the regularity assumptions, differentiation beneath the integral gives . Differentiating again gives the second information identity. Independent observations have total Fisher information .
Assume fixed parameter dimension, an interior true parameter , a positive-definite matrix , the standard differentiability and integrability conditions, and statistical consistency of . Then the asymptotic normality of a maximum likelihood estimator is
Here is the information per observation. Thus the leading covariance matrix of the estimator itself is .
To prove this, statistical consistency places the estimator in an interior ball about with probability tending to one, where its score function vanishes. Write and use the integral first-order Taylor formula for a vector map:
This integral matrix is needed in a vector problem; one does not have to assert a common scalar mean-value point for every score component. Put
The regular local uniform law of large numbers, continuity of the expected Hessian matrix, and statistical consistency give . The multivariate central limit theorem gives
The limiting information matrix is nonsingular, so . Solving the Taylor identity and applying the Slutsky theorem proves the displayed normal limit, since . Boundary parameters or singular information are outside this regular theorem.
Set . Under the null hypothesis rejection requires both and . Since has the standard normal distribution,
The bivariate normal distribution in the preceding calculation has a nonsingular covariance matrix and strictly positive statistical probability density everywhere. For every finite futility boundary and , the open rectangle has positive probability. Therefore
For an explicit expression, conditional on the full-sample statistic is under the null hypothesis, yielding
The Type I error is reduced because some otherwise rejecting paths stop for futility. Equality is approached as , but does not hold at a finite futility boundary.
Put , which is a positive-definite matrix by the full column-rank assumption. The ordinary least squares estimator is
For ridge regression use the criterion . Differentiating gives
If instead the squared-error term is normalized by , replace in this formula and the calculations below by . Only the scale of the tuning parameter changes.
As usual for this linear regression model, use zero-mean errors; more generally suffices. Since the columns are centred, , so the random centring term disappears from both estimators. Thus
Let . The bias and covariance matrix of the ridge regression estimator are
The bias-variance decomposition of mean squared error therefore represents directional risk by the quadratic forms
Their difference has the useful factorization
To check it, multiply on both sides by : the resulting matrix is .
The Cauchy-Schwarz inequality gives in the Loewner order. Therefore the middle matrix is positive-definite whenever . For example,
works, independently of the eigenvalues of . Since is invertible, the risk difference is strictly positive for every nonzero , in particular simultaneously for every unit . This proves uniform directional risk improvement by ridge regression. For the normalized-loss convention, take the displayed choice divided by .
For the final assertion, fix any and choose a unit eigenvector of with eigenvalue . Put and . Directly,
Choosing
makes the squared bias alone greater than , proving the required strict inequality. Thus unbounded directional risk of fixed ridge shrinkage is compatible with the existence of a beneficial signal-dependent small penalty: no fixed positive penalty uniformly improves risk over all possible signals.
The mean assumption matters if the printed covariance condition is read in isolation. With , , , and , the columns and response are still centred and , but the ordinary least squares risk is . Writing , the ridge regression risk is for every . Hence the standard zero-mean regression-error convention, or its stated orthogonality version, is necessary for the first risk comparison; covariance alone is insufficient.
The ordinary least squares objective has gradient . The normal equation therefore gives
The Gram matrix is a positive-definite matrix because has full column rank. More explicitly, for any ,
since . This proves that the displayed solution is the unique global minimum.
The fitted values are , where the hat matrix is
The inverse of the symmetric matrix is symmetric, so . Multiplication gives . Thus is the orthogonal projection onto the column space of the design matrix.
The regression residual vector is with . Consequently , , and the residual sum of squares is
By fitted-residual orthogonality, . Using , the cross-covariance matrix is
Both vectors are jointly normal, so they are also independent by independence of uncorrelated jointly normal variables. The zero covariance calculation itself only needs the common error variance and lack of error correlations.
For the first wind fit, let be wind velocity and electrical output. The simple linear regression is , with independent . It has two fitted mean parameters and residual degrees of freedom. The missing analysis of variance entries are therefore velocity degrees of freedom , velocity mean square , and residual degrees of freedom . The residual mean square is , and , consistent with the printed value after rounding.
Because the model includes a regression intercept, the coefficient of determination is the explained sum of squares divided by the total centered sum of squares:
A large coefficient of determination does not rule out a wrong mean function. In the PDF's first residual-versus-fitted plot, residuals are negative at both ends and positive in the middle. This curved pattern agrees with the visibly flattening output-versus-velocity relationship and motivates a polynomial regression with a quadratic term.
The second wind model is , again with independent common-variance normal errors. Its fitted mean is . The line marked (A) is a two-sided Student t-test of against , conditional on retaining the intercept and linear term. Under the null hypothesis,
Its two-sided p-value is . This is far below , so reject a purely linear mean in favour of the quadratic fit. Equivalently, the extra-term nested-model F-test has and null law .
The third fit is a reciprocal-predictor regression, , with estimated mean . It has two mean parameters rather than the quadratic model's three. Its residual standard error is smaller, versus , and its coefficient of determination is larger, versus . The corresponding residual sums of squares are approximately and . The reciprocal fit is preferable on both these fit measures and parsimony. The two models are not nested, so an ordinary extra-term F-test between them is inappropriate. On the common normal-error likelihood, the difference also favours the third model.
Neither lower residual sum of squares nor a higher coefficient of determination establishes adequate assumptions. The quadratic residual-versus-fitted plot removes the original pronounced curvature; the reciprocal plot also has no comparably obvious mean trend. The low-output residuals appear somewhat more spread out, so check scale-location plots and residuals against velocity for heteroscedasticity. Q-Q plots assess normality; residuals against observation order assess serial dependence; regression leverage and Cook's distance identify influential observations. Further cross-validation, replicate observations at comparable velocities, and prediction errors would help choose between their extrapolation behaviours. Both fitted shapes should be judged principally over the observed positive-velocity range.
The statistician first models the age- and gender-dependent mean by linear regression. Its fitted value is . At fixed gender, a year of age is associated with a decrease of BMI units; the group coded gender has a fitted mean units above the group coded at the same age. This question does not state which gender receives which code. The intercept refers to age zero in the reference group, outside a typical adult-patient range, so its substantive interpretation is limited. Both slope Student t-tests have small p-values, and the overall F-test supports an age/gender-dependent mean. The coefficient of determination is only , leaving considerable individual variation to investigate.
The residual diagnostics check whether mean adjustment is plausible and whether a single normal error law is adequate. The residual-versus-fitted plot has no strong curved mean trend, although its smooth curve is not perfectly flat. The scale-location plot suggests some decline in spread as fitted BMI increases, so common residual variance is a working approximation rather than an established fact. The normal Q-Q plot has systematic departures, notably shorter tails than the normal reference, suggesting the residual law is not exactly normal. The regression leverage plot does not display an obviously extreme leverage point, but the marked observations and Cook's distance should still be checked for influence. Independence between patients cannot be diagnosed from these four plots alone.
Next the statistician extracts the regression residuals and fits an intercept-only normal model as a baseline residual distribution. With an intercept in the original ordinary least squares model, the residuals sum to zero by the normal equation; the near-zero fitted residual mean and its are therefore automatic, not new evidence of good fit. The standard error in this refit uses degrees of freedom, whereas the original uses after estimating three regression coefficients. The reported log-likelihood for the single-normal residual model is .
The histogram suggests a shape worth exploring beyond one normal density, with broad shoulders and some asymmetry, without showing unambiguous separated clusters. The statistician fits two- and three-component finite Gaussian mixtures with a common variance by the expectation-maximization algorithm, starting from separated means and positive weights. Successive likelihoods increase and the displayed final iterations stabilize, as expected from EM likelihood monotonicity. This is evidence of numerical convergence from those starts, not proof of a global maximum.
The two-component fit assigns weights , residual means and common variance . The three-component fit assigns weights , residual means and common variance . The code correctly passes the square roots of those variances to dnorm and overlays the resulting weighted densities. Both curves broadly follow the histogram and are very similar. In particular, a two-component mixture need not have two distinct visible modes.
These fits explore residual mixture clustering: groups differ in BMI relative to the same age/gender-adjusted mean, rather than simply in raw BMI. Membership can be summarized by the fitted mixture responsibilities, retaining uncertainty instead of asserting a certain label for each patient. The common-variance assumption is economical, but should be checked; the common regression slope assumption and constancy of mixture proportions across age and gender are also substantive. A residual mixture alone does not establish genuine biological subpopulations; a flexible continuous distribution, missing predictors, nonlinear mean effects or heteroscedasticity could explain a similar marginal shape.
There is also a two-stage residual mixture fitting limitation. Fitted regression residuals are not exactly independent identically distributed observations: even under a normal regression, their covariance matrix is , and estimating the mean adjustment introduces uncertainty. With subjects and three initial regression coefficients, treating them as independent is a useful approximation for exploring shape, but ordinary mixture likelihoods omit the first-stage uncertainty. A joint mixture regression with shared slopes, or a suitable bootstrap of the whole analysis, would give a firmer basis for parameter uncertainty and cluster selection. Examine component membership versus age/gender and repeat the algorithm from multiple starts before making substantive clustering claims.
Let initial wealth be and let be the number of units held of risky asset ; the bank investment is . Put . Terminal wealth is normal, with mean and variance . The expectation of the exponential utility is
For and positive definite covariance matrix , maximizing this is equivalent to maximizing the certainty equivalent . Thus the optimal investment is
All investors have proportional risky holdings. A market portfolio can therefore be represented by , with any positive scalar multiple giving the same return. Suppose its initial value is positive and . Set . For returns and ,
The beta of an asset is its covariance with the market return divided by the market variance. Consequently
This is the capital asset pricing model. Since , dividing the excess-return identity by gives the Sharpe ratio identity
These ratio statements require nonzero variances and nonzero initial portfolio value. If is singular and is in its range, replace by its pseudoinverse; any kernel holding can be added to an optimizer. If has a component in the kernel, it gives a deterministic excess gain that can be scaled without bound, so there is no finite optimal portfolio. If , there is no distinguished risky market portfolio and its beta ratios are undefined.
Write . Minimizing the residual sum of squares first over the coefficients of reduces the problem to minimizing . Full column rank ensures . Thus the partial regression formula and its variance are
This uses and the isotropic error covariance matrix .
Since the span of is contained in the column space of , orthogonal projection onto the latter removes at least as much squared norm. Consequently
and inversion proves the requested lower bound. Full rank makes the denominator positive.
Adding to column leaves the column space unchanged. Every old fitted vector is reproduced by keeping all slopes unchanged and replacing the regression intercept by . Uniqueness of the ordinary least squares estimators then proves that slope is unchanged. In particular all columns can be centered by such changes. Applying the previous projection argument to the centered design proves the bound with and ; the normalized inner product is now the usual sample correlation.
Each reported coefficient test is the two-sided Student's t-test of against , conditional on the other predictors. Under the null, has a Student's t-distribution with degrees of freedom. At five percent the intercept is significant, but neither individual test slope is. The final F-test compares the full model against an intercept-only model: . It has degrees of freedom and rejects at five percent, since its -value is . Thus the predictors jointly explain variation, without strong evidence separating their individual conditional effects.
The two test predictors have sample correlation , although each has only moderate correlation with the final exam response. The variance inflation factor is . Their nearly shared direction produces substantial multicollinearity, inflating the individual slope standard errors. The joint F-test can detect this common predictive direction even though either coefficient, given the other, has a large -value.
Let and . In the linear noise approximation, and . At the stationary mean, the preceding moment identity gives . Hence the stationary covariance matrix solves the Continuous Lyapunov equation
which is precisely the requested component formula because is symmetric.
Write . The global Markov property for a directed acyclic graph says that, for every three pairwise disjoint vertex sets ,
Thus graphical D-separation implies probabilistic conditional independence. Causal minimality means that has this global Markov property for a directed acyclic graph, but has it for no proper subgraph of obtained by deleting edges while keeping all vertices. Faithfulness of a directed acyclic graph means that the displayed implication is an equivalence: the conditional independences of are exactly the D-separations of . In particular it includes the global Markov property for a directed acyclic graph.
A causally minimal distribution can nevertheless have an extra independence. Here is a causally minimal nonfaithful Gaussian model. Take three independent random variables , each with the standard normal distribution, and set
Use the Directed acyclic graph with edges , and . The equations give a directed acyclic graph factorization, so the global Markov property for a directed acyclic graph holds. Alternatively this complete acyclic graph imposes no nontrivial D-separations. But is independent of , even though the direct edge prevents their D-separation. Hence faithfulness of a directed acyclic graph fails.
To check causal minimality explicitly, the covariance matrix is
The linear transformation from to is invertible, so this is a nonsingular multivariate normal distribution. Deleting would require , whereas . Deleting would require , whereas the conditional covariance is
Deleting would require , whereas its conditional covariance is . By Gaussian conditional independence, each nonzero conditional covariance rules out the required independence. Every proper subgraph is contained in a graph obtained by a single edge deletion, and further deletion can only add Markov restrictions. Thus no proper subgraph is Markov for , proving causal minimality.
For the Markov blanket, use its standard convention that the focal vertex is excluded:
We prove Markov blanket D-separation by examining an arbitrary path from to . If its first edge points into , its next vertex is a parent of , hence a conditioned noncollider in , and the path is blocked. Otherwise the path starts at a child . If the next edge points out of , then is again a conditioned noncollider. If it points into , the path begins . Although conditioning on the collider opens that local segment, is another parent of , hence belongs to . The outgoing arrow makes a noncollider on the path, so conditioning on blocks it. Since is outside , none of these blocking vertices can be the endpoint.
Every path is therefore blocked by . Applying the global Markov property for a directed acyclic graph gives
This proves the requested screening property without any positivity assumption on .
Finally assume faithfulness of a directed acyclic graph and let have the stated screening property. Then and every vertex outside must be D-separated by . If a parent or child of were missing from , the one-edge path between them would be active, a contradiction. Thus every parent and child is in . If another parent of a child were missing from , the path would be active: its only interior vertex is the collider , already in . This is again a contradiction. Consequently
Under faithfulness the graphical blanket is contained in every screening set. This is the minimal Markov blanket under faithfulness; the preceding argument also shows that the blanket itself is a screening set.
The Gaussian likelihood has log-likelihood, apart from no omitted parameter-dependent terms,
For fixed , maximizing it is ordinary least squares. Differentiating with respect to gives the normal equation . Full column rank makes the quadratic strictly convex, so
At this value, differentiating with respect to gives , so
For positive RSS this is the global likelihood maximum in . RSS is positive almost surely under the model since ; an exactly zero observed RSS instead gives a boundary supremum as .
As a linear image of a multivariate normal vector, the coefficient estimate satisfies
Indeed, , and direct matrix multiplication gives its covariance matrix.
The fitted values are , so the hat matrix is
It is symmetric, and
It fixes every vector in the column space of , and annihilates its orthogonal complement. Thus is the orthogonal projection onto that column space, has matrix rank and trace , and is the complementary orthogonal projection. Consequently
Since , the covariance matrix between the regression residual vector and the coefficient estimate is
These quantities have a joint normal distribution, so they are also independent, a stronger conclusion than zero covariance.
Now has mean zero. Using the expectation of a quadratic form,
Thus the maximum-likelihood estimator has
The unbiased alternative is
The orthogonal projection of a Gaussian vector also yields , explaining the residual degrees of freedom.
Assume the known covariance matrix is positive definite. The Gaussian likelihood, up to constants, is
Its gradient is . The negative Hessian matrix is positive definite because has full column rank. Thus the unique maximum-likelihood estimator is the generalized least squares estimator
It is unbiased, and multiplication of its linear coefficient matrix by gives
In fact . Equivalently, a whitening transformation premultiplies and by , after which ordinary least squares applies. There is no extra factor when is the complete known covariance; such a factor appears if only a shape matrix is known and .
Fix . Put and form the centered real vectors
They are bounded independent and identically distributed random variables, so the multivariate central limit theorem applies to .
To identify its limiting covariance matrix, put . Its complex covariance and pseudo-covariance are respectively
For , and . Thus
The two conditions on identify exactly this real covariance matrix: the second is , with a conjugate in its second argument. A centered multivariate normal distribution is determined by its covariance matrix, including when that matrix is singular. Therefore
This proves convergence in distribution at each fixed ; it does not assert convergence of the entire empirical characteristic process.
Because the scalar signal and the noise vector are independent random variables with normal distributions, their sum is a Gaussian random vector. Its expected value is zero, and the covariance matrix is
Thus this is a rank-one covariance spike. Each summand has expected value , so . Here the empirical matrix is an uncentered empirical second-moment matrix; because the population expected value is known to be zero, it is an unbiased estimator of the covariance matrix. The TeX's apparent factorial denominator is a transcription error.
Use an ideal carrier-sense multiple access scheme on the interference graph. An active station finishes its transmission after an independent unit-rate exponential distribution waiting time. An inactive station has an independent attempt clock with an exponential distribution of rate ; an attempt succeeds only when all its neighbors are inactive. Attempts that are blocked do not change the state. Thus, on the independent sets represented by , the continuous-time Markov chain has transition rates
The empty independent set can be reached by successive deactivations, and any other independent set can be reached from it by successive activations. Hence this finite chain is an irreducible Markov chain. The weight satisfies
By detailed balance for a continuous-time Markov chain, its unique stationary law is
This is a finite exponential family. Its natural parameter of an exponential family is and its mean parameter of an exponential family is the vector of active fractions.
The throughput region of an interference graph is exactly . To see the possibly less immediate inclusion, suppose a random feasible schedule has mean . Retain each of its active vertices independently with probability , interpreting zero coordinates as always deleted. A subset of an independent set remains an independent set; the thinned schedule has mean exactly . Thus lies in the convex hull of . The opposite inclusion follows from the definition using equality. Moreover , so this convex hull has full dimension.
Now choose such that remains in the interior of . Use interior moment matching in a finite exponential family. Consider the convex function
There is a ball of radius around contained in . Maximizing a linear functional over the convex hull is the same as maximizing over its generating set, so, for every ,
The last inequality uses the point when . Hence is a coercive function and has a finite minimizer . Differentiating the finite normalizing sum gives
This covariance matrix is a positive-definite matrix: a linear functional constant on all states of positive weight must be constant on , so its coefficients vanish. Thus is a strictly convex function; its minimizer is unique. At that minimizer the desired strict service margins are
For a backlogged station that transmits at unit speed whenever active, the long-run throughput is , by the ergodic theorem for a finite continuous-time Markov chain. Therefore the ideal carrier-sense multiple access scheme can supply a strict service margin for every arrival vector in the interior of the throughput region of an interference graph. The local attempt rates can realize the whole interior capacity region in this sense. Boundary points may require parameters tending to infinity, and the argument gives no uniform delay or mixing-time bound near the boundary.