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.
Exponent growth of the Rz scaled grid
Statement
Let , , and let be the distinct points in , ordered by nondecreasing least denominator exponent . Put . Then this sequence is infinite, , and More generally, if two bounded convex plane regions contain disks of radii , then for every integer the simultaneous grid has at least two points whenever .
Facts & Assumptions
Given: The rings , , and the displayed regions and ordering.
The nontrivial real-conjugation automorphism of the eighth cyclotomic field fixes and sends to ; Dyadic cyclotomic ring for Clifford+T synthesis contains in .
Smallest square root of two denominator exponent defines least denominator exponents; Finite coefficient bounds for the scaled cyclotomic grid makes every bounded exponent layer of the two unit disks finite.
Integer part: for every real there is exactly one integer with : for every real , the integer is within of .
Proof
Write and . For any integer , the unit (using for negative ) satisfies . For arbitrary real , solve the two real linear equations and for real and round each to an integer by [F3]. The resulting satisfies and . Applying this independently to real and imaginary coordinates gives, for arbitrary complex centers , a such that and .
Set . Choose the integer so that . If , then implies , while . Apply step 1.1 to centers of disks in and ; the latter disk has radius , since . Both and lie in the first disk: their errors are bounded by and . Their bullet images likewise lie in the second disk, since the corresponding errors are at most and . Dividing by gives two distinct simultaneous grid points.
Put . The disk centered at with radius lies in the unit disk and in the half plane by the triangle inequality. Take this as the disk in and the full unit disk as . Since , step 2.1 gives two candidates of exponent at most . Every candidate is nonzero because its displayed real part is positive; [F2] therefore gives nonnegative exponents and finitely many candidates through each fixed exponent. In particular .
If are grid points of exponent at most , then for every integer the points , , are distinct. They have exponent at most , and both their original and bullet images lie in the required convex regions, because rational coefficients are fixed by . Thus the grid is infinite. Together with finite layers this proves the existence of its stated enumeration, and taking gives the exponent bound.
Depends on
- Dyadic cyclotomic ring for Clifford+T synthesis
- The nontrivial real-conjugation automorphism of the eighth cyclotomic field
- Smallest square root of two denominator exponent
- Finite coefficient bounds for the scaled cyclotomic grid
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
Used by
Dependency tree · two levels
27 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, Lemmas 5.23 and 5.24 (standard reference, not scraped)