{"id":"b85a8f9a-ade9-403d-be69-2df522848c9b","arxiv_id":"2509.09463","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For tree tensor networks, a bond dimension tuple is minimal if and only if at every vertex each bond dimension is no larger than the local physical dimension times the product of the other incident bond dimensions.","lead":"This paper gives a complete rule for deciding when the bond dimensions of a tree-shaped tensor network are minimal, meaning some tensor really needs exactly those dimensions. The rule is a set of simple inequalities at each vertex, which generalizes the known characterization for Tucker (star-shaped) networks and makes the condition easy to check.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.6's 'Zariski open and dense' claim requires an infinite field; over finite fields it is false, so the unspecified 'field k' is too broad.","rationale":"The reader's weakest assumption is exactly the gap I find. The proof of Theorem 3.4 requires irreducibility of affine space over k, which holds only for infinite fields; Theorem 3.6 inherits this. More strongly, over finite fields the density statement is false, not merely unproved: in F_2^8 every subset is Zariski-closed, so TN^◦ cannot be a dense proper subset. This is a genuine flaw in the theorem as stated, but it is easily fixed by assuming k infinite (or algebraically closed), and the rest of the argument is sound over such fields. The reader's CONDITIONAL verdict is appropriate; no change needed.","tokens_in":9783,"tokens_out":26792,"duration_ms":292617,"concrete_test":"For a 3-leaf star graph with V_i=F_2^2 and r=(2,2,2), enumerate TN(G,r)=F_2^8. The set TN^◦ (tensors with all three flattening ranks exactly 2) is nonempty (T_111=T_222=1) but proper (zero tensor excluded). Over F_2 every subset is Zariski-closed, so a proper subset cannot be dense; this contradicts Thm 3.6's density assertion. Also check Thm 3.4's claim that a finite intersection of nonempty Zariski-open subsets of A^N is dense: in A^2(F_2), {x≠0}∩{x≠1}=∅, so the statement fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central theorem (Thm 3.6) is stated for a general 'field k' (Section 1), but its proof requires k to be infinite. Theorem 3.4 uses that a finite intersection of nonempty Zariski-open subsets of an affine space is nonempty, and Theorem 3.6 uses irreducibility of TN(G,r). Both fail over finite fields: over F_2, the open sets {x≠0} and {x≠1} in A^1 are nonempty but disjoint, and every subset of F_2^N is Zariski-closed. Concretely, take a 3-leaf star graph with dim V_i=2 and r=(2,2,2). Then TN(G,r)=F_2^8 (all 2×2×2 tensors) and TN^◦(G,r) is the nonempty proper set of tensors of multilinear rank (2,2,2) (e.g., T_111=T_222=1). Since every subset of F_2^8 is Zariski-closed, TN^◦ is not dense in TN(G,r), contradicting the 'Zariski open and dense' claim. The 'admissible iff TN^◦ nonempty' part may still hold over finite fields, but the theorem as stated is false if k may be finite. The authors should explicitly assume k is infinite (or algebraically closed) throughout.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies minimal bond dimensions for tree tensor networks. A tuple r of bond dimensions is called minimal for a tensor T if T can be represented with r but not with any componentwise smaller tuple. The main result, Theorem 3.6, characterizes when this happens: r is admissible, i.e. the local inequalities (4) hold at every vertex, if and only if the set TN^◦(G,r) of tensors whose tree tensor network rank equals r is nonempty. In the admissible case, TN^◦(G,r) is further claimed to be a Zariski open and dense subset of TN(G,r), so that minimality is generic. The proof is built on Theorem 3.5, which shows that r is minimal for T exactly when every core tensor has full effective multilinear rank equal to the incident bond dimensions, and on a local openness result (Theorem 3.4). The paper generalizes the Carlini–Kleppe characterization from star/Tucker graphs to arbitrary trees.","tokens_in":10151,"tokens_out":20046,"duration_ms":230942,"significance":"If the results are correct, this is a substantial and clean contribution: it reduces a global minimality question for tree tensor networks to finitely many local inequalities, proves that non-minimal tensors form a Zariski closed exceptional set, and provides a practical criterion for model reduction. The proof strategy is transparent and largely self-contained, using local Tucker refactoring for necessity and edge-cut flattening ranks for sufficiency. The paper also gives a clear reduction algorithm in Section 4. However, the central theorem is stated over an unspecified field k, and the algebraic-geometric arguments require k to be infinite; as stated, parts of the main theorem are false over finite fields. This is a load-bearing issue that must be fixed before the paper can be accepted.","major_comments":[{"comment":"The base field k is introduced only as 'a field' in Section 1. The proof of Theorem 3.4 relies on the assertion that a finite intersection of nonempty Zariski open subsets of an affine space is nonempty, and Theorem 3.6 relies on irreducibility of TN(G,r) and on density of nonempty Zariski open subsets. Both statements fail over finite fields: in A^1 over F_2, {x≠0} and {x≠1} are nonempty open sets with empty intersection, and every subset of F_2^N is Zariski closed. Concretely, for the 3-leaf star graph with dim V_i=2 and r=(2,2,2), the tuple is admissible, TN(G,r)=F_2^8, and TN^◦(G,r) is nonempty but not dense. Hence Theorem 3.6 is false as stated if k may be finite. Please assume k is infinite (or algebraically closed) throughout, or state and prove a separate finite-field version.","section":"Section 1 / Theorem 3.4 / Theorem 3.6"},{"comment":"In the refactoring step, the text says to absorb the factor matrices A_i^{(j')} into adjacent vertices only for j'≠j. To actually replace the edge dimension r_ij by the smaller μ_ij, the factor matrix A_i^{(j)} must also be absorbed into the vertex on the other side of the edge; otherwise the edge space E_ij remains r_ij-dimensional and no component of r is strictly reduced. As written, the construction is incomplete. If the exclusion of j is a typo, it should be corrected; if not, the argument needs to explain how the deficient edge's dimension is reduced.","section":"Theorem 3.5, Necessity"}],"minor_comments":[{"comment":"The sentence 'Because of (4) a generic tensor will flatten to a rank r_ij matrix' is too terse. Please spell out that the set of r_ij × C matrices of rank r_ij is Zariski open and nonempty precisely when r_ij ≤ C, which is exactly inequality (4).","section":"Theorem 3.4"},{"comment":"The application of Lemma 3.2 to an arbitrary edge (a,b) requires choosing a root orientation of G. It would help to say this explicitly before the 'Without loss of generality, assume a is the parent of b' sentence.","section":"Theorem 3.5, Sufficiency"},{"comment":"The complement is taken over the finite set {s ∈ N^E : s ≤ r, s ≠ r}; please state this explicitly to avoid a reader worrying about infinite unions.","section":"Theorem 3.6"},{"comment":"The 'leaves-to-root Hierarchical SVD' reduction is only sketched. A sentence connecting it to Theorem 3.5's equality criterion would clarify why the resulting network is minimal.","section":"Section 4"},{"comment":"Minor typographical and notation issues: the author line contains 'JANA JOVCHEV A' with a stray 'A'; some notation such as cM_a is used before being formally defined. Please proofread carefully.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The finite-field issue is the main obstacle; once the field assumption is added (and the small gap in the necessity proof of Theorem 3.5 is fixed), I expect the results to be correct and of clear interest to the tensor network and numerical linear algebra communities."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThis paper gives the first complete if-and-only-if characterization of minimal bond dimensions for arbitrary tree tensor networks: a tuple r is minimal for some tensor iff the local inequalities (4) hold at every vertex. That is a genuine extension of Carlini–Kleppe (star graphs) and of the necessity part known for binary trees. The authors are honest that it will not surprise experts, but they do fill in the sufficiency argument nobody had written down.\n\nThe proof is mostly clean. Lemma 3.2 is a correct induction on root depth; Theorem 3.4 is the standard generic-rank argument; Theorem 3.5's two directions are coherent, with the sufficiency direction relying on Ye–Lim's flattening rank bounds, which is reasonable and not circular. I see no free parameters or invented entities.\n\nThe real soft spot is the field. The paper states everything over \"a field k\" and then uses Zariski topology and irreducibility. For the topology to behave as claimed, k must be infinite (ideally algebraically closed). Over finite fields Theorem 3.6's \"Zariski open and dense\" claim is false: the F_2 counterexample with a 3-leaf star and bond dims (2,2,2) gives TN equal to the whole 2×2×2 tensor space while TN^◦ is the proper nonempty set of full-multilinear-rank tensors, which cannot be dense in the discrete Zariski topology of a finite field. So the theorem as literally stated is too broad. I think this is a minor issue for the intended audience (numerical tensor networks work over R or C), but the authors need to state the field hypothesis explicitly and adjust the topological assertions accordingly.\n\nOverall: the paper is worth serious refereeing. It resolves a natural question, is readable, and gives practitioners a concrete inequality check for overparameterization. The main theorem's algebraic core holds up. I would send it to review, with the request that the field assumption be made explicit.\n\nMy scores: reading group yes, cite yes.","headline":"A clean proof of the tree tensor network minimality characterization, solid over infinite fields, with an unstated field assumption that makes the genericity claim false over finite fields.","tokens_in":10579,"tokens_out":3456,"would_cite":true,"duration_ms":39383,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["15A69","65F99"],"pacs":[],"model":"deepseek-v4-flash","headline":"For tree tensor networks, bond dimensions are minimal exactly when local inequalities hold at every vertex.","keywords":["tree tensor network","bond dimensions","minimal rank","admissible ranks","effective multilinear rank","Zariski open dense","tensor network rank","H-Tucker decomposition"],"falsifier":"Over a finite field such as $\\mathbb{F}_2$, construct a tree network and an admissible tuple $r$ for which no choice of local tensors achieves full effective multilinear rank everywhere—for instance, a vertex with two neighbors, physical dimension 2, and both bond dimensions 2, where the two rank-2 flattening conditions may have empty intersection over $\\mathbb{F}_2$. If such a configuration exists, Theorem 3.6 fails as stated, showing the infinite-field hypothesis is essential.","tokens_in":9719,"feed_emoji":"🕸️","tokens_out":4760,"duration_ms":50797,"temperature":0.7,"texified_at":"2026-08-05T20:28:41.797649+00:00","pith_summary":"This paper settles when a tuple of bond dimensions in a tree tensor network is genuinely minimal—that is, when some tensor can be represented with exactly those bond dimensions and no strictly smaller ones. The answer is a set of local inequalities: at every vertex, each incident bond dimension must be no larger than the physical dimension at that vertex times the product of the other incident bond dimensions. If these inequalities hold, the tensors that need exactly that bond dimension form a Zariski open and dense subset of the representable tensors, so minimality is generic; if they fail, no tensor requires exactly that tuple. The proof works by showing that a representation is minimal precisely when every local core tensor has full effective multilinear rank along its incident edges. This gives a practical test for overparameterization in tensor-network compression and generalizes the known star-graph (Tucker) characterization to arbitrary tree topologies.","texify_model":"deepseek-v4-flash","texify_usage":{"total_tokens":1647,"prompt_tokens":792,"completion_tokens":855,"prompt_tokens_details":{"cached_tokens":0},"prompt_cache_hit_tokens":0,"prompt_cache_miss_tokens":792,"completion_tokens_details":{"reasoning_tokens":112}},"feed_headline":"Inequality test pinpoints minimal tensor network ranks","feed_subtitle":"Local rank inequalities decide whether a tree tensor network is minimal; generic tensors then attain that minimal size.","key_machinery":"The key object is the effective multilinear rank of a local core tensor: the tuple of ranks of its flattenings, one per incident bond edge, obtained by treating that bond space as rows and all other bond spaces together with the physical space as columns. Lemma 3.2 shows that if every local flattening has full rank equal to the bond dimension, then contracting an entire subtree preserves injectivity, so the flattening of the full tensor along any cut has rank equal to the bond dimension across the cut. Combined with the admissibility inequalities, this makes full effective multilinear rank a generic condition, and the paper uses this to prove both minimality and openness/density.","core_discovery":"The central theorem (Theorem 3.6) characterizes minimal tree tensor network ranks: a tuple $r$ of bond dimensions is admissible—satisfying $r_{ij} \\leq \\dim V_i \\prod_{k\\in\\operatorname{nb}(i)\\setminus\\{j\\}} r_{ik}$ for every edge $(i,j)$—if and only if $\\operatorname{TN}^\\circ(G,r)$ is nonempty. In that case $\\operatorname{TN}^\\circ(G,r)$ is a Zariski open and dense subset of $\\operatorname{TN}(G,r)$, so a generic tensor representable with bond dimensions at most $r$ is actually representable with exactly $r$ and no smaller tuple. If $r$ is not admissible, then $\\operatorname{TN}^\\circ(G,r) = \\emptyset$. Along the way the paper proves (Theorem 3.5) that $r$ is minimal for a particular tensor $T$ if and only if each local core tensor $T_i$ has effective multilinear rank equal to the bond dimensions on its incident edges.","pith_inferences":["The admissibility inequalities resemble a Hall-type condition for the existence of full-rank flattenings; this suggests a matroid or bipartite-graph interpretation of tree tensor network ranks that the paper does not explore.","The theorem as stated requires an infinite base field: the proof that an admissible tuple is attained uses that a finite intersection of nonempty Zariski open sets is nonempty, which fails over finite fields such as F_2. Practical implementations over real or complex arithmetic remain valid, but exact computation over finite fields would need a separate argument.","Because Zariski density implies Euclidean density, the result predicts that random sampling inside TN(G,r) will almost surely hit minimal-rank tensors; this is a testable numerical prediction for hierarchical tensor formats.","One could extend the same local-inequality criterion to more general tensor network graphs (with cycles) by asking whether the contraction map is birational, but the tree-specific proof does not transfer directly."],"forward_implications":["Minimality of a tree tensor network becomes checkable by a purely local set of inequalities, so one can decide without computing any tensor whether a given bond-dimension tuple is a valid tree tensor network rank.","In admissible networks, the non-minimal tensors form a Zariski closed subset, meaning that a generic tensor has the full rank; numerical algorithms that see full-rank behavior are observing the generic case.","A leaves-to-root Hierarchical SVD procedure can reduce any non-minimal network to a minimal one by truncating local Tucker decompositions and absorbing factors into neighboring vertices.","The result extends the star-graph (Tucker) rank characterization to all tree topologies, so earlier conditional results that assume 'r is a tree tensor network rank' can now be replaced by explicit inequality checks.","The effective-multilinear-rank equality gives a certificate of minimality for a concrete tensor: if each core tensor flattens to full rank along every incident edge, the representation cannot be compressed without changing the topology."],"fun_headline_variants":["Inequalities lock minimal tensor network sizes","Rank bounds decide tree tensor minimality","Generic tensors hit minimal tree ranks","Local rank check proves network minimality","Tree tensor ranks: minimal iff local bounds"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The proof that an admissible tuple is actually attained relies on intersecting finitely many nonempty Zariski open sets being nonempty, which holds for infinite fields but not for finite fields; the paper does not state the field is infinite.","fun_headline_variants_meta":{"raw":{"variants":["Inequalities lock minimal tensor network sizes","Rank bounds decide tree tensor minimality","Generic tensors hit minimal tree ranks","Local rank check proves network minimality","Tree tensor ranks: minimal iff local bounds"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000117,"raw_usage":{"total_tokens":871,"prompt_tokens":656,"completion_tokens":215,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":400,"completion_tokens_details":{"reasoning_tokens":151}},"tokens_in":400,"tokens_out":215,"duration_ms":3149,"temperature":1.0,"reasoning_tokens":151,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-04T19:07:09.409955+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Over a finite field such as $\\mathbb{F}_2$, construct a tree network and an admissible tuple $r$ for which no choice of local tensors achieves full effective multilinear rank everywhere—for instance, a vertex with two neighbors, physical dimension 2, and both bond dimensions 2, where the two rank-2 flattening conditions may have empty intersection over $\\mathbb{F}_2$. If such a configuration exists, Theorem 3.6 fails as stated, showing the infinite-field hypothesis is essential.","supporting_citations":[],"review_version":1}