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.
Canonical dyadic coefficient encoding
Statement
Every has exactly one canonical dyadic encoding specified in Dyadic cyclotomic ring for Clifford+T synthesis.
Facts & Assumptions
Given: , , and .
Ring of integers of every cyclotomic field: for , is an integral basis of .
Proof
For , its definition gives for some and integer . Expand in the integral basis [F1]. Among all such exponents choose the least ; if and all four coefficients of were even, replacing by would contradict minimality. This gives an encoding of the required form.
Suppose are two canonical encodings. If , then , so every coefficient of is even, contrary to its canonical condition because . If , the same argument makes every coefficient of even. Hence , and then ; uniqueness of the four coefficients follows from the basis property [F1]. The zero element is represented only by the all-zero numerator, and minimality forces its exponent to be .
Remarks
The proof uses only the integral-basis statement for ; it does not use unique factorization of ideals or a choice axiom.
Depends on
Used by
- Cyclotomic scaled grid and norm-equation solver Algorithm
- Smallest square root of two denominator exponent Definition
- Conjugate norms from the dyadic eighth-cyclotomic ring are real dyadics Lemma
- Constructive cyclotomic factorization and real unit squares Lemma
- Denominator exponent is a well-defined integer Lemma
- Finite coefficient bounds for the scaled cyclotomic grid Lemma
- Unit-modulus elements of the dyadic cyclotomic ring Lemma
Cited to discharge well-definedness by Dyadic cyclotomic ring for Clifford+T synthesis.
Dependency tree · two levels
16 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
- Kliuchnikov, Maslov, and Mosca, Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates (standard reference, not scraped)