REVIEW 2 major objections 4 minor 15 references
Fermat's polygonal number theorem for repeated generalized polygonal numbers
T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read The polygonal-number theorem is exact: m-4 summands suffice for m ≥ 10.
desk verdict Solid resolution of Guy's polygonal-number optimality question for all m except 7 and 9, with a fixable gap in the key lemma. 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 engine is a five-variable identity. On the hyperplane $x_1+\cdots+x_5=0$, the five-term sum collapses to $\sum_{j=1}^5 P_m(x_j)=(m-2)\sum_{1\le i\le j\le4}x_i x_j$; therefore every multiple of $m-2$ is a five-term generalized $m$-gonal sum whenever the quaternary form $\sum_{1\le i\le j\le4}x_i x_j$ is universal. The paper asserts that this quaternary form has class number one and represents every integer locally, so the local-global mass formula makes it universal. The proof then writes $n=(m-2)k_1+k_2$ with $k_2$ in a bounded interval and supplies explicit representations of the residue $k_2$ using a short list of small values of $P_m(x)$; finitely many remaining cases for small $m$ are checked directly. For the repeated-sum results the same five-variable lemma is combined with estimates on how many repeated copies are needed to absorb the residue terms.
What would settle it
Compute the class number of $Q(x)=\sum_{1\le i\le j\le4}x_i x_j$ and check whether $Q$ represents every integer from $1$ through $290$; if the class number is not one or any of those integers is missed, the asserted universality is false and the proof's engine fails. Separately, an exhaustive search for $m=10$ for any positive integer not representable as a sum of six generalized decagonal numbers would refute the $m\ge10$ clause of the theorem.
Extended reading notes
Core claim
The central discovery is Theorem 1.1, an exact sharpening of the polygonal-number theorem for generalized inputs. With $P_m(x)=\frac{(m-2)x^2-(m-4)x}{2}$ for $x\in\mathbb Z$, the paper proves that the least $\ell$ for which the equation $\sum_{j=1}^\ell P_m(x_j)=n$ is solvable for every $n\in\mathbb N$ is $\ell_m=m-4$ for $m\ge10$, $\ell_m=3$ for $m\in\{3,5,6\}$, and $\ell_m=4$ for $m\in\{4,8\}$; the cases $m=7$ and $m=9$ are the only ones left open. When $r-1$ single copies are followed by $r$ repeated copies of each summand, the paper proves the optimal total length for $7\le r<m-3$ is $\lceil(m-3)/r\rceil+(r-2)$; for $r=2$ and $m\ge14$ it is $\lfloor m/2\rfloor$; for $r=3$ it is $m-2$ for $m\not\equiv2\pmod3$ and $\frac{2m-4}{3}$ for $m\equiv2\pmod3$; and for $r=4,5,6$ it is $\lceil(m-2)/4\rceil+2$, $\lceil(m-3)/5\rceil+3$, and $\lceil(m-3)/6\rceil+4$ under the stated bounds $m\ge62,78,93$. The proof also yields a corollary on the largest integer that must be checked to decide universality of weighted $m$-gonal sums.
Load-bearing premise
The load-bearing premise is the unproved assertion that the auxiliary quaternary form $\sum_{1\le i\le j\le4}x_i x_j$ is universal (class number one plus local representability of every integer); if that assertion fails, the five-variable lemma and all upper bounds built on it collapse.
Editorial extensions
If this is right
- For $m\ge10$, every positive integer is a sum of at most $m-4$ generalized $m$-gonal numbers, and no smaller number of summands works, so the classical upper bound is improved to the exact threshold.
- For $7\le r<m-3$, the minimal length with $r-1$ single copies followed by $r$ repeated copies is $\lceil(m-3)/r\rceil+(r-2)$.
- For $r=2,\dots,6$, the exact values are $\lfloor m/2\rfloor$, $m-2$ or $\frac{2m-4}{3}$, and $\lceil(m-2)/4\rceil+2$, $\lceil(m-3)/5\rceil+3$, $\lceil(m-3)/6\rceil+4$, each valid under a stated lower bound on $m$.
- For $m\ge14$, the largest integer that must be tested to certify universality is at least $3m-12$ when $m\not\equiv2\pmod3$ and at least $2m-9$ when $m\equiv2\pmod3$.
Reading between the lines
- The stated lower bounds on $m$ in the small-$r$ cases (e.g. $m\ge14$ for $r=2$) are likely artifacts of the proof rather than true boundaries; finite computer searches in the omitted ranges could reveal whether the formulas extend.
- The method's apparent need for at least six unrepeated variables suggests that for a fixed repeat pattern the ceiling-plus-constant shape should persist for all sufficiently large $m$, with the constant determined by the finitely many residues that must be handled by hand.
- The $r=3$ obstruction comes from the congruence $P_m(2)\equiv P_m(-1)\pmod3$; analogous congruence coincidences for other $r$ should predict exactly where the optimal formulas gain additive constants.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies sums of generalized polygonal numbers P_m(x)=((m-2)x^2-(m-4)x)/2 with x in Z, allowing repetitions of summands with prescribed multiplicities. The main result, Theorem 1.1, gives the minimal number of generalized m-gonal numbers needed to represent every positive integer: for m not in {7,9}, this number is m-4 for m>=10, 3 for m in {3,5,6}, and 4 for m in {4,8}; it also gives sharp results for repeated sums for 7<=r<m-3, and for r=2,...,6 under suitable lower bounds on m. These results answer a question of Guy for all m except 7 and 9, which are explicitly left open. The upper bounds are obtained by reducing sums of five generalized m-gonal numbers to a fixed quaternary quadratic form Q via the identity in Lemma 2.2, then combining this with classical results (Siegel-Weil, Lagrange, Gauss, Legendre, Sun) and extensive finite case analysis. A corollary gives a lower bound for the universal-exceptional constant gamma_m.
Significance. If correct, the paper resolves Guy's question in the generalized setting for all m except 7 and 9 and provides the first optimal results for repeated generalized polygonal numbers. The proof strategy is natural: the hyperplane identity in Lemma 2.2 cleanly reduces a five-variable sum of generalized polygonal numbers to a universal quaternary form, and the remaining work is finite case analysis. The paper is clearly organized and relies on standard external results rather than on the authors' own prior work, so there is no circularity in the main argument. However, the manuscript currently leaves a load-bearing computational verification unperformed: Lemma 2.2 asserts without proof that Q has class number one and represents every integer locally, and the alternative appeal to the Bhargava-Hanke 290-theorem omits the required check. Consequently, the correctness of all upper bounds in the paper depends on an unverified auxiliary claim. No machine-checked proofs or reproducible code are provided.
major comments (2)
- [Section 2, Lemma 2.2] Lemma 2.2 is the engine for every upper bound in the paper: the hyperplane identity reduces sum_{j=1}^5 P_m(x_j) to (m-2)Q(x') for the fixed quaternary form Q(x')=sum_{1<=i<=j<=4} x'_i x'_j, and the lemma asserts that Q has class number one and represents every integer locally. Neither assertion is proved or supported by a reference; the alternative use of the Bhargava-Hanke 290-theorem is not accompanied by the required verification that Q represents every integer up to 290. Since the proof of Theorem 1.1(1) (Section 3.1), Proposition 3.3, and the proofs in Section 4 all use Lemma 2.2 to represent multiples of m-2 in five variables, the proof as written is incomplete. I ask the authors to provide either a proof of class number one and local representability for Q or an explicit 290-theorem verification (for example, a table of representations of 1,...,290), and to specify which version of the 290-theorem is being applied, because Q is integer-valued but its Gram matrix is not classically integral.
- [Section 4, proof of Theorem 1.1(3)] In the r=4,5,6 part of the proof, the sets S_r are defined and then asserted to be precisely the integers less than r(m-2) represented by sum_{j=1}^{r-1} P_m(x_j); this characterization underpins the decomposition n = s + r(m-2)k_1 + rk_2 used with Tables 4.3-4.5. No proof of this characterization is given. Similarly, Table 4.2 is said to follow from Guy's argument without exhibiting the argument for each entry, and the r=3 case ends with 'there remain finitely many choices of j for each k_3 in K_3 and we check these as in the r=2 case' without specifying the choices or presenting the check. Because these are finite verifications from the explicit list (3.1), they should be made explicit (or provided in an appendix or supplementary material) so that the proof can be certified.
minor comments (4)
- [Section 3.1, proof of Theorem 1.1(1)] The phrase 'this may be done by hand' for the finite cases 10<=m<k+9<=15 and 0<=k1<20 is not a proof; please supply the cases or a systematic table, since the accompanying remark only outlines the method.
- [Section 4, proof of Corollary 1.2] The proof of Corollary 1.2 is a sketch: 'one can see that every smaller integer is represented' is an assertion without demonstration. This corollary is not needed for Theorem 1.1, but if kept it needs a complete finite verification.
- [Lemma 3.1] The graph encoding of representations in Lemma 3.1 is very difficult to parse; a table of representations or a recursive algorithm would be much clearer and would make the proof easier to verify.
- [Proposition 3.4] In equation (3.5), the expression 'ell >= m-3/r + r-2' should be written with parentheses as 'ell >= (m-3)/r + r-2' and, since ell is an integer, the stronger statement 'ell >= ceil((m-3)/r) + r-2' should be used.
Circularity Check
No circularity: the main theorem is derived from external classical and 290-theorem/Siegel-Weil results; self-citations are contextual and not load-bearing.
full rationale
The derivation of Theorem 1.1 is not circular. The upper-bound engine is Lemma 2.2, which reduces representation of multiples of m-2 by five generalized m-gonal numbers to universality of the fixed quaternary form Q = sum_{1<=i<=j<=4} x_i x_j. The lemma invokes the external Siegel-Weil theorem together with the asserted facts that Q has class number one and represents every integer locally, with the 290-theorem of Bhargava and Hanke offered as an alternative finite verification. This is a statement about a fixed auxiliary form, not a quantity defined in terms of the target values l_m; whether or not the verification is fully exhibited, it is not equivalent by construction to the theorem's conclusion. Lower bounds come from Guy's elementary counting argument, and the small exceptional cases m=3,4,5,6,8 are handled by Gauss, Lagrange, Legendre, and Sun. The self-references [1], [10], and [11] appear only in remarks and contextual discussion, not as inputs to the main proof. No parameter is fitted to the claimed values and no target quantity is renamed as a prediction. The only genuine concern is that Lemma 2.2's class-number-one and local-representability assertions are stated without proof and the 290-theorem check is omitted; that is a verification gap or correctness risk, not circularity.
Assumptions & free parameters
assumptions (4)
- standard math Siegel-Weil mass formula and class-number-one universality (Theorem 2.1).
- domain assumption The quaternary form Sigma_{1<=i<=j<=4} xi xj has class number one and represents every integer locally.
- standard math Classical base cases: Gauss (triangular numbers), Lagrange (four squares), Legendre (pentagonal), Sun (octagonal, m=8).
- standard math Bhargava-Hanke 290-theorem.
Cite this review
Pith. "Pith review of Fermat's polygonal number theorem for repeated generalized polygonal numbers." pith.science (2026). https://pith.science/paper/LTZSXSMD
@misc{pith2026190802102,
author = {Pith},
title = {Pith review of: Fermat's polygonal number theorem for repeated generalized polygonal numbers},
year = {2026},
howpublished = {\url{https://pith.science/paper/LTZSXSMD}},
note = {Machine review of arXiv:1908.02102}
}
abstract
In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required to represent every positive integer and we furthermore generalize this result to obtain optimal bounds when many of the generalized $m$-gonal numbers are repeated $r$ times, where $r\in\mathbb{N}$ is fixed.
Reference graph
Works this paper leans on
-
[1]
M. Batavia, M. Kyranbay, S. Saha, H. C. So, and P. Varyani, Fermat’s polygonal number theorem with repeats, in preparation
-
[2]
Bhargava, On the Conway–Schneeberger Fifteen Theorem , Contemp
M. Bhargava, On the Conway–Schneeberger Fifteen Theorem , Contemp. Math. 272 (2000), 27–38
work page 2000
-
[3]
M. Bhargava and J. Hanke, Universal quadratic forms and the 290-theorem, Invent. Math., to appear
-
[4]
W. Bosma and B. Kane, The triangular theorem of eight and representations by quad ratic polynomials, Proc. Amer. Math. Soc. 141 (2013), 1473–1486
work page 2013
-
[5]
Cauchy, D´ emonstration du th´ eor` em g´ en´ eral de Fermat sur les nombres polygones, M´ em
A.-L. Cauchy, D´ emonstration du th´ eor` em g´ en´ eral de Fermat sur les nombres polygones, M´ em. Sci. Math. Phys. Inst. France 14 (1813–1815), 177–220; Oeuvres compl` etes VI (1905), 320–353. 16
work page 1905
-
[6]
J. H. Conway, Universal quadratic forms and the fifteen theorem , Contemp. Math. 272 (2000), 23–26
work page 2000
-
[7]
R. K. Guy, Every number is expressible as the sum of how many polygonal n umbers?, Amer. Math. Monthly 101 (1994), 169–172
work page 1994
-
[8]
Ju, Universal sums of generalized pentagonal numbers , Ramanujan J
J. Ju, Universal sums of generalized pentagonal numbers , Ramanujan J. 51 (2020), 479–494
work page 2020
Show all 15 references
-
[9]
Ju and B.-K
J. Ju and B.-K. Oh, Universal sums of generalized octagonal numbers , J. Number Theory 190 (2018), 292–302
2018
-
[10]
Kane and J
B. Kane and J. Liu, Universal sums of m-gonal numbers , Int. Math. Res. Not., to appear, DOI: https://doi.org/10.1093/imrn/rnz003
-
[11]
B. M. Kim and D. Park, A finiteness theorem for universal m-gonal forms , in preparation
-
[12]
Siegel, Indefinite quadratische Formen und Funktionentheorie, I , Math
C. Siegel, Indefinite quadratische Formen und Funktionentheorie, I , Math. Ann. 124 (1951), 17–54
1951
-
[13]
Siegel, Indefinite quadratische Formen und Funktionentheorie, II , Math
C. Siegel, Indefinite quadratische Formen und Funktionentheorie, II , Math. Ann. 124 (1951), 364–387
1951
-
[14]
Sun, A result similar to Lagrange’s Theorem , J
Z.-W. Sun, A result similar to Lagrange’s Theorem , J. Number Theory 162 (2016), 190–211
2016
-
[15]
Weil, Sur la formule de Siegel dans la th´ eorie des groupes classiq ues, Acta
A. Weil, Sur la formule de Siegel dans la th´ eorie des groupes classiq ues, Acta. Math. 113 (1965), 1–87. Department of Mathematics, University of Hong Kong, Pokful am, Hong Kong E-mail address : soumya.tatan@gmail.com Department of Mathematics, Indian Institute of Technology...
1965
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.