REVIEW
Elimination of Ren\'e Peschmann's 968 Remaining Hard Fibers for the Perfect Cuboid Problem
Number Theory · Submitted 13 Sep 2026 · 11 references
Pith's verdict: Systematic elimination of 968 fibers in the perfect cuboid problem, but the p-adic height sieve tail bound is deferred to an unrefereed companion file and that is a genuine vulnerability.
T0 · AI review
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
The paper eliminates all 968 remaining master-tuple fibers, ruling out perfect cuboids on every admissible pair with m≤100.
The reading
What carries the argument
The central objects are the master-tuple reduction and a directly attached genus-five curve. Proposition 1 shows every primitive Euler brick, after naming its unique odd edge, comes from exactly one pair of coprime opposite-parity Euclid pairs $(a,b)$ and $(m,n)$, so that integrality of the three face diagonals and the space diagonal is equivalent to $M = (V_1 U)^2 + (U_1 V)^2$ and $F = (W_1 U)^2 + (U_1 V)^2$ being squares. A hypothetical perfect cuboid then yields the curve $C_{U,V,W}: y_U^2 = T^2 + U^2,\ y_V^2 = T^2 + V^2,\ y_W^2 = T^2 + W^2$, whose positive rational points are exactly the perfect specialisations and whose sixteen boundary points are all degenerate. Three engines drive the elimination: the Kummer parity lemma (Lemma 4), which converts doubling identities $P = 2Q$ on the elliptic quotients into correlated square-coordinate conditions; a uniform infinity-class argument passing through the fixed quotient $y^2 = x^3 - x$ over $\mathbb{Q}(i)$; and Proposition 5, the height/Kummer elimination principle, which imposes equation (9), a rank-one p-adic height equality with an exactly computed finite target set, and refines it to complete congruences mod $p^{20}$ on every disk using division-polynomial valuations and an all-order tail bound.
Extended reading notes
Core claim
On the paper's own terms the discovery is Theorem 2: for every $(m,n)$ in the complement $R_{968} = P_{100} \setminus S_{\mathrm{Pes}}$, where $P_{100}$ is the set of 2,040 coprime opposite-parity pairs with $2 \le m \le 100$, there is no positive master-tuple specialization $(a,b,m,n)$ that yields a perfect cuboid. With Peschmann's 1,072-fiber theorem this gives Corollary 3: no perfect cuboid occurs on any fiber $(m,n) \in P_{100}$. The proof is a cascade rather than a single method: 585 fibers fall to rank-zero elliptic quotients plus a uniform infinity-class computation on the CM curve $y^2 = x^3 - x$ over $\mathbb{Q}(i)$; 263 more fall to strengthened versions of the same ideas (trace curves, genus-two negative branches, bielliptic quadratic Chabauty, Gaussian and CRT covers); and the final 120 require exact higher 2-descent, torsion arithmetic, centrally bounded L-values, and a correlated p-adic height sieve on the genus-five curve $C_{U,V,W}$. Every step is recorded fiber by fiber, and the paper stresses that no bounded rational-point search serves as a completeness theorem.
Load-bearing premise
The load-bearing premise is that the companion package's scripts faithfully execute the described algorithms, the exact descents, Kummer and component images, L-value enclosures, and p-adic height sieves, and that the all-order tail bound, whose proof is deferred to a supplementary file in the package rather than the main text, really controls every omitted term on every chart; a silent failure on a single fiber would leave that fiber's exclusion unsupported.
Editorial extensions
If this is right
- Any perfect cuboid, if one exists, must have its master-tuple pair $(m,n)$ with $m \ge 101$, since every admissible fiber with $m \le 100$ is now excluded.
- Each fiber elimination is an infinite exclusion: for a fixed $(m,n)$, all infinitely many possible $(a,b)$ are ruled out at once, not merely a finite edge-height range.
- Completeness of the 968 eliminations does not rest on bounded rational-point searches; the rank statements come from exact descent or L-value enclosures, and the p-adic exclusions from exact component and Kummer images together with the all-order tail bound.
- Corollary 3 remains a bounded-fiber theorem rather than a proof of the perfect-cuboid conjecture, and the author states that reaching arbitrary $(m,n)$ requires genuinely new uniform arithmetic.
- Every elimination is auditable from the companion package's recorded inputs, scripts, valuation trees, and ledger, so the 2,040-fiber closure can be re-checked fiber by fiber.
Reading between the lines
- The correlated-halves idea is portable: any Diophantine curve with several elliptic quotients whose points must be doubles with correlated square-coordinates inherits this sieve, and the eight rank-one height/Kummer rows plus the six $C_{\pm}$ rows are a working template.
- Running the identical pipeline on $m \le 200$ or higher is a mechanical but expensive extension; a persistent obstruction pattern would strengthen the heuristic, still not a proof, that a uniform global obstruction to perfect cuboids exists.
- Because any perfect cuboid must now hide beyond $m = 100$, the conjecture is reframed as a question about the tail behaviour of this sieve as $m$ grows, which is a concrete place to hunt for the uniform, parameter-free argument the paper declines to claim.
- The acknowledgements disclose that most arguments beyond the 585-fiber core, and the companion package itself, were produced with AI assistance; a fully independent reimplementation of the descent and height sieves is accordingly the natural audit of the 968 eliminations.
Original abstract
Recently, Ren\'e Peschmann proved perfect-cuboid nonexistence on 1,072 explicit master-tuple fibers with $\max(m,n)\le100$, leaving 968 fibers in the same bounded parameter range. In this paper, I eliminate all 968 remaining fibers. Most fibers fall to fairly short rank-zero or covering arguments, while the final cases need the stronger local-global sieves. Together with Peschmann's theorem this excludes perfect cuboids on all 2,040 admissible fibers with $m\le100$; the result is still a bounded-fiber theorem rather than a proof of the full perfect-cuboid conjecture.
The compiled record
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
The abstract, sentence by sentence
Recently, Ren\'e Peschmann proved perfect-cuboid nonexistence on 1,072 explicit master-tuple fibers with $\max(m,n)\le100$, leaving 968 fibers in the same bounded parameter range. In this paper, I eliminate all 968 remaining fibers. Most fibers fall to fairly short rank-zero or covering arguments, while the final cases need the stronger local-global sieves. Together with Peschmann's theorem this excludes perfect cuboids on all 2,040 admissible fibers with $m\le100$; the result is still a bounded-fiber theorem rather than a proof of the full perfect-cuboid conjecture.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Recently, Ren\'e Peschmann proved perfect-cuboid nonexistence on 1,072 explicit master-tuple fibers with $\max(m,n)\le100$, leaving 968 fibers in the same bounded parameter range. | background 0.83 | 0.04 | 0.04 | asserted 1.00 |
| s1 | In this paper, I eliminate all 968 remaining fibers. | contribution 0.82 | 0.94 | 0.88 | asserted 1.00 |
| s2 | Most fibers fall to fairly short rank-zero or covering arguments, while the final cases need the stronger local-global sieves. | method 0.99 | 0.85 | 0.04 | asserted 0.99 |
| s3 | Together with Peschmann's theorem this excludes perfect cuboids on all 2,040 admissible fibers with $m\le100$; the result is still a bounded-fiber theorem rather than a proof of the full perfect-cuboid conjecture. | limitation 0.50 | 0.76 | 0.51 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
References
Discussion
Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.