Pith. sign in

REVIEW 4 major objections 4 minor 3 cited by

Finite entropy sums in quantum field theory

T0 review · 4 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Pith's one-line read The paper classifies every divergence-free entropy sum in local QFT as a combination of three information-theoretic primitives and provides explicit bases and dimension formulas.

desk verdict Clean combinatorial classification of finite entropy sums via cut conditions; the physical payoff rests on an explicitly flagged locality assumption, and the small proof blemishes are fixable. read the letter →

arxiv 2508.21276 v1 pith:62DQCHAU submitted 2025-08-29 hep-th math-phmath.MPquant-ph

classification hep-thmath-phmath.MPquant-ph
keywords entanglemententropydivergencecancellationmutualinformationtripartiteBooleancubeMobiusinversionhypergraphquantumfieldtheory
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper establishes a complete structural answer to a practical question in quantum field theory: which linear combinations of subsystem entropies avoid the ultraviolet divergences that plague individual entanglement entropies? It shows that, assuming divergences are local functionals of boundaries and corners, every such combination is built from just three information-theoretic primitives—complement entropy differences, mutual informations of non-adjacent regions, and tripartite informations of disjoint triples—plus a harmless empty-set constant. The proof translates divergence-cancellation conditions into graph-theoretic statements about functions on subsets, then uses Fourier transforms on the Boolean cube and Mobius inversion to find explicit bases and dimension formulas. The upshot is a complete classification: for n regions with a given adjacency graph, the finite sums form a vector space of dimension 2^n - B - 1, and with corner divergences included the dimension is 2^n - |IE| - 1. If the underlying locality assumption holds in a given QFT, then any finite entropy observable is a combination of these known primitives.

What carries the argument

The load-bearing object is the cut map E, which sends a function on subsets of vertices to the net coefficient of each boundary component in the corresponding entropy sum; the space of divergence-free sums is exactly ker E. The key identity expresses each edge component of E(T) as 2^{n-1}(T_hat(empty) - T_hat(edge)), where T_hat are Fourier coefficients on the Boolean cube (real-valued functions on subsets of a finite set). This converts divergence cancellation into equality of Fourier coefficients and yields explicit orthogonal bases. For the information-theoretic basis, the Mobius transform on the partially ordered set of subsets is used to prove that the span of the four building blocks i

What would settle it

Enumerate all graphs on up to seven vertices and check by exact linear algebra whether the four function classes in Definition 3.6 span the kernel of the cut map E; an independent reproduction confirming the author's reported check would support Theorem 3.7, while any counterexample would refute it. On the physical side, compute the regulated entanglement entropy of two adjacent regions sharing a non-cuspy corner in a lattice free scalar and take the continuum limit: if I(A,B) remains finite, then the higher-codimension cancellation condition (13) is not necessary for finiteness in that theory

Watch

Extended reading notes

Core claim

The paper proves that the space of entropy sums in which boundary divergences cancel is generated by exactly four building blocks: the function assigning a constant to the empty set, the complement-entropy difference S(A)-S(A^c), the mutual information I(A,B) for non-adjacent regions, and the tripartite information I(A,B,C) for disjoint triples (Theorem 3.7). For a spatial slice divided into n regions, the codimension-one-safe sums form a vector space of dimension 2^n - B - 1, where B is the number of adjacent pairs. When higher-codimension corner divergences are included, a hypergraph version of the same Fourier argument gives an explicit orthogonal basis indexed by even-order subsets of in

Load-bearing premise

The classification assumes that UV divergences in regulated entanglement entropies are local, state-independent functions of boundary geometry and intersections, so that checking cancellation boundary component by boundary component and corner by corner is both necessary and sufficient; the paper explicitly does not prove this locality condition for any specific quantum field theory.

Editorial extensions

If this is right

  • Any finite entropy sum for a fixed n-region partition is uniquely expressible through complement entropy differences, mutual informations between non-adjacent regions, and tripartite informations of disjoint triples, so no other independent finite combination types exist.
  • The dimension formula 2^n - B - 1 for codimension-one-safe sums and 2^n - |IE| - 1 for fully safe sums turns the search for finite combinations into finite linear algebra determined entirely by the adjacency graph or hypergraph.
  • Mutual information is generically finite only when the two regions share no boundary intersection at any codimension, and tripartite information is generically finite only when the three regions do not meet together with a fourth region, except in special cuspy-corner cases.
  • The same characterization is equivalent to describing the ground-state space of a certain n-qubit Hamiltonian, giving a quantum-information reformulation of divergence-free entropy sums.
  • Several finite entropy combinations can be defined algebraically through relative entropies and the split property, without ever introducing a regulator; a fully general algebraic definition of tripartite information remains open.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: if the locality assumption survives lattice tests, the classification gives a practical dictionary—any candidate finite entanglement measure in a fixed spatial partition should be checked against this basis before being treated as genuinely new.
  • Editorial extension: because the proof is purely combinatorial, finiteness of an entropy sum can be certified by evaluating Fourier coefficients, an O(2^n) calculation on the adjacency graph that requires no regulator-dependent computation.
  • Editorial extension: the n-qubit ground-state reformulation suggests that divergence-free entropy sums form the ground-state space of a frustration-free local Hamiltonian; whether these states have simple tensor-network representations is a natural next step not explored in the paper.
  • Editorial extension: for holographic states, combining this basis with known inequalities such as monogamy of mutual information could constrain the full space of finite entropy data; proving analogous bounds on arbitrary basis elements would be a testable extension of the paper's claims.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper studies linear combinations S = Σ c_σ S(A_σ) of entanglement entropies for the unions of elementary regions in a spatial partition. It encodes the adjacency structure of the regions in a graph G, represents a coefficient vector by a function T on subsets of vertices, and characterizes the subspace TG of coefficients for which all boundary divergences cancel (condition (2)). The main theorems are: Theorem 3.3, an orthogonal Fourier basis for TG; Theorem 3.7, stating that TG is spanned by T0 (empty-set coefficient), complement-entropy differences S(A)−S(Ac), mutual informations of non-adjacent pairs, and tripartite informations of disjoint triples; and Theorem 4.3, the hypergraph generalization including higher-codimension corner divergences via conditions (13). Proposition 4.8 and Proposition 4.12 describe which information functions survive the stronger conditions and show that, in general, they do not span TH. The author explicitly disclaims proving necessity or sufficiency of the divergence-cancellation conditions for any particular QFT, and includes a short section on algebraic definitions and a note on AI use.

Significance. The mathematical core is clean and, if correct, gives a complete combinatorial classification of coefficient spaces for finite entropy sums. The Fourier/Möbius methods on the Boolean cube are natural for this problem; Theorem 3.7 is an appealing structural result that goes beyond the standard examples. The paper is transparent about its assumptions: the classification is relative to locality and complementarity conditions in Eqs. (2) and (13), and the author reports computer checks for all graphs up to seven vertices, which supports the conjectured form of Theorem 3.7. No parameters are fitted; the proofs are self-contained. The main value is the rigorous characterization of the coefficient-space problem; the physical interpretation is conditional on widely believed but unproved properties of QFT divergences.

major comments (4)
  1. [§3.2 (Prop. 3.12)] The proposed explicit basis is false for n=2. If G has the single edge {1,2}, the listed set {T0, T1, T2} has T2 = −T1, so it spans only a 2-dimensional space, while dim TG = 3; [12]−[∅] is in TG but not in the span. If G is edgeless, the list {T0,T1,T2,T12} again has rank 3 because T1 and T2 are dependent, while dim TG = 4. The counting in the proof double-counts the dependent type-2 functions and omits T_V = [V]−[∅]. A separate n=2 case, or replacing one T_i by T_V, is needed.
  2. [§3.1 (Lemma 3.4)] The displayed equality has the wrong sign. From the definitions, (ĉ_e, T) = (1/2)(χ_e − χ_∅, T) = 2^{n−1}(T̂(e) − T̂(∅)), while (ET)_e = 2^{n−1}(T̂(∅) − T̂(e)). Thus (ET)_e = −(ĉ_e, T). The kernel conclusion in Theorem 3.3 is unaffected because only the vanishing condition matters, but the lemma as stated is incorrect and should be fixed.
  3. [§4.1 (Lemma 4.2)] The proof that (g_{a,b}, χ_σ) is nonzero only for σ ⊂ I is incomplete. The sentence about cancellation for i ∈ σ does not address the case i ∉ σ, and the conclusion does not follow from the pairwise cancellation argument alone. The intended statement is correct: writing τ = (a∪φ) or (b∪φ) with φ ⊆ V\I gives a factorization with the factor Σ_{φ⊆V\I} (−1)^{x_{σ_c}·x_φ}, which vanishes unless σ contains no vertex outside I. Please replace the argument with this explicit factorization.
  4. [§1 / Abstract] The physical framing overstates the reach of the theorems. The paper proves statements about coefficient spaces satisfying the postulated cancellation conditions (2) and (13), and the author correctly disclaims proving necessity or sufficiency for any particular QFT. However, the abstract's opening 'we show that all such quantities...' is unconditional in tone. If actual QFT divergences have nonlocal pieces, or if corner divergences depend on more than the local corner and its complement, the true finite-sum space would differ from TG/TH. I recommend stating the assumption explicitly in the abstract and in Section 1 as a hypothesis of the classification, not merely as a caveat in the introduction.
minor comments (4)
  1. [Abstract] The abstract contains the typo 'collections of for these regions'.
  2. [Intro / §3.1] The dimension count is stated inconsistently: the abstract and bullet list say 2^n − B − 1, while Theorem 3.3 and the proof strategy note that the space TG, including the empty-set coefficient, has dimension 2^n − |E|. Please clarify which space is being counted.
  3. [§4.1 (Lemma 4.2)] In the sentence 'this is a set of 2^{|σ|−1}−1 equations for 2^{|σ|−1} unknowns', the symbol σ is reused for the intersection I. Use |I| for clarity.
  4. [§3.1 (Prop. 3.2)] In the orthogonality proof, the factor is written as a sum over (x_α)_i = ±1, but the characteristic vectors take values 0 and 1. The argument is correct with values 0 and 1; the notation should be adjusted.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the graph/hypergraph classification is a self-contained linear-algebra proof; the physical divergence-locality input is explicitly stated as an assumption, not derived from the target result.

full rationale

The derivation chain is purely combinatorial: T_G is defined as the kernel of the cut operator E via Eq. (2), and Theorems 3.3, 3.7, and 4.3 characterize this kernel using Fourier and Möbius bases. The four classes in Definition 3.6 are not defined in terms of T_G; Lemma 3.8 proves they lie in ker(E), and Lemma 3.9 proves the orthogonal-complement inclusion, so Theorem 3.7 is a genuine proof rather than a renaming or a fitted input. No parameter is fitted to data and no conclusion is assumed as an input. The only "input" that could look circular is the identification of physical divergence cancellation with the per-boundary/per-corner sum rules (2) and (13), but the author explicitly disclaims proving necessity or sufficiency for any particular QFT: 'we make no attempt to prove that the conditions we start with are necessary and/or sufficient for divergence cancellation in any particular quantum field theory.' That is a stated soundness assumption, not a circular derivation. The paper also contains no load-bearing self-citations; the cited works on corner divergences and topological entanglement entropy are external. Any proof-detail issues (e.g., sign or edge-case concerns) are correctness matters, not circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No free parameters are fitted or chosen by hand. The physical axioms are the locality and complementarity of divergences; these are stated as assumptions and the author explicitly flags that the paper does not prove them for specific QFTs. The mathematical machinery is standard.

assumptions (4)
  • domain assumption Divergences of subsystem entropies are local functionals of boundary geometry, so cancellation can be checked boundary component by boundary component.
    Used in Section 1 and Eq. (2); the author explicitly disclaims proving necessity or sufficiency for any particular QFT.
  • domain assumption For a pure global state, the entropy of a region equals the entropy of its complement, so corner divergences of complementary corner types match.
    Invoked in Section 4 before Eq. (13) to pair complementary corners.
  • domain assumption There exists a regularization scheme where divergences can be cancelled by a state-independent regulator-dependent term depending only on boundary geometry.
    Footnote 9; needed for conditions (2) and (13) to be necessary and sufficient.
  • standard math Standard Fourier analysis on the Boolean cube and Mobius inversion on the poset of subsets.
    Definitions 3.1 and 3.10, cited to O'Donnell and to Rota and Stanley.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Finite entropy sums in quantum field theory." pith.science (2026). https://pith.science/paper/62DQCHAU

@misc{pith2026250821276,
  author       = {Pith},
  title        = {Pith review of: Finite entropy sums in quantum field theory},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/62DQCHAU}},
  note         = {Machine review of arXiv:2508.21276}
}
read the original abstract

Entropies associated with spatial subsystems in conventional local quantum field theories are typically divergent when the spatial regions have boundaries. However, in certain linear combinations of the entropies for various subsystems, these divergences may cancel, giving finite quantities that provide information-theoretic data about the underlying state. In this note, we show that all such quantities can be written as linear combinations of three basic types of quantities: i) the entropy of a spatial subsystem minus the entropy of its complementary subsystem, ii) the mutual information between non-adjacent subsystems, and iii) the tripartite information for triples of disjoint sub-systems. For a fixed decomposition of a spatial slice into regions, we describe a basis of sums of entropies for collections of for these regions for which all divergences related to both region boundaries and higher-codimension intersections of regions cancel. Key mathematical technology used in this work (Fourier transforms on the Boolean cube and M\"obius transformations of functions on partially ordered sets) and several of the main proof ideas were suggested by AI (ChatGPT5). We offer a few comments on the use of AI in physics and mathematics, based on our experience.

Figures

Figures reproduced from arXiv: 2508.21276 by the authors.

Figure 1
Figure 1. Example regions for the three basic types of finite entropy combinations: i) [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Example regions, associated graphs, and bases of entropy sums for which diver [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Example of a (disconnected) spatial manifold Σ divided into regions [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Indicator, Fourier, and M¨obius bases for functions on subsets of a three-element [PITH_FULL_IMAGE:figures/full_fig_p014_4.png]
Figure 5
Figure 5. Figure 5: Left: mutual information I(A, B) has cancelling divergences associated with codi￾mension one boundaries, but uncancelled corner divergences. Middle: for corners that are sufficiently cuspy, these additional divergences may be absent. Right: the tripartite infor￾mation …

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Exploring the holographic entropy cone via reinforcement learning

    hep-th 2026-01 conditional novelty 8.0 of 10

    Reinforcement learning finds explicit graph realizations for three of six previously unresolved extreme rays of the N=6 holographic entropy cone and supplies evidence that the other three lie outside it.

  2. Non-perturbative constraints on stability and renormalization group flows in nonequilibrium matter

    cond-mat.stat-mech 2026-02 conditional novelty 7.0 of 10

    CMI scaling function is monotonically non-increasing along RG flows in nonequilibrium systems, forbidding flows from lower to higher CMI fixed points.

  3. Artificial Intelligence and the Structure of Mathematics

    cs.AI 2026-04 unverdicted novelty 4.0 of 10

    AI agents exploring Platonic mathematical structures via proof hypergraphs may reveal the overall architecture of formal mathematics and what makes parts of it human-accessible.

Reference graph

Works this paper leans on

29 extracted references · 21 canonical work pages · cited by 3 Pith papers

  1. [12]

    Bueno, R

    P. Bueno, R. C. Myers and W. Witczak-Krempa, Universal corner entanglement from twist operators, Journal of High Energy Physics 2015 (2015) 91, [ 1507.06997]

  2. [1]

    Wehrl, General properties of entropy , Rev

    A. Wehrl, General properties of entropy , Rev. Mod. Phys. 50 (1978) 221–260

  3. [2]

    Bombelli, R

    L. Bombelli, R. K. Koul, J. Lee and R. D. Sorkin, Quantum source of entropy for black holes, Phys. Rev. D 34 (1986) 373–383

  4. [3]

    Srednicki, Entropy and area, Phys

    M. Srednicki, Entropy and area, Phys. Rev. Lett. 71 (1993) 666–669

  5. [5]

    Haag, Local Quantum Physics: Fields, Particles, Algebras

    R. Haag, Local Quantum Physics: Fields, Particles, Algebras . Springer, Berlin, 2 ed., 1996

  6. [6]

    Bratteli and D

    O. Bratteli and D. W. Robinson, Operator Algebras and Quantum Statistical Mechanics 1. Springer, Berlin, 2 ed., 1997

  7. [7]

    Witten, Notes on some entanglement properties of quantum field theory , Rev

    E. Witten, Notes on some entanglement properties of quantum field theory , Rev. Mod. Phys. 90 (2018) 045003, [ 1803.04993]. 26

  8. [8]

    Universal terms for the entanglement entropy in 2+1 dimensions

    H. Casini and M. Huerta, Universal terms for the entanglement entropy in 2+1 dimensions, Nuclear Physics B 764 (2007) 183–201, [ hep-th/0606256]

Show all 29 references
  1. [9]

    Casini and M

    H. Casini and M. Huerta, Entanglement entropy in free quantum field theory , Journal of Physics A: Mathematical and Theoretical 42 (2009) 504007, [ 0905.2562]

  2. [10]

    Bueno, R

    P. Bueno, R. C. Myers and W. Witczak-Krempa, Universality of corner entanglement in conformal field theories , Physical Review Letters 115 (2015) 021602, [1505.04804]

  3. [11]

    Bueno and R

    P. Bueno and R. C. Myers, Corner contributions to holographic entanglement entropy , Journal of High Energy Physics 2015 (2015) 68, [ 1505.07842]

  4. [13]

    A. B. Kallin, E. M. Stoudenmire, P. Fendley, R. R. P. Singh and R. G. Melko, Corner contribution to the entanglement entropy of an o(3) quantum critical point in 2+1 dimensions, Journal of Statistical Mechanics: Theory and Experiment (2014) P06009, [1401.3504]

  5. [14]

    E. M. Stoudenmire, P. Gustainis, R. Johal, S. Wessel and R. G. Melko, Corner contribution to the entanglement entropy of strongly interacting o(2) quantum critical systems in 2+1 dimensions , Physical Review B 90 (2014) 235106, [ 1409.6327]

  6. [15]

    L. E. H. Sierens, P. Bueno, R. R. P. Singh, R. C. Myers and R. G. Melko, Cubic trihedral corner entanglement for a free scalar , Physical Review B 96 (2017) 035117, [1703.03413]

  7. [16]

    Bednik, L

    G. Bednik, L. E. H. Sierens, M. Guo, R. C. Myers and R. G. Melko, Probing trihedral corner entanglement for dirac fermions , Physical Review B 99 (2019) 155153, [1810.02831]

  8. [17]

    Seminara, J

    D. Seminara, J. Sisti and E. Tonni, Corner contributions to holographic entanglement entropy in ads 4/bcft3, Journal of High Energy Physics 2017 (2017) 76, [1708.05080]

  9. [18]

    Berthiere, Boundary-corner entanglement for free bosons , Physical Review B 99 (2019) 165113, [ 1811.12875]

    C. Berthiere, Boundary-corner entanglement for free bosons , Physical Review B 99 (2019) 165113, [ 1811.12875]

  10. [19]

    Nishioka, Entanglement entropy: holography and renormalization group , Reviews of Modern Physics 90 (2018) 035007, [ 1801.10352]

    T. Nishioka, Entanglement entropy: holography and renormalization group , Reviews of Modern Physics 90 (2018) 035007, [ 1801.10352]

  11. [20]

    Bueno, H

    P. Bueno, H. Casini and W. Witczak-Krempa, Generalizing the entanglement entropy of singular regions in conformal field theories , Journal of High Energy Physics 2019 (2019) 69, [ 1904.11495]

  12. [21]

    Kitaev and J

    A. Kitaev and J. Preskill, Topological entanglement entropy, Phys. Rev. Lett. 96 (2006) 110404. 27

  13. [22]

    Levin and X.-G

    M. Levin and X.-G. Wen, Detecting topological order in a ground state wave function , Phys. Rev. Lett. 96 (2006) 110405

  14. [23]

    Hayden, M

    P. Hayden, M. Headrick and A. Maloney, Holographic mutual information is monogamous, Physical Review D—Particles, Fields, Gravitation, and Cosmology 87 (2013) 046003

  15. [24]

    https://drive.google.com/file/d/1oJ1joUGsMsLO8F8X1WviNZjUBEtfumkU/

  16. [25]

    Diestel, Graph Theory, vol

    R. Diestel, Graph Theory, vol. 173 of Graduate Texts in Mathematics . Springer, Berlin, 5 ed., 2017

  17. [26]

    O’Donnell, Analysis of Boolean Functions

    R. O’Donnell, Analysis of Boolean Functions . Cambridge University Press, Cambridge, 2014

  18. [27]

    Rota, On the foundations of combinatorial theory I

    G.-C. Rota, On the foundations of combinatorial theory I. Theory of m¨ obius functions, Z. Wahrscheinlichkeitstheorie verw. Geb. 2 (1964) 340–368

  19. [28]

    R. P. Stanley, Enumerative Combinatorics, Volume 1 . Cambridge University Press, Cambridge, 2 ed., 2011

  20. [29]

    Araki, Relative entropy of states of von neumann algebras , Publ

    H. Araki, Relative entropy of states of von neumann algebras , Publ. Res. Inst. Math. Sci. 11 (1976) 809–833

  21. [30]

    C. J. Fewster, The split property for quantum field theories in flat and curved spacetimes, Abhandlungen aus dem Mathematischen Seminar der Universit¨ at Hamburg 86 (2016) 153–175, [ 1601.06936]. 28

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.