In his article Gaussian Representation of Independence Models over Four Random Variables from 2006, Petr Šimeček lists all conditional independence structures (or “independence models”) which are realizable by Gaussian distributions, regular or not, in dimension 4. For each model he gives a concrete correlation matrix which realizes it. Only one of these examples, named M85, is displayed with irrational entries. Šimeček asks in his article whether all Gaussian CI structures can be realized with rational correlations.
When I was at the Prague Stochastics Workshop in memory of František Matúš last year, the same question came up and the remark quickly passed the room that Šimeček had left this model M85 unresolved — a concrete example to work on. This is how I learned about his interesting paper and the excesses of singular Gaussians. Today I allowed myself to get side-tracked and see if M85 was really inherently irrational.
The short answer is: no, it also has a rational correlation matrix. Consequently, as far as I’m aware, the conjecture about rationality of Gaussian CI remains open.
We consider a random vector with entries which is distributed according to a Gaussian distribution with a positive-semidefinite covariance matrix . Of interest of this vector is its conditional independence (CI) structure, which is the collection of all statements for different and , which hold for the distribution. This statement means that learning the value of the coordinate does not tell us anything about if we already know all the coordinates for .
What structure does this set of all CI statements have? For Gaussian distributions a particularly intriguing characterization is known. To decide whether holds, determine an inclusion-maximal set such that the principal minor does not vanish. Then holds if and only if the almost-principal minor does vanish. In particular if the Gaussian is regular (equivalently, if is positive-definite) then we always choose in this test.
If we are given some CI structure as a collection of symbols , then in order to decide if it has a regular Gaussian realization, we have to concatenate polynomial equations, inequations and inequalities in the unknowns which are the entries of the symmetric matrix :
Notice that deciding whether the space of these matrices is empty or not is a semialgebraic decision problem. All polynomials are determinants of a symmetric matrix, which makes Gaussian CI particularly exciting.
The above only describes regular Gaussian realizations. For singular realizations we would have to pick in the first step which principal minors should vanish. These choices would affect which almost-principal minors to evaluate in steps 2 and 3 to model CI statements. Clearly, it gets a little more complicated overall as more choice is added. Of course, there are CI structures which are realizable by singular and not regular Gaussians, such as our № 85.
As a final remark to this section, there is a well-known lemma that allows us to pass to a special kind of covariance matrix which has all s on the diagonal (so is simultaneously the distribution’s correlation matrix) without changing the CI structure of the random vector. This trick reduces the number of variables in our semialgebraic system from to as it eliminates the variances on the diagonal.
Below is the CI structure M85 with its irrational realization, copied straight from Šimeček’s paper.
The style of diagram on the left was developed by Radim Lněnička to encode CI structures on four random variables. It reads
In the previous section, I have outlined an algorithm to describe all the positive-semidefinite matrices which realize a given CI structure, such as . Since we want a non-regular realization (there is no regular realization because is not a gaussoid), we have to make some decisions about which principal submatrices we want to be zero and which positive.
For the CI statements in , we care about the principal minors of the sets , , , and . The minors of singleton sets are already equal to when we work with correlation matrices. The only non-trivial assumptions we make are that , and are positive. Then we can write down equations for the CI statements in as if the matrix was regular. Suppose
then we obtain the following equalities:
Using the first three equalities and the requirement that all variables be non-zero, we see that and both reduce to the equality which already follows from the simpler equalities: .
Moreover notice that is determined by and , by and and by and , and even in a way that preserves rationality. If we can find rational which satisfy the equality of , then we have all rational entries which satisfy all the equations required.
Eliminating all from equation , we obtain equivalently
I substituted , , and asked Mathematica for integer solutions in to the above equality together with some of the inequality constraints like etc. and it reported back a solution after maybe 10 seconds, which lifts to:
My Julia code indeed confirms that this matrix is a positive-semidefinite realization of . The singular principal minors are and . My apologies to whoever expected clever arguments at this point. Mathematica simply beat me to it. It was very fortunate that all the inequalities and inequations seemed to fall into place once the equalities were satisfied rationally.
The conjecture that all Gaussian CI structures are realizable by rational correlation matrices is still unresolved, even in the special case of regular Gaussians. By the way, there is an analogous conjecture by Matúš about discrete (as opposed to Gaussian) CI structures with an adapted notion of rationality on the last page of his paper Conditional independences among four random variables III: final conclusion. And finally, rationality in a somewhat different flavor is mentioned in Question 2 in Studený’s book, p. 190: is the conical closure of discrete multiinformation functions a rational polyhedron?
Likewise I am not aware of a solution to these conjectures. If you know of updates, please do let me know.
Addendum (26 May 2020): The conical closure of discrete multiinformations is a linear image of the entropy region and while I have not proved it in detail, I would suspect that Matúš’s breakthrough carries over to show that discrete multiinformations do not form a rational polyhedron, because they are not even a polyhedron.
Addendum (3 Mar 2021): I answer Šimeček’s question negatively in my recent preprint “Incidence geometry in the projective plane via almost-principal minors of symmetric matrices”.