Theorem. The law on a selected subspace [fdip-005B]
Theorem. The law on a selected subspace [fdip-005B]
For a selected background, view \(P\) as a map \(H\to X=\operatorname {im}P\) and let \(r=\dim X\). The law \(\nu _b=P_*\mu _Q\) is the centered Gaussian on \(X\) with intrinsic covariance and precision \[C_P=(PGP)|_X>0,\qquad S_P=C_P^{-1}:X\to X.\] Relative to the induced Euclidean volume \(\lambda _X\), its density is \[\frac {d\nu _b}{d\lambda _X}(x) =\frac {\sqrt {\det _X S_P}}{(2\pi )^{r/2}} e^{-\langle x,S_Px\rangle /2}.\] If \(B:\mathbb R^r\to H\) is an isometric inclusion with image \(X\), then \(BB^*=P\); its chosen coordinate matrices are \[B^*C_PB=B^*GB,\qquad [S_P]_B=(B^*GB)^{-1}.\] For another such basis \(B'=BU\), \(U\in O(r)\), the latter changes to \(U^*[S_P]_BU\). The intrinsic operator \(S_P\) is independent of this choice.
In the orthogonal split \(H=X\oplus Y\), write \[Q=\begin {pmatrix}A&K\\K^*&D\end {pmatrix},\qquad D>0.\] Then \[S_P=A-KD^{-1}K^*.\] Indeed, solving \(Q(x,y)=(u,0)\) gives \(y=-D^{-1}K^*x\) and \((A-KD^{-1}K^*)x=u\). Positivity follows by evaluating the quadratic form on \((x,-D^{-1}K^*x)\). Thus the \(X,X\) block of \(Q^{-1}\) is the inverse of this Schur complement, and it is exactly \(C_P\). For \(P=P_R\), this recovers the coordinate marginal. If \(PQ=QP\), then \(K=0\) and \(S_P=Q|_X\); symmetry of a subspace alone does not justify that equality.
[rasmussen2006gaussian, Appendix A.2, p. 200] gives formulas (A.4)-(A.6) for Gaussian densities and marginals.
[friedli2017statistical, Definition 8.3, p. 384] characterizes Gaussian vectors by linear observations.
[friedli2017statistical, Theorem 8.4, p. 385] gives their nonsingular density. The row-isometry argument above supplies the linear-image step, including its Euclidean-volume identification.
A partial formal correspondence is supplied by TauCeti's
TauCeti.Probability.map_affine_multivariateGaussian.
It allows finite real coordinate spaces, a positive semidefinite
covariance and an arbitrary rectangular linear map. Set its mean
and shift to zero, its covariance to \(G=Q^{-1}>0\), and its matrix
to \(B^*\). After the precision-density identification,
the result gives the coordinate image law with covariance \(B^*GB\).
It does not require full row rank. Positivity of this compressed
covariance, its inverse precision, the isometric identification
with \(X\), and the graph data are the additional arguments above.