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.

Every Rz epsilon region contains an exact norm-solvable grid point

Statement

For θ∈R and 0<ε<1/2, there are u,t∈D such that ∣u∣≤1,∣u∙∣≤1,Re⁡(eiθ/2u)≥1−ε2/2,t†t=1−u†u. Thus the scaled grid has at least one candidate whose norm equation is solvable.

Facts & Assumptions

Given: The exact Clifford+T one-qubit matrices, D=Z[ω,1/2], the automorphism ∙, Rz(θ), and 0<ε<1/2. For scalar z, z†=zˉ.

[F1]

Determinant-one Clifford+T words are dense in SU(2): every SU(2) target has an exact determinant-one Clifford+T word within any positive operator-norm error.

[F2]

Dyadic cyclotomic ring for Clifford+T synthesis: D=Z[ω,1/2] is a subring of K=Q(ω).

[F3]

Clifford+T gate library and exact matrices: the exact displayed H,T,T† matrices are the one-qubit generators.

[F4]

The nontrivial real-conjugation automorphism of the eighth cyclotomic field: ∙ is a field automorphism of K that preserves D and commutes with complex conjugation.

[F5]

The exact operator-norm epsilon region for determinant-one Rz candidates: for U=(u−tˉtuˉ)∈SU(2), the operator-norm error bound is equivalent to the displayed real-part condition.

Proof

1.1F1F2F3givenchoose

By [F2,F3], the entries of T,T† lie in D. Also 2=ω−ω3 and 1/2=(ω−ω3)/2, so every entry of H lies in D. The ring D is closed under complex conjugation because ωˉ=ω−1=ω7∈D. Apply [F1] to Rz(θ)∈SU(2) and choose an exact word U with det⁡U=1 and ∥Rz(θ)−U∥op<ε. Every entry of U lies in D because each generator has entries in D and products of matrices over a subring remain over that subring. Let the first column be (u,t)T. It is a unit vector; its orthogonal unit vector (−tˉ,uˉ)T is therefore the second column up to a unit scalar λ. The determinant of the resulting matrix is λ, so det⁡U=1 forces λ=1. Hence U=(u−tˉtuˉ) and t†t=1−u†u.

2.1F4step 1.1algebra

Applying ∙ to U∗U=I preserves products and fixes I; [F4] also makes it commute with the adjoint. Thus U∙ is unitary, and its first-column norm gives ∣u∙∣2+∣t∙∣2=1. The original first column similarly gives ∣u∣2+∣t∣2=1, so ∣u∣,∣u∙∣≤1.

3.1F5step 1.1algebra∎

The strict approximation in step 1.1 and [F5] imply Re⁡(eiθ/2u)>1−ε2/2, hence the required weak inequality. Together with step 1.1 this gives a grid candidate and an exact solution of its norm equation.

Unresolved supplier checks

The actual QC12 projective-density proof and its Pauli-axis suppliers were inspected. Its normalized lifts are used only for projective density; the exact scalar phases are retained in the local matrix argument. This records interface reconciliation, not approval of those supplier drafts.

Depends on

Used by

Dependency tree · two levels

22 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