paper

Separating Abelian and Homomorphic Entropy Cones

arXiv:2608.09543

Abstract

Chan and Yeung showed that finite groups suffice to determine which homogeneous linear information inequalities are universally valid. We compare two restricted group-characterizable entropy cones: the Abelian cone and the homomorphic cone , the latter generated by coset systems of normal subgroups. We prove \[ \widetildeΓ^{\mathrm{Abl}}_{16}\subsetneq\widetildeΓ^{\mathrm{Hom}}_{16}, \] and, if is the least number of variables for which these cones differ, we show . The separating functional is a class-restricted entropy inequality: it is valid on the Abelian cone but is not a universal information inequality. It is obtained by lifting the order dual of the Pálfy--Szabó six-cross identity while quantifying errors at inexact subgroup joins. We then construct sixteen normal subgroups of a class-two -group of order for which every join error vanishes while the endpoint containment fails by one bit. Since mixed-linear random variables are Abelian, the same example also separates the mixed-linear and homomorphic entropy cones.

Separating Abelian and Homomorphic Entropy Cones · wovepaper