Combinatorial properties of holographic entropy inequalities

summary

The gist

The gist A holographic entropy inequality (HEI) is a linear inequality obeyed by RyuTakayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs, and

In short

This work establishes a new combinatorial framework to study holographic entropy inequalities (HEIs), which are linear constraints on entanglement entropies in quantum gravity models. The authors define properties like dominance and region dominance for these inequalities and use them to resolve several conjectures in the field, proving two and disproving two others. This provides strong evidence that HEIs hold in time-dependent holographic states.

Key concepts

Holographic Entanglement Entropy (HEE): This is a quantity derived from the Ryu-Takayanagi formula, which relates entanglement entropy to the minimum cut function on a weighted graph representing a physical system. It is constrained by submodularity and must obey specific inequalities defined by the min-cut cone.
Holographic Entropy Inequality (HEI): A HEI is a linear inequality that all Ryu-Takayanagi holographic entanglement entropies must satisfy. This inequality can be equivalently described as a condition on the minimum cut function of weighted graphs, defining a convex cone called the min-cut cone.
Combinatorial Properties (Dominance, Inclusion Dominance): These are structural properties used to characterize HEIs. Dominance requires finding specific subsets of terms on one side (LHS) that can be matched by an equal-sized subset on the other side (RHS) in a specific counting manner. Inclusion dominance is a stronger version requiring these subsets to be nested.
Region Dominance: This property generalizes dominance by looking at collections of terms, known as 'parties' (X). Region dominance states that the total number of terms on the LHS containing a specific set of parties cannot exceed the number of corresponding terms on the RHS.

Terminology used across episodes

Reinforcement Learning (RL) — explained in 25 episodes
Retrieval-Augmented Generation (RAG) — explained in 21 episodes
Sample Complexity — explained in 20 episodes
Flow Matching — explained in 19 episodes
Quantum Fisher Information (QFI) — explained in 19 episodes
Federated Learning — explained in 17 episodes

This episode discusses

The paper

Combinatorial properties of holographic entropy inequalities · Read on arXiv

Guglielmo Grimaldi, Matthew Headrick, Veronika E. Hubeny, Pavel Shteynerd

Martin Fisher School of Physics, Brandeis University · Institut des Hautes Etudes Scientifiques · Center for Quantum Mathematics and Physics (QMAP) · Department of Physics & Astronomy, University of California, Davis · Department of Mathematics, Bar-Ilan University

A holographic entropy inequality (HEI) is a linear inequality obeyed by Ryu-Takayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs. We establish a new combinatorial framework for studying HEIs, and use it to prove several properties they share, including two majorization-related properties as well as a necessary and sufficient condition for an inequality to be an HEI. We thereby resolve all the conjectures presented in [arXiv:2508.21823], proving two of them and disproving the other two. In particular, we show that the null reduction of any superbalanced HEI passes the majorization test defined in [arXiv:2508.21823], thereby providing strong new evidence that all HEIs are obeyed in time-dependent holographic states.

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: We're looking at the paper: "Combinatorial properties of holographic entropy inequalities".

Mira: Here's the gist of the paper. The gist A holographic entropy inequality (HEI) is a linear inequality obeyed by RyuTakayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs, and this paper establishes a new combinatorial framework for studying HEIs to resolve several conjectures in the field of quantum gravity <ref:2601.09987#pg6>.

Kai: Definitions and Setup The paper introduces key concepts to frame the study, starting with entropy functions which obey submodularity (SSA) and additional constraints.

Mira: The holographic entanglement entropy is defined as a min-cut function on weighted graphs, where the set of allowed entropies forms a convex cone called the min-cut cone (HEC).

Kai: This cone is rational polyhedral, defined by inequalities of the form XmL S(Xn) ≥ XmR S(Yn).

Paper summary: Kai: So, to summarize "Combinatorial properties of holographic entropy inequalities," the main point is that they define an inequality obeyed by Ryu-Takayanagi holographic entanglement entropies or equivalently by the minimum cut function on weighted graphs.

Mira: The central thesis is establishing a new combinatorial framework for studying these inequalities and using it to prove several shared properties, including two majorization-related properties and a necessary and sufficient condition for something to be a holographic entropy inequality.

Lev: So they are connecting concepts from quantum information theory, specifically entanglement entropy, with graph theory tools like the minimum cut function. That's a big bridge to cross.

Kai: Exactly. They start by defining entropy functions that obey submodularity, which is already a key feature in classical information theory and quantum mechanics <ref:2601.09987#pg3>.

Mira: They then formalize the holographic entanglement entropy as a min-cut function on weighted graphs, which sits within this convex cone called the min-cut cone, which is defined by specific inequalities like XmL S(Xn) ≥ XmR S(Yn).

Lev: That defining those inequalities in that way suggests that the physical constraints of holography translate directly into these mathematical conditions on the matrices.

Kai: The paper then moves into combinatorial properties—dominance, inclusion dominance, and region dominance—to characterize what it means for an inequality to be a holographic entropy inequality.

Mira: They show logical relations between these properties, establishing maps of implications, for example, Theorem one establishes Conjecture three <ref:2601.09987#pg2>.

Lev: It sounds like they are building a hierarchy. If you have dominance, then you get inclusion dominance and region dominance. That structure is what allows them to tackle the larger problems.

Kai: And through these properties, they resolve four conjectures presented in the literature by proving two of them and disproving the other two <ref:2601.09987#pg1>.

Conclusion: Mira: So, looking at the full picture of "Combinatorial properties of holographic entropy inequalities," it seems like this work is providing a rigorous way to classify these entanglement inequalities using combinatorial tools.

Kai: It’s about taking something physical—entanglement in holographic states—and translating it into a language where we can use established mathematical machinery from majorization theory to understand its structure and constraints.

Lev: So, the implication for someone building hardware is that if we have a candidate inequality, this framework tells us exactly what structural properties it *must* satisfy combinatorially to be valid in the holographic context.

Mira: Right. And they found that by testing null reductions of superbalanced inequalities against majorization tests, they strongly suggest these inequalities hold even when you factor in time dependence in holographic states.

Kai: It seems like the authors are giving us a solid foundation for how to search for and verify these inequalities, using the combinatorial properties as a filter before we even get to the more complex quantum gravity physics.

More episodes

← Home