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 have four-square representations with no zero coordinate
Example
The integers and have the four-square representations
and in each of them every coordinate is nonzero. That is not an accident of these two displays: no representation of either integer can have a vanishing coordinate, because deleting a zero coordinate would exhibit the integer as a sum of three squares, which Positive integers with are not sums of three integer squares forbids for and for . The two are the cases and of Positive integers with need four nonzero squares at .
Facts & Assumptions
Given: The integers and .
A representation of a nonnegative integer as a sum of four squares is an ordered quadruple with (Representations as sums of four squares).
For , means (Congruence modulo an integer: when , including the moduli and ).
For and a positive integer with , in every representation of as a sum of four integer squares all four coordinates are nonzero (Positive integers with need four nonzero squares).
Every nonnegative integer is a sum of four integer squares (Lagrange's four-square theorem: every nonnegative integer is a sum of four integer squares).
For and a positive integer with , there are no integers with (Positive integers with are not sums of three integer squares).
Verification
Both displays are representations in the sense of [F1], whose existence [L2] guarantees in advance: and ; and in each the four coordinates and are all nonzero.
The integer is positive and , so by [F2]; moreover and , so both integers have the form required by [L1] and [L3] with and or .
If a representation of or of had a vanishing coordinate, deleting it would leave three integers whose squares sum to or to respectively, and by step 1.2 this is what [L3] excludes; so no representation of either integer has a vanishing coordinate.
Hence and each have a four-square representation, displayed in step 1.1, and every such representation has all four coordinates nonzero, which is [L1] at and at .
Remarks
Why both and are shown. The obstruction is stated for , and its induction has a base case and a step. The witness exercises the base case and the first instance of the step, where the coordinates of a putative three-square representation are halved.
Depends on
- Positive integers $4^a m$ with $m\equiv 7\pmod 8$ need four nonzero squares
- Lagrange's four-square theorem: every nonnegative integer is a sum of four integer squares
- Positive integers $4^a m$ with $m\equiv 7\pmod 8$ are not sums of three integer squares
- Representations as sums of four squares
- 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
22 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)