REVIEW 2 major objections 4 minor 15 references
Machine-Guided Recurrence Boundary Theory for Nahm Sums
T0 review · 2 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read The paper proves Shi and Wang's Conjecture 3.8: the two Nahm sums dual to Zagier's twelfth rank-three example are explicit generalized-eta quotients, hence modular, and every member of the affine family is an explicit…
desk verdict A genuinely new proof machine for Nahm-sum modularity, applied to resolve Shi–Wang's Conjecture 3.8; the main written proof has a fixable but real reproducibility gap in the valence-certificate formula. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the recurrence-boundary triple. First, the universal coordinate-contiguous relation (14) defines exact cells, identities among Nahm sums with shifted parameter vectors; any finite Laurent-polynomial combination of cells that cancels in the free module yields a genuine identity, so a certificate is sound by Proposition 3.2. Second, the tropical face-limit theorem (Theorem 3.3) describes what happens along a ray $\beta + h\delta$: a linear-complementarity solution $v$ partitions the summation variables into bilateral, unilateral, and face-forced coordinates, reducing a higher-rank Nahm sum to a lower-rank $\theta$ or $\theta$-hypergeometric boundary value. Third, the recurrence-boundary determination principle (Theorem 3.6) recovers the initial sums of a family from an order-$s$ recurrence together with $s$ independent boundary limits. In the application these appear as the five-cell certificate (21), the two complementarity rays of Sections 6 and 7, the $2\times2$ boundary system (43), and the valence criterion with cusp-order formula (49) and bound (50).
What would settle it
Independently recompute all cusp orders and the bounds $B^*$ from the stored generalized-eta exponent tables, then expand the raw integer forms of the two product-side boundary equations through $q^{2005}$ for the $\Gamma_1(300)$ identity and through $q^{255}$ for the $\Gamma_1(100)$ identity; any nonzero coefficient at a degree below the respective bound, or any discrepancy in a single cusp order, would show that the proof of Proposition 8.3 and hence of Theorem 1.1 fails.
Extended reading notes
Core claim
Theorem 1.1 asserts that the two Nahm sums $F_0$ and $F_1$ defined in (5) equal the three-term generalized-eta quotients displayed in (6) and (7), where each summand is, up to a power of $q$, a quotient of products $(q^a;q^m)_\infty$. The argument introduces the affine family $F_t$ with parameter $t$, proves the recurrence $q^{-t}F_t = q^{2t+1}F_{t+1} + F_{t+2}$ through a five-cell exact certificate built from a universal coordinate-contiguous relation, and computes two independent boundary values along tropical rays: a binary $\theta$ series $\Theta_-$ and a unary $\theta$ series $\vartheta$. The boundary matrix has unit determinant, so the two initial sums are uniquely determined; substituting the conjectured product forms reduces the theorem to two generalized-eta identities, which are proved exactly by valence certificates. The paper thereby resolves Shi and Wang's Conjecture 3.8 and, as Corollary 1.2, establishes modularity of the dual and the explicit structure of the whole affine family.
Load-bearing premise
The proof's final step assumes that every cusp order in the two valence certificates—all 560 inequivalent cusps of $\Gamma_1(300)$ and all 140 of $\Gamma_1(100)$—is computed correctly by formula (49), and that the bound $B^*$ of (50) is applied to every non-infinity cusp; a single miscomputed cusp order could allow a nonvanishing $q$-expansion to be mistaken for zero.
Editorial extensions
If this is right
- The Nahm sum dual to Zagier's twelfth rank-three example is modular, not just conjecturally, because $F_0$ and $F_1$ are finite combinations of generalized-eta quotients on congruence subgroups.
- Every member $F_t$ of the affine family lies in $\mathbb{Z}[q,q^{-1}]F_0 + \mathbb{Z}[q,q^{-1}]F_1$; for instance $F_2 = F_0 - qF_1$, so each $F_t$ is an explicit finite combination of the two base products.
- The recurrence-boundary pipeline gives a six-step program for other affine Nahm families: find a recurrence, prove it by cells, find independent asymptotic rays, evaluate boundary limits, solve a finite linear system, and certify the remaining identities by valence bounds.
- The remaining open Shi and Wang targets are natural next applications of the same machinery, though the paper does not claim to prove them and explicitly notes that the required certificates for those targets are not supplied.
Reading between the lines
- I infer that the practical bottleneck for Nahm duality is not recognizing a candidate product but locating a low-order recurrence and enough independent tropical rays; if so, the same search protocol should apply to the remaining Shi-Wang targets and to any affine Nahm family with a small recurrence module.
- The proof suggests a stronger structural statement than a single product identity: the whole affine family is governed by two boundary theta series, so modularity of the family is equivalent to invertibility of the boundary matrix rather than to any one closed form.
- A testable extension is to run the same complementarity-guided search on the dual of Example 9, where only a fourth identity is missing; the expected object would be a finite recurrence module over several residue classes, to which the cell-certificate soundness applies verbatim.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a proof-carrying recurrence--boundary method for affine families of positive-definite Nahm sums. The general framework consists of a universal coordinate-contiguous relation for exact algebraic cells (Theorem 3.1), a tropical face-limit theorem for parameter rays satisfying a linear complementarity condition (Theorem 3.3), a recurrence--boundary determination principle (Theorem 3.6), and a finite modular certification criterion via generalized-eta valence bounds (Corollary 3.7). The main application proves Shi--Wang's Conjecture 3.8 for the Nahm sums dual to Zagier's twelfth rank-three example. An evolutionary search proposes a second-order recurrence q^{-t}F_t=q^{2t+1}F_{t+1}+F_{t+2}; a Q-learning agent finds a five-cell exact certificate; two tropical rays produce a binary and a unary theta boundary value; solving the resulting 2x2 system reduces the conjecture to two generalized-eta identities, which are certified by valence arguments on Gamma_1(300) and Gamma_1(100). The paper concludes that the dual Nahm sums are modular and that every member of the affine family lies in Z[q,q^{-1}]F_0+Z[q,q^{-1}]F_1.
Significance. If the proof is sound, this resolves a remaining open conjecture in Nahm-sum modularity and gives modularity of the full affine family, not only of the two named sums. The paper is also methodologically valuable: machine learning and reinforcement learning are used only for discovery, while every accepted statement is reduced to an exact finite certificate, a displayed algebraic identity, or a finite valence computation. The proof structure is unusually transparent, and the released artifacts include independently written checkers and regenerable tables. The general theorems, especially the tropical face-limit theorem and the recurrence--boundary determination principle, are likely to be reusable beyond this example. The paper's weakest point is the printed cusp-order formula (49), which currently cannot be applied as written; this affects the two valence certificates on which Proposition 8.3 rests.
major comments (2)
- [§9.1, Eq. (49)] The invariant-order formula in (49) is not a well-defined formula as printed: the symbol B(N,r;a,c) contains the expression n ar/gcd(N,c) inside a fractional part, and the symbol n has not been defined anywhere in the manuscript. Since Proposition 8.3 is proved solely by the two valence certificates, and every cusp-order row in those certificates is asserted to be computed from (49), the published proof cannot be reproduced from the manuscript as written. Please correct the formula (almost certainly to a r/gcd(N,c)), state explicitly how reduced cusp representatives a/c are chosen and enumerated for Gamma_1(N), and have the 560+140 cusp-order rows recomputed independently from the corrected formula. The SHA-256 hashes in Remark 9.1 show only that the regeneration code reproduces the shipped tables; they do not certify the mathematical correctness of (49) as printed or of the enumeration.
- [§9.1, Eq. (50)] The valence bound B* is asserted rather than proved. To justify the contrapositive statement that vanishing beyond B* forces f identically zero, one needs the explicit lower bound ord_a f >= min(0, ord_a f_2, ..., ord_a f_s) at every non-infinity cusp a, and hence the inequality sum_{a != infinity} ord_a f >= -B*. This is standard but should be stated and proved, especially because the normalized summands f_i may have zeros, poles, or cancellations at some cusps. The manuscript should also describe the algorithm by which the 560 and 140 inequivalent cusps were enumerated and how the representative a/c was reduced, so that the bound B* can be independently recomputed.
minor comments (4)
- [§9.1] The notation f = 1 - sum_{i>=2} f_i is introduced informally; please define the normalized summands f_i explicitly before (50), including which term of each product identity is chosen as the base term.
- [§9.2--9.3] The certificate tables are said to contain all 560+140 cusp-order rows, but the manuscript itself shows only hashes and counts. A human-readable summary of the cusp enumeration, or a supplementary appendix listing the representative cusps and their orders, would substantially help an independent referee audit the certificates.
- [§1.4, Theorem 1.1] The displayed product formulas (6)--(7) are dense and hard to check visually; a table with each quotient written in terms of J_{r,50} and J_{50} exponents would improve readability.
- [§6 and §7] The two tropical-ray computations are concise but correct; in the revision, consider adding one sentence in each proof explaining which set I, J, K of Theorem 3.3 is being used, since the reader must reconstruct it from the displayed complementarity data.
Circularity Check
No significant circularity: the recurrence-boundary proof is self-contained, with machine search separated from exact certificates.
full rationale
The derivation chain for Theorem 1.1 is self-contained and not circular. The target is reduced to: (a) the five-cell recurrence certificate (Theorem 4.1), which is an exact free-module cancellation using cells from the universal contiguous relation (Theorem 3.1); (b) two tropical boundary limits (Propositions 6.1 and 7.1), proved as direct instances of Theorem 3.3, whose proof uses only coefficientwise convergence, properness of the quadratic form, and the stabilization lemma; (c) the 2x2 boundary system (43) with a unit-determinant matrix (Lemma 8.1); and (d) two valence certificates in Section 9, which independently verify that the proposed product sides P0, P1 satisfy the same boundary equations. Uniqueness of the solution then forces F0 = P0 and F1 = P1. No step defines an output in terms of the target identity, and no learned output is accepted as proof: the recurrence and asymptotic rays are first discovered by exact searches and then proved by displayed symbolic certificates. The product-side verification is a genuine independent check, not a restatement of the conjecture, because P0 and P1 are substituted into separately derived equations and certified by the external Robins-Frye-Garvan valence method and exact cusp arithmetic. The paper does not rely on a self-citation chain or on a uniqueness theorem imported from the authors' prior work. One written-proof gap is that formula (49) contains an undefined symbol n in the cusp-order expression, which affects reproducibility and correctness of the certificates but is not a circularity; the underlying certificates could still be correct, and this issue does not change the circularity score.
Assumptions & free parameters
assumptions (3)
- standard math Standard q-series identities: Rogers-Ramanujan, Slater, Euler, and Jacobi triple product identities.
- standard math Valence formula and cusp-order formula for generalized eta products on Gamma1(N).
- standard math Positive definiteness of A, properness of the quadratic form, and the stabilization Lemma 2.2.
Cite this review
Pith. "Pith review of Machine-Guided Recurrence Boundary Theory for Nahm Sums." pith.science (2026). https://pith.science/paper/XAUDIH3V
@misc{pith2026260808347,
author = {Pith},
title = {Pith review of: Machine-Guided Recurrence Boundary Theory for Nahm Sums},
year = {2026},
howpublished = {\url{https://pith.science/paper/XAUDIH3V}},
note = {Machine review of arXiv:2608.08347}
}
abstract
We develop a proof-carrying recurrence--boundary method for affine families of positive-definite Nahm sums. A universal coordinate-contiguous relation provides exact algebraic cells for finite certificates; a tropical face-limit theorem identifies parameter directions along which a higher-rank Nahm sum degenerates to a lower-rank theta or theta--hypergeometric boundary value; and a recurrence--boundary principle recovers the initial sums from sufficiently many independent boundary limits. Machine learning and reinforcement learning are used only for discovery. Evolutionary symbolic search proposes recurrences and asymptotic rays from exact algebraic data, while a $Q$-learning agent searches for short sequences of legal contiguous-cell identities. No learned output is accepted as proof: every successful candidate is replaced by an exact symbolic certificate. As the main application, we prove Shi and Wang's Conjecture~3.8 (arXiv:2607.23257) for the Nahm sums dual to Zagier's twelfth rank-three example. The search finds a second-order recurrence for a one-parameter family and a five-cell certificate for it, together with two asymptotic rays leading to binary and unary theta series. These give two linear equations for the two initial sums. Solving the resulting $2\times2$ system reduces the conjecture to two generalized-eta identities, certified by valence arguments on $\Gamma_1(300)$ and $\Gamma_1(100)$. Consequently the dual of Zagier's twelfth example is modular, and every member of the affine family is an explicit $\mathbb{Z}[q,q^{-1}]$-combination of the two base products. Complete verification artifacts accompany the paper.
Reference graph
Works this paper leans on
-
[1]
G. E. Andrews,The Theory of Partitions, Cambridge University Press, Cambridge, 1998
1998
-
[2]
B. C. Berndt, G. Choi, Y.-S. Choi, H. Hahn, B. P. Yeap, A. J. Yee, H. Yesilyurt, and J. Yi,Ramanujan ’s forty identities for the Rogers–Ramanujan functions, Mem. Amer. Math. Soc.188(2007), no. 880
work page 2007
-
[3]
F. Calegari, S. Garoufalidis, and D. Zagier,Bloch groups, algebraic K-theory, units, and Nahm’s conjecture, Ann. Sci. ´Ec. Norm. Sup´ er. (4)56(2023), 383–426
work page 2023
-
[4]
Automatic Proof of Theta-Function Identities
J. Frye and F. Garvan,Automatic proof of theta-function identities, in: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory, Texts Monogr. Symbol. Comput., Springer, Cham, 2019, pp. 195–258. Also arXiv:1807.08051
work page Pith review arXiv 2019
-
[5]
G. Gasper and M. Rahman,Basic Hypergeometric Series, 2nd ed., Encyclopedia of Mathematics and its Applications 96, Cambridge University Press, Cambridge, 2004
work page 2004
-
[6]
W. Nahm,Conformal field theory and torsion elements of the Bloch group, in: Frontiers in Number Theory, Physics, and Geometry II, Springer, Berlin, 2007, pp. 67–132
work page 2007
-
[7]
Riese,qMultiSum—a package for proving q-hypergeometric multiple summation identities, J
A. Riese,qMultiSum—a package for proving q-hypergeometric multiple summation identities, J. Symbolic Comput.35(2003), 349–376
work page 2003
-
[8]
Robins,Generalized Dedekind η-products, in: The Rademacher Legacy to Mathematics, Contemp
S. Robins,Generalized Dedekind η-products, in: The Rademacher Legacy to Mathematics, Contemp. Math. 166, Amer. Math. Soc., Providence, RI, 1994, pp. 119–128
work page 1994
Show all 15 references
-
[9]
Shi and L
C. Shi and L. Wang,Modularity of Nahm sums dual to Zagier’s rank-three examples, arXiv:2607.23257, 2026
2026 arXiv
-
[10]
L. J. Slater,Further identities of the Rogers–Ramanujan type, Proc. London Math. Soc. (2)54(1952), 147–167
1952
-
[11]
R. S. Sutton and A. G. Barto,Reinforcement Learning: An Introduction, 2nd ed., MIT Press, Cambridge, MA, 2018
2018
-
[12]
Vlasenko and S
M. Vlasenko and S. Zwegers,Nahm’s conjecture: asymptotic computations and counterexamples, Commun. Number Theory Phys.5(2011), 617–642
2011
-
[13]
Wang,Identities on Zagier’s rank two examples for Nahm’s problem, Res
L. Wang,Identities on Zagier’s rank two examples for Nahm’s problem, Res. Math. Sci.11(2024), no. 3, Paper No. 49
2024
-
[14]
Wang,Explicit forms and proofs of Zagier’s rank three examples for Nahm’s problem, Adv
L. Wang,Explicit forms and proofs of Zagier’s rank three examples for Nahm’s problem, Adv. Math.450 (2024), Paper No. 109743
2024
-
[15]
Zagier,The dilogarithm function, in: Frontiers in Number Theory, Physics, and Geometry II, Springer, Berlin, 2007, pp
D. Zagier,The dilogarithm function, in: Frontiers in Number Theory, Physics, and Geometry II, Springer, Berlin, 2007, pp. 3–65. 22 ANKUSH GOSW AMI School of Mathematical and Statistical Sciences, University of Texas Rio Grande V alley, Edinburg, TX 78541, USA Email address:ank...
2007
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.