Holographic entropy inequalities without unscaled contraction proofs

Contributed by Antti Hippeläinen ↗

Version 1 / Nov 10, 2026 / CC BY 4.0

Abstract

We show that a valid holographic entropy inequality can lack a proof by contraction until all its coefficients are multiplied by a common integer, even when it is balanced, that is, every party has the same total coefficient on both sides, or superbalanced, that is, this remains true after any party is exchanged with the purifier. Every facet of the holographic entropy cone other than subadditivity is superbalanced. A proof by contraction is a map between Boolean cubes that respects the terms in which each party occurs and does not increase weighted Hamming distances. A balanced seven-party inequality and a superbalanced six-party inequality fail at a single point of the cube. Six of their right-hand side terms correspond to the edges of two disjoint triangles of parties, and at that point an unscaled map would have to choose three of these edges that together touch all six vertices, which is impossible. The seven-party one has a proof after doubling. Superbalanced eight- and seven-party inequalities have no unscaled proof even on their realizable domains, the subsets of the cube on which a map already proves validity, and they keep this property when instances of the monogamy of mutual information are subtracted in five successive steps. Splitting further into valid inequalities leads to a superbalanced facet F7F_7 of the seven-party cone that we did not find in the literature. It has unscaled maps on its realizable domain, all of which break its symmetry. For star inequalities, whose left-hand side contains only single-party entropies, the least scaling is the least kk for which an explicit polytope contains a point with coordinates in 1kZ\frac1k\mathbb{Z}. From the weighing matrices of Alon and V\~u we obtain valid NN-party star inequalities whose least scaling exceeds N(1/4−ε)NN^{(1/4-\varepsilon)N} for every ε>0\varepsilon>0 and large NN, while every finite least scaling of an NN-party star inequality is below NN/2N^{N/2}. Non-existence rests on DRAT proofs, validity on exact rational maps or identities, and the facet property on 126126 explicit graph models, except for the star inequalities of arbitrary size, whose results rest on written proofs.

Provenance statement

This paper was produced by large language models, instances of the Claude models of Anthropic running as autonomous agents, in October and November 2026. They found the inequalities, wrote the proofs and the programs that check the certificates, ran the computations and wrote the text. The arguments were checked only by other instances of the same models, acting as referees and recomputing the certificates with programs of their own. Such checks may share the blind spots of the models that wrote the proofs. The author has read the paper and checked that the references lead to the cited works, but the statements attributed to them were checked only by the models: every statement was matched to a verbatim passage of the cited work, and another instance of the model ruled on whether the passage supports the sentence. No human expert has checked the proofs. The steps regarded as least secure are the SAT encodings and the argued results on star inequalities. A DRAT proof certifies only that a formula is unsatisfiable, while the step from the map problem to the formula rests on the encoder. The programs that check the certificates, the certificates themselves, and a program that regenerates the Boolean formulas and the integer maps are available under the MIT license at https://github.com/ahippelainen/unscaled-contraction-public.

Tools used

Anthropic
Claude OpusVersion 5.5
PySAT
PySAT
CaDiCaL
CaDiCaL
drat-trim
drat-trim
Kissat
q
NetworkX
NetworkX

References

  1. S. Ryu and T. Takayanagi, Holographic Derivation of Entanglement Entropy from the anti--de Sitter Space/Conformal Field Theory Correspondence , Phys. Rev. Lett. 96 (2006), 181602, https://doi.org/10.1103/PhysRevLett.96.181602; arXiv:hep-th/0603001 (https://arxiv.org/abs/hep-th/0603001).arXivDOI
  2. V. E. Hubeny, M. Rangamani, and T. Takayanagi, A Covariant holographic entanglement entropy proposal , JHEP 07 (2007), 062, https://doi.org/10.1088/1126-6708/2007/07/062; arXiv:0705.0016 (https://arxiv.org/abs/0705.0016).arXivDOI
  3. M. Headrick and T. Takayanagi, A Holographic proof of the strong subadditivity of entanglement entropy , Phys. Rev. D 76 (2007), 106013, https://doi.org/10.1103/PhysRevD.76.106013; arXiv:0704.3719 (https://arxiv.org/abs/0704.3719).arXivDOI
  4. P. Hayden, M. Headrick, and A. Maloney, Holographic Mutual Information is Monogamous , Phys. Rev. D 87 (2013), no. 4, 046003, https://doi.org/10.1103/PhysRevD.87.046003; arXiv:1107.2940 (https://arxiv.org/abs/1107.2940).arXivDOI
  5. A. C. Wall, Maximin Surfaces, and the Strong Subadditivity of the Covariant Holographic Entanglement Entropy , Class. Quant. Grav. 31 (2014), no. 22, 225007, https://doi.org/10.1088/0264-9381/31/22/225007; arXiv:1211.3494 (https://arxiv.org/abs/1211.3494).arXivDOI
  6. N. Bao, S. Nezami, H. Ooguri, B. Stoica, J. Sully, and M. Walter, The Holographic Entropy Cone , JHEP 09 (2015), 130, https://doi.org/10.1007/JHEP09(2015)130; arXiv:1505.07839 (https://arxiv.org/abs/1505.07839).arXivDOI
  7. S. Hern á ndez Cuenca, Holographic entropy cone for five regions , Phys. Rev. D 100 (2019), no. 2, 026004, https://doi.org/10.1103/PhysRevD.100.026004; arXiv:1903.09148 (https://arxiv.org/abs/1903.09148).arXivDOI
  8. B. Czech, S. Shuai, Y. Wang, and D. Zhang, Holographic entropy inequalities and the topology of entanglement wedge nesting , Phys. Rev. D 109 (2024), no. 10, L101903, https://doi.org/10.1103/PhysRevD.109.L101903; arXiv:2309.15145 (https://arxiv.org/abs/2309.15145).arXivDOI
  9. B. Czech, Y. Liu, and B. Yu, Two infinite families of facets of the holographic entropy cone , SciPost Phys. 17 (2024), 084, https://doi.org/10.21468/SciPostPhys.17.3.084; arXiv:2401.13029 (https://arxiv.org/abs/2401.13029).arXivDOI
  10. B. Czech and X. Dong, Holographic Entropy Cone with Time Dependence in Two Dimensions , JHEP 10 (2019), 177, https://doi.org/10.1007/JHEP10(2019)177; arXiv:1905.03787 (https://arxiv.org/abs/1905.03787).arXivDOI
Show all 45 referencesShow fewer references
  1. C. Akers, S. Hern á ndez-Cuenca, and P. Rath, Quantum Extremal Surfaces and the Holographic Entropy Cone , JHEP 11 (2021), 177, https://doi.org/10.1007/JHEP11(2021)177; arXiv:2108.07280 (https://arxiv.org/abs/2108.07280).arXivDOI
  2. N. Li, C.-S. Dong, D.-H. Du, and F.-W. Shu, Improved proof-by-contraction method and relative homologous entropy inequalities , JHEP 06 (2022), 153, https://doi.org/10.1007/JHEP06(2022)153; arXiv:2204.03192 (https://arxiv.org/abs/2204.03192).arXivDOI
  3. N. Bao and J. Naskar, Properties of the contraction map for holographic entanglement entropy inequalities , JHEP 06 (2024), 039, https://doi.org/10.1007/JHEP06(2024)039; arXiv:2403.13283 (https://arxiv.org/abs/2403.13283).arXivDOI
  4. N. Bao, K. Furuya, and J. Naskar, Towards a complete classification of holographic entropy inequalities , JHEP 03 (2025), 117, https://doi.org/10.1007/JHEP03(2025)117; arXiv:2409.17317 (https://arxiv.org/abs/2409.17317).arXivDOI
  5. B. Czech and S. Shuai, Nesting is not contracting , JHEP 06 (2025), 122, https://doi.org/10.1007/JHEP06(2025)122; arXiv:2501.17222 (https://arxiv.org/abs/2501.17222).arXivDOI
  6. G. Grimaldi, M. Headrick, V. E. Hubeny, and P. Shteyner, Combinatorial properties of holographic entropy inequalities , preprint (2026), arXiv:2601.09987 (https://arxiv.org/abs/2601.09987).arXiv
  7. X.-X. Ju and Y. Zhao, The holographic multi-entropy cone , JHEP 09 (2026), 253, https://doi.org/10.1007/JHEP09(2026)253; arXiv:2606.15173 (https://arxiv.org/abs/2606.15173).arXivDOI
  8. N. Bao, N. Cheng, S. Hern á ndez-Cuenca, and V. P. Su, The Quantum Entropy Cone of Hypergraphs , SciPost Phys. 9 (2020), no. 5, 067, https://doi.org/10.21468/SciPostPhys.9.5.067; arXiv:2002.05317 (https://arxiv.org/abs/2002.05317).arXivDOI
  9. D. Avis and S. Hern á ndez-Cuenca, On the foundations and extremal structure of the holographic entropy cone , Discrete Appl. Math. 328 (2023), 16--39, https://doi.org/10.1016/j.dam.2022.11.016; arXiv:2102.07535 (https://arxiv.org/abs/2102.07535).arXivDOI
  10. N. Bao, K. Furuya, and J. Naskar, On the completeness of contraction map proof method for holographic entropy inequalities , JHEP 12 (2025), 140, https://doi.org/10.1007/JHEP12(2025)140; arXiv:2506.18086v3 (https://arxiv.org/abs/2506.18086v3).arXivDOI
  11. J. Naskar, Multipartite correlations in holography , Ph.D. thesis, Northeastern U., 2026.
  12. B. Czech and S. Shuai, Renormalization group is the principle behind the holographic entropy cone , JHEP 07 (2026), 165, https://doi.org/10.1007/JHEP07(2026)165; arXiv:2601.02472 (https://arxiv.org/abs/2601.02472).arXivDOI
  13. B. Czech, Y. Feng, X. Wu, and M. Xie, Holographic entropy inequalities pass the majorization test , SciPost Phys. 21 (2026), no. 2, 048, https://doi.org/10.21468/scipostphys.21.2.048; arXiv:2601.09989 (https://arxiv.org/abs/2601.09989).arXivDOI
  14. V. E. Hubeny, M. Rangamani, and M. Rota, The holographic entropy arrangement , Fortsch. Phys. 67 (2019), no. 4, 1900011, https://doi.org/10.1002/prop.201900011; arXiv:1812.08133 (https://arxiv.org/abs/1812.08133).arXivDOI
  15. T. He, V. E. Hubeny, and M. Rangamani, Superbalance of Holographic Entropy Inequalities , JHEP 07 (2020), 245, https://doi.org/10.1007/JHEP07(2020)245; arXiv:2002.04558 (https://arxiv.org/abs/2002.04558).arXivDOI
  16. N. Alon and V. H. Vũ, Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs , J. Combin. Theory Ser. A 79 (1997), no. 1, 133--160, https://doi.org/10.1006/jcta.1997.2780.DOI
  17. N. Wetzler, M. J. H. Heule, and W. A. Hunt, DRAT-trim : Efficient checking and trimming using expressive clausal proofs, in: Theory and Applications of Satisfiability Testing -- SAT 2014, Lecture Notes in Computer Science, vol. 8561, Springer International Publishing, 2014, pp. 422--429, https://doi.org/10.1007/978-3-319-09284-3_31.DOI
  18. D. N. Kozlov and V. H. Vu, Coins and Cones , J. Combin. Theory Ser. A 78 (1997), no. 1, 1--14, https://doi.org/10.1006/jcta.1996.2724.DOI
  19. S. X. Cui, P. Hayden, T. He, M. Headrick, B. Stoica, and M. Walter, Bit Threads and Holographic Monogamy , Commun. Math. Phys. 376 (2019), no. 1, 609--648, https://doi.org/10.1007/s00220-019-03510-8; arXiv:1808.05234 (https://arxiv.org/abs/1808.05234).arXivDOI
  20. B. Czech and Y. Wang, A holographic inequality for N = 7 regions , JHEP 01 (2023), 101, https://doi.org/10.1007/JHEP01(2023)101; arXiv:2209.10547 (https://arxiv.org/abs/2209.10547).arXivDOI
  21. H. Araki and E. H. Lieb, Entropy inequalities , Commun. Math. Phys. 18 (1970), 160--170, https://doi.org/10.1007/BF01646092.DOI
  22. O. Bailleux and Y. Boufkhad, Efficient CNF Encoding of Boolean Cardinality Constraints , in: Principles and Practice of Constraint Programming -- CP 2003 , Lecture Notes in Computer Science, vol. 2833, Springer Berlin Heidelberg, 2003, pp. 108--122, https://doi.org/10.1007/978-3-540-45193-8_8.DOI
  23. C. Sinz, Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , in: Principles and Practice of Constraint Programming - CP 2005 , Lecture Notes in Computer Science, vol. 3709, Springer Berlin Heidelberg, 2005, pp. 827--831, https://doi.org/10.1007/11564751_73.DOI
  24. R. Asín, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-Carbonell, Cardinality Networks and Their Applications , in: Theory and Applications of Satisfiability Testing - SAT 2009 , Lecture Notes in Computer Science, vol. 5584, Springer Berlin Heidelberg, 2009, pp. 167--180, https://doi.org/10.1007/978-3-642-02777-2_18.DOI
  25. A. Ignatiev, A. Morgado, and J. Marques-Silva, PySAT : A Python toolkit for prototyping with SAT oracles, in: Theory and Applications of Satisfiability Testing -- SAT 2018, Lecture Notes in Computer Science, vol. 10929, Springer International Publishing, 2018, pp. 428--437, https://doi.org/10.1007/978-3-319-94144-8_26.DOI
  26. A. Biere, T. Faller, K. Fazekas, M. Fleury, N. Froleyks, and F. Pollitt, CaDiCaL 2.0, in: Computer Aided Verification, Lecture Notes in Computer Science, vol. 14681, Springer Nature Switzerland, 2024, pp. 133--152, https://doi.org/10.1007/978-3-031-65627-9_7.DOI
  27. A. Biere, K. Fazekas, M. Fleury, and M. Heisinger, CaDiCaL , Kissat , Paracooba , Plingeling and Treengeling entering the SAT competition 2020, in: Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions (Helsinki) (T. Balyo, N. Froleyks, M. J. H. Heule, M. Iser, M. J ä rvisalo, and M. Suda, eds.), Department of Computer Science Report Series B, vol. B-2020-1, Department of Computer Science, University of Helsinki, 2020, pp. 50--53, https://researchportal.helsinki.fi/en/publications/proceedings-of-sat-competition-2020-solver-and-benchmark-descript/.link
  28. P. Virtanen et al., SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python , Nature Meth. 17 (2020), 261, https://doi.org/10.1038/s41592-019-0686-2; arXiv:1907.10121 (https://arxiv.org/abs/1907.10121).arXivDOI
  29. W. H. Cunningham, On submodular function minimization , Combinatorica 5 (1985), no. 3, 185--192, https://doi.org/10.1007/BF02579361.DOI
  30. N. Bao, K. Furuya, and J. Naskar, A framework for generalizing toric inequalities for holographic entanglement entropy , JHEP 10 (2024), 251, https://doi.org/10.1007/JHEP10(2024)251; arXiv:2408.04741 (https://arxiv.org/abs/2408.04741).arXivDOI
  31. S. Hern á ndez-Cuenca, V. E. Hubeny, and H. F. Jia, Holographic entropy inequalities and multipartite entanglement , JHEP 08 (2024), 238, https://doi.org/10.1007/JHEP08(2024)238; arXiv:2309.06296 (https://arxiv.org/abs/2309.06296).arXivDOI
  32. B. Czech and S. Shuai, Holographic Cone of Average Entropies , Commun. Phys. 5 (2022), 244, https://doi.org/10.1038/s42005-022-01019-6; arXiv:2112.00763 (https://arxiv.org/abs/2112.00763).arXivDOI
  33. M. Fadel and S. Hern á ndez-Cuenca, Symmetrized holographic entropy cone , Phys. Rev. D 105 (2022), no. 8, 086008, https://doi.org/10.1103/PhysRevD.105.086008; arXiv:2112.03862 (https://arxiv.org/abs/2112.03862).arXivDOI
  34. C.-J. Chou, H. B. Lao, and Y. Yang, A graphical framework for proving holographic entanglement entropy inequalities in multipartite systems , preprint (2025), arXiv:2512.18726 (https://arxiv.org/abs/2512.18726).arXiv
  35. V. E. Hubeny and Y. Liu, Tripartite Form Universality in Holographic Entropy Inequalities , preprint (2026), arXiv:2609.22504 (https://arxiv.org/abs/2609.22504).arXiv

Version history

  1. v1 · 37 pagesSubmitted by Antti HippeläinenInitial depositCurrentNov 09, 2026