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.
and are not sums of three integer squares
Statement refuted
False claim: every nonnegative integer is a sum of three integer squares, that is, for every there are integers with .
The integers and refute it. Both are excluded by Positive integers with are not sums of three integer squares, as and with ; and for the exclusion can also be seen by a finite search, which is carried out below so that the witness does not rest on the obstruction alone.
Facts & Assumptions
Given: The integers and .
The false claim: for every integer there are integers with .
For , means (Congruence modulo an integer: when , including the moduli and ).
For and a positive integer with , there are no integers with (Positive integers with are not sums of three integer squares).
There are no integers with (No sum of three integer squares is congruent to modulo ).
If and , then , and are all even (If divides then , and are all even).
Counterexample
Since , we have by [F1], so a representation would give , which [L2] excludes; hence is not a sum of three integer squares.
The same conclusion by finite search: in each square is at most , so each lies in , and the sums of three members of that set are and , none of which is .
For : since we have , so a representation would by [L3] have , and all even, say , , ; then gives , contradicting step 1.1.
So neither nor is a sum of three integer squares, and [A1] is false; the two are the instances and of [L1] at .
Remarks
Two independent routes for . Step 1.1 argues by residues modulo and step 1.2 by exhausting the finitely many candidates. The second uses no lemma about squares at all, so the non-existence claim does not depend on the congruence argument being right.
Why needs the halving step. The residue of modulo is , which is attainable by a sum of three squares, so the congruence argument does not apply to directly. It is the divisibility by , and the fact that this forces all three coordinates even, that reduces to .
Depends on
- Positive integers $4^a m$ with $m\equiv 7\pmod 8$ are not sums of three integer squares
- No sum of three integer squares is congruent to $7$ modulo $8$
- If $4$ divides $x^2+y^2+z^2$ then $x$, $y$ and $z$ are all even
- Congruence modulo an integer: $a\equiv b\pmod n$ when $n\mid(a-b)$, including the moduli $0$ and $1$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- Evan Dummit, Number Theory (part 9): The Geometry of Numbers, §9.1.3 (standard reference, not scraped)