No eleventh conditional Ingleton inequality

A rational probability distribution on four binary random variables $X, Y, Z, U$ is constructed which satisfies the conditional independence relations $[X \mathrel{\text{$\perp\mkern-10mu\perp$}} Y]$, $[X \mathrel{\text{$\perp\mkern-10mu\perp$}} Z \mid U]$, $[Y \mathrel{\text{$\perp\mkern-10mu\perp$}} U \mid Z]$ and $[Z \mathrel{\text{$\perp\mkern-10mu\perp$}} U \mid XY]$ but whose entropy vector violates the Ingleton inequality. This settles a recent question of Studen\'y (IEEE Trans. Inf. Theory vol. 67, no. 11) and shows that there are, up to symmetry, precisely ten inclusion-minimal sets of conditional independence assumptions on four discrete random variables which make the Ingleton inequality hold. The last case in the classification of which of these inequalities are essentially conditional is also settled.

With the knowledge of all conditional Ingleton inequalities, we also settle the last remaining case in the classification of their essential conditionality.The results are summarized in: Theorem.On four discrete random variables X, Y, Z, U there are precisely ten inclusion-minimal conditional independence assumptions which make Ingleton's inequality □(XY |ZU ) ≥ 0 hold for entropy vectors (up to the symmetries X ↔ Y and Z ↔ U in the Ingleton expression), namely: The conditional Ingleton inequalities given by (1.1)-(1.5)are not essentially conditional but the ones given by (2.1)-(2.5)are essentially conditional.
These results are derived computationally.Section 2 gives an introduction to the topic of conditional Ingleton inequalities and recalls the previous results leading to the question answered here.For basics on polymatroids and their role in conditional independence and information theory we refer to the excellent exposition in [Stu21].The computational methodologies used to find the above distribution and to prove essential conditionality of inequality (2.5) are explained in Sections 3 and 4, respectively.Section 5 collects further remarks and observations.The source code in Macaulay2 [M2] and Mathematica [WM] behind various steps in the computations and auxiliary data produced using 4ti2 [4ti2] and normaliz [Nor] are available at https://mathrepo.mis.mpg.de/ConditionalIngleton/.

On conditional Ingleton inequalities
2.1.Ingleton inequality and entropy region.Suppose that X, Y, Z, U are subspaces in a finite-dimensional (left or right) vector space over a field (or division ring).For this data, the Ingleton inequality asserts that where dim⟨−⟩ is the dimension of the subspace spanned by its arguments.This rank function h : 2 N → R, I → dim⟨I⟩ on subsets of N = { X, Y, Z, U } is a polymatroid, i.e., it is normalized: h(∅) = 0, non-decreasing: h(I) ≤ h(J) for I ⊆ J, and submodular: h(I)+h(J) ≥ h(I ∪J)+h(I ∩J) for all I, J ⊆ N .The set of polymatroids over an n-element set forms a rational polyhedral cone in R 2 n denoted by H n .The Ingleton expression □(XY |ZU ) is the linear functional in h which appears on the right-hand side of (□).Hence, non-negativity of the inner product □(XY |ZU ) • h is a necessary condition for a polymatroid h to be linearly representable over some division ring.The necessity was found by Ingleton [Ing71] through an analysis of the Vámos matroid, the prototypical example of a non-linear matroid.Now let X, Y, Z, U denote jointly distributed random variables which take only finitely many states.These random variables are referred to as discrete with finiteness being implicit.If X attains q states, without loss of generality from the set [q] := { 1, . . ., q }, with positive probabilities p(X = i), then its Shannon entropy is the expression The entropy vector of jointly distributed discrete random variables X 1 , . . ., X n assigns to each subset I ⊆ [n] the entropy of the vector-valued discrete random variable X I := (X i : i ∈ I).We denote the entropy region, the set of all points in R 2 n which occur as entropy vectors of n discrete random variables, by H * n .The choice of basis for the logarithm changes the scale of all entropy vectors and does not change any of the considerations in this paper.
Fujishige [Fuj78] observed that the non-negativity of Shannon's information measures implies that entropy vectors are polymatroids and thus entropy vectors are sometimes called entropic polymatroids.A result of Matúš [Mat97, Lemma 10] implies that every integer polymatroid which is linearly representable by a subspace arrangement over a field is a scalar multiple of an entropic one.Hence, it makes sense to reinterpret Ingleton's functional □(XY |ZU ) by replacing dim⟨−⟩ with H(−).But whereas the inequality □ ≥ 0 is valid for linear polymatroids, it fails for the more general entropic ones.This paper is concerned with special types of assumptions on entropy vectors which guarantee that the Ingleton inequality holds.
2.2.Discrete representability of CI structures.Even though the Ingleton inequality does not hold universally for entropy vectors, it was a key tool in the characterization of conditional independence (CI) structures which are representable by four discrete random variables.This classification was achieved in the series of papers [MS95,Mat95,Mat99] by Matúš and Studený and we use this section to outline the role of the Ingleton inequality in this work.
Let I, J, K ⊆ [n].The common shorthand notation IJ := I ∪ J applies to these subsets.For a polymatroid h and I, J, K ⊆ [n], we employ the difference expression that is, △(I, J|K) is a linear functional on R 2 n .The non-negativity of this functional on H n is guaranteed by the submodular inequalities.Its vanishing makes IK and JK a modular pair.If h is the entropy vector of random variables (X i : i ∈ [n]), then △(I, J|K) is known as the conditional mutual information of subvectors X I and X J given X K and its vanishing is equivalent to the conditional independence [X I ⊥ ⊥ X J | X K ].Recall from [Stu21, Section II.D] that the study of conditional independence (excluding functional dependence) can be reduced to the elementary CI statements, i.e., the equalities △(i, j|K) = 0 where i and j are distinct singletons and K is a subset of N not containing i or j.These functionals define facets of H n and even supporting hyperplanes of H * n with non-empty intersection.A set L of elementary CI statements on n random variables, also called a CI structure, is representable if and only if there exists The CI structure defined by any polymatroid h in this way is denoted by h .

Let H □
4 denote the subcone of H 4 (whose ground set elements are labeled X, Y, Z, U ) which consists of polymatroids satisfying the Ingleton inequalities □(IJ|KL) ≥ 0 for every possible permutation I, J, K, L of X, Y, Z, U .There are 4 2 = 6 unique such inequalities because the Ingleton expression is invariant under exchanging I ↔ J and K ↔ L. One key insight of [MS95] is that the extreme rays of H □ 4 are a subset of those of H 4 and that they are all probabilistically representable.This implies that every CI structure h , for h ∈ H □ 4 , is representable; this condition is of polyhedral nature and can easily be checked using linear programming.Miraculously, even in the non-Ingleton regime, the Ingleton inequality is the main obstruction to entropicness: namely, in [Mat99] sets of CI statements L are described such that whenever a polymatroid h is entropic and satisfies L ⊆ h , then □(XY |ZU ) • h ≥ 0 holds.This is a conditional information inequality in the sense of [KR13], formally written as L ⇒ □(XY |ZU ) ≥ 0 and called a conditional Ingleton inequality.It is important to emphasize that a conditional information inequality is not required to hold for general polymatroids (in which case it would be a consequence of the polyhedral geometry of H 4 and not very informative) but only for entropic polymatroids.An inequality such as L ⇒ □(XY |ZU ) ≥ 0 allows one to conclude that a CI structure containing L cannot be representable if the cone of its realizing polymatroids does not intersect the cone given by □(XY |ZU ) ≥ 0; which is again a polyhedral condition that can be computed easily.

Convention. The definition of conditional information inequality in [KR13] allows arbitrary linear assumptions p
Conditional independence assumptions are a special case of this using △ functionals.In this work, "conditional information inequality" will always refer to the special case of CI-type inequality.
While the precise shape of H * 4 or even its closure H * 4 in the euclidean topology (which is known to be a convex cone [ZY97]) remains unknown to date (cf.[Mat07] and [GMM17] for a challenging open problem), conditional information inequalities help to delimit it in ways that go beyond linear inequalities and hence make it possible to describe differences between the entropy region and its closure.This becomes significant, for example, when information-theoretic optimization problems such as channel capacity computations are solved not in terms of their original parameters and non-linear objective functions but in terms of linear programs over the entropy region; this is done in Shannon's original paper [Sha48, Theorem 10] and has since then become a standard technique.In this case, the optimum is attained on the boundary of H * n .Even if it can be located, it is not clear whether the optimizer is entropic and hence corresponds to a real probability distribution or if it can only be approximated arbitrarily well by distributions.
The knowledge of which CI structures are representable can be viewed as combinatorial information about the intricate boundary structure of H * 4 .Namely, given a set of CI assumptions L which define a subspace the question is which other inequalities △ ≥ 0 are tight at every point in H * n ∩ U ? Calling the set of implied statements M, this proves a conditional independence inference rule L ⇒ M for representable CI structures.Unlike the geometric shape of H * 4 , this combinatorial, CI-theoretic information about its boundary is completely available due to the series of papers by Matúš and Studený.Studený's recent paper [Stu21] revisits this series and shows that all inference properties for four discrete random variables can be deduced from conditional Ingleton inequalities in addition to the common Shannon information inequalities.Each of the ten conditional Ingleton inequalities presented in [Stu21] is necessary to obtain all the CI inference rules.In this paper we prove that there are no further, in the CI-theoretic sense "extraneous", conditional Ingleton inequalities.
2.3.Masks and conditional Ingleton inequalities.One way to obtain conditional Ingleton inequalities is to rewrite the functional □(XY |ZU ) as a linear combination of difference expressions △(i, j|K) in the dual space (R 16 ) * .Some of these masks of the Ingleton expression were found in [MS95] and are also discussed in [Stu21, Section II.G]: These masks prove (1.1)-(1.5);indeed mask (M.1), for example, implies (1.1): [Z ⊥ ⊥ U ] ⇒ □(XY |ZU ) ≥ 0 due to the non-negativity of all difference expressions.Under the symmetries X ↔ Y and Z ↔ U which fix □(XY |ZU ), these five masks generate fourteen distinct conditional Ingleton inequalities, displayed below in groups by symmetry class: In [Stu21, Section IV] five further conditional Ingleton inequalities are proved which require two CI assumptions.They expand to fourteen conditional inequalities under symmetry as well.
Studený has ruled out five other sets of CI assumptions by counterexamples and reduced the possibilities for an eleventh conditional Ingleton inequality to three CI structures, namely the sets strictly above The verification of this claim by hand is tedious.The process can be delegated to a SAT solver such as CaDiCaL [CDCL] as follows.There are 24 elementary CI statements [i ⊥ ⊥ j | K] on four random variables; introduce one boolean variable for each of them.If a CI structure implies the Ingleton inequality, then so does every superset.If a counterexample exists for a set of CI assumptions, then every subset is ruled out by the same counterexample.Using the ten known conditional Ingleton inequalities, Studený's five counterexamples and the conjectured minimal and maximal unsolved cases L 0 and L -and all their symmetric variants -, a boolean formula can be constructed whose satisfying assignments are all CI structures which are not covered and are potential assumptions for an eleventh conditional Ingleton inequality.The solver quickly decides that the formula is unsatisfiable and hence proves that all unsolved cases are between L 0 and L.More details and source code for this computation are available on our MathRepo page.
The objective of the next section is to construct a probability distribution satisfying L and violating the Ingleton inequality.Known examples of this kind are usually hand-crafted, rational distributions with small denominators derived by careful exploitation of zero patterns and symmetries; cf.[KR13,Stu21].We present a different, computer-assisted and heuristic methodology to find counterexamples in information theory rooted in algebra and relying on symbolic computations as well as numerical non-linear optimization.

Construction of the distribution
3.1.Circuits, masks and scores.The 24 difference expressions △(i, j|K) and the Ingleton expression □(XY |ZU ) are elements in the dual space (R 16 ) * .Choosing the standard basis there, they can be identified with vectors which make up the columns of a 16 × 25 matrix.The circuits of this matrix, i.e., the non-zero integer vectors in its kernel with inclusion-minimal support and coprime non-zero entries, can be computed using the software 4ti2 [4ti2]; cf.[Stu96,Chapter 4].There are 10 481 such circuits and among them 6 814 which give a non-zero coefficient to □(XY |ZU ).These circuits are the shortest possible ways of writing □ as a linear combination of △.The 14 shortest circuits require only four △ terms one of which with a negative coefficient; they are precisely the 14 symmetric images of (M.1)-(M.5).All masks are available on our website.
Based on the circuits, we obtain short masks which are closely related to the two subcases can be confirmed by plugging in the definitions of △ and □.It was selected to simplify as much as possible under the CI assumptions L 1 which would otherwise contribute positive quantities to the Ingleton expression.Given that L 1 holds, the mask ( † 1 ) yields Analogously one proves The functions ϱ 1 and ϱ 2 are referred to as the non-Ingleton scores on L 1 and L 2 , respectively.On the distributions satisfying the respective CI statements, they equal the value of −□(XY |ZU ) but they involve fewer terms and are thus easier to evaluate and to differentiate.Both scores coincide on the intersection L of the models L 1 and L 2 .
We continue with a geometric analysis of the space of binary distributions in the model L 1 and extend these findings to derive a binary distribution for L with positive non-Ingleton score.

Parametrization of L 1 .
A joint distribution of four binary random variables is given by a 2 × 2 × 2 × 2 tensor with real, non-negative entries p ijkℓ which sum to one.With all four indices ranging in { 0, 1 }, these represent the atomic probabilities of the sixteen joint events.The CI statements of L 1 prescribe quadratic equations on these probabilities:  Under these additional constraints, the above eight equations together with the condition that all probabilities sum to one can be resolved to yield the rational parametrization ( * ) With six zero conditions and seven equations (two of the CI equations trivialize under the zero constraints), this leaves the three parameters p 0110 , p 1011 and p 1111 .The positivity conditions on the ten non-zero probabilities turn into non-linear inequalities and these are the only remaining constraints on the parameters.Thus, this defines a three-dimensional basic semialgebraic set T 1 .
3.3.Numerical optimization and a rational point.The Ingleton inequality is not an algebraic function of the parameters but a transcendental one.Hence, algebraic techniques like Gröbner bases or cylindrical algebraic decomposition cannot be directly applied to decide if there exist parameters on which □(XY |ZU ) is negative.This question can be reformulated as whether a system of integer polynomial equations and inequalities in variables and exponentials of variables has a real solution.Thus, it is a question in the existential theory of the real numbers with exponentiation.The decidability of this theory is an open problem known as Tarski's Exponential Function Problem and hence no general symbolic algorithms are available today to solve it; see [MW96] for a starting point on this topic.
Instead of symbolic techniques, we employ optimization.Mathematica's FindMaximum function, when started on the values ( 1 /16, 1 /16, 1 /16), numerically finds a local maximum of ϱ 1 on T 1 with value 0.0198 at the parameters p 0110 = 0.36179, p 1011 = 0.01463 and p 1111 = 0.27455.By continuity, ϱ 1 remains positive in a small neighborhood of this point.Searching for a local minimum of ϱ 1 in the range (⊏⊐) This equation can be resolved for p 0110 = f (p 1011 , p 1111 ) where f is a (lengthy) algebraic function involving rational functions of its arguments and a single square root.The system T together with the bounds (⊏⊐) define a semialgebraic set and Mathematica's FindInstance function quickly returns a solution typically with large denominators and an algebraic number of extension degree 2 over Q.This distribution proves L ̸ ⇒ □(XY |ZU ) ≥ 0. A rough map of where such counterexamples lie in the space T is given in Figure 1.
However, to confirm the Ingleton violation without numerical approximations, we seek a distribution with rational probabilities.The distribution is rational if p 0110 , p 1011 , p 1111 can be chosen rational, which hinges on the square root in the algebraic function f determining p 0110 .The term under the square root, expressed in p 1011 = a /b and p 1111 = c /d with a, b, c, d ∈ N, reads The denominator is always a square, so it suffices to find, in accordance with (⊏⊐), four positive integers b ≤ 160a ≤ 3b and d ≤ 8c ≤ 3d which make the parenthesized numerator into a square.An exhaustive search through small denominators b, d turns up p 1011 = 2 /99 and p 1111 = 2 /11 satisfying this criterion, because their value 937 129 691 803 487 846 400 = 30 612 574 080 2 is a perfect square.The resulting rational value p 0110 = f ( 2 /99, 2 /11) = 10 /693 does not satisfy (⊏⊐) but it still yields a positive non-Ingleton score.To see this, consider the score ϱ 2 of the distribution with the given parameters, write all fractions with their common denominator 693 and assemble all terms under one log 693 √ −.Then from • 495 495 the violation of the Ingleton inequality is just a matter of comparing the integers in the numerator and denominator -a standard task which every computer algebra system with exact arithmetic on big integers will perform.The former is approximately 219.148•10 5190 and the latter 1.14751•10 5190 .Thus, the fraction is greater than one and the non-Ingleton score is positive.Numerically, the score and hence the negative of the Ingleton expression □(XY |ZU ) is approximately 0.00757.The distribution in its entirety is given in the beginning of this note.

Classification of essentially conditional Ingleton inequalities
4.1.Essential conditionality.The second part of our theorem concerns essential conditionality, a notion introduced in [KR13].Given a conditional information inequality L ⇒ □(XY |ZU ) ≥ 0 one may ask if it arises from a valid unconditional information inequality of the form with Lagrange multipliers λ [i⊥ ⊥j|K] ≥ 0. The existence of multipliers which make (□ λ ) a valid information inequality constitutes an "unconditional" proof of the conditional inequality L ⇒ □(XY |ZU ) ≥ 0; otherwise this inequality is essentially conditional.The masks (M.1)-(M.5)show that the conditional Ingleton inequalities (1.1)-(1.5)are in fact not essentially conditional.Among the first examples of essentially conditional inequalities due to Kaced and Romashchenko [KR13] are the conditional Ingleton inequalities (2.1)-(2.4).Hence, the only remaining case in the classification of essential conditionality for conditional Ingleton inequalities is the inequality (2.5) which was recently discovered by Studený [Stu21].
Remark 4.1.All unconditional information inequalities are valid for almost-entropic polymatroids, i.e., points of the closure H * n .This is not clear for essentially conditional inequalities and [KR13, Section V] proves that (2.1) does not hold almost-entropically but (2.3) and (2.4) do.4.2.Sampling for a counterexample.If λ is a tuple of Lagrange multipliers that makes (□ λ ) true and µ ≥ λ componentwise, then µ also makes (□ λ ) true since the △ functionals are non-negative on the entropy region.Hence there is no loss of generality in assuming that all multipliers are equal and arbitrarily large but fixed.To prove essential conditionality we construct counterexamples to (□ λ ) depending continuously on λ → ∞, i.e., a curve of counterexamples.The curves proving essential conditionalities in [KR13] all follow a simple combinatorial recipe: 1. Commit to state space sizes for all four random variables; usually they are all assumed to be binary.This gives rise to 16 real parameters P = { p 0000 , . . ., p 1111 }.
2. Choose a partition of P into four subsets A, B, C, D and assign the probabilities with a real, positive parameter ε → 0. To ensure that the result is a probability distribution we require |A ∪ B| > 0 and |C| > 0.
A curve of this type converges to a distribution which is uniform on its support.It is well-known [Cha01] that every invalid information inequality can be refuted by such a distribution -however, this result requires unbounded state spaces.The typical argument in [KR13] expands the terms in (□ λ ) as power series in ε around zero and compares convergence orders to conclude that a small enough value of ε leads to a violation of the inequality.
The CI assumptions of (2.5) are only satisfied in the limit ε = 0 since This makes it possible to violate the Ingleton inequality, and indeed: The expression (□ λ ) in our case is whose ε-order coefficient tends to −∞ as ε → 0 for any fixed λ.Hence, every unconditional version of (2.5) can be violated on our curve of distributions, which proves essential conditionality.

Remarks
(1) The distribution constructed in Section 3 satisfies the four CI statements in L and none other.This can be checked computationally but it also follows from Section 2.3 since every superset of L implies the Ingleton inequality.
(2) The entropy vector of that distribution is a conic combination of twelve extreme rays of H 4 (corresponding to the twelve coatoms in the lattice of semimatroids above L; cf.[MS95]).The only ray which violates the Ingleton inequality is not entropic.Thus, our construction gives an entropic conic combination of these not necessarily entropic polymatroids where the non-Ingleton component has sufficiently high weight.
(3) All counterexamples to potential conditional Ingleton inequalities with inclusion-minimal assumptions [Stu21, Section IV.B] as well as all proofs of essential conditionality [KR13, Section IV.A] require only rational binary distributions.This is remarkable insofar as there exist CI inference rules which are valid for binary random vectors but not in general; see [Mat18].Whether every wrong CI inference rule can be refuted by a rational distribution is equivalent to [Mat99,Conjecture] and still open.
(4) The method of [Mat18] to construct binary distributions with prescribed CI structure using the Fourier-Stieltjes transform even produces distributions close to the uniform distribution.This allows one to concentrate on satisfying the CI equations only, because every binary tensor close to the uniform distribution has strictly positive entries and thus yields a positive probability distribution after multiplying all entries by a normalizing constant.Matúš's parametrization of the model L 2 depends on a solution to the associated solvability system whose components appear as exponents of the parameters.The smallest integral solution to the solvability system is (x 12 , x 13 , x 14 , x 23 , x 24 , x 34 ) = (1, 2, 1, 1, 2, 1); see [Mat18, Theorem 1] for details.In the nomenclature of this theorem (and its proof), the non-Ingleton score is then given by (γ 2 + 1) log(γ 2 + 1) + 1 /2(γ − 1) log(γ − 1) − (γ 2 − 1) log(γ 2 − 1) − 1 /2(γ + 1) log(γ + 1) for γ small but positive.This function in γ has one root in the interval (0, 1) where it passes from negative on the left to positive values on the right.The root has the approximate value of 0.72766.Using cylindrical algebraic decomposition in Mathematica, it can be verified that Matúš's construction does not produce tensors with non-negative entries (ergo probability distributions) if γ > 0.727 is imposed.It remains open whether there exist counterexamples to the validity of the Ingleton inequality subject to L and arbitrarily close to uniform or even just without zero entries.
(5) The same method applies to the search for a proof of essential conditionality in Section 4 because the CI assumptions [X ⊥ ⊥ Z | U ] ∧ [Y ⊥ ⊥ Z | U ] have conditioning sets of size one.Moreover, this statistical model has a rational parametrization: its conditionals with respect to U belong to the marginal independence model [X ⊥ ⊥ Z] ∧ [Y ⊥ ⊥ Z] which has a monomial parametrization in Möbius coordinates by [BPS22].Lastly, the entropy vectors arising from those distributions in the marginal independence model which have no private information have been completely characterized by [Mat06].The random search carried out in Section 4 found a counterexample more quickly than any of these approaches.
(6) Combinatorial and group-theoretic constructions of distributions with large violations of the Ingleton inequality have been investigated in [BN12] in the context of the four-atom conjecture, which was then refuted in [MC16].
(7) The last part of Open Question 2 in [Stu21] concerns validity of (2.1)-(2.5)for almostentropic points.As mentioned in Remark 4.1 some cases are settled in [KR13] with different answers.The status of (2.2) and of (2.5) is open.
three cases remained open in Studený's analysis, but L 0 was settled in [Stu21, Example 5].The mask

Figure 1 .
Figure 1.The model L in its (p 1111 , p 1011 )-parameter space T .Points with a positive non-Ingleton score ϱ 2 are colored in red.The rational non-Ingleton distribution with p 1011 = 2 /99 and p 1111 = 2 /11 is marked with a black dot.