A Constructive Proof of Jacobi's Identity for the Sum of Two Squares
Pith reviewed 2026-05-24 21:42 UTC · model grok-4.3
The pith
A combinatorial algorithm uses partitions and matchings to turn a factorization of n into a pair of integers whose squares sum to n.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper claims that the algorithm, defined via integer partitions and matchings on an infinite graph, processes any valid input factorization and auxiliary data and terminates by returning a pair of integers whose squares sum to n, thereby supplying a constructive proof of Jacobi's identity for the sum of two squares.
What carries the argument
The algorithm that iteratively transforms factorizations of n using partition data and graph matchings until it outputs either a revised factorization or the explicit pair of squares.
If this is right
- The algorithm yields an explicit pair a and b satisfying a squared plus b squared equals n from the initial factorization.
- Repeated application of the transformation step eventually reaches the output pair whenever a representation exists.
- The method supplies a constructive rather than merely existential proof of the two-square identity.
- The procedure remains valid for every n admitting a representation under the stated input conditions.
Where Pith is reading between the lines
- The partition-and-matching formulation might be adapted to obtain constructive versions of other classical sum-of-squares identities.
- An implementation of the algorithm could be run on sample factorizations to observe the typical number of steps required.
- The infinite graph appearing in the proof may carry additional combinatorial structure that is not used in the present argument.
Load-bearing premise
The merged combinatorial proofs produce a terminating algorithm that always returns a correct representation when one exists.
What would settle it
An integer n that can be written as a sum of two squares but for which the algorithm either fails to terminate or returns a pair whose squares do not add to n.
read the original abstract
We present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization $n=dN$ with $d \equiv1\mod 4$ plus two bits of data, and whose output is either another factorization $n=d'N'$ and $d' \equiv3\mod 4$ with two more bits of data, or a pair of integers whose squares sum to $n$. We phrase this algorithm in terms of integer partitions and matchings on an infinite graph.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims to give a constructive proof of Jacobi's identity for the sum of two squares by combining a combinatorial proof of the Jacobi triple-product identity with Hirschhorn's argument. The resulting algorithm takes a factorization n = dN with d ≡ 1 mod 4 together with two bits of auxiliary data and, via successive matchings on an infinite graph and updates to integer partitions, outputs either a new factorization n = d'N' with d' ≡ 3 mod 4 (plus two more bits) or an explicit pair of integers whose squares sum to n.
Significance. A fully rigorous constructive algorithm would be of interest because it supplies an explicit, combinatorial procedure for producing the representation whenever one exists, rather than a non-constructive existence argument. The use of matchings on an infinite graph and partition updates offers a potentially new perspective linking the triple-product identity to the arithmetic of sums of two squares.
major comments (2)
- [algorithm description (partitions and matchings on infinite graph)] The manuscript provides no explicit termination argument for the matching process on the infinite graph. The central claim (that the procedure always halts with either a sum-of-squares representation or a factorization with d' ≡ 3 mod 4) therefore rests on an unproven assertion that every sequence of distinct factorizations is finite; this is load-bearing because the output guarantee is stated only conditionally on termination.
- [algorithm description] It is not shown how the two bits of auxiliary data are updated at each step or why the update rule preserves the invariant that the current factorization satisfies the input condition. Without an explicit invariant and update rule, it is impossible to verify that the algorithm is well-defined for arbitrary starting factorizations.
minor comments (2)
- The abstract and introduction should state the precise statement of Jacobi's identity being proved (the four-divisor formula or the representation theorem) rather than referring to it only by name.
- Notation for the auxiliary bits of data and for the graph vertices/edges should be introduced once and used consistently; currently the description mixes partition language with graph-matching language without a clear dictionary.
Simulated Author's Rebuttal
We thank the referee for their careful reading of the manuscript and for identifying the points where additional rigor is required. We address each major comment below and will incorporate the necessary clarifications in a revised version.
read point-by-point responses
-
Referee: The manuscript provides no explicit termination argument for the matching process on the infinite graph. The central claim (that the procedure always halts with either a sum-of-squares representation or a factorization with d' ≡ 3 mod 4) therefore rests on an unproven assertion that every sequence of distinct factorizations is finite; this is load-bearing because the output guarantee is stated only conditionally on termination.
Authors: We agree that an explicit termination argument is missing from the current draft. In the revision we will add a dedicated subsection proving that the matching process on the infinite graph terminates. The argument will show that each successful matching step strictly decreases a well-defined potential function (the sum of the parts in the associated partitions together with the 4-adic valuation of the current d), which is bounded below by zero and takes values in the non-negative integers; consequently no infinite sequence of distinct factorizations can occur. revision: yes
-
Referee: It is not shown how the two bits of auxiliary data are updated at each step or why the update rule preserves the invariant that the current factorization satisfies the input condition. Without an explicit invariant and update rule, it is impossible to verify that the algorithm is well-defined for arbitrary starting factorizations.
Authors: We concur that the update rules for the auxiliary bits and the preservation of the input invariant are not stated with sufficient explicitness. The revised manuscript will contain a precise description of the two-bit update map together with a short inductive argument verifying that, after each matching step, the new factorization again satisfies d' ≡ 1 mod 4 (or the process has already terminated with a sum-of-squares representation). The argument relies only on the combinatorial correspondence already established between the matchings and the Jacobi triple-product identity. revision: yes
Circularity Check
No significant circularity; derivation combines external proofs
full rationale
The paper states it presents its own combinatorial proof of the Jacobi Triple Product identity and combines that with Hirschhorn's proof to define an algorithm operating on factorizations and matchings. No quoted step reduces the output guarantee to a self-definition, a fitted parameter renamed as prediction, or a load-bearing self-citation chain. The central construction is explicitly built from two cited external results, so the derivation remains independent of its own target claim. Any concern about termination on the infinite graph is a question of proof completeness, not circularity in the derivation.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Jacobi triple product identity holds
- domain assumption Hirschhorn's proof supplies the required transformation rules
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.