Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 θ∈R, 0<ε<1/2, and let u1,u2,… be the distinct points in G={u∈D:∣u∣,∣u∙∣≤1, Re⁡(eiθ/2u)≥1−ε2/2}, ordered by nondecreasing least denominator exponent kj. Put K=⌈log⁡2(512/ε2)⌉. Then this sequence is infinite, k2≤K, and kj≤k2+2⌈log⁡2j⌉(j≥1). More generally, if two bounded convex plane regions A,B contain disks of radii r,R>0, then for every integer k the simultaneous grid {u∈(2)−kO:u∈A, u∙∈B} has at least two points whenever 2krR≥128.

Facts & Assumptions

Given: The rings O=Z[ω], D=O[1/2], and the displayed regions and ordering.

[F1]

The nontrivial real-conjugation automorphism of the eighth cyclotomic field fixes i and sends 2 to −2; Dyadic cyclotomic ring for Clifford+T synthesis contains Z[2]+iZ[2] in O.

[F2]

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.

[F3]

Integer part: for every real x there is exactly one integer m with m≤x<m+1: for every real x, the integer ⌊x+1/2⌋ is within 1/2 of x.

Proof

1.1F1F3givenconstructalgebra

Write q=1+2 and C=(1+2)/2. For any integer m, the unit (using q−1=2−1 for negative m) λ=qm∈Z[2] satisfies ∣λ∙∣=λ−1. For arbitrary real x,y, solve the two real linear equations λ(a+2b)=x and λ∙(a−2b)=y for real a,b and round each to an integer by [F3]. The resulting α∈Z[2] satisfies ∣α−x∣≤Cλ and ∣α∙−y∣≤Cλ−1. Applying this independently to real and imaginary coordinates gives, for arbitrary complex centers z,w, a v∈O such that ∣v−z∣≤2Cλ and ∣v∙−w∣≤2Cλ−1.

2.1F1step 1.1choosealgebra

Set s=2k/2. Choose the integer m so that 42C/(sR)≤λ<4q2C/(sR). If s2rR≥128, then 32C2q=56+402<128 implies 2Cλ<sr/4, while 2Cλ−1≤sR/4. Apply step 1.1 to centers of disks in sA and (2)k∙B; the latter disk has radius sR, since ∣(2)k∙∣=s. Both v and v+λ lie in the first disk: their errors are bounded by sr/4 and sr/4+λ<sr/4+sr/(42C)<sr. Their bullet images likewise lie in the second disk, since the corresponding errors are at most sR/4 and sR/4+sR/(42C)<sR. Dividing by (2)k gives two distinct simultaneous grid points.

3.1F2step 2.1algebra

Put δ=ε2/2. The disk centered at (1−δ/2)e−iθ/2 with radius r=δ/2=ε2/4 lies in the unit disk and in the half plane Re⁡(eiθ/2u)≥1−δ by the triangle inequality. Take this as the disk in A and the full unit disk as B. Since 2Kr≥128, step 2.1 gives two candidates of exponent at most K. 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 k2≤K.

4.1F1F2step 3.1algebra∎

If u≠v are grid points of exponent at most k2, then for every integer ℓ≥0 the 2ℓ+1 points wh=(h/2ℓ)u+(1−h/2ℓ)v, 0≤h≤2ℓ, are distinct. They have exponent at most k2+2ℓ, 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 ℓ=⌈log⁡2j⌉ gives the exponent bound.

Depends on

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