Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Finite coefficient bounds for the scaled cyclotomic grid

Statement

Let ∙ be the automorphism of K=Q(ω) defined in The nontrivial real-conjugation automorphism of the eighth cyclotomic field, so ω∙=−ω=ω5, and let u∈D∖{0} satisfy ∣u∣≤1 and ∣u∙∣≤1. Then k=sde⁡(u)≥0. If a=(2)ku=a0+a1ω+a2ω2+a3ω3, then

∣aj∣≤2k/2(0≤j≤3).

Thus for each fixed k only finitely many coefficient vectors can occur; the integer search may be restricted to ∣aj∣≤⌊2k/2⌋.

Facts & Assumptions

Given: K=Q(ω) has the four embeddings σj(ω)=ωj for j=1,3,5,7, complex conjugation pairs σ1 with σ7 and σ5 with σ3, and sde⁡ is the least square-root-of-two exponent.

[F1]

Dyadic cyclotomic ring for Clifford+T synthesis: O=Z[ω] has unique power-basis coefficients and D=O[1/2].

[F2]

The nontrivial real-conjugation automorphism of the eighth cyclotomic field: ∙ is the field automorphism ω↦ω5=−ω, fixes i, commutes with complex conjugation, and preserves D.

[F3]

Conjugate norms from the dyadic eighth-cyclotomic ring are real dyadics: for x=a0+a1ω+a2ω2+a3ω3∈O, xxˉ=P+2Q with P,Q∈Z.

Proof

1.1givenF2F3algebra

The two inequalities ∣u∣,∣u∙∣≤1, together with their complex conjugates, give ∣σj(u)∣≤1 for all four embeddings j=1,3,5,7; these are the identity, complex conjugation, ∙, and their composite by [F2]. If k=−m<0, the definition of k gives x=(2)ku=(2)−mu∈O, so u=(2)mx. Thus ∣σj(x)∣≤2−m/2 for every j. By [F3], xxˉ=P+2Q with P,Q∈Z. Since ∙ negates 2 and commutes with conjugation, the product of all four embeddings is ∏j=1,3,5,7σj(x)=(xxˉ)(x∙x∙‾)=(P+2Q)(P−2Q)=P2−2Q2. It is a nonzero integer because x≠0 and each embedding is injective. Its modulus is at most 2−2m<1, a contradiction. This proves k≥0.

2.1F1step 1.1algebra∎

For k≥0, set a=(2)ku∈O. Then ∣σj(a)∣≤2k/2 for every j. Fourier inversion in the power basis gives ar=14∑j∈{1,3,5,7}σj(a)ω−jr: expanding the sum, the coefficient of as is 14∑j oddωj(s−r), which equals 1 for s=r and 0 for distinct r,s∈{0,1,2,3}. Therefore ∣ar∣≤14∑j∣σj(a)∣≤2k/2. Since ar is an integer, it lies in the stated finite interval.

Remarks

This proves a finite search bound, not a running-time bound for deciding exact real inequalities at an arbitrary real input angle. The norm-equation step of Cyclotomic scaled grid and norm-equation solver is a separate procedure with its own locally proved correctness and complexity suppliers.

Depends on

Used by

Dependency tree · two levels

10 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