Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Size and residue of the Rz candidate norm integer

Statement

Let u∈D satisfy ∣u∣,∣u∙∣≤1, put ξ=1−u†u, and write ξ∙ξ=n/2ℓ with n∈Z and least ℓ≥0. Then n≥0, and either n=0 or n≡1(mod8). If u≠0 has least square-root-of-two denominator exponent k, then n≤4k.

Facts & Assumptions

Given: The displayed u,ξ,n,ℓ and the convention z†=zˉ for scalars.

[F1]

Dyadic cyclotomic ring for Clifford+T synthesis supplies the unique integral power basis of O and its localization D.

[F2]

The nontrivial real-conjugation automorphism of the eighth cyclotomic field fixes i, negates 2, and commutes with conjugation.

[F3]

For nonzero u satisfying the two disk bounds, Finite coefficient bounds for the scaled cyclotomic grid gives k=sde⁡(u)≥0 and bounds its scaled integral coefficients. Smallest square root of two denominator exponent defines this least exponent and sets sde⁡(0)=−∞.

Proof

1.1F1F2givenchoosealgebra

Put δ=1+ω and q=1+2. Direct multiplication gives δ2=q2ω, δ4=2q2i, and δ−1=(1−ω+ω2−ω3)/2. Since q−1=2−1∈O, these identities give D=O[δ−1]. Choose the least integer h≥0 such that u=x/δh with x=aω3+bω2+cω+d∈O. Multiplying x by the displayed inverse of δ shows that x/δ∈O exactly when a+b+c+d is even: each numerator coefficient is a signed sum of the four coefficients, and all four sums have the same parity. Thus if h>0, this sum is odd.

2.1F1F2step 1.1algebra

If h=0, the two disk conditions give ∣x∣2+∣x∙∣2=2(a2+b2+c2+d2)≤2. Consequently x=0 or x=±ωj for 0≤j≤3. If h=1, the same identity and ∣δ∣2+∣δ∙∣2=4 give a2+b2+c2+d2≤2; its parity is odd by minimality, so it equals 1. Then x is again a root of unity, contradicting ∣u∙∣2=1/(2−2)>1. Thus the cases h≤1 give only u=0 (where n=1) and the eight roots of unity (where n=0).

3.1F2step 1.1step 2.1algebra

For h≥2, multiplication gives x†x=A+B2, where A=a2+b2+c2+d2 and B=cd+bc+ab−da. The odd sum of coefficients makes A odd; also B≡(a+c)(b+d)≡0(mod2) since the two factors have opposite parity. Write (δ†δ)h=(2+2)h=C+D2. Both C,D are even, since (2+2)2=6+42. It follows that ξ=(X+Y2)/(2+2)h, with X=C−A odd and Y=D−B even. Taking real conjugates gives ξ∙ξ=(X2−2Y2)/2h. Its numerator is 1(mod8), hence odd, so this denominator is already minimal. This proves the residue assertion; nonnegativity follows from 0≤ξ,ξ∙≤1.

4.1F1F2F3step 3.1algebra∎

For nonzero u, write u=v/(2)k, v∈O. Then ξ=(2k−v†v)/2k, and 2k−v†v∈Z[2] by the same multiplication as in step 3.1. Therefore 22kξ∙ξ is an integer, whence ℓ≤2k. The inequality 0≤ξ∙ξ≤1 now yields n≤2ℓ≤4k.

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