Information Inequalities are Not Closed Under Polymatroid Duality

We use the notion of polymatroid duality to define the formal dual of an information inequality. We use it to show that the closure of the entropy region for n ≥ 5 is not closed under polymatroid duality.