Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equality or infinitude of the two z-rotation subgroups

Open
QAlgorithms.Papers.Independent.Intakenext100.P03.z_subgroup_dichotomy

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. Let DnD_nDn​ and Δn\Delta_nΔn​ be the actual z-rotation subgroups of GnG_nGn​ and U2(Rn)U_2(R_n)U2​(Rn​), respectively. Then

(∃t≥1: 2t≡−1(mods))⟹Δn=Dn={Uz(πj/n):0≤j<2n},¬(∃t≥1: 2t≡−1(mods))⟹∣Δn∣=∞  and Gn≠U2(Rn).\begin{aligned} (\exists t\ge1:\ 2^t\equiv-1\pmod s)&\Longrightarrow\Delta_n=D_n=\{U_z(\pi j/n):0\le j<2n\},\\ \neg(\exists t\ge1:\ 2^t\equiv-1\pmod s)&\Longrightarrow |\Delta_n|=\infty\ \text{ and }G_n\ne U_2(R_n). \end{aligned}(∃t≥1: 2t≡−1(mods))¬(∃t≥1: 2t≡−1(mods))​⟹Δn​=Dn​={Uz​(πj/n):0≤j<2n},⟹∣Δn​∣=∞  and Gn​=U2​(Rn​).​

This supplies an obstruction to full ring equality. The positive branch asserts only equality of the z-subgroups.

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 ℂ

/-- Corollary 5.4, PDF p.13. The congruence implies equality of z-subgroups,
not full-group equality; its failure implies infinity and full-group inequality. -/
theorem z_subgroup_dichotomy (n k s : ℕ) (hk : 1 ≤ k) (hs : 0 < s)
    (hodd : Odd s) (hfactor : n = 2 ^ k * s) :
    (MinusOneIsTwoPower s →
      zRotationsIn (ringUnitaries n) = zRotationsIn (cyclotomicGroup n : Set Mat) ∧
      zRotationsIn (ringUnitaries n) = finiteZRotations n) ∧
    (¬ MinusOneIsTwoPower s →
      (zRotationsIn (ringUnitaries n)).Infinite ∧
      (cyclotomicGroup n : Set Mat) ≠ ringUnitaries n) := 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. 13, Corollary 5.4
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 satisfying k≥1k\ge1k≥1, s>0s>0s>0, sss odd, and n=2ksn=2^k sn=2ks, define Z(θ)=diag⁡(1,eiθ)Z(\theta)=\operatorname{diag}(1,e^{i\theta})Z(θ)=diag(1,eiθ), let C\mathcal CC be the submonoid generated by 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​), S=diag⁡(1,i)S=\operatorname{diag}(1,i)S=diag(1,i), and their adjoints, and let GnG_nGn​ be generated by C,Z(π/n),Z(π/n)∗\mathcal C,Z(\pi/n),Z(\pi/n)^*C,Z(π/n),Z(π/n)∗. Let RnR_nRn​ be the subring of C\mathbb CC generated by exp⁡(2πi/(2n))\exp(2\pi i/(2n))exp(2πi/(2n)) and 1/21/21/2, let Un\mathcal U_nUn​ be the set of complex 2×22\times22×2 unitary matrices with every entry in RnR_nRn​, and for any set TTT of matrices put Z(T)={U∈T:∃θ∈R, U=Z(θ)}Z(T)=\{U\in T:\exists\theta\in\mathbb R,\ U=Z(\theta)\}Z(T)={U∈T:∃θ∈R, U=Z(θ)}. If some positive natural number ttt satisfies s∣2t+1s\mid2^t+1s∣2t+1, then both

Z(Un)=Z(Gn)andZ(Un)={Z(πj/n):j=0,…,2n−1}Z(\mathcal U_n)=Z(G_n) \qquad\text{and}\qquad Z(\mathcal U_n)=\{Z(\pi j/n):j=0,\ldots,2n-1\}Z(Un​)=Z(Gn​)andZ(Un​)={Z(πj/n):j=0,…,2n−1}

hold. If no such positive ttt exists, then Z(Un)Z(\mathcal U_n)Z(Un​) is infinite and Gn≠UnG_n\ne\mathcal U_nGn​=Un​ as sets of matrices. These statements concern exact matrices of the displayed diagonal form. The assumptions include s=1s=1s=1, in which case the first implication applies.

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