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.
Divisors greater than one of primitively represented integers are primitively represented
Statement
If a positive integer has a primitive two-square representation and divides , then has a primitive two-square representation.
Facts & Assumptions
Given: A primitively represented positive integer and a divisor of .
A positive integer has a primitive two-square representation if and only if and no prime divides (Characterisation of primitive sums of two squares).
For a prime and a nonzero integer , if and only if (For a prime and a nonzero integer : and ; holds exactly for ; exactly when ; ; and ).
Proof
Since , the divisibility criterion in [L2] gives for every prime . Thus , and no three-mod-four prime can divide , because none divides by [L1].
The two inherited conditions in step 1.1 satisfy [L1], so has a primitive two-square representation.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
31 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, Corollary E.II.8(b) (standard reference, not scraped)