Theorem. Gluing two Gaussian laws across a separator [fdip-0066]

Let \(V=V_1\cup V_2\), \(S=V_1\cap V_2\), \(A=V_1\setminus S\) and \(B=V_2\setminus S\). Suppose positive-definite centered Gaussian laws \(\mu _1,\mu _2\) have the same marginal \(\mu _S\). Write \(p_1,p_2,p_S\) for their positive Lebesgue densities. There is exactly one positive Gaussian extension with \(\phi _A\mathrel {\perp \mkern -9mu\perp }\phi _B\mid \phi _S\). Its density is \[p(a,s,b)=\frac {p_1(a,s)p_2(s,b)}{p_S(s)}.\] If \(S=\varnothing \), take \(p_S=1\); this is the product law.

Let \(\Lambda _1,\Lambda _2,\Lambda _S\) denote the three marginal precision matrices. Padding a matrix on \(T\) with zeros gives the matrix on \(V\) defined by \[\operatorname {pad}_T(M)=\pi _T^TM\pi _T.\] The extension's precision is \[Q=\operatorname {pad}_{V_1}(\Lambda _1) +\operatorname {pad}_{V_2}(\Lambda _2) -\operatorname {pad}_S(\Lambda _S).\] In particular, if a positive global Gaussian law has \(S\) separating \(A\) and \(B\) in its precision graph, this formula reconstructs its precision from the indicated marginals. The matrices \(\Lambda _i\) are marginal precisions, not principal restrictions of \(Q\).

The four-cycle calculation displays the marginal precisions and reconstructs every entry by this formula.