slug: fiol-martinezmontoya-riosfukelman-2020-tree-lee-yang bibkey: fiolmartinezmontoyariosfukelman2020quiver doi: 10.1007/JHEP08(2020)161 url: https://arxiv.org/abs/2006.06379v2 triage: theorem motivation_gids:
- D5/S3/Zeros/LeeYang/QuiverTreeIsingRefutation.result
Positive joint weights and the tree Lee–Yang conjecture
Problem
B. Fiol, J. Martínez-Montoya and A. Rios Fukelman, The planar limit of N=2 superconformal quiver theories, JHEP 08 (2020) 161, arXiv:2006.06379v2, Section 2.2, Conjecture 1:
For any tree with edges, any fixed positive integers and arbitrary the polynomials have all their roots on the unit circle.
Equation (2.30) sums over positive edge splits and all Boolean spin states. The mass at a vertex is the sum of the integers assigned to its incident endpoints. A state contributes , where counts opposite-spin edges. The Lee–Yang parameter range is . The source’s one-edge case is proved through the Lakatos–Losonczi criterion.
The source sentence at quivers_n_2.tex lines 343–345 makes a
distribution on the whole split configuration. Thus Conjecture 1 permits
an arbitrary positive joint function; it does not impose edgewise factorization.
The physical specialization in (2.31) includes vertex factors
that depend jointly on the incident splits, as defined at source lines 198–203.
Statement echo
The public definitions are splits, mass, treePoly and claim.
The tree condition is the frozen
D5.S3.Observer.AgencyHolonomy.NamedTreePhaseTransport.NamedSpanningTree
with Set.univ, selecting every edge: its nonloop, distinct and isTree fields
state exactly the finite-type tree convention. The subtype of all edges is
in bijection with the edge type, so its injectivity and support conditions
are the same as the source convention.
Motivation
The settling declaration is
D5/S3/Zeros/LeeYang/QuiverTreeIsingRefutation.result.
Its admission basis is open-problem-resolution (#15357; Refuted);
the preregistration
fixes the source statement and the finite-type encoding.
The only public theorem is result : ¬ claim.
The public result is the designated refutation result (basis=refutes) and is
exempt from four-slot escape registration (CLAUDE.md §3.9).
Gap
The preregistration records a screen of 29 INSPIRE citing works, attributed
to its search producer, with no settlement of Conjecture 1 found. This is
not-found-in-searched-scope, not an exhaustive novelty claim.
The fixed-configuration Lee–Yang theorem and the one-edge result do not
assert closure under arbitrary positive mixing of different vertex masses.
Route
Use the three-vertex path oriented , with , and the positive joint weights
Rows and columns are indexed by . The masses are . The same polynomial arises from after reversing the second weight index, .
The module’s private path_poly computes the source polynomial as
Its private sextic_factor and lift_root implement the reciprocal reduction
The private q_discr proves ;
q_not_splits combines the imported cubic discriminant identity with
nonnegativity of a square. Algebraic closure and descent of splitting give
a nonreal root . A root of is nonzero and lifts to
. If , then and would be
real, a contradiction. This is the kernel-checked route at .
Falsifier
The encoded claim universally quantifies finite vertex and edge types,
loop-free injective unordered edge lists whose support is a tree,
totals , strictly positive joint weights on every allowed split,
and every complex root. The theorem result negates that
claim without hypotheses. The restriction removes the empty-split
zero polynomial; failure within this restriction refutes the source’s broader
positive-integer wording.
A transcription mismatch or a failed kernel check of result would invalidate
this encoded settlement. Neither product weights nor physical weights are
asserted to be counterexamples here.
Evidence
The canonical module is
D5/S3/Zeros/LeeYang/QuiverTreeIsingRefutation.lean and its Scribe is
Blueprint/D5/S3/Zeros/LeeYang/QuiverTreeIsingRefutation.scribe.cs.
The source note is
Library/StatisticalMechanics/fiolmartinezmontoyariosfukelman2020quiver.md.
The Scribe records exactly one OpenProblemResolutionClaim, Refuted, on
result. Its axiom closure is contained in
.
Experiment entry:
tree Lee–Yang checks at commit 811abbf954710a5a35374d89403c2ea7ce6913eb.
Command within that directory: python3 check.py; exit 0; final reading
bad= 0; script SHA-256
68dd6193c60e2ef4bbb8c77bbed37d4faa97ba109587b8c84d6a235e52509571.
The exact checks cover the symbolic octic, reciprocal reduction,
discriminant polynomial, the certificate identity for , and
. The interior check is exactly
, , including its octic and the negative discriminant
of the reciprocal quartic. Numerical octic root deviations are
at , , and at ,
. The product-weight computation samples 2,000 trials on this
same three-vertex path with and , and reports a
maximum deviation of . It does not test the physical
vertex-factor weight family or other tree sizes.
Triage
Tier 1, externally published named conjecture. Resolution: Refuted for
arbitrary positive joint weights by result. Every theorem in this module
has proof_shape: bind-only; the module asserts no escape witness.
What the settlement shows
- Mechanism, kernel-checked at . The private
path_polyidentifies the exact octic;q_discrandq_not_splitssupply the negative-discriminant obstruction,exists_nonreal_rootsupplies a nonreal root, andlift_rootlifts it off the unit circle. The publicresultrefutes the universal claim. - Single configurations, proved in prose. At , the state sum for a fixed split with masses is , by multiplying the three factors and comparing the eight spin contributions. All three exponents are positive, so each zero is a root of unity. Positive mixing across configurations with different masses fails to preserve this property. This factorization and root-of-unity statement are explanations proved here, not exported Lean theorems.
- Family, proved in prose. For every real , give the split weight . Exact expansion gives and , where . The identity shows for : put and use . For the first term is nonpositive. For , it is at most , whereas . Hence in both cases and the added term is nonpositive. Every real root of is therefore positive, but Vieta’s sum prevents all three roots from being real. The quadratic lifting argument above gives an off-circle root for every . This uniform family is proved in prose; Lean verifies only .
- Family identities and interior case, computed. The experiment entry verifies the symbolic identities and the exact interior case , . Its numerical deviations have precisely the scope recorded in Evidence. No uniform interval of interior parameters is claimed.
- Interior reciprocal identity, proved in prose. For the computed octic, for , where . Expansion gives its coefficients in descending order as , exactly those of . The computed negative discriminant of excludes four real roots: a real-root factorization would express the discriminant as a positive leading-coefficient power times squared root differences. A nonreal root therefore lifts by the same quadratic argument to an off-circle root at this interior parameter. This argument is not part of the Lean statement.
- Product-weight scope, computed. The experiment entry tests only on the three-vertex path, , in 2,000 random trials. Their small numerical deviations are evidence about those trials, not a proof of a product-weight Lee–Yang theorem.
- Joint-weight scope, source reading. The arbitrary-positive-function interpretation is the distribution sentence at source lines 343–345. Physical weights additionally use vertex factors depending jointly on incident splits (lines 198–203), so product weights do not subsume them.
- Product-weight version, open. Conjecture 1 for edgewise product weights on trees with two or more edges is not settled here.
- Physical-weight version, open. Conjecture 1 restricted to the physical binomial and vertex factors of (2.31) on trees with two or more edges is not settled here and has no numerical reading in the experiment entry.
- Consequences for the source, source reading. Its fixed-configuration result and its one-edge theorem remain outside the refutation. The physical planar-free-energy specialization requires its own restricted argument; the arbitrary-joint-weight conjecture cannot supply it. Conjecture 2 concerns a sum over trees and is not settled by this instance.
ASSUMED-UNVERIFIED
The preregistration’s search producer reports its forward-citation screen; worldwide priority is unverified. Kernel checking establishes the encoded statement and axiom boundary, while correspondence to the source requires the stated finite-type and parameter conventions. Product-weight and physical-weight generalizations remain open separately; the numerical product-weight trials do not prove either generalization.