Defining the almost-entropic regions by algebraic inequalities

Abstract

We study the definability of the almost-entropic regions by finite lists of algebraic inequalities. First, we study linear information inequalities and polyhedrality, we present a proof of a theorem of Matus, which claims that the almost-entropic regions are not polyhedral. Then, we study polynomial inequalities and semilagebraicity, we show that the semialgebracity of the almost-entropic regions is something that depends on the essentially conditionality of a certain class of conditional information inequalities. Those results suggest that the almost-entropic regions are not semialgebraic. We conjecture that those regions are not decidable.