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.
Representations and primitive representations as sums of two squares
Definition
A representation of a nonnegative integer as a sum of two squares is an ordered pair such that .
It is primitive when (Common divisor, and the greatest common divisor , with the convention ). Two representations are equivalent up to signs and order when one is obtained from the other by independently changing coordinate signs and possibly interchanging the coordinates, and essentially different when they are not so equivalent.
For a positive odd integer, a representation is normalized when and are positive, is odd, and is even.
Remarks
The ordered-pair convention retains signs and order when a correspondence is being counted. Equivalence up to signs and order is invoked only when those symmetries are deliberately discarded.
Depends on
Used by
- Sums of two squares are closed under products Corollary
- 539=7²·11 is not a sum of two squares Counterexample
- 68=8²+2² is representable but has no primitive two-square representation Counterexample
- Extended Euclid gives 73=3²+8² from the root 27 of -1 Example
- Prime factorisation gives two representations of 221 as a sum of two squares Example
- Squarefree sums of two squares up to 30 Example
- The primitive two-square criterion distinguishes 289, 34, and 833 Example
- The representations 221=5²+14²=11²+10² recover the factors 13 and 17 Example
- Thue's collision argument gives 73=3²+8² Example
- A prime congruent to 3 modulo 4 divides both coordinates of a divisible two-square sum Lemma
- Coprime primitively represented factors have a primitive product representation Lemma
- Powers of primes congruent to 1 modulo 4 have primitive two-square representations Lemma
- Prime powers represented as sums of two squares Lemma
- Representations of an odd integer correspond to representations of twice that integer Proposition
- A prime congruent to 1 modulo 4 has one two-square representation up to signs and order Theorem
- Characterisation of positive integers that are sums of two squares Theorem
- Characterisation of primitive sums of two squares Theorem
- Fermat's two-square theorem for primes Theorem
Dependency tree · two levels
7 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
- P. Hackman, Elementary Number Theory, Chapter E (standard reference, not scraped)
- W. Stein, Elementary Number Theory: Primes, Congruences, and Secrets, §5.7 (standard reference, not scraped)