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.
The nontrivial real-conjugation automorphism of the eighth cyclotomic field
Definition
Let , where . The class is a unit modulo , so the cyclotomic Galois group supplier and gives the unique -automorphism with . It fixes and sends to . Complex conjugation and commute, as is checked on the generator . The four embeddings of are the identity, complex conjugation, , and their composite, because the Galois group consists of the four maps for . Since fixes and maps into , it preserves .
This is the nontrivial real-conjugation embedding used in the scaled-grid conditions; it is distinct from complex conjugation.
Depends on
Used by
- Cyclotomic scaled grid and norm-equation solver Algorithm
- Efficient exact-denominator Rz grid iterator Algorithm
- Clifford+T denominator descent and finite base table Lemma
- Constructive cyclotomic factorization and real unit squares Lemma
- Effective simultaneous grid uprighting of paired ellipses Lemma
- Every Rz epsilon region contains an exact norm-solvable grid point Lemma
- Exponent growth of the Rz scaled grid Lemma
- Finite coefficient bounds for the scaled cyclotomic grid Lemma
- One-dimensional quadratic grid enumeration and counting Lemma
- Size and residue of the Rz candidate norm integer Lemma
- Complete scaled-grid enumeration with expected polynomial prefix cost Theorem
- Constructive decision of the dyadic cyclotomic norm equation Theorem
- T-count guarantees for Clifford+T Rz synthesis Theorem
Dependency tree · two levels
14 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 (standard reference, not scraped)