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.
Prime norm numerators congruent to one modulo eight are solvable
Statement
Let be positive at both real embeddings. If with and a rational prime , then has a solution in . The complete finite-time norm solver returns a solution on every such input. The same conclusion holds when . No runtime bound is implied.
Facts & Assumptions
Given: as above; , , and .
Constructive decision of the dyadic cyclotomic norm equation: after clearing a rational square denominator, solvability is equivalent to even exponents at all conjugation-fixed prime classes. Its proof gives prime, , and .
Constructive cyclotomic factorization and real unit squares supplies unique factorization, effective associates and real unit correction.
First supplement: implies that is a square modulo every prime congruent to one modulo four.
Proof
Choose large enough that and . Then . Any prime of dividing divides the rational integer , hence divides or by the prime-divisor property. The only prime class over is that of , by [F1].
No prime dividing has a conjugation-fixed associate class. Indeed, choose an integer with by [F3], so . Thus divides at least one of . If its conjugate were associate to itself, conjugating this divisibility would make it divide both factors, and hence . Since is a unit, implies . As is odd, with . Thus , a contradiction. The required can also be found by the finite search .
Every nonzero element of has even -valuation in . To prove this, direct multiplication gives , so and . An odd integer is not divisible by : since and , divisibility of by the prime would imply . Hence, for each nonzero integer , writing with odd gives . For nonzero integers , the summands of therefore have valuations and . Their residues modulo are distinct, so the valuation of their sum is their minimum: after factoring out the lower power, the remaining lower-valuation term is nonzero modulo , whereas the other is zero. This minimum is even. When a coefficient is zero, the valuation of the remaining summand is even as well. Apply this to to conclude that its -exponent is even.
By steps 1.1 and 1.2, the only possible conjugation-fixed prime class in is , and step 1.3 proves its exponent is even. The criterion of [F1] therefore constructs a solution, and its complete terminating solver returns one.
If the norm numerator is , clear the denominator as in step 1.1; then . Every prime divisor of therefore lies in the sole class . Its exponent is even by step 1.3, so [F1] again constructs and returns a solution. This includes , where a positive real unit is corrected by the same unit-square step.
Depends on
Used by
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
- Ross and Selinger, Optimal ancilla-free Clifford+T approximation of z-rotations, Proposition C.26 (standard reference, not scraped)