Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Why the descent fixes one sign pattern in the four-square identity

The four bilinear forms in Euler's four-square product identity are not the only ones that turn a product of two sums of four squares into a sum of four squares. Euler also recorded the variant with the same first coordinate and

z2=x1y2x2y1+x3y4x4y3,z3=x1y3x2y4x3y1+x4y2,z4=x1y4+x2y3x3y2x4y1,

which is the form Dummit's Lemma 1 displays, and the norm of a product of quaternions gives a third,

z1=x1y1x2y2x3y3x4y4,z2=x1y2+x2y1+x3y4x4y3,z3=x1y3x2y4+x3y1+x4y2,z4=x1y4+x2y3x3y2+x4y1,

which is the route MIT's Lecture 22 takes. All three are polynomial identities in the eight variables, so any of them proves that a product of two sums of four squares is again one.

The descent asks more of the identity than that. In Descent step: a smaller multiple of p is a sum of four squares the second quadruple is congruent to the first coordinatewise modulo m, and what the proof needs is that all four output coordinates then become divisible by m. Substituting y1x1, y2x2, y3x3, y4x4 modulo m and writing (a,b,c,d) for (x1,x2,x3,x4), the pattern fixed in Euler's four-square product identity gives

z1a2+b2+c2+d2,z2abbacd+dc=0,z3ac+bdcadb=0,z4adbc+cbda=0(modm),

and the first of these is the multiple pm, hence also 0 modulo m. Euler's second pattern behaves the same way: its last three coordinates become abba+cddc, acbdca+db and ad+bccbda, all identically 0. The quaternion pattern does not: under the same substitution its coordinates become a2b2c2d2, 2ab, 2ac and 2ad, and the hypotheses of Descent step: a smaller multiple of p is a sum of four squares — that m divides a2+b2+c2+d2 and that the second quadruple is the centred residue quadruple of the first — do not force z1, z2, z3 or z4 to vanish modulo m.

So the choice of signs is load-bearing for the divisibility step written here, and it is displayed rather than summarised for that reason. This says nothing about whether some other argument can descend with the quaternion pattern; a proof organised around quaternion divisibility rather than around congruences between bilinear forms is a different argument with a different bookkeeping, and nothing above bears on it.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources