Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Membership reduces to exact first-column synthesis

Open
QAlgorithms.Papers.Independent.Intakenext100.P03.first_column_reduction

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let nnn be a positive even integer. Put ζm=e2πi/m\zeta_m=e^{2\pi i/m}ζm​=e2πi/m, Rn=Z[ζ2n,1/2]R_n=\mathbb Z[\zeta_{2n},1/2]Rn​=Z[ζ2n​,1/2], Uz(θ)=diag⁡(1,eiθ)U_z(\theta)=\operatorname{diag}(1,e^{i\theta})Uz​(θ)=diag(1,eiθ), and Gn=⟨C,Uz(π/n)⟩G_n=\langle C,U_z(\pi/n)\rangleGn​=⟨C,Uz​(π/n)⟩, where C=⟨H0,S⟩C=\langle H_0,S\rangleC=⟨H0​,S⟩, H0=1+i2(111−1)H_0=\frac{1+i}{2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H0​=21+i​(11​1−1​) and S=diag⁡(1,i)S=\operatorname{diag}(1,i)S=diag(1,i). Write n=2ksn=2^ksn=2ks, with k≥1k\ge1k≥1 and positive odd sss, and assume 2t≡−1(mods)2^t\equiv-1\pmod s2t≡−1(mods) for some positive integer ttt. For every U∈U2(Rn)U\in U_2(R_n)U∈U2​(Rn​),

U∈Gn⟺∃V∈Gn: ∀b∈{0,1}, Vb0=Ub0.U\in G_n\quad\Longleftrightarrow\quad\exists V\in G_n:\ \forall b\in\{0,1\},\ V_{b0}=U_{b0}.U∈Gn​⟺∃V∈Gn​: ∀b∈{0,1}, Vb0​=Ub0​.

Column equality includes absolute phase. This reduction holds under the congruence condition, beyond the five small parameters.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P03
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P03

open scoped BigOperators Classical

-- Reuse the Mathlib matrix type without declaring a second Mat.

local notation "Mat" => Matrix Bool Bool ℂ

/-- Canonical data: the axis/exponent list and the actual residual matrix D,
not a nonunique phase/Clifford witness pair, PDF pp.6-7. -/
local notation "CanonicalData" => List (Fin 3 × ℕ) × Matrix Bool Bool ℂ

/-- Lemma 7.1, PDF pp.18-19: exact first-column equality, retaining phase,
under the congruence condition beyond the five small parameters. -/
theorem first_column_reduction (n k s : ℕ) (hk : 1 ≤ k) (hs : 0 < s)
    (hodd : Odd s) (hfactor : n = 2 ^ k * s) (hcong : MinusOneIsTwoPower s)
    (U : Mat) (hU : U ∈ ringUnitaries n) :
    U ∈ cyclotomicGroup n ↔ ∃ V ∈ cyclotomicGroup n,
      ∀ b : Bool, V b false = U b false := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P03

end
Source
Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets, arXiv:1501.04944v2, PDF p. 19, Lemma 7.1
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers n,k,sn,k,sn,k,s with k≥1k\ge1k≥1, s>0s>0s>0, sss odd, n=2ksn=2^k sn=2ks, and such that sss divides 2t+12^t+12t+1 for some natural number t>0t>0t>0, let RnR_nRn​ be the smallest subring of C\mathbb CC containing e2πi/(2n)e^{2\pi i/(2n)}e2πi/(2n) and 1/21/21/2. Let C\mathcal CC be the multiplicative submonoid generated by

H0=1+i2(111−1),S=diag⁡(1,i),H0†,S†,H_0=\frac{1+i}{2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}, \qquad S=\operatorname{diag}(1,i), \qquad H_0^\dagger,\qquad S^\dagger,H0​=21+i​(11​1−1​),S=diag(1,i),H0†​,S†,

and let Gn\mathcal G_nGn​ be the multiplicative submonoid generated by C\mathcal CC, Z(π/n)Z(\pi/n)Z(π/n), and Z(π/n)†Z(\pi/n)^\daggerZ(π/n)†, where Z(θ)=diag⁡(1,eiθ)Z(\theta)=\operatorname{diag}(1,e^{i\theta})Z(θ)=diag(1,eiθ); empty products are allowed. For every unitary complex 2×22\times22×2 matrix UUU whose entries belong to RnR_nRn​,

U∈Gn⟺∃V∈Gn  ∀b∈{false,true},Vb,false=Ub,false.U\in\mathcal G_n \quad\Longleftrightarrow\quad \exists V\in\mathcal G_n\ \ \forall b\in\{\mathrm{false},\mathrm{true}\}, \quad V_{b,\mathrm{false}}=U_{b,\mathrm{false}}.U∈Gn​⟺∃V∈Gn​  ∀b∈{false,true},Vb,false​=Ub,false​.

Thus the existential condition requires exact equality of the two entries of the column indexed by false\mathrm{false}false. The hypotheses allow s=1s=1s=1, for which the divisibility condition holds.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me