{"id":"554f1c3e-3ac2-4ac5-9642-4b6a56abf6b8","arxiv_id":"2505.21376","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The authors extend the fourth axiom of their structured random matrix ensembles to cumulants of disjoint cycles and argue that the class remains stable under non-linear transformations, with an unproved combinatorial claim.","lead":"This note refines the definition of a class of random matrix ensembles from the authors' earlier paper, adding a stronger assumption about how fluctuations of several separate cycles shrink with matrix size. It argues the refined class is still closed under polynomial and entry-wise non-linear operations, but admits a key step in the proof is missing.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 1's proof rests on an unproved completeness lemma: moves 1–3 are claimed to be the only leading-order partition operations and no cheaper (N^-1) alternative exists, but the authors explicitly say no proof is known; until that lemma is proved, the N^{2-r-n} scaling is not established.","rationale":"The reader's weakest_assumption identifies exactly the gap I find: the load-bearing claim is the completeness of the partition moves and the absence of an N^{-1} operation. I agree with the rejection. The addendum is honest and clearly scoped: it refines axiom (iv) to cumulants of disjoint cycles and shows in detail how the proposed partition moves would imply the desired scaling. But the proof of the key lemma is absent, and the authors say so in the text. Without that lemma, Proposition 1—and with it the self-averaging statement and Eq. (6)—are not established. I do not see a separate internal inconsistency; the problem is a missing foundational lemma rather than a contradiction in the argument. The paper could be upgraded to a complete proof if the lattice-of-partitions lemma were supplied with a rigorous proof. Because the central claim is currently unsupported by a complete derivation, the appropriate status is unchanged from the reader's REJECT: not because the statement is known false, but because the proof is incomplete at the decisive point.","tokens_in":6365,"tokens_out":12909,"duration_ms":155109,"concrete_test":"Exhaustively enumerate, for r=3 and n up to 4 with all m_i in {1,2}, all set partitions π of the k=n+m matrix entries into blocks, with the original r cycle intervals marked, and retain only those satisfying π∨Γ = 1_k. For each retained π compute its leading N-exponent using the same loop-counting and free-index rules that moves 1–3 rely on; any partition with exponent strictly better than N^{2-r-n} is a candidate counterexample. Then check whether every partition with exponent at least N^{2-r-n} is reachable from the product partition by iterating moves 1–3 with cumulative cost N^{-2(r-1)}. If an unreachable partition with better exponent exists, Proposition 1 is false; if the search is clean, extend it to r=4 or formalize the lattice-of-partitions lemma. Separately, run the analogous enumeration for the entry-wise setting of Proposition 2.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is Proposition 1, and the linchpin of its proof is the assertion, in the final paragraph of 'Justification of Proposition 1', that 'operations 1, 2 and 3 are the only relevant operations at leading order, and that there is no operation that is less costly'. The proof strategy is: a disconnected partition contributes N^{r-n}; to enforce the condition π∨Γ = 1_{n+m}, the blocks from the r cycles must be merged; and the authors assert that the minimal merges are generated by moves 1–3 with total cost N^{-2(r-1)}, giving N^{2-r-n}. The authors immediately add: 'we are lacking an actual proof, which would probably involve a more formal argument about the lattice of partitions and the set of partitions we can reach with our three operations.' That missing lemma is load-bearing in both directions: completeness — every leading partition must be reachable from the product partition by these moves; and sharpness — no move can merge or reconnect cycles with only N^{-1}, which would change the order to N^{1-n} and invalidate the refined axiom (iv). Proposition 1 is then used for the self-averaging statement (4) and for the corollary (6), so all the main conclusions inherit the gap. Proposition 2 also applies the same move-cost machinery and is not independent of the issue. The authors' transparent flagging of the gap is to their credit, but it does not turn the argument into a proof: the result is currently a well-formulated conjecture with heuristic support, not an established theorem.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This short addendum proposes a refinement of the fourth axiom for structured random matrix ensembles, replacing the earlier single-cycle cumulant scaling by a statement that cumulants of r disjoint cycles with n total elements scale as N^{2-r-n}. The paper claims that this refined axiom is preserved under matrix-valued polynomial operations M -> P(M) (Proposition 1) and under entrywise nonlinear operations (Proposition 2), and it derives corollaries on self-averaging of traces and on fluctuation scaling. The proof strategy represents matrix powers graphically and uses three operations on partitions to connect the r cycles, each operation supposedly costing a factor N^{-2}, yielding the desired scaling.","tokens_in":6728,"tokens_out":6057,"duration_ms":67545,"significance":"If fully established, the refined axiom class would be a substantive strengthening: it would show closure of structured random matrix ensembles under nonlinear transformations and provide the scaling N^{2-2r} for joint fluctuations of polynomial traces, which has many potential applications. The manuscript is unusually transparent in identifying exactly which step is missing. However, the central theorem is not currently proved: the key combinatorial assertion is explicitly labeled as lacking a proof, and all main conclusions (Propositions 1 and 2, Equation (4), and Corollaries (5)-(6)) rest on it. The contribution is therefore best read as a well-formulated conjecture with heuristic support rather than an established result.","major_comments":[{"comment":"The invariance of axiom (iv) under M -> P(M) is not established. The proof's conclusion N^{2-r-n} in Eq. (9) depends on the assertion that \"operations 1, 2 and 3 are the only relevant operations at leading order, and that there is no operation that is less costly,\" and the manuscript immediately states \"we are lacking an actual proof\". This is load-bearing in two directions: completeness (every partition contributing at leading order is reachable by moves 1-3) and sharpness (no move merges cycles with cost N^{-1}, which would change the final scaling to N^{1-n}). Until a proof of this combinatorial lemma is supplied, Proposition 1, and with it Equations (4)-(6), remain conditional.","section":"Justification of Proposition 1, final paragraph"},{"comment":"The sharpness part of the move-count argument is also asserted rather than derived. The sentence \"if one would select disjoint segments in the same cycles ... one can check that the operation would cost less (a higher negative power) than N^{-2}\" is not accompanied by a computation. Since the absence of an N^{-1}-cost operation is precisely what distinguishes the desired N^{2-r-n} from the falsifying N^{1-n}, this check needs to be made explicit for all possible operations, not just for the examples considered.","section":"Justification of Proposition 1, operation (2)"},{"comment":"The derivation of Eq. (4) from the refined axiom (iv) is incomplete. Axiom (iv) applies only to cumulants of cycles with no index in common, but the cumulant C_r[tr M, ..., tr M] is a sum over index tuples that includes tuples with equal indices across different cycles. The paper does not show that the contributions with coinciding indices are subleading in N. This is a separate missing estimate, and it is needed for the claimed self-averaging statement.","section":"Equation (4), self-averaging of the trace"},{"comment":"Proposition 2 inherits the unresolved move-completeness issue, since its proof applies \"iteratively the moves (1-2-3)\" and relies on the same accounting that each application costs N^{-2}. Additionally, the statement \"only the moves of type (1) matters\" is not justified in the presence of small loops of length two arising from the entrywise factors f_{ij}; the grouping of long and small loops could in principle lead to different partition structures, and the proof should explain why none of those changes the scaling.","section":"Justification of Proposition 2"}],"minor_comments":[{"comment":"Typographical and stylistic issue: \"As will be come clear\" should read \"As will become clear\".","section":"Proof, first paragraph"},{"comment":"The notation \"n1 + m1 · · · nr + mr\" in the cumulant argument is not formally defined; the authors should specify explicitly what the n cumulant entries are after replacing each original matrix element by a power, for instance by writing the arguments as powers (M^{p})^{i i'} with labeled indices.","section":"Equation (9)"},{"comment":"The terminology \"cost less\" is confusing when combined with \"a higher negative power\". A factor N^{-3} is numerically smaller than N^{-2}, so describing it as \"costing less\" requires a consistent definition; the paper should state whether cost refers to the absolute value of the exponent or to the size of the factor.","section":"Justification of Proposition 1, operations 1-3"},{"comment":"The diagram for operation (3') is hard to read; a short verbal description of which Kronecker delta is opened and which indices are identified would help the reader follow the claimed equivalence with operation (3).","section":"Equation (16), operation (3')"},{"comment":"The abstract says the paper \"argues\" that the theorems still hold, while the body explicitly states that a proof of the key claim is lacking; the abstract should be adjusted to match the actual status, e.g., by stating that the result is proved modulo an explicit combinatorial lemma.","section":"Abstract and introduction"}],"recommendation":"major_revision","confidential_remarks":"This is a short addendum that is candid about its main missing ingredient. The central claim is plausible and the authors have identified the exact gap, but as written the paper does not contain a proof of Proposition 1. I would advise the editor that acceptance should be conditioned on a complete proof of the move-completeness and sharpness lemma, or on an explicit statement that the paper is a conjecture with heuristic evidence."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear [Colleague],\n\nThe main thing to know: this addendum refines axiom (iv) of the authors' structured random matrix framework to cover cumulants of disjoint cycles, and then claims the invariance theorems from their earlier paper still hold. The refinement is natural and the paper is transparent about its main gap, but that gap is load-bearing: as it stands, the central result is a well-specified conjecture, not a theorem.\n\nWhat is new: the strengthened axiom (iv), the two invariance propositions (matrix polynomial operations and entry-wise operations), and the corollaries on self-averaging. The partition-move strategy is a reasonable extension of standard cumulant methods, and the authors correct several misprints from their earlier paper—useful housekeeping.\n\nThe soft spot: Proposition 1 relies on the claim that operations 1–3 are the only leading-order partition moves and that no move costs less than N^{-2}. In the final paragraph of 'Justification of Proposition 1' the authors explicitly say they lack a proof of this claim. That completeness/sharpness lemma is needed to get the N^{2-r-n} scaling; without it, the proof does not go through. The self-averaging statement (4) and corollary (6) inherit the gap, as does Proposition 2 insofar as it uses the same move machinery. The authors also note that axiom (iv) is unproved for QSSEP, so the framework's intended flagship application is conditional.\n\nNone of this is fatal to the paper's potential. The authors tell you exactly where the hole is, and they give good heuristic reasons. But transparency does not replace a proof. A referee could try to prove the missing lemma or find a counterexample—either outcome would be valuable.\n\nWho is this for: people working in free probability and structured random matrices, especially QSSEP. I would bring it to a reading group and discuss the gap. I would not cite it as a theorem until the lemma is settled.\n\nMy recommendation: send it to peer review rather than desk-reject. The question is well posed, and the paper is honest about its limitations. If I were the editor, I would ask the referee to determine whether the missing claim admits a proof or a counterexample, and reject if it stays conjectural.","headline":"A sensible axiom refinement and an honest flag of a missing proof, but the central invariance theorem is conjectural until the partition-move completeness lemma is established.","tokens_in":7182,"tokens_out":3532,"would_cite":false,"duration_ms":34506,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60B20","46L54","05A18"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper refines the axioms of structured random matrix ensembles to control cumulants of disjoint index cycles, and argues the class stays closed under polynomial and entry-wise nonlinear transformations, with self-averaging traces and…","keywords":["structured random matrices","cyclic cumulants","free probability","non-linear transformations","self-averaging","partition moves","random matrix axioms","fluctuation scaling"],"falsifier":"Find a legitimate partition, reachable through the cumulant formula, that connects two disjoint cycles by identifying only one pair of indices (a cost of $N^{{-1}}$) while preserving local U(1) invariance; such a partition would break the scaling $N^{{2-r-n}}$ and falsify Proposition 1.","tokens_in":6167,"feed_emoji":"🎲","tokens_out":6636,"duration_ms":69646,"temperature":0.7,"pith_summary":"This note tightens the defining axioms of a class of structured random matrix ensembles. The earlier fourth axiom controlled cumulants of a single cycle of matrix elements; the refined version also controls cumulants of several disjoint cycles, which is what appears when one studies products of traces. The paper argues that, with this refinement, the axioms survive matrix-valued polynomial operations M → P(M) and entry-wise nonlinear operations, and that traces of polynomials become self-averaging with a concrete fluctuation scaling $N^{{2-2r}}$ for r traces. The proof relies on a partition-move argument whose completeness is explicitly left unproved.","feed_headline":"Disjoint-cycle rule fixes fluctuation size of many matrix traces","feed_subtitle":"If right, polynomial maps preserve the class and r-trace cumulants scale as N^{2-2r}.","key_machinery":"The load-bearing object is the cumulant expansion of products of random variables (Eq. (10)), which rewrites the cumulant of r cycles as a sum over partitions whose blocks successively connect the cycles. The scaling argument then runs on the lattice of partitions using three moves: joining two parts from distinct cycles, cutting and re-gluing two segments with two new index identifications, and a three-cycle analog. Each move is assigned a cost $N^{{-2}}$, and the claim that these three moves generate all leading-order connections is the unproved step.","core_discovery":"The central claim is Proposition 1: the refined axioms, including the new disjoint-cycle axiom (iv), are invariant under M ↦ P(M) for any polynomial P. Under axiom (iv), a cumulant of r disjoint index cycles containing n matrix elements in total scales as $N^{{2-r-n}}$. The proof scheme starts from a factorized partition where each cycle is internally connected, with known scaling $N^{{r-n}}$, and then applies three moves on the partition lattice to merge cycles; each move is claimed to cost a factor of $N^{{-2}}$, so that merging r cycles multiplies the scaling by $N^{{-2(r-1)}}$, yielding exactly $N^{{2-r-n}}$.","pith_inferences":["If the refined axiom (iv) is verified for models like QSSEP that the authors suspect satisfy it, the same polynomial stability and self-averaging results would extend to those models; a direct check of the cycle-cumulant scaling would settle this.","The three-move argument hints at a general principle: each merger of two cycles costs a factor N^{-2} determined by the number of forced index identifications, so a formal proof of the claim would likely recast the moves as generators of the lattice of connected partitions.","The finite coefficient in the N^{2-2r} scaling of r-trace cumulants is not fixed by the local free cumulants alone; computing it explicitly for ensembles such as unitarily invariant ones would provide a sharper test of the refined axioms.","Because the argument is carried by the index-cycle structure rather than by Hermiticity, it may plausibly extend to rectangular or non-Hermitian ensembles once the local phase invariance is replaced by a suitable index symmetry."],"forward_implications":["For any polynomial P, if M satisfies the refined axioms then P(M) also satisfies them, so the class of structured random matrix ensembles is stable under matrix-valued polynomial operations.","The trace of a polynomial in M is self-averaging at leading order: E[e^{z N tr P(M)}] is asymptotic to e^{z N E[tr P(M)]} as N grows.","Cumulants of r traces scale as N^{2-2r}, giving a quantitative handle on joint fluctuations of several traces.","Entry-wise nonlinear operations Y_ij = M_ij f(N|M_ij|^2) preserve the axioms for centered matrices, including the refined axiom (iv).","The refined axiom is satisfied by symmetric orthogonally and unitarily invariant random matrix ensembles, so the stability results apply to them."],"supporting_citations":[{"why":"The companion paper that introduced the original four axioms and the stability theorems under non-linear transformations; this note refines axiom (iv) and re-proves those theorems.","marker":"[1]"},{"why":"Establishes that the refined axiom (iv) holds for unitarily invariant random matrices.","marker":"[2]"},{"why":"Supplies the result that leading contributions come from non-crossing partitions and that Kreweras complements enforce the index identifications used to get the initial scaling of factorized partitions.","marker":"[3]"},{"why":"Provides the cumulant-of-products expansion formula (Eq. (10)) that underlies the entire partition-move argument.","marker":"[4]"},{"why":"Demonstrates that the refined axiom (iv) is satisfied by symmetric orthogonally invariant random matrices.","marker":"[5]"}],"fun_headline_variants":["Disjoint-cycle axiom fixes trace fluctuation scaling","New axiom keeps polynomial maps stable for matrix ensembles","Cumulant scaling pinned by disjoint-cycle refinement","Polynomial invariance holds under refined fourth axiom","Axiom tweak tightens r-trace cumulant size bounds"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole proof rests on the unproved assertion that the three listed moves are the only ways to connect disjoint cycles at leading order and that no move costs less than $N^{{-2}}$; the authors say they believe this from many examples but have no proof.","fun_headline_variants_meta":{"raw":{"variants":["Disjoint-cycle axiom fixes trace fluctuation scaling","New axiom keeps polynomial maps stable for matrix ensembles","Cumulant scaling pinned by disjoint-cycle refinement","Polynomial invariance holds under refined fourth axiom","Axiom tweak tightens r-trace cumulant size bounds"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00017,"raw_usage":{"total_tokens":1159,"prompt_tokens":729,"completion_tokens":430,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":345,"completion_tokens_details":{"reasoning_tokens":356}},"tokens_in":345,"tokens_out":430,"duration_ms":5373,"temperature":1.0,"reasoning_tokens":356,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T13:29:20.738545+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find a legitimate partition, reachable through the cumulant formula, that connects two disjoint cycles by identifying only one pair of indices (a cost of $N^{{-1}}$) while preserving local U(1) invariance; such a partition would break the scaling $N^{{2-r-n}}$ and falsify Proposition 1.","supporting_citations":[{"cited_title":"Structured random matrices and cyclic cumu- lants: A free probability approach.Random Matrices: Theory and Applications, 13(03):2450014, July 2024","cited_arxiv_id":null,"evidence_quote":"The companion paper that introduced the original four axioms and the stability theorems under non-linear transformations; this note refines axiom (iv) and re-proves those theorems."},{"cited_title":"James Mingo, Piotr´Sniady, and Roland Speicher","cited_arxiv_id":null,"evidence_quote":"Establishes that the refined axiom (iv) holds for unitarily invariant random matrices."},{"cited_title":"Coherent Fluctuations in Noisy Mesoscopic Systems, the Open Quantum SSEP, and Free Probability.Physical Review X, 13(1):011045, March 2023","cited_arxiv_id":null,"evidence_quote":"Supplies the result that leading contributions come from non-crossing partitions and that Kreweras complements enforce the index identifications used to get the initial scaling of factorized partitions."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the cumulant-of-products expansion formula (Eq. (10)) that underlies the entire partition-move argument."},{"cited_title":"Entrywise application of non-linear functions on orthogonally invariant matrices, December 2024","cited_arxiv_id":null,"evidence_quote":"Demonstrates that the refined axiom (iv) is satisfied by symmetric orthogonally invariant random matrices."}],"review_version":1}