Pith. sign in

REVIEW 3 cited by

A holographic inequality for $N=7$ regions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.10547 v1 pith:OUZ3I5B6 submitted 2022-09-21 hep-th

classification hep-th
keywords inequalityholographicinequalitiesdisjointentropiesregionsstatessubsystems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In holographic duality, boundary states that have semiclassical bulk duals must obey inequalities, which bound their subsystems' von Neumann entropies. Hitherto known inequalities constrain entropies of reduced states on up to $N=5$ disjoint subsystems. Here we report one new such inequality, which involves $N=7$ disjoint regions. Our work supports a recent conjecture on the structure of holographic inequalities, which predicted the existence and schematic form of the new inequality. We explain the logic and educated guesses by which we arrived at the inequality, and comment on the feasibility of employing similar tactics in a more exhaustive search.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the ${\sf N}=6$ solution

    quant-ph 2024-12 conditional novelty 8.0 of 10

    Complete classification of SSA-compatible extreme rays of the six-party subadditivity cone, with 150 holographic graph realizations and 52 confirmed non-holographic orbits.

  2. The Holographic Multi-Entropy Cone

    hep-th 2026-06 accept novelty 7.0 of 10

    Holographic multi-entropy vectors form a rational polyhedral cone; its n=3,4 facets yield seven fundamental multi-entropy inequality orbits, with ordinary HEC facets arising as convex combinations of HMEC facets.

  3. On the construction of graph models realizing given entropy vectors

    hep-th 2025-12 conditional novelty 7.0 of 10

    An efficient algorithm constructs candidate simple tree graph models for entropy vectors that pass a chordality test, but its correctness remains conjectural.

Pith tools