Holographic Entropy Inequality (HEI)

• Holographic Entropy Inequality (HEI) is a framework defining linear constraints on entanglement entropies, central to the holographic entropy cone in AdS/CFT.
• It employs combinatorial contraction maps, perfect tensor constructions, and cyclic inequalities to rigorously classify entropic facets in holographic theories.
• HEI has practical implications in understanding RG flow, quantum error correction, and topological order, unifying geometric and informational insights in holography.

The Holographic Entropy Inequality (HEI) framework codifies a robust set of linear constraints on the entanglement entropies of boundary regions in quantum field theories with semiclassical bulk duals, particularly within the AdS/CFT correspondence. These inequalities—central to the structure of the holographic entropy cone—are dictated by deep geometric, combinatorial, and information-theoretic principles, sharply distinguishing holographic states from generic quantum states. The following sections provide a technically rigorous synthesis of the theory, its recent combinatorial classification, topological extensions, and operational implications, with precise citations for each key result.

1. Foundations of the Holographic Entropy Inequalities

The canonical holographic entropy bound $S \leq \frac{A}{4\,\ell_P^2}$, derived from black-hole thermodynamics and Bekenstein's Generalized Second Law, asserts that the entropy $S$ of any weakly gravitating isolated system is upper bounded by one quarter of the area $A$ of its enclosing surface, measured in Planck units (Hod, 2011). In AdS/CFT and similar dualities, the von Neumann entropy $S(A)$ for a boundary region is computed geometrically via the Ryu–Takayanagi (RT) or Hubeny–Rangamani–Takayanagi (HRT) formula: $S(A) = \frac{\text{Area}(\gamma_A)}{4 G_N}$ where $\gamma_A$ is the minimal (codimension-2) bulk surface homologous to $A$ (Bao et al., 2015). The set of all possible entropy vectors

$$\vec{S} = \left( S(I) \right)_{I \subseteq \{1,\dots,N\}, I \neq \emptyset}$$

forms a convex polyhedral cone in entropy space, termed the holographic entropy cone (HEC). Every linear constraint defining a facet of this cone constitutes a holographic entropy inequality.

2. The Structure and Classification of Holographic Entropy Inequalities

2.1 Elementary and Cyclic Inequalities

For $N \leq 4$ boundary regions, the complete set of facet inequalities are:

Name	Entropic Expression	Notation
Subadditivity (SA)	$S(A) + S(B) \geq S(AB)$	$I_2(A:B) \geq 0$
Strong Subadditivity (SSA)	$S(AB) + S(BC) \geq S(B) + S(ABC)$	$I(A:C|B) \geq 0$
Monogamy of Mutual Information	$$S(AB) + S(AC) + S(BC) - S(A) - S(B) - S(C) - S(ABC)$$	$-I_3(A:B:C) \geq 0$

For $N \geq 5$, new infinite families arise, most notably the cyclic inequalities, which for $n=2k+1$ regions take the form (Bao et al., 2015, Czech et al., 2023, Naskar et al., 2024): $$\sum_{i=1}^{2k+1} S(A_i\cdots A_{i+k}) \geq \sum_{i=1}^{2k+1} S(A_i\cdots A_{i+k-1}) + S(A_1\cdots A_{2k+1})$$

2.2 Superbalance and Perfect Tensor Rays

Apart from subadditivity, all non-redundant holographic entropy inequalities are superbalanced: every region and every pair of regions appears with net zero coefficient, ensuring cancellation of UV divergences and their purifications (He et al., 2020, Hernández-Cuenca et al., 2023). Superbalance implies that in the multipartite information basis, only $I_n$ for $n \geq 3$ contribute—no mutual information or single-region terms.

Facet-defining inequalities correspond, in duality, to extreme rays of the HEC. These are notably constructed from perfect tensors, which are pure states with maximal mixing across any bipartition of $2s$ parties (He et al., 2019). In the K-basis (perfect tensor basis) all HEIs are manifestly positive integer combinations of perfect tensor entropy vectors, streamlining the classification of facets.

3. Combinatorial Proofs and Complete Classification

The proof by contraction method is both necessary and sufficient for verifying any linear HEI with rational coefficients (Bao et al., 2015, Bao et al., 22 Jun 2025, Bao et al., 2024, Li et al., 2022). Any such inequality can be expanded as

$\sum_{u=1}^{M} S(L_u) \geq \sum_{v=1}^{N} S(R_v)$

and certified by a contraction map $f:\{0,1\}^M \to \{0,1\}^N$ satisfying:

• Distance-decreasing: $d_H(x,x') \geq d_H(f(x),f(x'))$ for all $x,x'$
• Boundary conditions: $f(x_A) = y_A$ for all regions (occurrence bitstrings)

This construction is equivalent to a partial cube embedding in graph theory: every valid HEI corresponds to an isometric embedding of the contracted graph into a hypercube (Bao et al., 2024, Grimaldi et al., 15 Jan 2026). Algorithmic enumeration of all partial cube contractions yields an exhaustive, deterministic list of valid HEIs.

4. Topological and Geometric Extensions

Two infinite families—toric and projective-plane inequalities—are proven via graphical tessellation and entanglement wedge nesting (EWN) (Czech et al., 2023). These families correspond to tilings of the torus (cyclic arrangements) and projective plane (Möbius-strip gluing), encoding sophisticated nesting relations among entanglement wedges: $$\sum_{i,j} S_{A_i^+ B_j^-} \geq \sum_{i,j} S_{A_i^- B_j^-} + S_{A_1\cdots A_m}$$ The contraction proof on these topological cell complexes demonstrates that only allowed patterns of minimal cut intersections can realize valid entropic inequalities. In the continuum limit, toric inequalities become statements about differential entropy exceeding horizon length.

5. Operational Interpretations: RG, Erasure Correction, and Time Dependence

Holographic entropy inequalities are tightly linked to the RG flow: each facet can be reinterpreted as a claim that some combination of entanglement wedges reaches deeper into the bulk (IR) than another (Czech et al., 5 Jan 2026). Saturation of an inequality forces entanglement wedges to coincide, indicating maximal reach into the bulk, while strict inequalities protect the RG ordering.

In the context of quantum error correction, non-saturation of an HEI is a necessary condition for holographic erasure correction. Saturation eliminates overlapping wedge interiors, preventing certain recovery codes from functioning (Czech et al., 17 Feb 2025).

All superbalanced HEIs, and their null reductions (restricting to terms containing a given subsystem), pass the majorization test: $k$-fold subsystem appearances on the greater-than side can always be subsumed on the less-than side. This rigidity extends the validity of HEIs to time-dependent holographic states, as covariant surfaces (HRT) cannot violate the null-reduced inequalities (Czech et al., 15 Jan 2026, Grimaldi et al., 15 Jan 2026).

6. Extensions to Gapped Phases and Topological Order

In gapped phases with exact area laws, every holographic entropy inequality remains valid—often as strict equalities—when entropies reduce to graph cut-functions (Bao et al., 2015). For topologically ordered phases, cyclic HEIs generalize the Kitaev–Preskill and Levin–Wen subtraction schemes for topological entanglement entropy, with explicit connections to multi-information and cyclic quantities (Naskar et al., 2024). Superbalanced HEIs provide universal probes for detecting topological order.

7. Open Problems and Future Directions

While the combinatorial framework offers a deterministic classification of all HEIs and infinite towers of topological constraints have been established, several frontiers persist:

• Analytic construction of the full hierarchy for arbitrary $N$ regions and identification of minimal generating sets, possibly via representation theory.
• Extension to quantum Rényi entropic inequalities, which exhibit fundamentally different monotonicity properties and admit holographic proofs via cosmic-brane prescriptions (Nakaguchi et al., 2016).
• Systematic enumeration of “quantum” entropy inequalities for general states via generalized contraction maps.
• Deeper understanding of the implications for bulk reconstruction, algebraic error correction, and dynamical holographic codes.

In summary, the theory of holographic entropy inequalities is now organized around combinatorial contraction maps, topological graphical representations, and geometric wedge depth, weaving together information-theoretic optimality, gravitational constraints, and operational quantum tasks into a unified algebraic and geometric edifice.