Pith. sign in

REVIEW 4 major objections 6 minor 1 cited by

Monotones from multi-invariants: a classification

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

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper conjectures a complete classification of LOCC-monotone multi-invariants: a psi-graph is edge-convex exactly when it is the Cayley graph of a finite Coxeter group, and proves the classification for all but six exceptional diagrams.

desk verdict A clean conjecture connecting edge-convex psi-graphs to finite Coxeter groups, with a credible partial proof; the load-bearing bridge to Marc's mirror-graph classification is asserted more than proved and deserves real referee attention. read the letter →

arxiv 2509.06348 v1 pith:N4M4V7MM submitted 2025-09-08 quant-ph hep-th

Abhijit Gadde , Shraiyance Jain This is my paper · ORCID
classification quant-phhep-th MSC 05C2520F5581P45
keywords entanglementmonotonesLOCCmulti-invariantspsi-graphsedge-convexityCoxetergroupsCayleygraphsmirror
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

Pure-state entanglement measures that are monotone on average under local operations and classical communication can be built from multi-invariants, polynomials in a multipartite state and its conjugate that are invariant under local unitary transformations. Each multi-invariant is labeled by a bipartite, edge-colored graph, and the authors' earlier work turned monotonicity into a graph condition called edge-convexity. The paper's main conjecture says that a connected graph of this kind is edge-convex exactly when it is the Cayley graph of a finite Coxeter group with standard involutive generators. The authors prove the 'only if' direction in full, and prove the 'if' direction for the Coxeter families $A_n$, $B_n=C_n$, and $D_n$, leaving the six exceptional connected diagrams $E_6,E_7,E_8,F_4,H_3,H_4$ open. If the conjecture is right, the multi-invariants that give LOCC-monotone pure-state entanglement measures are completely classified by finite Coxeter groups.

What carries the argument

The load-bearing object is the $\psi$-graph of a multi-invariant: a bipartite graph whose white and black vertices are copies of the state and its conjugate, and whose edge labels record which party's index is contracted. Edge-convexity asks that for every pair of same-label edges there exist reflecting cuts, which are odd automorphisms that swap two sides of the graph, together with positive-semidefinite matrices $M^{(k)}$ satisfying equation (6); this is exactly the condition that $\hat\nu(Z)=1-\hat Z$ does not increase under LOCC. The proof machinery is the equivalence of Theorem 3.1, which identifies edge-reflecting $\psi$-graphs with finite-Coxeter Cayley graphs, plus Lemma 3.1, which lifts edge-convexity of a subgroup Cayley graph and vertex-convexity of a coset graph to edge-convexity of the full Cayley graph. This lift is what powers the inductive proofs for $A_n$, $B_n$, and $D_n$.

What would settle it

Take the Cayley graph of each of the six exceptional Coxeter groups $E_6,E_7,E_8,F_4,H_3,H_4$, enumerate all reflecting cuts, and check whether the linear system (6) admits a positive-semidefinite solution; any failure would disprove the conjecture's 'if' direction, while an explicit edge-convex $\psi$-graph whose automorphism group is not a finite Coxeter group would disprove the 'only if' direction.

Watch

Extended reading notes

Core claim

The paper's central claim is Conjecture 1.1: a connected $\psi$-graph $Z$ is edge-convex if and only if it is a Cayley graph of a finite Coxeter group with standard involutive generators. Here $\psi$-graphs are the contraction graphs of multi-invariants, and edge-convexity is the property that makes the normalized invariant $\hat\nu(Z)=1-\hat Z$ a pure-state entanglement monotone. The authors prove the 'only if' direction by showing edge-convexity implies the weaker edge-reflecting condition, then using a graph-theoretic classification theorem to conclude that edge-reflecting $\psi$-graphs are exactly Cayley graphs of finite Coxeter groups. They prove the 'if' direction for the Coxeter-Dynkin diagrams $A_n$, $B_n(=C_n)$, and $D_n$ by induction, using a lemma that lifts edge-convexity from a subgroup to a larger group; since $I_n$ was already known and disconnected diagrams follow from connected ones, the full conjecture is reduced to the six exceptional connected diagrams $E_6,E_7,E_8,F_4,H_3,H_4$.

Load-bearing premise

The load-bearing premise is that the colored bipartite graphs whose edges are covered by reflecting cuts are exactly the unlabelled mirror graphs in the cited classification; if the edge-label-preserving odd automorphisms do not match that classification's symmetries, the Coxeter characterization of the necessary condition collapses.

Editorial extensions

If this is right

  • Every connected edge-convex multi-invariant is labeled by a finite Coxeter group, so the classification reduces the search for pure-state entanglement monotones to a finite list of Coxeter-Dynkin diagrams.
  • The earlier examples $E^{(2)}$, $E^{(3)}$, and $C_n$ fit the conjecture as $Z_{A_1\sqcup A_1}$, $Z_{A_1\sqcup A_1\sqcup A_1}$, and $Z_{I_n}$, confirming the proposal on known cases.
  • Edge-convexity of a disconnected Coxeter diagram follows from edge-convexity of its components by Proposition 1.1, so only the six exceptional connected diagrams need checking to finish the classification.
  • The coset-graph machinery yields explicit certificates: each reflecting cut contributes a positive-semidefinite matrix $M^{(k)}$, so a proved edge-convex graph comes with a checkable verification of monotonicity.

Reading between the lines

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

  • If the six exceptional cases are settled, quantum information theory gains entanglement monotones indexed by exceptional Coxeter groups; the $E_8$ case would be an eight-party monotone with unusually large symmetry.
  • Because edge-convexity is purely a property of the contraction graph, the same classification likely extends to resource theories whose monotones are built by pairing tensors with their duals, not just quantum entanglement.
  • A finite computation, namely solving the positive-semidefinite program (6) for the six remaining diagrams, could settle the 'if' direction without new conceptual machinery.
  • The logical hygiene of the 'only if' direction sits in the identification between reflecting cuts in colored graphs and the mirror-graph classification it invokes; a rigorous formal check of that identification would strengthen the proof.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 6 minor

Summary. The paper studies graph-theoretic local unitary invariants of pure multipartite quantum states, called multi-invariants, which are labeled by bipartite uniformly edge-labeled graphs ('psi-graphs'). The main object is the combinatorial condition of edge-convexity introduced by the authors in [1], which guarantees that the associated normalized invariant defines a pure-state entanglement monotone. The paper conjectures that a connected psi-graph is edge-convex if and only if it is the Cayley graph of a finite Coxeter group with its standard involutive generators. The 'only if' direction is claimed via the necessary edge-reflecting condition and an external classification of mirror graphs, while the 'if' direction is proved for the families A_n, B_n(=C_n), D_n, and for direct products, leaving the six exceptional Coxeter diagrams E_6,E_7,E_8,F_4,H_3,H_4 open. The main technical novelty is a reduction to a vertex-convexity condition for Schreier coset graphs, together with Lemma 3.1, which transfers edge-convexity from a subgroup to the full group.

Significance. If the conjecture is correct, it gives a clean and surprising classification of a natural class of entanglement monotones in terms of finite Coxeter groups, and it reduces the remaining cases to a finite list. The paper's partial results are valuable: Proposition 1.1 reduces the conjecture to connected Coxeter-Dynkin diagrams, and Theorem 1.2 verifies three infinite families. The strategy of passing to coset graphs and vertex-convexity is elegant and likely to be reusable. However, several load-bearing steps in the proofs are only sketched or asserted, in particular the translation between the paper's reflecting cuts and the external mirror-graph classification, and the extendibility of reflecting cuts used in Lemma 3.1. As it stands, the classification is conditional on filling these gaps.

major comments (4)
  1. [Section 3.1 and Appendix B, Lemma 3.1] Lemma 3.1 is load-bearing for Proposition 1.1 and Theorem 1.2, but its proof relies on the unproved assertion that a reflecting cut of Cay(H,K) extends uniquely to a reflecting cut of Cay(G,S). In Section 3.1 this is introduced with 'First note', and the proof in Appendix B repeats the statement without argument. The definition of vertex-convexity (Definition 3.2, Eq. (7)) also depends on which reflecting planes are extendible, so without a proof of uniqueness and existence of extensions, both the lemma and the examples built on it are not fully established.
  2. [Section 3.2, vertex-convexity of B_n and D_n coset graphs] The vertex-convexity verifications for the orthoplex and the demi-hypercube are incomplete. For the n-orthoplex, the reflecting plane transverse to the first axis produces a matrix only for the pair (+-1,0,...,0); it does not cover arbitrary pairs such as (1,0,...,0) and (0,1,...,0), which are not separated by that plane. For the demi-hypercube, the single pi/4 co-dimension-one plane similarly addresses only one mirror pair. The hypercube discussion works for pairs related by the chosen hyperplane reflection, but the paper does not explain how the remaining pairs are handled. Since Eq. (7) requires a solution for every pair of vertices, these sketches do not yet prove edge-convexity of Z_{B_n} and Z_{D_n}.
  3. [Appendix B, Theorem 3.1, 2)<=>3)] The equivalence between the paper's mirror psi-graphs and the unlabelled mirror graphs of [5] is asserted rather than proved. Definition 2.3 requires an edge-label-preserving odd automorphism that flips vertex colors, whereas the classification in [5] is stated for unlabelled mirror graphs. The sentence 'Our definition of mirror psi-graph is equivalent to the definition of mirror graphs given in [5,9]' and the subsequent sketch are not a proof of this dictionary. A mismatch between the two notions would invalidate the 'only if' direction of Conjecture 1.1. The sketch also asserts, without derivation, that every pair of neighboring edges lies on a unique convex cycle of the form (s_A s_B)^{m_{AB}}; this is a substantive claim that needs to be justified.
  4. [Appendix B, Theorem 3.1, 2)=>1)] The proof of the implication 2)=>1) in Theorem 3.1 is too compressed. The step 'Also it contains neither e1, nor e2' is asserted without proof, and the construction of the odd cycle p-e1-p' is not fully written out. Because this implication is needed for the equivalence between mirror psi-graphs and edge-reflecting graphs, the gap affects the claimed classification and not merely the exposition. Please provide a complete argument, including a proof that a reflecting cut containing a geodesic edge of p cannot contain e1 or e2.
minor comments (6)
  1. [Introduction] The phrase 'E_6,7,8, F_4, H_3,5' should read 'E_6, E_7, E_8, F_4, H_3, H_4'.
  2. [Section 3.2] The cross-references 'the first figure of ??' and 'the second figure of ??' are unresolved; they should point to the actual figure in the manuscript.
  3. [Definition 2.4 and Definition 3.2] The matrices M^{(k)}(e,e') and M^{(k)}(v,v') are used in Eqs. (6) and (7) but are not defined precisely before first use. Please define them explicitly or refer to the definitions in [1].
  4. [Appendix B, Theorem 2.1] The proof of 4)=>1) in Theorem 2.1, especially the induction showing that the alternating 4-cycle property forces a hypercube, is very terse. Since this theorem is invoked in the proof of Theorem 3.1, please expand the induction step or cite a full proof.
  5. [Figure 5] The labels '4 5 5' and 'nIn' appear to be embedded in the displayed Coxeter diagrams in a confusing way; the figure should be redrawn so that edge labels and diagram names are clearly separated from the graph edges.
  6. [Remark 2.2] The argument for the inequality |Z(|psi>)| <= 1 is stated for the unnormalized invariant Z, while the Cauchy-Schwarz justification is cleanest for the normalized invariant; please clarify the normalization in the statement.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the classification argument reduces edge-convexity to an independent external mirror-graph theorem and to genuine new convexity constructions, with no fitted input or self-citation chain carrying the load.

full rationale

The derivation chain is self-contained in the relevant sense. Edge-convexity is defined explicitly in Definition 2.4, and the necessary condition of edge-reflexivity is derived in Remark 2.8 directly from that definition; no target conclusion is imported. Theorem 3.1 then reduces edge-reflecting/mirror ψ-graphs to Cayley graphs of finite Coxeter groups by invoking Marc's independent classification ([5], Theorem 2.8), which is an external, parameter-free graph-theoretic result rather than a self-citation. Thus the 'only if' direction of Conjecture 1.1 is a genuine consequence, not a reformulation. The 'if' direction is not obtained by construction either: Proposition 1.1 and Theorem 1.2 explicitly construct vertex-convexity solutions for the relevant coset graphs of A_n, B_n (=C_n), and D_n, and the six exceptional Coxeter diagrams are left genuinely open, so no fitted quantity is renamed as a prediction. The main same-author citation ([1], Theorem 1.1) supplies background motivation by relating edge-convexity to pure-state entanglement monotones, but the classification claim does not reduce to it; the paper restates the graph-theoretic definition and proves the classification steps using external results and new constructions. The asserted equivalence between the paper's mirror ψ-graphs and the mirror graphs of [5, 9], and the extension claim in Lemma 3.1, are proof gaps that affect rigor and completeness, but they are not circular reductions: they do not presuppose the Coxeter classification or fit parameters to the target result. Accordingly, no circular step can be exhibited, and the appropriate finding is no significant circularity.

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

No free parameters fitted to data. The central claim rests on prior theorems from [1] and [5], on the standard Coxeter classification, and on graph-automorphism facts proven in appendices. No new physical entities are introduced.

assumptions (4)
  • domain assumption Theorem 1.1 of [1]: if a connected psi-graph is edge-convex then nu^(Z) = 1 - Zhat is a pure state entanglement monotone.
    This connects the graph-theoretic edge-convexity to the quantum monotonicity definition; it is imported from the authors' prior paper and not reproven here.
  • domain assumption Theorem 2.8 of [5] (Marc): finite mirror graphs are exactly Cayley graphs of finite Coxeter groups with standard involutive generators.
    Load-bearing for theorem 3.1 and for the 'only if' direction of conjecture 1.1; the paper states the equivalence to its mirror psi-graphs but does not give a full proof of the identification.
  • standard math Classification of finite Coxeter groups by Coxeter-Dynkin diagrams, including disconnected sums as direct products.
    Standard background; used to enumerate connected CD diagrams and to reduce to A_n, B_n, D_n, E_6, E_7, E_8, F_4, H_3, H_4, I_n.
  • standard math Every automorphism of a connected psi-graph that fixes a vertex is identity, and odd automorphisms fixing an edge are involutions.
    Graph-theoretic facts used in Lemma B.1 and in defining reflecting cuts; proofs are sketched in the text.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Monotones from multi-invariants: a classification." pith.science (2026). https://pith.science/paper/N4M4V7MM

@misc{pith2026250906348,
  author       = {Pith},
  title        = {Pith review of: Monotones from multi-invariants: a classification},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N4M4V7MM}},
  note         = {Machine review of arXiv:2509.06348}
}
read the original abstract

In this paper we study local unitary invariants of a multi-partite quantum state that are monotonic, on average, under local operations and classical communication (locc). In particular we focus on local unitary invariants that are constructed out of polynomials in the state and its conjugate - called multi-invariants. Multi-invariants are labeled by certain types of graphs. Recently, in \cite{Gadde:2024jfi}, the authors related the condition of monotonicity under locc to a graph theoretic condition on the multi-invariant called edge-convexity. In this paper, we conjecture a complete classification of edge-convex multi-invariants. The conjecture states that the edge-convex multi-invariants are labeled by finite Coxeter groups. We prove this conjecture for all but six cases.

Figures

Figures reproduced from arXiv: 2509.06348 by the authors.

Figure 1
Figure 1. White (black) vertex denoting ψ (ψ¯). The parties are labeled by colored edges. ψ¯ is contracted, we connect the two corresponding vertex with A-edge and so on. If all the edges are contracted, the graph represents a local unitary invariant and if some edges are left unconnected then the open graph represents a tensor that transforms appropriately under local unitary transformations as indicated by the uncontracted … view at source ↗
Figure 2
Figure 2. Example of a ψ-graph constructed from three copies of ψ and ψ¯ each by connecting edges of identical colors. multi-invariant to also denote the associated ψ-graph as well. Multi-invariants obeys the factorization property Remark 2.1. Z(|ψ1⟩ ⊗ |ψ2⟩) = Z(|ψ1⟩)Z(|ψ2⟩). (4) Here |ψ1⟩ and |ψ2⟩ are q-partite states and their tensor product is also thought of as a q-partite state with party A of |ψ1⟩ ⊗ |ψ2⟩ being the tenso… view at source ↗
Figure 3
Figure 3. The reflecting cut is shown by a straight black line passing through the [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: The top two figures show the choice of two [PITH_FULL_IMAGE:figures/full_fig_p010_4.png]
Figure 5
Figure 5. Figure 5: A finite Coxeter group is represented by a disconnected sum of above [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]
Figure 6
Figure 6. Figure 6: The reflecting cut is denoted by a black curve. It cuts the path from [PITH_FULL_IMAGE:figures/full_fig_p013_6.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. From Multipartite Entanglement to TQFT

    hep-th 2026-02 conditional novelty 7.0 of 10

    Genuine multipartite entanglement of a gapped ground state is conjectured and, for Levin-Wen models, shown to reproduce the TQFT partition function on any 3-manifold.

Reference graph

Works this paper leans on

9 extracted references · 4 canonical work pages · cited by 1 Pith paper

  1. [1]

    Gadde, S

    A. Gadde, S. Jain and H. Kulkarni,Multi-partite entanglement monotones(2024), 2406.17447

    arXiv 2024

  2. [5]

    T. Marc,Mirror graphs: Graph theoretical characterization of reflection arrange- ments and finite coxeter groups, European Journal of Combinatorics63, 115 (2017), doi:https://doi.org/10.1016/j.ejc.2017.03.001

    work page doi:10.1016/j.ejc.2017.03.001 2017

  3. [2]

    Horodecki, P

    R. Horodecki, P. Horodecki, M. Horodecki and K. Horodecki,Quantum entanglement, Reviews of Modern Physics81(2), 865–942 (2009), doi:10.1103/revmodphys.81.865

    doi:10.1103/revmodphys.81.865 2009

  4. [3]

    Vidal,Entanglement monotones, Journal of Modern Optics47(2-3), 355 (2000), doi:10.1080/09500340008244048

    G. Vidal,Entanglement monotones, Journal of Modern Optics47(2-3), 355 (2000), doi:10.1080/09500340008244048

    doi:10.1080/09500340008244048 2000

  5. [4]

    Gadde, J

    A. Gadde, J. Harper and V. Krishna,Multi-invariants and Bulk Replica Symmetry (2024),2411.00935

    arXiv 2024

  6. [6]

    Grassl, M

    M. Grassl, M. R¨ otteler and T. Beth,Computing local invariants of quantum-bit sys- tems, Phys. Rev. A58, 1833 (1998), doi:10.1103/PhysRevA.58.1833

    doi:10.1103/physreva.58.1833 1998

  7. [7]

    Structural characterization of Cayley graphs

    D. Caucal,Structural characterization of cayley graphs(2016),1609.08272

    work page Pith review arXiv 2016

  8. [8]

    Sabidussi,On a class of fixed-point-free graphs, Proceedings of the American Mathematical Society9(5), 800 (1958)

    G. Sabidussi,On a class of fixed-point-free graphs, Proceedings of the American Mathematical Society9(5), 800 (1958)

    work page 1958

Show all 9 references
  1. [9]

    Breˇ sar, S

    B. Breˇ sar, S. Klavˇ zar, A. Lipovec and B. Mohar,Cubic inflation, mirror graphs, regular maps, and partial cubes, European Journal of Combinatorics25(1), 55 (2004), doi:https://doi.org/10.1016/j.ejc.2003.09.004. 15

    2004 doi

Pith tools

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