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.
Constructive decision of the dyadic cyclotomic norm equation
Statement
For every there is a terminating exact algorithm deciding whether has a solution , and returning such a solution when one exists. A supplied prime factorization of the numerator of is permissible but unnecessary for the finite-search version below. No polynomial runtime bound is asserted.
More explicitly, reject a negative real embedding; handle by . Otherwise choose with and factor into primes of . Group the prime associate classes into orbits of complex conjugation. There is a solution exactly when every conjugation-fixed class has even exponent. The conjugation-paired classes have equal exponents automatically. Allocate half of each fixed exponent, and the whole exponent to one representative of each pair, to form . Recover a real unit with ; then is an exact solution.
Facts & Assumptions
Given: The automorphisms and commute, and the two real embeddings are the identity and on .
Constructive cyclotomic factorization and real unit squares proves unique factorization and a terminating factor algorithm in , identifies , and gives effective square roots of real units positive at both embeddings.
Proof
For any , both and are nonnegative. If either real embedding of is negative, reject. The signs are decidable by rational arithmetic and squaring the rational coefficients of after checking their signs. If either embedding is zero, injectivity of that embedding implies , and the output suffices. Thus the remaining case has both embeddings strictly positive. Choose by clearing the powers of two in the two coefficients of ; multiplication by the positive rational square preserves their signs.
Put and . Direct multiplication gives , , and . Norm two makes irreducible, hence prime by [F1]. As and are units, the last identity shows that has just the prime associate class of , with multiplicity four. Every element has a unique-factorization valuation at each prime associate class of , obtained from its integral numerator minus the valuations of its power-of-two denominator; only can be negative. Conjugation acts on these valuations by permuting the prime classes, since it is a ring automorphism. In particular, for a fixed class, .
If for , then , so all valuations of are nonnegative and . To see the last implication without any assumption on units of , write with ; its only possible denominator class is , and the valuation inequality says , hence . Consequently a solution to gives an integral solution to . Every conjugation-fixed prime exponent of must therefore be even. Conversely an integral solution for gives a solution for by division by . This proves both necessity of the parity test and completeness of the denominator-clearing reduction.
Factor nonzero by the finite algorithm of [F1]. Determine conjugation orbits by conjugating each factor and testing associates; and uniqueness of prime factorization imply that both classes in every two-element orbit occur with the same exponent. This is also an effective prime splitting test: each factor is assigned either to a fixed class or to a pair of distinct conjugate classes; no unproved classification by rational primes modulo eight is required. If a fixed exponent is odd, reject as justified in step 2.1. Otherwise, for each fixed class of exponent choose its displayed prime to power , and for each pair of exponent choose one displayed prime to power . Let be the product of these choices, with empty product one. Then and have exactly the same prime-class exponents.
Their quotient is a unit of by unique factorization, and is real. Its inverse is real too, so it is a unit of by [F1]. Both embeddings of are strictly positive, as are those of , so both embeddings of are positive. The unit-square construction of [F1] therefore returns with . Because , , and division by gives the claimed . All loops terminate: denominator clearing is finite, factorization terminates, associate tests are exact, the factor list is finite, and square-root recovery terminates for a positive real unit. Together with the rejection cases and necessity this proves the entire decision and construction claim.
Remarks
The proof supplies a complete terminating mode. Ross–Selinger Appendix C uses rational-prime splitting and modular square-root algorithms for a faster mode. Its expected polynomial runtime is a separate complexity assertion; it does not follow from the finite-search construction here.
Depends on
Used by
- Ancilla-free Clifford+T Rz approximation Algorithm
- Cyclotomic scaled grid and norm-equation solver Algorithm
- Prime norm numerators congruent to one modulo eight are solvable Corollary
- Efficient exact cyclotomic norm solving with a supplied integer factorization Theorem
- The Rz approximation procedure is correct when it returns Theorem
Dependency tree · two levels
5 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, Theorem 6.2 and Appendix C (standard reference, not scraped)