The regression residual vector is , where is the hat matrix. Both and are symmetric idempotent matrices, and . Therefore and the linear image of a multivariate normal vector gives
This multivariate normal distribution is singular, with rank : fitted-residual orthogonality forces . Specifically, and for distinct observations. Thus regression residuals are generally neither independent nor identically distributed, even though the model errors are. Also and is independent of , which justifies the standard errors and exact Student t-tests below.
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.
For a convex function , its subdifferential at is the set of supporting slopes
The subgradient optimality condition is
Indeed, the defining inequality with is exactly the global minimum inequality. For the subdifferential of the L1 norm, the coordinates vary independently:
Let . The Karush-Kuhn-Tucker conditions for Lasso give a vector such that . If , the unsquared residual norm is differentiable at this fit, with gradient
Using the subdifferential sum rule, choose to obtain
Convexity now proves the tuning relation between Lasso and square-root Lasso:
The positive residual assumption is needed both for this gradient and for the quotient defining the tuning parameter.
For the final score calculation, use the usual fixed-design interpretation of the normal linear model: regard and the tuning parameter in the regression of as fixed, and choose that regression's minimizer using only those inputs. Its nonzero residual then has the Square-root Lasso optimality condition
Expanding the response residual gives
Since is a fixed unit vector and , a linear image of a multivariate normal vector gives . Finally, Holder inequality and the residual score bound yield
This is the residual-score decomposition from square-root Lasso. The normality statement also holds conditionally on a design independent of the noise. If were chosen from the response noise, for example through the preceding formula, the direction would require a separate independence argument; the final calculation treats as fixed.
Condition on the information available before time . The current wealth is then fixed, while is independent of that information. Put
For any portfolio , use the inner product induced by the positive-definite matrix to write
The linear image of a multivariate normal vector shows that the two portfolio returns are jointly normal, and
Thus independence of uncorrelated jointly normal variables makes the residual return independent of the aligned return; it also has expected value zero.
The continuation value is concave by part (c). Conditional Jensen inequality therefore shows that adding the independent centered residual cannot improve the objective:
where . Since the optimal portfolio is unique, its residual must be zero.
It remains to determine the sign. If , the portfolios and have the same return variance, namely , while their means are and . The latter return has the distribution of the former plus the positive constant . Since is increasing, replacing by cannot reduce the objective, contradicting uniqueness. Hence .
Applying this conditional argument at every time gives nonnegative, past-measurable random variables such that
This is the Gaussian one-fund theorem.