Holographic entropy inequalities pass the majorization test

Abstract

Quantities computed by minimal cuts, such as entanglement entropies achievable by the Ryu-Takayanagi proposal in the AdS/CFT correspondence, are constrained by linear inequalities. We prove a previously conjectured property of all such constraints: Any k k systems on the “greater-than” side of the inequality whose overlap is nonempty are subsumed in some k k systems on its “less-than” side (accounting for multiplicity). This finding adds evidence that the same inequalities also constrain the entropies under time-dependent conditions because it preempts a large class of potential counterexamples. We prove several other properties of holographic entropy inequalities and comment on their relation to quantum erasure correction and the Renormalization Group.