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.
Unit-modulus elements of the dyadic cyclotomic ring
Statement
If and , then for some .
Facts & Assumptions
Given: , , , and complex conjugation sends to .
Canonical dyadic coefficient encoding: every has a unique canonical numerator over a power of .
Square root of two divisibility criterion in the eighth cyclotomic ring: in iff in , and with for the integer coefficients of .
Proof
For nonzero , write its canonical form using [F1]. If , then , so in and [F2] gives for some . Whenever has with , the same argument gives and . Applying this for yields . All canonical coefficients of are then even, contradicting the minimality of . Thus and .
Write with integer coefficients. Direct multiplication gives , where and by [F2]. The numbers and are linearly independent over : if in lowest terms, then forces even and then even, a contradiction. Thus and . Four integer squares sum to only when exactly one coefficient is or and the others are zero. Hence .
Depends on
Used by
- Clifford+T denominator descent and finite base table Lemma
- Denominator exponent and optimal T count for determinant-one unitaries Lemma
- Normal form of a single-qubit ring unitary Lemma
- Exact single-qubit Clifford+T ring characterization Theorem
- The exact single-qubit compiler returns the input matrix Theorem
- Two-qubit determinant obstruction to controlled T 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
- Kliuchnikov, Maslov, and Mosca, Practical approximation of single-qubit unitaries by single-qubit quantum circuits (standard reference, not scraped)